1.

6 BINARY OPERATIONS

Definition 1 ( Binary Operations)

Let S be a nonempty set. A binary operation on S is a function from

S x S into S. Let * be a binary operation on S. For each a, b  S, we
denote,
the element *((a,b)) of S by (a * b).

An operation is
called Binary
Operation on S if:

Exactly one element is For each ordered pair of

assigned to each possible element of S, the element
ordered pair of elements of S. assigned to it is again in S.

SMA3033 CHAPTER 1 SEM 2 2017/2018 1

 1.6 BINARY OPERATIONS (Cont.)

Example 9

On Z, with operation multiplication ( . ).

Note that,
- 12 is assigned to (2, - 6)
3 is assigned to (3, 1)
-36 is assigned to (-6, 6) etc.
Hence, condition 1 satisfied.

Also, for each ordered pair of elements of Z, the element assigned to

it is again in Z.
(as in condition 1)
Hence, condition 2 satisfied.

Then, multiplication is a binary operation on Z.

SMA3033 CHAPTER 1 SEM 2 2017/2018 2

 1.6 BINARY OPERATIONS (Cont.)

Note : Since Z with operation multiplication satisfies Condition 2,

we say Z is closed under multiplication .

Definition 2 (Closed Under)

Let * be a binary operation on S and let H be a subset of S.

The subset H is closed under * if for all a, b H, a*b H.

Example 10

On N, with operation substraction –

Note that, 2 , 7  N but 2 – 7 = – 5N.
Then, condition 2 not satisfied.
 – is not a binary operation on N.

SMA3033 CHAPTER 1 SEM 2 2017/2018 3

 1.6 BINARY OPERATIONS (Cont.)

Example 11

On Q, let a*b = a/b .

Here, 2, 0  Q, but 2*0 = 2/0 (no element).
Then, no rational number assigned by this rule to the pair (2, 0).
 Condition 1 is not satisfied.
 Then, * is not a binary operation. There is an
ordered pair
for which
Note: the element
Referring to example 10, Condition 2 is not satisfied. assigned to,
Then, N is not closed under – . it is not in N

Referring to example 11, Condition 1 is not satisfied.

No rational
Then, * is not defined on Q.
number is
assigned by this
rule to (2,0)
SMA3033 CHAPTER 1 SEM 2 2017/2018 4
 1.6 BINARY OPERATIONS (Cont.)

Example 12

On Z+, define * by (a * b) equals the smaller of a & b or the common

value if a = b.
Thus,
2 * 11 = 2
15 * 10 = 10
3*3=3
Both conditions 1 & 2 satisfied. Then * is a binary operation.

Example 13

On Z+, operation # defined by a # b = ( a*b) + 2 where * is defined

as in example 12. Here, # is a binary operation.
Eg. 4 # 7 = (4 * 7) + 2 = 4 + 2 = 6 Z+.
SMA3033 CHAPTER 1 SEM 2 2017/2018 5
 1.6 BINARY OPERATIONS (Cont.)

Example 14

1. On Z+, define * by a*b = ab. Determine whether * is a binary

operation on Z+.

2. On Z+ , define * by a*b = c, where c is at least 5 more than a+b.

Determine whether * is a binary operation on Z+.

Definition 3 (Commutative operation)

A binary operation * on a set S is commutative if a * b = b * a for

all a, b in S.

SMA3033 CHAPTER 1 SEM 2 2017/2018 6

 1.6 BINARY OPERATIONS (Cont.)

Example 15

On Q, define a binary operation  by a  b = ab + 1. Show that the

binary operation  is commutative on Q.

Solution:

Let a, b be any two elements in Q.

(To show that a  b = b  a )

LHS : a  b = ab + 1
= ba + 1 Because multiplication is commutative on Q.
= b  a : RHS

Then,  is commutative on Q.
SMA3033 CHAPTER 1 SEM 2 2017/2018 7
 1.6 BINARY OPERATIONS (Cont.)

Example 16

On Z, define a * b = a – b . Determine whether * is commutative on

Z.

Solution :

Let a, b  Z.
(To check whether a * b = b * a )
Note that,
by using counterexample
Let 1, 2 in Z.
LHS : 1 – 2 = -1
but, RHS : 2 – 1 = 1
Since LHS  RHS , then * is not commutative on Z.

SMA3033 CHAPTER 1 SEM 2 2017/2018 8

 1.6 BINARY OPERATIONS (Cont.)

Exercise:

1. On Q, define  by a  b = (ab)/ 2. Prove that  is commutative on Q .

2. On Z+, define * by a * b = 2ab. Prove that * is commutative on Z+

SMA3033 CHAPTER 1 SEM 2 2017/2018 9

 1.6 BINARY OPERATIONS (Cont.)

Definition 4 ( Associative Operation)

A binary operation * on a set S is associative if (a * b) * c = a * (b * c)

for all a, b, c in S.

Example 17

On Q, define  by a  b = (ab)/ 2. Determine whether  is

associative on Q .

Solution:

Let a, b, c be elements in Q.
(To check whether (a  b)  c = a  (b  c ) )

SMA3033 CHAPTER 1 SEM 2 2017/2018 10

 1.6 BINARY OPERATIONS (Cont.)

(Cont.)

