A-Level Edexcel Further Maths: Introduction to Group Theory | A-Level Edexcel 进阶数学：群论入门考点精讲

📚 A-Level Edexcel Further Maths: Introduction to Group Theory | A-Level Edexcel 进阶数学：群论入门考点精讲

Group theory is a core topic in the Edexcel Further Pure 2 syllabus, introducing abstract algebraic structures that underpin many areas of mathematics. This revision guide covers essential definitions, worked examples, and key theorems such as Lagrange’s Theorem to help you master group theory for your exams.

群论是 Edexcel 进阶纯数 2 大纲的核心主题，介绍支撑许多数学领域的抽象代数结构。本复习指南涵盖基本定义、示例和拉格朗日定理等关键定理，有助于你掌握群论以应对考试。

1. Binary Operations | 二元运算

A binary operation ∗ on a set S is a rule that assigns to each ordered pair (a, b) of elements of S a unique element a ∗ b also belonging to S. This property of remaining within the set is called closure, and it is the very first condition we check when investigating possible group structures. Without closure, the operation does not even produce results inside the universe we are considering.

集合 S 上的二元运算 ∗ 是一种规则，它将 S 中元素的每一个有序对 (a, b) 映到 S 中唯一的元素 a ∗ b。这种结果仍留在集合内的性质称为封闭性，也是我们在研究可能的群结构时最先检验的条件。如果没有封闭性，运算甚至无法在我们考虑的论域中产生结果。

Common binary operations include the usual addition and multiplication on number sets such as ℤ, ℚ, ℝ and ℂ. For instance, on ℤ the operation of subtraction is a binary operation because the difference of any two integers is again an integer. However, division on ℤ is not a binary operation because, for example, 1 ÷ 2 is not an integer, so closure fails.

常见的二元运算包括在数集如 ℤ、ℚ、ℝ 和 ℂ 上的普通加法和乘法。例如，在 ℤ 上减法是一个二元运算，因为任意两个整数的差仍为整数。但 ℤ 上的除法不是二元运算，因为比如 1 ÷ 2 不是整数，因此不满足封闭性。

2. Group Axioms | 群公理

A set G together with a binary operation ∗ forms a group (G, ∗) if the following four axioms are satisfied:

集合 G 连同二元运算 ∗ 构成一个群 (G, ∗)，如果满足以下四条公理：

Closure: For all a, b ∈ G, a ∗ b ∈ G.
封闭性：对所有 a, b ∈ G，有 a ∗ b ∈ G。
Associativity: For all a, b, c ∈ G, a ∗ (b ∗ c) = (a ∗ b) ∗ c.
结合律：对所有 a, b, c ∈ G，有 a ∗ (b ∗ c) = (a ∗ b) ∗ c。
Identity element: There exists an element e ∈ G such that for all a ∈ G, e ∗ a = a ∗ e = a.
单位元：存在元素 e ∈ G，使得对所有 a ∈ G，有 e ∗ a = a ∗ e = a。
Inverse element: For each a ∈ G, there exists an element a⁻¹ ∈ G such that a ∗ a⁻¹ = a⁻¹ ∗ a = e.
逆元：对每个 a ∈ G，存在元素 a⁻¹ ∈ G，使得 a ∗ a⁻¹ = a⁻¹ ∗ a = e。

The set of integers under addition, (ℤ, +), is a group: it is closed, addition is associative, the identity is 0, and the inverse of n is −n. In contrast, the natural numbers ℕ = {1, 2, 3, …} under addition does not form a group because there is no identity element (0 is missing) and no inverses.

整数集在加法下 (ℤ, +) 是一个群：它是封闭的，加法满足结合律，单位元是 0，n 的逆元是 −n。相比之下，自然数集 ℕ = {1, 2, 3, …} 在加法下不构成群，因为没有单位元（缺少0）也没有逆元。

The non-zero real numbers under multiplication, (ℝ\\{0}, ×), also form a group. The identity is 1 and the inverse of x is 1/x. Notice that all non-zero real numbers have multiplicative inverses, so the group structure is preserved once we remove zero.

