Welcome to Group Theory
Welcome to Group Theory! This is one of the most elegant and fascinating branches of pure and decision mathematics. At first, abstract algebra can sound intimidating, but don't worry if this seems tricky at first—at its core, group theory is simply the study of symmetry, patterns, and the underlying rules of mathematical operations.
Think of it like a board game: in any game, you have a set of pieces and a set of rules for legal moves. A group is just a mathematical system consisting of a set of elements combined with a specific operation that obeys four golden rules. By the end of this guide, you will master these rules, learn how to build group tables, explore subgroups, and spot structural twins through isomorphisms.
1. What is a Group? The Four Axioms
A group is denoted as a pair \((G, *)\), where \(G\) is a set of elements and \(*\) is a binary operation (such as addition, multiplication, or combining transformations). For \((G, *)\) to qualify as a group, it must satisfy four fundamental rules called axioms.
Memory Aid (Mnemonic): Remember the word CAII (pronounced "kay"):
• C - Closure
• A - Associativity
• I - Identity
• I - Inverse
Axiom 1: Closure
If you take any two elements in the set and combine them using the operation \(*\), the result must also be inside the set.
Mathematically: For all \(a, b \in G\), the result \(a * b \in G\).
Everyday Analogy: Imagine an exclusive club. If two club members shake hands, no outsider is suddenly created—the result remains strictly inside the club.
Axiom 2: Associativity
The grouping of the operations does not change the outcome. You can combine the first pair first, or the second pair first.
Mathematically: For all \(a, b, c \in G\), \((a * b) * c = a * (b * c)\).
Note: Standard addition and multiplication are associative, but subtraction and division are not. For example, \((8 - 3) - 2 = 3\), whereas \(8 - (3 - 2) = 7\).
Axiom 3: Identity Element
There must be a special "do-nothing" element, usually written as \(e\) (or \(0\) in addition, \(1\) in multiplication). Combining any element with the identity leaves the original element completely unchanged.
Mathematically: There exists an element \(e \in G\) such that for every \(a \in G\), \(a * e = e * a = a\).
Axiom 4: Inverse Element
Every single element in the set must have an "undo button"—a partner element that, when combined with it, takes you straight back to the identity \(e\).
Mathematically: For each \(a \in G\), there exists an element \(a^{-1} \in G\) such that \(a * a^{-1} = a^{-1} * a = e\).
Quick Review: To prove a set and operation form a group, you must systematically test and confirm all 4 axioms: Closure, Associativity, Identity, and Inverse.
2. Abelian Groups and Orders
Abelian (Commutative) Groups
In standard groups, order can matter: \(a * b\) does not always equal \(b * a\). However, if the order of combining elements never matters, the group is called an Abelian group (named after the mathematician Niels Henrik Abel).
Mathematically: A group \((G, *)\) is Abelian if \(a * b = b * a\) for all \(a, b \in G\).
The Order of a Group
The order of a group \(G\), written as \(|G|\) or \(\text{ord}(G)\), is simply the total number of elements in the set \(G\).
• A finite group has a countable number of elements (e.g., \(|G| = 4\)).
• An infinite group has endlessly many elements (e.g., the integers under addition, \((\mathbb{Z}, +)\)).
The Order of an Element
The order of an element \(a \in G\) is the smallest positive integer \(n\) such that combining \(a\) with itself \(n\) times gives the identity element \(e\).
Mathematically: \(a^n = \underbrace{a * a * \dots * a}_{n \text{ times}} = e\).
If no such positive integer exists, the element has infinite order.
Important Rule: The identity element \(e\) is the only element in any group with an order of \(1\), because \(e^1 = e\).
Key Takeaway: Order of the group = size of the set. Order of an element = how many times you apply it to get back to the identity \(e\).
3. Cayley Tables (Group Tables)
A Cayley table is a grid that displays the result of every possible combination of elements in a finite group, similar to a multiplication table.
Consider a group of order 4 with elements \(\{e, a, b, c\}\), where \(e\) is the identity:
\(*\) | \(e\) | \(a\) | \(b\) | \(c\)
—|—|—|—|—
\(e\) | \(e\) | \(a\) | \(b\) | \(c\)
\(a\) | \(a\) | \(e\) | \(c\) | \(b\)
\(b\) | \(b\) | \(c\) | \(e\) | \(a\)
\(c\) | \(c\) | \(b\) | \(a\) | \(e\)
How to Inspect a Cayley Table
• Checking Closure: Every entry inside the grid must be one of the original elements of the group.
• Finding the Identity: Look for the row and column that exactly match the header row and header column. In the table above, the row for \(e\) is \(e, a, b, c\), so \(e\) is the identity.
• Finding Inverses: Look for where the identity \(e\) appears. If the entry at row \(x\) and column \(y\) is \(e\), then \(x\) and \(y\) are inverses of each other. In the table above, \(a * a = e\), so \(a^{-1} = a\).
• Checking for Abelian (Commutative): The table must be perfectly symmetrical across its leading diagonal (from top-left to bottom-right).
• The Latin Square Property (Sudoku Rule): In every Cayley table, every element must appear exactly once in each row and exactly once in each column. No repeats and no missing elements!
Key Takeaway: Cayley tables give you a complete visual blueprint of a finite group. Symmetrical table = Abelian group.
4. Common Examples of Groups in AS Mathematics
Example A: Modular Addition Groups \((\mathbb{Z}_n, +_n)\)
The set of integers modulo \(n\) is \(\mathbb{Z}_n = \{0, 1, 2, \dots, n-1\}\) under addition modulo \(n\).
• For \((\mathbb{Z}_4, +_4)\), the set is \(\{0, 1, 2, 3\}\).
• The identity is \(0\).
• Let's find orders of elements in \((\mathbb{Z}_4, +_4)\):
- For \(1\): \(1 \equiv 1\), \(1+1=2\), \(1+1+1=3\), \(1+1+1+1=4 \equiv 0\). Thus, the order of \(1\) is \(4\).
- For \(2\): \(2 \equiv 2\), \(2+2=4 \equiv 0\). Thus, the order of \(2\) is \(2\).
- For \(3\): \(3+3=6 \equiv 2\), \(3+3+3=9 \equiv 1\), \(3+3+3+3=12 \equiv 0\). Thus, the order of \(3\) is \(4\).
Example B: Modular Multiplication Groups \((\mathbb{Z}_p^*, \times_p)\)
Under multiplication modulo a prime number \(p\), the set \(\{1, 2, \dots, p-1\}\) forms a group.
For example, for \(p = 5\), the set is \(\{1, 2, 3, 4\}\) under multiplication modulo \(5\):
• The identity is \(1\).
• Inverses: \(2 \times 3 = 6 \equiv 1 \pmod 5\), so \(2^{-1} = 3\) and \(3^{-1} = 2\).
• \(4 \times 4 = 16 \equiv 1 \pmod 5\), so \(4\) is its own inverse (\(4^{-1} = 4\)).
Example C: Symmetries of a Geometric Shape
Geometric transformations (rotations and reflections) that leave a shape unchanged form a group under the operation of composition (doing one transformation after another).
The Klein 4-Group (Symmetries of a non-square rectangle):
A rectangle has 4 symmetries: \(\{I, R, H, V\}\), where:
• \(I\) = Identity (no change / 0° rotation)
• \(R\) = Rotation of 180° about the centre
• \(H\) = Reflection across the horizontal axis of symmetry
• \(V\) = Reflection across the vertical axis of symmetry
Every non-identity element has order \(2\) (\(R^2 = I\), \(H^2 = I\), \(V^2 = I\)), and combining any two non-identity elements gives the third (e.g., \(H \circ V = R\)).
Key Takeaway: Groups appear naturally in clock arithmetic (modular arithmetic) and in the physical symmetries of shapes.
5. Subgroups and Lagrange's Theorem
What is a Subgroup?
A subset \(H\) of a group \(G\) is called a subgroup (written \(H \le G\)) if \(H\) is itself a group under the exact same operation as \(G\).
Every group \(G\) has at least two trivial subgroups:
1. The group containing only the identity: \(\{e\}\).
2. The entire group itself: \(G\).
Any other subgroup is called a proper subgroup.
Subgroup Criteria
To show that a non-empty subset \(H\) is a subgroup of a finite group \(G\), you only need to show:
1. Identity: The identity element \(e\) of \(G\) is in \(H\).
2. Closure: For any \(a, b \in H\), \(a * b \in H\).
3. Inverses: For every \(a \in H\), its inverse \(a^{-1} \in H\).
Helpful Tip: For finite subsets, if closure holds, the inverses are automatically in the set!
Lagrange's Theorem
This is one of the most powerful theorems in discrete mathematics:
Lagrange's Theorem: If \(G\) is a finite group and \(H\) is a subgroup of \(G\), then the order of \(H\) must divide the order of \(G\) exactly.
Mathematically: \(|H|\) is a factor of \(|G|\).
Super Useful Consequences of Lagrange's Theorem
• Element Order Divides Group Order: The order of any individual element \(a \in G\) must divide the order of the group \(|G|\).
• Groups of Prime Order: If the order of a group \(|G|\) is a prime number (e.g., 2, 3, 5, 7), the group has no proper non-trivial subgroups, and it must be cyclic!
Exam Application Example: Can a group of order \(6\) have a subgroup of order \(4\)?
Answer: No! By Lagrange's Theorem, the order of a subgroup must divide \(6\). The only possible subgroup orders are \(1, 2, 3,\) and \(6\). Since \(4\) does not divide \(6\), no such subgroup can exist.
Key Takeaway: Subgroups must fit neatly into the parent group—their size must be a divisor of the whole group's size.
6. Cyclic Groups and Generators
What is a Cyclic Group?
A group \(G\) is called cyclic if every single element in \(G\) can be generated by repeatedly applying the operation to one single element, called the generator \(g\).
We write: \(G = \langle g \rangle = \{g^1, g^2, g^3, \dots, g^n = e\}\).
Key Properties of Cyclic Groups
• Every cyclic group is automatically Abelian (commutative).
• If a group has order \(n\), an element \(g\) is a generator if and only if the order of \(g\) is equal to \(n\).
• Every finite group of prime order is cyclic.
Worked Example: Show that \((\mathbb{Z}_6, +_6)\) is cyclic and find all its generators.
The group is \(\{0, 1, 2, 3, 4, 5\}\) with order \(6\). We need elements of order \(6\):
• Powers (multiples) of \(1\): \(1, 2, 3, 4, 5, 0\). Order = \(6\). So, \(1\) is a generator!
• Powers of \(2\): \(2, 4, 0\). Order = \(3\) (not a generator).
• Powers of \(5\): \(5, 4, 3, 2, 1, 0\). Order = \(6\). So, \(5\) is also a generator!
Thus, the generators of \((\mathbb{Z}_6, +_6)\) are \(1\) and \(5\).
Key Takeaway: A group of order \(n\) is cyclic if it contains at least one element whose order is also \(n\).
7. Group Isomorphism
What is an Isomorphism?
Two groups \((G, *)\) and \((H, \circ)\) may have elements with different names, but mathematically they might have the exact same structure. When two groups share identical algebraic structure, we say they are isomorphic, written as \(G \cong H\).
How to Determine if Two Finite Groups are Isomorphic
For two groups to be isomorphic, they must match in every structural property:
1. Same Order: They must have the same total number of elements (\(|G| = |H|\)).
2. Abelian Property: Either both are Abelian, or both are non-Abelian.
3. Matching Element Orders: They must have the exact same distribution of element orders (e.g., the same number of elements of order 2, order 3, etc.).
4. Cyclic Nature: If one is cyclic, the other must be cyclic.
Classic Exam Comparison: Groups of Order 4
There are only two distinct group structures of order 4:
1. The Cyclic group of order 4 (like \((\mathbb{Z}_4, +_4)\)): Contains elements of orders \(1, 2, 4, 4\).
2. The Klein 4-group (like rectangle symmetries): Contains elements of orders \(1, 2, 2, 2\).
Because their element orders do not match, the cyclic group of order 4 and the Klein 4-group are not isomorphic!
Key Takeaway: Isomorphism means "same shape". If two groups have different sets of element orders, they cannot be isomorphic.
8. Common Pitfalls and Exam Tips
• Pitfall 1: Assuming commutativity. Don't assume \(a * b = b * a\) unless you have proved the group is Abelian or the question states it.
• Pitfall 2: Confusing the order of a group with the order of an element. Group order is the size of the whole set; element order is how many steps to reach the identity \(e\).
• Pitfall 3: Inverse notation in additive groups. In multiplicative groups, the inverse of \(a\) is \(a^{-1}\). In additive groups, the inverse of \(a\) is \(-a\), and the identity is \(0\), not \(1\).
• Exam Tip for Lagrange: If asked to list possible orders of subgroups for a group of order \(12\), simply list all the positive divisors of \(12\): \(1, 2, 3, 4, 6, 12\).