Exercise 4.3: Subsets, Power Sets, and Universal Sets
Comprehensive guide and practice questions for CBSE Class 11 Applied Mathematics curriculum (2026-27).
4.3 Subsets, Power Sets, and Universal Sets
In Applied Mathematics and data modeling, understanding how sub-collections relate to broader populations is fundamental. Whether analyzing market segmentation, financial portfolios, or database filters, the mathematical formalisms of subsets, power sets, and universal sets provide the foundational logic.
Core Structural Theorems & Definitions
Subset (\(A \subseteq B\)): Set \(A\) is a subset of \(B\) if and only if every element belonging to \(A\) also belongs to \(B\):
\[ x \in A \implies x \in B \]
Proper Subset (\(A \subset B\) or \(A \subsetneq B\)): \(A\) is a proper subset of \(B\) if \(A \subseteq B\) and \(A \neq B\). This implies \(B\) contains at least one element not in \(A\).
Universal Properties:
Every set is a subset of itself: \(A \subseteq A\) for every set \(A\).
The empty set is a subset of every set: \(\emptyset \subseteq A\) for every set \(A\).
Total Number of Subsets: If a finite set \(A\) contains \(n\) elements (i.e., \(n(A) = n\)):
\[ \text{Total Subsets} = 2^n, \quad \text{Total Proper Subsets} = 2^n - 1 \]
Power Set (\(\mathcal{P}(A)\) or \(P(A)\)): The collection of all subsets of set \(A\):
\[ P(A) = \{ X : X \subseteq A \}, \quad n(P(A)) = 2^{n(A)} \]
Universal Set (\(U\)): A superset containing all objects or elements under consideration in a specific mathematical context.
1. Mathematical Precision: \(\in\) (Belongs to) vs \(\subseteq\) (Subset of)
One of the most frequent traps in set theory is conflating element membership (\(\in\)) with set inclusion (\(\subseteq\)).
An element \(x\) belongs to a set: \(x \in A\).
A set containing that element is a subset: \(\{x\} \subseteq A\).
Notice the critical case of nested sets: Let \(A = \{1, 2, \{3, 4\}, 5\}\).
\(\{3, 4\} \in A\) is True (it is an explicit element of \(A\)).
\(\{3, 4\} \subseteq A\) is False (3 and 4 are not individual elements of \(A\)).
\(\{\{3, 4\}\} \subseteq A\) is True (the set containing the element \(\{3, 4\}\) is a subset).
2. Subsets of Real Numbers: Interval Notation
In calculus, financial economics, and continuous business variables (such as price intervals, interest rate bounds, or profit ranges), subsets of the real number line \(\mathbb{R}\) are expressed as intervals:
Interval Notation
Set-Builder Definition
Geometric Representation on Real Line
Length
Closed: \([a, b]\)
\(\{x \in \mathbb{R} : a \le x \le b\}\)
Solid circles at both endpoints \(a\) and \(b\)
\(b - a\)
Open: \((a, b)\)
\(\{x \in \mathbb{R} : a < x < b\}\)
Hollow circles at endpoints \(a\) and \(b\)
\(b - a\)
Semi-Open / Right-Half-Open: \([a, b)\)
\(\{x \in \mathbb{R} : a \le x < b\}\)
Solid circle at \(a\), hollow circle at \(b\)
\(b - a\)
Semi-Closed / Left-Half-Open: \((a, b]\)
\(\{x \in \mathbb{R} : a < x \le b\}\)
Hollow circle at \(a\), solid circle at \(b\)
\(b - a\)
Infinite Ray: \([a, \infty)\)
\(\{x \in \mathbb{R} : x \ge a\}\)
Solid circle at \(a\), extending infinitely rightward
Infinite
3. The Power Set Hierarchy and Iterated Power Sets
The power set \(P(A)\) is always non-empty, even when \(A\) is the empty set:
If \(A = \emptyset\), then \(n(A) = 0\). Therefore \(P(\emptyset) = \{\emptyset\}\), with cardinality \(n(P(\emptyset)) = 2^0 = 1\).
For the second iteration: \(P(P(\emptyset)) = P(\{\emptyset\}) = \{\emptyset, \{\emptyset\}\}\), with cardinality \(2^1 = 2\).
For the third iteration: \(P(P(P(\emptyset))) = \{\emptyset, \{\emptyset\}, \{\{\emptyset\}\}, \{\emptyset, \{\emptyset\}\}\}\), with cardinality \(2^2 = 4\).
For the fourth iteration: \(n(P(P(P(P(\emptyset))))) = 2^4 = 16\).
Comprehensive Worked Example: Financial Portfolio Asset Allocation
Problem: A hedge fund can select any combination of investments from a basket of 4 assets: \(A = \{\text{Equities}, \text{Bonds}, \text{Gold}, \text{Real Estate}\}\).
How many distinct portfolio asset allocations (subsets) can be formulated?
How many active portfolios can be constructed containing at least one asset?
How many portfolios contain Equities?
If a regulatory constraint requires portfolios to contain between 2 and 3 assets inclusive, how many such valid portfolios exist?
Solution:
The total number of possible subsets of set \(A\) with \(n=4\) assets is:
\[ 2^n = 2^4 = 16 \text{ portfolios.} \]
This includes the cash-only portfolio \(\emptyset\) (investing in none of the 4 assets).
Active portfolios containing at least one asset exclude \(\emptyset\):
\[ 2^4 - 1 = 16 - 1 = 15 \text{ active portfolios.} \]
Portfolios containing Equities: We fix Equities in the portfolio. The remaining 3 assets can either be included or excluded in \(2^3 = 8\) ways. Hence, exactly 8 portfolios contain Equities.
Track your conceptual mastery and computational proficiency across Subsets, Power Sets, and Universal Sets.
Conceptual Milestones
Problem Solving Milestones
Practice Worksheet: Graded Exercises & Case Problems
Work through these graded problems from foundational mechanics to applied multi-stage scenarios.
Problem 1 (Foundational: Membership vs Inclusion)
Let \(A = \{1, 2, \{3, 4\}, 5\}\). Determine whether each of the following statements is True or False:
\(\{3, 4\} \subset A\)
\(\{\{3, 4\}\} \subset A\)
\(\{1, 2, 5\} \subseteq A\)
\(\emptyset \in A\)
\(\emptyset \subseteq A\)
View Step-by-Step Solution
Solution:
(a) False: The object \(\{3, 4\}\) is an element of \(A\) (i.e. \(\{3, 4\} \in A\)), not a subset. 3 and 4 are not separate elements of \(A\).
(b) True: Since \(\{3, 4\} \in A\), the set containing that element, \(\{\{3, 4\}\}\), is a valid subset of \(A\).
(c) True: The elements 1, 2, and 5 all belong individually to \(A\). Thus \(\{1, 2, 5\} \subseteq A\).
(d) False: The empty set \(\emptyset\) is not listed as an explicit element inside \(A\).
(e) True: The empty set is vacuously a subset of every set.
Problem 2 (Counting Subsets: Simultaneous Equations)
Two finite sets \(A\) and \(B\) have \(m\) and \(k\) elements respectively. The total number of subsets of \(A\) is 56 more than the total number of subsets of \(B\). Find the values of \(m\) and \(k\).
View Step-by-Step Solution
Solution:
The number of subsets of \(A\) is \(2^m\) and of \(B\) is \(2^k\). We are given:
\[ 2^m - 2^k = 56 \]
Since 56 is positive, \(m > k\). Factor out \(2^k\):
\[ 2^k (2^{m-k} - 1) = 56 \]
Express 56 as the product of a power of 2 and an odd integer:
\[ 56 = 8 \times 7 = 2^3 \times (2^3 - 1) \]
Equating the powers of 2 and the odd factors:
\[ 2^k = 2^3 \implies k = 3 \]
\[ 2^{m-k} - 1 = 7 \implies 2^{m-3} = 8 = 2^3 \implies m - 3 = 3 \implies m = 6 \]
Answer: \(m = 6\) and \(k = 3\).
(Verification: \(2^6 - 2^3 = 64 - 8 = 56\). Correct.)
Problem 3 (Interval Subsets of \(\mathbb{R}\))
Let \(A = [-3, 5)\) and \(B = (0, 7]\). Express the following in interval notation:
\(A \cap B\)
\(A \cup B\)
\(A - B\)
View Step-by-Step Solution
Solution:
(a) \(A \cap B\): The overlap of \([-3, 5)\) and \((0, 7]\) contains all real numbers \(x\) such that \(0 < x < 5\). In interval notation: \((0, 5)\).
(b) \(A \cup B\): The union spans from the minimum left endpoint \(-3\) (included) to the maximum right endpoint \(7\) (included). In interval notation: \([-3, 7]\).
(c) \(A - B\): Elements in \(A\) that are not in \(B\). Since \(B = (0, 7]\), removing \(B\) from \([-3, 5)\) leaves the interval from \(-3\) up to and including 0. In interval notation: \([-3, 0]\).
Problem 4 (Iterated Power Sets)
Find the cardinality of the power set \(P(P(P(A)))\) if \(A = \{x\}\) is a singleton set.
View Step-by-Step Solution
Solution:
Given \(n(A) = 1\):
\(n(P(A)) = 2^{n(A)} = 2^1 = 2\).
\(n(P(P(A))) = 2^{n(P(A))} = 2^2 = 4\).
\(n(P(P(P(A)))) = 2^{n(P(P(A)))} = 2^4 = 16\).
Answer: 16.
Quick Revision & Formula Cheat Sheet
Subset Quick Reference
\(A \subseteq B \iff (x \in A \implies x \in B)\)
\(\emptyset \subseteq A\) for any set \(A\)
\(A \subseteq A\) (Reflexivity of inclusion)
If \(A \subseteq B\) and \(B \subseteq A\), then \(A = B\)
If \(A \subseteq B\) and \(B \subseteq C\), then \(A \subseteq C\)
Counting Formulas
Total subsets of set with \(n\) elements: \(2^n\)
Total proper subsets: \(2^n - 1\)
Total non-empty subsets: \(2^n - 1\)
Subsets of size \(k\): \(\binom{n}{k} = \frac{n!}{k!(n-k)!}\)
Interval Types Summary
\([a, b]\): \(a \le x \le b\) (Both closed)
\((a, b)\): \(a < x < b\) (Both open)
\([a, b)\): \(a \le x < b\) (Left closed, right open)
\((a, b]\): \(a < x \le b\) (Left open, right closed)
Power Set Key Facts
\(P(A) = \{X : X \subseteq A\}\)
\(\emptyset \in P(A)\) and \(A \in P(A)\) always
\(n(P(A)) = 2^{n(A)}\)
If \(A = \emptyset\), \(P(A) = \{\emptyset\}\), \(n(P(A)) = 1\)
10-Question Diagnostic Mock Exam
Test your mastery of Subsets, Power Sets, Intervals, and Universal Sets under timed CBSE examination conditions.