📚 A-Level CIE Mathematics: Introduction to Group Theory Key Points | A-Level CIE 数学：群论入门 考点精讲
Group theory is a core topic in the CIE A-Level Further Mathematics syllabus (9231). It builds the foundation for abstract algebra by studying sets equipped with a binary operation that satisfies four axioms: closure, associativity, identity, and inverses. Understanding these axioms, common examples, and key theorems will help you tackle structured questions confidently. This article covers essential definitions, worked examples, and typical exam-style reasoning.
群论是 CIE A-Level 进阶数学（9231）大纲中的核心主题。通过研究带有二元运算并满足四条公理（封闭性、结合律、单位元、逆元）的集合，为抽象代数奠定基础。理解这些公理、常见例子以及关键定理，能让你自信应对结构化试题。本文涵盖基本定义、典型例题和常考推理，助你高效备考。
1. Binary Operations and Closability | 二元运算与封闭性
A binary operation * on a set S is a rule that takes any two elements a, b ∈ S and produces a unique result a * b that also belongs to S. This property is called closure. Without closure, the structure cannot be a group, so always verify it first in exam questions.
集合 S 上的二元运算 * 是一种规则，对 S 中任意两个元素 a、b，产生唯一的结果 a * b，且该结果仍属于 S。这一性质称为封闭性。缺少封闭性就无法构成群，因此在考试中务必首先验证封闭性。
- Example: Addition on integers ℤ is closed, since the sum of two integers is always an integer.
- 例子：整数集 ℤ 上的加法是封闭的，因为两个整数之和仍为整数。
- Counterexample: Subtraction on natural numbers ℕ = {1, 2, 3, …} is not closed, because 2 − 5 = −3 ∉ ℕ.
- 反例：自然数集 ℕ = {1, 2, 3, …} 上的减法不封闭，因为 2 − 5 = −3 不属于 ℕ。
Exam tip: When given a Cayley table, closure means every entry in the table must be an element of the original set.
应试技巧：对于给出的凯莱表，封闭性意味着表中每一项都必须是原集合中的元素。
2. The Four Group Axioms | 群的四条公理
A group (G, *) is a non‑empty set G together with a binary operation * satisfying: (1) Closure: ∀a, b ∈ G, a * b ∈ G. (2) Associativity: ∀a, b, c ∈ G, (a * b) * c = a * (b * c). (3) Identity: ∃e ∈ G such that ∀a ∈ G, e * a = a * e = a. (4) Inverses: ∀a ∈ G, ∃a⁻¹ ∈ G such that a * a⁻¹ = a⁻¹ * a = e.
群 (G, *) 是一个非空集合 G 连同二元运算 *，满足：(1) 封闭性：对任意 a, b ∈ G，有 a * b ∈ G。(2) 结合律：对任意 a, b, c ∈ G，有 (a * b) * c = a * (b * c)。(3) 单位元：存在 e ∈ G，使得对任意 a ∈ G，有 e * a = a * e = a。(4) 逆元：对任意 a ∈ G，存在 a⁻¹ ∈ G，使得 a * a⁻¹ = a⁻¹ * a = e。
These axioms are the check-list for proving a set and operation form a group. Never forget any of them. In CIE questions, you may be asked to show that a given structure is a group, meaning you must verify all four.
这四条公理是证明某集合和运算构成群的检查清单，缺一不可。在 CIE 考题中，可能需要你证明给定结构是群，即必须逐一验证全部四条公理。
3. Common Examples of Groups | 常见群的例子
Familiar examples help build intuition for abstract problems. Keep these in your revision notes:
熟悉的例子有助于建立对抽象问题的直观理解，请务必纳入复习笔记：
| Group (G, *) | 群 (G, *) | Identity / 单位元 | Inverse / 逆元 |
|---|---|---|---|
| (ℤ, +) | 整数加法群 | 0 | −a |
| (ℝ\{0}, ×) | 非零实数乘法群 | 1 | 1/a |
| (ℤₙ, +ₙ) — integers modulo n under addition | 模 n 整数加法群 | 0 | n − a (mod n) |
| Symmetric group Sₙ (permutations) | 对称群 Sₙ（置换群） | Identity permutation | Inverse permutation |
| Dihedral group Dₙ (symmetries of regular n‑gon) | 二面体群 Dₙ（正 n 边形对称群） | Identity transformation | Inverse rotation/reflection |
Recognising these examples allows you to quickly identify properties such as commutativity and order of elements in exam contexts.
熟悉这些例子可以让你在考试中快速识别交换性、元素阶等性质。
4. Abelian (Commutative) Groups | 阿贝尔群（交换群）
A group (G, *) is called Abelian if the operation is commutative: a * b = b * a for all a, b ∈ G. Many standard groups like (ℤ, +) and (ℝ\{0}, ×) are Abelian, but matrix multiplication groups and permutation groups Sₙ (n ≥ 3) are generally non‑Abelian.
若群 (G, *) 的运算满足交换律：对所有 a, b ∈ G，有 a * b = b * a，则称之为阿贝尔群。许多标准群如 (ℤ, +) 和 (ℝ\{0}, ×) 是阿贝尔群，但矩阵乘法群和置换群 Sₙ (n ≥ 3) 通常是非阿贝尔群。
The CIE syllabus often asks you to determine whether a given group is Abelian by inspecting its Cayley table – symmetry about the main diagonal indicates commutativity.
CIE 大纲常要求通过检查凯莱表来判断一个群是否为阿贝尔群——若表格关于主对角线对称，则运算满足交换律。
5. Cayley Tables and Small Groups | 凯莱表与小阶群
A Cayley table (or group table) displays all possible results of the binary operation. For finite groups of small order (up to about 6), constructing the table is a common exam task. You may be asked to complete missing entries using group axioms or to deduce properties like identity and inverses.
凯莱表（又称群表）展示二元运算的所有可能结果。对于小阶有限群（约6阶及以下），构造凯莱表是常见考题。你可能需要利用群公理填补缺失项，或者推导单位元、逆元等性质。
Key principle: In a Cayley table, each row and column must contain each group element exactly once. This ‘Latin square’ property follows from the existence of inverses and cancellation laws.
关键原则：在凯莱表中，每行每列必须恰好包含每个群元素一次。这种“拉丁方阵”性质源于逆元的存在和消去律。
6. Order of a Group and Order of an Element | 群的阶与元素的阶
The order of a group G, denoted |G|, is the number of elements in G. The order of an element a ∈ G is the smallest positive integer n such that aⁿ = e, where e is the identity. If no such n exists, the element has infinite order.
群 G 的阶，记作 |G|，是 G 中元素的个数。元素 a ∈ G 的阶是最小的正整数 n，使得 aⁿ = e，其中 e 是单位元。若这样的 n 不存在，则该元素具有无限阶。
Example: In (ℤ₅\{0}, ×₅), the element 2 has order 4 because 2¹≡2, 2²≡4, 2³≡3, 2⁴≡1 (mod 5).
例如：在群 (ℤ₅\{0}, ×₅) 中，元素 2 的阶为 4，因为 2¹≡2, 2²≡4, 2³≡3, 2⁴≡1 (mod 5)。
The order of an element always divides the order of the group (Lagrange’s Theorem – see later). This is extremely useful for finding possible element orders in finite groups.
元素的阶一定整除群的阶（拉格朗日定理，见后文）。这一性质在求有限群中元素的可能阶数时极为有用。
7. Subgroups and Subgroup Tests | 子群与子群检验
A subset H of a group G is a subgroup if it is itself a group under the same operation. In exams, you usually apply a subgroup test rather than checking all four axioms anew. The two‑step test for a finite subset: (1) H is non‑empty; (2) H is closed under the operation. For general H, the one‑step test: check a * b⁻¹ ∈ H for all a, b ∈ H.
群 G 的子集 H 在相同运算下若自身构成群，则称之为子群。在考试中，通常使用子群检验法，而无需重新验证四条公理。对于有限子集，两步检验法为：(1) H 非空；(2) H 对运算封闭。对于一般子集，一步检验法：验证对所有 a, b ∈ H，有 a * b⁻¹ ∈ H。
Typical CIE question: Given a group G and a subset H (e.g. {e, a, a², …}), prove H is a subgroup. You must show the identity is in H, or show closure, depending on the test used.
典型 CIE 考题：给定群 G 及其子集 H（如 {e, a, a², …}），证明 H 是子群。你需要根据所选的检验法，证明单位元在 H 中或证明封闭性。
8. Cyclic Groups and Generators | 循环群与生成元
A group G is cyclic if there exists an element g ∈ G such that every element of G can be written as gᵏ for some integer k. Such g is called a generator. Cyclic groups are always Abelian, and their structure is fully determined by the order of the generator.
若存在元素 g ∈ G，使得 G 中每个元素都能写成 gᵏ 的形式（k 为整数），则称 G 为循环群。这样的 g 称为生成元。循环群总是阿贝尔群，且其结构完全由生成元的阶决定。
For example, (ℤₙ, +ₙ) is cyclic with generator 1. The group of rotations of a regular n‑gon is cyclic of order n. In questions, to show a group is cyclic, identify an element whose order equals |G|.
例如，(ℤₙ, +ₙ) 是循环群，生成元为 1。正 n 边形的旋转群是 n 阶循环群。在考题中，要证明群是循环群，你需要找到一个阶等于 |G| 的元素。
9. Lagrange’s Theorem and Its Consequences | 拉格朗日定理及其推论
Lagrange’s Theorem states that for any finite group G, the order of any subgroup H divides the order of G: |H| | |G|. Consequently, the order of any element a ∈ G divides |G|.
拉格朗日定理指出，对于任何有限群 G，任意子群 H 的阶必整除 G 的阶：|H| | |G|。由此推得，任意元素 a ∈ G 的阶整除 |G|。
This theorem is used heavily to determine possible structures of groups of a given order. For instance, a group of order 15 cannot have a subgroup of order 6 because 6 does not divide 15. It also helps prove that every group of prime order is cyclic, with no non‑trivial proper subgroups.
该定理广泛用于确定给定阶数的群的可能结构。例如，15 阶群不可能有 6 阶子群，因为 6 不整除 15。它也能帮助证明任意素数阶群都是循环群，且没有非平凡真子群。
10. Isomorphisms and Fundamental Structure | 同构与基本结构
Two groups G and H are isomorphic if there exists a bijective mapping φ: G → H that preserves the operation: φ(a * b) = φ(a) ∘ φ(b). Isomorphic groups are ‘essentially the same’ in algebraic structure, just relabelled. The CIE exam may ask you to prove two groups are isomorphic by constructing an explicit mapping, or to show they are not isomorphic by comparing properties (e.g. number of elements of a given order).
若存在双射 φ: G → H 保持运算，即 φ(a * b) = φ(a) ∘ φ(b)，则称群 G 和 H 同构。同构的群在代数结构上“本质上相同”，只是元素标签不同。CIE 考题可能要求通过构造显式映射来证明两群同构，或通过比较性质（如给定阶的元素个数）来证明它们不同构。
For example, the cyclic group of order 4 and the group {1, i, −1, −i} under multiplication are isomorphic via φ(1)=1, φ(g)=i, φ(g²)=−1, φ(g³)=−i.
例如，4 阶循环群与乘法群 {1, i, −1, −i} 同构，映射为 φ(1)=1, φ(g)=i, φ(g²)=−1, φ(g³)=−i。
Understanding isomorphism helps you classify groups up to order 7, a common synoptic topic.
理解同构有助于对阶数不超过 7 的群进行分类，这是常见的综合考点。
11. Proof Techniques and Common Pitfalls | 证明技巧与常见误区
Group theory exam questions often demand formal proofs. Master the following techniques:
- Uniqueness of identity and inverses: Assume two identities e and e’, then e = e * e’ = e’. Similarly for inverses, use associativity to show a₁⁻¹ = a₂⁻¹.
- 中文：单位元和逆元的唯一性：假设有两个单位元 e 和 e’，则 e = e * e’ = e’。类似地，利用结合律可证逆元唯一。
- Solving equations: In a group, a * x = b has the unique solution x = a⁻¹ * b. This uses associativity and inverses.
- 中文：解方程：在群中，方程 a * x = b 有唯一解 x = a⁻¹ * b，依赖结合律和逆元。
- Disproving a group: To show a set with an operation is not a group, it suffices to find a single counterexample to any axiom – closure or associativity failures are most common.
- 中文：证伪群结构：要证明一个集合和运算不构成群，只需针对任一条公理找到一个反例——封闭性或结合律失效最为常见。
Beware of assuming commutativity unless the group is known to be Abelian. Always work with the given operation precisely as defined.
除非已知群是阿贝尔群，切勿随意假定交换性。始终严格根据定义的运算进行推导。
12. Exam‑Style Practice and Strategy | 考试风格练习与策略
A typical CIE paper 3 (Further Pure Mathematics 2) or paper 4 (Further Probability & Statistics) does not contain group theory; it belongs to Further Pure Mathematics 1 (9231/01) or the new syllabus components. Questions often start by defining a binary operation on a set, asking you to verify group axioms, then find the identity, inverses, order of elements, and finally determine whether the group is cyclic or Abelian. Later parts may involve subgroups or isomorphisms with known groups of the same order.
典型的 CIE 卷 3 或卷 4 不包含群论；群论属于进阶纯数 1（9231/01）或新大纲相应部分。考题常先定义集合上的二元运算，要求验证群公理，然后找到单位元、逆元、元素的阶，最后判断群是否为循环群或阿贝尔群。后续部分可能涉及子群或与同阶已知群的同构。
To prepare, practise constructing Cayley tables for small sets, applying the one‑step subgroup test, and using Lagrange’s theorem to bound possible element orders. Remember that if |G| = p (prime), G is cyclic and every non‑identity element is a generator.
备考时，练习构造小集合的凯莱表、应用一步子群检验法，以及利用拉格朗日定理推断元素可能的阶。切记，若 |G| = p（素数），则 G 是循环群，且每个非单位元都是生成元。
Published by TutorHao | Further Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导