📚 Group Theory Basics for IGCSE CCEA Mathematics | IGCSE CCEA 数学：群论入门 考点精讲
Group theory is one of the most elegant and powerful branches of mathematics, forming the backbone of abstract algebra. For IGCSE CCEA Mathematics students, an introduction to groups provides a first glimpse into how mathematicians classify and analyse structure, symmetry, and patterns. While the topic may seem abstract at first, it is built on very simple, logical rules that anyone can master with practice. This article breaks down the essential concepts of group theory, walking you through the axioms, key examples, Cayley tables, modular arithmetic groups, and the all-important distinction between Abelian and non-Abelian groups. Whether you are preparing for a Further Mathematics paper or simply curious about the deeper structures underpinning everyday arithmetic, this guide covers every key point in clear, paired English-Chinese explanations.
群论是数学中最优雅、最强大的分支之一，构成了抽象代数的基石。对于 IGCSE CCEA 数学课程的学生来说，群论入门让你第一次窥见数学家如何分类和分析结构、对称性与模式。虽然这个主题一开始可能显得抽象，但它建立在非常简单、合乎逻辑的规则之上，只要多加练习，人人都能掌握。本文逐一拆解群论的核心概念，带你走过公理体系、典型例子、凯莱表、模运算群，以及至关重要的阿贝尔群与非阿贝尔群的区别。无论你是在备考进阶数学考试，还是单纯对日常算术背后的深层结构感到好奇，这份指南都以清晰的中英配对讲解覆盖了每一个关键要点。
1. Understanding the Idea of a Group | 理解群的概念
A group is a set of elements together with a binary operation that combines any two elements to form a third element, all while obeying four specific rules called the group axioms. Think of a group as a miniature mathematical universe with its own laws. The set provides the 'objects', and the operation tells you how to combine them. For example, the integers with addition form a group, but the integers with multiplication do not — and understanding why is your first real step into group theory.
群是一个集合，连同一种二元运算，该运算将任意两个元素组合成第三个元素，同时遵守四条特定的规则，称为群公理。可以把群想象成一个拥有自己法则的微型数学宇宙。集合提供了“对象”，运算告诉你如何将它们组合起来。例如，整数与加法构成一个群，但整数与乘法却不构成群——理解其中的原因，是你真正踏入群论的第一步。
In group theory, we use the symbol * to represent a generic binary operation, but this operation could be ordinary addition, multiplication, composition of functions, or even something like 'addition modulo n'. The beauty of group theory lies in its abstraction: once you prove something about groups in general, it applies to all specific examples — from number systems to symmetries of shapes.
在群论中，我们用符号 * 表示一般的二元运算，但这个运算可以是普通的加法、乘法、函数的复合，甚至可以是“模 n 加法”之类的东西。群论的美妙之处在于它的抽象性：一旦你证明了关于群的一般性结论，它就适用于所有具体的例子——从数系到图形的对称性。
2. The Four Group Axioms | 群的四大公理
To qualify as a group, a set G with an operation * must satisfy four axioms: closure, associativity, the existence of an identity element, and the existence of inverse elements. These four conditions form the bedrock of group theory. If any one of them fails, the structure is not a group. Memorising these axioms and being able to check them for a given set and operation is the single most important skill for IGCSE CCEA group theory questions.
要成为一个群，集合 G 连同运算 * 必须满足四条公理：封闭性、结合律、单位元的存在性，以及逆元的存在性。这四个条件构成了群论的基石。如果其中任何一条不成立，该结构就不是一个群。熟记这些公理，并能够针对给定的集合和运算逐一验证它们，是 IGCSE CCEA 群论考题中最重要的技能。
We normally denote a group by writing (G, *) to emphasise both the set and the operation. The order of the group, written as |G|, is simply the number of elements in the set G. A group can be finite or infinite, and you will encounter both types in your IGCSE studies — from the infinite group of integers under addition to the finite group of symmetries of an equilateral triangle.
我们通常用 (G, *) 来表示一个群，以强调集合和运算两者。群的阶，记作 |G|，就是集合 G 中元素的个数。群可以是有限的，也可以是无限的，在 IGCSE 的学习中你会遇到两种类型——从整数加法构成的无限群，到等边三角形对称性构成的有限群。
3. Closure – Staying Inside the Set | 封闭性——留在集合内
Closure is the simplest axiom to understand: for any two elements a, b in G, the result of a * b must also be an element of G. In other words, you cannot 'fall out' of the set by applying the operation. For instance, if G is the set of even integers and the operation is addition, the sum of any two even integers is always even, so closure holds. But if G is the set of odd integers under addition, the sum of two odd integers is even, which is not in G, so closure fails.
封闭性是最容易理解的公理：对于 G 中任意两个元素 a、b，a * b 的结果也必须属于 G。换句话说，你无法通过应用该运算而“掉出”集合之外。例如，如果 G 是偶数集合，运算是加法，那么任意两个偶数的和始终是偶数，因此封闭性成立。但如果 G 是奇数集合，运算是加法，两个奇数的和是偶数，而偶数不在 G 中，因此封闭性不成立。
When checking closure for a finite group given by a Cayley table, you simply verify that every entry in the table belongs to the original set. For infinite groups, you need to construct a general argument. For example, to prove that integers are closed under addition, you argue that the sum of two integers is always an integer — a fact we take for granted in arithmetic but which must be explicitly verified in group theory.
当通过凯莱表验证有限群的封闭性时，你只需检查表中的每个条目是否都属于原集合。对于无限群，你需要构建一个一般性的论证。例如，要证明整数对加法封闭，你需要论证两个整数的和始终是一个整数——这在算术中是理所当然的事实，但在群论中必须明确验证。
4. Associativity – Order Doesn't Matter (With a Catch) | 结合律——顺序无关（但有前提）
b * c) holds. This means you can group the operations in any way without changing the result. Note that associativity is about the grouping of operations, not the order of elements — ich we will discuss later. Most familiar operations like addition and multiplication of real numbers are associative, but operations like subtraction and division are not.
结合律要求对于 G 中所有的 a、b、c，等式 (a * b) * c = a * (b * c) 成立。这意味着你可以以任何方式对运算进行分组，而不会改变结果。注意，结合律是关于运算的分组方式，而不是元素的顺序——元素的顺序只有在阿贝尔群中才可以互换，这一点我们稍后会讨论。大多数熟悉的运算，如实数的加法和乘法，都满足结合律，但减法和除法这类运算则不满足。
For IGCSE examinations, you are rarely asked to prove associativity from first principles, as the proof is often tedious. Instead, you can usually assume that familiar operations on familiar sets are associative unless directed otherwise. However, for unfamiliar operations defined by a formula or a table, you may need to test associativity with a counterexample — finding just one triple of elements where (a * b) * c does not equal a * (b * c) is enough to show that the structure is not a group.
在 IGCSE 考试中，你很少被要求从基本原理出发证明结合律，因为证明通常很繁琐。相反，你通常可以假设熟悉集合上的熟悉运算是可结合的，除非有特别指示。然而，对于由公式或表格定义的不熟悉运算，你可能需要通过反例来检验结合律——只需找到一组三元组，使得 (a * b) * c 不等于 a * (b * c)，就足以证明该结构不是一个群。
5. The Identity Element – The Do-Nothing Hero | 单位元——无所作为的英雄
combining any element with the identity leaves that element unchanged. For the integers under addition, the identity is 0, because adding 0 to any integer gives back that integer. For the non-zero real numbers under multiplication, the identity is 1.
单位元通常用 e 表示，是 G 中一个特殊的元素，使得对于 G 中的每一个元素 a，等式 e * a = a * e = a 成立。换句话说，将任意元素与单位元组合，该元素保持不变。对于整数加法群，单位元是 0，因为将 0 加到任何整数上，得到的仍是该整数。对于非零实数乘法群，单位元是 1。
When analysing whether a given set and operation form a group, you should first ask: is there an element that, when combined with any element, leaves it alone? If no such element exists, the structure cannot be a group. This is often the quickest axiom to check in an exam setting.
一个群只能有一个单位元。这是一个可证明的事实：如果 e 和 f 都是单位元，那么 e = e * f = f。当分析给定的集合和运算是否构成一个群时，你应该首先问：是否存在一个元素，当它与任何元素组合时，都不会改变该元素？如果不存在这样的元素，该结构就不可能是一个群。这通常是考试中检验最快的公理。
6. Inverses – Finding Your Partner | 逆元——找到你的伙伴
verse of a. For integers under addition, the inverse of 3 is -3, because 3 + (-3) = 0, the identity. For non-zero real numbers under multiplication, the inverse of 2 is ½, since 2 × ½ = 1.
对于 G 中的每一个元素 a，必须存在 G 中的一个元素 a⁻¹，使得 a * a⁻¹ = a⁻¹ * a = e，其中 e 是单位元。元素 a⁻¹ 被称为 a 的逆元。对于整数加法群，3 的逆元是 -3，因为 3 + (-3) = 0，即单位元。对于非零实数乘法群，2 的逆元是 ½，因为 2 × ½ = 1。
rithmetic groups, finding inverses requires a bit more calculation, often involving the extended Euclidean algorithm, but for small finite groups you can simply inspect the Cayley table and look for the identity element appearing in each row and column.
群中每个元素的逆元都是唯一的。你可以证明这一点：如果 b 和 c 都是 a 的逆元，那么 b = b * e = b * (a * c) = (b * a) * c = e * c = c。在模运算群中，寻找逆元需要稍多一些计算，通常涉及扩展欧几里得算法，但对于小型有限群，你可以直接检查凯莱表，查找每行和每列中是否出现单位元。
7. Integers Under Addition – The Classic Group | 整数加法群——经典范例
The set of all integers ℤ under the operation of addition forms a group, written as (ℤ prototypical example in introductory group theory. Let us verify the four axioms: closure — the sum of two integers is an integer; associativity — addition of integers is associative; identity — the integer 0 acts as the identity, since a + 0 = 0 + a = a for any integer a; inverses — for any integer a, the integer -a is its inverse, since a + (-a) = 0.
全体整数集合 ℤ 在加法运算下构成一个群，记作 (ℤ, +)。这是一个无限阿贝尔群，是群论入门课程中的典型例子。我们来验证四条公理：封闭性——两个整数的和是一个整数；结合律——整数加法满足结合律；单位元——整数 0 充当单位元，因为对任意整数 a，都有 a + 0 = 0 + a = a；逆元——对任意整数 a，整数 -a 是其逆元，因为 a + (-a) = 0。
However, the integers under multiplication do NOT form a group — its multiplicative inverse would be 1/3, but 1/3 is not an integer, so it does not belong to the set ℤ. Since not every integer has a multiplicative inverse within the integers, (ℤ, ×) is not a group.
然而，整数在乘法下不构成群——理解其中的原因是经典的考题。虽然封闭性、结合律和单位元（1）都成立，但逆元不成立。考虑整数 3：它的乘法逆元是 1/3，但 1/3 不是整数，因此不属于集合 ℤ。由于并非每个整数在整数范围内都有乘法逆元，所以 (ℤ, ×) 不是一个群。
8. Modular Arithmetic – Groups on a Clock | 模运算——时钟上的群
arithmetic provides some of the most accessible finite groups for IGCSE students. The set ℤₙ = {0, 1, 2, ..., n-1} under addition modulo n forms a group of order n. For example, (ℤ e remainder upon division by 6. This group is cyclic, meaning every element can be generated by repeatedly applying the operation to a single generator element — in this case, 1.
模运算为 IGCSE 学生提供了一些最容易理解的有限群。集合 ℤₙ = {0, 1, 2, ..., n-1} 在模 n 加法下构成一个 n 阶群。例如，(ℤ₆, +₆) 是整数模 6 在模 6 加法下的群。它的元素是 {0, 1, 2, 3, 4, 5}，其运算是先进行加法，然后取除以 6 的余数。这个群是循环群，意味着每个元素都可以通过对单个生成元——这里是 1——反复应用运算而生成。
egers coprime to n under multiplication modulo n forms a group, often denoted as U(n) or (ℤ under multiplication modulo 5. The identity is 1, the inverse of 2 is 3 because 2 × 3 = 6 ≡ 1 (mod 5), and the inverse of 4 is 4 because 4 × 4 = 16 ≡ od 5). These groups frequently appear in IGCSE CCEA examination questions on group theory.
对于模乘法，情况更为微妙。与 n 互质的整数集合在模 n 乘法下构成一个群，通常记作 U(n) 或 (ℤₙ)*。对于 n = 5，元素为 {1, 2, 3, 4}，这是一个模 5 乘法下的 4 阶群。单位元是 1，2 的逆元是 3，因为 2 × 3 = 6 ≡ 1 (mod 5)；4 的逆元是 4，因为 4 × 4 = 16 ≡ 1 (mod 5)。这些群经常出现在 IGCSE CCEA 群论考题中。
9. Symmetry Groups – Rotations and Reflections | 对称群——旋转与反射
Symmetry groups provide a visual, geometric entry into group theory. Consider an equilateral triangle labelled with vertices 1, 2, 3. The set of all rigid motions (rotations and reflections) that map the triangle onto itself forms a group under composition of transformations. This group, called the dihedral group D₃, has exactly six elements: three rotations (0°, 120°, 240°) and three reflections (across the three axes of symmetry). The order of D₃ is 6, making it the smallest non-Abelian group — a fact that surprises many students the first time they encounter it.
对称群为群论提供了一个可视化的几何入口。考虑一个顶点标记为 1、2、3 的等边三角形。所有将三角形映射到自身的刚性运动（旋转和反射）的集合，在变换的复合下构成一个群。这个群称为二面体群 D₃，恰好有六个元素：三个旋转（0°、120°、240°）和三个反射（分别沿三条对称轴）。D₃ 的阶为 6，它是最小的非阿贝尔群——许多学生第一次接触时都会对这个事实感到惊讶。
To combine two symmetries, you perform them one after another. For instance, a 120° rotation followed by a reflection yields a different symmetry from performing the reflection first and then the rotation. This failure of commutativity — where a * b ≠ b * a — is precisely what makes D₃ non-Abelian. In your IGCSE CCEA exam, you might be asked to complete a Cayley table for D₃ or to identify the order of each element, which is the smallest positive integer k such that applying the symmetry k times returns the triangle to its original position.
要将两个对称组合起来，你需要依次执行它们。例如，先进行 120° 旋转再进行反射，得到的结果与先进行反射再进行旋转不同。这种交换律的失效——即 a * b ≠ b * a——正是使 D₃ 成为非阿贝尔群的原因。在 IGCSE CCEA 考试中，你可能会被要求填写 D₃ 的凯莱表，或者确定每个元素的阶，即使对称变换执行 k 次后三角形回到原位置的最小正整数 k。
10. Cayley Tables – The Group's Times Table | 凯莱表——群的乘法表
A Cayley table is a square grid that displays the results of applying the group operation to every pair of elements. It is the group theory analogue of a multiplication table. For a finite group of order n, the Cayley table has n rows and n columns, with the entry in row a and column b showing a * b. Constructing and interpreting Cayley tables is a core skill for IGCSE CCEA group theory, as it allows you to verify group axioms visually and to spot properties like commutativity and inverses at a glance.
凯莱表是一个方形网格，展示了对每一对元素应用群运算的结果。它是群论中类似于乘法表的东西。对于一个 n 阶有限群，凯莱表有 n 行和 n 列，第 a 行第 b 列的条目显示 a * b。构建和解读凯莱表是 IGCSE CCEA 群论的核心技能，因为它让你能够直观地验证群的公理，并一眼看出交换性和逆元等性质。
Several key properties can be read directly from a Cayley table. Each row and each column must contain every element exactly once — this is a consequence of the group axioms and is known as the Latin square property. The identity element appears in exactly one row and one column that match the original headings exactly. A group is Abelian if and only if its Cayley table is symmetric about the main diagonal (from top-left to bottom-right). An element's inverse is found by locating the identity in its row and noting the column heading.
从凯莱表中可以直接读出几个关键性质。每一行和每一列必须恰好包含每个元素一次——这是群公理的一个推论，被称为拉丁方阵性质。单位元恰好出现在与原始表头完全匹配的一行和一列中。一个群是阿贝尔群，当且仅当其凯莱表关于主对角线（从左上到右下）对称。一个元素的逆元可以通过在其所在行中找到单位元，并记录对应的列标题来确定。
| * | e | a | b |
|---|---|---|---|
| e | e | a | b |
| a | a | b | e |
| b | b | e | a |
The Cayley table above represents a group of order 3, sometimes called the cyclic group C₃. Notice that this table is symmetric about the main diagonal, confirming that the group is Abelian. Also, each row contains each element exactly once, satisfying the Latin square condition. In IGCSE exams, you may be given a partially completed Cayley table and asked to fill in the missing entries using the group axioms — a challenging but rewarding exercise that tests your understanding of all four axioms simultaneously.
上面的凯莱表表示一个 3 阶群，有时称为循环群 C₃。注意，这个表关于主对角线对称，确认了该群是阿贝尔群。同时，每一行恰好包含每个元素一次，满足了拉丁方阵条件。在 IGCSE 考试中，你可能会拿到一个部分完成的凯莱表，并被要求利用群公理填充缺失的条目——这是一项挑战性很强但收获颇丰的练习，能同时检验你对全部四条公理的理解。
11. Abelian Groups – When Order Truly Doesn't Matter | 阿贝尔群——当顺序真的无关时
b * a. All the groups we have discussed so far except D₃ are Abelian. The integers under addition, the non-zero reals under multiplication, and all modular addition groups are Abelian. Abelian groups are generally simpler to analyse and form the foundation for more advanced topics in ring theory and module theory at the A-level and beyond.
阿贝尔群，以挪威数学家尼尔斯·亨利克·阿贝尔的名字命名，是指运算满足交换律的群：对于 G 中所有的 a、b，都有 a * b = b * a。除了 D₃ 之外，我们迄今为止讨论过的所有群都是阿贝尔群。整数加法群、非零实数乘法群，以及所有模加法群，都是阿贝尔群。阿贝尔群通常更容易分析，并构成了 A-level 及更高级别课程中环论和模论等进阶主题的基础。
c argument or an inspection of its Cayley table. For the Cayley table method, you simply check whether the table is symmetric about the main diagonal. If the entry in row a, column b equals the entry in row b, column a for every pair of elements, the group is Abelian. For infinite groups, you need a more general algebraic proof — raightforward from the properties of addition, but proving that matrix multiplication is not commutative requires just a single counterexample.
证明一个群是阿贝尔群，通常要么通过直接的代数论证，要么通过检查其凯莱表。对于凯莱表法，你只需检查表是否关于主对角线对称。如果对于每一对元素，第 a 行第 b 列的条目都等于第 b 行第 a 列的条目，那么该群就是阿贝尔群。对于无限群，你需要更一般的代数证明——例如，证明整数的 (a + b) + c = a + (b + c) 和 a + b = b + a 从加法的性质来看是直截了当的，但要证明矩阵乘法不满足交换律，只需一个反例就足够了。
A common IGCSE exam question asks students to determine whether a given group is Abelian and to justify their answer. The justification is as important as the yes-or-no answer. If the group is non-Abelian, you must provide a specific pair of elements that do not commute. For D₃, for instance, a rotation of 120° followed by a reflection gives one result, while performing the reflection first and the rotation second gives a different symmetry — and this is the kind of concrete example that earns full marks.
一道常见的 IGCSE 考题要求学生判断给定的群是否为阿贝尔群并说明理由。理由和“是”或“否”的答案同样重要。如果群是非阿贝尔群，你必须提供一对具体的不满足交换律的元素。例如，对于 D₃，先进行 120° 旋转再进行反射得到一种结果，而先进行反射再进行 120° 旋转则得到不同的对称——这种具体的例子才能获得满分。
12. Exam Tips and Common Pitfalls | 考试技巧与常见错误
Group theory questions in IGCSE CCEA Mathematics often follow a predictable pattern: you are given a set and an operation, and you must determine whether they form a group, or you must complete a Cayley table, or you must identify the identity and inverses. The single most common mistake students make is confusing the group axioms — for instance, attempting to check commutativity when it is not one of the four required axioms. Remember: commutativity is optional; a group need not be Abelian, but it must satisfy closure, associativity, identity, and inverses.
IGCSE CCEA 数学中的群论题目通常遵循一个可预测的模式：你被给定一个集合和一个运算，你必须判断它们是否构成一个群，或者你必须完成一个凯莱表，或者你必须确定单位元和逆元。学生最常犯的一个错误是混淆了群的公理——例如，试图检验交换律，而它并不是四条必需的公理之一。记住：交换律是可选的；一个群不必是阿贝尔群，但它必须满足封闭性、结合律、单位元和逆元。
When checking associativity for an operation defined on a small finite set, do not try to test all 27 possible triples. Instead, look for a likely counterexample — choose elements that behave unusually, such as those that are their own inverses or that appear unusually in the Cayley table. For modular multiplication groups, always check that every element is coprime to the modulus; if even one element shares a factor with n greater than 1, the set is not a group under multiplication modulo n. This is a subtle point that many students overlook, leading to incorrect conclusions about whether a structure is a group.
当为一个定义在小型有限集合上的运算检验结合律时，不要试图检验全部 27 个可能的三元组。相反，要寻找一个可能构成反例的三元组——选择行为异常的元素，例如那些是自己的逆元的元素，或者在凯莱表中出现异常的元素。对于模乘法群，始终要检查每个元素是否与模数互质；如果即使只有一个元素与 n 有大于 1 的公因数，该集合在模 n 乘法下就不构成群。这是一个许多学生忽略的微妙之处，会导致对某个结构是否为群得出错误的结论。
Finally, always show your reasoning step by step. When proving that a structure is a group, work through the four axioms in order: closure, associativity, identity, inverses. When proving that a structure is not a group, you only need to demonstrate that one axiom fails, but you must clearly state which axiom fails and provide a specific counterexample. In questions about subgroup tests, remember that a subset H of a group G is a subgroup if and only if it is closed under the operation and contains the inverse of each of its elements — a shortcut that avoids having to re-check associativity, which is inherited from the parent group G.
最后，始终要逐步展示你的推理过程。当证明一个结构是群时，依次检查四条公理：封闭性、结合律、单位元、逆元。当证明一个结构不是群时，你只需要证明某一条公理不成立，但必须清楚地说明哪条公理不成立，并提供一个具体的反例。在关于子群检验的题目中，记住群 G 的子集 H 是子群，当且仅当它在运算下封闭且包含其每个元素的逆元——这条捷径让你无需重新检验结合律，因为结合律是从母群 G 继承而来的。
Published by TutorHao | Mathematics Revision Series | aleveler.com
更多咨询请联系16621398022（同微信）
或截图后用「扫一扫 → 相册」选择本图