Binary operations and their properties

Binary operations and their properties

Spec DG1–DG4 · AQA A-Level Further Maths: Revision notes

Studying this course? Keep your progress in one place.

Key facts

  • A binary operation ∗\ast combines two elements; it is closed if the result is always in the set.
  • To prove a property use general a,b,ca,b,c; to disprove it one counter-example is enough.
  • Commutative: a∗b=b∗aa\ast b=b\ast a for all a,ba,b.
  • Associative: (a∗b)∗c=a∗(b∗c)(a\ast b)\ast c=a\ast(b\ast c) for all a,b,ca,b,c; expand both sides.
  • In a Cayley table the row element is first and the column element second; a table symmetric in the leading diagonal is commutative.

Binary operations and closure

A binary operation combines two elements of a set into one, and the set is closed if the result is always in the set.

A binary operation ∗\ast on a set SS combines any two elements aa and bb to give a∗ba\ast b. It is closed on SS if a∗ba\ast b is always in SS.

Examples: addition on the integers, a∗b=2a+3ba\ast b=2a+3b on the reals, and multiplication of 2×22\times2 matrices. Order matters: a∗ba\ast b means aa first, then bb.

Bracket negative numbers when substituting, for example a+b−aba+b-ab with b=−1b=-1.

  1. 1

    Take any a and b in the set S

  2. 2

    Work out a ∗ b

  3. 3

    Is the result always in S?

    if yes, S is closed; one result outside S shows it is not

Testing whether a set is closed under an operation

To show closed

  • Take general a,b∈Sa,b\in S
  • Show a∗b∈Sa\ast b\in S

To show not closed

  • Give one pair with result outside SS
  • e.g. 2−5=−32-5=-3 on the natural numbers

Worked example

For a∗b=a+b−aba\ast b=a+b-ab, find 3∗(−1)3\ast(-1).

Is subtraction a closed operation on the natural numbers {1,2,3,… }\{1,2,3,\dots\}?

Modular arithmetic and matrices

Add or multiply as usual, then take the remainder; matrices multiply as usual, and closure needs checking for smaller sets.

On {0,1,…,n−1}\{0,1,\dots,n-1\}, addition modulo nn (⊕\oplus) and multiplication modulo nn (⊗\otimes) are binary operations: add or multiply as usual, then take the remainder on division by nn.

For example, 4⊗5=20≡2(mod6)4\otimes5=20\equiv2\pmod6 and 4⊕5=9≡3(mod6)4\oplus5=9\equiv3\pmod6.

Multiplication of 2×22\times2 matrices is a binary operation on the set of all 2×22\times2 matrices. For a smaller set, check closure by multiplying general members.

012345
Numbers modulo 6 on a clock face: 4 ⊕ 5 = 9, which is 3 after taking the remainder on division by 6
  • x⊗yx\otimes yremainder of xyxy on division by nn
  • x⊕yx\oplus yremainder of x+yx+y on division by nn

Worked example

Is the set of matrices (1a01)\begin{pmatrix} 1 & a \\ 0 & 1 \end{pmatrix} closed under matrix multiplication?

What is 3⊗43\otimes4 modulo 6?

Commutativity

An operation is commutative if swapping the two elements never changes the result.

To prove ∗\ast is commutative, take general aa and bb and show the two expressions are equal, using known laws. Example: a+b−ab=b+a−baa+b-ab=b+a-ba because addition and multiplication of reals are commutative.

To disprove it, one counter-example is enough. For a∗b=2a+3ba\ast b=2a+3b: 1∗2=81\ast2=8 but 2∗1=72\ast1=7.

Matrix multiplication is not commutative in general, though it may be on a special set, such as the matrices (1a01)\begin{pmatrix} 1 & a \\ 0 & 1 \end{pmatrix}.

024681 ∗ 22 ∗ 1CalculationResult
For a ∗ b = 2a + 3b the order matters: 1 ∗ 2 = 8 but 2 ∗ 1 = 7, so ∗ is not commutative
  • Commutativea∗b=b∗aa\ast b=b\ast a for all a,ba,b

To prove

  • Use general aa and bb
  • Show both orders give the same expression

To disprove

  • Use unequal values, such as 1 and 2
  • Show a∗b≠b∗aa\ast b\ne b\ast a

Is a∗b=2a+3ba\ast b=2a+3b commutative?

Associativity

An operation is associative if the bracketing never matters, so a∗b∗ca\ast b\ast c is unambiguous.

To prove ∗\ast is associative, expand both (a∗b)∗c(a\ast b)\ast c and a∗(b∗c)a\ast(b\ast c) separately and show they simplify to the same expression. To disprove it, give one counter-example.

Addition and multiplication of integers, modular addition and multiplication, and matrix multiplication are all associative.

To disprove for a∗b=2a+3ba\ast b=2a+3b: (1∗1)∗1=5∗1=13(1\ast1)\ast1=5\ast1=13 but 1∗(1∗1)=1∗5=171\ast(1\ast1)=1\ast5=17.

  1. 1

    Expand (a ∗ b) ∗ c

  2. 2

    Expand a ∗ (b ∗ c)

  3. 3

    Simplify both

    if they are always equal, ∗ is associative

Proving that an operation is associative
  • Associative(a∗b)∗c=a∗(b∗c)(a\ast b)\ast c=a\ast(b\ast c) for all a,b,ca,b,c

Worked example

Show that a∗b=a+b−aba\ast b=a+b-ab is associative.

For a∗b=2a+3ba\ast b=2a+3b, which shows it is not associative?

Cayley tables

A Cayley table lists every product of a finite set; check closure and symmetry directly from it.

A Cayley table lists every product a∘ba\circ b of a finite set: the element on the left (row) is first and the element along the top (column) is second.

The table shown is a∘b=ab mod 5a\circ b=ab\bmod5 on {1,2,3,4}\{1,2,3,4\}.

  • Closed: every entry is an element of the set.
  • Commutative: the table is symmetric about the leading diagonal (top left to bottom right).
  • Associativity is not easy to read from the table, so prove it separately.
  1. 1

    Closed

    every entry is an element of the set

  2. 2

    Commutative

    the table is symmetric about the leading diagonal

  3. 3

    Identity

    the row and column that repeat the headings

Reading a Cayley table (here a ∘ b = ab mod 5 on {1, 2, 3, 4})

Column 1

Row 1:
1
Row 2:
2
Row 3:
3
Row 4:
4

Column 2

Row 1:
2
Row 2:
4
Row 3:
1
Row 4:
3

Column 3

Row 1:
3
Row 2:
1
Row 3:
4
Row 4:
2

Column 4

Row 1:
4
Row 2:
3
Row 3:
2
Row 4:
1

In the table above, what is 3∘43\circ4 (row 3, column 4)?

Try an exam question

A binary operation ∗\ast is defined on the real numbers by a∗b=2a+ba\ast b=2a+b. Find 3∗43\ast4, and show that ∗\ast is not associative.

[4 marks]

That's the notes covered.

Carry on to the next subtopic.

Try a question

Find 4∗(−1)4\ast(-1).

1 mark, marked against the mark scheme

Revision notes