Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
48 views65 pages

(SAMBHAV) - Relations - 22nd June

Uploaded by

garima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
48 views65 pages

(SAMBHAV) - Relations - 22nd June

Uploaded by

garima
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 65

UDAAN

Cartesian Product
The SET of all possible ordered pairs (a, b), where a ∈ A and b ∈ B is
called the cartesian product of A to B and is denoted by A x B.
Cartesian Product
Example:
If A = {1, 2} and B = {a, b, c }, then find A x B and B x A
Is AxA Defined?
Note

● If n(A) = m and n(B) = n, then n(A x B) = mn.

● Usually A x B ≠ B x A.
Is AxBxC Defined?

● A = {1, 2} B = {2, 3} C ={5} Find A x B x C


Relations
x y=x y

1 1
Set A 2 2 Set B
3 3
4 4
… …

● R = { (1, 1), (2, 2), (3, 3), (4, 4), …….}

● R = { (x,y) : y=x , x 𝞊 N , y 𝞊 N}
Relations

x y>x y

1 1
2 2 Set B
Set A
3 3
4 4

● R = { (1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4)}

● R = { (x,y) : y > x , x, y 𝞊 N , x, y < 5}


Relation: Definition

Let A and B be two sets. Then a relation R from A to B is a subset of A x B.

e.g.
If
A = {1, 2, 3, 4, 5, 6, 7, 8, 9} and
B = {1, 2, 3, 4, 5}
and
R = {(a, b) : a = 2b, a ∈ A, b ∈ B} then
R=?
Mapping (Arrow) Diagram of Relation

A = {1, 2, 3, 4, 5, 6, 7, 8, 9} and
B = {1, 2, 3, 4, 5}
R = {(a, b) : a = 2b, a ∈ A, b ∈ B}
R = {(2, 1), (4, 2), (6, 3), (8, 4)}.
Image & Pre-Image of an Element

A = {1, 2, 3, 4, 5, 6, 7} and
B = {1, 2, 3, 4, 5}
R = {(a, b) : a < b, a ∈ A, b ∈ B}
R =
Number of Relations
If n(A) = m and n(B) = n, then n(A x B) = mn.

So total number of subsets of A x B i.e. number of relations from A to B is 2mn.


Domain, Co-Domain & Range
Let R : A → B

Domain : The set of all first elements of the ordered pairs belonging to R

Range : The set of all second elements of the ordered pairs in R

Co-Domain : The second set ‘B’


Let A = {1, 3, 5, 7} and B = {2, 4, 6, 8} be two sets and let R be a
relation from A to B such that "(x, y) ∈ R ⇒ x - y > 0”.
Then find the Domain and Range of this relation
Find the domain & range of the relation R given by
Types of Relations
1. Void relation: Let A be a set. Then ф ⊆ A x A and so it is a relation on A.
This relation is called the void or empty relation on A.

Example:

● A = {1, 2, 3, 4}

● R = { (a,b) : a+b > 10 }


Types of Relations

2. Universal relation: Let A be a set. Then A x A ⊆ A x A and so it is a relation


on A. This relation is called the universal relation on A.

Example:

● A = {1, 2, 3, 4}

● R = { (a,b) : a+b < 10 }


Types of Relations
3. Identity relation: I : A →A and IA = {(a, a) : a ∈ A} i.e; if every element of A
is related to itself only then it is identity relation.

Example:

● A = {1, 2, 3, 4}

● R = { (a,b) : a ÷ b = 1 }
Types of Relations
4. Reflexive relation: R : A →A and if every element of A is related to itself then it
is reflexive relation.

Example:

● A = {1, 2, 3, 4}

● R = { (a,b) : a ÷ b 𝜖 integer }
Types of Relations
NOTE:
Every identity relation is reflexive but every reflexive relation in not identity.
Types of Relations
5. Symmetric relation : R : A →A is said to be a symmetric relation iff
(a, b) ∈ R ⇒(b ,a) ∈ R for all a, b ∈ A.

Example:

● A = {1, 2, 3, 4}

