Relations and Functions for Class 12: The Complete CBSE Guide (2026-27)

In Relations and Functions Class 12, a relation R from a non-empty set A to a non-empty set B is formally defined as any subset of the Cartesian product A × B. If (a, b) belongs to R, we write a R b and say that 'a is related to b'. The NCERT textbook emphasizes that while every function is a relation, not every relation qualifies as a function because a relation can map one element of A to multiple elements in B. For example, consider A = {1, 2, 3} and B = {x, y}. The Cartesian product A × B contains 6 ordered pairs. A relation R = {(1, x), (1, y), (2, x)} is valid, but it is not a function because the element 1 from set A is related to both x and y in set B. The domain of relation R is the set of all first elements {1, 2}, the co-domain is B = {x, y}, and the range is the set of all second elements that actually appear {x, y}. This distinction becomes critical when students analyze whether a given relation can be inverted or composed with another relation.

Relations and Functions Class 12 NCERT textbook categorizes relations on a set A based on three fundamental properties. A relation R on set A is reflexive if every element is related to itself, meaning (a, a) ∈ R for all a ∈ A. It is symmetric if whenever a is related to b, then b is also related to a: if (a, b) ∈ R then (b, a) ∈ R. It is transitive if the relation 'chains' correctly: whenever (a, b) ∈ R and (b, c) ∈ R, then (a, c) must also be in R. These properties are independent — a relation can have any combination of them. For instance, the relation 'less than' (<) on real numbers is transitive but neither reflexive (a number is not less than itself) nor symmetric (if a < b, then b is not < a). The empty relation on a non-empty set is vacuously symmetric and transitive but not reflexive. The universal relation A × A is reflexive, symmetric, and transitive. CBSE board exams frequently ask students to verify these properties for a given relation expressed in set-builder or roster form, awarding 2 marks for correct identification and justification.

A relation R on set A is called an equivalence relation if it simultaneously satisfies all three properties: reflexive, symmetric, and transitive. The 2024-25 NCERT textbook for Relations and Functions Class 12 emphasizes that equivalence relations partition the set A into disjoint subsets called equivalence classes. For any element a in A, the equivalence class [a] is defined as the set of all elements related to a: [a] = {x ∈ A: (a, x) ∈ R}. Two fundamental theorems govern equivalence relations: first, the equivalence classes are non-empty, pairwise disjoint, and their union equals A (they form a partition); second, any partition of a set induces an equivalence relation where elements are related if they belong to the same partition block. Common examples include congruence modulo n on integers (where a ≡ b (mod n) if n divides a - b), equality relation, and similarity of triangles. CBSE board exams award 4-6 marks for problems asking students to prove a given relation is an equivalence relation and then find all distinct equivalence classes, requiring systematic verification of all three properties.

In Relations and Functions Class 12, a function f: A → B is a special relation where every element in the domain A is related to exactly one element in the codomain B. NCERT defines three critical classifications. A function f is one-one or injective if distinct elements in A map to distinct elements in B: if f(x₁) = f(x₂) then x₁ = x₂. Graphically, a horizontal line test on the function's graph should intersect at most once. A function f is onto or surjective if every element in the codomain B is the image of at least one element in A: for every b ∈ B, there exists some a ∈ A such that f(a) = b, meaning range equals codomain. A function that is both one-one and onto is called bijective. Only bijective functions are invertible. To prove a function is one-one, students typically assume f(x₁) = f(x₂) and deduce x₁ = x₂ algebraically. To prove onto, they take an arbitrary element y in B and solve f(x) = y to show a corresponding x exists in A. CBSE board problems often give a function formula like f(x) = 3x + 2 and ask students to prove injectivity or surjectivity rigorously, worth 4 marks with detailed steps.

The composition of two functions is a cornerstone topic in Relations and Functions Class 12. Given functions f: A → B and g: B → C, the composition gof (read 'g circle f' or 'g composed with f') is a function from A to C defined by (gof)(x) = g(f(x)). The critical requirement is that the codomain of f must be a subset of the domain of g for the composition to be valid. Notice the order: gof means 'apply f first, then apply g to the result'. NCERT textbook includes multiple worked examples showing that function composition is generally not commutative: fog and gof are usually different functions. To find (gof)(x), students substitute the entire expression f(x) into the function g. To verify associativity, NCERT proves that for functions f, g, h with compatible domains, (fog)oh = fo(goh), allowing us to write fogoh unambiguously. CBSE exams allocate 4 marks to problems requiring calculation of gof and fog for given functions, then asking whether they are equal or identifying domains where composition is defined.

