Welcome to the World of Groups!
Welcome to one of the most exciting parts of Further Mathematics: Group Theory. While it might sound like a social club, in math, a Group is a set of elements combined with a rule (an operation) that follows four very specific "golden rules."
Why do we study this? Because Groups are the language of symmetry. From the way crystals form to how digital encryption secures your text messages, Groups help mathematicians and scientists understand the hidden structures of the universe. Don't worry if it feels "abstract" at first—we'll break it down into simple pieces!
1. The Foundation: Binary Operations and Axioms
Before we define a group, we need to understand a Binary Operation. This is just a fancy name for a rule that takes two elements and combines them to produce a third. Examples include addition \( (+ \)), multiplication \( (\times \)), or even "matrix multiplication."
The Four Golden Rules (Axioms)
For a set of elements and an operation (let's call it \( * \)) to be called a Group, they must pass the CAII test:
1. Closure: If you pick any two elements in the group and combine them using the operation, the result must also be in the group.
Analogy: If you add two whole numbers, you always get a whole number. You never get "Purple" or "0.5". The set is "closed."
2. Associativity: The way you group the elements doesn't change the result. For any three elements \( a, b, \) and \( c \):
\( (a * b) * c = a * (b * c) \)
3. Identity: There must be one special "do-nothing" element, usually called \( e \). When you combine any element \( a \) with \( e \), it stays exactly as it is:
\( a * e = a \) and \( e * a = a \)
Example: In addition, the identity is \( 0 \) (because \( 5 + 0 = 5 \)). In multiplication, the identity is \( 1 \) (because \( 5 \times 1 = 5 \)).
4. Inverse: Every single element \( a \) must have a "partner" (called \( a^{-1} \)) that "undoes" it to bring you back to the identity:
\( a * a^{-1} = e \)
Example: In addition, the inverse of \( 5 \) is \( -5 \), because \( 5 + (-5) = 0 \).
Memory Aid: Just remember CAII (pronounced "Kay-Eye"): Closure, Associativity, Identity, Inverse.
Quick Review Box:
- A Group is a set + an operation.
- It must satisfy all 4 axioms.
- If even one axiom fails, it's NOT a group!
2. Describing Groups: Cayley Tables
For small groups, we often use a Cayley Table. This is basically a "multiplication table" for the group elements.
Example: A group with elements {e, a, b} under operation \( * \)
\( * \) | e | a | b
--- | --- | --- | ---
e | e | a | b
a | a | b | e
b | b | e | a
How to spot a group in a table:
- Latin Square Property: In a group table, every element must appear exactly once in every row and every column (like a Sudoku!).
- Identity: Look for the row and column that look exactly like the header row/column. That's your identity element \( e \).
- Inverses: Find the identity \( e \) in the table. The elements at the top of the column and the start of the row are inverses of each other.
Common Mistake: Just because a table is a Latin Square doesn't automatically make it a group (it might fail associativity), but if it's not a Latin Square, it definitely isn't a group!
3. Famous Examples of Groups
The syllabus requires you to be familiar with these specific types of groups:
Symmetries of Geometric Figures
Imagine a square. You can rotate it \( 90^\circ, 180^\circ, 270^\circ \), or \( 360^\circ \) (which is the same as doing nothing). You can also flip (reflect) it. These actions form a group because doing two rotations in a row is just another rotation (Closure), there's a "do-nothing" action (Identity), and you can always rotate back (Inverse).
Modular Arithmetic (Clock Math)
The set of integers modulo \( n \) under addition is a group.
Example: Modulo 4. The set is {0, 1, 2, 3}. If you do \( 3 + 2 \), you get \( 5 \), which is \( 1 \) in modulo 4.
Non-Singular Matrices
The set of \( n \times n \) matrices with a non-zero determinant (\( \text{det} \neq 0 \)) forms a group under matrix multiplication.
Why non-zero? Because we need an Inverse, and only matrices with a non-zero determinant have an inverse!
Cyclic Groups
A group is Cyclic if every element in the group can be generated by repeatedly applying the operation to just one specific element (the generator).
Analogy: A clock. Every hour can be reached by just adding "1 hour" repeatedly.
Did you know? All cyclic groups are Abelian, which means the order doesn't matter (\( a * b = b * a \)). However, not all groups are Abelian—matrix multiplication is a famous example where order matters!
4. Order of Groups and Elements
In group theory, "Order" simply means "Size."
Order of a Group \( |G| \): The total number of elements in the set.
Order of an Element \( a \): This is the smallest positive integer \( n \) such that \( a^n = e \). In plain English: how many times do you have to apply the operation to an element before you get back to the identity?
Example: In the set {0, 1, 2, 3} modulo 4 under addition, the identity is 0. The order of element '1' is 4, because \( 1+1+1+1 = 4 \equiv 0 \).
Key Takeaway: If an element has the same order as the group itself, it is a generator, and the group is cyclic.
5. Subgroups and Lagrange's Theorem
A Subgroup is a smaller set of elements taken from a larger group that is still a group in its own right using the same operation.
The Subgroup Test
To check if a subset \( H \) is a subgroup of \( G \), you only really need to check:
1. The Identity of \( G \) is in \( H \).
2. Closure: If \( a, b \in H \), then \( a * b \in H \).
3. Inverses: If \( a \in H \), then \( a^{-1} \in H \).
Lagrange’s Theorem
This is one of the most powerful "shortcuts" in math. It states:
The order of a subgroup must exactly divide the order of the main group.
\( \frac{|G|}{|H|} = \text{an integer} \)
Example: If a group has 6 elements, its subgroups can only have 1, 2, 3, or 6 elements. A group of 6 elements CANNOT have a subgroup of 4 or 5 elements. It's mathematically impossible!
Encouragement: Lagrange's theorem is like a filter. If an exam question asks if a set of 5 elements can be a subgroup of a group of 12, you can immediately say "No!" because 12 is not divisible by 5. Easy marks!
Quick Review of Section 5:
- Subgroups are groups inside groups.
- Lagrange: Subgroup size must be a factor of the group size.
- This helps you find possible subgroups quickly.
Summary: Final Checklist
Before your exam, make sure you can:
- State and check the 4 Axioms (CAII).
- Complete and interpret a Cayley Table.
- Identify Identity and Inverse elements.
- Calculate the Order of an element.
- Apply Lagrange’s Theorem to prove or disprove the existence of subgroups.
Don't worry if this seems tricky at first! Abstract algebra is like learning a new language. The more you practice with the "grammar" (the axioms), the more natural it will feel.