GATE CSE
First time here? Checkout the FAQ!
x
+1 vote
121 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 (77.7k points)   | 121 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.4k points)  
edited by


Top Users Jun 2017
  1. Bikram

    3686 Points

  2. Hemant Parihar

    1480 Points

  3. junaid ahmad

    1432 Points

  4. Arnab Bhadra

    1334 Points

  5. Niraj Singh 2

    1311 Points

  6. Rupendra Choudhary

    1194 Points

  7. rahul sharma 5

    1110 Points

  8. Arjun

    916 Points

  9. srestha

    898 Points

  10. Debashish Deka

    896 Points

Monthly Topper: Rs. 500 gift card
Top Users 2017 Jun 19 - 25
  1. Bikram

    1942 Points

  2. Niraj Singh 2

    1306 Points

  3. junaid ahmad

    502 Points

  4. sudsho

    410 Points

  5. just_bhavana

    368 Points


23,347 questions
30,050 answers
67,326 comments
28,372 users