Relations and Functions Class 12 NCERT defines the inverse of a function f: A → B, denoted f⁻¹: B → A, as a function that reverses the mapping of f. For f⁻¹ to exist as a function, f must be bijective (both one-one and onto). If f is not one-one, the inverse relation would map one element in B to multiple elements in A, violating the definition of a function. If f is not onto, some elements of B have no pre-image, leaving f⁻¹ undefined on those elements. When f is bijective, we define f⁻¹(y) = x if and only if f(x) = y. The fundamental property is that (f⁻¹of)(x) = x for all x ∈ A and (fof⁻¹)(y) = y for all y ∈ B — applying a function and its inverse returns the original input. To find the inverse algebraically, students write y = f(x), solve for x in terms of y to get x = some expression in y, then replace y with x to write f⁻¹(x). CBSE board exams test this with 4-6 mark questions asking students to first verify a function is bijective, then find its inverse and confirm (fof⁻¹)(x) = x.

The 2024-25 NCERT syllabus for Relations and Functions Class 12 includes binary operations as an application of functions. A binary operation * on a non-empty set A is a function from A × A to A, written a * b for the image of (a, b). The key insight is that a binary operation takes two elements from A and produces a unique element also in A (closure property). Examples include addition and multiplication on integers, union and intersection on sets of sets, and composition of functions. NCERT discusses five important properties: commutativity (a * b = b * a for all a, b), associativity ((a * b) * c = a * (b * c)), existence of identity element e (e * a = a * e = a for all a), existence of inverse (for each a, there exists a⁻¹ such that a * a⁻¹ = a⁻¹ * a = e), and distributivity of one operation over another. Students must determine which properties hold for a given operation through examples and counterexamples. CBSE exams occasionally include 2-3 mark questions asking whether a specified operation is commutative or has an identity element, requiring both proof and explicit examples.

Success in Relations and Functions Class 12 requires quick recall of definitions and standard results. While this chapter is more concept-driven than formula-intensive compared to calculus or vectors, certain standard forms and properties must be memorized. For relations, remember the counts: a set with n elements has n² ordered pairs in A × A, and 2^(n²) possible relations on A. For equivalence relations, the number of equivalence classes can vary from 1 (universal relation) to n (equality relation). For functions, standard bijective functions include f(x) = ax + b (linear), f(x) = x³ (cubic), and f(x) = eˣ (exponential), while f(x) = x² on R is not one-one. Important composition results: identity function I satisfies foI = Iof = f; if f and g are both one-one, then gof is one-one; if both are onto, then gof is onto. For inverses, (gof)⁻¹ = f⁻¹og⁻¹ (note the order reversal). These formulas form the toolkit for rapid problem-solving in board exams.

CBSE board exams for Relations and Functions Class 12 follow predictable patterns across the 2-mark, 4-mark, and occasional 6-mark questions. Two-mark questions typically ask to verify one property (reflexive/symmetric/transitive) for a given relation in roster form, or to find fog for simple polynomial functions. Four-mark questions are the most common, asking students to prove a relation is an equivalence relation (requiring verification of all three properties with clear justification), find composition of two functions and determine if the result is one-one/onto, or find the inverse of a bijective function. Six-mark questions, less frequent, often combine concepts: prove a function is bijective, find its inverse, then compute the composition of the function with its inverse. The marking scheme awards full credit for correct methodology even if arithmetic errors occur, provided students write clear set notation like ∀ a ∈ A and use logical connectives properly. Examiners look for the word 'therefore' or 'hence' before conclusions. Common mistakes include claiming a relation is reflexive without checking all elements, stating fog = gof without calculation, and forgetting to verify that codomain equals range when proving onto.

