1. Unary operationwe call a mapping/function of S into itself a unary operation on S i.e.

f:S S
2. Binary operation (Binary composition)
we call a mapping/function of S X S into S a binary operation on S

o : S S S . In other word a binary operation on any set S is a rule

i.e.

which assign each ordered pair (a,b) where a,b S to a unique element of
S denoted by

aob .

i.e. to be binary operation it must follow closure property.

Ex- +,-, on Z ; Union and intersection on P(S) power set of S ;
Note- equivalence relations are relation on single set (i.e. special case of
binary relation as they can be from 1 set to other). Ex - congruence
modulo n. Unary operation are function which are also on single set and
relate 2 elements of a set, difference between these 2 is that being a
function unary operation relate each element of set to only unique
element of same set(restricting).
Addition modulo n and Multiplication modulo n are not relation but
binary operation
3. Induced operation/ composition
Let * is binary operation in S then for

HS

if closure property for

* satisfy i.e.

a H , b H ab H

Then * is induced operation on H.

4. Properties a operation can possessa) Commutative a*b=b*a

commutative in Z
b) Associative- a*(b*c)=(a*b)*c

a,b S

associative in Z
c) Existence of Identity element
S

ex- subtraction is not

a,b,c S

e S

ex- subtraction is not

s.t. a*e=a=e*a

if no such element exist then there can exist

then e is called right identity or

eS

s.t. a*e=a

s.t. e*a=a then e is called left

identity.
Ex- for operation * in Q defined as

eS

ab=

a. b
2 2 is identity

if left and right both identity exist then they are equal.
Prove- assume e1 is left identity and e2 is right identity. Then
e1*e2=e1 (because e2 is right identity) and e1*e2=e2 (because e1 is left
identity)
but e1*e2 must be unique by definition of binary operation, so e 1=e2
identity element for a binary operation, if exist, is unique (proof
same as above)

 if only left/right identity exist then it need not to be unique. Exa*b=|a|b has only 2 left identities 1
d) Existence of inverse (on same line as above) if for a S and there
exist b S s.t a*b=e then b is right inverse of a or c S s.t c*a=e
then c is left inverse of a or d S s.t a*d=e=d*a then d is
called inverse of a for * and denoted by a -1 and called inverse element
and a is called invertible element.
if e exist it is invertible and e is inverse of itself
if binary operation is presented with + sign then inverse of a is
denoted by a. and called additive inverse.
if left and right both inverse exist for an element for an associative
operation then they are equal and element is invertible. (proof same
as above calculate b1*a*b2)
Inverse of invertible element is unique if operation is associative.
(proof same as above)
5. Addition modulo n- (defined on set of integer)
n N, a,b Z , by Euclidean theorem we know

a+b=q .n+ r where 0 r <n

Then binary operation addition modulo n of a and b is defined as r i.e.

+n b=r
a
We also write it as a+b=r (mod n)
Ex- -51+45=2 [-51+5=-46 -46=-12(4)+2]
6. Multiplication modulo n- (defined on set of integer)
n N, a,b Z , by Euclidean theorem we know

a . b=q . n+r where 0 r < n

Then binary operation multiplication modulo n of a and b is defined as r

i.e.

a n b=r
We also write it as a.b=r (mod n)
*
a
b
c

a
b
c
a*a
a*b
a*c
b*a
b*b
b*c
c*a
c*b
c*c
7. Composite table for a binary operation on finite set binary
operation on finite set can be defined using composite table or we can
make a composite table for a binary operation on finite set.