非零实数在乘法下 (ℝ\\{0}, ×) 也构成一个群。单位元是 1，x 的逆元是 1/x。注意当去掉零之后，所有非零实数都有乘法逆元，从而保持群结构。

3. Examples of Groups | 群的例子

Apart from the familiar number groups, Edexcel FP2 examines several finite groups commonly represented by their order or symmetry. The trivial group contains only the identity element, {e}, with the obvious operation. The cyclic group C₂ has elements {e, a} and operation defined by a² = e, which is isomorphic to the group of signs {1, -1} under multiplication.

除了熟悉的数群，Edexcel FP2 还考察几个常用阶数或对称性表示的有限群。平凡群只含单位元 {e} 和明显的运算。循环群 C₂ 包含元素 {e, a}，运算满足 a² = e，它与乘法下的符号群 {1, -1} 同构。

Symmetry groups provide a rich source of examples. The dihedral group D₃ describes the symmetries of an equilateral triangle; its group table will be discussed later. Another important family is the set of nth roots of unity under multiplication, forming a cyclic group of order n.

对称群提供了丰富的例子。二面体群 D₃ 描述等边三角形的对称性；其后会讨论它的群表。另一个重要的例子是 n 次单位根的乘法群，它构成一个 n 阶循环群。

4. Group Tables (Cayley Tables) | 群表（凯莱表）

For a finite group, a Cayley table displays the result of the binary operation for every pair of elements. Each row and column must contain every group element exactly once — a property known as the Latin square condition, which follows from the existence of inverses.

对于有限群，凯莱表展示了每一对元素运算的结果。每一行和每一列都必须正好包含每个群元素一次——这是拉丁方性质，由逆元的存在性保证。

Constructing a group table from axioms is a common exam task. For a group of order 3, {e, a, b}, using the fact that a² ≠ a (otherwise a = e), we deduce a² = b and then b² = a, giving the table:

根据公理构造群表是常见的考试任务。对于一个3阶群 {e, a, b}，利用 a² ≠ a（否则 a = e）可推出 a² = b，进而 b² = a，得到下表：

∗	e	a	b
e	e	a	b
a	a	b	e
b	b	e	a

Table caption: Cayley table for a group of order 3, which is essentially the cyclic group C₃.

表标题：3阶群的凯莱表，本质上就是循环群 C₃。

When verifying group axioms from a table, check that the identity leaves rows and columns unchanged, each element appears exactly once in every row/column, and the table is associative (though usually assumed if the table is constructed correctly).

从群表验证公理时，要检查单位元使所在行和列保持不变，每个元素在每行/每列恰好出现一次，以及表满足结合律（如果构造正确通常自动满足）。

5. Order of a Group and Order of an Element | 群的阶与元素的阶

The order of a group G, denoted |G|, is simply the number of elements in the set G. For an element g ∈ G, the order of g is the smallest positive integer n such that gⁿ = e, where the operation is applied repeatedly. If no such n exists, the element has infinite order.

群 G 的阶，记作 |G|，就是集合 G 中元素的个数。对于元素 g ∈ G，g 的阶是使得 gⁿ = e 成立的最小正整数 n，其中运算是重复施加。若不存在这样的 n，则该元素具有无限阶。

In the additive group (ℤ₆, +) of integers modulo 6, the element 2 has order 3 because 2+2+2 = 6 ≡ 0 (mod 6). In the multiplicative group of non-zero reals, the element −1 has order 2 since (−1)² = 1. The identity is always of order 1.

在整数模6的加法群 (ℤ₆, +) 中，元素 2 的阶为 3，因为 2+2+2 = 6 ≡ 0 (mod 6)。在非零实数乘法群中，元素 −1 的阶为 2，因为 (−1)² = 1。单位元的阶总是 1。

6. Subgroups | 子群

A subset H of a group G is a subgroup of G if H is itself a group under the same binary operation inherited from G. To verify that H is a subgroup, candidates often use the subgroup test: H is non-empty, and for all a, b ∈ H, a ∗ b⁻¹ ∈ H. This single condition checks closure, identity and inverses simultaneously.

