\\

Chapter – 2 THEORY CONTENT OF

RELATION AND
BINARY OPERATIONS

1 RELATIONS
DEFINITION
A relation R, from a non-empty set A to another non-empty set B, is a subset of A×B
Equivalently, any subset of A×B is relation from A to B.
Thus, R is a relation from A to B Û R ⊆ A×B
Û R ⊆ { ( a , b ) :a ∈ A , b ∈ B }
Example: Let A={ 1 , 2 } , B= { a , b , c }
Let R={ ( 1 , a ) , (1 , c ) }
Here R is a subset of A×B and hence it is a relation from A to B.

2 DOMAIN AND RANGE OF A RELATION

2.1 DOMAIN OF A RELATION

Let R be a relation from A to B. The domain of relation R is the set of all those elements
a ∈ A such that ( a , b ) ∈ R for some b ∈ B .
Thus Dom (R) = { a∈ A : ( a , b ) ∈ R for some b∈ B }
Thus domain of R = set of first components of all the ordered pair which belong to R.
2.2 RANGE OF A RELATION
Let R be a relation from A to B. The range of R is the set of all those elements b ∈ R such that
( a , b ) ∈ R for some a ∈ A .
Thus range of R={ b ∈ B : ( a , b ) ∈ R for some a∈ A } .
Range of R = set of second components of all the ordered pairs which belong to R.
Set B is called as codomain of relation R.
Example1: Let A= {2 , 3 , 5 } and B= { 4 , 7 , 10 , 8 }
Let aRb ⇔ a divides b
Then Dom R={ 2 , 5 } and range of R={ 4 , 10 , 8 }
Codomain of R=B={ 4 , 7 , 10 , 8 }
Example2: Let A={ 1 , 2 , 3 } , B= {2 , 4 , 6 , 8 }
Let R be a relation defined from A to B by xRy ⇔ y is double of x , ∀ x ∈ A
Then 1R 2, 2R 4, 3R 6
\ R={ ( 1 , 2 ) , ( 2 , 4 ) , ( 3 , 6 ) }
3 REPRESENTATION OF A RELATION

A relation from a set A to set B can be represented in any one of the following four forms.
3.1 ROSTER FORM
In this form a relation R is represented by the set of all ordered pairs belonging to R.
Example: Let A = {–1, 1, 2} and B = {1, 4, 9, 10}
 Mathematics
2
Let aRb means a = b
Then R (in roaster form) = {(–1, 1), (1, 1), (2, 4)}
3.2 SET-BUILDER FORM
In this form, the relation R is represented as { ( a , b ) : a∈ A , b ∈ B , a . .. .. b } , the blank is to be
replaced by the rule which associates a to b.
Example: Let A = {1, 3, 5, 7}, B = {2, 4, 6, 8}
Let R = {(1, 2), (3, 4), (5, 6), (7, 8)}, then R in the builder form can be written as
R={ ( a , b ) :a ∈ A , b ∈ B ; a−b=−1 }
3.3 BY ARROW DIAGRAM
In this form, the relation R is represented by drawing arrows from first component to the
second component of all ordered pairs belonging to R.
Example: Let A = {1, 2, 3, 4}, B = {0, 2, 4} and R be relation ‘is less than’ from A to B, then
R={ ( 1 , 2 ) , ( 1 , 4 ) , ( 2 , 4 ) , (3 , 4 ) }
This relation R from A to B can be represented by the arrow diagram as shown in the figure.

3.4 BY LATTICE METHOD

In this form, the relation R is represented by drawing dots in the lattice for all ordered pairs
which satisfy the given relation R.
Example: Let A = {1, 2, 3, 4}, B = {1, 2, 3, 4} and R be the relation ‘is a divisor of’ from A to B, then
R={ ( 1 , 1 ) , ( 1 , 2 ) , ( 1 , 3 ) , (1 , 4 ) , ( 2 , 2 ) , ( 2, 4 ) , ( 3 , 3 ) , ( 4 , 4 ) }
This relation R from A to B can be represented by the lattice as shown in the given figure. The
points marked by dots represent the ordered pairs satisfied by the given relation.

