Group Theory Introduction: Key Exam Points | 群论入门考点精讲

📚 Group Theory Introduction: Key Exam Points | 群论入门考点精讲

Group theory is a fundamental branch of abstract algebra that studies algebraic structures known as groups. In both IB Mathematics: Analysis and Approaches (HL) and AQA A-level Further Mathematics, group theory appears as a key topic that tests students’ ability to work with axioms, structures, and proofs. This article condenses the essential exam points you need to master, from the definition of a group to Lagrange’s theorem and beyond.

群论是抽象代数中的一个基础分支，研究被称为“群”的代数结构。在IB数学：分析与方法（HL）以及AQA A-level进阶数学中，群论都是关键的考点，考察学生运用公理、结构和证明的能力。本文浓缩了你需要掌握的核心考点，从群的定义到拉格朗日定理，一网打尽。

1. What is a Group? Definition | 什么是群？定义

A group (G, *) is a set G together with a binary operation * that satisfies four axioms: closure, associativity, identity, and inverses. Memorising the order of these axioms is crucial for constructing proofs in exams.

群 (G, *) 是一个集合 G 以及一个二元运算 *，该运算满足四条公理：封闭性、结合律、单位元存在性和逆元存在性。牢记这些公理的顺序对于考试中构造证明至关重要。

The formal definition: A group is an ordered pair (G, *) where G is a non-empty set and * : G × G → G is a binary operation such that:

正式定义：群是一个有序对 (G, *)，其中 G 是一个非空集合，* : G × G → G 是一个二元运算，满足：

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 e ∈ G such that for every a ∈ G, e * a = a * e = a.
Inverses: For each a ∈ G, there exists a⁻¹ ∈ G such that a * a⁻¹ = a⁻¹ * a = e.

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

Examiners often ask you to verify these axioms for a given set and operation, such as (ℤ, +) or ({1, -1}, ×). Always check each axiom step by step.

考官经常要求你为一个给定的集合和运算验证这些公理，例如 (ℤ, +) 或 ({1, -1}, ×)。务必逐步检查每一条公理。

2. Closure Property | 封闭性

Closure ensures that the operation stays within the group. For a finite group, you can test closure by constructing a Cayley table and checking that no new elements appear.

封闭性确保运算始终在群内进行。对于有限群，可以通过构建凯莱表并检查是否不出现新元素来检验封闭性。

Example: Is the set {1, -1} closed under multiplication? Yes, because 1*1=1, 1*(-1)=-1, (-1)*1=-1, (-1)*(-1)=1 – all results belong to the set.

例子：集合 {1, -1} 对乘法是否封闭？是的，因为 1×1=1, 1×(-1)=-1, (-1)×1=-1, (-1)×(-1)=1 —— 所有结果都属于该集合。

Beware of operations that take you outside the set. For instance, ordinary addition on the set {1, 2, 3} is not closed because 1+3=4 is not in the set.

要当心那些会使你跑到集合外的运算。例如，在集合 {1, 2, 3} 上的普通加法就不封闭，因为 1+3=4 不在集合内。

In an exam, state clearly: “The operation * is closed on G because for any a, b ∈ G, a * b ∈ G.”

在考试中，要清晰地陈述：“运算 * 在 G 上是封闭的，因为对任意 a, b ∈ G，都有 a * b ∈ G。”

3. Associativity | 结合律

Associativity means that when we combine three elements, the grouping does not affect the result. This is often inherited from the underlying operation, such as addition or multiplication of real numbers.

结合律意味着当我们组合三个元素时，括号的位置不影响结果。通常结合律可以从底层运算继承，例如实数的加法或乘法。

For example, in (ℤ, +): (3 + 5) + 2 = 8 + 2 = 10 and 3 + (5 + 2) = 3 + 7 = 10.

例如，在 (ℤ, +) 中：(3 + 5) + 2 = 8 + 2 = 10，而 3 + (5 + 2) = 3 + 7 = 10。

In exams, you can often justify associativity by stating that integer/real numbers are associative under the given operation. However, for non-standard operations like matrix multiplication or function composition, you may need to provide a brief justification or trust known properties.

