📚 Introduction to Group Theory: Key Exam Points | 群论入门考点精讲
Group theory is a cornerstone of abstract algebra, exploring sets equipped with a single binary operation that satisfies four fundamental axioms. This topic appears in both IB Higher Level Mathematics (Option: Sets, Relations and Groups) and Edexcel Further Pure Mathematics, demanding precise logical reasoning and a solid grasp of definitions. Whether you are preparing for an IB Option paper or an Edexcel FP2/FP3 exam, mastering group axioms, subgroups, cyclic groups, and Lagrange’s Theorem is essential. This revision guide breaks down all key points with clear examples, common pitfalls, and exam-focused tips.
群论是抽象代数的基石，研究配备一个二元运算且满足四条基本公理的集合。该主题同时出现在IB高级数学（选修：集合、关系与群）和Edexcel进阶纯数学中，要求严谨的逻辑推理和对定义的牢固掌握。无论你是在准备IB选修试卷还是Edexcel FP2/FP3考试，掌握群公理、子群、循环群和拉格朗日定理都至关重要。本复习指南通过清晰的示例、常见错误和考试导向的技巧，详细解析所有关键考点。
1. What is a Group? | 什么是群？
A group is an ordered pair (G, *) where G is a non‑empty set and * is a binary operation on G that combines any two elements to form another element of G, satisfying four axioms (closure, associativity, identity and inverses). The operation can be addition, multiplication, composition of functions, or even matrix multiplication, as long as the axioms hold. Classic examples include (ℤ, +), the set of integers under addition, and (ℝ\{0}, ×), the non‑zero real numbers under multiplication.
群是一个有序对 (G, *)，其中G是非空集合，*是G上的二元运算，将任意两个元素组合成G中的另一个元素，并满足四个公理（封闭性、结合律、单位元和逆元）。运算可以是加法、乘法、函数复合，甚至矩阵乘法，只要公理成立即可。经典例子包括整数集在加法下的群 (ℤ, +)，以及非零实数在乘法下的群 (ℝ\{0}, ×)。
2. The Four Group Axioms | 群的四个公理
Closure: For all a, b ∈ G, the result of the operation a * b is also an element of G. This keeps the structure internal.
封闭性：对所有 a, b ∈ G，运算结果 a * b 仍是G的元素。这使得结构保持内部封闭。
Associativity: For all a, b, c ∈ G, (a * b) * c = a * (b * c). This property allows us to drop parentheses when performing multiple operations.
结合律：对所有 a, b, c ∈ G，(a * b) * c = a * (b * c)。该性质使我们进行多次运算时可以省略括号。
Identity element: There exists an element e ∈ G such that for every a ∈ G, e * a = a * e = a. In additive notation we often write 0; in multiplicative notation we write 1 or e.
单位元：存在元素 e ∈ G，使得对每个 a ∈ G 有 e * a = a * e = a。在加法记号中常写作0；在乘法记号中写作1或e。
Inverse element: For each a ∈ G, there exists an element a⁻¹ ∈ G satisfying a * a⁻¹ = a⁻¹ * a = e. The inverse depends on the operation; for addition it is the negative, for multiplication the reciprocal.
逆元：对每个 a ∈ G，存在元素 a⁻¹ ∈ G，满足 a * a⁻¹ = a⁻¹ * a = e。逆元取决于运算；加法中是相反数，乘法中是倒数。
In exams, you may be asked to verify these axioms for a given set and operation. Always check closure first, then identity, inverses, and finally associativity (often the most tedious).
考试中可能会要求验证给定集合和运算是否满足这些公理。务必先检查封闭性，然后是单位元、逆元，最后是结合律（通常最繁琐）。
3. Abelian Groups | 阿贝尔群
A group (G, *) is called Abelian (or commutative) if in addition to the four axioms, the operation is commutative: for all a, b ∈ G, a * b = b * a. Many familiar groups are Abelian, such as (ℤ, +), (ℝ, +) and the cyclic group ℤₙ. Non‑Abelian groups appear frequently with matrix multiplication or symmetry operations, e.g. the dihedral group D₃.
如果一个群 (G, *) 在四条公理之外还满足交换律：对所有 a, b ∈ G 有 a * b = b * a，则称为阿贝尔群（或交换群）。许多熟悉的群都是阿贝尔群，如 (ℤ, +)、(ℝ, +) 和循环群 ℤₙ。非阿贝尔群常出现在矩阵乘法或对称操作中，例如二面体群 D₃。
To prove a group is Abelian, you must show commutativity holds for all pairs. Conversely, a single counterexample of non‑commutativity suffices to prove it is not Abelian.
要证明一个群是阿贝尔群，必须证明对所有元素对交换律成立。相反，一个不交换的反例就足以证明它不是阿贝尔群。
4. Cayley Tables | 凯莱表
A Cayley table displays the result of the group operation for every pair of elements. It resembles a multiplication table and is especially useful for finite groups. The identity row and column simply repeat the row/column headings, and each element must appear exactly once in each row and column (Latin square property). For the group ℤ₄ = {0, 1, 2, 3} under addition modulo 4, the Cayley table is:
凯莱表展示了群中每一对元素的运算结果。它类似于乘法表，对有限群特别有用。单位元所在的行和列只是重复行/列标题，并且每个元素在每行和每列中恰好出现一次（拉丁方性质）。对于模4加法下的群 ℤ₄ = {0, 1, 2, 3}，凯莱表如下：
| +₄ | 0 | 1 | 2 | 3 |
|---|---|---|---|---|
| 0 | 0 | 1 | 2 | 3 |
| 1 | 1 | 2 | 3 | 0 |
| 2 | 2 | 3 | 0 | 1 |
| 3 | 3 | 0 | 1 | 2 |
In an exam, you might be given a partially filled Cayley table and asked to complete it using group axioms. Remember that the identity element must appear symmetrically, and inverses can be located by finding the identity within the table.
考试中可能会给出部分填充的凯莱表，要求利用群公理将其补全。请记住单位元必须对称出现，并且可以通过在表中找到单位元来确定逆元。
5. Subgroups | 子群
A subset H of a group G is a subgroup, denoted H ≤ G, if H is itself a group under the same operation. To verify H is a subgroup, you can use the subgroup test: H is non‑empty, and for all a, b ∈ H, the element a * b⁻¹ ∈ H (or, more simply for finite groups, H must be closed under the operation). The trivial subgroup {e} and the whole group G are always subgroups; others are called proper non‑trivial subgroups.
群G的一个子集H若在同一运算下本身构成一个群，则称H为子群，记作 H ≤ G。要验证H是子群，可使用子群检验法：H非空，且对所有 a, b ∈ H，元素 a * b⁻¹ ∈ H（或者对于有限群更简单地，H必须在运算下封闭）。平凡子群 {e} 和整个群G总是子群；其他子群称为真非平凡子群。
For example, in (ℤ, +), the even integers 2ℤ form a subgroup because the sum of two even integers is even, and the negative of an even integer is even (and 0 is even). In contrast, the odd integers do not form a subgroup since the sum of two odd numbers is even, violating closure.
例如，在 (ℤ, +) 中，偶数 2ℤ 构成一个子群，因为两个偶数之和仍为偶数，偶数的负数也是偶数（且0为偶数）。相反，奇数不构成子群，因为两个奇数之和为偶数，破坏了封闭性。
6. Cyclic Groups | 循环群
A group G is cyclic if there exists an element g ∈ G such that every element of G can be written as a power of g (using the group operation). We write G = ⟨g⟩ and call g a generator. Cyclic groups are always Abelian. The integers under addition, (ℤ, +), are infinite cyclic with generator 1 (or −1). Finite cyclic groups of order n are essentially ℤₙ, the integers modulo n under addition, generated by 1.
若存在元素 g ∈ G，使得G的每个元素都可以表示为g的幂（使用群运算），则称G为循环群。记作 G = ⟨g⟩，并称g为生成元。循环群总是阿贝尔群。加法下的整数 (ℤ, +) 是以1（或−1）为生成元的无限循环群。n阶有限循环群本质上是模n加法下的整数 ℤₙ，由1生成。
A cyclic group can have more than one generator. In ℤ₆, the elements 1 and 5 are both generators because 5 ≡ −1 mod 6. An element k ∈ ℤₙ is a generator if and only if gcd(k, n) = 1.
循环群可以有多个生成元。在 ℤ₆ 中，元素1和5都是生成元，因为 5 ≡ −1 mod 6。元素 k ∈ ℤₙ 是生成元当且仅当 gcd(k, n) = 1。
7. Order of an Element | 元素的阶
The order of an element a in a group G, denoted |a|, is the smallest positive integer n such that aⁿ = e, where aⁿ means applying the operation n times. If no such n exists, the element has infinite order. In a finite group, every element has finite order. For example, in ℤ₄ under addition, the element 2 has order 2 because 2 + 2 ≡ 0 (mod 4), while 1 has order 4.
群G中元素a的阶，记作 |a|，是使得 aⁿ = e 的最小正整数n，其中 aⁿ 表示连续运算n次。若这样的n不存在，则该元素具有无限阶。在有限群中，每个元素都有有限阶。例如，在加法下的 ℤ₄ 中，元素2的阶为2，因为 2+2 ≡ 0 (mod 4)，而元素1的阶为4。
The order of an element always divides the order of the group (by Lagrange’s Theorem), which is a useful fact for checking consistency in Cayley tables or finding possible orders of elements.
元素的阶总是整除群的阶（根据拉格朗日定理），这是一个检查凯莱表一致性或寻找元素可能阶数的有用事实。
8. Lagrange’s Theorem | 拉格朗日定理
Lagrange’s Theorem states that for any finite group G, the order of every subgroup H divides the order of G: |H| divides |G|. Consequently, the order of any element a also divides |G| because the cyclic subgroup ⟨a⟩ has order |a|. This theorem limits the possible structures of subgroups and is a powerful tool for classifying groups of a given order.
拉格朗日定理指出，对于任何有限群G，每个子群H的阶都整除G的阶：|H| 整除 |G|。因此，任何元素a的阶也整除 |G|，因为循环子群 ⟨a⟩ 的阶为 |a|。该定理限制了子群的可能结构，是对给定阶的群进行分类的有力工具。
Example: If |G| = 6, possible subgroup orders are 1, 2, 3, and 6. A subgroup of order 4 cannot exist. In exam problems, you might be asked to deduce the order of a group from a Cayley table by noting the orders of elements must divide the group order.
示例：若 |G| = 6，则可能的子群阶为1, 2, 3, 和 6。不存在阶为4的子群。在考试题目中，你可能需要根据元素阶必须整除群阶这一性质，从凯莱表推导出群的阶。
Lagrange’s Theorem: |H| | |G| ⇒ |a| | |G| for all a ∈ G
9. Group Isomorphisms | 群同构
Two groups (G, *) and (H, ∘) are isomorphic, written G ≅ H, if there exists a bijective function φ: G → H such that for all a, b ∈ G, φ(a * b) = φ(a) ∘ φ(b). Isomorphisms preserve the group structure entirely; they essentially show that the two groups are ‘the same’ up to relabelling. For example, the group of rotations of a square (order 4) is isomorphic to ℤ₄. All cyclic groups of order n are isomorphic to ℤₙ.
如果存在双射 φ: G → H，使得对所有 a, b ∈ G 有 φ(a * b) = φ(a) ∘ φ(b)，则称两个群 (G, *) 和 (H, ∘) 同构，记作 G ≅ H。同构完全保持群结构；本质上表明这两个群在重新标记后是‘相同’的。例如，正方形的旋转群（4阶）与 ℤ₄ 同构。所有n阶循环群都与 ℤₙ 同构。
To prove two groups are not isomorphic, you can compare invariants: orders of elements, number of elements of a given order, commutativity, or existence of subgroups of certain orders. For instance, ℤ₄ and the Klein four‑group V₄ both have order 4 but are not isomorphic because ℤ₄ has elements of order 4 whereas V₄ has maximum order 2.
要证明两个群不同构，可以比较不变量：元素的阶、特定阶的元素个数、交换性，或者是否存在特定阶的子群。例如，ℤ₄ 和克莱因四元群 V₄ 阶均为4但不相同，因为 ℤ₄ 含有4阶元素而 V₄ 最大阶为2。
10. Exam Tips for Group Theory | 群论考试技巧
Show closure explicitly: For a given set and operation, take two arbitrary elements a, b and demonstrate that a * b remains in the set. Do not assume closure without proof.
明确展示封闭性：对于给定的集合和运算，取任意两个元素 a, b，证明 a * b 仍在集合内。未经证明不要假设封闭性。
Check associativity carefully: Although often given or inherited from a known operation (e.g., matrix multiplication is associative), if required, show (a*b)*c and a*(b*c) yield the same result. Use general elements.
仔细检查结合律：虽然经常是给定的或继承自已知运算（如矩阵乘法结合），若需证明，则展示 (a*b)*c 和 a*(b*c) 得到相同结果。使用一般元素。
Identify the identity first: Look for an element e such that e * x = x * e = x for all x. In Cayley tables, the identity row and column mirror the borders.
首先确定单位元：寻找元素 e，使得对所有 x 有 e * x = x * e = x。在凯莱表中，单位元所在的行和列与边框一致。
Use subgroup tests efficiently: For finite groups, closure alone guarantees a subset is a subgroup (since finiteness ensures existence of inverses).
有效运用子群检验法：对于有限群，仅凭封闭性即可保证子集是子群（因为有限性确保逆元存在）。
Lagrange’s Theorem for deductions: If a group has order 8, an element cannot have order 3, 5, 6, or 7. Use this to spot errors and fill tables.
用拉格朗日定理进行推理：若一个群的阶为8，则元素不可能有3、5、6或7阶。利用这一点发现错误并补全表格。
Isomorphism proofs: When constructing an isomorphism, clearly define the mapping and verify the homomorphism property and bijectivity. When disproving, present a counterexample based on order or structure.
同构证明：构造同构时，明确定义映射并验证同态性质与双射性。证伪时，基于阶或结构给出反例。
Published by TutorHao | Group Theory Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导