Binary
Operation
1. Define what a binary operation is.
2. Perform a binary operation.
3. Show if the binary operation is closed,
commutative and associative and if there exist
its inverse and identity.
4. Explain and illustrates Cayley’s table.
PROPERTIES OF REAL NUMBER
Closure Property Associative Property
𝑎 + 𝑏 are element of R and 𝑎 + 𝑏 + 𝑐 = 𝑎 + (𝑏 + 𝑐) and
𝑎𝑏 are element of R 𝑎𝑏 𝑐 = 𝑎(𝑏𝑐)
Commutative Property Distributive Property
𝑎 + 𝑏 = 𝑏 + 𝑎 and 𝑎 𝑏 + 𝑐 = 𝑎𝑏 + 𝑎𝑐 or
𝑎𝑏 = 𝑏𝑎 𝑎 + 𝑏 𝑐 = 𝑎𝑐 + 𝑏𝑐
PROPERTIES OF REAL NUMBER
Identity Inverse
1
𝑎 + 0 = 𝑎 and 𝑎 1 = 𝑎 ; the 𝑎 = −𝑎 and 𝑎 = = 𝑎−1
𝑎
identity element of addition is 1
zero (0) while the identity 𝑎 + −𝑎 = 0 and 𝑎 =1;
𝑎
element under multiplication is so, the inverse of +a is –a in
one (1). addition while the inverse of a
is 1/a or a^-1 in multiplication.
Binary Operations
Let G be a non – empty set.
An operation * on G is said to be a binary
operation on G if for every pair of elements, a, b
is in G that is 𝑎, 𝑏 ∈ 𝐺; the product 𝑎*𝑏 ∈ 𝐺.
Note:
For each (𝑎, 𝑏) ∈ 𝐺 , we assign an element a * b of G.
In mathematics, a
binary operation on a set
is a calculation that
combines two elements of
the set (called operands)
to produce another
element of the set.
Illustration:
Tell whether the sample below is a binary
operation or not.
1) 𝐺 ∈ 𝑍 define a * b = a + b (usual addition on Z)
Solution:
Let a ∈ Z and b ∈ Z. If we add a and b, then the sum
a + b ∈ Z. Hence a * b = a + b is a binary operation.
Illustration:
Tell whether the sample below is a binary
operation or not.
2) 𝐺 ∈ 𝑍 define a * b = ab (usual multiplication on Z)
Solution:
Let a, b ∈ Z. Then the product of a and b, that is ab ∈
Z. Hence a * b = ab is a binary operation.
Illustration:
Tell whether the sample below is a binary
operation or not.
3) 𝐺 ∈ 𝑅 + define a * b = a + 17b
Solution:
Let a, b ∈ R+. If we take the sum of a + 17b ∈ R+.
Hence it is a binary operation.
Illustration:
Tell whether the sample below is a binary
operation or not.
4) 𝐺 ∈ 𝑍 + define * by a * b = a – b for all set 𝑎, 𝑏 ∈ 𝑍 + .
Solution:
If a > b = a – b > 0 ∈ Z+
If a < b = a – b < 0 ∉ Z+
Therefore, * is NOT a binary operation
Illustration:
Tell whether the sample below is a binary
operation or not.
5) 𝐺 ∈ 𝑅 define by a * b = 𝑎𝑏
Solution:
To be able to determine if the above statement is a binary or not, we need to
have a counter example.
If a = 0 and b = 0, then 𝑎𝑏 does not exist, hence it is not an element of R
If a = -4 and b = ½, then 𝑎𝑏 would be an element of a complex number C, so
𝑎𝑏 ∉ R
A binary operation * on the set R
is defined as
a * b = a + 2ab + b.
Evaluate:
(i) 3 * 2
(ii) 2 * 3
(iii) (2 * 3) * 4
(iv) 2 *(3 * 4)
Properties of
Binary Operations
Commutative Binary Operations
A binary operation * on a
set A is said to be commutative if
x*y=y*x
for all elements x and y of A.
1. Is b * a = a + ab + ab commutative
for all a, b ∈ R?
2. Consider the binary operation * on Q, the set
of rational numbers, defined by
a ∗ b = 𝑎2 + 𝑏 2 ∀ 𝑎, 𝑏 ∈ 𝑄.
Determine whether * is commutative.
3. Consider the binary operation * on N, the
set of natural numbers, defined by
a ∗ b = 𝑎 − 𝑏 ∀ 𝑎, 𝑏 ∈ 𝑁
Determine whether * is commutative.
Associative Binary Operations
A binary operation * on a set A is
said to be associative if
(x * y) * z = x * (y * z)
for all elements x, y and z of A.
Illustration:
𝑎𝑏
Consider the binary operation * on Q given by a*b= .
2
Tell whether the operation * is commutative or
associative.
𝑎𝑏
Given that a*b= . We need to show that a * b = b * a.
2
𝑏𝑎
In b*a= . But by commutative properties under multiplication,
2
𝑎𝑏
that is 𝑏𝑎 = 𝑎𝑏, then it follows that b*a= . Since a*b = b*a,
2
hence it is commutative.
Illustration:
𝑎𝑏
Consider the binary operation * on Q given by a*b=.
2
Tell whether the operation * is commutative or
associative.
Illustration:
Consider the binary operation * on R given by
a * b = 𝑎 + 𝑎𝑏 + 𝑏. Tell whether it is commutative
or associative.
For commutative:
a*b=b*a
a * b = 𝑎 + 𝑎𝑏 + 𝑏 b * a = 𝑎 + 𝑎𝑏 + 𝑏
b * a = 𝑏 + 𝑏𝑎 + 𝑎
Now, we could say that operation * is commutative.
For associative:
(a * b) * c = a * (b * c)
(a * b) * c = 𝑎 + 𝑎𝑏 + 𝑏 + 𝑎 + 𝑎𝑏 + 𝑏 𝑐 + 𝑐
𝑎 𝑎𝑏 𝑏
= 𝑎 + 𝑎𝑏 + 𝑏 + 𝑎𝑐 + 𝑎𝑏𝑐 + 𝑏𝑐 + 𝑐
= 𝒂 + 𝒃 + 𝒄 + 𝒂𝒃 + 𝒂𝒄 + 𝒃𝒄 + 𝒂𝒃𝒄
a * (b * c) = 𝑎 + (𝑎) 𝑏 + 𝑏𝑐 + 𝑐 + 𝑏 + 𝑏𝑐 + 𝑐
𝑎 𝑎𝑏 𝑏
= 𝑎 + 𝑎𝑏 + 𝑎𝑏𝑐 + 𝑎𝑐 + 𝑏 + 𝑏𝑐 + 𝑐
= 𝒂 + 𝒃 + 𝒄 + 𝒂𝒃 + 𝒂𝒄 + 𝒃𝒄 + 𝒂𝒃𝒄
Since (a*b)*c = a*(b*c), hence the operation * is associative.
Illustration:
Consider the binary operation * on Z+ given by
a * b = 𝑎 + 2𝑎𝑏 − 𝑏. Tell whether it is commutative
or associative.
For commutative:
a*b=b*a
a * b = 𝑎 + 2𝑎𝑏 − 𝑏 b * a = 𝑎 + 2𝑎𝑏 − 𝑏
b * a = 𝑏 + 2𝑏𝑎 − 𝑎
Now, we could say that operation * is NOT commutative.
For associative:
(a * b) * c = a * (b * c)
(a * b) * c = 𝑎 + 2𝑎𝑏 − 𝑏 + 2 𝑎 + 2𝑎𝑏 − 𝑏 𝑐 − 𝑐
𝑎 2𝑎𝑏 𝑏
= 𝑎 + 2𝑎𝑏 − 𝑏 + 2𝑎𝑐 + 4𝑎𝑏𝑐 − 2𝑏𝑐 − 𝑐
= 𝒂 − 𝒃 − 𝒄 + 𝟐𝒂𝒃 + 𝟐𝒂𝒄 − 𝟐𝒃𝒄 + 𝟒𝒂𝒃𝒄
a * (b * c) = 𝑎 + 2 𝑎 𝑏 + 2𝑏𝑐 − 𝑐 − 𝑏 + 2𝑏𝑐 − 𝑐
𝑎 2𝑎𝑏 𝑏
= 𝑎 + 2𝑎𝑏 + 4𝑎𝑏𝑐 − 2𝑎𝑐 − 𝑏 − 2𝑏𝑐 + 𝑐
= 𝒂 − 𝒃 + 𝒄 + 𝟐𝒂𝒃 − 𝟐𝒂𝒄 − 𝟐𝒃𝒄 + 𝟒𝒂𝒃𝒄
Since (a * b) * c ≠ a *(b * c), hence the operation * is not associative.
Illustration:
Consider the binary operation * on R given by
x * y = 𝑥 + 𝑦 − 3. Tell whether it is commutative or
associative.
For commutative:
x*y=y*x
𝑥+𝑦−3 =
? 𝑦+𝑥−3
Hence, * is commutative
For associative:
(x * y) * z = x * (y * z)
𝑥+𝑦−3 + 𝑧 −3 𝑥 + 𝑦+𝑧−3 −3
𝑥+𝑦−3+𝑧−3 𝑥+𝑦+𝑧−3−3
𝑥+𝑦+𝑧−6 = 𝑥+𝑦+𝑧−6
Therefore, * is associative.
Identity Element and
Inverse in
Binary Operation
Identity Element
An element 𝑒 ∈ 𝑆 is called an identity
element if for all 𝑎 ∈ 𝑆, we have
a e = a and e a = a
Right Identity Left Identity
Inverse Element
Let “e” be the identity element of S and 𝑎 ∈ 𝑆, then
𝑎−1 is called an inverse of the element “a” if
a * 𝑎−1 = e and 𝑎−1 * a = e.
If 𝑎 ∈ 𝑆, then the inverse of “a” is denoted by 𝑎−1 .
Here -1 is not an exponent of a.
Illustration:
If 𝐺 ∈ 𝑍 define a * b = 𝑎 + 𝑏 (usual
addition on Z), find the identity element. If
there is an identity element, find its inverse.
For identity:
a*e=a e*a=a
𝑎∗𝑏 =𝑎+𝑏 𝑎∗𝑏 =𝑎+𝑏
𝑎∗𝑒 =𝑎+𝑒 𝑒∗𝑎 =𝑒+𝑎
𝑎 =𝑎+𝑒 𝑎 =𝑒+𝑎
𝑒=0 𝑒=0
Hence, the identity element of a * b = a + b is e = 0.
For inverse:
a * 𝑎−1 = e 𝑎−1 * a = e
𝑎∗𝑏 =𝑎+𝑏 𝑎∗𝑏 =𝑎+𝑏
𝑎 ∗ 𝑎−1 = 𝑎 + 𝑎−1 𝑎−1 ∗ 𝑎 = 𝑎−1 + 𝑎
𝑎 + 𝑎−1 = 0 𝑎−1 + 𝑎 = 0
𝑎−1 = −𝑎 𝑎−1 = −𝑎
So, the inverse exist.
Illustration:
If G Z define a * b = ab (usual multiplication
on Z), find its identity element if possible. If there
is an identity, find its inverse.
For identity:
a*e=a e*a=a
𝑎 ∗ 𝑒 = 𝑎𝑒 𝑒 ∗ 𝑎 = 𝑒𝑎
𝑎 = 𝑎𝑒 𝑎 = 𝑒𝑎
𝑒=1 𝑒=1
Since 𝒆 = 𝟏 ∈ 𝒁, then this unique element is the identity
element of a * b = ab
For inverse:
a * 𝑎−1 = e 𝑎−1 * a = e
𝑎 ∗ 𝑏 = 𝑎𝑏 𝑎 ∗ 𝑏 = 𝑎𝑏
𝑎 ∗ 𝑎−1 = 𝑎𝑎−1 𝑎−1 ∗ 𝑎 = 𝑎−1 𝑎
𝑎𝑎−1 = 1 𝑎−1 𝑎 = 1
−1
1 −1
1
𝑎 = 𝑎 =
𝑎 𝑎
If a = 0, there is no inverse. But if a > 0 or a < 0, the
inverse exist.
Illustration:
If G R define a * b = 𝑎2 + 𝑏 2 , find its
identity element if possible.
Solution.
We need to show that a * e = a and e * a
= a for a * b = a2 + b2. Now, for a * e = a, it follows
that a2 + e2 = a. Simplifying; e2 = a – a2 and e =
± 𝑎 − 𝑎2 . Now, if a = 2 R, we got e = ± −2
which is not an element of R. Hence, there is NO
identity element for a * b = a2 + b2 .
Since, the identity doesn’t exist, there is no
inverse.
Illustration:
What is the identity element for the binary
operation * defined on set R of all real numbers by the
𝑎𝑏
rule a * b = for all a, b element in R. If there is an
2
identity, find its inverse.
For identity:
a*e=a e*a=a
𝑎𝑒 𝑒𝑎
𝑎∗𝑒 = 𝑒∗𝑎 =
2 2
𝑎𝑒 𝑒𝑎
𝑎= 𝑎=
2 2
2𝑎 = 𝑎𝑒 2𝑎 = 𝑒𝑎
𝑒=2 𝑒=2
Hence, the identity element e is 2.
For inverse:
a * 𝑎−1 = e 𝑎−1 * a = e
𝑎𝑏 𝑎𝑏
𝑎∗𝑏 = 𝑎∗𝑏 =
2 2
𝑎𝑎 −1 −1 𝑎
𝑎
𝑎 ∗ 𝑎−1 = 𝑎−1 ∗ 𝑎 =
2 2
𝑎𝑎−1 𝑎−1 𝑎
=2 =2
2 2
𝑎𝑎−1 = 4 𝑎−1 𝑎 = 4
−1
4 −1
4
𝑎 = 𝑎 =
𝑎 𝑎
The inverse exist if 𝒙 ≠ 𝟎
Closed under Operation
A set is “closed” under operation if the
operation assigns to every ordered pair of
elements from the set an element of the set.
A set R is said to be closed with respect to a
binary operation * if for any two elements a, b
R, a * b produces an element which belongs to
R. That is, a * b R for all a, b R.
Illustration:
Is N = { 1, 2, 3, …} is closed
under usual addition?
Hence, N is closed under addition.
Illustration:
Is S = { ±1, ±3, ±5, ±7, …} is
closed under usual addition?
Hence, S is not closed under addition.
CAYLEY’S
TABLE
A (binary) operation on a finite set can be
represented by a table. This is a square grid with one
row and one column for each element in the set. The
grid is filled in so that the element in the row belonging
to x and the column belonging to y is x * y.
A binary operation on a finite set (a set
with a limited number of elements) is often displayed in
a table that demonstrates how the operation is
performed.
Example
Consider the binary operation * on the set
{1, 2, 3, 4, 5} defined by a * b = min {a, b}.
Write the operation table of the operation *.