Class 12 (CBSE) · Mathematics

Relations and Functions

26 practice questions with full step-by-step solutions, quick revision notes, plus a concept-first explainer — free, no sign-up.

Reviewed by (19 years teaching)Written with AI helpReport a mistake

What you'll learn

A friendly, from-scratch tour of relations (reflexive, symmetric, transitive, equivalence) and functions (one-one, onto, bijective), plus how to compose functions and find inverses — with fully worked examples for CBSE Class 12.

Read Relations and Functions, Made Simple

This chapter has

7
easy
12
medium
7
hard

Relations and Functions — quick revision notes

This chapter covers types of relations (empty, universal, reflexive, symmetric, transitive and equivalence) with equivalence classes, and types of functions (one-one, onto and bijective) as prescribed in the CBSE syllabus. CBSE asks direct MCQs on identifying properties and counting relations and functions, assertion-reason items, and longer proofs that a relation is an equivalence relation or a function is a bijection.
  • A relation R from A to B is a subset of A × B. If n(A) = m and n(B) = n, the number of relations from A to B is 2mn; on a set with n elements it is 2n², e.g. 2⁴ = 16 when n = 2.
  • Empty relation: no element is related to any element (R = ∅). Universal relation: every element is related to every element (R = A × A). Both are called trivial relations.
  • Reflexive: (a, a) ∈ R for every a ∈ A. Symmetric: (a, b) ∈ R ⇒ (b, a) ∈ R. Transitive: (a, b) ∈ R and (b, c) ∈ R ⇒ (a, c) ∈ R. An equivalence relation has all three properties.
  • Counting on a set of n elements: reflexive relations 2n² − n (64 for n = 3); symmetric relations 2n(n + 1)/2 (8 for n = 2). On {1, 2, 3} there are exactly 5 equivalence relations.
  • An equivalence relation splits A into disjoint equivalence classes whose union is A. Example: on Z, a R b ⇔ 2 divides (a − b) gives two classes, the even integers [0] and the odd integers [1].
  • One counter-example is enough to disprove a property. R = {(a, b): a ≤ b²} on R is not reflexive (a = 1/2), not symmetric ((1, 2) ∈ R but (2, 1) ∉ R) and not transitive ((3, 2) and (2, 1.5) ∈ R but (3, 1.5) ∉ R).
  • One-one (injective): f(x₁) = f(x₂) ⇒ x₁ = x₂. Onto (surjective): range = codomain. Bijective = one-one and onto. Examples: f(x) = x³ on R is bijective; f(x) = x² on N is one-one but not onto; on R it is neither.
  • Counting functions from A (m elements) to B (n elements): total functions nᵐ; one-one functions n!/(n − m)! when m ≤ n (none when m > n); bijections n! when m = n.
  • Domain and codomain matter: f(x) = 2x is a bijection from R to R but only one-one (not onto) from N to N.

Common mistakes to avoid

  • Declaring a relation reflexive because some pairs (a, a) are present. Every element of the set must be related to itself.
  • Assuming a relation is not transitive just because pairs are missing. Check every chain (a, b), (b, c); a relation with no such chain is transitive by default.
  • Thinking symmetric + transitive implies reflexive. It does not, because an element may be related to nothing.
  • Ignoring the codomain while testing onto: f(x) = x² is onto from R to [0, ∞) but not from R to R.
  • Using mⁿ instead of nᵐ for the number of functions from an m-element set to an n-element set.
Exam tip: Test each property in one line with general elements, or disprove it with one specific counter-example written out in full; examiners give marks for the counter-example.

Relations and Functions — solved practice questions

7 Class 12 Mathematics questions with step-by-step solutions. Attempt each, then reveal the answer.

These worked examples are not in the timed test, so you can study them first.

  1. Q1easyReport

    On the set A = {1, 2, 3}, the relation R = {(1,1),(2,2),(3,3),(1,2),(2,1)} is:

    • ASymmetric and transitive but not reflexive
    • BReflexive only
    • CReflexive and symmetric but not transitive
    • DAn equivalence relation
    Show answer & solution

    Correct answer: (D) An equivalence relation

    R contains all pairs (a,a) so it is reflexive; (1,2) and (2,1) are both present so it is symmetric; the only new composition (1,2)&(2,1) gives (1,1), already present, so it is transitive. Hence R is an equivalence relation.
  2. Q2easyReport

    The function f: R -> R defined by f(x) = 3x + 5 is:

    • ANeither one-one nor onto
    • BOnto but not one-one
    • COne-one but not onto
    • DBijective (both one-one and onto)
    Show answer & solution

    Correct answer: (D) Bijective (both one-one and onto)

    A non-constant linear function is one-one (distinct x give distinct outputs) and onto R (every real y is achieved at x = (y-5)/3). Therefore f is bijective.
  3. Q3easyReport

    The number of one-one functions from a set containing 3 elements to itself is:

    • A3
    • B6
    • C27
    • D9
    Show answer & solution

    Correct answer: (B) 6

    A one-one function from a 3-element set to itself is a permutation, so the count is 3! = 6.
  4. Q4easyReport

    The function f: R -> R given by f(x) = x2 is:

    • AOnto but not one-one
    • BOne-one and onto
    • COne-one but not onto
    • DNeither one-one nor onto
    Show answer & solution

    Correct answer: (D) Neither one-one nor onto

    f(-2) = f(2) = 4 shows it is not one-one, and no negative number is an image so it is not onto R. Hence f is neither one-one nor onto.
  5. Q5mediumReport

    The number of equivalence relations that can be defined on the set {1, 2, 3} is:

    • A8
    • B6
    • C4
    • D5
    Show answer & solution

    Correct answer: (D) 5

    Equivalence relations on a set correspond one-to-one with its partitions. The set {1,2,3} has 5 partitions (Bell number B3 = 5), so there are 5 equivalence relations.
  6. Q6mediumReport

    On the set of integers Z, the relation R defined by a R b if and only if (a - b) is divisible by 5 is:

    • AAn equivalence relation
    • BReflexive and symmetric but not transitive
    • COnly symmetric
    • DOnly reflexive
    Show answer & solution

    Correct answer: (A) An equivalence relation

    a - a = 0 is divisible by 5 (reflexive); if 5 | (a-b) then 5 | (b-a) (symmetric); if 5 | (a-b) and 5 | (b-c) then 5 | (a-c) (transitive). Hence R is an equivalence relation.
  7. Q7mediumReport

    The number of onto (surjective) functions from a set of 3 elements to a set of 2 elements is:

    • A9
    • B8
    • C6
    • D7
    Show answer & solution

    Correct answer: (C) 6

    Total functions = 23 = 8; subtract the 2 functions that map everything to a single element. So onto functions = 8 - 2 = 6.

Ready to test yourself? Take the 19-question Relations and Functions test →