4 TOTSL NUMBER OF RELATIONS

Let A and B be two non empty finite sets having p and q elements respectively.
Then n ( A×B )=n ( A ) . n ( B )= pq
pq
Therefore, total number of subsets of A×B=2
Since each subset of A×B is a relation from A to B, therefore total number of relations form A to
pq
B is 2
Example: Let A = {1, 2}, B = {3, 4, 5}
Then n ( A×B )=n ( A ) . n ( B )=2×3=6
6
 Number of relations from A to B = 2 = 64
 Mathematics

5 TYPES OF RELATIONS FROM ONE SET TO ANOTHER SET

1. Empty relation: A relation R from A to B is called an empty relation or a void relation if

R = f.
Example: Let A = {2, 4, 6} and B = {7, 11}.
Let R = {(a, b) : a ∈ A , b ∈ B and a−b is even}
Since none of the numbers 2–7, 2–11, 4–7, 4–11, 6–7, 6–11 is an even number, therefore R = f.
Hence R is an empty relation from A to B.
2. Universal relation: A relation R from A to B is said to be the universal relation if R=A×B .
Example: Let A = {1, 2}, B = {1, 3}
Let R = {(1, 1), (1, 3), (2, 1), (2, 3)}
Here R=A×B
Hence R is the universal relation from A to B.
6 TYPES OF RELATIONS ON A SET

1. Empty relation: A relation R on a set A is said to be an empty relation or a void relation if R

= f.
Example: Let A = {1, 2, 3, 4, 5}
Let R = {(a, b) : a – b = 12 and a, b Î A}.
We observe that a – b ¹12 for any two elements of A. Therefore,
(a, b) Ï R for any a, b Î A.
Þ R does not contain any element of A × A
Þ R is empty set
Þ R is the empty relation (void relation) on A
2. Universal relation: A relation R on a set A is said to be universal relation on A if R=A× A .
Example: Let A = {1, 2}.
Let R = {(1, 1), (1, 2), (2, 1), (2, 2)}.
Here R=A× A
Hence R is the universal relation on A.
3. Identity relation: A relation R on a set A is said to be identity relation on A if
R = { ( a , b ) : a∈ A , b ∈ A and a=b } .
Thus identity relation R = { ( a , a ) : ∀ a ∈ A } .
Identity relation on set A is also denoted by I A .
Example: Let A = {1, 2, 3, 4}
Then I A= { (1 , 1 ) , ( 2 , 2 ) , ( 3 , 3 ) , ( 4 , 4 ) }
Note: (i) Empty relation and universal relation are called trivial relations.
(ii) In an identity relation on A, every element of A should be related to itself only.

Question: Let A = {3, 5}, B = {7, 11}

Let R = { ( a , b ) : a∈ A , b ∈ B , a−b is even }
Show that R is an universal relation from A to B.
Solution: Given, A= {3 , 5 } , B= {7 , 11 }
Now, R= { ( a , b ) :a ∈ A , b ∈ B and a−b is even }
= {(3, 7), (3, 11), (5, 7), (5, 11)}
 Mathematics

Also A×B={ ( 3 , 7 ) , ( 3 , 11 ) , ( 5 , 7 ) , ( 5 , 11 ) }
Clearly, R=A×B
Hence R is an universal relation from A to B.

7 REFLEXIVE, SYMMETRIC AND TRANSITIVE REALTIONS

1. Reflexive relation: A relation R on a set A is said to be reflexive if ( a , a ) ∈ R , ∀ a ∈ A .