在考试中，你通常可以通过声明整数或实数在给定运算下满足结合律来证明。但对于非标准运算，如矩阵乘法或函数复合，你可能需要提供简短的说明或依赖已知性质。

When you are asked to prove a structure is a group, the associativity step often simply says “Addition of integers is associative” or “Multiplication of real numbers is associative”.

当要求证明一个结构是群时，结合律这一步通常简单写成“整数的加法是结合的”或“实数的乘法是结合的”。

4. Identity Element | 单位元

The identity element e satisfies a * e = e * a = a for all a in the group. In additive groups, the identity is often denoted as 0; in multiplicative groups, it is 1.

单位元 e 满足对群中所有 a 都有 a * e = e * a = a。在加法群中，单位元通常记作 0；在乘法群中则为 1。

Example: In (ℝ \ {0}, ×), the identity is 1 because a × 1 = 1 × a = a for any non-zero real number a.

例子：在 (ℝ \ {0}, ×) 中，单位元是 1，因为对任何非零实数 a，都有 a × 1 = 1 × a = a。

You must prove that the identity is unique. The standard proof assumes two identities e₁ and e₂, then e₁ = e₁ * e₂ = e₂. This argument is frequently asked in exams.

你必须证明单位元是唯一的。标准证法是假设有两个单位元 e₁ 和 e₂，那么 e₁ = e₁ * e₂ = e₂。这个论证在考试中经常被要求。

When working with functions, the identity is the function f(x)=x. Make sure you can identify the identity in varied contexts.

在处理函数时，单位元是恒等函数 f(x)=x。确保你能够在不同情境中识别出单位元。

5. Inverse Elements | 逆元

For every element a in the group, there exists an element a⁻¹ such that a * a⁻¹ = a⁻¹ * a = e. The inverse is unique.

对于群中的每一个元素 a，都存在一个元素 a⁻¹，使得 a * a⁻¹ = a⁻¹ * a = e。逆元是唯一的。

In (ℤ, +), the inverse of 3 is -3 because 3 + (-3) = 0. In (ℚ⁺, ×), the inverse of 2/3 is 3/2 because (2/3) × (3/2) = 1.

在 (ℤ, +) 中，3 的逆元是 -3，因为 3 + (-3) = 0。在 (ℚ⁺, ×) 中，2/3 的逆元是 3/2，因为 (2/3) × (3/2) = 1。

To prove uniqueness, suppose an element a has two inverses b and c. Then b = b * e = b * (a * c) = (b * a) * c = e * c = c.

要证明唯一性，假设元素 a 有两个逆元 b 和 c。那么 b = b * e = b * (a * c) = (b * a) * c = e * c = c。

In an exam, you must always check inverses by showing that the candidate inverse lies in the set and that multiplication both ways gives the identity.

在考试中，你必须始终验证逆元是否在集合内，以及左右乘是否都得到单位元。

6. Abelian Groups | 阿贝尔群

A group (G, *) is called Abelian (or commutative) if the operation is commutative: a * b = b * a for all a, b ∈ G. This is an extra axiom beyond the four basic group axioms.

如果运算满足交换律，即对所有 a, b ∈ G 都有 a * b = b * a，则称群 (G, *) 为阿贝尔群（或交换群）。这是在四条基本群公理之外的条件。

Examples of Abelian groups: (ℤ, +), (ℝ \ {0}, ×). Non-Abelian groups include matrix groups under multiplication (like GL(2, ℝ)) and symmetry groups of regular polygons (dihedral groups Dₙ for n ≥ 3).

阿贝尔群的例子：(ℤ, +)、(ℝ \ {0}, ×)。非阿贝尔群包括矩阵乘法群（如 GL(2, ℝ)）以及正多边形的对称群（二面体群 Dₙ，n ≥ 3）。

When proving a group is Abelian, you must show the commutative property holds. Often this involves checking the Cayley table; if the table is symmetric about the main diagonal, the group is Abelian.

要证明一个群是阿贝尔群，必须证明交换律成立。这通常可以通过检查凯莱表来实现；如果凯莱表关于主对角线对称，则该群是阿贝尔群。

