CBSE Class 12 Maths Revision Notes Chapter 1
Class 12 Mathematics Chapter 1 Notes
Mathematics is regarded to be one of the most demanding subjects for students of all classes. The students of higher classes face difficulty preparing for their examinations since high-level Mathematics concepts are introduced. The Class 12 Mathematics Chapter 1 notes- Relations and Functions is an important chapter and defines different concepts along with their graphs.
Extramarks provide one of the best academic notes to help students ace their examinations. These notes are prepared by a team of experts as per the latest guidelines issued by the CBSE board. With all the important formulae and definitions, the notes act as a helping guide for students. They aid in quick revision on the days before the exam.
Students may visit the Extramarks web portal to get all the latest news and information about the CBSE examinations, paper patterns, marking schemes and more. Students may also get access to various academic study materials such as Class 12 Mathematics Chapter 1 notes for free.
Key Topics Covered In Class 12 Mathematics Chapter 1 Notes
The key topics covered under class 12 Mathematics chapter 1 notes include the following.
Relation:
Definition: Relation is the connection between two or more sets of values. If (a,b) ∈ R, then a R b means a is related to b under R.
For example: if A = {9, 16, 25} and B = {5, 4, 3, -3, -4, -5} then set A is related to set B under R, where R = {(x,y), x=y2 / x A and y B}
Types of Relations:
The types of relation mentioned in class 12 Mathematics chapter 1 notes are
- Empty Relation
The relation R in any set A is said to be empty if no element in A is related to any element of the same set, i.e., R = φ A × A
Consider set A= {2, 3, 5} and R= {(x,y), x + y > 9}, then R is an empty relation or void relation.
- Universal Relation
The relation R in any set A is said to be universal if every element in A is related to every element of the same set, R = A × A
For set A= {2, 3, 5} and R= {(x,y), x + y > 0}, then R is a universal relation.
NOTE: Both Empty and Universal Relations are sometimes called trivial relations.
- Reflexive Relation
The relation R in any set A is said to be reflexive; if every element in A is related to itself, i.e., (a, a) ∈ R for every a ∈ A, then a R a is Reflexive.
- Symmetric Relation
A relation R in a set A is said to be symmetric if the elements in R can be swapped.
R is symmetric relation if (a, b) ∈ R (b, a) ∈ R, i.e., aRb = bRa a, b, c A.
If S={a, b, c} then relation R6={(a, b), (b, a), (c, c)}
- Transitive Relation
A relation R in a set A is said to be transitive if (a, b) ∈ R and (b, c) ∈ R (a, c) ∈ R, which means that if (a,b) belongs to R and (b,c) belongs to R then (a,c) will also belong to R a, b, c R.
- Equivalence Relation
If relation R is reflexive, symmetric and transitive, then it is said to be an equivalence relation.
Notation: a b.
If R={(x, y)/ len (x) = len (y)}
Then R is reflexive: len (a) =len (a)
R is symmetric: len (a)=len (b) and len (b)=len (a)
R is transitive: len (a) = len (b) and len (b) = len (c) then len (a) = len (c)
Therefore, R is an Equivalence Relation.
Equivalence Classes:
Notation: {a} or [a]
Let A be a non-empty set. a ∈ A
An equivalence class is the set of all the points that are in relation to a set A under R.
Functions:
A Function f is a special kind of relation. Let f be the function from set A to set B, i.e., f: A B if every element in A is associated or is mapped with only one element in B.
Set A is called the domain, and Set B is called the Co-domain of the function f.
The range is defined as the set of all possible values of function f.
For example: if x3is a function, all values of x are the domain, and the values of x3 are the range.
Types of Function:
Types of function under class 12 Mathematics chapter 1 notes include
- One-One or Injective function:
Function f is injective if each element of set A is mapped to the distinct element of set B.
Mathematically, f: X → Y is an one-one or injective function, if f(x1) = f(x2) ⇒ x1 = x2 ∀ x1 , x2 ∈ X.
For example: f(x)=3x is a one-one function.
- Onto or Surjective Function:
Function f is said to be Onto if at least one element in the domain is mapped to every element in the codomain. It means for a surjective function, the range, codomain, and the image are equal.
Mathematically, f: X → Y is onto or surjective function if for the given y ∈ Y, ∃ x ∈ X such that f(x) = y.
For example: f(x)=x-2 is a surjective function.
- Bijective Function:
Function f is said to be bijective if it is both injective and surjective.
Mathematically, f: X → Y is one-one and onto or bijective, if f is one-one and onto.
For example: f(x)=3x is a one-one and onto function.
Composition of a Function:
Notation: fog or gof
If Function f: A → B and g: B → C, then the composition of function gof: A → C is given as gof(x) = g(f(x)) for all X in set A
NOTE: fog is used to represent f(g(x))
The function gof is the set of all values of x in the domain of f, where f(x) is in the domain of g.
Properties:
Let f: X → Y, g: Y → Z and h: X → Z, then the functions show the following properties:
- Associativity: f(gh)=(fg)h
- If functions f and g are injective, then gof is also injective
- If functions f and g are surjective, then gof is also surjective
Invertible Function:
A function is said to be invertible if f: X → Y then ∃ g: Y → X such that gof = Ix and fog = Iy.
Here g is known as the inverse of f. It is denoted by f-1.
Condition- If the function f: X → Y is bijective (one-one and onto), then it is said to be invertible.
Therefore, let f: X → Y be a bijective function and f(x) =y, then f-1: X → Y defined as f-1(y)=x, is known as the invertible function of f and is always unique.
Binary Operation
Notation: *
A binary operation is used to associate two elements of a set. They are mathematical operations (addition, subtraction, multiplication and division) performed between two elements of a set.
If S is a non-empty set, let * be the binary operation on S, then a*b is defined for every element belonging to the set S, i.e. for all a,b ∈ S.
We can say that * is a function such that *(x): A × A → A
Example: let there be two real numbers a,b ∈ R then a+b ∈ R.
Properties of Binary Operations:
The properties of binary operations include
1. Commutative property:
The binary operation *: A × A → A is commutative on set A, i.e., for all a, b ∈ A a*b = b*a
2. Associative property
The binary operation *: A × A → A is associative on set A, i.e., for all x, y, z ∈ A x*(y*z) = (x*y)*z
3. Existence of Identity
For the binary operation *: A × A → A, there exists an element e such that a*e = e*a= a for all a, b ∈ A, where e is the identity element of Set A
4. Existence of inverse
For the binary operation *: A × A → A, there exists an element b such that a*b = b*a= a for all a, b ∈ A, where b is the inverse of a denoted by a-1.
Theorems:
- Prove the associativity of the composition of a function. i.e., if f: X → Y, g: Y → Z and h: X → Z, then
show that fo(goh) =(fog)oh
- Prove that two invertible functions f: X → Y, g: Y → Z, then (gof)-1= f-1o g-1
Students may refer to these Class 12 Mathematics Chapter 1 notes while preparing for their examination, as they include all concepts that are a part of the syllabus.
Class 12 Mathematics Chapter 1 Notes: Exercises & Answer Solutions
Chapter 1 Mathematics class 12 notes begin with basic notations and definitions of Relations and Functions. To understand this chapter easily, students need to revise the concepts learnt in Class 11. Students will know about different types of relations, function and their properties, such as associativity, commutativity, the existence of identity and inverse element, etc.
To help students understand this chapter better, Extramarks provides detailed Class 12 Mathematics Chapter 1 notes. It includes all the important definitions, formulae, theorems and properties of this chapter. With the help of the CBSE solutions, students can solve and understand questions using step-by-step and well-explained answers. These Class 12 Mathematics Chapter 1 notes will allow students to retain their learning and reduce simple mistakes.
For quick revision, refer to the Extramarks Exercises & Answer Solutions and MCQ questions under the CBSE sample papers of this chapter from the links below.
Extramarks, an online learning platform, focuses on providing students with a wonderful learning experience. To attain high scores, students are advised to refer to the CBSE revision notes and CBSE previous year question papers and practice as many CBSE extra questions as possible.
NCERT Exemplar Class 12 Mathematics
With the help of the NCERT Exemplar, students can gain an in-depth knowledge and develop a strong foundation in Mathematics. Students can use the Class 12 Mathematics Chapter 1 notes, NCERT Exemplar and other NCERT books to perform well in the exams and pursue their dreams. NCERT Exemplar includes many practice questions of all difficulty levels, which will help in developing analytical and problem-solving abilities. Using the NCERT Exemplar and Class 12 Mathematics Chapter 1 notes, students will learn several tips, tricks and shortcut methods to tackle any question in the examination quickly.
Key Features of Class 12 Mathematics Chapter 1 notes
The key features of Class 12 Mathematics Chapter 1 notes provided by Extramarks are
- These notes are prepared by the subject elites at Extramarks.
- The notes follow the CBSE syllabus and are based on the latest guidelines issued by the board.
- The class 12 Mathematics chapter 1 notes offer the student a wide variety of questions to practice to get acquainted with the concepts in the Class 12 Mathematics Chapter 1.
- Studying with the help of notes will help to build confidence and reduce exam stress and anxiety.
- It helps to develop advanced skills and prepares the students for the CBSE Class 10 board exams as well as the competitive examinations like JEE.
- The class 12 chapter 1 Mathematics notes help to develop time management skills in students and reduce the chances of making simple mistakes.
For more guidance on CBSE exams, keep visiting Extramarks. Students are provided with the latest news on the CBSE paper pattern, marking system and important preparation tips. Students can also access the Class 12 Mathematics Chapter 1 notes for free.
Q.1 If f: [1, 2, 3]
[a, b, c] and g: [a, b, c]
[apple, ball, cat] defined as f(1) = a, f(2) = b, f(3) = c, g(a) = apple, g(b) = ball and g(c) = cat. Show that f, g and gof are invertible. Find out f -1, g-1 and (gof)-1 and show that (gof)-1 = f -1og-1.
Ans
Q.2
Ans
Q.3 Let * be the binary operation on the set Q of rational numbers which is defined as follows
(i) a * b = a – b
(ii) a * b = a2 + b2
(iii) a * b = a + ab
Find which of the binary operations are commutative and which are associative.
Ans
(i) Here a * b = a – b
Now b *a = b – a, but a – b ≠ b – a
⇒ a * b ≠ b * a
⇒ * is not commutative
a*(b*c) = a*(b – c) = a – (b – c) = a – b + c
(a*b)*c = (a – b)*c = (a – b) – c
Thus, a*(b*c) ≠ (a * b)*c
⇒ * is not associative
(ii) Here a*b = a2 + b2
b*a = b2 + a2 = a2 + b2
a*b = b*a
⇒ * is commutative
a*(b*c) = a*(b2 + c2) = a2 + (b2 + c2)2
(a*b)*c = (a2 + b2)*c = (a2 + b2)2 + c2
Thus, a*(b*c) ≠ (a*b)*c
⇒ * is not associative
(iii) Here a * b = a + ab
Now b *a = b + ba
⇒ a * b ≠ b * a
⇒ * is not commutative
a*(b*c) = a*(b +bc) = a + a(b + bc) = a + ab + abc
(a*b)*c = (a + ab)*c = a + ab + (a + ab)c = a + ab + ac + abc
Thus, a*(b*c) ≠ (a * b)*c
⇒ * is not associative
Q.4
Ans
Q.5 Consider the binary operation ∧ on the set {1, 2, 3, 4, 5} defined by a ∧ b = min{a, b}. Write the composition table of the operation ∧ .
Ans
Operation ∧ table on the set {1, 2, 3, 4, 5} is as follows.
| ∧ | 1 | 2 | 3 | 4 | 5 |
| 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 2 | 2 | 2 | 2 |
| 3 | 1 | 2 | 3 | 3 | 3 |
| 4 | 1 | 2 | 3 | 4 | 4 |
| 5 | 1 | 2 | 3 | 4 | 5 |
Q.6 Let the * binary operation on N be defined by a*b = HCF of a and b. Is * commutative? Is * associative? Does there exist identity for this operation on N?
Ans
Here a*b = HCF of a and b.
(a) We know HCF of a, b = HCF of b, a
⇒ a*b = b*a
Hence, * is commutative.
(b) a*(b*c) = a*(HCF of b, c)
= HCF of a and HCF of b, c
= HCF of a, b and c
Now (a*b)*c = (HCF of a, b)*c
= HCF of a, b and HCF of c
= HCF of a, b and c
⇒ a*(b*c) = (a*b)*c
Hence, * is associative.
(c) 1*a = a*1 = HCF of a and 1
i.e., 1*a = a*1 = 1
1 ≠ a
∴ There does not exist any identity for this operation
Q.7 Let f: N → R be a function defined as f(x) = 4x2 + 12x + 15. Show that f: N → S where, S is the range of f(x) is invertible. Find the inverse of f.
Ans
Q.8
Ans
Q.9 Let f, g and h be functions from R →R. Then show that
(i) (f + g)oh = foh + goh
(ii) (f.g)oh = (foh).(goh)
Ans
Here f: R →R, g: R →R, h: R →R(i) ((f + g)oh)(x) = (f + g)[h(x)]
= f[h(x)] + g[h(x)]
= foh(x) + goh(x)
⇒ (f + g)oh = foh + goh
(ii) ((f.g)oh)(x) = (f.g)[h(x)]
= f[h(x)].g[h(x)]
=(foh)(x).(goh)(x)
⇒ (f.g)oh = (foh).(goh)
Q.10
Ans
Q.11
Ans
(a) f(1) = f(2) = 1
1 and 2 have the same images.
⇒ f(x1) = f(x2) = 1 for x > 0
But x1 ≠ x2
Similarly -1 and -2 have the same images.
Hence f is not one-one.
(b) Except -1, 0, 1 no other element of co-domain of f has any pre-image in its domain.
⇒ f is not onto.
Q.12 Check the injectivity and surjectivity of the following:
(i) f: N → N given by f(x) = x2
Ans
(i) f: N → N given by f(x) = x2
(a) f(x1) = f(x2) ⇒ x12 = x22 ⇒ x1 = x2
⇒f is one – one, i.e., it is injective
(b) There are many such elements belonging to co-domain that have no pre-image in their domain N e.g. 3 ∈ co domain N. But there is no pre- image in domain of f.
⇒ f is not onto, i.e., not surjective.
(ii) f: R
R given by f(x) = x2
(a) f is not one – one because f(-1) = f (1) = 1
-1 and 1 have the same image
⇒ f is not injective.
(b) -2 ∈ co domain R of f. But √-2 does not belong to domain R of f.
⇒ f is not onto, i.e., f is not surjective.
Q.13 Show that the Relation R on the set A = {x ∈ Z : 0 ≤ x ≤ 12}, given by R = {(a, b) : |a – b| is a multiple of 4} is an equivalence relation.
Ans
R = {(a, b) : |a – b| is a multiple of 4}, where a, b ∈ A ={x
Z : 0 ≤ x ≤ 12} = {0, 1, 2, …, 12}.
Reflexivity: For any a ∈ A, |a – a| = 0, which is a multiple of 4.
⇒ (a, a) ∈ R, for all a ∈ A.
So, R is reflexive.
Symmetry: Let (a, b) ∈ R. Then,
(a, b) ∈ R
⇒ |a – b| is a multiple of 4
⇒ |a – b| = 4k for some k ∈ N
⇒ |b – a| = 4k for some k ∈ N
⇒ (b, a) ∈ R
So, R is symmetric.
Transitive: Let (a, b) ∈ R and (b, c) ∈ R. Then,
⇒ |a – b| is a multiple of 4 and |b – c| is a multiple of 4
⇒ |a – b| = 4k and |b – c| = 4m for some k, m ∈ N
⇒ a – b = ± 4k and b – c = ± 4m
⇒ a – c = ± 4k ± 4m
⇒ a – c is a multiple of 4
⇒ |a – c| is a multiple of 4
⇒ (a, c) ∈ R
So, R is transitive.
Hence, R is an equivalence relation.
Q.14 Determine whether the following relation is reflexive, symmetric and transitive: Relation R on the set N of all natural numbers is defined as
R = {(x, y): y = x + 5 and x < 4}
Ans
R = {(x, y): y = x + 5 and x < 4}
∴ R = {(1, 6), (2, 7), (3, 8)}
Reflexivity: (1, 1), (2, 2) etc. are not in R. So, R is not reflexive.
Symmetry: (1, 6) ∈ R but (6, 1) ∉ R. So, R is not symmetric.
Transitivity: Since (1, 6) ∈ R and there is no ordered pair in R which has 6 as the first element. Same is the case for (2, 7) and (3, 8). So, R is not transitive.
Q.15 Show that 1/x is the inverse of x ≠ 0 for the multiplication operation on R.
Ans
We know that x X (1/x) = 1 (Identity for ‘x’). So, 1/x is the multiplicative inverse of x.
Q.16 Let f = {(3, 1), (2, 3), (1, 2)}, find f -1 if f is one-one and onto.
Ans f is invertible. So, f -1 = {(1, 3), (3, 2), (2, 1)}.
Q.17
Ans
Q.18 A relation R in a set A is called …, if no element of A is elated to any element of A.
AnsEmpty Relation
Q.19 A relation R in a set A is called …, if each element of A is elated to every element of A.
AnsUniversal Relation
Q.20 Name the relation R in a set A satisfying the condition (a, a) ∈ R, for every a ∈ A.
Ans
The relation R is reflexive.
Q.21 Name the relation R in a set A satisfying the condition (a1, a2) ∈ R ⇒ (a2, a1) ∈ R for all (a1, a2) ∈ A.
Ans
The relation R is symmetric.
Q.22 R is a relation in a set {1, 2, 4} given by R = {(1, 1), (2, 2), (4, 4)}. State whether R is reflexive or symmetric.
Ans
R is reflexive. [ (a, a) ε R, for every a ε {1, 2, 4}]
Q.23 Let f: R
R; f(x) = sinx and g: R
R; g(x) = x2, find fog and gof.
AnsClearly, fog and gof both exist.
Now, (gof)(x) = g(f(x)) = g(sinx) = (sinx)2 = sin2x.
And, (fog)(x) = f(g(x)) = f(x2) = sinx2.
Q.24 If f is one-one and onto, then what is f -1o f ?
Ans
f -1of = If
Q.25 Let * be a binary operation on set Q of rational numbers as follows:
a*b = (a-b)2 . Is this operation commutative?
Ans
a*b = (a-b)2
b*a = (b-a)2
(a-b)2 = (b-a)2
Therefore, a*b = b*a
So, the given operation is commutative.
Q.26
Ans
Q.27
Ans
Q.28 Let * be a binary operation defined by a*b=2a+b+ab+1. Find 3*5.
Ans
Given that
a*b = 2a+b+ab+1
⇒ 3*5 = 2×3+5+3×5+1
= 6+5+15+1
= 27
Q.29
Ans
Q.30
Ans
Q.31 Let A = {1, 2, 3, 8}, B = {4, 5, 6} and let f = {(1, 4), (2, 5), (3, 6)} be defined from A to B. Show that f is not a function from A to B.
AnsSince there is no image in set B for every element of set A (that is, element 8 of set A has no image in set B), therefore, f is not a function from set A to set B.
Q.32 Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. Show that f is one-one.
Ans
Since every element of set A has only one image in set B, that is 1→ 4, 2→ 5, 3→ 6, therefore, f is one-one function.
Q.33 Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 4), (3, 6)} be a function from A to B. Show that f is many one.
Ans
Since elements 1 and 2 have same image 4 in set B, (1→ 4, 2→ 4, 3→ 6 ), therefore, f is many one function.
Q.34 Let A = {1, 2}, B = {4, 5, 6} and let f = {(1, 4), (2, 5), (2, 6)} be a function from A to B. Show that f is not a function.
Ans
Since every element of set A has no unique image in set B, that is, element 2 has two images 5 and 6 in set B (1→ 4, 2→ 5, 2→ 6), therefore, f is not a function.
Q.35 If Set A has 2 elements and Set B has 3 elements, find the number of relations defined from Set A to Set B.
Ans
Since number of elements in set A = 2
Number of elements in set B = 3
∴ Number of elements in set (AXB) = 2
3=6
The number of all possible subsets of Set (AXB) = 26
⇒ The number of relations defined from Set A to Set B is 26 = 64.
Q.36
Ans
Q.37
Ans
Q.38
Ans
Q.39
Ans

