A-Level OCR Mathematics: Introduction to Group Theory Key Points | A-Level OCR 数学：群论入门 考点精讲

📚 A-Level OCR Mathematics: Introduction to Group Theory Key Points | A-Level OCR 数学：群论入门 考点精讲

Group theory is a beautiful area of abstract algebra that underpins modern mathematics and physics. In the OCR A-Level Further Mathematics specification, the Introduction to Group Theory module provides a first taste of axiomatic thinking, where we move beyond numbers and explore structures defined by a set and a binary operation. This article carefully walks through the essential concepts and typical exam questions, helping you build a clear, logical understanding of groups, subgroups, cyclic groups, group tables, and isomorphisms.

群论是抽象代数中的一个美丽分支，为现代数学和物理学奠定了基础。在 OCR A-Level 进阶数学考试中，“群论入门”模块让我们初次接触公理化思维，从单纯的数字运算转向研究由集合和二元运算定义的结构。本文系统梳理核心概念和典型考题，帮助你清晰、有逻辑地理解群、子群、循环群、群表和同构。

1. Axioms of a Group | 群的定义公理

A group (G, ∘ ) is a non‑empty set G together with a binary operation ∘ that satisfies four axioms: closure, associativity, identity, and invertibility. Closure means for all a, b ∈ G, a ∘ b ∈ G. Associativity requires (a ∘ b) ∘ c = a ∘ (b ∘ c) for all a, b, c ∈ G. There must exist an identity element e ∈ G such that e ∘ a = a ∘ e = a for all a ∈ G. Finally, every element a ∈ G must have an inverse a⁻¹ ∈ G satisfying a ∘ a⁻¹ = a⁻¹ ∘ a = e.

一个群 (G, ∘ ) 是一个非空集合 G 连同其上的二元运算 ∘，满足四条公理：封闭性、结合律、有单位元、有逆元。封闭性指对任意 a, b ∈ G，有 a ∘ b ∈ G。结合律要求对所有 a, b, c ∈ G，(a ∘ b) ∘ c = a ∘ (b ∘ c)。必须存在单位元 e ∈ G，使得对所有 a ∈ G 有 e ∘ a = a ∘ e = a。最后，每个元素 a ∈ G 必须存在逆元 a⁻¹ ∈ G，满足 a ∘ a⁻¹ = a⁻¹ ∘ a = e。

Common pitfalls include confusing the identity with the number 1 or 0; remember that the identity depends on the operation. For example, in a group under addition modulo n, the identity is 0, while under multiplication modulo n (for eligible sets), the identity is 1. Also, always check closure carefully—many candidates lose marks by assuming a set is closed without verifying it against the operation.

常见误区包括混淆单位元与数字 1 或 0；应记住单位元取决于运算。例如，在模 n 加法群中，单位元是 0；而在模 n 乘法群（符合条件的集合）中，单位元是 1。此外，务必认真检验封闭性——许多考生因未加验证就假设集合对运算封闭而失分。

2. Finite Groups and Order | 有限群与阶

The order of a finite group G, denoted |G|, is the number of elements in its set. The order of an element a ∈ G is the smallest positive integer n such that aⁿ = e (where aⁿ means applying the operation repeatedly). If no such n exists, the element has infinite order, though in the OCR syllabus we primarily work with finite groups.

有限群 G 的阶，记为 |G|，是该群集合中元素的个数。元素 a ∈ G 的阶是指满足 aⁿ = e 的最小正整数 n（其中 aⁿ 表示重复运用该运算）。若不存在这样的 n，则该元素具有无限阶；但在 OCR 大纲中，我们主要研究有限群。

For instance, in the symmetric group S₃, which has order 6, the 3‑cycle (1 2 3) has order 3 because applying it three times returns to the identity. The transposition (1 2) has order 2. An important result is Lagrange’s theorem, which states that the order of a subgroup divides the order of the group, and consequently the order of any element must divide the group order.

例如，在 6 阶对称群 S₃ 中，3‑轮换 (1 2 3) 的阶为 3，因为重复三次回到恒等置换；对换 (1 2) 的阶为 2。一条重要结论是拉格朗日定理：子群的阶整除群的阶；因此，任一元素的阶也必然整除群的阶。

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

A Cayley table is a square grid used to display the results of the binary operation for a finite group. Each row and column is headed by an element of the group; the entry in row a, column b is a ∘ b. Properties such as closure, identity, and inverses can be read directly from the table. In a valid group table, every element appears exactly once in each row and column (a consequence of the cancellation laws).

凯莱表是展示有限群二元运算结果的方格表。每一行和每一列的首部均为群中元素；第 a 行与第 b 列的交叉项即为 a ∘ b。封闭性、单位元和逆元等性质可直接从表中读取。在一个正确的群表中，每个元素恰好在每一行和每一列中各出现一次（这是消去律的推论）。