In multiple-choice questions, you may be asked to identify whether a given group table represents an Abelian group. Just check if the table is symmetric.

在选择题中，可能要求你判断一个给定的群表是否表示阿贝尔群。只需检查表格是否对称。

7. Subgroups | 子群

A subset H of a group G is a subgroup if it forms a group under the same operation. The standard subgroup test requires:

群 G 的一个子集 H 被称为子群，如果它在相同运算下也构成一个群。标准的子群检验条件包括：

H is non-empty (usually contain the identity e).
H is closed under the operation.
H is closed under taking inverses (for all h ∈ H, h⁻¹ ∈ H).

H 非空（通常包含单位元 e）。
H 对运算封闭。
H 对取逆元封闭（对所有 h ∈ H，h⁻¹ ∈ H）。

Alternatively, the one-step subgroup test: H is a subgroup if H is non-empty and for all a, b ∈ H, a * b⁻¹ ∈ H.

另一种一步子群检验法：如果 H 非空，且对所有 a, b ∈ H，a * b⁻¹ ∈ H，则 H 是子群。

Common examples: The set of even integers under addition is a subgroup of (ℤ, +). The set {1, -1} under multiplication is a subgroup of (ℝ \ {0}, ×).

常见例子：加法下的偶数集是 (ℤ, +) 的子群。乘法下的集合 {1, -1} 是 (ℝ \ {0}, ×) 的子群。

Be careful: in exam proofs, always start by showing e ∈ H, or at least that H is non-empty.

注意：在考试证明中，一定要先证明 e ∈ H，或至少说明 H 非空。

8. 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 k. The element g is called a generator.

如果群 G 中存在一个元素 g，使得 G 中每个元素都可以写成 gᵏ（k 为整数）的形式，则 G 为循环群。元素 g 称为生成元。

The additive group (ℤₙ, +) modulo n is cyclic with generator 1. The multiplicative group of complex nth roots of unity is cyclic with generator e^(2πi/n).

模 n 的加法群 (ℤₙ, +) 是循环群，生成元为 1。复数 n 次单位根的乘法群是循环群，生成元为 e^(2πi/n)。

The order of an element a is the smallest positive integer n such that aⁿ = e. In a finite group, the order divides the group order (by Lagrange).

一个元素 a 的阶是使得 aⁿ = e 的最小正整数 n。在一个有限群中，元素的阶整除群的阶（根据拉格朗日定理）。

Cyclic groups are always Abelian. Proof: gᵐ * gⁿ = g^(m+n) = gⁿ * gᵐ.

循环群总是阿贝尔群。证明：gᵐ * gⁿ = g^(m+n) = gⁿ * gᵐ。

Exams often ask: “Find all generators of a cyclic group” or “Determine the orders of elements”.

考试经常问：“找出循环群的所有生成元”或“确定各元素的阶”。

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

Lagrange’s theorem states that for any finite group G, the order of any subgroup H divides the order of G. That is, |G| = |H| × [G : H], where [G : H] is the index of H in G.

拉格朗日定理指出，对于任何有限群 G，任意子群 H 的阶整除 G 的阶。即 |G| = |H| × [G : H]，其中 [G : H] 是 H 在 G 中的指数。

A direct consequence: the order of any element (the size of the cyclic subgroup it generates) must divide |G|. This is extremely useful in determining possible element orders.

一个直接推论：任何元素的阶（即它生成的循环子群的大小）必须整除 |G|。这在确定可能的元素阶时非常有用。

For example, if |G| = 6, then possible subgroup orders are 1, 2, 3, 6. There cannot be a subgroup of order 4 or 5.

例如，若 |G| = 6，则可能的子群阶为 1、2、3、6。不可能存在阶为 4 或 5 的子群。

Examiners often set problems where you use Lagrange to rule out certain subgroups or to deduce the group structure. You must be able to state and apply the theorem correctly.

考官经常设置需要用拉格朗日定理排除某些子群或推导群结构的题目。你必须能够正确陈述并应用该定理。

10. Isomorphism and Homomorphism | 同构与同态

A homomorphism is a map φ: G → H between two groups that preserves the group structure: φ(a * b) = φ(a) • φ(b), where * and • are the operations in G and H respectively.

