Binary Operations
Senior 4 · Mathematics
Binary Operations
Lesson 1 of 4
25 min
A journey starts at 9 o'clock and lasts 5 hours. On a 12-hour clock it ends at 2 o'clock, so on the clock "9 plus 5 is 2". This addition takes two hours from the set and always returns an hour from the same set: you can never "fall off" the clock face. Ordinary addition of whole numbers, subtraction of integers, the union of two sets and the clock's addition all share this pattern: two elements go in, one element of the same set comes out. Such a rule is called a binary operation, and this unit studies the structures it creates.
Definition
Binary operation: a binary operation on a non-empty set is a rule that assigns to every ordered pair of elements of exactly one element of . In other words, it is a mapping , .
Closure: is closed under an operation when for all . An operation is a binary operation on exactly when it is defined for every pair and is closed under it.
Notation: symbols such as are used; means "the set with the operation ".
Example: is a binary operation on ; subtraction is not, because .
The same rule can be a binary operation on one set and fail on another. (Here means the non-zero rational numbers and the positive real numbers.)
| Rule | Set | Binary operation? | Reason |
|---|---|---|---|
| No | |||
| Yes | the difference of two integers is an integer | ||
| No | , and is undefined | ||
| Yes | the quotient of two non-zero rationals is a non-zero rational | ||
| No | |||
| Yes | , so is a positive real | ||
| , | subsets of a set | Yes | a union or intersection of subsets of is a subset of |
Warning
Two ways to fail. A rule is not a binary operation on if it ever gives an answer outside (not closed) or if it is undefined for some pair (such as ). To prove that a rule fails, one counterexample is enough. To prove that it works, you need an argument for all and , written with letters.
Worked example 1: is it a binary operation?
Decide, with reasons: (a) on (b) on (c) on the set of odd integers (d) on .
Solution
Worked example 2: calculating with a new operation
On , define . Find , , and .
Solution Replace by the left element and by the right one.
Two observations: the order of and matters (), and so does the position of the brackets (). The first property is studied now; the second in the next lesson.
Definition
Commutative operation: a binary operation on is commutative if
Examples: addition and multiplication of real numbers, and are commutative. Subtraction and division are not: .
Worked example 3: proving and disproving commutativity
Which of these operations on are commutative? (a) (b) (c) , the larger of and .
Solution
On a small finite set, an operation can be listed in full in an operation table (also called a Cayley table). The entry in row and column is . Take with the remainder when is divided by 8. For instance and :
| 1 | 3 | 5 | 7 | |
|---|---|---|---|---|
| 1 | 1 | 3 | 5 | 7 |
| 3 | 3 | 1 | 7 | 5 |
| 5 | 5 | 7 | 1 | 3 |
| 7 | 7 | 5 | 3 | 1 |
Two properties can be read straight from a table:
Tip
To test a table for commutativity, fold it in your mind along the leading diagonal: every entry must land on an equal entry. One mismatch is a counterexample.
Gopius E-Learning: Introduction to Binary Operation and Properties. Watch for the definition of a binary operation and how closure and commutativity are tested on given operations; associativity and distributivity come in the next lesson.
Practice
Justify every answer: a proof with letters, or a counterexample.
Key points
Sources and credits
Quick check
Which of these is NOT a binary operation on ℕ = {0, 1, 2, …}?