Groups
Studying this course? Keep your progress in one place.
Key facts
- A group satisfies four axioms: closure, identity, inverses and associativity.
- To show a set is not a group, find one axiom that fails.
- In a group's Cayley table every element appears exactly once in each row and column.
- The order of a group is its number of elements; the order of an element is the smallest with .
- A cyclic group is generated by one element; every cyclic group is abelian, but not every abelian group is cyclic.
The group axioms
A group is closed, associative, has an identity, and gives every element an inverse.
A group is a set with a binary operation satisfying four axioms: closure, identity, inverses and associativity.
Example: under multiplication has closure, identity and associativity, but has no inverse in .
For a finite set, associativity of modular arithmetic is inherited from the integers, and may be quoted.
- 1
Closure
a * b is always in G
- 2
Associativity
(a * b) * c = a * (b * c)
- 3
Identity
an element e with e * a = a * e = a
- 4
Inverses
every a has an a⁻¹ with a * a⁻¹ = e
The four axioms
- Closure:
- Identity:
- Inverses:
- Associativity:
Not a group if
- Any one axiom fails
- e.g. under : has no inverse
Which axiom fails for under multiplication?
Cayley tables
In a group table every element appears exactly once in each row and column, and symmetry shows the group is abelian.
A Cayley table lists every product in a finite group.
- Closure holds if every entry is an element of the set.
- The identity is the element whose row and column repeat the headings.
- Inverses are found by locating the identity in each row.
In a group, every element appears exactly once in each row and each column, so a repeated entry means the set is not a group. Symmetry in the leading diagonal shows the group is abelian.
- 1
Closure
every entry is an element of the set
- 2
Identity
find the row and column that repeat the headings
- 3
Inverses
find the identity in each row
- 4
No repeats
each element appears once in every row and column
- 5
Symmetry
symmetric in the leading diagonal means abelian
| Column 0 | Column 1 | Column 2 | Column 3 | |
|---|---|---|---|---|
| Row 0 | 0 | 1 | 2 | 3 |
| Row 1 | 1 | 2 | 3 | 0 |
| Row 2 | 2 | 3 | 0 | 1 |
| Row 3 | 3 | 0 | 1 | 2 |
Column 0
- Row 0:
- 0
- Row 1:
- 1
- Row 2:
- 2
- Row 3:
- 3
Column 1
- Row 0:
- 1
- Row 1:
- 2
- Row 2:
- 3
- Row 3:
- 0
Column 2
- Row 0:
- 2
- Row 1:
- 3
- Row 2:
- 0
- Row 3:
- 1
Column 3
- Row 0:
- 3
- Row 1:
- 0
- Row 2:
- 1
- Row 3:
- 2
The table shows addition modulo . Each element appears exactly once in every row and column, and the table is symmetric about the leading diagonal, so this group is abelian.
A row of a Cayley table contains the entry twice. Could it be the table of a group?
The language of groups
The order of a group is its size; the order of an element is how many times you combine it to reach the identity.
The order of a group is the number of elements, .
The order (or period) of an element is the smallest positive with . The identity has order .
A subgroup is a subset that is itself a group under the same operation: it contains , is closed, and contains the inverse of each of its elements.
- The trivial subgroup is .
- A proper subgroup is not equal to .
- A non-trivial subgroup is not .
- 1
2¹ = 2
- 2
2² = 4
- 3
2³ = 8 ≡ 3
- 4
2⁴ = 16 ≡ 1
the identity e, so the order is 4
Then back to step 1
- Order of an element smallest with
In multiplication modulo , what is the order of the element ?
Cyclic and abelian groups
A cyclic group is generated by a single element; every cyclic group is abelian, but not the other way round.
A group is cyclic if one element , a generator, has every element as a power of it. A cyclic group of order has an element of order ; the integers modulo under addition are cyclic, generated by .
Every cyclic group is abelian, because powers of commute. The converse is false: under multiplication modulo is abelian, but every non-identity element has order , so it has no element of order and is not cyclic (the Klein four-group).
- 1
0
identity
- 2
1
0 + 1
- 3
2
1 + 1
- 4
3
2 + 1
- 5
4
3 + 1
- 6
5
4 + 1, then 5 + 1 ≡ 0
Then back to step 1
- Cyclic group
Worked example
Show that generates under multiplication modulo .
- 1
, , .
- 2
, , .
- 3
The six powers are all distinct.
Is under multiplication modulo cyclic?
Finite and infinite groups
Addition on the integers and reals, and multiplication modulo a prime, form groups; multiplication modulo a composite number does not.
Infinite groups include and . is not a group, since only have inverses.
Finite groups include for every , and for a prime .
With a composite modulus, such as modulo , closure fails (); the elements coprime to do form a group, e.g. modulo .
- 1
3¹ = 3
- 2
3² = 9 ≡ 2
- 3
3³ = 27 ≡ 6
- 4
3⁴ = 81 ≡ 4
- 5
3⁵ = 243 ≡ 5
- 6
3⁶ = 729 ≡ 1
back to the identity
Then back to step 1
| Group? | Reason | |
|---|---|---|
| Yes | Infinite group | |
| No | Only have inverses | |
| under mod 7 | Yes | Cyclic, generator 3 |
| under mod 6 | No | Closure fails: |
| under mod 12 | Yes | Elements coprime to 12 |
Group?
- :
- Yes
- :
- No
- under mod 7:
- Yes
- under mod 6:
- No
- under mod 12:
- Yes
Reason
- :
- Infinite group
- :
- Only have inverses
- under mod 7:
- Cyclic, generator 3
- under mod 6:
- Closure fails:
- under mod 12:
- Elements coprime to 12
Why is under multiplication modulo not a group?
Symmetry groups of polygons
The rotations and reflections of a regular -gon, under composition, form a group of order .
The symmetries of a regular -sided polygon form a symmetry group of order : rotations (including the identity) and reflections.
Let be the rotation through , so has order and the rotations form a cyclic subgroup. A reflection has order and .
For an equilateral triangle the order is ; for a square it is . For these groups are not abelian, since . Proper non-trivial subgroups include the rotations and for a reflection .
What is the order of the symmetry group of a square?
Try an exam question
The set forms a group under multiplication modulo . Show that is not cyclic.
[3 marks]
- [1], and (mod 8).
- [1]So every non-identity element has order .
- [1]A cyclic group of order needs an element of order , so is not cyclic.
That's the notes covered.
Carry on to the next subtopic.
Try a question
How many elements of are their own inverse?
1 mark, marked against the mark scheme
How many elements of are their own inverse?
1 mark, marked against the mark scheme