GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
109 views

For a set $A$ define $\mathcal{P}(A)$ to be the set of all subsets of $A$. For example, if $A = \{1, 2\}$ then $\mathcal{P} (A) = \{ \emptyset, \{1, 2\}, \{1\}, \{ 2 \} \}$. Let $A \rightarrow \mathcal{P}(A)$ be a function and $A$ is not empty. Which of the following must be TRUE?

  1. $f$ cannot be one-to-one (injective)
  2. $f$ cannot be onto (surjective)
  3. $f$ is both one-to-one and onto (bijective)
  4. there is no such $f$ possible
  5. if such a function $f$ exists, then $A$ is infinite
asked in Set Theory & Algebra by Veteran (76k points)   | 109 views

1 Answer

+8 votes
Best answer

Even if it can be one-to-one in the following way,

But, It cannot be onto,because, the number of elements in domain $(A)$  $<$ the number of elements in co-domain ($P(A)$) . For a function to be onto, the domain should be able to cover all elements of co-domain with each element of the domain having exactly one image in co-domain.
so option(B)

answered by Veteran (11.5k points)  
edited by


Top Users Mar 2017
  1. rude

    4768 Points

  2. sh!va

    3054 Points

  3. Rahul Jain25

    2920 Points

  4. Kapil

    2734 Points

  5. Debashish Deka

    2592 Points

  6. 2018

    1544 Points

  7. Vignesh Sekar

    1422 Points

  8. Akriti sood

    1342 Points

  9. Bikram

    1312 Points

  10. Sanjay Sharma

    1126 Points

Monthly Topper: Rs. 500 gift card

21,508 questions
26,832 answers
61,091 comments
23,146 users