Class 12 Maths · Chapter 1 · Bihar Board

Relations & Functions

Learn with visual diagrams, step-by-step solutions with marking scheme, MCQs, Assertion-Reasoning questions, and previous year questions.

8 Visual Diagrams Step Marking A-R Questions
20MCQs
10Assertion-Reason
8PYQs
8Diagrams
Section 01

Basic Concepts

What is a relation? What is a function? Let's start from the beginning with visuals.

1.1 Introduction to Relations

A relation connects elements of one set to elements of another set. If A and B are two non-empty sets, then any subset of A × B is called a relation from A to B.

Definition — Relation

Let $A$ and $B$ be two non-empty sets. Then a relation $R$ from $A$ to $B$ is a subset of $A \times B$, i.e., $R \subseteq A \times B$.

If $(a, b) \in R$, we write $a \ R \ b$ and say "a is related to b under R".

1.2 Domain, Range and Codomain

For a relation $R$ from set $A$ to set $B$:

  • Domain of R = $\{a \in A : (a, b) \in R \text{ for some } b \in B\}$
  • Range of R = $\{b \in B : (a, b) \in R \text{ for some } a \in A\}$
  • Codomain of R = the entire set $B$
Memory Trick — D-C-R

Domain → Codomain → Range

  • Domain = all first elements (from A)
  • Codomain = the whole set B
  • Range = only those b's that are actually used
  • Range ⊆ Codomain always

1.3 Types of Relations

There are 5 main types of relations. Let's visualize each one.

TypeConditionMeaning
Empty Relation$R = \phi$No element is related to any other
Universal Relation$R = A \times A$Every element related to every element
Reflexive$(a, a) \in R \ \forall a$Every element related to itself
Symmetric$(a, b) \in R \Rightarrow (b, a) \in R$Bidirectional
Transitive$(a, b), (b, c) \in R \Rightarrow (a, c) \in R$Chain property
Equivalence Relation

A relation $R$ is an equivalence relation if it is Reflexive + Symmetric + Transitive.

1.4 Types of Functions

A function $f: A \to B$ is a special relation where every element of A has exactly one image in B.

1. One-One (Injective)

Distinct elements of A have distinct images in B.

$$f(x_1) = f(x_2) \Rightarrow x_1 = x_2$$

2. Onto (Surjective)

Every element of B is the image of some element of A.

$$\forall y \in B, \ \exists x \in A : f(x) = y$$

3. Bijective (One-One + Onto)

Both one-one and onto. Only bijective functions have an inverse.

Section 02

🎨 Visual Learning

Understand every concept with clear diagrams

V1 Relation as a Subset of A × B

A Relation R ⊆ A × B Set A 1 2 3 Set B a b c R = {(1,a), (2,c), (3,b)}
Each arrow represents an ordered pair in the relation R. Here, R contains 3 pairs. The relation R is a subset of A × B.

V2 Reflexive Relation

Every element related to itself Set A a b c (a,a), (b,b), (c,c) ∈ R → Reflexive
Every element points back to itself (self-loops). If ANY of these is missing → Not reflexive.

V3 Symmetric Relation

Bidirectional arrows Set A a b c (a,b) ∈ R → (b,a) ∈ R ✓ | (b,c) ∈ R → (c,b) ∈ R ✓
If there's an arrow a → b, there must also be b → a. This is the "mirror" property.

V4 Transitive Relation

Chain property Set A a b c a → b and b → c ⟹ a → c must exist (dashed orange)
If a is related to b, and b is related to c, then a MUST be related to c. The orange dashed arrow shows the required "shortcut".

V5 One-One (Injective) Function

Distinct inputs → Distinct outputs Domain X 1 2 3 Codomain Y a b c d One-One ✓ | Not Onto ✗ (element 'd' unused)
No two inputs share the same output. But 'd' in codomain has no arrow → not onto.

V6 Onto (Surjective) Function

