Skip to main content
Class 12 · Chapter 1 · Relations and Functions unit (8 of 80 marks)

Relations and Functions Class 12: notes and important questions

Revision notes, 39 board-style questions with the step marks shown, and a four-step route from the basics to 95+, each step ending in a short checkpoint.

  • 39 questions
  • 12 multiple choice, 3 assertion–reason, 8 very short answer, 8 short answer, 5 long answer, 3 case study
  • About 12 hours to master

Relations and Functions unit: 8 of 80 theory marks (Relations and Functions and Inverse Trigonometric Functions).

Revision notes

Relations and Functions — revision notes

1. Relations

A relation \(R\) on a set \(A\) is a subset of \(A \times A\). For \(A\) with \(n\) elements there are \(2^{n^2}\) relations.

  • Reflexive: \((a, a) \in R\) for every \(a \in A\).
  • Symmetric: \((a, b) \in R \Rightarrow (b, a) \in R\).
  • Transitive: \((a, b), (b, c) \in R \Rightarrow (a, c) \in R\).
  • Equivalence: all three. Empty relation: symmetric and transitive (vacuously), not reflexive on a non-empty set. Universal relation \(A \times A\): equivalence.

2. Equivalence classes

\([a] = \{x \in A : x\,R\,a\}\). Two classes are either identical or disjoint, and together they cover \(A\) (a partition). Example: “\(a - b\) divisible by \(m\)” on \(\mathbb{Z}\) has \(m\) classes (remainders \(0, 1, \ldots, m - 1\)).

3. Functions

  • One-one (injective): \(f(x_1) = f(x_2) \Rightarrow x_1 = x_2\). Test: solve \(f(x_1) = f(x_2)\); or find two different inputs with the same output to disprove. A strictly increasing/decreasing function is one-one.
  • Onto (surjective): range \(=\) codomain. Test: for arbitrary \(y\) in the codomain, solve \(y = f(x)\) and check that \(x\) lies in the domain.
  • Bijective: one-one and onto.
  • Counting (\(|A| = m\), \(|B| = n\)): functions \(n^m\); one-one functions \(n(n-1)\cdots(n-m+1)\) if \(m \le n\), else \(0\); onto functions from a \(3\)-set to a \(2\)-set: \(2^3 - 2 = 6\).

Worked example 1

On \(\{1, \ldots, 6\}\), \(a\,R\,b \iff 3 \mid (a - b)\): classes \(\{1, 4\}, \{2, 5\}, \{3, 6\}\).

Worked example 2

\(f : \mathbb{R} \to \mathbb{R}\), \(f(x) = 4 - 3x\): \(f(x_1) = f(x_2) \Rightarrow x_1 = x_2\) (one-one); for any \(y\), \(x = \dfrac{4 - y}{3}\) works (onto). Bijective.

Worked example 3

\(f : \mathbb{N} \to \mathbb{N}\), \(f(n) = n^2 + 1\): one-one (as \(n > 0\)), not onto (\(1\) and \(3\) have no pre-image).

Common errors

  • Checking reflexivity for only the elements that appear in \(R\) instead of all of \(A\).
  • Showing onto by solving for \(x\) but not checking that \(x\) lies in the domain (e.g. \(x \in \mathbb{N}\), \(x \ne 2\)).
  • Forgetting that the answer depends on the domain and codomain: \(x^2\) is not one-one on \(\mathbb{R}\) but is one-one on \([0, \infty)\).
  • Giving an “example” instead of a proof when asked to show a property holds; a single counter-example is enough only to show it fails.

Board-exam tips

  • Write each of reflexive, symmetric, transitive under its own heading with a one-line reason.
  • For a “not” answer, always give a specific counter-example pair.
  • Composite and inverse functions are not in the current syllabus — do not spend time on \(g \circ f\) or \(f^{-1}\).

Topics in this chapter: Types of relations · Counting relations and functions · Equivalence relations and equivalence classes · One-one and onto functions.

