📚 A-Level AQA Further Maths: Introduction to Group Theory – Key Points | AQA A-Level进阶数学：群论入门考点精讲
Group theory is a central topic in AQA A-Level Further Mathematics, offering a formal way to study symmetry and algebraic structures. Exam questions frequently ask you to verify group axioms, construct Cayley tables, identify subgroups, apply Lagrange’s theorem, and determine properties such as whether a group is cyclic or abelian. This guide distills every essential concept and pinpoints the most common pitfalls, helping you approach any group theory question with confidence.
群论是AQA A-Level进阶数学的核心课题，它为研究对称性和代数结构提供了形式化的工具。考试题目经常要求学生验证群公理、构造凯莱表、判定子群、应用拉格朗日定理，并判断一个群是否为循环群或阿贝尔群。本文浓缩了所有必备概念，并指出了最常见的易错点，帮助你自信应对各类群论考题。
1. What is a Group? | 什么是群？
A group (G, *) is an algebraic structure consisting of a non‑empty set G together with a binary operation * that satisfies four axioms: closure, associativity, identity element, and inverse element. The operation can be addition, multiplication, composition of functions, or any rule that combines two elements to give another element of the same set.
群 (G, *) 是由一个非空集合 G 与一个二元运算 * 构成的代数结构，该运算必须满足四条公理：封闭性、结合律、单位元的存在以及逆元的存在。运算可以是加法、乘法、函数复合，或是任何能将集合中两个元素结合成同一集合中另一个元素的规则。
Closure: For all a, b ∈ G, the result a * b is also in G. Without closure, the set cannot form a group under the given operation.
封闭性：对所有 a, b ∈ G，运算结果 a * b 仍属于 G。如果不满足封闭性，该集合在该运算下不构成群。
Associativity: For all a, b, c ∈ G, (a * b) * c = a * (b * c). This property allows us to write products without brackets when the order is clear.
结合律：对所有 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. The identity depends on the operation: 0 for addition, 1 for multiplication, the identity permutation for composition.
单位元：存在一个元素 e ∈ G，使得对每个 a ∈ G 都有 e * a = a * e = a。单位元由运算决定：加法中为0，乘法中为1，复合运算中为恒等置换。
Inverse element: For each a ∈ G, there exists an element a⁻¹ ∈ G such that a * a⁻¹ = a⁻¹ * a = e. In additive notation, the inverse is written as −a.
逆元：对于每个 a ∈ G，存在元素 a⁻¹ ∈ G 使得 a * a⁻¹ = a⁻¹ * a = e。在加法记法下，a 的逆元写作 −a。
2. Examples of Groups | 群的例子
Recognising standard groups is vital for exam success. The table below lists some commonly tested groups, their sets, operations, identities, and whether they are abelian.
识别标准群对考试至关重要。下表列出了一些常考的群，给出了集合、运算、单位元以及是否为阿贝尔群。
| Group | Set | Operation | Identity | Abelian? |
|---|---|---|---|---|
| (ℤ, +) | Integers | Addition | 0 | Yes |
| (ℝ\{0}, ×) | Non‑zero real numbers | Multiplication | 1 | Yes |
| (ℂ\{0}, ×) | Non‑zero complex numbers | Multiplication | 1 | Yes |
| (S₃, ∘) | Permutations of 3 elements | Composition | Identity permutation | No |
| (G, ×) modulo p | {1,2,…,p−1} for prime p | Multiplication mod p | 1 | Yes |
In AQA exams you may need to prove that a given set and operation form a group. Always check closure first, then associativity (often inherited from a larger set), then identify the identity element, and finally verify that every element has an inverse.
在AQA考试中，你可能需要证明某个给定的集合与运算构成一个群。一定要先检查封闭性，再检查结合律（通常继承自一个更大的集合），然后找出单位元，最后验证每个元素都有逆元。
3. Abelian Groups | 阿贝尔群
A group (G, *) is called abelian (or commutative) if its operation satisfies the additional property: for all a, b ∈ G, a * b = b * a. Being abelian is a special property; many groups are non‑abelian.
如果一个群 (G, *) 的运算满足附加性质：对所有 a, b ∈ G，a * b = b * a，则称之为阿贝尔群（或交换群）。阿贝尔性是一种特殊性质，许多群都是非交换的。
To determine whether a group is abelian, examine the Cayley table: if the table is symmetric about the main diagonal, the group is abelian. Alternatively, find a pair of elements that do not commute. The symmetric group S₃ is a classic non‑abelian group because composing (12) after (23) differs from (23) after (12).
要判断一个群是否为阿贝尔群，可以观察它的凯莱表：如果表格关于主对角线对称，则该群是阿贝尔群。此外，也可以找出一对不交换的元素。对称群 S₃ 就是一个典型的非阿贝尔群，因为 (12) 后再 (23) 与 (23) 后再 (12) 的结果不同。
In modular arithmetic, groups of the form (ℤₙ, +) are always abelian, and the multiplicative group of non‑zero integers modulo a prime p, denoted by (ℤₚ*, ×), is also abelian.
在模运算中，形如 (ℤₙ, +) 的群总是阿贝尔群，非零整数模素数 p 的乘法群（记作 ℤₚ*）也是阿贝尔群。
4. Cayley Tables | 凯莱表
A Cayley table is a square grid that displays the result of the group operation for every pair of elements. It is a powerful tool for proving whether a set with a binary operation forms a group, because you can read off closure, identity, and inverses directly from the table.
凯莱表是一个方形网格，它展示每一对元素在群运算下的结果。它是证明一个集合与一个二元运算是否构成群的强有力工具，因为你可以直接从表中读出封闭性、单位元以及逆元。
When constructing a Cayley table, list the elements as row and column headings in the same order. Fill each cell with the result of the row element operated with the column element. For a group, every row and every column must be a permutation of the set’s elements (the ‘Latin square’ property).
在构造凯莱表时，将元素按相同顺序列为行标题和列标题。在每个单元格中填入行元素与列元素运算的结果。对于一个群，每一行和每一列都必须是对集合元素的一个排列（拉丁方性质）。
Example: the Cayley table for the group of integers modulo 4 under addition, G = {0,1,2,3} with operation + mod 4.
示例：模4整数加法群 G = {0,1,2,3} 的凯莱表，运算为模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 |
From the table we see the identity is 0, each element has an inverse (0 is self‑inverse, 1⁻¹=3, 2 is self‑inverse, 3⁻¹=1), and the table is symmetric, confirming it is abelian.
从表中可以看出单位元是0，每个元素都有逆元（0的逆元是自身，1⁻¹=3，2的逆元是自身，3⁻¹=1），并且表格对称，确认它是阿贝尔群。
5. Subgroups | 子群
A subset H of a group G is a subgroup if H itself forms a group under the same operation defined on G. The set H must be non‑empty, closed under the operation, and contain the inverse of each of its elements.
群 G 的一个子集 H 如果在 G 的运算下自身也构成一个群，则称 H 为 G 的子群。集合 H 必须非空，对运算封闭，且包含其每个元素的逆元。
A useful shortcut is the one‑step subgroup test: a non‑empty subset H ⊆ G is a subgroup if for any a, b ∈ H, the element a * b⁻¹ ∈ H. This combines closure and inverse check in a single condition.
一个实用的判别法是单步子群检验：对于非空子集 H ⊆ G，若对任意 a, b ∈ H 都有 a * b⁻¹ ∈ H，则 H 是子群。它将封闭性和逆元检验合并成一个条件。
Every group has two trivial subgroups: {e} and G itself. Non‑trivial subgroups are often found by taking powers of a single element. For example, in (ℤ₆, +), the set {0,3} is a subgroup because it is closed, contains the identity 0, and 3 is its own inverse (3+3=0 mod 6).
每个群都有两个平凡子群：{e} 和 G 自身。非平凡子群通常可以通过取单个元素的幂得到。例如，在 (ℤ₆, +) 中，集合 {0,3} 是一个子群，因为它封闭、包含单位元0，且3的逆元是自身（3+3 ≡ 0 mod 6）。
6. Lagrange’s Theorem | 拉格朗日定理
For any finite group G, the order of a subgroup H (its number of elements) divides the order of G. Symbolically, |H| divides |G|. This is one of the most powerful results in elementary group theory and is directly tested in AQA papers.
对于任意有限群 G，其任意子群 H 的阶（即元素个数）一定整除 G 的阶。用符号表示为 |H| 整除 |G|。这是初等群论中最有力的结论之一，在AQA试卷中经常直接考查。
Corollary 1: The order of any element a in a finite group G divides |G|. Since the order of a equals the order of the subgroup ⟨a⟩ generated by a, Lagrange’s theorem gives |a| divides |G|.
推论1：有限群 G 中任意元素 a 的阶整除 |G|。因为 a 的阶等于由 a 生成的子群 ⟨a⟩ 的阶，由拉格朗日定理可知 |a| 整除 |G|。
Corollary 2: Every group of prime order p is cyclic and isomorphic to ℤₚ under addition. There are no non‑trivial subgroups, and every non‑identity element generates the whole group.
推论2：每一个阶为素数 p 的群必为循环群，且同构于加法群 ℤₚ。它没有非平凡子群，每一个非单位元都能生成整个群。
Lagrange’s theorem also helps you quickly rule out impossible subgroup orders. For instance, a group of order 14 cannot have a subgroup of order 5 because 5 does not divide 14.
拉格朗
Published by TutorHao | A-Level Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
屏轩国际教育cambridge primary/secondary checkpoint, cat4, ukiset,ukcat,igcse,alevel,PAT,STEP,MAT, ibdp,ap,ssat,sat,sat2课程辅导，国外大学本科硕士研究生博士课程论文辅导