Class 12 Mathematics

Chapter 1 — Relations and Functions

Open PDFReads in your browser
Overview

Summary

Chapter 1 of the Class 12 Maths NCERT textbook, "Relations and Functions", covers types of relations (reflexive, symmetric, transitive, equivalence), types of functions (one-one, onto, bijective), composition of functions, and invertible functions.

  • Classifying relations on a setThe chapter organises how elements of a set can be paired, moving from empty and universal relations up to reflexive, symmetric and transitive ones — and shows how a relation combining all three (an equivalence relation) neatly splits a set into disjoint classes.
  • How functions map one set to anotherFunctions are studied by the way they cover their target set: injective functions never repeat an output, surjective ones reach every output, and bijective functions do both — a lens that later decides which functions can be reversed.
  • Building and reversing functionsTwo functions can be chained so the output of one feeds the next (composition), an operation that generally depends on order. The chapter ties this together by showing a function can be undone by an inverse precisely when it is a bijection.
Essentials

Key points & formulas

  1. 01A relation R in set A is reflexive if (a, a) ∈ R for every a ∈ A, symmetric if (a, b) ∈ R implies (b, a) ∈ R, and transitive if (a, b) ∈ R and (b, c) ∈ R implies (a, c) ∈ R.
  2. 02An equivalence relation is one that is simultaneously reflexive, symmetric, and transitive; it partitions the set into mutually disjoint equivalence classes.
  3. 03A function f : X → Y is one-one (injective) if f(x₁) = f(x₂) implies x₁ = x₂, and onto (surjective) if every element of Y is the image of some element in X.
  4. 04A bijective function is both one-one and onto; for a finite set X, a function f : X → X is one-one if and only if it is onto — a property that does not hold for infinite sets.
  5. 05The composition gof of functions f : A → B and g : B → C is defined as gof(x) = g(f(x)); composition is not commutative in general (gof ≠ fog).
  6. 06A function f : X → Y is invertible if and only if it is bijective; its inverse g satisfies gof = I_X and fog = I_Y.
Questions

Frequently asked questions

01

What is an equivalence relation in Class 12 Maths Chapter 1?

An equivalence relation R in a set A is a relation that is reflexive ((a, a) ∈ R for all a ∈ A), symmetric ((a, b) ∈ R implies (b, a) ∈ R), and transitive ((a, b) ∈ R and (b, c) ∈ R implies (a, c) ∈ R). Such a relation divides the set into mutually disjoint subsets called equivalence classes.

02

What is the difference between a one-one function and an onto function?

A one-one (injective) function f : X → Y maps distinct elements of X to distinct elements of Y — if f(x₁) = f(x₂) then x₁ = x₂. An onto (surjective) function ensures every element of Y is the image of at least one element in X, i.e., the range of f equals Y. A function that is both one-one and onto is called bijective.

03

When is a function invertible according to NCERT Class 12 Chapter 1?

A function f : X → Y is invertible if there exists a function g : Y → X such that gof = I_X and fog = I_Y. The chapter proves that f is invertible if and only if it is both one-one and onto (bijective). The inverse function is denoted f⁻¹.

04

Is the NCERT Class 12 Maths Chapter 1 PDF free to download?

Yes, the NCERT Class 12 Maths Chapter 1 PDF is completely free to download on cbseprepmaster.com.

Keep learning

More chapters in Mathematics Part I

Read Chapter 1 of Mathematics Part I, the Class 12 Mathematics NCERT textbook (2026-27 edition), online for free: the complete chapter as published by NCERT with every diagram, solved example and exercise, with step-by-step solutions, answers and revision notes. Open the NCERT PDF above, or browse all CBSE Class 12 textbooks.

Read offline with notes, solutions & mock tests

CBSE Prepmaster — free on iOS & Android

Get the App