1.1: Binary operations
( \newcommand{\kernel}{\mathrm{null}\,}\)
Binary operation
Definition: Binary operation
Let S be a non-empty set, and ⋆ said to be a binary operation on S, if a⋆b is defined for all a,b∈S. In other words, ⋆ is a rule for any two elements in the set S.
Example 1.1.1:
The following are binary operations on Z:
- The arithmetic operations, addition +, subtraction −, multiplication ×, and division ÷.
- Define an operation oplus on Z by a⊕b=ab+a+b,∀a,b∈Z.
- Define an operation ominus on Z by a⊖b=ab+a−b,∀a,b∈Z.
- Define an operation otimes on Z by a⊗b=(a+b)(a+b),∀a,b∈Z.
- Define an operation oslash on Z by a⊘b=(a+b)(a−b),∀a,b∈Z.
- Define an operation min on Z by a∨b=min{a,b},∀a,b∈Z.
- Define an operation max on Z by a∧b=max{a,b},∀a,b∈Z.
- Define an operation defect on Z by a∗3b=a+b−3,∀a,b∈Z.
Lets explore the binary operations, before we proceed:
Example 1.1.2:
- 2⊕3=(2)(3)+2+3=11.
- 2⊗3=(2+3)(2+3)=25.
- 2⊘3=(2+3)(2−3)=−5.
- 2⊖3=(2)(3)+2−3=5.
- 2∨3=2.
- 2∧3=3.
Exercise 1.1.2
- −2⊕3.
- −2⊗3.
- −2⊘3.
- −2⊖3.
- −2∨3.
- −2∧3.
- Answer
-
−5,1,−5,−2,3
Properties:
Closure property
Definition: Closure
Let S be a non-empty set. A binary operation ⋆ on S is said to be a closed binary operation on S, if a⋆b∈S,∀a,b∈S.
Below we shall give some examples of closed binary operations, that will be further explored in class.
Example 1.1.3: Closed binary operations
The following are closed binary operations on Z.
- The addition +, subtraction −, and multiplication ×.
- Define an operation oplus on Z by a⊕b=ab+a+b,∀a,b∈Z.
- Define an operation ominus on Z by a⊖b=ab+a−b,∀a,b∈Z.
- Define an operation otimes on Z by a⊗b=(a+b)(a+b),∀a,b∈Z.
- Define an operation oslash on Z by a⊘b=(a+b)(a−b),∀a,b∈Z.
- Define an operation min on Z by a∨b=min{a,b},∀a,b∈Z.
- Define an operation max on Z by a∧b=max{a,b},∀a,b∈Z.
- Define an operation defect on Z by a∗3b=a+b−3,∀a,b∈Z.
Exercise 1.1.1
Determine whether the operation ominus on Z+ is closed?
- Answer
-
The operation ominus on Z+ is closed.
Example 1.1.4: Counter Example
Division (÷ ) is not a closed binary operations on Z.
2,3∈Z but 23∉Z.
Summary of arithmetic operations and corresponding sets:
+ | × | − | ÷ | |
Z+ | closed | closed | not closed | not closed |
Z | closed | closed | closed | not closed |
Q | closed | closed | closed | closed (only when 0 is not included) |
R | closed | closed | closed | closed (only when 0 is not included) |
Associative property
Definition: Associative
Let S be a subset of Z. A binary operation ⋆ on S is said to be associative , if (a⋆b)⋆c=a⋆(b⋆c),∀a,b,c∈S.
We shall assume the fact that the addition (+) and the multiplication (×) are associative on Z+. (You don't need to prove them!).
Below is an example of proof when the statement is True.
Example 1.1.5: Associative
Determine whether the binary operation oplus is associative on Z.
We shall show that the binary operation oplus is associative on Z.
- Proof:
-
Let a,b,c∈Z. Then consider, (a⊕b)⊕c=(ab+a+b)⊕c=(ab+a+b)c+(ab+a+b)+c=(ab)c+ac+bc+ab+a+b+c.
On the other hand, a⊕(b⊕c)=a⊕(bc+b+c)=a(bc+b+c)+a+(bc+b+c)=a(bc)+ab+ac+a+bc+b+c.
Since multiplication is associative on Z, (a⊕b)⊕c=a⊕(b⊕c).
Thus, the binary operation oplus is associative on Z. ◻
Below is an example of how to disprove when a statement is False.
Example 1.1.6: Not Associative
Determine whether the binary operation subtraction (−) is associative on Z.
Answer: The binary operation subtraction (−) is not associative on Z.
- Counterexample:
-
Choose a=2,b=3,c=4, then (2−3)−4=−1−4=−5, but 2−(3−4)=2−(−1)=2+1=3.
Hence the binary operation subtraction (−) is not associative on Z.
Commutative property
Definition: Commutative property
Let S be a non-empty set. A binary operation ⋆ on S is said to be commutative, if a⋆b=b⋆a,∀a,b∈S.
We shall assume the fact that the addition (+) and the multiplication( ×) are commutative on Z+. (You don't need to prove them!).
Below is the proof of subtraction (−) NOT being commutative.
Example 1.1.7: NOT Commutative
Determine whether the binary operation subtraction − is commutative on Z.
- Counterexample:
-
Choose a=3 and b=4.
Then a−b=3−4=−1, and b−a=4−3=1.
Hence the binary operation subtraction − is not commutative on Z.
Example 1.1.8: Commutative
Determine whether the binary operation oplus is commutative on Z.
We shall show that the binary operation oplus is commutative on Z.
- Proof:
-
Let a,b∈Z.
Then consider, (a⊕b)=(ab+a+b).
On the other hand, (b⊕a)=ba+b+a.
Since multiplication is associative on Z, (a⊕b)=(b⊕a).
Thus, the binary operation oplus is commutative on Z. ◻
Identity
Definition: Identity
A non-empty set S with binary operation ⋆, is said to have an identity e∈S, if e⋆a=a⋆e=a,∀a∈S.
Note that 0 is called additive identity on (Z,+), and 1 is called multiplicative identity on (Z,×).
Example 1.1.9: Is identity unique?
Let S be a non-empty set and let ⋆ be a binary operation on S. If e1 and e2 are two identities in (S,⋆), then e1=e2.
Proof:
Suppose that e1 and e2 are two identities in (S,⋆).
Then e1=e1⋆e2=e2.
Hence identity is unique. ◻
Example 1.1.10: Identity
Does (Z,⊕) have an identity?
- Answer
-
Let e be the identity on (Z,⊕).
Then e⊕a=a⊕e=a,∀a∈Z.
Thus ea+e+a=a, and ae+a+e=a ∀a∈Z.
Since ea+e+a=a ∀a∈Z, ea+e=0⟹e(a+1)=0 ∀a∈Z.
Therefore e=0.
Now 0⊕a=a⊕0=a,∀a∈Z.
Hence 0 is the identity on (Z,⊕).
Example 1.1.11:
Does (Z,⊗) have an identity?
- Answer
-
Let e be the identity on (Z,⊗).
Then e⊗a=a⊗e=a,∀a∈Z.
Thus (e+a)(e+a)=(a+e)(a+e)=a,∀a∈Z.
Now, (a+e)(a+e)=a,∀a∈Z.
⟹a2+2ea+e2=a,∀a∈Z.
Choose a=0 then e=0.
If e=0 then a2=a,∀a∈Z.
This is a contradiction. Thus e=0 is not an identity. Hence e≠0.
Choose a=1. Then 2e+e2=0\implese(2+e)=0. Since e≠0, e=−2 This will not work for a=0.
For any other values of e will not work a=0.
Hence, (Z,⊗) has no identity.
Distributive Property
Definition: Distributive property
Let S be a non-empty set. Let ⋆1 and ⋆2 be two different binary operations on S.
Then ⋆1 is said to be distributive over ⋆2 on S if a⋆1(b⋆2c)=(a⋆1b)⋆2(a⋆1c),∀a,b,c,∈S.
Note that the multiplication distributes over the addition on Z. That is, 4(10+6)=(4)(10)+(4)(6)=40+24=64.
Further, we extend to (a+b)(c+d)=ac+ad+bc+bd (FOIL).
F-First
O-Outer
I-Inner
L-Last
This property is very useful to find (26)(27) as shown below:
Example 1.1.12: Find (26)(27)
20 | 6 | |
---|---|---|
20 | 400 | 120 |
7 | 140 | 42 |
Hence (26)(27)=400+120+140+42=702.
Let's play a game!
Example 1.1.13:
Does multiplication distribute over subtraction?
Example 1.1.14:
Does division distribute over addition?
- Answer
-
Counterexample:
Choose a=2,b=3, and c=4.
Then a÷(b+c)=2÷(3+4)
=2÷7.
=27.
and (a÷b)+(a÷c)=23+24.
=76.
Since 27≠76, the binary operation ÷ is not distributive over +.
Example 1.1.15:
Does ⊗ distribute over ⊕ on Z ?
- Answer
-
Counterexample:
Choose a=2,b=3, and c=4.
Then 2⊗(3⊕4)=2⊗[(3)(4)+3+4]
=2⊗19
=(2+19)(2+19)
=441
and (2⊗3)⊕(2⊗4)=[(2+3)(2+3)]⊕[(2+4)(2+4)]
=25⊕36
=(25)(36)+25+36
=961.
Since 441≠961, the binary operation ⊗ is not distributive over ⊕ on Z.
Summary
In this section, we have learned the following for a non-empty set S:
- Binary operation,
- Closure property,
- Associative property,
- Commutative property,
- Distributive property, and
- Identity.