L-4 - Sets and Relations
Uploaded by
Eric vaishL-4 - Sets and Relations
Uploaded by
Eric vaishSets and Relations
Lecture - 4
10+ years Teaching experience
Sameer Chincholikar
20,000 Students & Teachers Mentored
B.Tech, M.Tech from IIT-Roorkee
100+ Aspiring Teachers Mentored
DPPs
Weekly and Monthly Tests
Doubt Sessions
Live, Interactive and Personalized
PLUS Courses
Step 1 Step 2
INSTALL
Step 3 Step 4
Step 5 Step 6
JEELIVE
22,500
Relations
Important Terminologies
Ordered Pair
A pair of objects listed in a specific order is called an
ordered pair. Example: Coordinates of a point.
In the ordered pair (a, b), a is called the first element
and b is called the second element.
Important Terminologies
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.
Usually A x B ≠ B x A.
Example: If A = {1, 2} and B = {a, b, c }, then find A x B and B x A
NOTE
If n(A) = m and n(B) = n, then n(A x B) = mn.
Mapping Diagram
A = { 1, 2, 3 } and B = { a, b }
A x B = { (1, a), (1, b), (2, a), (2, b), (3, a), (3, b) }
Example Let A and B two sets containing 4 elements and 2 elements respectively. Then
number of subsets of A x B having at least 3 elements is 2015
A. 275 B. 510 C. 219 D. 256
Relation: Definition
Relation:
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 = {(2, 1), (4, 2), (6, 3), (8, 4) }.
Mapping Diagram of Relation
Example:
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}
then
R = {(2, 1), (4, 2), (6, 3), (8, 4) }.
NOTE
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 and Range of A Relation
Domain and Range
Let R : A → B
the set of all first elements of the ordered pairs
Domain:
belonging to R is called the domain of R.
The set of all second elements of the ordered pairs in
Range:
R is called the range of R.
Example 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
Types of Relations
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
Universal relation: Let A be a set. Then A x A ⊆ A x A and so it is a
2 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
Reflexive relation: R : A →A and if every element of A is related to
4 itself only then it is reflexive relation.
Example:
A = {1, 2, 3, 4}
R = { (a,b) : a ÷ b 𝜖 integer }
Types of Relations
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
Transitive relation: R : A → A is said to be a transitive relation
6 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
Equivalence relation: A relation R on a set A is said to be an equivalence
7 relation iff it is reflexive, symmetric and transitive simultaneously.
Practice Problems
Example 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 2004
A. reflexive B. transitive C. not symmetric D. a function
Example 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 2005
A. reflexive and transitive only
B. reflexive only
C. an equivalence relation
D. reflexive and symmetric only
Example Let Z be the set of all integers and R be the relation on Z defined as
R = {(a, b) : a, b ∈ Z, and (a – b) is divisible by 5}
Prove that R is an equivalence relation.
Example Show that the relation S in the set R of real numbers, defined as
S = {(a, b) : a, b ∈ R and a ≤ b3 } is neither reflexive, nor symmetric nor
transitive.
Telegram
APP
tinyurl.com/jeelivechat
