Introduction to Groups
Welcome to the world of Groups! This chapter is part of your Extra Pure module. While it might sound like a completely new type of math, you’ve actually been using the properties of groups since primary school. At its heart, Group Theory is the study of symmetry and the underlying "rules" that govern mathematical systems.
Think of a group as a "mathematical club." To be a club, there are specific entry requirements and rules members must follow. In this section, we will learn how to identify these "clubs," how they behave, and how some clubs are actually identical even if they look different!
1. The Foundation: Sets and Notation
Before we define a group, we need to speak the right language. A Set is just a collection of objects (usually numbers or transformations).
Common Number Sets you need to know:
- \(\mathbb{N}\): Natural numbers \(\{1, 2, 3, ...\}\) or \(\mathbb{N}_0 = \{0, 1, 2, ...\}\)
- \(\mathbb{Z}\): Integers \(\{..., -2, -1, 0, 1, 2, ...\}\)
- \(\mathbb{Q}\): Rational numbers (fractions)
- \(\mathbb{R}\): Real numbers (all points on the number line)
- \(\mathbb{C}\): Complex numbers (\(a + bi\))
Important Symbols:
- \(x \in A\): \(x\) is a member of set \(A\).
- \(A \subseteq B\): \(A\) is a subset of \(B\).
- \(n(A)\) or \(|A|\): The order (number of elements) of a finite set.
Quick Review: A set is just the "bucket" of numbers we are working with. The group is the bucket plus a rule for how to combine them!
2. The Four Golden Rules: Group Axioms
To be a group \((G, *)\), a set \(G\) and a binary operation \(*\) (like addition, multiplication, or matrix multiplication) must follow four rules. If even one rule is broken, it’s not a group!
Memory Aid: Use the mnemonic CAII (pronounced like "K-eye"):
C - Closure
A - Associativity
I - Identity
I - Inverse
1. Closure
If you take any two elements in the group and combine them using the operation, the result must still be in the group.
Example: The set of odd numbers under addition is not closed because \(1 + 3 = 4\), and \(4\) is even!
2. Associativity
The order in which you group elements doesn't change the result: \((a * b) * c = a * (b * c)\).
Note: Most operations we use (addition, multiplication, matrix multiplication) are naturally associative.
3. Identity
There must be one special element, usually called \(e\), that does "nothing."
- For addition, \(e = 0\) (because \(a + 0 = a\)).
- For multiplication, \(e = 1\) (because \(a \times 1 = a\)).
4. Inverse
Every single element must have a "partner" that brings it back to the identity.
- Under addition, the inverse of \(a\) is \(-a\).
- Under multiplication, the inverse of \(a\) is \(\frac{1}{a}\).
Watch out! In multiplication, \(0\) usually stops a set from being a group because it has no inverse (you can't do \(\frac{1}{0}\)).
Special Term: If a group also follows the rule \(a * b = b * a\), we call it an Abelian group (named after the mathematician Niels Abel).
Key Takeaway: A group is a set where you can combine any two things and always stay in the set, there's a "do-nothing" element, and everyone has a "undo" partner.
3. Group Tables (Composition Tables)
For small finite groups, we can draw a grid to show every possible combination. This is called a Cayley Table.
Example: Addition modulo 4
\(\begin{array}{c|cccc} +_4 & 0 & 1 & 2 & 3 \\ \hline 0 & 0 & 1 & 2 & 3 \\ 1 & 1 & 2 & 3 & 0 \\ 2 & 2 & 3 & 0 & 1 \\ 3 & 3 & 0 & 1 & 2 \end{array}\)
How to spot the rules in a table:
- Identity: Look for a row/column that looks exactly like the header.
- Inverses: Look for the identity element in each row. The column it's in tells you the inverse.
- Abelian: If the table is symmetrical across the main diagonal (top-left to bottom-right), it's Abelian!
4. Order and Cyclic Groups
The word "Order" is used in two ways in Group Theory. Don't let this confuse you!
1. Order of a Group: The total number of elements in the group, written \(|G|\).
2. Order of an Element: The number of times you must apply the operation to an element to get back to the identity. We say \(a^n = e\), where \(n\) is the order.
Cyclic Groups:
A group is Cyclic if there is at least one element (called a generator, \(\langle x \rangle\)) that can produce every other element in the group just by repeating the operation.
Analogy: A clock is cyclic. By adding 1 hour repeatedly, you eventually hit every number on the face.
Did you know? All cyclic groups are Abelian, but not all Abelian groups are cyclic!
5. Subgroups and Lagrange's Theorem
A Subgroup is a smaller "club" inside the main group that still follows all four group axioms on its own.
The Subgroup Test: To check if a subset \(H\) is a subgroup, check:
1. Is the identity \(e\) in \(H\)?
2. Is it closed? (\(a, b \in H \Rightarrow a * b \in H\))
3. Does every element have its inverse in \(H\)?
Lagrange's Theorem
This is one of the most powerful rules in the course! It states:
In a finite group, the order of a subgroup must divide the order of the group exactly.
Example: If a group has 6 elements, its subgroups can only have sizes 1, 2, 3, or 6. It is impossible to have a subgroup of size 4 or 5.
Key Takeaway: Lagrange's Theorem helps you narrow down possibilities. If the math doesn't divide evenly, it's not a subgroup!
6. Isomorphism: Mathematical Twins
Sometimes two groups look totally different but act exactly the same. We call these Isomorphic groups (\(G \cong H\)).
Example: The symmetries of a rectangle and the group \(\{1, -1, i, -i\}\) under multiplication might look different, but their underlying structure (how the elements interact) is identical.
To prove an isomorphism, check if:
- They have the same order (\(|G| = |H|\)).
- One is cyclic and the other is not? Then they are not isomorphic.
- Do they have the same number of elements of each order? (e.g., if one group has three elements of order 2, the twin group must also have three elements of order 2).
Encouraging Note: Don't worry if Isomorphisms feel abstract! Just remember it's like a game of Chess played with wooden pieces vs. Chess played on a computer. Different "look," identical rules.
Common Mistakes to Avoid
- Forgetting the operation: A set is not a group on its own. It needs the operation. (\(\mathbb{Z}\) is a group under addition, but not under multiplication because \(2\) has no integer inverse).
- Identity confusion: Always identify the identity element first before looking for inverses.
- Lagrange backwards: Just because a number divides the group order doesn't guarantee a subgroup exists of that size (though for A-level, Lagrange is mostly used to show a subgroup can't exist).
Final Quick Review Box:
1. Group = Set + Operation + CAII.
2. Order of Group = size; Order of Element = steps to get to \(e\).
3. Lagrange: Subgroup size must fit perfectly into Group size.
4. Isomorphism: Same structure, different outfits!