Welcome to Group Theory: The Mathematics of Symmetry and Structure
Welcome to Group Theory, a core topic in CCEA Further Mathematics AS 2 (Section D: Discrete and Decision Mathematics). If you have ever solved a Rubik's cube, flipped a mattress, or noticed the repeating patterns on a snowflake, you have already interacted with group theory! At its heart, group theory is the formal mathematical study of symmetry, operations, and structure.
Don't worry if abstract algebra feels unfamiliar at first. We will break down every concept step-by-step, using visual examples, clear definitions, and worked techniques to help you master every question on your exam.
1. The Four Group Axioms
A group is a mathematical system consisting of a set \(G\) combined with a binary operation \(*\), written as \(\langle G, * \rangle\). For \(\langle G, * \rangle\) to qualify as a group, it must satisfy four fundamental rules called axioms.
A Memory Trick: Remember the word CAIN (or CLOS-ASS-ID-INV):
C – Closure
A – Associativity
I – Identity
N – Inverse
Axiom 1: Closure
For every pair of elements \(a, b \in G\), the result of the operation must also belong to \(G\):
\(\forall a, b \in G, \; a * b \in G\)
Plain English: You cannot escape the set by combining any two of its elements.
Axiom 2: Associativity
For all elements \(a, b, c \in G\), grouping does not change the result:
\(\forall a, b, c \in G, \; (a * b) * c = a * (b * c)\)
Plain English: Brackets do not matter when performing the operation on three elements in a row.
Axiom 3: Identity Element
There exists a unique element \(e \in G\) such that combining it with any element leaves that element unchanged:
\(\exists e \in G \text{ such that } \forall a \in G, \; a * e = e * a = a\)
Example: Under ordinary addition, the identity is \(0\) because \(a + 0 = 0 + a = a\). Under ordinary multiplication, the identity is \(1\) because \(a \times 1 = 1 \times a = a\).
Axiom 4: Inverse Element
For every element \(a \in G\), there exists an element \(a^{-1} \in G\) that undoes \(a\), returning the identity element \(e\):
\(\forall a \in G, \; \exists a^{-1} \in G \text{ such that } a * a^{-1} = a^{-1} * a = e\)
Plain English: Every single element has a "partner" in the set that brings you back to the identity.
Abelian (Commutative) Groups
In general, the order of operation matters (doing \(a * b\) might give a different result from \(b * a\)). However, if a group satisfies the extra condition of commutativity:
\(\forall a, b \in G, \; a * b = b * a\)
then the group is called an Abelian group (named after the mathematician Niels Henrik Abel).
Key Takeaway: To prove a set and operation form a group, you must explicitly show all four axioms hold: Closure, Associativity, Identity, and Inverses.
2. Group Tables (Cayley Tables)
For finite groups, we can display all possible operations in a square grid called a Cayley table (or group table). The entry in row \(a\) and column \(b\) gives the value of \(a * b\).
The Latin Square Property:
In the body of a valid group table, every element of the group must appear exactly once in each row and exactly once in each column. This happens because of the cancellation law: if \(a * x = a * y\), then \(x = y\). If you ever see a duplicate or a missing element in any row or column, the table cannot represent a group!
Symmetry in the Table:
If a Cayley table is completely symmetric across its main leading diagonal (from top-left to bottom-right), the group is Abelian.
Key Takeaway: Use the Latin Square property as an immediate sanity check when filling in or verifying Cayley tables in exams.
3. Order: Group Order vs. Element Order
Students often mix these two terms up, but they mean very different things:
1. Order of a Group, \(|G|\):
The total number of elements in the set \(G\).
Example: If \(G = \{e, a, b, c\}\), then \(|G| = 4\).
2. Order of an Element, \(\text{ord}(g)\) or \(o(g)\):
The smallest positive integer \(n\) such that combining \(g\) with itself \(n\) times produces the identity element \(e\):
\(g^n = \underbrace{g * g * \dots * g}_{n \text{ times}} = e\)
If no such integer exists, the element has infinite order.
Self-Inverse Elements:
An element \(a \ne e\) that has order \(2\) satisfies \(a^2 = e\), meaning \(a = a^{-1}\). It is its own inverse!
Key Takeaway: The group order is the size of the whole team; the element order is how many times one player repeats until they reset back to the start.
4. Subgroups and Lagrange's Theorem
A subgroup \(H\) of a group \(G\) (written \(H \le G\)) is a subset \(H \subseteq G\) that forms a group in its own right under the exact same operation \(*\).
Subgroup Tests
To prove a non-empty subset \(H\) is a subgroup of \(G\), verify:
1. Identity: The identity element \(e \in H\).
2. Closure: For all \(a, b \in H\), \(a * b \in H\).
3. Inverses: For all \(a \in H\), \(a^{-1} \in H\).
Note for Finite Subsets: If \(H\) is finite and non-empty, testing closure alone is sufficient because closure on a finite set guarantees inverses exist within \(H\).
Lagrange's Theorem
One of the most powerful results in group theory states:
If \(G\) is a finite group and \(H\) is a subgroup of \(G\), then the order of \(H\) must divide the order of \(G\).
In symbols: \(|H| \text{ divides } |G|\).
Vital Corollaries of Lagrange's Theorem
Corollary 1: The order of any element \(g \in G\) must divide the order of the group \(|G|\).
Example: In a group of order \(12\), possible element orders are only \(1, 2, 3, 4, 6,\) or \(12\). An element of order \(5\) is mathematically impossible!
Corollary 2 (Groups of Prime Order): If \(|G| = p\) where \(p\) is a prime number (e.g., \(2, 3, 5, 7, 11\)):
\(G\) is always cyclic.
\(G\) is always Abelian.
\(G\) has no non-trivial proper subgroups (its only subgroups are \(\{e\}\) and \(G\) itself).
Every non-identity element in \(G\) is a generator of \(G\).
Key Takeaway: Lagrange's Theorem drastically narrows down the possible subgroups and element orders for any finite group.
5. Standard Families of Groups
1. Cyclic Groups (\(C_n\) or \(\mathbb{Z}_n\))
A group is cyclic if every element can be generated by repeatedly operating a single element \(g\) (called the generator):
\(G = \langle g \rangle = \{g^0, g^1, g^2, \dots, g^{n-1}\}\) where \(g^n = e\).
Crucial Fact: Every cyclic group is automatically Abelian.
2. Dihedral Groups (\(D_{2n}\) or \(D_n\))
The dihedral group represents the full set of symmetries of a regular \(n\)-sided polygon. It has total order \(2n\) and contains:
\(n\) rotational symmetries (including the identity \(0^\circ\) rotation).
\(n\) reflectional symmetries.
Example: The symmetry group of an equilateral triangle has order \(2(3) = 6\) (3 rotations and 3 reflections). Dihedral groups for \(n \ge 3\) are non-Abelian.
3. Modular Arithmetic Groups
Additive Group modulo \(n\) (\(\langle \mathbb{Z}_n, +_n \rangle\)):
The set \(\{0, 1, 2, \dots, n-1\}\) under addition modulo \(n\). This is always a cyclic group of order \(n\) with identity \(0\).
Multiplicative Group of Units (\(\langle \mathbb{Z}_n^\times, \times_n \rangle\)):
The set of integers in \(\{1, 2, \dots, n-1\}\) that are coprime to \(n\) (meaning \(\gcd(a, n) = 1\)), under multiplication modulo \(n\).
Example: For \(n = 8\), the numbers coprime to \(8\) are \(\{1, 3, 5, 7\}\). The order of \(\mathbb{Z}_8^\times\) is \(4\), and its identity is \(1\).
Key Takeaway: Familiarize yourself with cyclic patterns and modular tables—they appear frequently in exam questions.
6. Group Isomorphisms
Two groups \(\langle G, * \rangle\) and \(\langle H, \circ \rangle\) are isomorphic (written \(G \cong H\)) if they have the exact same underlying structure, even if their elements are labeled differently.
Formally, an isomorphism is a bijective (one-to-one and onto) mapping \(f: G \to H\) such that for all \(x, y \in G\):
\(f(x * y) = f(x) \circ f(y)\)
How to Prove Two Groups Are NOT Isomorphic
To prove two finite groups are not isomorphic, you do not need to test every bijection. Instead, find a single structural invariant that differs between them:
1. Different group orders: \(|G| \ne |H|\).
2. Commutativity: One group is Abelian while the other is non-Abelian.
3. Element orders: One group contains an element of order \(k\), but the other group has no elements of order \(k\).
Classic Exam Example: The cyclic group \(C_4\) and the Klein 4-group \(V_4\) both have order \(4\). However, \(C_4\) has elements of order \(4\) (its generators), whereas all non-identity elements in \(V_4\) have order \(2\). Therefore, \(C_4 \not\cong V_4\).
4. Number of self-inverse elements: The groups have different counts of elements satisfying \(x^2 = e\).
Key Takeaway: Same order does NOT guarantee isomorphism! Always check element orders and group properties.
7. Symmetry & Combinatorics: Pólya's Enumeration Theorem
In the CCEA Discrete and Decision Mathematics specification, group theory extends to counting distinct geometric colourings using cycle index polynomials and Pólya's Enumeration Theorem.
Standard Cycle Indices (\(Z\))
The cycle index polynomial \(Z\) describes how rotational symmetry operations break vertices, edges, or faces into permutation cycles. Here are the core cycle indices specified for your course:
1. Regular Tetrahedron (Rotational Symmetries):
Acting on the \(4\) vertices (or \(4\) faces) of a regular tetrahedron, there are \(12\) rotational symmetries in total (the identity, \(8\) rotations of \(\pm 120^\circ\) about axes through vertices, and \(3\) rotations of \(180^\circ\) about axes through opposite edge midpoints):
\(Z = \frac{1}{12} \left( x_1^4 + 8x_1^1 x_3^1 + 3x_2^2 \right)\)
2. Regular Polygon with \(p\) (prime) Vertices in 3D (Rotation and Flip):
For a polygon with a prime number of vertices \(p\) allowed full 3D rotations (in-plane rotations plus out-of-plane flips/reflections):
\(Z = \frac{1}{2p} \left( x_1^p + (p-1)x_p^1 + p x_1^1 x_2^{\frac{p-1}{2}} \right)\)
3. Square under Full Rotation and Flip (Order 8):
For the \(4\) vertices of a square under the full dihedral symmetry group of order \(8\):
\(Z = \frac{1}{8} \left( x_1^4 + 3x_2^2 + 2x_4^1 + 2x_1^2 x_2^1 \right)\)
Applying Pólya's Enumeration Theorem
To find the total number \(N\) of non-equivalent colourings using \(k\) available colours, simply substitute \(x_i = k\) for all variables in the cycle index:
\(N = Z(k, k, \dots, k)\)
Worked Example:
Find the number of distinct ways to colour the \(4\) faces of a regular tetrahedron using \(2\) colours (e.g., Red and Blue).
Step 1: Write down the cycle index for the tetrahedron:
\(Z = \frac{1}{12} \left( x_1^4 + 8x_1^1 x_3^1 + 3x_2^2 \right)\)
Step 2: Substitute \(x_1 = 2\), \(x_2 = 2\), and \(x_3 = 2\) into the polynomial:
\(N = \frac{1}{12} \left( (2)^4 + 8(2)^1(2)^1 + 3(2)^2 \right)\)
Step 3: Calculate each term arithmetic value:
\(2^4 = 16\)
\(8(2)(2) = 32\)
\(3(4) = 12\)
Step 4: Sum and divide:
\(N = \frac{1}{12} (16 + 32 + 12) = \frac{1}{12}(60) = 5\)
There are exactly \(5\) distinct ways to colour the faces!
Key Takeaway: Cycle indices capture symmetry operations; substituting the number of colours \(k\) into \(Z\) gives the number of truly distinct colourings.
8. Common Exam Pitfalls & How to Avoid Them
1. Mixing Up Group Order and Element Order:
Remember: \(|G|\) is the size of the whole set, while \(\text{ord}(a)\) is the power needed for \(a\) to reach \(e\). Never write \(|a| = G\).
2. Incomplete Subgroup Proofs:
If asked to prove a subset \(H\) is a subgroup, you must explicitly mention and verify that the identity belongs to \(H\), that \(H\) is closed, and that inverses exist in \(H\).
3. Assuming Associativity Without Checking:
If a question gives a newly defined operation like \(a * b = a + b - ab\), do not simply write "it is associative". You must algebraically expand \((a * b) * c\) and \(a * (b * c)\) to show they yield identical algebraic expressions.
4. Assuming Same Order Means Isomorphic:
Never state two groups are isomorphic just because \(|G| = |H|\). You must check whether element orders match and whether both groups share structural properties (such as both being Abelian).
5. Reversing Row and Column in Cayley Tables:
Be consistent with whether the row element or column element operates first. For non-Abelian groups, row operated on column (\(\text{row} * \text{col}\)) is standard.
Quick Revision Checklist
Before sitting your exam, make sure you can:
State and test all 4 group axioms (Closure, Associativity, Identity, Inverse).
Construct and analyze Cayley tables using the Latin Square property.
State Lagrange's Theorem and use it to rule out impossible subgroups or element orders.
Identify properties of cyclic groups and prime order groups.
Prove whether two groups are isomorphic or identify invariants showing they are not.
Select the correct cycle index polynomial and apply Pólya's Theorem to solve combinatorics problems.