Consider the following relation on subsets of the set S of integers be...
According to the given information :
S1 is true because NULL set is smaller than every other set.
S2 is true because the UNIVERSAL set {1, 2, ..., 2014} is larger than every other set.
Thus, both S1 and S2 are true.
Please comment below if you find anything wrong in the above post.
View all questions of this test
Consider the following relation on subsets of the set S of integers be...
Given:
- Relation on subsets of the set S of integers between 1 and 2014.
- U V if the minimum element in the symmetric difference of the two sets is in U.
- S1: There is a subset of S that is larger than every other subset.
- S2: There is a subset of S that is smaller than every other subset.
To prove:
- Both S1 and S2 are true.
Explanation:
1. S1: There is a subset of S that is larger than every other subset.
Let's consider the power set of S, denoted as P(S), which contains all possible subsets of S. The size of P(S) is 2^2014, which is a finite number.
- Proof by contradiction:
Assume that there is no subset in S that is larger than every other subset. This means that for every subset U in S, there exists a subset V in S such that V is larger than U.
- Constructing a contradiction:
Consider the set S' that contains every element of S except for the minimum element. Since S' is a subset of S, it must also satisfy the relation U V. However, there is no subset in S that is larger than S' (as S' is missing the minimum element), which contradicts our assumption.
- Conclusion:
Hence, our assumption is false, and there must exist a subset of S that is larger than every other subset.
2. S2: There is a subset of S that is smaller than every other subset.
Let's consider the empty set, denoted as Ø. The empty set is a subset of every other set, including itself.
- Proof:
For any subset U in S, the symmetric difference between U and Ø is U itself, as Ø does not contain any elements. Therefore, the minimum element in the symmetric difference is in U, satisfying the relation U Ø.
Conclusion:
- Both S1 and S2 are true, as we have proved the existence of a subset of S that is larger than every other subset (S1) and a subset of S that is smaller than every other subset (S2). Hence, the correct answer is option A.
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).