Every codomain element is hit Domain X 1 2 3 Codomain Y a b Not One-One ✗ (1 & 2 → a) | Onto ✓
Every element of codomain has at least one arrow. But 'a' receives two arrows → not one-one.

V7 Bijective Function (One-One + Onto)

Perfect pairing — invertible Domain 1 2 3 Codomain a b c One-One ✓ + Onto ✓ = Bijective ✓ | Inverse exists
Each input paired with exactly one unique output, and no output is left unused. This is invertible.

V8 Composition of Functions (gof)

Function chaining A x B f(x) C g(f(x)) f g gof (direct composition)
$(gof)(x) = g(f(x))$ — first apply $f$, then apply $g$. The shortcut arrow shows the combined effect.
Shortcut Section

💡 Tricks & Shortcuts

Speed techniques to solve problems faster in board exams

Trick 1 — Reflexive Check

To check reflexivity, just scan for (1,1), (2,2), (3,3)... in the relation.

  • If all diagonal pairs present → Reflexive ✓
  • If any diagonal pair missing → Not Reflexive ✗
Trick 2 — Symmetric Check (Mirror Rule)

For every pair $(a, b)$, check if $(b, a)$ is also present.

  • Mirror Rule: Flip every pair — should still be in R.
  • Diagonal pairs like (1,1) are automatically symmetric.
Trick 3 — Transitive Check (Chain Rule)

Look for chains: If $a \to b$ and $b \to c$ both exist, then $a \to c$ must exist.

  • Draw arrows. Follow the path. Check if the shortcut arrow exists.
  • Relations with ≤, <, ≥, > on real numbers are usually transitive.
Trick 4 — Equivalence Relation Fast Check

All three must hold: Reflexive + Symmetric + Transitive.

  • If defined by "same X" (same place, same pages) → Always equivalence
  • If defined by "divisible by n" → Always equivalence
  • If defined by "≤" or "<" → Not symmetric
Trick 5 — One-One Test (Horizontal Line)

On a graph, apply the Horizontal Line Test:

  • Any horizontal line cuts at more than one point → NOT one-one
  • Every horizontal line cuts at most once → one-one ✓
Trick 6 — Counting Formulas

For set $A$ with $n$ elements and set $B$ with $m$ elements:

  • Total relations = $2^{nm}$
  • Total functions = $m^n$
  • One-one functions = ${}^m P_n = \frac{m!}{(m-n)!}$
Trick 7 — Bijective Shortcut

For finite sets with $n(A) = n(B)$:

  • Just check one of (one-one / onto) — the other follows automatically
Trick 8 — Composition Order

"Right first, then left" — $gof$ means apply $f$ first, then $g$.

Trick 9 — Inverse Function Shortcut

To find $f^{-1}$: Swap $x$ and $y$, solve for $y$, replace with $f^{-1}(x)$.

Trick 10 — Range = Codomain

For a function to be onto, its range must equal its codomain. If any codomain element is "missed", it's not onto.

Practice

📝 Solved Examples with Step Marking

Click "Show Answer" to reveal step-by-step solutions with marks for each step

📋 Total: 3 Marks · Board Pattern

Q1. Show that the relation $R$ in the set $\mathbb{Z}$ of integers given by $R = \{(a, b) : 2 \text{ divides } a - b\}$ is an equivalence relation.

Step 1 — Reflexive 1 Mark

For any $a \in \mathbb{Z}$, we have $a - a = 0$, and $2$ divides $0$.

So, $(a, a) \in R$ for all $a \in \mathbb{Z}$.

Therefore, $R$ is reflexive. ✓

Step 2 — Symmetric 1 Mark

Suppose $(a, b) \in R$. Then $2$ divides $(a - b)$.

Since $b - a = -(a - b)$, we have $2$ divides $(b - a)$ also.

So $(b, a) \in R$. Therefore, $R$ is symmetric. ✓

Step 3 — Transitive 1 Mark

Suppose $(a, b) \in R$ and $(b, c) \in R$. Then $2 | (a - b)$ and $2 | (b - c)$.