同态是两个群之间的映射 φ: G → H，它保持群结构：φ(a * b) = φ(a) • φ(b)，其中 * 和 • 分别是 G 和 H 中的运算。

An isomorphism is a bijective homomorphism. If an isomorphism exists between G and H, the groups are called isomorphic, written G ≅ H. Isomorphic groups have exactly the same group-theoretic properties.

同构是双射的同态。如果 G 和 H 之间存在同构，这两个群就称为同构的，记作 G ≅ H。同构的群具有完全相同的群论性质。

Key properties preserved by isomorphism include: group order, element orders, being Abelian, being cyclic, and number of elements of each order.

同构保持的关键性质包括：群的阶、元素的阶、是否为阿贝尔群、是否为循环群，以及每种阶的元素数量。

In exams, you may be asked to prove two groups are isomorphic by constructing an explicit bijection and verifying the homomorphism property.

考试中，可能要求你通过构造显式的双射并验证同态性质来证明两个群同构。

You must also be able to prove groups are NOT isomorphic, e.g., one is Abelian and the other is not, or they have different numbers of elements of a certain order.

你还必须能够证明两个群不同构，例如其中一个为阿贝尔群而另一个不是，或者它们具有某些特定阶的元素数量不同。

11. Cayley Tables | 凯莱表

A Cayley table is a multiplication table for a finite group. It displays the result of combining any two elements of the group. The table must satisfy the group axioms.

凯莱表是有限群的乘法表。它展示群中任意两个元素结合的结果。该表必须满足群公理。

To construct a Cayley table: list the group elements in a fixed order along the top and left. Then fill in each cell with the product of the row element times the column element.

构建凯莱表：将群元素按固定顺序列在顶部和左侧，然后在每个格子中填入相应行元素与列元素的乘积。

In an exam, you may need to complete a partially given Cayley table using the properties of groups (e.g., each row and column is a permutation of the group elements – a consequence of the Latin square property).

考试中，你可能需要利用群的性质（例如每行每列都是群元素的排列——这是拉丁方性质的推论）来完成部分给出的凯莱表。

Remember: in a group table, the identity row and column just mirror the row and column headers. The inverse of an element can be found by locating the identity in its row or column.

记住：在群表中，单位元所在的行和列只是行首列首的镜像。一个元素的逆元可以通过在其所在行或列中找到单位元的位置来确定。

Cayley tables are useful for visually checking commutativity (symmetry) and for finding subgroups.

凯莱表对于直观检验交换性（对称性）和寻找子群非常有用。

12. Permutation Groups | 置换群

A permutation group is a group whose elements are permutations of a given set and whose operation is the composition of permutations. The symmetric group Sₙ is the group of all permutations of n elements.

置换群是以给定集合上的置换为元素，以置换的复合为运算的群。对称群 Sₙ 是所有 n 个元素的置换构成的群。

Permutations can be written in two-line notation or in cycle notation. For example, the permutation (1 2 3) in S₃ maps 1→2, 2→3, 3→1.

置换可以用双行记号或轮换记号书写。例如，S₃ 中的置换 (1 2 3) 映射 1→2, 2→3, 3→1。

The order of a cycle of length k is k. To find the order of a permutation expressed as disjoint cycles, compute the least common multiple of the cycle lengths.

长度为 k 的轮换的阶为 k。对于以不相交轮换表示的置换，其阶为各轮换长度的最小公倍数。

Permutation groups are central to the study of symmetry and appear in problems about the symmetries of regular polygons (dihedral groups) and the alternating group Aₙ (even permutations).

置换群是研究对称性的核心，出现在关于正多边形对称（二面体群）和交错群 Aₙ（偶置换）的问题中。

In exam questions, you may be asked to multiply two permutations, find the inverse of a permutation, or determine whether a permutation is even or odd based on the number of transpositions.

考试中，可能会要求你计算两个置换的乘积，求置换的逆，或根据对换的数量判断置换的奇偶性。

Published by TutorHao | Mathematics Revision Series | aleveler.com

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

Group Theory Introduction: Key Exam Points | 群论入门考点精讲