CBSE Class 12 Maths Notes Chapter 1: Relations and Functions are important for students preparing for their board exams. These notes provide a detailed overview of key concepts, including the definitions, properties, and types of relations and functions.
Understanding relations and functions is important as they form the basis for many advanced topics in mathematics. Studying these notes thoroughly will help students build a solid foundation, enhance their problem-solving skills and perform well in their exams.CBSE Class 12 Maths Notes Chapter 1 Relations and Functions PDF
Empty Relation
If no element of A is related to any element of A, i.e. R = φ ⊂ A × A , then the relation R in a set A is called empty relation.Universal Relation
If each element of A is related to every element of A, i.e. R = A × A , then the relation R in set A is said to be universal relation. Both the empty relation and the universal relation are sometimes called trivial relations. A relation R in a set A is called-Reflexive- if (a, a) ∈ R , for every a ∈ A,
Symmetric- if (a 1 , a 2 ) ∈ R implies that (a 2 , a 1 ) ∈ R , for all a 1 , a 2 ∈ A,
Transitive- if (a 1 , a 2 ) ∈ R and (a 2 , a 3 ) ∈ R implies that (a 1 , a 3 ) ∈ R for all a 1 , a 2 , a 3 ∈ A.
Equivalence Relation- A relation R in a set A is an equivalence relation if R is reflexive, symmetric and transitive.
1. One to one Function: A function f : X → Y is defined to be one-one (or injective), if the images of distinct elements of X under f are distinct, i.e., for every x 1 , x 2 ∈ X, f(x 1 ) = f(x 2 ) implies x 1 = x 2 . Otherwise, f is called many-one.
One-to-One Function Example: Each student in a class having a unique student ID.
2. Many-one function
Onto Function: A function f: X → Y is said to be onto (or surjective), if every element of Y is the image of some element of X under f, i.e., for every y ∈ Y, there exists an element x in X such that f(x) = y.
3. Onto function
One-one and Onto Function: A function f: X → Y is said to be one-one and onto (or bijective), if f is both one-one and onto.
Onto Function Example: A function that assigns students to different classes, ensuring every class has at least one student.
gof (x) = g(f (x)), ∀ x ∈ A
Question 1: Find out whether each of the following relations are reflexive, symmetric and transitive.
(i) Relation R in the set A = {1, 2, 3…13, 14} defined as
R = {(x, y): 3x − y = 0}
(ii) Relation R in the set N of natural numbers defined as
R = {(x, y): y = x + 5 and x < 4}
(iii) Relation R in the set A = {1, 2, 3, 4, 5, 6} as
R = {(x, y): y is divisible by x}
Answer:
(i) A = {1, 2, 3 … 13, 14}
R = {(x, y): 3x − y = 0} ∴R = {(1, 3), (2, 6), (3, 9), (4, 12)} R is not reflexive since (1, 1), (2, 2) … (14, 14) ∉ R. Also, R is not symmetric as (1, 3) ∈R, but (3, 1) ∉ R. [3(3) − 1 ≠ 0] Also, R is not transitive as (1, 3), (3, 9) ∈R, but (1, 9) ∉ R. [3(1) − 9 ≠ 0] Hence, R is neither reflexive, nor symmetric, nor transitive.(ii) R = {(x, y): y = x + 5 and x < 4} = {(1, 6), (2, 7), (3, 8)}
It is seen that (1, 1) ∉ R. ∴R is not reflexive. (1, 6) ∈R But,(6, 1) ∉ R. ∴R is not symmetric. Now, since there is no pair in R such that (x, y) and (y, z) ∈R, then (x, z) cannot belong to R. ∴ R is not transitive. Hence, R is neither reflexive, nor symmetric, nor transitive.(iii) A = {1, 2, 3, 4, 5, 6}
R = {(x, y): y is divisible by x} We know that any number (x) is divisible by itself. (x, x) ∈R ∴R is reflexive. Now, (2, 4) ∈R [as 4 is divisible by 2] But, (4, 2) ∉ R. [as 2 is not divisible by 4] ∴R is not symmetric. Let (x, y), (y, z) ∈ R. Then, y is divisible by x and z is divisible by y. ∴z is divisible by x. ⇒ (x, z) ∈R ∴R is transitive. Hence, R is reflexive and transitive but not symmetric.