LHS : (a  b)  c
= ((ab)/2 )  c
= (((ab)/2 ) c ) / 2
= (ab)c / 4
= a (bc) / 4 Since multiplication is associative on Q
= ( a ( (bc) / 2 ) ) / 2
= a  ((bc) / 2 )
= a  (b  c) : RHS

Then,  is associative on Q.

SMA3033 CHAPTER 1 SEM 2 2017/2018 11

 1.6 BINARY OPERATIONS (Cont.)

Example 18

On Z+, define * by a * b = 2ab. Determine whether * is associative

on Z+ .

Solution:

Let a, b, c in Z+.
(To check whether (a * b)* c = a * (b * c) ).

Try!

Exercise:

Determine whether < Q+, * > , where * is defined by a * b = ( a + b) / 2

is associative on Q+.
SMA3033 CHAPTER 1 SEM 2 2017/2018 12
 1.6 BINARY OPERATIONS (Cont.)

Note:

For a finite set, a binary operation on a set can be defined by means

of a table.

* is commutative if and only if the entries in the table are

symmetric with respect to the diagonal.

Example 19 Since the entries

* a b c d
are symmetric with
a b d a a respect to the
b d a c b diagonal, then * is
c a c d b commutative
d a b b c
SMA3033 CHAPTER 1 SEM 2 2017/2018 13
 1.6 BINARY OPERATIONS (Cont.)

Example 20
* a b c Since a * b = c &
a b c b b * a = a then *
is not commutative
b a c b
c c b a

Example 21

Complete the following table so that * * a b c d

is a commutative binary operation on
a a b c d
the set S = {a, b, c, d }.
b b d a c
c c a d b
d d c b a
SMA3033 CHAPTER 1 SEM 2 2017/2018 14
 1.6 BINARY OPERATIONS (Cont.)

Some important words:

Not everywhere defined - Operation * is called not everywhere

defined on S if:
 no element can be assigned to each
possible ordered pairs.

Not well defined - Operation * is called not well defined on S if:

 several elements of S are assigned to S
(ambiguity)

SMA3033 CHAPTER 1 SEM 2 2017/2018 15

 1.6 BINARY OPERATIONS (Cont.)

Definition 5 (Binary Algebraic Structure)

A binary algebraic structure, denoted by < S, * > is a set S

together with a binary operation * on S.

Eg : < Z, +> , < Q+, + >

Definition 6 ( Identity element for * )

Let < S, * > be a binary structure. An element e of S is an identity

element for * if
e * s = s * e = s.

SMA3033 CHAPTER 1 SEM 2 2017/2018 16

 1.6 BINARY OPERATIONS (Cont.)

Example 22

i. 0 is the identity for + (addition) on R

since,
0 + a = a + 0 = a for all a in R.

ii. 1 is the identity for . (multiplication) on R

since,
1 . a = a . 1 = a for all a in R.

iii. is the identity for matrix multiplication on M2(R)

because ,

SMA3033 CHAPTER 1 SEM 2 2017/2018 17

 1.6 BINARY OPERATIONS (Cont.)

Example 23

Determine the identity of < Q,  > where  is defined by

Solution :

Let a be any element in Q.

If e is the identity of < Q,  >, then
e  a = a  e = a.
Then,
LHS:

SMA3033 CHAPTER 1 SEM 2 2017/2018 18

 1.6 BINARY OPERATIONS (Cont.)

RHS:

Since 2 in Q & LHS = RHS, then the identity of < Q, + >.

Example 24

Determine whether < Z, * >, where * is defined by a * b = a – b + 1,

has an identity.

SMA3033 CHAPTER 1 SEM 2 2017/2018 19

 1.6 BINARY OPERATIONS (Cont.)

Solution:

Let a be any element in Z.

If e is the identity element of < Z, * >, then
e * a = a * e = a.
Then,
LHS :

RHS:

Since LHS  RHS, then < Z, * > does not have any identity element.

SMA3033 CHAPTER 1 SEM 2 2017/2018 20

 1.6 BINARY OPERATIONS (Cont.)

Theorem 1 (Uniqueness of Identity Element)

A binary structure < S, * > has at most one identity. That is, if there
is an identity, it is unique.

To prove “uniqueness”
-Suppose two different
elements to be the element
that we want to prove unique.
- Finally, to show these two
elements are actually same.

SMA3033 CHAPTER 1 SEM 2 2017/2018 21

 1.6 BINARY OPERATIONS (Cont.)

Proof:
(To show the identity element in < S, * > is unique. )

Let e & f be identity elements of S.

Then,
since e is the identity element,
e*f=f*e=f (1)
Also, since f is the identity element,
e*f=f*e=e (2)
Hence,
from (1) & (2),
f = e.
Therefore, the identity element in < S, * > must be unique 

SMA3033 CHAPTER 1 SEM 2 2017/2018 22

 1.6 BINARY OPERATIONS (Cont.)

Example 25

Determine whether < Q+, * > , where * is defined by

has an identity.

Solution:

Let a be any element in Q+.

If e is the identity of < Q+, * >, then
e*a=a*e=a.
Then,

Since e = a represents any element of Q+, then < Q+, * > has no
identity.
SMA3033 CHAPTER 1 SEM 2 2017/2018 23
 1.6 BINARY OPERATIONS (Cont.)

Exercise:

1. On Q, define a binary operation  by a  b = ab + 1. Determine

the identity element of binary structure < Q, `>.

SMA3033 CHAPTER 1 SEM 2 2017/2018 24