Now, $a - c = (a - b) + (b - c)$, which is divisible by $2$.

So $(a, c) \in R$. Therefore, $R$ is transitive. ✓

Since $R$ is reflexive, symmetric, and transitive — $R$ is an equivalence relation.
📋 Total: 3 Marks · Board Pattern

Q2. Show that $f: \mathbb{R} \to \mathbb{R}$ given by $f(x) = 2x$ is one-one and onto.

Step 1 — One-One 1.5 Marks

Let $x_1, x_2 \in \mathbb{R}$ such that $f(x_1) = f(x_2)$.

Then $2x_1 = 2x_2 \Rightarrow x_1 = x_2$.

Therefore, $f$ is one-one. ✓

Step 2 — Onto 1.5 Marks

Let $y \in \mathbb{R}$ be arbitrary.

Choose $x = \frac{y}{2} \in \mathbb{R}$.

Then $f(x) = f\left(\frac{y}{2}\right) = 2 \cdot \frac{y}{2} = y$.

So every $y \in \mathbb{R}$ has a pre-image. Therefore, $f$ is onto. ✓

$f$ is both one-one and onto, so $f$ is bijective (invertible).
📋 Total: 2 Marks

Q3. Let $A = \{1, 2, 3\}$. Find the number of equivalence relations containing $(1, 2)$.

Step 1 — Smallest Equivalence Relation 1 Mark

To be an equivalence relation containing $(1, 2)$, we need:

• $(1, 1), (2, 2), (3, 3)$ for reflexivity

• $(2, 1)$ for symmetry of $(1, 2)$

So the smallest such relation is:
$R_1 = \{(1,1), (2,2), (3,3), (1,2), (2,1)\}$

Step 2 — Count all possibilities 1 Mark

Adding any remaining pair $(1,3), (3,1), (2,3), (3,2)$ forces us to add all of them (to maintain transitivity and symmetry), resulting in the universal relation.

So total relations = $R_1$ + universal relation = 2.

Number of equivalence relations = 2
Test Yourself

✍️ MCQ Practice — 20 Questions

Select your answer and click "Check Answers"

1. A relation $R$ in a set $A$ is called reflexive if:

Correct: B — Reflexive means every element is related to itself.

2. Number of relations from A = {1,2} to B = {a,b,c} is:

Correct: C — Total = $2^{n(A) \cdot n(B)} = 2^{2 \times 3} = 2^6 = 64$.

3. An equivalence relation must be:

Correct: A — All three properties together.

4. Which of these is always an equivalence relation?

Correct: D — Relations defined by "same property" are equivalence relations.

5. A function $f: A \to B$ is onto if:

Correct: B — Onto means the range covers the entire codomain.

6. A function has an inverse if and only if it is:

Correct: C — Only bijective functions are invertible.

7. If $f: \mathbb{R} \to \mathbb{R}$, $f(x) = x^2$, then $f$ is:

Correct: A — $f(-1) = f(1) = 1$ (not one-one), and $-1$ has no pre-image (not onto).

8. $(gof)(x)$ is equal to:

Correct: D — Composition: apply f first, then g.

9. Empty relation on a non-empty set A is:

Correct: B — Because $(a, a) \notin R$ for any $a \in A$.

10. Number of functions from A = {1,2,3} to B = {a,b} is:

Correct: C — Total functions = $(n(B))^{n(A)} = 2^3 = 8$.

11. Which relation is symmetric?

Correct: A — "Brother of" is symmetric in the sense of sibling relation.

12. If $A = \{1, 2, 3\}$, number of one-one functions from A to A is:

Correct: B — One-one functions from A to A = $3! = 6$.

13. A relation R on $\mathbb{Z}$ defined by "a − b is even" is:

Correct: D — Classic example of equivalence relation (2 divides a − b).

14. The domain of $f(x) = \frac{1}{x - 2}$ is:

Correct: A — Denominator cannot be zero, so $x \neq 2$.

15. If $f(x) = x + 1$ and $g(x) = x^2$, then $(gof)(x)$ = ?

