Introduction to Group Theory Essentials | IGCSE OCR 数学：群论入门考点精讲

📚 Introduction to Group Theory Essentials | IGCSE OCR 数学：群论入门考点精讲

Group theory is a fascinating branch of abstract algebra that studies symmetry and structure through sets equipped with an operation. Even at the IGCSE level, understanding the basic ideas behind groups can deepen your appreciation of number systems, transformations, and modular arithmetic. This article covers all the essential concepts you need for an introduction to group theory, aligned with the OCR IGCSE approach to exploring advanced mathematical structures.

群论是抽象代数中一个迷人的分支，它通过带有运算的集合研究对称性与结构。即使在 IGCSE 阶段，理解群论的基本思想也能加深你对数系、变换与模运算的领悟。本文涵盖群论入门所需的所有核心概念，与 OCR IGCSE 探索高阶数学结构的思路一致。

1. What is a Set? | 什么是集合？

A set is a well-defined collection of distinct objects, called elements or members. We usually denote sets by capital letters such as A, B, S. For example, S = {1, 2, 3, 4} is a set containing the numbers 1, 2, 3 and 4. The order of elements does not matter, and duplicates are not counted.

集合是一组明确定义的、互不相同的对象，称为元素或成员。我们通常用大写字母如 A、B、S 来表示集合。例如，S = {1, 2, 3, 4} 是一个包含数字 1、2、3 和 4 的集合。元素的顺序无关紧要，且重复不计。

Important standard sets include the integers ℤ = {…, -2, -1, 0, 1, 2, …}, the rational numbers ℚ, and the real numbers ℝ. In group theory we often work with subsets of these, or finite sets created by modular arithmetic.

重要的标准集合包括整数集 ℤ = {…, -2, -1, 0, 1, 2, …}、有理数集 ℚ 和实数集 ℝ。在群论中，我们常使用这些集合的子集，或者由模运算生成的有限集合。

The membership symbol ‘∈’ means ‘is an element of’. For instance, 3 ∈ ℤ means 3 is an integer. A set with no elements is the empty set, written ∅.

属于符号“∈”表示“是……的元素”。例如，3 ∈ ℤ 表示 3 是一个整数。没有任何元素的集合叫作空集，记作 ∅。

2. Binary Operations | 二元运算

A binary operation on a set S is a rule that combines any two elements of S to produce another element of S. It can be thought of as a function: S × S → S. Common binary operations include addition, subtraction, multiplication, and composition of functions.

集合 S 上的二元运算是一种规则，它将 S 中任意两个元素结合成 S 中的另一个元素。这可以看作一个函数：S × S → S。常见的二元运算包括加法、减法、乘法以及函数的复合。

We often denote a generic binary operation by a symbol such as ∗, •, or ∘. For elements a, b ∈ S, the result is written as a ∗ b. For example, if S = ℤ and the operation is ordinary addition, then 3 ∗ 5 = 8.

我们常用符号如 ∗、• 或 ∘ 来表示一个通用的二元运算。对于元素 a, b ∈ S，结果写作 a ∗ b。例如，若 S = ℤ 且运算为普通加法，则 3 ∗ 5 = 8。

Different operations can be defined on the same set. On the set of real numbers, both + and × are binary operations, but subtraction is also a binary operation. The choice of operation is crucial for the group structure.

同一集合上可以定义不同的运算。在实数集上，+ 和 × 都是二元运算，但减法也是二元运算。运算的选择对群的结构至关重要。

3. Closure Property | 封闭性

A set S is said to be closed under a binary operation ∗ if, for every pair of elements a, b ∈ S, the result a ∗ b is also an element of S. This is the first requirement for a group.

如果对于任意两个元素 a, b ∈ S，运算结果 a ∗ b 仍然属于 S，则称集合 S 在该二元运算 ∗ 下封闭。这是构成群的第一个条件。

Example 1: The set of integers ℤ is closed under addition because the sum of any two integers is an integer. However, the set of odd integers is not closed under addition, since 1 + 3 = 4, which is even and not in the set.

例 1：整数集 ℤ 在加法下是封闭的，因为任意两个整数之和仍然是整数。然而，奇数集在加法下不封闭，因为 1 + 3 = 4 是偶数，不在该集合中。