Example: Let A = {1, 2, 3}.
Let R1 ={ ( 1 , 1 ) , ( 2, 2 ) , ( 3 , 3 ) }
R2 ={ ( 1 , 1 ) , ( 2 , 2 ) , ( 3 , 3 ) , ( 1 , 2 ) , ( 2 , 1 ) , ( 1 , 3 ) }
R3 = {( 2 , 2 ) , ( 2 , 3 ) , ( 3 , 2 ) , (1 , 1 ) }
Here R1 and R2 are reflexive relations on A.
R3 is not a reflexive relation on A as (3, 3) ∉ A .
Note: The identity relation is always a reflexive relation but a reflexive relation may or may not be the
identity relation. In the examples given above R1 is both reflexive and identity relation on A
whereas R2 is a reflexive relation on A but not an identity relation on A.
2. Symmetric relation: A relation R on a set A is said to be a symmetric relation if ( a , b ) ∈ R
Þ ( b , a ) ∈ R , where a , b ∈ A .
Example: Let A = {1, 2, 3}.
Let R1 ={ ( 1 , 2 ) , ( 2 , 1 ) }
R2 ={ ( 1 , 2 ) , ( 2 , 1 ) , ( 1 , 3 ) , ( 3 , 1 ) }
Here R1 and R2 are symmetric relations on A.
Let R3 = {( 2 , 3 ) , ( 3 , 2 ) , ( 2 , 2 ) }
and R 4 ={ ( 2 , 3 ) , ( 3 , 1 ) , ( 1 , 3 ) } .
Then R3 is a symmetric relation on A because
(2 , 3 )∈ R3 ⇒ (3 , 2) ∈ R3
But R 4 is not a symmetric relation on A because
( 2 , 3 ) ∈ R 4 and ( 3 , 2 ) ∉ R 4

3. Transitive relation: A relation R on a set A is said to be a transitive relation if ( a , b ) ∈ R and

( b , c ) ∈ R Þ ( a , c ) ∈ R , where a, b, c∈ A .
Example: Let A = {1, 2, 3}
Let R1 = {1, 2), (2, 3), (1, 3), (3, 2)}.
Let R2 = {(1, 3), (3, 2), (1, 2)}.
Then R1 is not transitive relation on A because (2, 3) ∈ R and (3, 2) ∈ R but
(2, 2) ∉ R .
Finally R2 is also a transitive relation.
4. Antisymmetric relation: A relation R on a set A is said to be antisymmetric if ( a , b ) ∈ R and
( b , a ) ∈ R Þ a = b.
Thus R is antisymmetric if a≠b , then both (a, b) and (b, a) cannot belong to R. One of them may
belong to R.
Example: Let A = {1, 2, 3}.
Let R1 ={ ( 1 , 2 ) , ( 1, 3 ) , ( 1 , 1 ) }
R2 ={ ( 1 , 2 ) }
R3 = {( 1 , 2 ) , ( 2 , 1 ) }
Here R1 and R2 are antisymmetric relations on A but R3 is not antisymmetric relation on A.
Note: A relation which is not symmetric is not necessarily antisymmetric.
 Mathematics

Example: Let A = {1, 2, 3}.

Let R = {(1, 2), (2, 1), (2, 3)}.
Here R is not symmetric as (2, 3) Î R but (3, 2) ∉ R
Also R is not antisymmetric because (1, 2) Î R and (2, 1) Î R but 1 ¹ 2
8 EQUIVALENCE REALATION ON A SET

In this section we shall define a very interesting relation on a set which plays a very significant
role in mathematics. This relation has been given the name equivalence relation.
8.1 DEFINITION
Let A be a non-empty set, then a relation R on A is said to be an equivalence relation if
(i) R is reflexive i.e., ( a , a ) ∈ R , ∀ a ∈ A .
(ii) R is symmetric i.e., ( a , b ) ∈ R ⇒ ( b , a ) ∈ R , where a , b ∈ A .
(iii) R is transitive i.e., ( a , b ) ∈ R and ( b , c ) ∈ R Þ ( a , c ) ∈ R , where a, b, c∈ A .
Example: Let A = {1, 2, 3}.
Let a relation R be defined on A as
R = {(1, 2), (1, 1), (2, 1), (2, 2), (3, 3)}
Then R is reflexive, symmetric and transitive. So R is an equivalence relation on A.
9 INVERSE REALATION

Let R ⊆ A×B be a relation from A to B. Then, the inverse relation of R, to be denoted by R , is

−1

a relation from B to A defined by R