When constructing a Cayley table in an exam, start by filling the identity row and column, then use the Latin square property and the given relations to deduce missing entries. Always check that the table is symmetric if the group is Abelian (commutative). A common question asks you to recognise the group structure from a given table—for example, a group of order 4 might be isomorphic to the cyclic group C₄ or the Klein four‑group V₄.

在考试中构造凯莱表时，先填入单位元所在行和列，然后利用拉丁方性质及已知关系推导其余位置。若群是阿贝尔群（交换群），需检验表是否对称。常见考题要求根据给出的表识别群的结构——例如，一个 4 阶群可能同构于循环群 C₄ 或克莱因四元群 V₄。

4. Subgroups and Conditions | 子群及其条件

A non‑empty subset H of a group G is a subgroup if H itself forms a group under the operation of G. To prove H is a subgroup, you can use the subgroup test: check that for all a, b ∈ H, a ∘ b⁻¹ ∈ H. This single condition guarantees that H contains the identity, is closed under the operation, and contains inverses.

若群 G 的非空子集 H 在 G 的运算下自身也构成群，则称 H 为 G 的子群。要证明 H 是子群，可使用子群判别法：对任意 a, b ∈ H，验证 a ∘ b⁻¹ ∈ H。这一条件足以确保 H 包含单位元、对运算封闭且包含逆元。

Another useful condition is that if H is finite and closed under the operation, then it is automatically a subgroup. In OCR papers, you are often asked to list all subgroups of a given group or to verify that a specific subset forms a subgroup. Remember that the trivial subgroups are {e} and G itself; proper subgroups are all others.

另一个有用结论是：若 H 为有限集且对运算封闭，则它自动成为子群。在 OCR 试卷中，常要求列出某一给定群的所有子群，或验证某个特定子集能否构成子群。请记住，平凡子群为 {e} 和 G 本身；除此之外均为真子群。

5. 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. That element g is called a generator of the group, and we write G = ⟨g⟩. Cyclic groups are the simplest and most predictable groups; they are always Abelian.

若群 G 中存在元素 g ∈ G，使得 G 中每一个元素均可表为 gᵏ（k 为某整数），则称 G 为循环群。该元素 g 称为群的生成元，记作 G = ⟨g⟩。循环群是最简单、最可预测的群；它们必定是阿贝尔群。

On the OCR exam, you might be asked to list all generators of a cyclic group. For example, in the additive group ℤ₆ under modulo 6, the generators are the numbers coprime to 6, namely 1 and 5. For a cyclic group of order n, the number of distinct generators is φ(n), where φ is Euler’s totient function. This link with number theory is a popular source of extension questions.

OCR 考试可能要求列出一个循环群的所有生成元。例如，在模 6 加法群 ℤ₆ 中，生成元是与 6 互质的数，即 1 和 5。对于 n 阶循环群，不同生成元的个数为 φ(n)，其中 φ 是欧拉函数。这一与数论的关联常出现在扩展题中。

6. Symmetric Groups and Permutation Notation | 对称群与置换记法

The symmetric group Sₙ is the group of all permutations of n distinct symbols. The group operation is composition of permutations. Permutations can be written in two ways: two‑line notation and cycle notation. Cycle notation is far more concise and is used in OCR exams. For example, the permutation that sends 1 → 2, 2 → 3, 3 → 1 can be written as (1 2 3).

对称群 Sₙ 是 n 个不同符号的所有置换组成的群。群运算是置换的复合。置换可以写成双行记法和轮换记法两种形式。轮换记法更为简洁，也被 OCR 考试采用。例如，将 1 → 2, 2 → 3, 3 → 1 的置换记作 (1 2 3)。

When composing permutations, always apply the right‑most permutation first. To find the order of a permutation expressed in disjoint cycles, compute the least common multiple of the cycle lengths. For S₄, some permutations have order 1, 2, 3, or 4, while the maximum order in S₅ can be 6 (a 2‑cycle and a 3‑cycle). Understanding cycle structure is key to answering questions on conjugacy classes, but at the introductory level the focus is on cycle decomposition and order calculations.

复合置换时，应始终先作用最右边的置换。要计算以不相交轮换表示的置换的阶，只需计算各轮换长度的最小公倍数。在 S₄ 中，置换的阶可为 1、2、3 或 4；在 S₅ 中最大阶可达 6（一个 2‑轮换和一个 3‑轮换的积）。理解轮换结构是回答共轭类问题的关键，但在入门阶段，重点放在轮换分解和阶的计算上。

7. Isomorphisms and Structure | 同构与群的结构

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. Such a function is called an isomorphism, and it preserves the group structure completely. Isomorphic groups are essentially the same abstract group; they just have different labellings of elements.

若存在双射 f : G → H，使得对所有 a, b ∈ G 都有 f (a ∘ b) = f (a) ∗ f (b)，则称两个群 (G, ∘ ) 和 (H, ∗ ) 同构。这样的函数称为同构映射，它完全保持群的结构。同构的群本质上是相同的抽象群，仅仅是元素的标签不同。