Students preparing Relations and Functions Class 12 material commonly make several conceptual errors. First, confusing 'relation on A' (R ⊆ A × A) with 'relation from A to B' (R ⊆ A × B); the former requires source and target to be identical. Second, assuming symmetry when proving reflexivity: just because (1,1) ∈ R does not mean R is symmetric — symmetry requires if (a,b) ∈ R with a ≠ b, then (b,a) ∈ R. Third, claiming a function is onto by checking only a few elements; onto requires proving every element in the codomain is covered. Fourth, writing fog(x) when the correct notation is (fog)(x) or fog applied to x, denoted (fog)(x). Fifth, believing that if f is invertible then f⁻¹(x) = 1/f(x); this confuses functional inverse with multiplicative reciprocal — the inverse function reverses the mapping, not the value. Sixth, neglecting domain restrictions: when finding fog, students must check whether f(x) lies in the domain of g. NCERT exercises deliberately include questions that test these misconceptions. Careful reading of definitions and working through counterexamples solidify understanding.

Relations and Functions Class 12 is not an isolated chapter; its concepts permeate the entire CBSE mathematics syllabus. Inverse trigonometric functions in Chapter 2 build directly on the invertibility conditions learned here — students must verify that sin x restricted to [-π/2, π/2] becomes bijective before defining sin⁻¹ x. Matrices (Chapter 3) can represent relations and functions through Boolean matrices and transformation mappings. Determinants are used to check if a linear transformation is bijective (invertible). Continuity and differentiability in calculus (Chapters 5-6) presuppose understanding of function domains, ranges, and compositions, as differentiation rules like the chain rule are essentially d(fog)/dx = f'(g(x))·g'(x). Probability (Chapter 13) treats events as relations on sample spaces, and random variables are actually functions from sample space to real numbers. Integration (Chapters 7-8) uses inverse functions in integration by substitution. In JEE Main, relations and functions problems frequently combine with inequalities, greatest integer function, and parametric domains, while JEE Advanced tests composition with piecewise functions and inverse under transformations. Recognizing these connections helps students see mathematics as a unified discipline rather than disconnected topics.

Relations and Functions Class 12 demands precise symbolic reasoning and systematic proof-writing, skills that develop through guided practice rather than passive reading. CBSETUTOR.ai offers Class 12 students a 24×7 AI tutor that has ingested every NCERT textbook from Class 6 to 12, including the complete Relations and Functions chapter with all solved examples, exercises, and miscellaneous problems. When a student struggles with proving transitivity for a given relation, they can photograph their work and ask the AI to identify logical gaps or suggest the next step. Unlike static video lectures, CBSETUTOR.ai engages in dialogue: if a student writes that a function is onto without proper justification, the AI will prompt 'Did you show that every y in the codomain has a pre-image x?' and guide them to construct the algebraic solution y = f(x) step by step. The platform recognizes CBSE marking scheme requirements, reminding students to write 'Let R be reflexive' and explicitly state '∀ a ∈ A, (a,a) ∈ R' for full method marks. Parents appreciate the flat ₹999 per month pricing for all subjects across Class 6-12, with a 3-day free trial requiring no credit card. For Class 12 students juggling multiple chapters and board exam pressure, having an always-available tutor that adapts explanations to their specific confusion points accelerates mastery of abstract concepts like equivalence classes and composition domains.

Analyzing CBSE board papers from 2020-2024 reveals clear question patterns for Relations and Functions Class 12. In the 2023 board exam (Term-wise pattern), a 2-mark question asked students to show a given relation R = {(a,b): a ≤ b³} on the set {1, 2, 3, 4} is neither reflexive nor symmetric, testing direct verification skills. The 2022 paper included a 4-mark question requiring proof that a specified relation on integers is an equivalence relation, followed by finding three distinct equivalence classes. The 2024 paper featured a 4-mark problem on function composition: given f(x) = x² + 1 and g(x) = 2x - 3, find fog and gof, then determine which is one-one. A recurring 6-mark pattern (2021, 2023) asks students to verify that f: A → B is bijective for given sets A and B (often involving restricted domains like R - {k}), find the inverse function f⁻¹, and compute (fof⁻¹)(x) to confirm it equals the identity. The 2020 paper (before split) included a question on binary operations, asking whether a defined operation is commutative and has an identity element. Practicing these exact question types using NCERT Exercise 1.1, 1.2, 1.3, 1.4 and Miscellaneous Exercise ensures comprehensive preparation for the 2026-27 boards.