群 G 的子集 H 称为 G 的子群，如果 H 本身在继承自 G 的二元运算下也构成一个群。为验证 H 是子群，考生常使用子群判定法：H 非空，且对所有 a, b ∈ H，有 a ∗ b⁻¹ ∈ H。这一条件同时检验了封闭性、单位元与逆元的存在性。

For (ℤ, +), the set of even integers 2ℤ is a subgroup. For the cyclic group C₄ = {e, a, a², a³}, the subset {e, a²} forms a subgroup of order 2. Every group has at least the trivial subgroup {e} and the whole group G as subgroups.

在 (ℤ, +) 中，偶数集 2ℤ 是一个子群。对于循环群 C₄ = {e, a, a², a³}，子集 {e, a²} 构成一个 2 阶子群。每个群至少有两个子群：平凡子群 {e} 以及 G 本身。

7. Cyclic Groups | 循环群

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. In this case we write G = ⟨g⟩ and call g a generator. Cyclic groups are the simplest type of groups and appear frequently in exam questions.

群 G 是循环的，如果存在元素 g ∈ G 使得 G 中每个元素都可写成 gᵏ 的形式，其中 k 为整数。此时记 G = ⟨g⟩，并称 g 为生成元。循环群是最简单的一类群，在考题中频繁出现。

The additive group (ℤₙ, +) is cyclic with generator 1. The multiplicative group of complex nth roots of unity, {e^(2πi k/n) : k = 0,1,…,n-1}, is also cyclic of order n, generated by e^(2πi/n). Infinite cyclic groups, like ℤ under addition, have generators ±1.

加法群 (ℤₙ, +) 是循环群，生成元为 1。复数 n 次单位根的乘法群 {e^(2πi k/n) : k = 0,1,…,n-1} 也是 n 阶循环群，生成元为 e^(2πi/n)。无限循环群，如加法下的 ℤ，生成元为 ±1。

If |G| = n and G is cyclic, then for any divisor d of n, G has exactly one subgroup of order d.

若 |G| = n 且 G 为循环群，则对 n 的任意因子 d，G 恰好有一个 d 阶子群。

8. Group Isomorphisms | 群同构

Two groups (G, ∗) and (H, ∘) are isomorphic if there exists a bijective function φ: G → H such that for all a, b ∈ G, φ(a ∗ b) = φ(a) ∘ φ(b). This structure-preserving map shows the groups are essentially the same, differing only by relabelling of elements.

如果存在双射 φ: G → H 使得对所有 a, b ∈ G，有 φ(a ∗ b) = φ(a) ∘ φ(b)，则两个群 (G, ∗) 和 (H, ∘) 同构。这种保持结构的映射表明两个群本质相同，仅元素标签不同。

To prove two groups are isomorphic in an exam, you need to define an explicit mapping and verify the conditions: one-to-one, onto, and the homomorphism property. Common examples include showing that C₂ × C₃ is isomorphic to C₆, or that the symmetry group of a rectangle (Klein four-group V) is isomorphic to C₂ × C₂.

在考试中证明两个群同构需要明确定义一个映射并验证：单射、满射以及同态性质。常见例子包括证明 C₂ × C₃ 同构于 C₆，或矩形的对称群（克莱因四元群 V）同构于 C₂ × C₂。

Note that if two groups have different orders, or different numbers of elements of a given order, they cannot be isomorphic. This provides a quick non-isomorphism argument.

注意，如果两个群的阶不同，或某一特定阶的元素个数不同，则它们不可能同构。这提供了一个快速的非同构论证思路。

9. Lagrange’s Theorem | 拉格朗日定理

Lagrange’s Theorem is a central result in FP2 group theory: If G is a finite group and H is a subgroup of G, then the order of H divides the order of G. Symbolically, |H| ∣ |G|.

拉格朗日定理是 FP2 群论的核心结论：若 G 是有限群，H 是 G 的子群，则 H 的阶整除 G 的阶。符号表示为 |H| ∣ |G|。

