Mathematics • Class 12
Relations and Functions - Class 12
Master Advanced Functions & Relations through focused practice that strengthens conceptual understanding, problem-solving skills, and the ability to recognize common traps and misconceptions. Explore challenging questions designed to develop deeper reasoning and confident application of key ideas.
Overview
This chapter explores the concepts of relations and functions in depth. It covers types of relations, functions, their properties, and composite functions. The chapter also introduces invertible functions and their applications.
Why This Chapter Matters
- Relations and Functions form the basis of advanced topics in mathematics, such as calculus and algebra. Understanding these concepts is crucial for excelling in Class 12 board exams and competitive exams like JEE.
Real-Life Applications
- Understanding data relationships in computer science and programming.
- Applying functional relationships in physics and engineering problems.
- Building a foundation for advanced studies in mathematics and science.
Skills You Will Learn
- Identifying and analyzing different types of relations.
- Understanding properties of functions and their applications.
- Working with composite and invertible functions.
Core Concepts to Master
Empty and Universal Relation
The empty relation is a subset of every set; ensure the set A is non-empty before declaring.
Reflexivity in Empty Sets
A relation on an empty set is vacuously reflexive; a common edge case trap for students.
Symmetry vs. Antisymmetry
A relation can be both symmetric and antisymmetric, or neither. Do not assume mutual exclusivity.
Transitivity of Identity
Transitivity holds if (a,b) and (b,c) exist; if (a,b) exists but no (b,c) exists, it is vacuously transitive.
Equivalence Class Partitioning
Equivalence classes form a partition; every element must belong to exactly one class. Disjoint sets are mandatory.
Injective Mapping (One-One)
Check f'(x) monotonicity; if the function changes direction, it fails the horizontal line test for injectivity.
Surjective Mapping (Onto)
Ensure the codomain is explicitly defined. If codomain equals range, the function is surjective.
Bijectivity and Inverse
Inverse exists if and only if the function is bijective. Check both one-one and onto conditions rigorously.
Composition Non-Commutativity
fog(x) is rarely equal to gof(x). Apply inner function first; preserve variable mapping order strictly.
Composite Injectivity/Surjectivity
If fog is injective, g must be injective. If fog is surjective, f must be surjective. Map these dependencies.
Binary Operation Closure
An operation * on A is binary if for all a, b in A, a*b is strictly in A.
Identity Element Uniqueness
The identity element must be unique and consistent across the entire set; check boundary values carefully.
Invertibility in Binary Operations
An element is invertible if a*b = e = b*a; the inverse must exist within the defined set.
Domain Restrictions
Always verify if the function is defined for all x in the given domain, especially under square roots/denominators.
Greatest Integer Function Traps
Discontinuities in [x] affect range and surjectivity. Never assume continuous behavior for step functions.
Concept Collisions Used by Examiners
Competitive examinations rarely assess concepts in isolation. Instead, examiners intentionally combine multiple concepts from this and related chapters to create higher-order questions that test conceptual reasoning, analytical thinking, and problem-solving ability. The concept collision patterns below represent the combinations most frequently used while designing questions for this chapter.
Exam Coverage
Understand how this chapter is tested across major competitive examinations.
JEE Advanced
India · Competitive Exam · Undergraduate
JEE Main
India · Competitive Exam · Undergraduate
BITSAT
India · Competitive Exam · Undergraduate
IISER Aptitude Test (IAT)
India · Competitive Exam · Undergraduate
NEST
India · Competitive Exam · Undergraduate
ISI Admission Test
India · Competitive Exam · Undergraduate
CMI Entrance
India · Competitive Exam · Undergraduate
IOQM / INMO
India · Olympiad · High School
SAT Math
United States · Curriculum · High School
A-Level Mathematics
United Kingdom · Curriculum · Advanced Level
A-Level Further Mathematics
United Kingdom · Curriculum · Advanced Level
IB Mathematics AA HL
International · Curriculum · IB Diploma
Singapore A-Level Mathematics
Singapore · Curriculum · Advanced Level
Cambridge International A-Level Mathematics
International · Curriculum · Cambridge
International Mathematical Olympiad (IMO)
International · Olympiad · International
Practice Questions
Strengthen your understanding by solving carefully selected questions from this chapter.
Let . For any matrix , its Frobenius norm is defined as . Two relations and are defined on as follows: If is the smallest integer such that is the universal relation on , and is the smallest integer such that is the empty relation on , then the value of is:
Let . A relation on is chosen at random from the set of all possible relations on . Let be the event that is the universal relation on and is also anti-symmetric. Let be the event that is an equivalence relation on . Which of the following statements is true regarding the events and ?
Let . Let . A relation is defined on such that for , if and only if and there exists satisfying . Find the number of elements in .
Let be the set of all points that divide the line segment joining and strictly internally. A relation on is defined as if and only if both and lie strictly inside the octant. Let be the set of all octant numbers for which is an empty relation. If and are the boundary points of the segment of that lies in the octant, find the value of .
Let be the set of all points on the line . Let be the plane containing the point and parallel to the vectors and , where and . A relation on is defined as: for , if and only if the midpoint of the line segment lies on the plane . If is an empty relation on , find the value of .
Let be the set of all matrices over with entries from . We define three subsets of as follows: where denotes the matrix obtained by swapping the first and second rows of , and is the null matrix. Let . Let be the number of reflexive relations on , and be the number of symmetric relations on . Find the value of .
Let . Let be a relation on defined by . Which of the following statements is true?
Let be the set of all ellipses () such that their eccentricity satisfies A relation is defined on by if and only if the area of is strictly less than the area of . Which of the following statements is true about the relation ?
Let . For each , define the set as the interval: where denotes the greatest integer function. A relation is defined on such that if and only if . Which of the following statements is true?
Let , where denotes the greatest integer less than or equal to . Let . A relation is defined on such that . Let be the number of distinct equivalence classes of , and . Find the value of .
Define a relation on by . For , consider the function Let be the unique value in such that . Which of the following expressions is identically equal to for all ?
Let be the family of equations for . A relation is defined on such that if and only if and have the exact same set of real roots. Let denote the equivalence class of under . Find the number of values of for which contains exactly one element.
Let and be three events in a probability space such that . Let denote the indicator function of an event . If the relation holds almost surely, and , find the value of .
Let be the set of all permutations of the set . An equivalence relation is defined on such that for , if and only if and have the exact same number of fixed points. A permutation is chosen uniformly at random from . Let denote the equivalence class containing . What is the expected value of , the cardinality of the equivalence class containing ?
Let be the set of all matrices with real entries. A relation on is defined by . Let denote the equivalence class of a matrix . Consider the matrix . If a matrix satisfies the equation for some real number , which of the following statements is ALWAYS true?
Let and . An equivalence relation is defined on by . If is the number of elements in , and is the number of equivalence classes of on , find the value of .
Let . A relation is defined on by , where Let denote the equivalence class of under . Let be the set of all such that the equation has exactly solutions in (i.e., for any with ). If can be expressed as the union of two disjoint open intervals with , then the value of is:
Let be a multiset containing 12 elements, consisting of 6 identical items of type and 6 distinct items . Find the number of ways to partition the multiset into 6 unordered pairs.
A curve is defined parametrically by and , where and . The set of all pairs for which can be expressed as a single-valued injective function of on the entire real line is:
Let . A function is defined as . Let denote the number of distinct solutions to the equation . Which of the following statements is TRUE?
The number of real roots of the equation is
Let be a function defined by Which of the following represents the set of all real values of for which is bijective?
Let and be the identity matrix. A linear transformation is defined as , where . If is the set of all real values of for which is NOT an injective mapping, then is equal to:
Let be defined as: Consider the following statements: I. is a surjective function. II. is strictly increasing on its domain. III. is not differentiable at because does not exist.
Which of the following represents the correct truth values of (I, II, III)?
Let . For each integer , define the mapping by where denotes the principal branch of the complex logarithm, with its imaginary part in . Let be the set of all integers such that is a bijective mapping. Find the sum of the elements of .
Let be a surjective, twice-differentiable function satisfying the differential equation for all , with . Which of the following sets represents ?
Let be defined by where denotes the greatest integer less than or equal to . Let be the range of . Which of the following represents the cardinality of ?
Let be the set of all real matrices (). Define a mapping by . Let be the set of all involutory matrices, and let be the image of under . Which of the following statements is ALWAYS true?
Let be a skew-symmetric matrix with real entries. Let . If the function defined by is bijective, then the minimum possible value of is
Consider the function defined by Which of the following statements is true?
Let . A function is defined such that is the square of the length of the orthogonal projection of the vector onto the plane . If is the total length of the curve(s) forming the pre-image , find the value of .
Let be defined as . The set of all real values of for which the equation has exactly distinct real solutions is:
Let be the vector space of all real matrices and be the subspace of symmetric matrices. For a fixed matrix , define linear transformations by Let and , where is the restriction of to . What is the value of ?
Let and . For any matrix , define the transformation . Let and . Let be the set of all real numbers satisfying the equation , where and denotes the greatest integer function. Find the value of
Let and be defined as: Let be the range of and be the range of . Let be the number of real roots of the equation , and be the number of real roots of the equation . Find the value of .
Let be defined by Let . Consider the composite functions and . Which of the following statements is TRUE regarding the existence of local inverses for and in some neighborhood of (where is sufficiently small)?
Let and . Define the integrals and . Which of the following inequalities is correct?
Let (where ) be the roots of the equation . Let and , where denotes the greatest integer less than or equal to . Two sequences and are defined as follows: Find the value of .
Let be a differentiable function satisfying the differential equation If is an injective function on , then the maximum possible value of is:
Let be the set of all sequences of positive integers such that . A function is defined by . If is the largest possible subset such that the restriction is injective, find the cardinality of .
Let and be two lines in given by: Let be the shortest distance between and . Let be defined as . Consider the vectors , , and . A function is defined as: If is continuous for all , which of the following is true?
Let and . A binary operation on is defined by , where is a non-zero real constant. For any , let ( times). If is the inverse of under the operation , then is equal to:
Let . A binary operation on the power set is defined as . Let be the family of all proper subsets of that do not contain any two consecutive integers. If is the closure of under the operation , find the number of elements in the set .
Let a binary operation be defined on a subset as where denotes the greatest integer function and denotes the signum function. For which of the following sets is a closed binary operation?
Let be the closed unit ball in . A binary operation is defined on by where is a real constant. What is the maximum value of such that is closed under the operation ?
Let be the set of all matrices of the form , where and . A binary operation is defined on by for all . Let be the set of all left identities and be the set of all right identities for the operation in . Which of the following statements is correct?
Let . A binary operation on is defined as Consider the following three statements: : The operation admits an identity element in . : The operation is associative on . : The function defined by is surjective but not injective. Which of the following is correct?
Let . A binary operation is defined on by where . If the operation admits a unique identity element in , what is the value of ?
Let and . Let be the maximum value of on its domain. Then the value of is:
Let and . Consider the function defined on the interval . It is given that Lagrange's Mean Value Theorem is applicable to on . Let be the set of all points satisfying the conclusion of the theorem for on . If and , find the maximum possible value of .
Ready to Master This Chapter?
Practice 50 carefully selected questions designed to strengthen your concepts, avoid common traps, and build confidence for competitive examinations.
Start Free Practice