Group axioms and examples

Group axioms and examples

Spec 1.1–2 · Edexcel A-Level Further Maths: Revision notes

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 a∗b=b∗aa*b=b*a for all a,ba,b; the axioms do not require it.
  • A cyclic group is generated by one element gg; a generator must produce every element before returning to ee.

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 SS combines any two elements of SS to give one element.

SS is closed under ∗* if a∗b∈Sa*b\in S for all a,b∈Sa,b\in S. To show a set is not closed, find a single pair whose result leaves the set.

For example, {1,2,3,4,5}\{1,2,3,4,5\} under multiplication modulo 6 is not closed, because 2×3≡02\times3\equiv0 and 00 is not in the set.

  1. 1

    Pick two elements

    any pair in the set, including the same one twice

  2. 2

    Combine them

    using the operation

  3. 3

    Check the result

    is it in the set?

  4. 4

    One failure is enough

    2 × 3 ≡ 0 (mod 6), and 0 is not in {1, …, 5}

Testing closure

Closed

  • Integers under addition
  • {1,3,5,7}\{1,3,5,7\} under ×\times mod 8

Not closed

  • {1,…,5}\{1,\ldots,5\} under ×\times mod 6 (2×3≡02\times3\equiv0)
  • Positive integers under subtraction (1−2=−11-2=-1)

Is {1,2,3,4,5}\{1,2,3,4,5\} 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 GG with a binary operation ∗* is a group if:

  1. Closure: a∗b∈Ga*b\in G for all a,b∈Ga,b\in G.
  2. Associativity: (a∗b)∗c=a∗(b∗c)(a*b)*c=a*(b*c).
  3. Identity: some e∈Ge\in G has a∗e=e∗a=aa*e=e*a=a for all aa.
  4. Inverses: each a∈Ga\in G has a−1∈Ga^{-1}\in G with a∗a−1=a−1∗a=ea*a^{-1}=a^{-1}*a=e.

The identity is unique and each element has exactly one inverse. If also a∗b=b∗aa*b=b*a for all a,ba,b, the group is abelian.

  1. 1

    Closure

    every product stays in the set

  2. 2

    Associativity

    quote it for matrices and functions

  3. 3

    Identity

    find e in the set

  4. 4

    Inverses

    every element has one in the set

Checking whether a set is a group.

Why are the positive integers under addition not a group?

Standard examples of groups

Integers modulo nn under addition, non-zero residues modulo a prime under multiplication, non-singular matrices, symmetries and permutations are all groups.

  • Integers modulo nn under addition, {0,…,n−1}\{0,\ldots,n-1\}: identity 00, inverse of aa is n−an-a.
  • Multiplication modulo nn: {1,…,n−1}\{1,\ldots,n-1\} is a group when nn is prime, e.g. {1,…,6}\{1,\ldots,6\} mod 7. Every element must be invertible: {1,3,5,7}\{1,3,5,7\} mod 8 is a group, but {1,…,5}\{1,\ldots,5\} mod 6 is not closed.
  • Non-singular matrices (2×22\times2, 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 {1,2,3}\{1,2,3\} under composition: order 6.
  1. 1

    Closure

    combining two elements stays in the set

  2. 2

    Identity

    an element that changes nothing

  3. 3

    Inverses

    every element has one

  4. 4

    Associativity

    bracketing does not matter

Checking the group axioms

Mod nn, ++

Identity:
00
Inverse of a:
n−an-a

Mod prime pp, ×\times

Identity:
11
Inverse of a:
a−1a^{-1} mod pp

Matrices, ×\times

Identity:
II
Inverse of a:
A−1A^{-1}

In the integers modulo 9 under addition, what is the inverse of 44?

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 a∗ba*b 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 {1,3,5,7}\{1,3,5,7\} mod 8, 11 runs down the leading diagonal, since every element is its own inverse.

  1. 1

    Closure

    every entry is in the set

  2. 2

    Identity

    its row and column repeat the headings

  3. 3

    Inverses

    the identity appears in every row

  4. 4

    Abelian

    the table is symmetric about the leading diagonal

Reading a Cayley table

× 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 gg, called a generator: G={e,g,g2,…}G=\{e,g,g^2,\ldots\}. In additive notation the elements are g,2g,3g,…g,2g,3g,\ldots.

{0,1,2,3,4,5}\{0,1,2,3,4,5\} under addition modulo 6 is generated by 11 (and by 55) but not by 22, which produces only 0,2,40,2,4.

{1,…,6}\{1,\ldots,6\} under multiplication modulo 7 is generated by 33. The group {1,3,5,7}\{1,3,5,7\} mod 8 is not cyclic, because every element squares to the identity.

  1. 1

    31=33^1=3

    first power

  2. 2

    32=9≡23^2=9\equiv2

    second power

  3. 3

    33≡63^3\equiv6

    third power

  4. 4

    34≡43^4\equiv4

    fourth power

  5. 5

    35≡53^5\equiv5

    fifth power

  6. 6

    36≡13^6\equiv1

    the identity, after all six elements

Powers of 3 modulo 7 reach every element.

Is {1,3,5,7}\{1,3,5,7\} under multiplication mod 8 cyclic?

Try an exam question

The set S={1,3,5,7}S=\{1,3,5,7\} with multiplication modulo 8. Show that SS is a group, and state, with a reason, whether it is cyclic.

[5 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

What is the inverse of 55 in GG?

1 mark, marked against the mark scheme

Revision notes