Chapter 1: Relations and Functions

Class 12 Mathematics notes: summary, key points, important questions and MCQs.

  • Class 12
  • Mathematics
  • Chapter 1
  • CBSE 2026–27
  • Last updated: 18 Nov 2026

Chapter summary

Class 12 Maths Chapter 1 Relations and Functions is the first chapter of the NCERT Class 12 Mathematics Part I textbook and opens Unit I of the CBSE 2026-27 syllabus. The chapter studies relations in a set, that is, subsets of A × A, and sorts them by three properties: reflexive, symmetric and transitive. A relation with all three is an equivalence relation, and its equivalence classes split the set into disjoint pieces, as congruence modulo 3 splits the integers into three classes.

The second half of the chapter deals with types of functions: one-one (injective), onto (surjective) and bijective. Students learn to prove one-one by starting from f(x1) = f(x2), and to prove onto by solving y = f(x) and checking that x lies in the domain. As per the CBSE 2026-27 syllabus, composition of functions and invertible functions are not examined. Use the notes, important questions and MCQs on this page for quick revision before unit tests and board exams.

Key points and definitions

  • A relation R in a set A is any subset of A × A; a set with n elements has 2^(n²) relations.
  • The empty relation (no pairs) and the universal relation (A × A) are called trivial relations.
  • Reflexive: (a, a) ∈ R for every a in A, not just for the elements that appear in R.
  • Symmetric: (a, b) ∈ R implies (b, a) ∈ R. Transitive: (a, b) ∈ R and (b, c) ∈ R imply (a, c) ∈ R.
  • To show a property fails, one concrete counter-example is enough; to show it holds on an infinite set, give a general argument.
  • An equivalence relation is reflexive, symmetric and transitive; its equivalence classes are pairwise disjoint and their union is the whole set.
  • Congruence modulo n on Z is an equivalence relation with exactly n classes [0], [1], ..., [n − 1].
  • One-one (injective): f(x1) = f(x2) implies x1 = x2. A function that is not one-one is many-one.
  • Onto (surjective): every element of the co-domain has a pre-image, i.e. range = co-domain. A function that is not onto is an into function.
  • A bijective function is both one-one and onto; the number of bijections from an n-element set to itself is n!.
  • The same rule can change type with the domain: f(x) = x² is one-one on N but not on Z or R.
  • For a finite set X, a function f : X → X is one-one if and only if it is onto; this fails for infinite sets (f(x) = 2x on N).

