Other

JEE Class 12 Maths Study Rankers Revision Notes

0 purchase

Module
JEE

Institution
JEE

JEE Class 12 Maths Study Rankers Revision Notes are meticulously crafted resources designed to equip students with the essential tools to conquer the intricate challenges of the Joint Entrance Examination (JEE). Tailored specifically for Class 12 students, these comprehensive notes serve as an inva...

[Show more]

Preview 4 out of 52 pages

View example

Uploaded on April 13, 2024
Number of pages 52
Written in 2023/2024
Type Other
Person Unknown

jee
jee main
wbjee
class 12
chemistry
mhtcet
ugee
bitsat
vitsat
cuet
fast revision notes
important formulae
important concepts
mathematics
concise
precise
best revision n
cbse class 12 chemistry notes

£7.11

Add to cart

Add to wishlist

100% satisfaction guarantee
Immediately available after payment
Both online and in PDF
No strings attached

,Study Rankers Revision Notes
Unit-I
Relations and Functions

CHAPTER-1
Relations and Functions

Topic-1
Relations

Revision Notes
1. DEFINITION
A relation R, from a non-empty set A to another non-empty set B is mathematically as an subset of A × B.
Equivalently, any subset of A × B is a relation from A to B.
Thus, R is a relation from A to B Û R Í A × B
Û R Í {(a, b) : a Î A, b Î B}
Illustrations :
(a) Let A = {1, 2, 4}, B = {4, 6}. Let R = {(1, 4), (1, 6), (2, 4), (2, 6), (4, 4) (4, 6)}. Here R Í A × B and therefore R is
a relation from A to B.

Study
(b) Let A = {1, 2, 3}, B = {2, 3, 5, 7}, Let R = {(2, 3), (3, 5), (5, 7)}. Here R Ë A × B and therefore R is not a relation
from A to B. Since (5, 7) Î R but (5, 7) Ï A × B.
(c) Let A = {–1, 1, 2}, B = {1, 4, 9, 10} let a Î A and b Î B and a R b means a2 = b then, R = {(–1, 1), (1, 1), (2, 4)}.
Note :
 A relation from A to B is also called a relation from A into B.
 (a, b) Î R is also written as aRb (read as a is R related to b).

Rankers
 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. Then total number of subsets of A × B = 2pq. Since each subset of A × B is a relation from A to B,