Example 2: The set {0, 1, 2, 3} under addition modulo 4 is closed: 2 + 3 = 5, and 5 mod 4 = 1, which belongs to the set. Checking closure is the first step in verifying if a set and operation form a group.

例 2：集合 {0, 1, 2, 3} 在模 4 加法下是封闭的：2 + 3 = 5，5 mod 4 = 1，而 1 在该集合中。验证封闭性是检查一个集合与运算是否构成群的第一步。

4. Associativity | 结合律

An operation ∗ on a set S is associative if for all a, b, c ∈ S, we have (a ∗ b) ∗ c = a ∗ (b ∗ c). This means the grouping of elements does not affect the result. Associativity is absolutely essential for a group.

如果对于所有 a, b, c ∈ S，都有 (a ∗ b) ∗ c = a ∗ (b ∗ c)，则称集合 S 上的运算 ∗ 满足结合律。这意味着元素的分组不会影响结果。结合律对群而言绝对必要。

(a ∗ b) ∗ c = a ∗ (b ∗ c)

Ordinary addition and multiplication of numbers are associative. Subtraction is not associative: (10 – 5) – 2 = 3, but 10 – (5 – 2) = 7, so they differ. Matrix multiplication is associative, and composition of functions is associative, both important for later study.

普通数的加法和乘法满足结合律。减法不满足结合律：(10 – 5) – 2 = 3，而 10 – (5 – 2) = 7，两者不同。矩阵乘法和函数的复合都满足结合律，这在后续学习中很重要。

When using modular arithmetic, associativity still holds. For example, in mod n addition, (a + b) + c ≡ a + (b + c) (mod n) because it inherits the associativity of integer addition.

在使用模运算时，结合律仍然成立。例如，在模 n 加法中，(a + b) + c ≡ a + (b + c) (mod n)，因为它继承了整数加法的结合性。

5. Identity Element | 单位元

An identity element (or neutral element) for an operation ∗ on a set S is an element e ∈ S such that for every a ∈ S, e ∗ a = a and a ∗ e = a. In other words, combining any element with e leaves that element unchanged.

集合 S 上关于运算 ∗ 的单位元（或称中性元）是指 S 中一个元素 e，使得对于每个 a ∈ S，都有 e ∗ a = a 且 a ∗ e = a。换句话说，任何元素与 e 结合后都保持不变。

e ∗ a = a ∗ e = a

For addition of integers, the identity is 0 because 0 + a = a + 0 = a. For multiplication of real numbers, the identity is 1 since 1 × a = a × 1 = a. For composition of functions, the identity function f(x) = x acts as the identity element.

对于整数加法，单位元是 0，因为 0 + a = a + 0 = a。对于实数乘法，单位元是 1，因为 1 × a = a × 1 = a。对于函数的复合，恒等函数 f(x) = x 充当单位元。

In a Cayley table, the row and column corresponding to the identity element simply replicate the headers. Note that an operation can have at most one identity element.

在凯莱表中，对应单位元的行和列会直接复制表头。注意，一个运算最多只能有一个单位元。

6. Inverse Elements | 逆元

For a set S with operation ∗ and identity e, an inverse of an element a ∈ S is an element b ∈ S such that a ∗ b = b ∗ a = e. If such a b exists, we usually denote it by a⁻¹. Every element in a group must have an inverse.

对于拥有运算 ∗ 和单位元 e 的集合 S，元素 a ∈ S 的逆元是指 S 中一个元素 b，使得 a ∗ b = b ∗ a = e。若这样的 b 存在，通常记为 a⁻¹。群中的每个元素都必须有逆元。

a ∗ a⁻¹ = a⁻¹ ∗ a = e

For addition of integers, the inverse of a is -a, because a + (-a) = 0. For multiplication of non-zero real numbers, the inverse of a is 1/a. For modulo n addition, the inverse of a is (n – a) mod n.

对于整数加法，a 的逆元是 -a，因为 a + (-a) = 0。对于非零实数的乘法，a 的逆元是 1/a。对于模 n 加法，a 的逆元是 (n – a) mod n。

When working with permutation groups, the inverse of a permutation is the permutation that reverses its effect. Finding inverses is a key skill for working with groups.

在处理置换群时，一个置换的逆元是将它的效果反转的置换。寻找逆元是处理群的关键技能之一。

7. The Group Axioms | 群公理

