RIZAL TECHNOLOGICAL UNIVERSITY

Cities of Mandaluyong and Pasig

MODULE NO. 2D
Mathematics in the Modern World
Title : Binary Operations

Definition of Binary Operation

Properties of Binary Operation
Closure Property
Associative Property
Commutative Property
Identity Property
Distributive Property

Overview

The word "binary" means composed of two pieces. A binary operation is simply
a rule for combining two values to create a new value. The most widely known
binary operations are those learned in elementary school: addition, subtraction,
multiplication and division on various sets of numbers.

A binary operation on a set is a calculation involving two elements of the set to

produce another element of the set.

Learning Outcomes

At the end of this module the student will be able to :

1. Learned the following for a non-empty set S: Binary Operation, Closure property,
Associative Property, Commutative property, Distributive Property and Identity.

Topic Presentation

Binary operation

Definition:
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
 RIZAL TECHNOLOGICAL UNIVERSITY
Cities of Mandaluyong and Pasig

The following are binary operations on Z:

1. The arithmetic operations, addition + , subtraction −, multiplication × , and division ÷.
2. Define an operation oplus on Z by a⊕b = ab + a + b, ∀ a,b ∈ Z.
𝑎. 2 ⨁ 3 = (2)(3) + 2 + 3 = 𝟏𝟏
𝑏. −2 ⨁ 3 = (−2)(3) + (−2) + 3 = −𝟓

3. Define an operation ominus on Z by a⊖b = ab + a − b, ∀ a,b ∈ Z.

𝑎. 2 ⊝ 3 = (2) (3) + 2 − 3 = 𝟓
𝑏. −2 ⊝ 3 = (−2)(3) + (−2) − 3 = −𝟏𝟏

4. Define an operation otimes on Z by a⊗b = (a+b)(a+b),∀ a,b ∈ Z.

𝑎. 2 ⊗ 3 = (2 + 3)(2 + 3) = 𝟐𝟓
𝑏. −2 ⊗ 3 = [(−2) + 3][(−2) + 3] = 𝟏

5. Define an operation oslash on Z by a⊘b = (a+b)(a−b),∀ a,b ∈ Z.

𝑎. 2 ⊘ 3 = (2 + 3)(2 − 3) = −𝟓
𝑏. −2 ⊘ 3 = (−2 + 3)(−2 − 3) = −𝟓

6. Define an operation min on Z by a ∨ b = min{a,b},∀ a,b ∈ Z.

𝑎. 2 ∨ 3 = 2
𝑏. −2 ∨ 3 = −2

7. Define an operation max on Z by a ∧ b = max{a,b},∀ a,b ∈ Z.

𝑎. 2 ∧ 3 = 3
𝑏. −2 ∧ 3 = 3

8. Define an operation defect on Z by a∗3b = a+b −3,∀ a,b ∈ Z.

“supplementary discussion on Binary operation “

https://youtu.be/71y3snoLSGc

Properties of Binary Operations

 Closure property
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.

Example: Closed binary operations

The following are closed binary operations on Z.

1. The addition + , subtraction −, and multiplication ×.
2. Define an operation oplus on Z by a⊕b = ab + a + b,∀ a,b ∈ Z
3. Define an operation ominus on Z by a⊖b = ab + a − b,∀ a,b ∈ Z
 RIZAL TECHNOLOGICAL UNIVERSITY
Cities of Mandaluyong and Pasig

4. Define an operation otimes on Z by a⊗b = (a+b)(a+b),∀ a,b ∈ Z

5. Define an operation oslash on Z by a⊘b = (a+b)(a−b),∀ a,b ∈Z
6. Define an operation min on Z by a∨b = min{a,b},∀ a,b ∈ Z
7. Define an operation max on Z by a∧b = max{a,b},∀ a,b ∈ Z
8. Define an operation defect on Z by a∗3b = a+ b −3,∀ a,b ∈ Z
Summary of arithmetic operations and corresponding sets:

“supplementary discussion on Closure”

https://youtu.be/jKoMerdR2Ig

 Associative property
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 : 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 : Not Associative
Determine whether the binary operation subtraction (−) is associative on Z.
Answer: The binary operation subtraction (−) is not associative on Z.
Counter Example:
 RIZAL TECHNOLOGICAL UNIVERSITY
Cities of Mandaluyong and Pasig

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.

“supplementary discussion on Associative”

https://youtu.be/ycdCqpS8_SA

 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 : NOT Commutative
Determine whether the binary operation subtraction −− is commutative on Z.

Counter Example:
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 : 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.

“ supplementary discussion in Commutative)

https://youtu.be/lxRYOUq7qT4

 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: Is identity unique?

 RIZAL TECHNOLOGICAL UNIVERSITY
Cities of Mandaluyong and Pasig

Let S be a non-empty set and let ⋆ be a binary operation on S. If 𝑒1 and 𝑒2 are two identities in (S,⋆) ,
then 𝑒1 = 𝑒2
Proof:
Suppose that 𝑒1 and 𝑒2 are two identities in .
Then 𝑒1 = 𝑒1 ⋆ 𝑒2 = 𝑒2
Hence identity is unique.

Example : 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 0is the identity on (Z,⊕)

Example :
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.
⟹ 𝑎2 + 2𝑒𝑎 + 𝑒 2 = 𝑎,∀a ∈ Z.
Choose a = 0 then e = 0
If e = 0 then 𝑎 2 = a,∀ a ∈ Z.
This is a contradiction.
Hence, (Z,⊗) has no identity.

“supplementary discussion on Identity “

https://youtu.be/-CfoWmZw6EA

 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⋆2 c)=( a ⋆1 b) ⋆2 (𝑎 ⋆1 c),∀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

This property is very useful to find (26)(27) as shown below:

 RIZAL TECHNOLOGICAL UNIVERSITY
Cities of Mandaluyong and Pasig

Hence (26)(27)=400 + 120 + 140 + 42 = 702

Example :
Does division distribute over addition ?
Answer:
Counter Example:
Choose a = 2, b = 3, c = 4.
Then a ÷(b + c) = 2÷(3+4)
= 2 ÷ 7.
2
=
7
and (a ÷ b) + (a ÷ c) =3 + 4
2 2

7
= 6
.
, the binary operation ÷ is not distributive over +.
2 7
Since ≠
7 6

Example :
Does ⊗ distribute over ⊕ on Z ?
Answer:
Counter Example:
Choose a = 2, b = 3, 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.

“supplementary discussion on Distributive”

https://youtu.be/PhmxWMl97bA
RIZAL TECHNOLOGICAL UNIVERSITY
Cities of Mandaluyong and Pasig