−1
={ ( b , a ) : ( a , b ) ∈ R } .
−1

Thus, ( a , b ) ∈ R ⇔ ( b , a ) ∈ R , where a ∈ A , b∈B.

Clearly dom . R−1 = Range R and Range R−1 = Domain R.
−1 −1
Also ( R ) =R
Example: Let A = {1, 2, 4}, B = {3, 0}
and let R = {(1, 3), (4, 0), (2, 3)} be a relation from A to B, then
R−1 ={ ( 3, 1 ) , ( 0, 4 ) , ( 3, 2 ) }

Question: If R is the relation ‘is less than’ from A = {1, 2, 3, 4, 5} to B = {1, 4, 5}. Write down the Cartesian
−1
product corresponding to R. Also find R (aRb is a relation then bR¢ a is relation inverse to R i.e.
R¢ = R–1).
Solution: Clearly, R={ ( a , b ) ∈ A×B : a<b }
\ R = {1, 4), (1, 5), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)}
−1
So, R = {(4, 1), (5, 1), (4, 2), (5, 2), (4, 3), (5, 3), (5, 4)}.
 Mathematics

10 BINARY OPERATION

An operation is a process which produces a new element from two given elements; e.g.,
addition, subtraction, multiplication and division of numbers. If the new element belongs to the
same set to which the two given elements belong, the operation is called a binary operation.
We know the operation of addition and multiplication of numbers, the operation of union
and intersection of sets and the operation of composition of two functions. In all these operations,
when two elements are operated, a new element is formed.
10.1 DEFINITION
A binary operation (or binary composition) denoted by * or O⋅¿ ¿on a non-empty set A is a
mapping which associates with each ordered pair (a, b)  A × A a unique element (to be denoted
by a*b) of A.
Thus a binary operation * on A is a mapping *: A×A → A defined by * (a, b) of A.
Example : Addition (+) as well as multiplication (×) are binary operations on the sets N, Z, Q, R and
C.
a, b ∈ N ⇒ a ∗ b ∈ N
i.e. if a, b ∈ N ⇒ a × b ∈ N
Multiplication (×) is not a binary operation on the set of irrationals.
√ √
For, 2⋅ 2=2 ∉Y where as 2∈ Y . √
Similarly, subtraction (–) is not a binary operation on N. Also division is not a binary
operation on Z. The division () on R0 i.e. R – {0} can be defined as  : R0 × R0  R0 by the
rule  (a, b) = a  b.
Clearly  is a binary operation on R0.
10.2 NUMBER OF BINARY OPERATIONS ON A FINITE SET
Let A be a finite set containing m elements, then number of elements in the Cartesian
product A × A = m × m = m2. We know that if the set A has m elements and the set B has n
elements, then number of functions from A to B = nm.
Since a binary operations on set A is a function from A × A  A, therefore number of
binary operations on A.
2
n ( A× A )
= number of functions from A × A to A = [ n( A )] =mm .
m2
Thus if the set A has m elements, then number of binary operations on A is ( m) .
Example : Let A = {a, b}, then n( A )=2 .
2
2 4
 Number of binary operations on A=( 2 ) =2 =16 .
11 TYPES OF BINARY OPERATIONS

 Commutative Binary Operation : Consider a binary operation ‘*’ on a set S. For

any two distinct elements in S, a * b and b * a may or may not be equal. Thus, it is
not necessary that for a binary operation * on a set S, a * b = b * a for all a, b  S.
If a * b = b * a for a, b  S, then we say that the binary operation * is commutative.
Example: The binary operations addition (+) and multiplication (×) are commutative binary
operations on Z. However, the binary operation subtraction (–) is not a commutative
binary operation on Z as 2 – 1  1 – 2.
If the binary operation * on set S is commutative, we say that the system (S, *) is
commutative.
 Associative Binary Operation : A binary operation ‘*’ on a set S is said to be an
associative binary operation, if
 Mathematics

(a∗b )∗c=a∗(b∗c ) for all a, b, c  S.

