All revision notes topics

GroupsAQA A-Level Further Maths: Revision notes

Section 1

The group axioms

A group (G,∗)(G,*) is a set GG with a binary operation ∗* satisfying four axioms.

  1. Closure: a∗b∈Ga*b\in G for all a,b∈Ga,b\in G.
  2. Identity: there is e∈Ge\in G with a∗e=e∗a=aa*e=e*a=a for all aa.
  3. Inverses: for each aa there is a−1∈Ga^{-1}\in G with a∗a−1=a−1∗a=ea*a^{-1}=a^{-1}*a=e.
  4. Associativity: (a∗b)∗c=a∗(b∗c)(a*b)*c=a*(b*c) for all a,b,ca,b,c. To show a set is not a group, find one axiom that fails. Example: Z\mathbb{Z} under multiplication has closure, identity 11 and associativity, but 22 has no inverse in Z\mathbb{Z}. For a finite set, associativity of modular arithmetic is inherited from the integers, and may be quoted.
Key termsgroupclosureassociativity
Common mistake

Testing the axioms with one or two numerical examples. Closure and the inverse property must be shown for every element, so use a general element or a complete Cayley table.

Section 2

Cayley tables

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 in a row means the set is not a group. Symmetry in the leading diagonal (a∗b=b∗aa*b=b*a for all pairs) shows the group is abelian.

Key termsCayley tableabelian group
Exam tip

Check each row and column for repeats before checking anything else. A repeat means a missing inverse or a failure of the cancellation law.

Section 3

The language of groups

The order of a group is the number of elements, written ∣G∣|G|. The order (or period) of an element aa is the smallest positive integer nn with an=ea^n=e, where ana^n means a∗a∗⋯∗aa*a*\dots*a (nn copies). The identity has order 11. A subgroup of GG is a subset that is itself a group under the same operation: it contains ee, is closed, and contains the inverse of each of its elements (associativity is inherited). The trivial subgroup is {e}\{e\}; the proper subgroups are those not equal to GG; the non-trivial subgroups are those other than {e}\{e\}. So {e}\{e\} and GG are subgroups, but a proper non-trivial subgroup is neither of them.

Key termsorderperiodsubgroupproper subgrouptrivial subgroup
Common mistake

Saying the order of aa is the first nn for which ana^n is in the group. It is the first n>0n>0 for which an=ea^n=e.

Section 4

Cyclic and abelian groups

A group is cyclic if one element gg, a generator, has every element as a power of it: G=⟨g⟩={e,g,g2,… }G=\langle g\rangle=\{e,g,g^2,\dots\}. A cyclic group of order nn has an element of order nn. The integers modulo nn under addition, {0,1,…,n−1}\{0,1,\dots,n-1\}, form a cyclic group generated by 11. An abelian group has a∗b=b∗aa*b=b*a for all a,ba,b. Every cyclic group is abelian, because powers of gg commute. The converse is false: {1,5,7,11}\{1,5,7,11\} under multiplication modulo 1212 is abelian, with every non-identity element of order 22, so it has no element of order 44 and is not cyclic (it is the Klein four-group).

Key termscyclic groupgeneratorabelian

Section 5

Finite and infinite groups

Infinite groups include (Z,+)(\mathbb{Z},+) and (R,+)(\mathbb{R},+). (Z,×)(\mathbb{Z},\times) is not a group, since only ±1\pm1 have inverses. Finite groups include ({0,…,n−1},+n)(\{0,\dots,n-1\},+_n) for every nn, and ({1,…,p−1},×p)(\{1,\dots,p-1\},\times_p) for a prime pp, for example {1,2,3,4,5,6}\{1,2,3,4,5,6\} under multiplication modulo 77, which is cyclic with generator 33. With a composite modulus, such as {1,…,5}\{1,\dots,5\} under multiplication modulo 66, closure fails (2×3≡02\times3\equiv0) so it is not a group; the elements coprime to nn do form a group, e.g. {1,5,7,11}\{1,5,7,11\} modulo 1212.

Key termsfinite groupinfinite group

Section 6

Symmetry groups of regular polygons

The symmetries of a regular nn-sided polygon, under composition, form a group of order 2n2n: nn rotations (including the identity) and nn reflections. Let rr be the rotation through 360∘n\frac{360^\circ}{n}, so rr has order nn and the rotations form a cyclic subgroup {e,r,…,rn−1}\{e,r,\dots,r^{n-1}\}. If ss is a reflection then ss has order 22 and sr=r−1ssr=r^{-1}s. For an equilateral triangle the group has order 66; for a square it has order 88. For n≥3n\ge3 these groups are not abelian, because r≠r−1r\neq r^{-1} and so rs≠srrs\neq sr. Their proper non-trivial subgroups include the rotation subgroup and the subgroups {e,s}\{e,s\} generated by single reflections.

Key termssymmetry group
Exam tip

Describe symmetries by their effect: composing two reflections gives a rotation, and composing a rotation with a reflection gives a reflection.

That's the notes covered.

Carry on to the next subtopic.

Exam questions on Groups

  1. The set G={1,5,7,11}G=\{1,5,7,11\} under multiplication modulo 12.
    Determine whether GG is cyclic, justifying your answer.2 marks
  2. The set TT of symmetries of an equilateral triangle forms a group under composition: the identity, rotations through 120∘120^\circ and 240∘240^\circ about the centre, and reflections in the three lines of symmetry.
    Explain why TT is not abelian.2 marks
  3. The set G={0,1,2,3,4,5}G=\{0,1,2,3,4,5\} under addition modulo 6, written +6+_6.
    Given that GG is closed under +6+_6, show that (G,+6)(G,+_6) satisfies the other three group axioms.3 marks
See the full worksheet

Written by the Exaim team, led by Shaun Daswani (Head of Upper Secondary, Improve ME Institute; MSc Financial Mathematics, Imperial College London; BSc, UCL) and Jason Daswani (operational lead, Improve ME Institute; LSE).