Group axioms and examples
Studying this course? Keep your progress in one place.
Key facts
- A group is a set with a binary operation satisfying closure, associativity, identity and inverses.
- Always check closure first: it is the axiom most often failing.
- In a Cayley table every element appears exactly once in each row and column.
- A group is abelian if for all ; the axioms do not require it.
- A cyclic group is generated by one element ; a generator must produce every element before returning to .
Binary operations and closure
A set is closed if combining any two of its elements always gives an element of the set.
A binary operation on a set combines any two elements of to give one element.
is closed under if for all . To show a set is not closed, find a single pair whose result leaves the set.
For example, under multiplication modulo 6 is not closed, because and is not in the set.
- 1
Pick two elements
any pair in the set, including the same one twice
- 2
Combine them
using the operation
- 3
Check the result
is it in the set?
- 4
One failure is enough
2 × 3 ≡ 0 (mod 6), and 0 is not in {1, …, 5}
Closed
- Integers under addition
- under mod 8
Not closed
- under mod 6 ()
- Positive integers under subtraction ()
Is closed under multiplication modulo 6?
The four group axioms
A set with an operation is a group if it has closure, associativity, an identity and inverses.
A set with a binary operation is a group if:
- Closure: for all .
- Associativity: .
- Identity: some has for all .
- Inverses: each has with .
The identity is unique and each element has exactly one inverse. If also for all , the group is abelian.
- 1
Closure
every product stays in the set
- 2
Associativity
quote it for matrices and functions
- 3
Identity
find e in the set
- 4
Inverses
every element has one in the set
Why are the positive integers under addition not a group?
Standard examples of groups
Integers modulo under addition, non-zero residues modulo a prime under multiplication, non-singular matrices, symmetries and permutations are all groups.
- Integers modulo under addition, : identity , inverse of is .
- Multiplication modulo : is a group when is prime, e.g. mod 7. Every element must be invertible: mod 8 is a group, but mod 6 is not closed.
- Non-singular matrices (, non-zero determinant) under multiplication. Singular matrices have no inverse.
- Symmetries of a figure, e.g. the six symmetries of an equilateral triangle.
- Permutations of under composition: order 6.
- 1
Closure
combining two elements stays in the set
- 2
Identity
an element that changes nothing
- 3
Inverses
every element has one
- 4
Associativity
bracketing does not matter
| Mod , | Mod prime , | Matrices, | |
|---|---|---|---|
| Identity | |||
| Inverse of a | mod |
Mod ,
- Identity:
- Inverse of a:
Mod prime ,
- Identity:
- Inverse of a:
- mod
Matrices,
- Identity:
- Inverse of a:
In the integers modulo 9 under addition, what is the inverse of ?
Cayley tables
A Cayley table shows every product, so you can read off closure, the identity, inverses and whether the group is abelian.
A Cayley table lists all products for a finite group, with the row element on the left. Use it to check:
- closure: every entry is in the set;
- the identity: the element whose row and column repeat the headings;
- inverses: each element appears exactly once in every row and column (a Latin square);
- abelian: the table is symmetrical about the leading diagonal.
In mod 8, runs down the leading diagonal, since every element is its own inverse.
- 1
Closure
every entry is in the set
- 2
Identity
its row and column repeat the headings
- 3
Inverses
the identity appears in every row
- 4
Abelian
the table is symmetric about the leading diagonal
| × 1 | × 3 | × 5 | × 7 | |
|---|---|---|---|---|
| 1 | 1 | 3 | 5 | 7 |
| 3 | 3 | 1 | 7 | 5 |
| 5 | 5 | 7 | 1 | 3 |
| 7 | 7 | 5 | 3 | 1 |
× 1
- 1:
- 1
- 3:
- 3
- 5:
- 5
- 7:
- 7
× 3
- 1:
- 3
- 3:
- 1
- 5:
- 7
- 7:
- 5
× 5
- 1:
- 5
- 3:
- 7
- 5:
- 1
- 7:
- 3
× 7
- 1:
- 7
- 3:
- 5
- 5:
- 3
- 7:
- 1
In this table, which element is the identity?
Cyclic groups
A cyclic group is one where every element is a power of a single generator.
A group is cyclic if every element is a power (or multiple) of one element , called a generator: . In additive notation the elements are .
under addition modulo 6 is generated by (and by ) but not by , which produces only .
under multiplication modulo 7 is generated by . The group mod 8 is not cyclic, because every element squares to the identity.
- 1
first power
- 2
second power
- 3
third power
- 4
fourth power
- 5
fifth power
- 6
the identity, after all six elements
Is under multiplication mod 8 cyclic?
Try an exam question
The set with multiplication modulo 8. Show that is a group, and state, with a reason, whether it is cyclic.
[5 marks]
- [1]Closure: every product in the Cayley table is 1, 3, 5 or 7.
- [1]Associativity: multiplication modulo 8 is associative.
- [1]The identity is 1, and each element is its own inverse.
- [1]So S is a group.
- [1]Not cyclic: , so no element generates all four.
That's the notes covered.
Carry on to the next subtopic.
Try a question
What is the inverse of in ?
1 mark, marked against the mark scheme
What is the inverse of in ?
1 mark, marked against the mark scheme