If the binary operation * on set S is associative, we also say that the system (S, *) is
associative.
Example: The binary operations of addition (+) and multiplication (×) are associative binary
operations on Z. However, the binary operation subtraction (–) is not an associative
binary operation on Z as (2−3 )−5≠2−(3−5 ) .
If S is a non-empty set, then union () and intersection () are both commutative
and associative binary operations on P( S ) (power set of S).
Explanation: A∪B=B∪ A , A∩B=B∩ A
( A∪B )∪C= A∪( B∪C ) and ( A∩B )∩C= A∩( B∩C ) for all A, B, C  P(S).
 Distributive Binary Operation: Let S be a non-empty set and * and ‘ O⋅¿ ¿’, be two
binary operations on S. Then, ‘*’ is said to be distributive over O⋅¿ ¿, if
a * (b O⋅¿ ¿ c) = (a * b) O⋅¿ ¿ (a * c) and (b O⋅¿ ¿ c) * a = (b * a ) O⋅¿ ¿ (c * a) for all a, b, c S.
Example: The binary operation multiplication () on Z is distributive over the binary operation
addition (+) on Z, because
a⋅( b+ c )=a⋅b+ a⋅c and ( b+ c )⋅a=b⋅a+c⋅a for all a, b, c  Z.
However, addition (+) is not distributive over multiplication (), because
2+(3×5 )≠(2+3 )×(2+ 5) .
If S is a non-empty set, then union () is distributive over intersection () on P( S ) ,
for
A∪( B∩C )=( A∪B )∩( A∪C ) for all A, B, C  P(S).
Clearly, intersection () is distributive over union () on P(S).
12 IDENTITY ELEMENT

Let * be a binary operation on a non empty set A. An element e  A is called an identity

element for the binary operation * if e∗a= a∗e=a for all a ∈ A .
Example: Let R be the set of all real numbers and * be the operation of ordinary multiplication
(×) of integers.
Then 1  R is the identity element for the operation ‘×’ because 1×a=a×1=1 for
all a ∈ R .
THEOREM : Identity element for a binary operation if it exists is unique.
Proof: Let * be a binary operation on a non empty set A.
Let e  A be an identity element for the binary operation *.
If possible, let there be another identity element
e 1 ∈ A for the binary operation *.
Now since e is the identity element for *
 e∗a= a∗e=a for every a ∈ A

e∗e1 =e 1∗e=e 1 [putting e in place of a]
1


e∗e1 =e 1 …(i)
Again e1 is the identity element for *

e 1∗a=a∗e1 =a for every a  A

e 1∗e=e∗e 1 =e [putting e in place of a]

e ∗e=e∗e =e
1 1 …(ii)
From (i) and (ii), we have e1 = e.
Hence identity is unique.
13 INVERSE OF AN ELEMENT AND INVERTIBLE ELEMENT

Let * be a binary operation on a non empty set A and e be the identity element for the
binary operation *. Then an element a  A is said to be invertible with respect to binary
 Mathematics

operation * if there exists an element b  A such that a∗b=b∗a=e . The element is called an
−1
inverse of element ‘a’ and is denoted by a
Thus an element a A is invertible if and only if its inverse exists.
Example: Let Z be the set of all integers and * be the operation of ordinary addition.
Then 0  Z is the identity element.
Let a be any element of Z. Then inverse of ‘a’ for operation * is –a  Z because
a+(−a )=(−a )+a=0 (identity element).
Example: Let Z be the set of all integers and * be the operation of ordinary multiplication.
Then only 1  Z is invertible.
For example, 2  Z has no inverse in Z as if b  Z, such that 2×b=b×2=1
1
b= ∉ Z
Then 2 .
In fact no element a  Z, a  1 has inverse in Z.
THEOREM 1. Let ‘*’ be an associative binary operation on a set S with the identity element e in
S. Then, the inverse of an invertible element is unique.
Proof :
Let a be an invertible element in S.
If possible, let b and c be two inverse of a  S with respect to ‘*’.
Then, a∗b=b∗a=e …(i)
And a∗c= c∗a=e …(ii)
Now, (b∗a )∗c=e∗c [∵ b∗a=e ]
=c [∵ e is the identity element]
…(iii)
Again b∗( a∗c )=b∗e [∵ a∗c=e ]
=b [∵ e is the identity element]
…(iv)
Since ‘*’ is an associative binary operation on S.
Therefore, (b∗a )∗c=b∗(a∗c ) c = b
Hence inverse of an element is unique if the binary operation is associative.

