Introduction to Group Theory | 群论入门考点精讲

📚 Introduction to Group Theory | 群论入门考点精讲

Group theory is a foundational topic in pure mathematics that studies algebraic structures called groups. In the AQA A-Level Further Mathematics syllabus, a solid grasp of groups is essential for solving abstract problems, proving properties, and applying key theorems like Lagrange’s Theorem. This article provides a targeted revision guide, covering all major concepts from binary operations to symmetry groups, with clear examples and exam-focused explanations.

群论是纯数学中的基础课题，研究被称为“群”的代数结构。在 AQA A-Level 进阶数学大纲中，扎实掌握群论知识对于解决抽象问题、证明性质以及应用拉格朗日定理等关键定理至关重要。本文提供考点精讲，涵盖从二元运算到对称群的所有主要概念，配以清晰的示例和紧扣考点的解释。

1. Binary Operations and Closure | 二元运算与封闭性

A binary operation on a set S is a rule that combines any two elements a and b from S to produce a unique element, often denoted a * b, which also belongs to S. For a group, this property of staying within the set is called closure.

集合 S 上的二元运算是一种规则，它将 S 中的任意两个元素 a 和 b 组合起来，产生一个唯一元素，通常记作 a * b，并且该元素也属于 S。对于群来说，这种元素不离开集合的性质称为封闭性。

For example, addition on the set of integers ℤ is a binary operation: for any two integers m and n, m + n is an integer. However, subtraction on the set of positive integers ℤ⁺ is not closed because 2 − 5 = −3 is not in ℤ⁺.

例如，整数集 ℤ 上的加法是一个二元运算：对于任意两个整数 m 和 n，m + n 仍为整数。但是，正整数集 ℤ⁺ 上的减法不封闭，因为 2 − 5 = −3 不在 ℤ⁺ 中。

To check whether a given operation forms a group, you must first verify closure. This is often the first axiom tested in exam questions.

要检验给定的运算是否构成群，首先必须验证封闭性。这通常是考试题中测试的第一个公理。

2. The Four Group Axioms | 群的四大公理

A group (G, *) is a non-empty set G together with a binary operation * satisfying four axioms:

群 (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 e * a = a * e = a for all a ∈ G.
单位元：存在 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。

Order of checking: identity first then inverses is typical, but all must hold. If any axiom fails, the structure is not a group.

通常先验证单位元，再验证逆元，但所有公理都必须成立。若任一公理不满足，则该结构不是群。

3. Proving Associativity | 证明结合律

Associativity is often the trickiest axiom to prove directly. In AQA exams, you are usually allowed to assume associativity if the operation is ordinary addition or multiplication of numbers, or matrix multiplication, as these are known to be associative.

结合律往往是最难直接证明的公理。在 AQA 考试中，如果运算是普通的加法、乘法或矩阵乘法，由于它们已知满足结合律，通常允许直接假设。

When the operation is defined by a rule (e.g. a * b = a + b + 3), you must check associativity by verifying (a * b) * c = a * (b * c) algebraically. For instance, with the operation a * b = a + b − 3 on ℤ, both sides simplify to a + b + c − 6, confirming associativity.

当运算由某种规则定义时（例如 a * b = a + b + 3），你必须通过代数验证 (a * b) * c = a * (b * c)。例如，对 ℤ 上的运算 a * b = a + b − 3，两边都化简为 a + b + c − 6，从而确认结合律成立。

Never assume associativity for unfamiliar operations unless the question permits it.

除非题目允许，否则切不可对不熟悉的运算自行假设结合律成立。

4. Classic Examples of Groups | 群的经典例子

It is crucial to recognise standard examples of groups and their properties:

识别群的经典例子及其性质至关重要：

Group / 群	Set / 集合	Operation / 运算	Identity / 单位元
(ℤ, +)	Integers / 整数	Addition / 加法	0
(ℝ\{0}, ×)	Non-zero real numbers / 非零实数	Multiplication / 乘法	1
(ℂ, +)	Complex numbers / 复数	Addition / 加法	0 + 0i
(ℂ\{0}, ×)	Non-zero complex numbers / 非零复数	Multiplication / 乘法	1 + 0i
(M₂(ℝ), +)	2×2 real matrices / 2×2 实矩阵	Matrix addition / 矩阵加法	Zero matrix / 零矩阵

Note: M₂(ℝ) under multiplication is NOT a group because not all non-zero matrices have inverses (determinant zero matrices).

注意：M₂(ℝ) 在乘法下不是群，因为并非所有非零矩阵都有逆矩阵（行列式为零的矩阵就没有逆矩阵）。

5. Subgroups and the Subgroup Test | 子群与子群判别法

A subset H of a group G is a subgroup if H itself forms a group under the same operation. To prove H ≤ G, you can use the one-step subgroup test: H is non-empty and for any a, b ∈ H, a * b⁻¹ ∈ H.

群 G 的子集 H 如果在同一运算下单独构成一个群，则 H 是 G 的子群。要证明 H ≤ G，可以使用一步子群判别法：H 非空，并且对任意 a, b ∈ H，有 a * b⁻¹ ∈ H。

For example, the set of even integers 2ℤ is a subgroup of (ℤ, +) because it is non-empty, and for any even integers 2m and 2n, their “difference” (since the inverse of 2n is −2n) gives 2(m − n), which is even.

例如，偶数集 2ℤ 是 (ℤ, +) 的子群，因为它非空，且对任意偶数 2m 和 2n，它们的“差” (因为 2n 的逆元是 −2n) 得到 2(m − n)，仍然是偶数。

Commonly tested subgroups include cyclic subgroups generated by an element and the trivial subgroup {e}.

常考的子群包括由某个元素生成的循环子群，以及平凡子群 {e}。

6. Cyclic Groups | 循环群

A group G is cyclic if there exists an element g ∈ G such that every element of G can be expressed as gⁿ for some integer n. We write G = ⟨g⟩. The element g is called a generator.

如果存在元素 g ∈ G，使得 G 的每个元素都可表示为 gⁿ (n 为整数)，则称 G 为循环群，记作 G = ⟨g⟩。元素 g 称为生成元。

For additive cyclic groups like ℤₙ (integers modulo n), the generator is often 1 and the operation is addition modulo n. The group has order n, and its elements are {0, 1, 2, …, n−1}.

对于 ℤₙ (模 n 整数) 这类加法循环群，生成元通常是 1，运算为模 n 加法。该群的阶为 n，元素为 {0, 1, 2, …, n−1}。

Important properties: Cyclic groups are always Abelian (commutative). The order of the generator equals the order of the group. Subgroups of a cyclic group are also cyclic.

重要性质：循环群总是阿贝尔群（可交换的）。生成元的阶等于群的阶。循环群的子群也是循环群。

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

The order of a group G is the number of elements in the set G, denoted |G|. The order of an element a in G is the smallest positive integer n such that aⁿ = e (in multiplicative notation) or na = e (in additive notation). If no such n exists, the element has infinite order.

群 G 的阶是集合 G 中元素的个数，记作 |G|。元素 a 的阶是满足 aⁿ = e (乘法记法) 或 na = e (加法记法) 的最小正整数 n。如果不存在这样的 n，则该元素具有无限阶。

In (ℤ₄, + mod 4), the element 2 has order 2 because 2 + 2 ≡ 0 mod 4. In (ℝ\{0}, ×), the element −1 has order 2, while 2 has infinite order.

在 (ℤ₄, 模 4 加法) 中，元素 2 的阶为 2，因为 2 + 2 ≡ 0 mod 4。在 (ℝ\{0}, ×) 中，元素 −1 的阶为 2，而 2 具有无限阶。

The order of an element always divides the order of the group when the group is finite – a consequence of Lagrange’s Theorem.

当群是有限群时，元素的阶总是整除群的阶 —— 这是拉格朗日定理的推论。

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

For any finite group G and any subgroup H of G, the order of H divides the order of G. This is one of the most powerful results in elementary group theory.

对于任何有限群 G 及其任意子群 H，H 的阶整除 G 的阶。这是初等群论中最强有力的结论之一。

In symbolic form: |H| divides |G|. Consequently, the order of every element in G must also divide |G|, because the cyclic subgroup generated by an element has size equal to the order of that element.

用符号表示：|H| 整除 |G|。因此，G 中每个元素的阶也必然整除 |G|，因为由某元素生成的循环子群的大小等于该元素的阶。

Application: If a group has order 7 (a prime), its only subgroups are the trivial subgroup and the group itself; moreover, the group must be cyclic.

应用：如果一个群的阶为 7 (素数)，那么它的子群只有平凡子群和群本身；此外，该群必定是循环群。

9. Cayley Tables and Group Structure | 凯莱表与群结构

A Cayley table (or group table) is a grid showing the results of applying the binary operation to every pair of elements. It is useful for checking closure and spotting properties like commutativity.

凯莱表（群表）是一个展示每对元素进行二元运算所得结果的表格。它对于检验封闭性和发现交换性等性质很有帮助。

For a group of order 4, a typical table might look like this for the cyclic group ℤ₄:

对于阶为 4 的群，循环群 ℤ₄ 的一个典型表格可能如下所示：

+ (mod 4) | 0 1 2 3
0 | 0 1 2 3
1 | 1 2 3 0
2 | 2 3 0 1
3 | 3 0 1 2

Notice each row and each column contains each element exactly once — a property known as the Latin square condition, which holds for all finite groups.

注意到每行每列恰好包含每个元素一次 —— 这称为拉丁方性质，对所有有限群都成立。

Building and interpreting Cayley tables is a common exam task, often used to identify isomorphism between groups.

构建并解读凯莱表是常见的考试任务，通常用于识别群之间的同构关系。

10. Abelian and Non-Abelian Groups | 阿贝尔群与非阿贝尔群

A group G is Abelian (commutative) if a * b = b * a for all a, b ∈ G. Many common groups are Abelian, such as (ℤ, +), (ℝ\{0}, ×), and all cyclic groups.

若对群 G 中所有 a, b 都有 a * b = b * a，则 G 是阿贝尔群（可交换的）。许多常见群都是阿贝尔群，如 (ℤ, +)、(ℝ\{0}, ×) 以及所有循环群。

The smallest non-Abelian group is the symmetric group S₃, which consists of the six permutations of three objects. Its order is 6, and its Cayley table is not symmetric about the main diagonal, confirming non-commutativity.

最小的非阿贝尔群是对称群 S₃，它由三个对象的全部六种排列组成。它的阶为 6，其凯莱表不沿主对角线对称，从而确认了不可交换性。

In AQA problems, you may be asked to prove a given group is Abelian by showing (a * b)² = a² * b² or similar identities, using the given operation or group properties.

在 AQA 问题中，可能会利用给定运算或群性质，要求证明某群为阿贝尔群，通常是通过证明 (a * b)² = a² * b² 等恒等式来完成。

11. Symmetry and Permutation Groups | 对称与置换群

Groups can describe symmetries of geometric shapes. For example, the group of symmetries of an equilateral triangle (including rotations and reflections) is D₃, the dihedral group of order 6, which is isomorphic to S₃.

群可以描述几何图形的对称性。例如，等边三角形的对称群（包括旋转和反射）是 D₃，它是阶为 6 的二面体群，与 S₃ 同构。

A permutation group is a set of permutations of a finite set that forms a group under composition. The symmetric group Sₙ on n symbols has order n!. The elements are written in cycle notation, e.g. (1 2 3) means 1→2, 2→3, 3→1.

置换群是有限集上的一些排列组成的集合，这些排列在复合运算下构成群。n 个符号上的对称群 Sₙ 的阶为 n!。元素用轮换记法表示，例如 (1 2 3) 表示 1→2, 2→3, 3→1。

Understanding cycle structure helps determine the order of a permutation: the order is the least common multiple of the cycle lengths.

理解轮换结构有助于确定排列的阶：排列的阶是各个轮换长度的最小公倍数。

12. Isomorphism – Recognising Same Structures | 同构 —— 识别相同结构

Two groups (G, *) and (H, ◦) are isomorphic if there exists a bijective function f: G → H such that f(a * b) = f(a) ◦ f(b) for all a, b ∈ G. Isomorphic groups have identical group tables up to relabelling of elements.

如果存在双射函数 f: G → H，使得对所有 a, b ∈ G 有 f(a * b) = f(a) ◦ f(b)，则群 (G, *) 和 (H, ◦) 同构。同构的群具有相同的群表，仅仅元素名称不同。

All groups of order 2 are isomorphic to ℤ₂; all groups of order 3 are isomorphic to ℤ₃; but there are exactly two non-isomorphic groups of order 4: the cyclic group ℤ₄ and the Klein four-group V₄.

所有阶为 2 的群都与 ℤ₂ 同构；所有阶为 3 的群都与 ℤ₃ 同构；但阶为 4 的群恰好有两种不同构的类型：循环群 ℤ₄ 和克莱因四元群 V₄。

Exam questions often ask you to determine whether two group tables represent isomorphic groups by comparing element orders and table patterns.

考题常要求通过比较元素阶和表格规律，判定两个群表是否代表同构的群。

13. Common Pitfalls and Exam Tips | 常见错误与应试技巧

Mischecking closure: Always test border cases and ensure the result stays in the set. For modulo groups, be careful with the set definition (e.g. ℤ₅ = {0,1,2,3,4}).
错误检验封闭性：总是测试边界情况，确保结果留在集合内。对于模群，要注意集合定义（例如 ℤ₅ = {0,1,2,3,4}）。
Forgetting the identity or inverse for non-standard operations: Solve a * e = a to find e, then a * a⁻¹ = e to find a⁻¹ explicitly.
忘记非标准运算的单位元和逆元：通过解方程 a * e = a 求 e，再解 a * a⁻¹ = e 求 a⁻¹。
Assuming all groups are commutative: Only proceed if proven or if given an Abelian group. Check with a Cayley table.
假设所有群都可交换：只有经过证明或已知是阿贝尔群时才能这么做。可用凯莱表检验。
Lagrange misuse: The converse is false: just because a number divides |G| does NOT mean there must be a subgroup of that order.
拉格朗日定理的误用：逆命题不成立：仅仅因为某个数整除 |G|，并不意味着一定存在该阶的子群。
Cycle notation errors: (1 2 3) is NOT the same as (1 3 2); the order of a product of disjoint cycles is the LCM of their lengths.
轮换记法错误：(1 2 3) 与 (1 3 2) 不同；不相交轮换之积的阶是各轮换长度之最小公倍数。

Always present your reasoning clearly; AQA examiners reward logical steps even if the final conclusion is incomplete. Memorise the axioms and standard counterexamples.

始终清晰地展示推理过程；即使最终结论不完整，AQA 考官也会奖励逻辑步骤。熟记公理和标准反例。

Published by TutorHao | AQA Mathematics Revision Series | aleveler.com

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

Introduction to Group Theory | 群论入门考点精讲