Formally, a group is an ordered pair (G, ∗) consisting of a non-empty set G and a binary operation ∗ on G that satisfies the following four axioms, often remembered by the acronym CAIN:

Closure: For all a, b ∈ G, a ∗ b ∈ G.
Associativity: For all a, b, c ∈ G, (a ∗ b) ∗ c = a ∗ (b ∗ c).
Identity: There exists an element e ∈ G such that for all a ∈ G, e ∗ a = a ∗ e = a.
Inverse: For each a ∈ G, there exists an element a⁻¹ ∈ G such that a ∗ a⁻¹ = a⁻¹ ∗ a = e.

形式上说，一个群是一个有序对 (G, ∗)，其中 G 是非空集合，∗ 是 G 上的二元运算，并满足以下四条公理，通常用缩写 CAIN 来记忆：

封闭性：对所有 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。

If a set and operation satisfy only the first three axioms, it is called a monoid. The addition of the inverse axiom is what makes a monoid into a group and introduces the idea of ‘undoing’ an operation.

若一个集合和运算仅满足前三条公理，则称为幺半群。逆元公理的加入使幺半群成为群，并引入了“撤销”运算的思想。

8. Examples of Groups | 群的例子

The integers under addition, (ℤ, +), form an infinite group. The identity is 0, and the inverse of a is -a. This is a fundamental example. (ℤ, ×) is not a group because many integers lack multiplicative inverses within ℤ.

整数在加法下构成一个无限群 (ℤ, +)。单位元为 0，a 的逆元为 -a。这是一个基本例子。(ℤ, ×) 不是群，因为许多整数在整数集内没有乘法逆元。

The set of non-zero real numbers under multiplication, (ℝ\{0}, ×), forms a group. The identity is 1, and the inverse of x is 1/x. Similarly, the non-zero rational numbers ℚ\{0} under multiplication form a group.

非零实数集在乘法下构成群 (ℝ\{0}, ×)。单位元为 1，x 的逆元为 1/x。类似地，非零有理数集 ℚ\{0} 在乘法下也构成群。

Finite groups are vital. Consider the set ℤ₄ = {0, 1, 2, 3} under addition modulo 4. Check the axioms: closure holds, addition mod 4 is associative, 0 is the identity, and inverses are 0⁻¹=0, 1⁻¹=3, 2⁻¹=2, 3⁻¹=1. Thus it is a group of order 4.

有限群至关重要。考虑集合 ℤ₄ = {0, 1, 2, 3} 在模 4 加法下。验证公理：封闭性成立，模 4 加法满足结合律，0 是单位元，逆元为 0⁻¹=0，1⁻¹=3，2⁻¹=2，3⁻¹=1。因此它是一个 4 阶群。

9. Abelian Groups | 阿贝尔群（交换群）

A group (G, ∗) is called Abelian (or commutative) if its operation is commutative, meaning for all a, b ∈ G, a ∗ b = b ∗ a. This additional property makes the group structure much simpler and more symmetrical.

若群 (G, ∗) 的运算满足交换律，即对所有 a, b ∈ G，都有 a ∗ b = b ∗ a，则称该群为阿贝尔群（或交换群）。这个附加性质使得群的结构更加简单且对称。

a ∗ b = b ∗ a

Many familiar groups are Abelian: (ℤ, +), (ℝ, +), and (ℝ\{0}, ×). Indeed, all cyclic groups (those generated by a single element) are Abelian. The group ℤ₄ under addition modulo 4 is Abelian.

许多常见的群都是阿贝尔群：(ℤ, +)、(ℝ, +) 和 (ℝ\{0}, ×)。事实上，所有循环群（由一个元素生成的群）都是阿贝尔群。群 ℤ₄ 在模 4 加法下就是阿贝尔群。

Non-Abelian groups are equally important. The classic example is the symmetric group S₃, consisting of all permutations of three objects under composition. Here, swapping the first two then the last two yields a different result from doing them in reverse order.

非阿贝尔群同样重要。典型例子是对称群 S₃，它由三个对象的所有置换在复合下构成。在这里，先交换前两个再交换后两个，与相反顺序得到的结果不同。

10. Cayley Tables | 凯莱表

A Cayley table is a square grid used to describe the operation of a finite group. The rows and columns are labelled by the group elements, and the entry in row a, column b is a ∗ b. It must satisfy the Latin square property—each element appears exactly once in each row and column.

