Consider the following sets, where :
- : Set of all matrices with entries from the set
- : Set of all functions from the set to the set
Which of the following choice(s) is/are correct?
View worked solution
Answer: B;C
To determine the relationship between the sets and , let us find their cardinalities.
1. Cardinality of
The set consists of all matrices with entries from the set .
- An matrix has exactly positions.
- Each position can be filled with any of the elements from .
Therefore, the total number of such matrices is:
2. Cardinality of
The set consists of all functions from the domain to the codomain .
- The size of the domain is .
- The size of the codomain is .
The total number of functions from to is:
Conclusion
Since both and are finite sets and have the exact same cardinality (), there exists a bijection between them.
- Since a bijection is always a surjection, there exists a surjection from to (Option B is correct).
- There exists a bijection from to (Option C is correct).
- Options A and D are incorrect because a bijection (and hence an injection) does exist.
Free practice · Your answers on this page are not saved.