Q.40
Ans
Q.41
Ans
![]()
Q.42
Ans
Q.43
Ans
Q.44
Ans
Q.45 Consider the binary operation ∧ on the set {1, 2, 3, 4, 5} defined by a∧b = min {a, b}. Write the operation table of the operation ∧.
Ans
Since a*b = min {a, b}
⇒1*1 = min {1,1} = 1
⇒ 1*2 = min {1,2} = 1
⇒ 1*3 = min {1,3} = 1
⇒ 1*4 = min {1,4} = 1
⇒ 1*5 = min {1,5} = 1
⇒ 2*1 = min {2,1} = 1
⇒ 2*2 = min {2,2} = 2
⇒ 2*3 = min {2,3} = 2
⇒ 2*4 = min {2,4} = 2
⇒ 2*5 = min {2,5} = 2
⇒3*1 = min {3,1} = 1
⇒3*2 = min {3,2} = 2
⇒3*3 = min {3,3} = 3
⇒3*4 = min {3,4} = 3
⇒3*5 = min {3,5} = 3
⇒ 4*1 = min {4,1} = 1
⇒ 4*2 = min {4,2} = 2
⇒ 4*3 = min {4,3} = 3
⇒ 4*4 = min {4,4} = 4
⇒ 4*5 = min {4,5} = 4
⇒ 5*1 = min {5,1} = 1
⇒ 5*2 = min {5,2} = 2
⇒ 5*3 = min {5,3} = 3
⇒ 5*4 = min {5,4} = 4
⇒ 5*5 = min {5,5} = 5
Thus, operation table of operation (*) calculated above is
| * | 1 | 2 | 3 | 4 | 5 |
| 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 2 | 2 | 2 | 2 |
| 3 | 1 | 2 | 3 | 3 | 3 |
| 4 | 1 | 2 | 3 | 4 | 4 |
| 5 | 1 | 2 | 3 | 4 | 5 |
Q.46 Consider the binary operation * on the set {1, 2, 3, 4, 5} given by the following multiplication table. Using this table compute
| * | 1 | 2 | 3 | 4 | 5 |
| 1 | 1 | 1 | 1 | 1 | 1 |
| 2 | 1 | 2 | 1 | 2 | 1 |
| 3 | 1 | 1 | 3 | 1 | 1 |
| 4 | 1 | 2 | 1 | 4 | 1 |
| 5 | 1 | 1 | 1 | 1 | 5 |
(i) (3*4)*5.
(ii) 3*(4*5).
(iii) (2*3)*(4*5).
(iv) if * is commutative.
Ans
We have
(i) (3*4)*5 = 1*5 [Since, 3*4=1] =1
(ii) 3*(4*5) = 3*1 [Since, 4*5=1] =1
(iii) (2*3)*(4*5) = 1*1 [∴2*3=1 and 4*5=1] =1
(iv) Since (2*5)=1 and (5*2)=1
⇒(2*5) = (5*2)
⇒ Operation * is commutative.
Q.47 Show that addition, subtraction and multiplication are binary operations on R, but division is not a binary operation on R. Further, show that division is a binary operation on the set R of non-zero real numbers.
Ans
Q.48
Ans
Q.49
Ans
Q.50
Ans
Q.51
Ans
Q.52
Ans
Q.53
Ans
Q.54
Ans
Q.55 Let A = {2, 3, 4}, B = {5, 6, 7, 9} and let f = {(1, 4), (3, 6), (4, 7)} be a function from A to B, then function is ______________.
Ans
Since, every element of set A has only one image in set B i.e., 2→5, 3→6 and 4→7. Therefore, f is one-one function.
FAQs (Frequently Asked Questions)
Extramarks, an online learning platform, provides informative and detailed notes that students must use to prepare for their exams. The Class 12 Mathematics Chapter 1 notes are prepared by subject matter experts in an easy language and stepwise manner. The chapter’s important questions and key points are included in these CBSE Solutions. Students can quickly glance through important formulas, properties, theorems and derivations with some examples. The class 12 Mathematics notes Chapter 1 through all chapters will be students’ helping guide in the preparation. Visit Extramarks and make learning fun!
No. The first chapter of Mathematics Class 12 is quite easy. There are several problems bifurcated into four exercises that help students gain a deeper understanding and ace the chapter. The answers to these exercise problems are available on the Extramarks platform. Students must also include the Class 12 Mathematics Chapter 1 notes in their preparation for a better understanding