1.1 Sets and Set Operations

1.1 Sets and Set Operations

Set theory serves as the foundational language of modern mathematics and constitutes one of the most reliable scoring sections on the Chinese National Higher Education Entrance Examination (Gaokao). A rigorous understanding of set notation, element properties, set inclusion, and binary operations is essential not only for answering direct set-related problems but also for establishing domains, range restrictions, and solution sets across algebra, calculus, and probability.

1. Fundamentals of Set Theory and Element Properties

A set is a well-defined collection of distinct objects, referred to as elements. We denote sets by capital italic letters ($A, B, C, \dots$) and their elements by lowercase italic letters ($a, b, c, \dots$). The relation of an element belonging to a set is denoted by $a \in A$ ("$a$ belongs to $A$"), while non-membership is written as $a \notin A$ ("$a$ does not belong to $A$").

Three Core Characteristics of Sets

Every mathematically valid set must strictly satisfy three fundamental properties:

1. Determinacy (确定性): For any given object $x$ and set $A$, it must be unequivocally determinable whether $x \in A$ or $x \notin A$. Vague descriptions such as "all tall students" do not form a set, whereas "all students taller than 180 cm" form a valid set.
2. Distinctness (互异性): All elements within a set must be unique. No element can appear more than once. When solving equations involving parameters in set elements, roots that produce identical elements must be discarded.
3. Unorderedness (无序性): The order in which elements are listed does not alter the identity of the set. For example, $\{1, 2, 3\} = \{3, 1, 2\}$.

Standard Number Sets

In Gaokao problems, specific letter symbols represent standard numerical sets:

• $\mathbb{N}$: The set of natural numbers (including $0$, i.e., $\{0, 1, 2, 3, \dots\}$).
• $\mathbb{N}^*$ or $\mathbb{N}_+$: The set of positive integers ($\{1, 2, 3, \dots\}$).
• $\mathbb{Z}$: The set of integers ($\{\dots, -2, -1, 0, 1, 2, \dots\}$).
• $\mathbb{Q}$: The set of rational numbers ($\{ \frac{p}{q} \mid p \in \mathbb{Z}, q \in \mathbb{N}^*, \gcd(p, q) = 1 \}$).
• $\mathbb{R}$: The set of real numbers.
• $\mathbb{C}$: The set of complex numbers.

Set Representation Methods

1. Roster Method (列举法): Explicitly listing all elements enclosed in curly braces, appropriate for finite sets or sets with clear discrete patterns, e.g., $A = \{2, 4, 6, 8\}$.
2. Set-Builder Notation (描述法): Expressed as $\{x \in D \mid P(x)\}$, where $x$ is the representative element, $D$ is the domain, and $P(x)$ is the defining property or condition satisfied by $x$. For instance, $B = \{x \in \mathbb{R} \mid x^2 - 5x + 6 = 0\}$.
3. Venn Diagrams (Venn图): Graphical representations using closed planar curves to illustrate sets and their spatial inclusion or overlap relationships.

2. Set Inclusion, Subsets, and Power Sets

Subsets and Set Equality

• Subset (子集): A set $A$ is a subset of $B$, denoted $A \subseteq B$ (or $B \supseteq A$), if every element of $A$ is also an element of $B$. Formally: $\forall x \in A \implies x \in B$.
• Proper Subset (真子集): If $A \subseteq B$ and there exists at least one element $b \in B$ such that $b \notin A$, then $A$ is a proper subset of $B$, written $A \subsetneq B$.
• Set Equality (集合相等): Two sets $A$ and $B$ are equal ($A = B$) if and only if $A \subseteq B$ and $B \subseteq A$.
• Empty Set (空集): The set containing no elements, denoted $\varnothing$. By convention, the empty set is a subset of every set ($\varnothing \subseteq A$ for any set $A$), and a proper subset of every non-empty set ($\varnothing \subsetneq A$ for any $A \neq \varnothing$).

Counting Subsets for Finite Sets

If a finite set $A$ contains $n$ distinct elements ($|A| = n$):

1. Total number of subsets of $A$: $2^n$.
2. Total number of proper subsets of $A$: $2^n - 1$.
3. Total number of non-empty proper subsets of $A$: $2^n - 2$.

3. Operations on Sets: Union, Intersection, and Complement

Let $U$ be a reference universal set, with $A, B \subseteq U$.

1. Intersection (交集)

The intersection of $A$ and $B$, denoted $A \cap B$, is the set of all elements belonging to both $A$ and $B$:

$$A \cap B = \{x \in U \mid x \in A \text{ and } x \in B\}$$

2. Union (并集)

The union of $A$ and $B$, denoted $A \cup B$, is the set of all elements belonging to $A$, or $B$, or both:

$$A \cup B = \{x \in U \mid x \in A \text{ or } x \in B\}$$

3. Complement (补集)

The complement of $A$ with respect to $U$, denoted $\complement_U A$, is the set of all elements in $U$ that do not belong to $A$:

$$\complement_U A = \{x \in U \mid x \in U \text{ and } x \notin A\}$$

Fundamental Operational Laws

• Commutative Laws: $A \cap B = B \cap A$, $A \cup B = B \cup A$.
• Associative Laws: $(A \cap B) \cap C = A \cap (B \cap C)$, $(A \cup B) \cup C = A \cup (B \cup C)$.
• Distributive Laws: $A \cap (B \cup C) = (A \cap B) \cup (A \cap C)$, $A \cup (B \cap C) = (A \cup B) \cap (A \cup C)$.
• De Morgan's Laws (德·摩根定律): $$\complement_U (A \cup B) = (\complement_U A) \cap (\complement_U B)$$ $$\complement_U (A \cap B) = (\complement_U A) \cup (\complement_U B)$$
• Inclusion-Exclusion Principle (容斥原理): For finite sets $A$ and $B$, $$|A \cup B| = |A| + |B| - |A \cap B|$$

Critical Boundary Pitfalls in Gaokao Problems

When solving condition problems of the form $A \subseteq B$ where $A = \{x \mid ax + 1 = 0\}$ or $A = \{x \mid ax^2 + bx + c = 0\}$, students frequently forget that $A$ may be empty ($\varnothing$). For instance, if $a = 0$ in a linear equation, $A = \varnothing$, which satisfies $A \subseteq B$ unconditionally. Always analyze the case $A = \varnothing$ first before proceeding to non-empty subset conditions.

Summary of Set Operations and Algebraic Properties

4. Worked Gaokao Exam Examples

Worked Example 1: Continuous Interval Set Operations

Problem: Let the universal set $U = \mathbb{R}$. Given sets $A = \{x \in \mathbb{R} \mid x^2 - 3x - 4 < 0\}$ and $B = \{x \in \mathbb{R} \mid \log_2(x - 1) \le 1\}$. Find:

1. $A \cap B$
2. $\complement_U (A \cup B)$

Solution:

• Step 1: Solve for Set $A$. The inequality $x^2 - 3x - 4 < 0$ factorizes as $(x - 4)(x + 1) < 0$. The roots of the corresponding quadratic equation are $x = -1$ and $x = 4$. Since the parabola opens upward, the inequality holds between the roots: $$A = (-1, 4)$$
• Step 2: Solve for Set $B$. For the logarithmic expression $\log_2(x - 1)$ to be defined, the argument must be strictly positive: $x - 1 > 0 \implies x > 1$. Next, solve $\log_2(x - 1) \le 1$. Since the base $2 > 1$, monotonically applying exponentiation yields: $$x - 1 \le 2^1 = 2 \implies x \le 3$$ Combining the domain restriction $x > 1$ and $x \le 3$ gives: $$B = (1, 3]$$
• Step 3: Determine $A \cap B$. Intersecting the intervals $A = (-1, 4)$ and $B = (1, 3]$ on the real line: $$A \cap B = (1, 3]$$
• Step 4: Determine $\complement_U (A \cup B)$. First compute the union $A \cup B$: $$A \cup B = (-1, 4) \cup (1, 3] = (-1, 4)$$ The complement in $U = \mathbb{R}$ is the portion of the real line outside $(-1, 4)$: $$\complement_U (A \cup B) = (-\infty, -1] \cup [4, +\infty)$$

---

Worked Example 2: Parameter Inclusion with Empty Set Boundary Condition

Problem: Given sets $A = \{x \in \mathbb{R} \mid x^2 - 2x - 3 = 0\}$ and $B = \{x \in \mathbb{R} \mid ax - 1 = 0\}$. If $B \subseteq A$, find the set of all possible real values of the parameter $a$.

Solution:

• Step 1: Determine set $A$. Solving $x^2 - 2x - 3 = 0 \implies (x - 3)(x + 1) = 0$, we find roots $x = 3$ and $x = -1$. $$A = \{-1, 3\}$$
• Step 2: Analyze set $B \subseteq A$ by cases.
  • Case 1: $B = \varnothing$. If $a = 0$, the equation $0 \cdot x - 1 = 0 \implies -1 = 0$, which has no real solutions. Thus $B = \varnothing$. Since $\varnothing \subseteq A$ is true for any set $A$, $a = 0$ is a valid value.
  • Case 2: $B \neq \varnothing$. If $a \neq 0$, the equation $ax - 1 = 0$ yields a unique solution $x = \frac{1}{a}$. Thus $B = \left\{\frac{1}{a}\right\}$. For $B \subseteq A$, the element $\frac{1}{a}$ must belong to $A = \{-1, 3\}$:
    1. $\frac{1}{a} = -1 \implies a = -1$.
    2. $\frac{1}{a} = 3 \implies a = \frac{1}{3}$.
• Step 3: Combine all valid cases. Gathering $a = 0$, $a = -1$, and $a = \frac{1}{3}$, the set of all real values of $a$ is $\left\{-1, 0, \frac{1}{3}\right\}$.