retagged by
2,177 views
14 votes
14 votes

For a set $A$ define $P(A)$ to be the set of all subsets of $A$. For example, if $A = \{1, 2\}$ then $P(A) = \{ \emptyset, \{1, 2\}, \{1\}, \{ 2 \} \}$. Let $A \rightarrow 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
retagged by

2 Answers

Best answer
23 votes
23 votes

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)$

edited by
2 votes
2 votes

If the number of elements in Co-domain is greater than number of elements of domain, then the function cannot be onto...

If the number of elements in domain is greater than codomain,then the function cannot be one-to-one.

Here number of elements in co-domain is greater than domain,so obviously there will be atleast one element in co-domain which will not have a preimage in the domain. But it can be one-to-one... 

So Option B)

Answer:

Related questions

15 votes
15 votes
2 answers
2
go_editor asked Dec 21, 2016
2,083 views
How many distinct words can be formed by permuting the letters of the word $\text{ABRACADABRA}?$$\frac{11!}{5! \: 2! \: 2!}$$\frac{11!}{5! \: 4! }$$11! \: 5! \: 2! \: 2!\...