Important questions

  1. Check whether R = {(1,1), (2,2), (3,3), (4,4), (1,2), (2,1), (2,3), (3,2)} in A = {1, 2, 3, 4} is reflexive, symmetric and transitive.

    Reflexive, since (a, a) is present for all four elements. Symmetric, since (1,2), (2,1) and (2,3), (3,2) come in pairs. Not transitive: (1,2) and (2,3) are in R but (1,3) is not.

  2. Show that R = {(a, b) : 3 divides a − b} is an equivalence relation in Z.

    Reflexive: a − a = 0 = 3·0. Symmetric: if a − b = 3k then b − a = 3(−k). Transitive: if a − b = 3k and b − c = 3m then a − c = 3(k + m). So R is an equivalence relation with three classes [0], [1], [2].

  3. In A = {0, 1, 2, ..., 10}, R = {(a, b) : |a − b| is a multiple of 4}. Find [2] and all the equivalence classes.

    [2] = {2, 6, 10}. The classes are {0, 4, 8}, {1, 5, 9}, {2, 6, 10} and {3, 7}; they are disjoint and together give A.

  4. Is R = {(a, b) : a ≤ b + 1} on R reflexive, symmetric or transitive?

    Reflexive, since a ≤ a + 1. Not symmetric: (0, 5) ∈ R but (5, 0) ∉ R. Not transitive: (3, 2) and (2, 1) are in R but (3, 1) is not, since 3 > 2.

  5. Give an example of a relation in {1, 2, 3} that is symmetric and transitive but not reflexive.

    R = {(1,1), (2,2), (1,2), (2,1)}. It is symmetric and transitive, but (3, 3) ∉ R, so it is not reflexive.

  6. Show that f : R → R, f(x) = 5x − 7 is bijective.

    One-one: 5x1 − 7 = 5x2 − 7 gives x1 = x2. Onto: for any real y, x = (y + 7)/5 is real and f(x) = y. Hence f is bijective.

  7. Let A = R − {2}, B = R − {3} and f(x) = (3x + 1)/(x − 2). Show that f : A → B is one-one and onto.

    One-one: cross-multiplying f(x1) = f(x2) gives −6x1 + x2 = −6x2 + x1, so x1 = x2. Onto: for y ≠ 3, x = (2y + 1)/(y − 3) is real, and x = 2 would need 2y + 1 = 2y − 6, which is impossible. So x ∈ A and f(x) = y.

  8. Is f : R → R, f(x) = x² + 2x one-one? Is it onto?

    Not one-one, since f(0) = f(−2) = 0. Not onto, since f(x) = (x + 1)² − 1 ≥ −1, so −2 has no pre-image.

  9. Show that R = {(a, b) : ab ≥ 0} in Z is not an equivalence relation.

    R is reflexive (a² ≥ 0) and symmetric (ab = ba), but not transitive: (1, 0) and (0, −1) are in R, while 1·(−1) = −1 < 0, so (1, −1) ∉ R.

  10. Show that R = {(a, b) : 5 divides 2a + 3b} in Z is an equivalence relation and find the number of classes.

    Since 2a + 3b = 2(a − b) + 5b and 5 does not divide 2, 5 | 2a + 3b exactly when 5 | a − b. So R is congruence modulo 5, which is reflexive, symmetric and transitive, with 5 classes [0], [1], [2], [3], [4].

MCQs with answers

  1. The relation R = {(1,1), (2,2), (3,3), (1,3), (3,1), (2,3)} in {1, 2, 3} is

    1. reflexive and symmetric
    2. reflexive and transitive
    3. reflexive only
    4. an equivalence relation
    Show answer

    Answer: (c) reflexive only

  2. The number of equivalence relations in {1, 2, 3} containing the pair (1, 2) is

    1. 1
    2. 2
    3. 3
    4. 4
    Show answer

    Answer: (b) 2

  3. The function f : R → R, f(x) = x|x| is

    1. one-one but not onto
    2. onto but not one-one
    3. bijective
    4. neither one-one nor onto
    Show answer

    Answer: (c) bijective

  4. The number of one-one functions from {1, 2, 3} to {a, b, c, d, e} is

    1. 15
    2. 60
    3. 125
    4. 243
    Show answer

    Answer: (b) 60

  5. The number of relations in a set with 3 elements is

    1. 9
    2. 27
    3. 64
    4. 512
    Show answer

    Answer: (d) 512

Download full PDF notes

Chapter Note

Frequently asked questions

  • What are the important topics in Class 12 Maths Chapter 1 Relations and Functions?

    Types of relations (reflexive, symmetric, transitive), equivalence relations and equivalence classes, and one-one, onto and bijective functions. Proving that a relation is an equivalence relation and that a function is bijective are the most common long questions.

  • Are composition of functions and invertible functions in the Class 12 Maths 2026-27 syllabus?

    No. The CBSE 2026-27 syllabus for this chapter lists only types of relations (reflexive, symmetric, transitive and equivalence relations) and one-one and onto functions.

  • How many marks does Relations and Functions carry in the Class 12 Maths board exam?

    Unit I, Relations and Functions, carries 8 marks out of 80 in the CBSE 2026-27 syllabus. This unit includes both Relations and Functions and Inverse Trigonometric Functions.

  • Where can I download Class 12 Maths Chapter 1 Relations and Functions notes PDF?

    The free chapter notes PDF is listed on this chapter page, with 15 worked examples and 12 board-pattern questions with answers.

  • How do you prove a function is onto in Class 12?

    Take any y in the co-domain, solve y = f(x) for x, and check that this x lies in the domain. If some y has no such x, the function is not onto.

  • More Class 12 Mathematics chapters