Correct: C — $(gof)(x) = g(f(x)) = g(x+1) = (x+1)^2$.

16. Which function is bijective on $\mathbb{R}$?

Correct: B — Linear functions with non-zero slope are bijective on $\mathbb{R}$.

17. If $f$ is invertible, then $(f^{-1})^{-1}$ equals:

Correct: A — Inverse of inverse gives back the original function.

18. The relation $\leq$ on $\mathbb{R}$ is:

Correct: C — $a \leq a$ ✓, transitive ✓, but $a \leq b \nRightarrow b \leq a$.

19. If $n(A) = 3$ and $n(B) = 4$, then number of one-one functions from A to B is:

Correct: B — ${}^4P_3 = 4 \times 3 \times 2 = 24$.

20. A function $f: \mathbb{N} \to \mathbb{N}$ defined by $f(x) = 2x$ is:

Correct: D — $2x_1 = 2x_2 \Rightarrow x_1 = x_2$ (one-one). But 1, 3, 5... have no pre-image (not onto).
Score: 0 / 20
New Pattern

🎯 Assertion & Reasoning — 10 Questions

Each question has an Assertion (A) and a Reason (R). Choose the correct option.

📖 Standard Options

(A) Both A and R are true, and R is the correct explanation of A.

(B) Both A and R are true, but R is NOT the correct explanation of A.

(C) A is true, but R is false.

(D) A is false, but R is true.

1
Assertion (A) The relation $R = \{(a, b) : a - b \text{ is divisible by } 5\}$ on $\mathbb{Z}$ is an equivalence relation.
Reason (R) A relation is an equivalence relation if it is reflexive, symmetric, and transitive.
Correct: A — The relation is indeed equivalence (reflexive, symmetric, transitive), and R correctly defines what equivalence means.
2
Assertion (A) The function $f: \mathbb{R} \to \mathbb{R}$ defined by $f(x) = x^2$ is bijective.
Reason (R) A function is bijective if it is both one-one and onto.
Correct: D — A is false: $f(x) = x^2$ is neither one-one ($f(-1) = f(1)$) nor onto (negative numbers have no pre-image) on $\mathbb{R}$. R is true (it is the definition of a bijective function).
3
Assertion (A) The relation $R = \{(1, 1), (2, 2), (3, 3), (1, 2), (2, 1)\}$ on $A = \{1,2,3\}$ is an equivalence relation.
Reason (R) A relation containing all diagonal elements and both (a, b) and (b, a) for any off-diagonal pair is an equivalence relation if it is also transitive.
Correct: A — The given relation is indeed an equivalence relation, and R correctly explains why.
4
Assertion (A) The relation $\leq$ on $\mathbb{R}$ is an equivalence relation.
Reason (R) A relation must be reflexive, symmetric, and transitive to be an equivalence relation.
Correct: D — A is false: $\leq$ is not symmetric ($2 \leq 3$ but $3 \not\leq 2$), so it is not an equivalence relation. R is true (this is the definition of an equivalence relation).
5
Assertion (A) The function $f: \mathbb{R} \to \mathbb{R}$, $f(x) = 3x + 2$ is invertible.
Reason (R) A function is invertible if and only if it is one-one and onto (bijective).
Correct: A — $f(x) = 3x + 2$ is bijective on $\mathbb{R}$, so it's invertible. R is the correct explanation.
6
Assertion (A) The number of one-one functions from A = {1,2,3} to B = {a,b} is 6.
Reason (R) Number of one-one functions from a set of $n$ elements to a set of $m$ elements (where $m \geq n$) is ${}^m P_n$.
Correct: D — A is false (you cannot have one-one function from a 3-element set to a 2-element set, because $m < n$). R is true in general.
7
Assertion (A) The function $f: \mathbb{N} \to \mathbb{N}$, $f(x) = 2x$ is one-one.
Reason (R) A function is one-one if $f(x_1) = f(x_2) \Rightarrow x_1 = x_2$.
Correct: A — $2x_1 = 2x_2 \Rightarrow x_1 = x_2$, so $f$ is one-one. R is the correct definition.
8
Assertion (A) Empty relation on a non-empty set $A$ is reflexive.
Reason (R) For reflexivity, $(a, a) \in R$ for every $a \in A$.
Correct: D — A is false: the empty relation on a non-empty set is NOT reflexive, because $(a, a) \notin R$ for any $a \in A$. R is true (this is the definition of reflexivity).
9
Assertion (A) The relation "is congruent to" on the set of all triangles is an equivalence relation.
Reason (R) A relation is an equivalence relation if it is reflexive, symmetric, and transitive.
Correct: A — Congruence is indeed an equivalence relation, and R correctly states the definition.
10
Assertion (A) The function $f: \mathbb{R} \to \mathbb{R}$, $f(x) = |x|$ is one-one.
Reason (R) A function is one-one if distinct elements have distinct images.
Correct: D — A is false ($|-1| = |1| = 1$, so not one-one), but R is true (this is the definition of one-one).
Score: 0 / 10
Exam Focus