THEOREM 2. Let * be an associative binary operation on a set S and a be an invertible element

−1 −1
of S. Then, (a ) =a .
Proof:
Let e be the identity element in S for the binary operation * on S.
−1
Now, a∗a =e=a−1∗a
 a−1∗a=e=a∗a−1
−1
 a is inverse of a
 a=( a−1 )−1 .
14 BINARY COMPOSITION TABLES

Let
A={a , a , .. . , a }
1 2 n be a finite set of n elements. A binary operation, say * on A can
also be described by means of a table with n + 1 rows and n + 1 columns. The first row and first
a ∗a j of A is shown in the space at the
column contains the elements of the set A. The element i
intersection of (i + 1)th row and (j + 1) th column.

COMPOSITION TABLE
* a1 a2 … … … an
a1 a1 * a1 a1 * a2 a1 * an
a2 a2 * a1 a2 * a2 … … … a2 * an
:
 Mathematics

:
:
an an * a1 an * a2 an * an
For example,
COMPOSITION TABLE
* a b c
a b c a
b c a b
c a b c
A={a, b, c}.
For the set
 we have a∗a=b , a∗b=c , a∗c=a
b∗a=c , b∗b=a , b∗c =b
c∗a=a , c∗b=b , c∗c=c

Question: √
Let A = {1, –1, i, –i}, where i= −1 . Draw the composition table corresponding to
binary operation ‘multiplication’ on A.
Solution:
1 × 1 =1, 1 × (–1) =–1, 1 × i = i, 1 × (–i) = –i,

(−1)×1=−1 , (−1)×(−1 )=1 , (−1)×i=−i , (−1)×(−i )=i ,

i×1=i , i×(−1 )=−i , i×i=−1 , i×(−i)=1 ,
(−i)×1=−i , (−i)(−1 )=i , (−i)×i=1 , (−i)×(−i)=−1 .
Hence the required composition table is :
× 1 –1 i –i
1 1 –1 i –i
–1 –1 1 –i i
i i –i –1 1
–i –i i 1 –1

Question: ‘*’ is a binary operation defined on Q. Find which of the binary operations are
commutative
(i) a∗b=a−b ∀ a , b ∈ Q
(ii) a∗b=a 2 +b2 ∀ a , b ∈ Q
(iii) a∗b=a+ab ∀ a , b ∈ Q
(iv) a∗b=( a−b )2 ∀ a , b ∈ Q
Solution: (i) a∗b=a−b
 b∗a=b−a≠a−b∀ a, b∈ Q .
 the operation is non-commutative.
(ii) a∗b=a 2 +b2 =b 2 +a 2=b∗a
Hence the operation * is commutative.
(iii) a∗b=a+ ab
b∗a=b+ba≠a+ab ∀ a , b ∈ Q
Hence operation * is non-commutative.

(iv) a∗b=( a−b )2 =(b−a )2 =b∗a

Hence operation * is commutative.
 Mathematics
Question: ‘*’ is a binary operation defined on Q. Find which of the following binary
operations are associative.
(i) a∗b=a−b ∀ a , b ∈Q
ab
a∗b= ∀ a , b ∈Q
(ii) 2
(iii) a∗b=2a+3 b ∀ a, b ∈ R
Solution: (i) (a∗b )∗c=(a−b )∗c=(a−b )−c=a−b−c
a∗(b∗c )=a∗(b−c )=a−(b−c )=a−b+ c≠( a∗b )∗c
Hence the operation * is not associative