Route to 95: four steps

Work through the steps in order. Take each checkpoint closed book, about 1.5 minutes per mark; pass at 80% to move on. Two misses in a row means going back one step.

Step 1

Secure the basics

You can test a relation for reflexive, symmetric and transitive and tell whether a function is one-one or onto.

Read first: 1. Relations; 3. Functions 13 practice questions · checkpoint: 4 questions, 7 marks, pass 80%
Practise step 1
Step 2

Board standard

You can prove equivalence relations, write equivalence classes, count relations and functions, and prove one-one or onto properly.

Read first: 1. Relations; 2. Equivalence classes; 3. Functions; Worked examples 1-3 14 practice questions · checkpoint: 4 questions, 11 marks, pass 80%
Practise step 2
Step 3

Full marks on long answers

You can write the 5-mark relation and function proofs in full, with a heading and reason for each property and counter-examples where needed.

Read first: 2. Equivalence classes; 3. Functions; Board-exam tips 6 practice questions · checkpoint: 3 questions, 14 marks, pass 80%
Practise step 3
Step 4

95+ stretch (HOTS)

You can handle bijection proofs on restricted domains, tricky counting of relations and the hardest assertion-reason items.

Read first: 3. Functions; Common errors 6 practice questions · checkpoint: 3 questions, 9 marks, pass 80%
Practise step 4

Practice questions

Original questions in the board's styles. Multiple-choice answers are checked as you go; for written answers, compare your working with the step mark scheme and record your marks. 3 of the 39 are competency-based (case studies and questions set in a real-life situation): the "Competency-based" button shows just those.

Q1·1 mark·Assertion–reasonTypes of relations

In the following question, a statement of Assertion (A) is followed by a statement of Reason (R). Choose the correct option.

Assertion (A): The relation \(R = \{(x, y) : x + y = 10\}\) on \(\mathbb{N}\) is symmetric.

Reason (R): For all natural numbers \(x, y\), \(x + y = y + x\).

  1. (a)Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
  2. (b)Both Assertion (A) and Reason (R) are true but Reason (R) is not the correct explanation of Assertion (A).
  3. (c)Assertion (A) is true but Reason (R) is false.
  4. (d)Assertion (A) is false but Reason (R) is true.
Q2·2 marks·Very short answerTypes of relations

Five seats in a row are numbered \(1\) to \(5\). On \(A = \{1, 2, 3, 4, 5\}\) define \(a\,R\,b\) if seats \(a\) and \(b\) are the same seat or next to each other, i.e. \(|a - b| \le 1\). Determine whether \(R\) is reflexive, symmetric or transitive.

Q3·2 marks·Very short answerEquivalence relations and equivalence classes

On \(\mathbb{Z}\), \(a\,R\,b \iff |a| = |b|\). Show that \(R\) is an equivalence relation and write the equivalence class of \(-3\).

Where marks are lost in Relations and Functions

  • Checking reflexivity only for elements that appear in R. Fix: check (a, a) for every a in the set A and say so.
  • Proving onto by solving for x without checking that x lies in the domain. Fix: after x = (4 − y)/3, write 'x ∈ ℝ for every y ∈ ℝ' (or check x ∈ ℕ, x ≠ 2, as needed).
  • Showing a property holds with an example instead of a proof. Fix: use general a, b, c for 'holds'; use one specific counter-example pair only for 'does not hold'.
  • Forgetting that one-one and onto depend on the domain and codomain. Fix: copy the domain and codomain into your first line and use them.
  • Transitive proofs that skip the algebra linking the two conditions. Fix: write 'aRb and bRc ⇒ … ⇒ aRc' with the working on each arrow.
  • Spending time on composition or inverse of functions. Fix: they are out of the current syllabus; focus on types of relations, equivalence classes and one-one/onto.

Relations and Functions in our sample papers

Once step 3 is passed, test the chapter inside a full timed paper on the 2026-27 pattern (original papers by us, not official CBSE papers).