therefore total number of relations from A to B will be 2pq.
2. DOMAIN & RANGE OF A RELATION
(a) 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 " b Î B.
Thus, Dom.(R) = {a Î A : (a, b) Î R " b Î B}.
That is, the domain of R is the set of first components of all the ordered pairs which belong to R.
(b) Range of a relation : Let R be a relation from A to B. The range of relation R is the set of all those elements
b Î B such that (a, b) Î R " a Î A.
Thus, Range of R = {b Î B : (a, b) Î R " a Î A}.
That is, the range of R is the set of second components of all the ordered pairs which belong to R.
(c) Co-domain of a relation : Let R be a relation from A to B. Then B is called the co-domain of the relation R. So
we can observe that co-domain of a relation R from A into B is the set B as a whole.
Illustrations : Let a Î A and b Î B and
(a) Let A = {1, 2, 3, 7}, B = {3, 6}. If aRb means a < b.
Then we have R = {(1, 3), (1, 6), (2, 3), (2, 6), (3, 6)}.
Here, Dom.(R) = {1, 2, 3}, Range of R = {3, 6}, Co-domain of R = B = {3, 6}
(b) Let A = {1, 2, 3}, B = {2, 4, 6, 8}.
If R1 = {(1, 2), (2, 4), (3, 6)}, and R2 = {(2, 4}, (2, 6), (3, 8), (1, 6)}
Then both R1 and R2 are related from A to B because
R1 Í A × B, R2 Í A × B
Here, Dom(R1) = {1, 2, 3}, Range of R1 = {2, 4, 6};
Dom(R2) = {2, 3, 1}, Range of R2 = {4, 6, 8}

,2 ] Study Rankers Revision Notes Oswaal CBSE Chapterwise & Topicwise Revision Notes, Mathematics, Class – XII

3. TYPES OF RELATIONS FROM ONE SET TO ANOTHER SET
(a) Empty relation : A relation R from A to B is called an empty relation or a void relation from A to B if R = f.
For example, Let A = {2, 4, 6}, B = {7, 11}
Let R = {(a, b) : a Î A, b Î B and a – b is even}.
Here R is an empty relation.
(b) Universal relation : A relation R from A to B is said to be the universal relation if R = A × B.
For example, Let A = {1, 2}, B = {1, 3}
Let R = {(1, 1), (1, 3), (2, 1), (2, 3)}.
Here, R = A × B, so relation R is a universal relation.
Note :
 The void relation i.e., f and universal relation i.e., A × A on A are respectively the smallest and largest relations
defined on the set A. Also these are also called Trivial Relations and other relation is called a non-trivial relation.
 The relations R = f and R = A × A are two extreme relations.

Study
(c) Identity relation : A relation R defined on a set A is said to be the identity relation on A if
R = {(a, b) : a Î A, b Î A and a = b}
Thus identity relation R = {(a, a) : " a Î A}
The identity relation on set A is also denoted by IA.
For example, Let A = {1, 2, 3, 4},
Then IA = {(1, 1), (2, 2), (3, 3), (4, 4)}.
But the relation given by R = {(1, 1), (2, 2), (1, 3), (4, 4)}

Rankers
is not an identity relation because element of IA is not related to elements 1 and 3.
Note :
 In an identity relation on A every element of A should be related to itself only.
(d) Reflexive relation : A relation R defined on a set A is said to be reflexive if a R a " a Î A i.e., (a, a) Î R " a Î A.
For example, Let A = {1, 2, 3} and R1, R2, R3 be the relations given as
R1 = {(1, 1), (2, 2), (3, 3)},
R2 = {(1, 1), (2, 2), (3, 3), (1, 2), (2, 1), (1, 3)} and
R3 = {(2, 2), (2, 3), (3, 2), (1, 1)}
Here R1 and R2 are reflexive relations on A but R3 is not reflexive as 3 Î A but (3, 3) Ï R3.
Note :
 The universal relation on a non-void set A is reflexive.
 The identity relation is always a reflexive relation but the converse may or may not be true. As shown in the
example above, R1 is both identity as well as reflexive relation on A but R2 is only reflexive relation on A.
(e) Symmetric relation : A relation R defined on a set A is symmetric if
(a, b) Î R Þ (b, a) Î R " a, b Î A i.e., aRb Þ bRa (i.e., whenever aRb then bRa).
For example, Let A = {1, 2, 3},
R1 = {(1, 2), (2, 1)}, R2 = {(1, 2), (2, 1), (1, 3), (3, 1)}.
R3 = {(1, 2), (2, 1), (1, 3), (3, 1), (2, 3), (3, 2)}
R4 = {(1, 3), (3, 1), (2, 3)}
Here R1, R2 and R3 are symmetric relations on A. But R4 is not symmetric because (2, 3) Î R4 but (3, 2) Ï R4.
(f) Transitive relation : A relation R on a set A is transitive if (a, b) Î R and (b, c) Î R Þ (a, c) Î R i.e., aRb and bRc Þ
aRc.
For example, Let A = {1, 2, 3},
R1 = {(1, 2), (2, 3), (1, 3), (3, 2)}
and R2 = {(1, 3), (3, 2), (1, 2)}
Here R2 is transitive relation whereas R1 is not transitive because (2, 3) Î R1 and (3, 2) Î R1 but (2, 2) Ï R1.
(g) Equivalence relation : 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 i.e., aRa.
(ii) R is symmetric i.e., (a, b) Î R Þ (b, a) Î R " a, b Î A i.e., aRb Þ bRa.
(iii) R is transitive i.e., (a, b) Î R and (b, c) Î R Þ (a, c) Î R " a, b, c Î A i.e., aRb and bRc Þ aRc.
For example, Let A = {1, 2, 3}
R = {(1, 2), (1, 1), (2, 1), (2, 2), (3, 3) (1, 3), (3, 1), (2, 3)}
Here R is reflexive, symmetric and transitive. So R is an equivalence relation on A.
Equivalence classes : Let A be an equivalence relation in a set A and let a Î A. Then, the set of all those elements of
A which are related to a, is called equivalence class determined by a and it is denoted by [a]. Thus, [a] = {b Î A : (a, b) Î A}

, Study Rankers Revision Notes
Oswaal CBSE Chapterwise & Topicwise Revision Notes, Mathematics, Class – XII [ 3

Note :
 Two equivalence classes are either disjoint or identical.
 An equivalence relation R on a set A partitions the set into mutually disjoint equivalence classes.
 An important property of an equivalence relation is that it divides the set into pair-wise disjoint subsets called
equivalence classes whose collection is called a partition of the set.
Note that the union of all equivalence classes give the whole set.
e.g., Let R denotes the equivalence relation in the set Z of integers given by R = {(a, b) : 2 divides a – b}. Then
the equivalence class [0] is [0] = [0, ± 2, ± 4, ± 6,.....].
4. TABULAR REPRESENTATION OF A RELATION
In this form of representation of a relation R from set A to set B, elements of A and B are written in the first
column and first row respectively. If (a, b) Î R then we write ‘1‘ in the row containing a and column containing b and if
(a, b) Ï R then we write ‘0‘ in the same manner.
For example, Let A = {1, 2, 3}, B = {2, 5} and R = {(1, 2), (2, 5), (3, 2)}, then
R 2 5
1 1 0

Study
2 0 1
3 1 0
5. INVERSE RELATION
Let R Í A × B be a relation from A to B. Then, the inverse relation of R, to be denoted by R–1, is a relation from
B to A defined by R–1 = {(b, a) : (a, b) Î R}
Thus (a, b) Î R Û (b, a) Î R–1 " a Î A, b Î B.
Clearly, Dom.(R–1) = Range of R, Range of R–1 = Dom.(R).

Rankers
Also, (R–1)–1 = R.
For 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)}.

Know the Facts
1. (i) A relation R from A to B is an empty relation or void relation if R = f
(ii) A relation R on a set A is an empty relation or void relation if R = f
2. (i) A relation R from A to B is a universal relation if R = A × B.
(ii) A relation R on a set A is an universal relation if R = A × A.
3. A relation R on a set A is reflexive if aRa, " a Î A.

4. A relation R on a set A is symmetric if whenever aRb, then bRa for all a, b Î A.
5. A relation R on a set A is transitive if whenever aRb, and bRc then aRc for all a, b, c Î A.
6. A relation R on A is identity relation if R = {(a, a), " a Î A} i.e., R contains only elements of the type (a, a) " a Î A and
it contains no other element.
7. A relation R on a non-empty set A is an equivalence relation if the following conditions are satisfied :
(i) R is reflexive i.e., for every a Î A, (a, a) Î R i.e., aRa.
(ii) R is symmetric i.e., for a, b Î A, aRb Þ bRa i.e., (a, b) Î R Þ (b, a) Î R.
(iii) R is transitive i.e., for all a, b, c Î A, we have, aRb and bRc Þ aRc i.e., (a, b) Î R and (b, c) Î R Þ (a, c) Î R.

TYPES OF INTERVALS
(i) Open Intervals : If a and b be two real numbers such that a < b then, the set of all the real numbers lying
strictly between a and b is called an open interval. It is denoted by ]a, b[ or (a, b) i.e., {x Î R : a < x < b}.
(ii) Closed Intervals : If a and b be two real numbers such that a < b then, the set of all the real numbers lying
between a and b such that it includes both a and b as well is known as a closed interval. It is denoted by
[a, b] i.e., {x Î R : a £ x £ b}.
(iii) Open Closed Interval : If a and b be two real numbers such that a < b then, the set of all the real numbers
lying between a and b such that it excludes a and includes only b is known as an open closed interval. It is
denoted by ]a, b] or (a, b] i.e., {x Î R : a < x £ b}.

The benefits of buying summaries with Stuvia:

Guaranteed quality through customer reviews

Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.

Quick and easy check-out

You can quickly pay through credit card for the summaries. There is no membership needed.

Focus on what matters

Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!

Frequently asked questions

What do I get when I buy this document?

You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.

Satisfaction guarantee: how does it work?

Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.

Who am I buying these notes from?

Stuvia is a marketplace, so you are not buying this document from us, but from seller adityasharma9. Stuvia facilitates payment to the seller.

Will I be stuck with a subscription?

No, you only buy these notes for £7.11. You're not tied to anything after your purchase.

Can Stuvia be trusted?

4.6 stars on Google & Trustpilot (+1000 reviews)

68175 documents were sold in the last 30 days

Founded in 2010, the go-to place to buy revision notes and other study material for 15 years now

Start selling