📖 Previous Year Questions

Frequently asked questions in board exams

2024

Q. Show that the relation R in the set $\{1, 2, 3\}$ given by $R = \{(1, 2), (2, 1)\}$ is symmetric but neither reflexive nor transitive.

Reflexive check1 Mark

$(1, 1) \notin R$ → Not reflexive ✗

Symmetric check1 Mark

$(1, 2) \in R$ and $(2, 1) \in R$ → Symmetric ✓

Transitive check1 Mark

$(1, 2) \in R$ and $(2, 1) \in R$, but $(1, 1) \notin R$ → Not transitive ✗

R is symmetric but neither reflexive nor transitive.
2023

Q. Show that $f: \mathbb{R} \to \mathbb{R}$ given by $f(x) = 2x$ is one-one and onto.

One-One1.5 Marks

Let $f(x_1) = f(x_2) \Rightarrow 2x_1 = 2x_2 \Rightarrow x_1 = x_2$. So $f$ is one-one. ✓

Onto1.5 Marks

For any $y \in \mathbb{R}$, take $x = y/2$. Then $f(x) = 2(y/2) = y$. So $f$ is onto. ✓

$f$ is bijective.
2023

Q. Let $A = \{1, 2, 3\}$. Then the number of equivalence relations containing $(1, 2)$ is:

Smallest Relation1 Mark

$R_1 = \{(1,1), (2,2), (3,3), (1,2), (2,1)\}$

Additions1 Mark

Adding any remaining pair forces the universal relation.

Number of equivalence relations = 2

2022

Q. Show that the relation R in the set $\mathbb{Z}$ given by $R = \{(a, b) : 2 \mid (a - b)\}$ is an equivalence relation.

Reflexive1 Mark

$2 \mid (a - a) = 0$ → $(a, a) \in R$ ✓

Symmetric1 Mark

$2 \mid (a - b) \Rightarrow 2 \mid (b - a)$ → $(b, a) \in R$ ✓

Transitive1 Mark

$2 \mid (a-b)$ and $2 \mid (b-c) \Rightarrow 2 \mid (a-c)$ ✓

R is an equivalence relation.
2022

Q. Check whether the relation R defined on $\{1, 2, 3, 4, 5, 6\}$ by $R = \{(a, b) : b = a + 1\}$ is reflexive, symmetric or transitive.

$(1,1) \notin R$ → not reflexive ✗

$(1,2) \in R$, but $(2,1) \notin R$ → not symmetric ✗

$(1,2), (2,3) \in R$, but $(1,3) \notin R$ → not transitive ✗

R is neither reflexive, nor symmetric, nor transitive.
2021

Q. Let $f: \mathbb{R} \to \mathbb{R}$ be defined as $f(x) = x^4$. Choose the correct answer:

$f(-1) = f(1) = 1$, so not one-one.

Negative numbers have no pre-image → not onto.

Answer: (D) f is neither one-one nor onto.