Skip to content
Official PYQ · 2021

GATE CS 2021 Set 2 Q11 — Sets, Relations and Functions

Explain with AI

Consider the following sets, where n≥2n \geq 2:

  • S1S_1: Set of all n×nn \times n matrices with entries from the set {a,b,c}\{ a, b, c\}
  • S2S_2: Set of all functions from the set {0,1,2,…,n2−1}\{0,1,2, \dots, n^2-1\} to the set {0,1,2}\{0, 1, 2\}

Which of the following choice(s) is/are correct?

Select all correct options
View worked solution

Answer: B;C

To determine the relationship between the sets S1S_1 and S2S_2, let us find their cardinalities.

1. Cardinality of S1S_1

The set S1S_1 consists of all n×nn \times n matrices with entries from the set {a,b,c}\{a, b, c\}.

  • An n×nn \times n matrix has exactly n2n^2 positions.
  • Each position can be filled with any of the 33 elements from {a,b,c}\{a, b, c\}.

Therefore, the total number of such matrices is: ∣S1∣=3n2|S_1| = 3^{n^2}

2. Cardinality of S2S_2

The set S2S_2 consists of all functions from the domain D={0,1,2,…,n2−1}D = \{0, 1, 2, \dots, n^2-1\} to the codomain C={0,1,2}C = \{0, 1, 2\}.

  • The size of the domain is ∣D∣=n2|D| = n^2.
  • The size of the codomain is ∣C∣=3|C| = 3.

The total number of functions from DD to CC is: ∣S2∣=∣C∣∣D∣=3n2|S_2| = |C|^{|D|} = 3^{n^2}

Conclusion

Since both S1S_1 and S2S_2 are finite sets and have the exact same cardinality (∣S1∣=∣S2∣=3n2|S_1| = |S_2| = 3^{n^2}), there exists a bijection between them.

  • Since a bijection is always a surjection, there exists a surjection from S1S_1 to S2S_2 (Option B is correct).
  • There exists a bijection from S1S_1 to S2S_2 (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.

Published
Report a correction
Keep exploringMore Sets, Relations and Functions questions