(ii)
(a∗b )∗c=( ab2 )∗c= abc4
a∗(b∗c )=a∗( )=
bc abc
=(a∗b )∗c
2 4 . Hence the operation * is associative
(iii) a∗(b∗c )=a∗(2b +3 c )=2 a+ 3(2 b+3 c )=2a+ 6 b+9 c
(a∗b )∗c=(2 a+3 b )∗c=2(2 a+3 b )+3 c=4 a+6 b +3 c
 a∗(b∗c )≠(a∗b )∗c . Hence * is not associative.
 Mathematics

1. Find the domain and range of the following relations:

(a)
R1 = {(1, 2), (1, 4), (1, 6), (1, 10)}

(b)
R2 = x ,
{( )
1
x
: 0< x <4 , x is an integer
}
2. Let A = {1, 2} and B = {3, 4}. Find the number of relations from A to B.

3. Let A={ a , b , c } , B={ x, y } . Find the total number of relations from A to B.

4. ‘*’ is a binary operation defined on Q. Find which of the binary operations are
commutative
(i) a∗b=a 2−b 2 ∀ a, b ∈ Q
(ii) a∗b=2a2 +b2 ∀ a, b ∈ Q
(iii) a∗b=a+ab ∀ a, b ∈ Q
(iv) a∗b=( a+b)2 ∀ a, b ∈ Q

5. If ‘*’ is a binary operation on the set R defined by a∗b=3 a+4 b ∀ a , b ∈ R , then show
that ‘*’ is not associative.

6. ‘*’ is a binary operation defined on Q. Find which of the following binary operations are
associative.
(i) a∗b=a+b ∀ a, b ∈ Q
ab
a∗b= ∀ a , b ∈Q
(ii) 6
(iii) a∗b=a+b−ab ∀ a, b ∈ Q
(iv) a∗b=a 2 b ∀ a, b ∈Q
7. Let N be the set of all natural numbers. A relation R be defined on N×N by
( a , b ) R ( c , d ) ⇔ a+d=b +c . Show that R is an equivalence relation.
1
xRy ⇔ |x− y|≤
8. If Q is the set of rational numbers and R is a relation defined on Q by 2,
then prove that R is not an equivalence relation.
 Mathematics

9. Check whether the relation R in R defined by R = {(a, b) : a≤b 3 ¿¿ is reflexive, symmetric

or transitive.

10. Show that the relation R in the set A of points in a plane given by R = (P, Q): distance of
the point P from the origin is same as the distance of the point Q from the origin}, is an
equivalence relation. Further, show that the set of all points related to a point P≠ ( 0 , 0 ) is
the circle passing through P with origin as centre.

R={T 1 , T 2 } : T 1
11. Show that the relation R defined in the set A of all triangles as is similar to
T2}, is equivalence relation. Consider three right angle triangles T1 with sides 3, 4, 5, T2
with sides 5, 12, 13 and T3 with sides 6, 8, 10. Which triangles among T1, T2 and T3 are
related?

12. Prove that:

(i) the inverse of an equivalence relation is also an equivalence relation.
(ii) the intersection of two equivalence relations is also an equivalence relation.
(iii) the union of two symmetric relations is also symmetric.

b
13. Let ‘*’ be a binary operation on N, the set of natural numbers defined by a∗b=a for all
a, b∈ N .
Is ‘*’ associative or commutative on N?

14. Let ‘*’ be a binary operation on N given by a∗b=L. C . M . ( a , b ) for all a , b∈N .
(i) Find the identity element in N
(ii) Which elements of N are invertible? Find them.

15. Consider the set S = {1, 2, 3, 4}. Define a binary operation * on S as follows a∗b=r ,
where r is the least non-negative remainder when ab is divided by 5. Construct the
composition (operation) table for ‘*’ on S.
 Mathematics

1. (a) Domain = {1}, Range = {2, 4, 6, 10}

(b) Domain R = {1, 2, 3}, Range R =

{1 , 12 , 13 }
2. 16

3. 64

4. (iv)

6. (i), (ii), (iii)

13. ‘*’ is neither commutative nor associative on N

14. (i) 1 (ii) 1

15.
* 1 2 3 4
1 1 2 3 4
2 2 4 1 3
3 3 1 4 2
4 4 3 2 1
Mathematics