[Set Theory: Practice Lab ①] Set Notations, Membership vs Inclusion ($\in$ vs $\subset$), and Subsets & Power Sets: 15 Advanced Killer Problems & Self-Diagnosis
Following our theoretical study in [Set Theory: Masterclass ①], where we explored the historical necessity of Cantor's set theory, the strict distinction between element membership ($\in$) and subset containment ($\subset$), the binary combinatorial derivation of $2^n$ subsets, and the formal definition of the Power Set $\mathcal{P}(A)$, we now step into high-level problem solving.
Top-tier competitive mathematics and college entrance exams (including SAT Math Module 2, IB Math AA HL, AMC, and AP Calculus) rarely test trivial listing. Instead, they disguise algebraic root counts inside set-builder notation $\{x \mid P(x)\}$, formulate intricate true/false propositions with nested power sets and empty sets, and test combinatorial contributions (sum and product of all subsets).
In this Practice Lab, we dismantle 15 Advanced Killer Problems alongside their 1:1 Parallel Self-Diagnosis Variants. Work through each problem step by step before opening the solution toggles.
1. Identify the Representative Element in $\{x \mid P(x)\}$ First: Before analyzing the predicate $P(x)$, determine whether $x$ represents a real number, an ordered pair $(a, b)$, a function, or another set.
2. Peel Off Braces for Containment ($\subset$): For element verification ($\in$), check if the exact symbol sequence exists inside the outer braces. For subset verification ($\subset$), strip off the outermost pair of curly braces $\{ \}$ and confirm that every remaining member belongs to the parent set.
3. Count by 'Element Contribution': When evaluating the sum or product of elements across all subsets, never list them individually. Instead, count the exact number of subsets containing each specific element ($2^{n-1}$) and evaluate globally.
Theme 1. Algebraic & Geometric Locus via Set-Builder Notation (01 ~ 03)
[Problem 01] Real Root Cardinality of a Parameterized Equation
For a real parameter $a$, define set $A = \{ x \mid ax^2 + 2(a - 2)x + (a - 2) = 0, \, x \in \mathbb{R} \}$. Determine the sum of all real values of $a$ such that $n(A) = 1$.
🔍 Solution & Step-by-Step Breakdown
Answer: $2$
[Step-by-Step Solution]
The elements of $A$ are the distinct real roots of the given equation. Condition $n(A) = 1$ dictates that there is exactly one real root.
Case 1: $a = 0$ (Linear Equation)
$$0 \cdot x^2 + 2(-2)x + (-2) = 0 \implies -4x - 2 = 0 \implies x = -\dfrac{1}{2}$$
The equation has a unique real root $x = -1/2$, so $A = \{ -1/2 \}$ and $n(A) = 1$. Thus, $\mathbf{a = 0}$ is valid.
Case 2: $a \ne 0$ (Quadratic Equation with Double Root)
For a quadratic to yield exactly one real root, its discriminant must vanish ($D/4 = 0$):
$$D/4 = (a - 2)^2 - a(a - 2) = (a - 2)\{(a - 2) - a\} = -2(a - 2) = 0 \implies a = 2$$
Since $a = 2 \ne 0$, this yields a valid double root. Thus, $\mathbf{a = 2}$ is valid.
Summing all possible values: $0 + 2 = \mathbf{2}$.
Unless the problem explicitly labels it a "quadratic equation," always branch on whether the leading coefficient equals $0$ ($a = 0$) first. Overlooking the linear case is the single most common source of error.
🎯 [Self-Diagnosis Variant 01] (Linear vs Quadratic Branching)
Find the sum of all real values of $k$ such that set $B = \{ x \mid (k - 1)x^2 + 2kx + (k + 2) = 0, \, x \in \mathbb{R} \}$ satisfies $n(B) = 1$.
View Variant Solution
Breakdown: When $k = 1$, the linear equation yields $x = -3/2$ ($n(B) = 1$). When $k \ne 1$, setting $D/4 = k^2 - (k-1)(k+2) = -k + 2 = 0 \implies k = 2$. Sum: $1 + 2 = \mathbf{3}$.
[Problem 02] Cardinality of a Linear Functional on Lattice Points
Given the universal set of integers $\mathbb{Z}$, define sets $A$ and $B$ as follows:
$A = \{ (x, y) \mid x^2 + y^2 \le 4, \, x, y \in \mathbb{Z} \}$,
$B = \{ x + y \mid (x, y) \in A \}$.
Determine the cardinality $n(B)$.
🔍 Solution & Step-by-Step Breakdown
Answer: $5$
[Step-by-Step Solution]
1) Set $A$ consists of all integer lattice points $(x, y)$ enclosed by or on the circle $x^2 + y^2 \le 4$.
2) Set $B$ collects the values $k = x + y$. Geometrically, $x + y = k \iff y = -x + k$ represents a line with slope $-1$ intersecting the disk.
3) Enforcing distance from origin $d \le 2$:
$$\dfrac{|k|}{\sqrt{1^2 + 1^2}} \le 2 \implies |k| \le 2\sqrt{2} \approx 2.828$$
4) Since $x, y \in \mathbb{Z}$, $k$ must be an integer: $k \in \{ -2, -1, 0, 1, 2 \}$.
Testing extreme lattice coordinates: $(0, 2) \to 2$, $(0, 1) \to 1$, $(0, 0) \to 0$, $(0, -1) \to -1$, $(0, -2) \to -2$. All five values exist.
Thus, $B = \{ -2, -1, 0, 1, 2 \}$ and $n(B) = \mathbf{5}$.
Do not list and sum lattice points one by one. Treating $x + y = k$ as a family of parallel linear level curves bounding the region instantly reveals the extreme values of $k$.
🎯 [Self-Diagnosis Variant 02] (Lattice Diamond Product Set)
Given $A = \{ (x, y) \mid |x| + |y| \le 2, \, x, y \in \mathbb{Z} \}$, determine $n(C)$ where $C = \{ xy \mid (x, y) \in A \}$.
View Variant Solution
Breakdown: Possible products $xy$ are $0$ (along axes), $1$ from $(\pm 1, \pm 1)$, and $-1$ from $(\pm 1, \mp 1)$. Thus, $C = \{ -1, 0, 1 \} \implies n(C) = \mathbf{3}$.
[Problem 03] Set Equality Connected to Polynomial Roots
Given sets $A = \{ x \mid x^3 - 3x^2 + ax + b = 0 \}$ and $B = \{ 1, 2, c \}$, find the value of $a + b + c$ such that $A = B$.
🔍 Solution & Step-by-Step Breakdown
Answer: $2$
[Step-by-Step Solution]
1) Set equality $A = B$ requires that $1, 2, c$ are the three distinct real roots of $x^3 - 3x^2 + ax + b = 0$.
2) Applying Vieta's formulas:
• Sum of roots: $1 + 2 + c = -(-3) = 3 \implies 3 + c = 3 \implies \mathbf{c = 0}$.
3) With roots fixed at $0, 1, 2$:
• Pairwise sum: $0 \cdot 1 + 1 \cdot 2 + 2 \cdot 0 = a \implies \mathbf{a = 2}$.
• Product of roots: $0 \cdot 1 \cdot 2 = -b \implies \mathbf{b = 0}$.
4) Evaluating the sum: $a + b + c = 2 + 0 + 0 = \mathbf{2}$.
Do not substitute roots into the cubic polynomial to solve a system. Vieta's formula for the sum of roots solves $c$ in one step, after which the coefficients follow instantly.
🎯 [Self-Diagnosis Variant 03] (Vieta's Invariance in Equal Sets)
Find $k$ such that $A = \{ x \mid x^3 + kx - 6 = 0 \}$ and $B = \{ 1, 2, m \}$ are equal.
View Variant Solution
Breakdown: Since the $x^2$ coefficient is $0$, sum of roots $1 + 2 + m = 0 \implies m = -3$. Product $1 \cdot 2 \cdot (-3) = -6$ checks out. Pairwise sum $k = 2 - 3 - 6 = \mathbf{-11}$.
Theme 2. Multi-Tiered Brackets ($\in$ vs $\subset$) & Power Sets (04 ~ 07)
[Problem 04] Decoupling Multi-Layered Brackets (Error Rate 65%)
Consider the set $S = \{ \emptyset, \{ \emptyset \}, 1, \{ 1 \}, \{ \emptyset, 1 \} \}$. Identify all true propositions among the following:
(A) $\{ \emptyset \} \in S$ and $\{ \emptyset \} \subset S$
(B) $\{ \{ 1 \} \} \subset S$ and $\{ 1, \{ 1 \} \} \subset S$
(C) $n(S) = 5$ and $\{ \emptyset, 1 \} \subset S$
🔍 Solution & Step-by-Step Breakdown
Answer: (A), (B), (C) (All statements are true)
[Step-by-Step Verification]
Set $S$ contains exactly 5 elements: ① $\emptyset$, ② $\{\emptyset\}$, ③ $1$, ④ $\{1\}$, ⑤ $\{\emptyset, 1\}$.
• (A): $\{\emptyset\}$ appears verbatim as element ② $\implies \{\emptyset\} \in S$ (True). Enclosing element ① $\emptyset$ in braces creates subset $\{\emptyset\} \subset S$ (True).
• (B): Since $\{1\} \in S$, wrapping it in outer braces forms subset $\{\{1\}\} \subset S$ (True). Since $1 \in S$ and $\{1\} \in S$, their combination forms subset $\{1, \{1\}\} \subset S$ (True).
• (C): $n(S) = 5$ is verified. Since $\emptyset \in S$ and $1 \in S$, subset $\{\emptyset, 1\} \subset S$ is valid (True).
All three propositions are true.
An object like $\{\emptyset, 1\}$ can simultaneously be an element ($\in S$) and a subset ($\subset S$) if its individual constituents $\emptyset$ and $1$ are also separate elements of $S$.
🎯 [Self-Diagnosis Variant 04] (Power Set Inclusion Translation)
For $A = \{ a, \{a\} \}$, determine whether $\{ \{a\} \} \in \mathcal{P}(A)$ is true or false.
View Variant Solution
Breakdown: Since $\{a\} \in A$, wrapping it in braces gives $\{\{a\}\} \subset A$. By the definition of the power set, $\{\{a\}\} \in \mathcal{P}(A)$ is True.
[Problem 05] Power Set Axioms and Closure Invariance
For any non-empty set $A$ and its power set $\mathcal{P}(A) = \{ X \mid X \subset A \}$, determine all universally true statements among the following:
(A) $\emptyset \in \mathcal{P}(A)$ and $\emptyset \subset \mathcal{P}(A)$
(B) $A \in \mathcal{P}(A)$ and $\{ A \} \subset \mathcal{P}(A)$
(C) If $X \in \mathcal{P}(A)$ and $Y \in \mathcal{P}(A)$, then $X \cup Y \in \mathcal{P}(A)$
🔍 Solution & Step-by-Step Breakdown
Answer: (A), (B), (C)
[Step-by-Step Verification]
• (A): Since $\emptyset \subset A$, $\emptyset \in \mathcal{P}(A)$ is true. The empty set is also universally a subset of any set, so $\emptyset \subset \mathcal{P}(A)$ is true. (A is True)
• (B): Since $A \subset A$, $A \in \mathcal{P}(A)$ is true. Wrapping this element in braces yields singleton subset $\{A\} \subset \mathcal{P}(A)$. (B is True)
• (C): $X \in \mathcal{P}(A) \implies X \subset A$, and $Y \in \mathcal{P}(A) \implies Y \subset A$. The union of two subsets of $A$ remains a subset of $A$ ($X \cup Y \subset A$). Therefore, $X \cup Y \in \mathcal{P}(A)$ holds unconditionally. (C is True)
Statement (C) asserts the closure property of the power set under finite unions (and intersections). Any Boolean combination of subsets of $A$ is guaranteed to remain an element of $\mathcal{P}(A)$.
🎯 [Self-Diagnosis Variant 05] (Monotonicity of Power Sets)
Prove or evaluate whether $A \subset B \implies \mathcal{P}(A) \subset \mathcal{P}(B)$ is universally valid.
View Variant Solution
Breakdown: For any $X \in \mathcal{P}(A)$, $X \subset A$. Since $A \subset B$, by transitivity $X \subset B$, meaning $X \in \mathcal{P}(B)$. Thus $\mathcal{P}(A) \subset \mathcal{P}(B)$.
[Problem 06] Higher-Order Power Set Subset Combinations
For set $A = \{ 1, 2 \}$, find the number of subsets of the power set $\mathcal{P}(A)$ that contain exactly $2$ elements.
🔍 Solution & Step-by-Step Breakdown
Answer: $6$
[Step-by-Step Solution]
1) Since $n(A) = 2$, its power set contains $2^2 = 4$ elements:
$$\mathcal{P}(A) = \{ \emptyset, \{1\}, \{2\}, \{1, 2\} \}$$
2) The problem asks for the number of subsets of $\mathcal{P}(A)$ of size $2$.
This is identical to choosing $2$ elements out of $4$:
$$\binom{4}{2} = \dfrac{4 \times 3}{2 \times 1} = \mathbf{6}$$
Do not get intimidated by nested power set notations. Replace the sub-elements with abstract tokens $\{X_1, X_2, X_3, X_4\}$ and compute via standard combinatorics.
🎯 [Self-Diagnosis Variant 06] (Second-Order Power Set Cardinality)
For singleton $A = \{ 1 \}$, find the total number of subsets of $\mathcal{P}(\mathcal{P}(A))$.
View Variant Solution
Breakdown: $n(A) = 1 \implies n(\mathcal{P}(A)) = 2^1 = 2 \implies n(\mathcal{P}(\mathcal{P}(A))) = 2^2 = 4$. Total number of subsets is $2^4 = \mathbf{16}$.
[Problem 07] Deduplicating Elements in a Derived Power Sum Set
For $A = \{ 1, 2, 3 \}$, evaluate the sum of the elements of each non-empty subset in $\mathcal{P}(A)$ to construct a new set $S$. Determine the sum of all distinct elements in set $S$.
🔍 Solution & Step-by-Step Breakdown
Answer: $21$
[Step-by-Step Solution]
1) Set $A$ has $2^3 - 1 = 7$ non-empty subsets.
2) Evaluate the element sum for each subset:
• Size 1: $\{1\} \to 1, \{2\} \to 2, \{3\} \to 3$
• Size 2: $\{1, 2\} \to 3, \{1, 3\} \to 4, \{2, 3\} \to 5$
• Size 3: $\{1, 2, 3\} \to 6$
3) By set definition, duplicate values must be merged: $S = \{ 1, 2, 3, 4, 5, 6 \}$.
4) Summing all elements of $S$: $1 + 2 + 3 + 4 + 5 + 6 = \mathbf{21}$.
Do not confuse "the sum of all subset sums" (Problem 12) with "the sum of the elements in the derived set $S$." A set discards repeated values ($3$ appears twice but counts once).
🎯 [Self-Diagnosis Variant 07] (Derived Subset Product Set)
For $A = \{ 2, 4 \}$, let $M$ be the set of all products of elements from non-empty subsets of $A$. Find the sum of all elements of $M$.
View Variant Solution
Breakdown: Products are $\{2\} \to 2, \{4\} \to 4, \{2, 4\} \to 8$. Set $M = \{ 2, 4, 8 \}$. Sum is $2 + 4 + 8 = \mathbf{14}$.
Theme 3. Constrained Subset Counting & Divisibility (08 ~ 11)
[Problem 08] The Sandwich Containment Constraint $A \subset X \subset B$
Given $A = \{ 1, 2 \}$ and $B = \{ 1, 2, 3, 4, 5, 6, 7 \}$, find the number of sets $X$ satisfying $A \subset X \subset B$ such that $X \ne A$ and $X \ne B$.
🔍 Solution & Step-by-Step Breakdown
Answer: $30$
[Step-by-Step Solution]
1) Condition $A \subset X \subset B$ means $X$ is a subset of $B$ that must contain elements $1$ and $2$.
2) Elements $\{1, 2\}$ have their choice fixed ($1$ outcome). The remaining $7 - 2 = 5$ elements choose freely:
$$\text{Total Candidates} = 2^{7 - 2} = 2^5 = 32$$
3) Subtracting the boundary exclusions ($X \ne A$ and $X \ne B$):
$$32 - 2 = \mathbf{30}$$
The sandwich relation $A \subset X \subset B$ is structurally isomorphic to counting all subsets of the difference set $B \setminus A$. Be careful with strict inequalities at both endpoints.
🎯 [Self-Diagnosis Variant 08] (Minimum Cardinality Sandwich)
Find the number of sets $X$ satisfying $\{ a, b \} \subset X \subset \{ a, b, c, d, e \}$ such that $n(X) \ge 3$.
View Variant Solution
Breakdown: Total candidates $2^{5 - 2} = 8$. Subtract the single case where $n(X) = 2$ ($X = \{a, b\}$): $8 - 1 = \mathbf{7}$.
[Problem 09] Subsets Containing at Least Two Prime Numbers
Find the number of subsets of $A = \{ 1, 2, 3, 4, 5, 6, 7, 8 \}$ that contain at least two prime numbers.
🔍 Solution & Step-by-Step Breakdown
Answer: $176$
[Step-by-Step Solution]
1) Partition $A$: Primes $P = \{ 2, 3, 5, 7 \}$ ($4$ elements), Non-primes $C = \{ 1, 4, 6, 8 \}$ ($4$ elements). Total subsets $= 2^8 = 256$.
2) Apply complementary counting (subsets with $0$ or $1$ prime):
• $0$ Primes: Formed strictly from non-primes $\implies 2^4 = 16$.
• $1$ Prime: Choose $1$ prime from $4$, and choose freely from non-primes $\implies \binom{4}{1} \times 2^4 = 4 \times 16 = 64$.
3) Subtracting the complement from total:
$$256 - (16 + 64) = 256 - 80 = \mathbf{176}$$
Whenever a condition states "at least $k$" where $k \ge 2$, computing the total minus the cases with $0, 1, \dots, k-1$ occurrences prevents calculating multiple binomial expansions.
🎯 [Self-Diagnosis Variant 09] (Joint Parity Condition)
Find the number of subsets of $\{ 1, 2, 3, 4, 5, 6 \}$ containing at least one odd and at least one even number.
View Variant Solution
Breakdown: Total $2^6 = 64$. Purely odd subsets $2^3 - 1 = 7$, purely even subsets $2^3 - 1 = 7$, empty set $1$. $64 - (7 + 7 + 1) = \mathbf{49}$.
[Problem 10] Subsets with Element Product Divisible by 4
Find the number of non-empty subsets of $A = \{ 1, 2, 3, 4, 5, 6, 7 \}$ whose element product is a multiple of $4$.
🔍 Solution & Step-by-Step Breakdown
Answer: $80$
[Step-by-Step Solution]
1) Classify elements by factors of $2$:
• Multiple of 4: $\{ 4 \}$ ($1$ element)
• Multiples of 2 but not 4: $\{ 2, 6 \}$ ($2$ elements)
• Odd numbers: $\{ 1, 3, 5, 7 \}$ ($4$ elements)
Total non-empty subsets $= 2^7 - 1 = 127$.
2) Count the complement (product is NOT divisible by 4):
• Product is odd: Formed strictly from odds $\implies 2^4 - 1 = 15$.
• Product has exactly one factor of 2: Contains exactly one of $\{2, 6\}$, excludes $4$, and includes any odds $\implies 2 \times 2^4 = 32$.
3) Total complement subsets $= 15 + 32 = 47$.
$$\text{Target Subsets} = 127 - 47 = \mathbf{80}$$
Divisibility by $4$ requires keeping track of prime valuations $\nu_2$. Classifying elements by their powers of 2 ($2^0, 2^1, 2^2$) makes the complementary accounting foolproof.
🎯 [Self-Diagnosis Variant 10] (Even Product Subset Counting)
Find the number of non-empty subsets of $\{ 1, 2, 3, 4, 5 \}$ whose element product is even.
View Variant Solution
Breakdown: Total $2^5 - 1 = 31$. Subsets with strictly odd product $2^3 - 1 = 7$. $31 - 7 = \mathbf{24}$.
[Problem 11] Multiplier Set Containment and LCM Invariance
Let $A_k = \{ x \mid x = kn, \, n \in \mathbb{N} \}$ represent the set of multiples of natural number $k$. If $A_2 \cap A_3 = A_p$ and $A_q \subset (A_4 \cup A_6)$, find the minimum value of $p + q$ for positive integers $p, q$.
🔍 Solution & Step-by-Step Breakdown
Answer: $18$
[Step-by-Step Solution]
1) Intersection: Common multiples of $2$ and $3$ are multiples of $\operatorname{lcm}(2, 3) = 6$. Thus, $A_2 \cap A_3 = A_6 \implies \mathbf{p = 6}$.
2) Containment $A_q \subset (A_4 \cup A_6)$: Every multiple of $q$ must be a multiple of $4$ or a multiple of $6$.
For an entire infinite arithmetic progression to be contained in the union, $A_q$ must be fully contained in one of the sets or their intersection.
The minimal base step ensuring all multiples fall into $A_4$ or $A_6$ is the common multiple $\operatorname{lcm}(4, 6) = 12$.
Since $A_{12} \subset A_4 \subset (A_4 \cup A_6)$, the smallest valid $q$ is $\mathbf{12}$.
3) Evaluating sum: $p + q = 6 + 12 = \mathbf{18}$.
• Intersection is Least Common Multiple: $A_a \cap A_b = A_{\operatorname{lcm}(a, b)}$
• Containment is Divisibility Inversion: $A_m \subset A_n \iff m \text{ is a multiple of } n$.
🎯 [Self-Diagnosis Variant 11] (Divisor Inversion in Multiplier Sets)
Find the largest integer $m \ne 18$ such that $A_{18} \subset A_m$.
View Variant Solution
Breakdown: $A_{18} \subset A_m \iff 18$ is a multiple of $m \iff m$ is a proper divisor of $18$. The largest proper divisor is $\mathbf{9}$.
Theme 4. Global Subset Sums, Extrema & Composite Systems (12 ~ 15)
[Problem 12] Global Sum of All Subset Elements
Let $X_1, X_2, \dots, X_{32}$ represent all 32 subsets of $A = \{ 1, 2, 3, 4, 5 \}$. If $S(X_k)$ denotes the sum of the elements in subset $X_k$, evaluate $\sum_{k=1}^{32} S(X_k)$.
🔍 Solution & Step-by-Step Breakdown
Answer: $240$
[Step-by-Step Solution]
1) Rather than summing subsets individually, count the frequency of each individual element across all subsets.
2) Element $1$ appears in exactly $2^{5 - 1} = 2^4 = 16$ distinct subsets.
3) By symmetry, every element $x \in \{1, 2, 3, 4, 5\}$ appears exactly $16$ times.
4) Multiplying the sum of elements by the appearance factor:
$$\text{Global Sum} = (1 + 2 + 3 + 4 + 5) \times 16 = 15 \times 16 = \mathbf{240}$$
For any set with $n$ elements, the sum of all elements across all subsets is universally given by: $$\sum S(X) = (\text{Sum of all elements in } A) \times 2^{n - 1}$$
🎯 [Self-Diagnosis Variant 12] (Even Number Global Subset Sum)
Evaluate the sum of all elements across all subsets of $A = \{ 2, 4, 6, 8 \}$.
View Variant Solution
Breakdown: Sum of elements is $2 + 4 + 6 + 8 = 20$. Each element appears $2^{4 - 1} = 8$ times. Total sum: $20 \times 8 = \mathbf{160}$.
[Problem 13] Sum of Maximum Elements Across All Subsets (Contest Level)
For each non-empty subset $X$ of $A = \{ 1, 2, 3, 4, 5 \}$, let $M(X)$ denote the maximum element in $X$. Evaluate the sum of $M(X)$ across all non-empty subsets.
🔍 Solution & Step-by-Step Breakdown
Answer: $129$
[Step-by-Step Solution]
Group subsets by their maximum element $k \in \{1, 2, 3, 4, 5\}$:
• $M(X) = 5$: Must contain $5$; elements smaller than $5$ choose freely $\implies 2^4 = 16$ subsets. Contribution: $5 \times 16 = 80$.
• $M(X) = 4$: Must contain $4$, excludes $5$; $\{1, 2, 3\}$ choose freely $\implies 2^3 = 8$ subsets. Contribution: $4 \times 8 = 32$.
• $M(X) = 3$: Must contain $3$, excludes $\{4, 5\}$ $\implies 2^2 = 4$ subsets. Contribution: $3 \times 4 = 12$.
• $M(X) = 2$: Must contain $2$, excludes $\{3, 4, 5\}$ $\implies 2^1 = 2$ subsets. Contribution: $2 \times 2 = 4$.
• $M(X) = 1$: Subset $\{1\}$ alone $\implies 1$ subset. Contribution: $1 \times 1 = 1$.
Total sum: $80 + 32 + 12 + 4 + 1 = \mathbf{129}$.
For maximum/minimum problems across subsets, fix the extremum value and exclude all larger (or smaller) candidates. The count follows geometric powers of 2 ($2^4, 2^3, 2^2, \dots$).
🎯 [Self-Diagnosis Variant 13] (Sum of Minimum Elements)
For non-empty subsets of $A = \{ 1, 2, 3, 4 \}$, evaluate the sum of the minimum elements.
View Variant Solution
Breakdown: Min is $1 \implies 2^3 = 8$ subsets ($1 \times 8 = 8$). Min is $2 \implies 2^2 = 4$ subsets ($2 \times 4 = 8$). Min is $3 \implies 2^1 = 2$ subsets ($3 \times 2 = 6$). Min is $4 \implies 1$ subset ($4 \times 1 = 4$). Sum: $8 + 8 + 6 + 4 = \mathbf{26}$.
[Problem 14] Global Subset Sum with Fractional Terms
Let $X_1, X_2, \dots, X_{15}$ be all non-empty subsets of $A = \left\{ \dfrac{1}{2}, \dfrac{1}{4}, \dfrac{1}{8}, \dfrac{1}{16} \right\}$. Evaluate $\sum_{k=1}^{15} S(X_k)$.
🔍 Solution & Step-by-Step Breakdown
Answer: $\dfrac{15}{2}$
[Step-by-Step Solution]
1) With $n = 4$ elements, each element appears in $2^{4 - 1} = 2^3 = 8$ subsets.
2) Summing the elements of $A$ via common denominator:
$$\dfrac{1}{2} + \dfrac{1}{4} + \dfrac{1}{8} + \dfrac{1}{16} = \dfrac{8 + 4 + 2 + 1}{16} = \dfrac{15}{16}$$
3) Applying the global frequency factor of $8$:
$$\text{Global Sum} = \dfrac{15}{16} \times 8 = \mathbf{\dfrac{15}{2}}$$
Even when working with geometric progressions of fractions, the global multiplier $2^{n-1}$ remains invariant. Sum the parent set first, then multiply.
🎯 [Self-Diagnosis Variant 14] (Geometric Progression Global Sum)
Evaluate the sum of all elements across all subsets of $A = \{ 3, 9, 27 \}$.
View Variant Solution
Breakdown: Sum of elements is $3 + 9 + 27 = 39$. Each element appears $2^{3 - 1} = 4$ times. Total: $39 \times 4 = \mathbf{156}$.
[Problem 15] Set Difference of Iterated Function Fixed Points (Grand Finale)
For $f(x) = x^2 - 2x$, define sets $A = \{ x \mid f(f(x)) = x \}$ and $B = \{ x \mid f(x) = x \}$. Find the product of all elements in the set difference $A \setminus B$.
🔍 Solution & Step-by-Step Breakdown
Answer: $-1$
[Step-by-Step Solution]
1) Find the elements of $B$ (first-order fixed points):
$$x^2 - 2x = x \implies x(x - 3) = 0 \implies B = \{ 0, 3 \}$$
2) Every fixed point of $f(x)$ is naturally a 2-cycle fixed point: $B \subset A$.
3) Expand $f(f(x)) - x = 0$:
$$(x^2 - 2x)^2 - 2(x^2 - 2x) - x = x^4 - 4x^3 + 2x^2 + 3x = 0$$
4) Factoring out $x(x - 3) = x^2 - 3x$:
$$x(x - 3)(x^2 - x - 1) = 0$$
5) Set $A \setminus B$ corresponds precisely to the roots of $x^2 - x - 1 = 0$, which are $x = \dfrac{1 \pm \sqrt{5}}{2}$.
By Vieta's formulas, their product is $\mathbf{-1}$.
In iterated maps, the solution set of $f(f(x)) = x$ is algebraically divisible by $f(x) - x$. The roots of the remaining quotient polynomial give the pure 2-cycle periodic orbits ($A \setminus B$).
🎯 [Self-Diagnosis Variant 15] (Iterated Polynomial Fixed Points)
For $f(x) = x^2 - 2$, determine $n(A)$ where $A = \{ x \mid f(f(x)) = x, \, x \in \mathbb{R} \}$.
View Variant Solution
Breakdown: $f(f(x)) - x = (x^2 - x - 2)(x^2 + x - 1) = 0$. The first quadratic has roots $\{-1, 2\}$, and the second has roots $\dfrac{-1 \pm \sqrt{5}}{2}$. All 4 real roots are distinct $\implies n(A) = \mathbf{4}$.
Congratulations on mastering the first Practice Lab of Set Theory!
By treating set-builder representations as algebraic condition systems, parsing multi-tiered power set brackets with confidence, and leveraging global combinatorial counting, you have laid an unbreakable foundation for advanced mathematics.
In our next Practice Lab, we will tackle [Set Theory: Practice Lab ②] The 5 Fundamental Set Operations, De Morgan's Laws, and Symmetric Differences ($A \Delta B$).

Comments
Post a Comment