A standard exam task is to prove two groups are isomorphic by constructing an explicit mapping, often between a group of order 4 and the Klein four‑group or a cyclic group. Another typical question is to show that two groups are not isomorphic—for instance, because one contains an element of order 4 while the other has elements only of orders 1 and 2. Key invariant: the order of an element is preserved under isomorphism.

标准的考试任务是构造显式的映射来证明两个群同构，常见于一个 4 阶群与克莱因四元群或循环群之间的同构。另一类典型题目是证明两个群不同构——例如，由于一个群含有 4 阶元素，而另一个群仅含有 1 阶和 2 阶元素。重要不变量：元素的阶在同构下保持不变。

8. The Order of an Element and Cyclic Subgroups | 元素的阶与循环子群

For any element a in a group G, the subset ⟨a⟩ = {aᵏ : k ∈ ℤ} is a subgroup, called the cyclic subgroup generated by a. The order of this subgroup equals the order of the element a. This provides a systematic way to find subgroups: take an element, compute its powers until reaching the identity, and the set of distinct powers forms a subgroup.

对于群 G 中的任意元素 a，子集 ⟨a⟩ = {aᵏ : k ∈ ℤ} 是一个子群，称为由 a 生成的循环子群。该子群的阶等于元素 a 的阶。这提供了一种构造子群的系统方法：取一个元素，连续计算其幂直至得到单位元，所得不同幂的集合即构成一个子群。

In a group of order 6, every proper, non‑trivial subgroup must have order 2 or 3 by Lagrange’s theorem. Subgroups of order 2 consist of the identity and an element of order 2; subgroups of order 3 consist of the identity, an element of order 3, and its square. Being able to list all cyclic subgroups quickly is an essential skill for the exam.

根据拉格朗日定理，在 6 阶群中，任何真、非平凡子群的阶必为 2 或 3。2 阶子群由单位元和一个 2 阶元素组成；3 阶子群由单位元、一个 3 阶元素及其平方组成。能够快速列出所有循环子群是考试必备技能。

9. Direct Products of Groups | 群的直积

The direct product of two groups (G, ∘ ) and (H, ∗ ) is the set G × H with the operation defined component‑wise: (g₁, h₁) · (g₂, h₂) = (g₁ ∘ g₂, h₁ ∗ h₂). The order of the direct product is |G| × |H|. If both groups are Abelian, the direct product is also Abelian. Many groups you encounter, like the Klein four‑group, can be expressed as ℤ₂ × ℤ₂.

两个群 (G, ∘ ) 和 (H, ∗ ) 的直积是集合 G × H，其上运算按分量定义：(g₁, h₁) · (g₂, h₂) = (g₁ ∘ g₂, h₁ ∗ h₂)。直积的阶为 |G| × |H|。若两个群均为阿贝尔群，则直积也是阿贝尔群。我们遇到的许多群，如克莱因四元群，可表示为 ℤ₂ × ℤ₂。

Questions on direct products often ask you to determine whether a given direct product is cyclic or to find the order of an element (k, l) in G × H, which is the least common multiple of the orders of k in G and l in H. For instance, in ℤ₃ × ℤ₄, the element (1, 1) has order lcm(3, 4) = 12, making the whole group cyclic because there is an element whose order equals the group order 12.

关于直积的题目常要求判断给定的直积是否为循环群，或求 G × H 中元素 (k, l) 的阶——它是 k 在 G 中的阶与 l 在 H 中的阶的最小公倍数。例如，在 ℤ₃ × ℤ₄ 中，元素 (1, 1) 的阶为 lcm(3, 4) = 12，这使得整个群是循环群，因为存在一个阶等于群阶 12 的元素。

10. Exam Technique and Common Pitfalls | 应试技巧与常见陷阱

When tackling group theory problems, always first identify the type of operation and the underlying set. Write out the Cayley table for small groups if it helps. For proof questions, state clearly which group axiom or theorem you are using—e.g., “by Lagrange’s theorem…” or “by the subgroup test…”. With permutation questions, be meticulous about the order of composition.

处理群论问题时，首先应辨明运算类型和基础集合。若有助于理解，可对小型群画出凯莱表。对于证明题，要清楚说明你正在使用哪条群公理或定理——例如，“根据拉格朗日定理……”，或“根据子群判别法……”。解答置换问题时，要格外注意复合的顺序。

A recurring mistake is to prove that a set is a group without first checking closure properly. Always test a couple of random elements to be sure. Another frequent error is misidentifying the identity element in a given Cayley table—remember that the row and column of the identity exactly reproduce the borders. Finally, when asked to find all subgroups, start from the cyclic subgroups generated by elements, then consider combinations, but never invent subgroups whose order does not divide the group order.

一个常见错误是在未认真检验封闭性的情况下就证明某集合是群。务必随机选取若干元素进行测试。另一个常见错误是在给出的凯莱表中认错单位元——请记住，单位元所在的行和列与表头完全相同。最后，当需要找出所有子群时，先列出各元素生成的循环子群，再考虑可能的组合，但切勿创造阶不整除群阶的子群。

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

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