Groups: The Language of Symmetry
“A group is a collection of reversible moves—the very language of symmetry.”
The formula
(G, ∗): ① a∗b ∈ G ② (a∗b)∗c = a∗(b∗c) ③ a∗e = e∗a = a ④ a∗a⁻¹ = eHow to read it: a set G with an operation ∗ is a group when it satisfies closure, associativity, an identity, and inverses
- a∗b ∈ G
- — combining two elements stays inside G
- (a∗b)∗c = a∗(b∗c)
- — how you group the operations doesn't change the result
- a∗e = e∗a = a
- — an element e that leaves others unchanged (like 0 or 1)
- a∗a⁻¹ = e
- — the partner that undoes a back to the identity
The hook
Integer addition, clock arithmetic, cube rotations, the Rubik's cube—wildly different things share one skeleton. That skeleton is a 'group'.
In plain words
A group is a set plus an operation, where the operation obeys four rules: (1) results never leak out (closure), (2) grouping doesn't matter (associativity), (3) there is a do-nothing identity, and (4) every element has an inverse that undoes it.
The intuition
A group is the language of symmetry. Think of the four rotations of a square by 90° each—compose any of them and you land on one of the four (closure), doing nothing is the identity, turning the other way is the inverse. This 'collection of reversible moves' is a group. Every operation that leaves an object looking the same forms a group.
How it's built
The four axioms are the parts: closure gives 'staying in the system', the identity gives 'a reference point', inverses give 'undoing', and associativity gives 'chaining without worrying about order'. These minimal rules force a surprisingly rich structure. Note: commutativity (a∗b=b∗a) is not required.
Example
Integers under addition (ℤ,+): summing two integers gives an integer (closure), 0 is the identity, the inverse of n is −n, and associativity holds—so it is a group. Clock arithmetic {0,1,2,3} under addition mod 4 is also a group: 3+3=6≡2 stays inside, and each element has a partner.
Common mistake
A group need not be commutative (a∗b=b∗a). For instance 3D rotations, matrix multiplication, and Rubik's-cube moves give different results if you swap the order—yet each is still a perfectly good group.
Where it's used
Symmetries of crystals (crystallography), classification of particles (the Standard Model), error-correcting codes and RSA/elliptic-curve cryptography, solving the Rubik's cube, deciding whether an equation is solvable by radicals—groups hide wherever there is symmetry and structure.
Where it came from
The 20-year-old Évariste Galois invented groups in the 1830s to explain why equations of degree five and up are not solvable by radicals. He scrawled the theory down the night before a duel and died the next day.
Prerequisites
Quick check
In the group (ℤ,+), what is the inverse of the element 5?
- 5
- −5✓
- 0
- 1/5
Practice
What is the identity element of the group (ℤ,+)? (answer as a number)
Answer: 0
- the identity e satisfies a+e=a
- a+0=a, so e=0
Takeaway: The identity is 0 for an additive group, 1 for a multiplicative one.
The rotations of a square {0°, 90°, 180°, 270°} form a group under composition. How many elements does it have?
Answer: 4
- there are four distinct rotations
- so the order (number of elements) is 4
Takeaway: The order of a group is its number of elements.
In the group Z₅ (addition mod 5), find the inverse of the element 2.
Answer: 3
- find x with 2 + x ≡ 0 (mod 5)
- 2 + 3 = 5 ≡ 0, so the inverse is 3
Takeaway: In addition mod n, the inverse of a is n−a.
Decide whether the odd integers form a group under addition, and write your reasoning.
Answer: undefined
- odd + odd = even → the result leaks out (closure fails)
- the identity 0 (even) is not in the set either
- therefore it is not a group
Takeaway: Break even one axiom and it's not a group—check closure first.