ClassApna

Class 12 Maths Notes

Relations and Functions Class 12 Notes

Complete, exam-ready notes on relations and functions: reflexive, symmetric, transitive and equivalence relations, one-one and onto functions, composition, invertibility and binary operations — written for CBSE boards and JEE revision.

Class12SubjectMathematicsCoversCBSE · JEE

Written byDeep Narayan· Science & Mathematics EducatorReviewed byPushpanjali

What is this chapter about in one line?

Relations and Functions studies how sets are connected — equivalence relations classify elements, and well-defined functions that are one-one and onto can be inverted.

Types of Relations

Relation

A relation R from set A to set B is a subset of A × B, the Cartesian product. A relation on A means R ⊆ A × A. The number of such relations is 2n(A)n(A)2^{n(A)\cdot n(A)}.

  • Reflexive: a R a for every
  • aAa \in A
  • .
  • Symmetric: a R b implies b R a.
  • Transitive: a R b and b R c imply a R c.
  • An equivalence relation is reflexive, symmetric and transitive — e.g. being in the same class among students.

Equivalence = all three

To prove a relation is an equivalence relation, verify all three properties: reflexive, symmetric, transitive. A relation that fails any one of them is not an equivalence relation.

Types of Functions

Function

A function f: A → B assigns exactly one output in B to each input in A. Its domain is A; its range is the set of actual outputs, and B is the codomain.

  • One-one (injective):
  • f(a)=f(b)a=bf(a) = f(b) \Rightarrow a = b
  • .
  • Onto (surjective): every element of B is the image of some element of A, i.e. range = codomain.
  • Bijective: both one-one and onto; only bijective functions are invertible.
  • Number of functions from A to B:
  • n(B)n(A)n(B)^{n(A)}
  • .
f(a)=f(b)a=b (one-one),range=codomain (onto)f(a) = f(b) \Rightarrow a = b\ (\text{one-one}),\qquad \text{range} = \text{codomain}\ (\text{onto})
One-one and onto conditions

Composition and Invertible Functions

Composition

gfg \circ f

For f: A → B and g: B → C, the composition (gf)(x)=g(f(x))(g \circ f)(x) = g(f(x)) maps A to C. Composition is associative but generally not commutative.

  • A function is invertible if and only if it is bijective.
  • The inverse satisfies
  • f1f=IAf^{-1} \circ f = I_A
  • and
  • ff1=IBf \circ f^{-1} = I_B
  • .
  • To find the inverse: solve y = f(x) for x and swap the roles of x and y.
(gf)(x)=g(f(x)),f1f=IA(g \circ f)(x) = g(f(x)),\quad f^{-1} \circ f = I_A
Composition and inverse

Binary Operations

  • A binary operation * on a set A maps each ordered pair (a, b) to an element of A.
  • Commutative:
  • ab=baa * b = b * a
  • .
  • Associative:
  • (ab)c=a(bc)(a * b) * c = a * (b * c)
  • .
  • Identity element e satisfies
  • ae=ea=aa * e = e * a = a
  • ; the inverse of a is the element that gives the identity.

Solved Examples

Example: Show that the function f(x)=2x+3f(x) = 2x + 3 on the reals is invertible, and find f1(x)f^{-1}(x).

Solution: For one-one, f(a)=f(b)2a+3=2b+3a=bf(a) = f(b) \Rightarrow 2a + 3 = 2b + 3 \Rightarrow a = b. It is onto since every real y is hit. So f is bijective and invertible. Let y=2x+3y = 2x + 3, giving x=(y3)/2x = (y - 3)/2, hence f1(x)=x32f^{-1}(x) = \frac{x-3}{2}.

Revision

Key formulas at a glance

Memorise these before attempting numericals — most exam questions hinge on one of them.

Composition

(gf)(x)=g(f(x))(g \circ f)(x) = g(f(x))

Inverse condition

f1f=IA,ff1=IBf^{-1} \circ f = I_A,\quad f \circ f^{-1} = I_B

One-one test

f(a)=f(b)a=bf(a) = f(b) \Rightarrow a = b

Bijective

invertible    one-one and onto\text{invertible} \iff \text{one-one and onto}

Number of functions

n(B)n(A)n(B)^{n(A)}

Exam tips

How this chapter is asked

Where this topic appears in CBSE, JEE Main and NEET papers.

  • A relation is an equivalence relation only if it is reflexive AND symmetric AND transitive.
  • Only bijective functions are invertible.
  • f⁻¹∘f = I_A; composition is associative but not commutative.
  • Range of f equals the domain of f⁻¹.
  • Check one-one by setting f(a) = f(b) and proving a = b.

FAQ

Common questions

What is an equivalence relation?

A relation that is reflexive, symmetric and transitive. The classic example is congruence of line segments or students belonging to the same class.

When is a function invertible?

A function is invertible exactly when it is bijective — both one-one (injective) and onto (surjective). Only then does a well-defined inverse exist.

What is the difference between domain, codomain and range?

The domain is the set of inputs, the codomain is the set into which outputs are declared, and the range is the set of outputs actually produced — a subset of the codomain.

Is composition of functions commutative?

No. In general (g∘f)(x) ≠ (f∘g)(x). Composition is associative, but order matters.

Mastering this chapter with live help

Notes help, but doubts clear fastest in a live class. Narayan Gurukul Academy (ClassApna) runs small-batch CBSE, JEE and NEET coaching from our Mohali centre and online — with daily doubt support and mock tests.

One-on-one guidance available · Live online classes across India