📚 Mastering IB HL Option 8: Sets, Relations and Groups | 掌握IB HL选修8：集合、关系与群
Option 8: Sets, Relations and Groups is one of the most intellectually rewarding choices in the IB Mathematics HL course. It builds a rigorous foundation in abstract mathematical structures, moving from the familiar language of sets and relations to the powerful theory of groups. This option sharpens logical reasoning, proof-writing skills, and the ability to recognise algebraic patterns across diverse mathematical systems. In this revision guide, we unpack every key concept, from basic set notation to quotient groups, linking abstract ideas to concrete examples and typical exam questions.
选修8：集合、关系与群是IB数学HL课程中最具思维挑战也最令人着迷的选修内容之一。它从集合与关系的语言出发，逐步建立起抽象的群论体系，培养了严谨的逻辑推理和证明能力。本复习指南将从基础的集合记号开始，一路延伸到商群，每个概念都配有具体例子和常考题型解析，帮助你系统掌握这一板块。
1. Foundations: Sets and Notation | 基础：集合与记号
A set is a well-defined collection of distinct objects, called elements. We write a ∈ A to mean a is an element of A, and a ∉ isting elements within curly braces, e.g. S = {2, 4, 6, 8}, or by set-builder notation: {x ∈ ℝ | x > 0}. The cardinality |A| is the number of elements in a finite set. Important special sets include the empty set ∅ (with |∅| nd the power set P(A), which is the set of all subsets of A. For any set A, we always have ∅ ⊆ A and A ⊆ A. The power set of a set with n elements has 2ⁿ elements.
集合是一组明确定义的不同对象的整体，这些对象称为元素。我们记 a ∈ A 表示 a 是 A 的元素，否则记 a ∉ A。集合可以用花括号列举，比如 S = {2, 4, 6, 8}，也可以用集合构造器表示：{x ∈ ℝ | x > 0}。有限集的基数 |A| 是其所含元素的个数。重要的特殊集合有空集 ∅（|∅| = 0）、全集 U（所讨论对象的全体）以及幂集 P(A)，即 A 的所有子集构成的集合。对任意集合 A，总有 ∅ ⊆ A 和 A ⊆ A。含有 n 个元素的集合，其幂集共有 2ⁿ 个元素。
2. Operations on Sets | 集合运算
The basic operations on sets are union (A ∪ B), intersection (A ∩ B), difference (A \ B), and symmetric difference (A ∆ B). The complement of A, denoted A' or Aᶜ laws analogous to arithmetic, but with important differences. The commutative laws state A ∪ B = B ∪ A and A ∩ B = B ∩ A. The associative laws allow us to write A ∪ B ∪ C without ambiguity. De Morgan's laws are particularly useful: (A ∪ B)' = A' ∩ B' and (A ∩ B)' = A' ∪ B' an be proved by showing each side is a subset of the other, or by using membership tables.
集合的基本运算包括并（A ∪ B）、交（A ∩ B）、差（A \ B）和对称差（A ∆ B）。A 的补集记作 A' 或 Aᶜ，是 U 中不属于 A 的元素构成的集合。文氏图可以帮助直观地理解这些运算。集合代数遵循许多类似算术的规律，但也有重要区别。交换律成立：A ∪ B = B ∪ A，A ∩ B = B ∩ A。结合律使得我们可以无歧义地书写 A ∪ B ∪ C。德摩根律尤其有用：(A ∪ B)' = A' ∩ B' 和 (A ∩ B)' = A' ∪ B'。证明集合恒等式时，可以证明等式两边互为子集，也可以使用成员表。
3. Cartesian Products and Relations | 笛卡尔积与关系
sian product of sets A and B, written A × B, is the set of all ordered pairs (a, b) with a ∈ A and b ∈ B. A relation R from A to B is any subset of A × B. If (a, b) ∈ R we often write a R b. The domain of R is {a ∈ A | ∃b ∈ B, (a, b) ∈ R}, and the range is {b ∈ B | ∃a ∈ A, (a, b) ∈ R}. The inverse relation R⁻¹ is defined by (b, a) ∈ R⁻¹ ⇔ (a, b) ∈ R. Relations can be composed: if R ⊆ A × B and S ⊆ B × C, the composite S ∘ R is defined by (a, c) ∈ S ∘ R ⇔ ∃b ∈ of A × A) can be classified by properties such as reflexivity, symmetry, and transitivity.
集合 A 与 B 的笛卡尔积 A × B 是所有有序对 (a, b) 的集合，其中 a ∈ A，b ∈ B。从 A 到 B 的一个关系 R 就是 A × B 的任意子集。如果 (a, b) ∈ R，常记作 a R b。R 的定义域是 {a ∈ A | ∃b ∈ B, (a, b) ∈ R}，值域是 {b ∈ B | ∃a ∈ A, (a, b) ∈ R}。逆关系 R⁻¹ 定义为 (b, a) ∈ R⁻¹ ⇔ (a, b) ∈ R。关系可以复合：若 R ⊆ A × B 且 S ⊆ B × C，则复合关系 S ∘ R 定义为 (a, c) ∈ S ∘ R ⇔ ∃b ∈ B 使得 a R b 且 b S c。同一个集合 A 上的关系（即 A × A 的子集）可以根据自反性、对称性、传递性等性质进行分类。
4. Equivalence Relations and Partitions | 等价关系与划分
A relation ~ on a set A is an equivalence relation if it is reflexive (a ~ a for all a ∈ A), symmetric (a ~ b ⇒ b ~ a), and transitive (a ~ b and b ~ c ⇒ a ~ c). The equivalence class of an element a is [a] = {x ∈ A | x ~ a}. The set of all equivalence classes forms a partition of A: the classes are non‑ s are related if they belong to the same part. A classic example is congruence modulo n on ℤₙ: a ≡ b (mod n) ⇔ n divides a − b. The equivalence classes are the residue classes 0̄, 1̄, …, n−1̄.
集合 A 上的关系 ~ 若满足自反性（对所有 a ∈ A，a ~ a）、对称性（a ~ b ⇒ b ~ a）和传递性（a ~ b 且 b ~ c ⇒ a ~ c），则称为等价关系。元素 a 的等价类为 [a] = {x ∈ A | x ~ a}。所有等价类的集合构成 A 的一个划分：这些类非空、彼此不交，且它们的并集等于 A。反之，A 的任何一个划分可以定义一个等价关系：两个元素若属于同一块则等价。一个经典例子是 ℤₙ 上的模 n 同余：a ≡ b (mod n) ⇔ n 整除 a − b。等价类就是剩余类 0̄, 1̄, …, n−1̄。
5. Order Relations and Posets | 序关系与偏序集
elation ≤ on a set A is a partial order if it is reflexive, antisymmetric (a ≤ b and b ≤ a ⇒ transitive. The pair (A, ≤) is called a partially ordered set, or poset. If for every a, b ∈ nite poset. Important elements include maximal and minimal elements (no element is strictly greater/smaller), greatest and least elements (comparable to every element). Upper and lower bounds, and supremum and infimum, extend these notions to subsets. A lattice is a poset in which every pair of elements has both a supremum and an infimum.
集合 A 上的关系 ≤ 若满足自反性、反对称性（a ≤ b 且 b ≤ a ⇒ a = b）和传递性，则称为偏序。(A, ≤) 称为偏序集。若对任意 a, b ∈ A 都有 a ≤ b 或 b ≤ a，则称该序为全序，A 为全序集。哈斯图省略自反边和传递边，可清晰地展现有限偏序集的结构。重要元素包括极大元与极小元（没有比它严格更大/更小的元素）、最大元与最小元（与所有元素可比较）。子集的上界、下界、上确界和下确界将这些概念推广到子集。若一个偏序集中任意两个元素同时具有上确界和下确界，则称其为一个格。
6. Functions: Injective, Surjective, Bijective | 函数：单射、满射、双射
A function f from A to B, written f: A → B, is a relation such that for each a ∈ A there is exactly one b ∈ B with (a, b) ∈ f. The image of a subset X ⊆ A is f(X) = {f(x) | x ∈ X}, and the preimage of Y ⊆ B is f⁻¹(Y) = {a ∈ A | f(a) ∈ Y}. A function is injective (one‑to‑one) if f(a₁) = f(a₂) ⇒ a₁ = a₂. It is surjective (onto) if for every b ∈ B there exists a ∈ ctive. Only bijections have inverse functions. Composition of functions is associative: (h ∘ g) ∘ f = h ∘ (g ∘ f).
从 A 到 B 的函数 f: A → B 是一个关系，使得每个 a ∈ A 恰好对应一个 b ∈ B 满足 (a, b) ∈ f。子集 X ⊆ A 的像为 f(X) = {f(x) | x ∈ X}，Y ⊆ B 的原像为 f⁻¹(Y) = {a ∈ A | f(a) ∈ Y}。函数称为单射（一对一）若 f(a₁) = f(a₂) ⇒ a₁ = a₂；称为满射（映上）若对每个 b ∈ B 存在 a ∈ A 使得 f(a) = b；双射则既单又满。只有双射才存在反函数。函数的复合满足结合律：(h ∘ g) ∘ f = h ∘ (g ∘ f)。
7. Group Theory: Definition and First Examples | 群论：定义与初步例子
A group is a set G together with a binary operation ∗ satisfying four axioms: closure (a ∗ b ∈ G for all a, b ∈ G), associativity ((a ∗ b) ∗ c = a ∗ (b ∗ c)), identity (there exists e ∈ G such that e ∗ a = a ∗ e = a for all a), and inverses (for each a ∈ G there exists a⁻¹ ∈ G with a ∗ a⁻¹ = a⁻¹ ∗ e). The group is abelian if the operation is also commutative. Familiar examples include (ℤ, +) where the identity is 0 and the inverse of n is −n; (ℝ\ ns of n elements under composition; and the dihedral group Dₙ of symmetries of a regular n‑gon.
群是一个集合 G 连同其上的一个二元运算 ∗，满足四条公理：封闭性（∀a,b ∈ G, a ∗ b ∈ G）、结合律（(a ∗ b) ∗ c = a ∗ (b ∗ c)）、单位元（存在 e ∈ G 使得对所有 a 有 e ∗ a = a ∗ e = a）以及逆元（对每个 a ∈ G 存在 a⁻¹ ∈ G 满足 a ∗ a⁻¹ = a⁻¹ ∗ a = e）。若运算还满足交换律，则群称为交换群或阿贝尔群。常见例子包括：(ℤ, +)，单位元是 0，n 的逆元是 −n；(ℝ\{0}, ×)，单位元是 1，逆元是 1/x；n 个元素的所有置换在复合下构成的对称群 Sₙ；以及正 n 边形的对称群 Dₙ。
8. Subgroups and Cyclic Groups | 子群与循环群
roup under the operation of G. The subgroup test states that H ≤ G if and only if H is non‑empty and for all a, b ∈ H, a ∗ b⁻¹ ∈ H. For any element g ∈ G, the cyclic subgroup generated by g is ⟨g⟩ = {gⁿ | n ∈ ℤ}. A group G is cyclic if there exists g ∈ G such that G = ⟨g⟩. Finite cyclic groups of order n behave like (ℤ n element g (the smallest positive n with gⁿ = e) divides the order of G when G is finite.
群 G 的子集 H 若在 G 的运算下自身构成群，则称 H 为 G 的子群。子群判别法指出，H ≤ G 当且仅当 H 非空且对所有 a, b ∈ H 有 a ∗ b⁻¹ ∈ H。对任意 g ∈ G，由 g 生成的循环子群为 ⟨g⟩ = {gⁿ | n ∈ ℤ}。若存在 g ∈ G 使得 G = ⟨g⟩，则称 G 为循环群。n 阶有限循环群的行为类似于 (ℤₙ, +)，以 1 为生成元。循环群的每个子群都是循环的。拉格朗日定理稍后将子群的阶与群的阶联系起来，但目前可以知道，有限群中元素 g 的阶（满足 gⁿ = e 的最小正整数 n）整除群的阶。
9. Homomorphisms and Isomorphisms | 同态与同构
A homomorphism between groups (G, ∗) and (H, •) is a function φ: G → H such that φ(a ∗ b) = φ(a) • φ(b) for all a, b ∈ G. The kernel of φ is Ker φ = {g ∈ G | φ(g) = eH rphism that is bijective is an isomorphism; if such a map exists, G and H are isomorphic (G ≅ H), meaning they have the same group structure. Isomorphism preserves all group‑theoretic properties. The First Isomorphism Theorem states that G/Ker φ ≅ Im φ. This deep result links kernels, images, and quotient groups.
群 (G, ∗) 到 (H, •) 的同态是一个函数 φ: G → H，满足对所有 a, b ∈ G 有 φ(a ∗ b) = φ(a) • φ(b)。φ 的核为 Ker φ = {g ∈ G | φ(g) = eH}，像为 Im φ = φ(G)。双射的同态称为同构；若这样的映射存在，则 G 与 H 同构（G ≅ H），意味着它们具有完全相同的群结构。同构保持所有的群论性质。第一同构定理指出 G/Ker φ ≅ Im φ。这一深刻结论将核、像和商群联系了起来。
10. Cosets and Lagrange's Theorem | 陪集与拉格朗日定理
Let H be a subgroup of G. For any a ∈ G, the left coset of H with representative a is aH = {a ∗ h | h ∈ eft cosets partitions G. The number of distinct left cosets is the index [G : H]. Lagrange's theorem states that for a finite group G, |G| = |H| order of any subgroup divides the order of the group, and the order of any element divides |G|. A consequence is that groups of prime order are necessarily cyclic and have no non‑ he theorem also restricts the possible orders of subgroups when analysing group structure.
设 H 是 G 的子群。对任意 a ∈ G，以 a 为代表的左陪集为 aH = {a ∗ h | h ∈ H}。所有不同左陪集的集合构成 G 的一个划分。不同左陪集的个数称为指数 [G : H]。拉格朗日定理表明，对于有限群 G，有 |G| = |H| · [G : H]，因此任意子群的阶整除群的阶，任意元素的阶也整除 |G|。一个直接推论是，素数阶群必为循环群，且没有非平凡子群。该定理在分析群结构时限制了子群可能的阶。
11. Normal Subgroups and Quotient Groups | 正规子群与商群
A subgroup N of G is normal, written N ⊴ G, if for every g ∈ G and n ∈ N, gng⁻¹ ∈ momorphism with kernel N. The correspondence theorem links subgroups of G/N to subgroups of G containing N. Combined with the First Isomorphism Theorem, quotient groups allow us to break groups into simpler pieces and classify them.
G 的子群 N 若满足对每个 g ∈ G 和 n ∈ N 都有 gng⁻¹ ∈ N，则称 N 为正规子群，记作 N ⊴ G。等价地，左右陪集重合：对任意 g 有 gN = Ng。正规性正是使陪集的集合 G/N 在运算 (aN)(bN) = (ab)N 下构成群的充要条件，这个群称为商群。自然映射 π: G → G/N 定义为 π(g) = gN，它是一个以 N 为核的同态。对应定理将 G/N 的子群与 G 中包含 N 的子群联系起来。结合第一同构定理，商群使得我们可以将群分解为更简单的部分并进行分类。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图