This theorem has powerful consequences. For any element a ∈ G, the order of a must divide |G|, because the cyclic subgroup ⟨a⟩ generated by a is a subgroup. Therefore, in a group of order 6, no element can have order 4, because 4 does not divide 6.

这个定理有很强的推论。对任意元素 a ∈ G，a 的阶必须整除 |G|，因为由 a 生成的循环子群 ⟨a⟩ 是一个子群。因此，在一个 6 阶群中，不可能有 4 阶元素，因为 4 不整除 6。

Lagrange’s Theorem is also used to prove that every group of prime order is cyclic, and to determine all possible subgroup structures of a given group. When asked to find all subgroups of a group of order 12, you only consider divisors of 12.

拉格朗日定理还可用于证明任意素数阶群都是循环群，并用来确定给定群的所有可能子群结构。当要求找出一个 12 阶群的所有子群时，只需考虑 12 的因子。

10. Common Pitfalls and Exam Tips | 常见错误与考试技巧

Always check closure first. When asked to decide whether a set with an operation forms a group, begin by verifying that the operation is actually a binary operation on the set. Many marks are lost because closure is forgotten or mistakenly assumed.

务必先检查封闭性。遇到判断某集合与运算是否构成群的问题时，首先要验证该运算确实是该集合上的二元运算。不少考生因遗忘或误判封闭性而失分。

Associativity is often given or obvious, but you must state it. For most standard operations like addition or multiplication modulo n, associativity can be quoted. For a custom operation defined by a table, you may need to test a specific counterexample if non-associative; otherwise state that it appears associative.

结合律通常已知或显然，但必须明确陈述。对于模 n 加法或乘法等标准运算，可直接引用其结合律。对于用群表定义的自定义运算，如需证明不满足结合律则要给出具体反例；否则说明其满足结合律即可。

Use symmetry to speed up table construction. A Cayley table for an abelian group is symmetric about the main diagonal. In fact, any group table must be a Latin square, and it is highly constrained by the identity and inverse properties. Start by filling the identity row/column, then use the fact that a² = e or other generator properties to complete.

利用对称性加快群表构造。交换群的凯莱表关于主对角线对称。事实上，任何群表必须满足拉丁方，且受单位元和逆元性质的严格约束。先填写单位元所在的行/列，再利用 a² = e 或其他生成元性质完成。

When proving isomorphism, give a clear mapping. State φ(x) explicitly, verify injectivity and surjectivity, and finally confirm φ(ab) = φ(a)φ(b). If a direct explicit formula is unclear, you can match the generators and their orders.

证明同构时，给出清晰的映射。明确叙述 φ(x)，验证单射与满射，最后确认 φ(ab) = φ(a)φ(b)。若难以给出直接公式，可以通过匹配生成元及其阶来处理。

Invoke Lagrange’s Theorem wisely. In deduction questions, remember that the order of an element must divide the group order. If you are asked to find the order of an element in a group of order 8, you can eliminate orders that are not divisors of 8. If a group has exactly one element of order 2, it must be central, etc.

合理运用拉格朗日定理。在推理题中，记住元素的阶必须整除群阶。如果要求找出一个 8 阶群中某元素的阶，可排除不整除 8 的那些可能值。若群中恰有一个 2 阶元素，则该元素必属于中心，等等。

Mastering group tables, subgroup tests and Lagrange’s Theorem will equip you to handle most FP2 group theory questions confidently. Practise past papers and always structure your solutions by explicitly stating which axiom or theorem you are using.

掌握群表、子群判定法以及拉格朗日定理将使你有信心处理绝大多数 FP2 群论问题。多练习历年真题，在解答时始终明确陈述用了哪条公理或定理，规范书写结构。

Published by TutorHao | Further Maths Revision Series | aleveler.com

更多咨询请联系16621398022（同微信）

A-Level Edexcel Further Maths: Introduction to Group Theory | A-Level Edexcel 进阶数学：群论入门 考点精讲