Skip to content
Official PYQ · 1993

GATE CS 1993 Q8.3 — Sets, Relations and Functions

Explain with AI

Let SS be an infinite set and S1…,SnS_1 \dots , S_n be sets such that S1∪S2∪⋯∪Sn=SS_1 \cup S_2 \cup \dots \cup S_n = S. Then

Choose one option
View worked solution

Answer: C

We are given that SS is an infinite set and is the union of nn sets:

S=S1∪S2∪⋯∪SnS = S_1 \cup S_2 \cup \dots \cup S_n

Let us analyze the properties of the sets SiS_i:

  • Proof for Option C: Suppose none of the sets SiS_i are infinite. This means every SiS_i (for 1≤i≤n1 \le i \le n) is a finite set. Since the union of a finite number of finite sets is always finite, the union S=⋃i=1nSiS = \bigcup_{i=1}^n S_i must also be finite. However, this contradicts the given fact that SS is an infinite set. Therefore, our assumption is false, and at least one of the sets SiS_i must be infinite.

We can eliminate the other options with simple counterexamples:

  • Option A is incorrect: Let S=ZS = \mathbb{Z} (the set of all integers, which is infinite). Let S1=even integersS_1 = \text{even integers} and S2=odd integersS_2 = \text{odd integers}. Both S1S_1 and S2S_2 are infinite, so neither is finite.
  • Option B is incorrect: Let S=ZS = \mathbb{Z}. Let S1={1}S_1 = \{1\}, S2={2}S_2 = \{2\}, and S3=Z∖{1,2}S_3 = \mathbb{Z} \setminus \{1, 2\}. Here, two sets (S1S_1 and S2S_2) are finite.
  • Option D is incorrect: In the counterexample for Option A, both S1S_1 and S2S_2 are infinite, showing that more than one set can be infinite.

Free practice · Your answers on this page are not saved.

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