● R = { (a,b) : a + b < 5 }
Types of Relations
6. Transitive relation: R : A → A is said to be a transitive relation
iff (a, b) ∈ R and (b, c) R ⇒ (a, c) ∈ R for all a, b, c ∈ A

Example:

● A = {1, 2, 3, 4}

● R = { (a,b) : a < b }
Types of Relations
NOTE:
Void relation is symmetric as well as transitive but not reflexive.
Types of Relations
7. Equivalence relation: A relation which is reflexive, symmetric and transitive
simultaneously.
Let R = {(1,3), (4,2), (2,4), (2,3), (3,1)} be a relation on the set A = (1,2,3,4}.
The relation R is

A. reflexive B. transitive C. symmetric D. none


Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6, 12), (3, 9), (3,12), (3, 6)} be a relation
on the set A = {3, 6, 9, 12}. The relation is

A. reflexive and transitive only


B. reflexive only
C. an equivalence relation
D. reflexive and symmetric only
Let R be a relation defined on N as a R b is 2a+ 3b is
a multiple of 5, a,b ∈ N. Then R is

A. Not reflexive
[JEE Main 2023]
B. Transitive but not symmetric
C. Symmetric but not transitive
D. An equivalence relation
Let R1 and R2 be two relations defined as follows
R1 = {(a,b) Є R2 : a2 + b2 Є Q} and R2 = {(a, b) Є R2 : a2 + b2 ∉ Q}
Where Q is the set of all rational numbers. Then,
[JEE Main 2020]
A. R1 and R2 are both transitive
B. Neither R1 nor R2 is transitive
C. R1 is transitive but R2 is not transitive
D. R2 is transitive but R1 is not transitive
Let P be the relation defined on the set of all real numbers such
that P = {(a, b) : sec2a - tan2b = 1}. Then P is:

A. reflexive and symmetric but not transitive. [JEE Main 2014]


B. reflexive and transitive but not symmetric.
C. symmetric and transitive but not reflexive.
D. an equivalence relation.
The minimum number of elements that must be added to the relation
R = {(a,b), (b,c)} on the set {a,b,c} so that it becomes symmetric &
transitive is:

A. 4 [JEE Main 2023]

B. 7
C. 5
D. 3
A relation R {(x, y) : |x - y|} is divisible by 3; x, y ∈ R; (set of real
numbers)}, then R is

A. Symmetric
B. Reflexive
C. Transitive
D. All of these
Consider the set A = {3, 4, 5} and the numbers of null relations, identity
relation, universal relations, reflexive relations on A are respectively
n1, n2, n3 and n4 then the value of n1 + n2 + n3 + n4 is equal to

A. 8
B. 7
C. 73
D. 67
Equivalence Class
➔ Equivalence Class is defined for an element of set ‘A’
➔ Equivalence Class of element a is denoted as [a]
➔ [a] will be a subset of A

➔ [a] = {b: (a, b) ∈ R, where a, b ∈ A}


Inverse of Relation

If R is a relation on set A, then the relation R-1 on A defined by


R-1 = {(y, x) : (x, y) ∈ R} is called an inverse relation to A.

Domain (R-1) = Range (R)


Range (R-1) = Domain (R)
If R be a relation < from A = (1, 2, 3, 4} to B = {1, 3, 5}
i.e. (a, b) ∈ R iff a < b, then ROR-1 is

A. {(1, 3), (1, 5), (2, 3), (2, 5), (3, 5), (4, 5)}
B. {(3, 1), (5, 1), (3, 2), (5, 2), (5, 3), (5, 4)}
C. {(3, 3), (3, 5), (5, 3), (5, 5)}
D. {(3, 3), (3, 4), (4, 5)}
The relation R defined in A = {1, 2, 3) by aRb if |a2 - b2| ≤ 5.
Which of the following is false?

A. R = {(1, 1), (2, 2), (3, 3), (2, 1), (1, 2), (2, 3), (3, 2)}
B. R-1 = R
C. Domain of R = (1, 2, 3)
D. Range of R = {5}
[JEE Main 2023]
[JEE Main 2023]
[JEE Main 2023]
[JEE Main 2023]
[JEE Main 2023]
[JEE Main 2023]
UDAAN

You might also like