凯莱表是用于描述有限群运算的方形网格。行和列由群元素标记，位于行 a、列 b 的表项为 a ∗ b。它必须满足拉丁方阵性质——每个元素在每一行和每一列中恰好出现一次。

Below is the Cayley table for the group ℤ₄ = {0,1,2,3} under addition modulo 4:

以下是群 ℤ₄ = {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 can instantly see the identity (row and column of 0 are unchanged) and inverses (look for 0 in each row). The symmetry across the main diagonal confirms the group is Abelian.

从表中我们可以立即看出单位元（0 的行和列不变）以及逆元（在每行中找到 0）。关于主对角线的对称性证实该群是阿贝尔群。

11. Introduction to Permutation Groups | 置换群入门

A permutation of a set is a rearrangement of its elements. The set of all permutations of n symbols, under composition, forms the symmetric group Sₙ. For n=3, S₃ has 3! = 6 elements. Permutations are often written in cycle notation, e.g., (1 2 3) means 1→2, 2→3, 3→1.

集合的置换是指对其元素的一次重排。n 个符号的所有置换在复合下构成的群称为对称群 Sₙ。对于 n=3，S₃ 有 3! = 6 个元素。置换常用轮换记法表示，例如 (1 2 3) 表示 1→2，2→3，3→1。

Composition of permutations is performed right to left. The identity permutation does nothing and is written as (1). The inverse of a cycle is obtained by writing it in reverse order; e.g., the inverse of (1 2 3) is (1 3 2).

置换的复合按从右到左的顺序执行。恒等置换不做任何改变，记作 (1)。轮换的逆元通过将其顺序反转得到，例如 (1 2 3) 的逆元是 (1 3 2)。

S₃ is non-Abelian: consider (1 2) ∗ (1 3) = (1 3 2), whereas (1 3) ∗ (1 2) = (1 2 3). Understanding permutation groups provides a foundation for studying symmetry, cryptography, and solving puzzles like the Rubik’s Cube.

S₃ 是非阿贝尔群：考虑 (1 2) ∗ (1 3) = (1 3 2)，而 (1 3) ∗ (1 2) = (1 2 3)。理解置换群为研究对称性、密码学以及解决魔方等谜题奠定了基础。

12. Exam Tips & Summary | 考点总结

When tackling group theory questions at IGCSE level (often as extension or Further Maths topics), always start by clearly identifying the set and operation. Check the four axioms one by one: closure, associativity, identity, and inverses. For finite sets, a Cayley table can help verify the group properties systematically.

在处理 IGCSE 阶段（通常作为拓展或进阶数学内容）的群论题目时，务必先清晰地识别集合和运算。逐一检查四条公理：封闭性、结合律、单位元和逆元。对于有限集合，凯莱表可以帮助系统地验证群的性质。

Common pitfalls include forgetting to check closure thoroughly, assuming associativity without justification (though it holds for familiar operations like + and ×), and confusing identity with the number zero or one in non-arithmetic contexts. Remember that a group must be non-empty.

常见陷阱包括：未彻底检查封闭性、未经论证就假设结合律（尽管熟悉的运算如 + 和 × 下确实成立），以及在非算术背景下将单位元与数字 0 或 1 混淆。请记住群必须是非空的。

Key terms to memorise: group, Abelian (commutative), cyclic group, Cayley table, permutation, order of a group (number of elements), order of an element (the smallest positive n such that aⁿ = e). Practice by verifying group structures on sets like {1, -1} under multiplication and {0, 1, 2, 3} under addition mod 4.

需要熟记的关键术语：群、阿贝尔群（交换群）、循环群、凯莱表、置换、群的阶（元素个数）、元素的阶（使得 aⁿ = e 的最小正整数 n）。通过验证诸如乘法下集合 {1, -1} 以及模 4 加法下 {0, 1, 2, 3} 的群结构来加以练习。

Finally, linking algebraic groups to geometric symmetry enriches understanding. The symmetries of a square form the dihedral group D₄ of order 8, a brilliant topic to explore after mastering these basics.

最后，将代数群与几何对称性联系起来可以加深理解。正方形的对称构成 8 阶二面体群 D₄，在掌握这些基础后这是一个绝佳的探索课题。

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

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

Introduction to Group Theory Essentials | IGCSE OCR 数学：群论入门 考点精讲