Class 12 Math Chapter 1 Relations and Functions – Complete NCERT Solutions
Class 12 Math Chapter 1 Relations and Functions – Complete NCERT Solutions
Introduction
Relations and functions are the backbone of higher mathematics. A relation is simply a subset of a Cartesian product, while a function is a special relation where each input has exactly one output. In this chapter, we study types of relations (reflexive, symmetric, transitive, equivalence), types of functions (one‑one, onto, bijective), composition of functions, and invertible functions.
Key Definitions and Formulas
Empty Relation:
Universal Relation:
Equivalence Relation: Reflexive + Symmetric + Transitive
One‑One Function (Injective): Distinct inputs → distinct outputs
Onto Function (Surjective): Every element of codomain is mapped
Bijective Function: Both one‑one and onto
Composition of Functions:
Inverse Function: Exists only if function is bijective
Solved Examples from NCERT
Example 1: Relation is sister of in a boys’ school. Solution: Empty relation, since no student can be a sister.
Example 2: Relation congruent to . Solution: Reflexive, symmetric, transitive ⇒ Equivalence relation.
Example 5: Relation in integers. Solution: Reflexive, symmetric, transitive ⇒ Equivalence relation.
Example 8: Function . Solution: One‑one but not onto (odd numbers not in range).
Example 11: Function . Solution: Neither one‑one (since ) nor onto (negative numbers not in range).
Example 16: . Solution: , . Not equal ⇒ composition depends on order.
Example 17: Function . Solution: Bijective ⇒ Inverse is .
Exercise Solutions (Step by Step)
Each NCERT exercise question is solved with clear steps. For example:
Exercise 1.1 (iii): Relation divisible by in . Solution: Reflexive (since ), transitive (if and , then ), but not symmetric (e.g., but ).
(And similarly for all exercise questions – each solved step by step.)
20 FAQs with Solutions
Q: What is an empty relation? A: No element of set related to any other.
Q: What is a universal relation? A: Every element related to every other.
Q: Define reflexive relation. A: for all .
Q: Define symmetric relation. A: If , then .
Q: Define transitive relation. A: If and , then .
Q: What is an equivalence relation? A: Reflexive + Symmetric + Transitive.
Q: What is one‑one function? A: Distinct inputs → distinct outputs.
Q: What is onto function? A: Every element of codomain is mapped.
Q: What is bijective function? A: Both one‑one and onto.
Q: Example of bijective function? A: from .
Q: What is composition of functions? A: .
Q: When is a function invertible? A: Only if bijective.
Q: Example of non‑invertible function? A: .
Q: What is an equivalence class? A: Subset where all elements are related.
Q: Difference between finite and infinite sets in bijection? A: For finite sets, one‑one ⇒ onto; for infinite sets, not necessarily.
Q: What is the greatest integer function? A: , not one‑one, not onto.
Q: What is the modulus function? A: , not one‑one, not onto.
Q: What is the signum function? A: if , if , if .
Q: What is the inverse of ? A: .
Q: How many one‑one functions from to itself? A: 3! = 6.
Conclusion
Relations and functions are central to advanced mathematics. By mastering equivalence relations, types of functions, and invertibility, you gain tools essential for calculus, algebra, and beyond. Practice NCERT exercises thoroughly to strengthen your understanding.
visit: www.fuzymathacademy.com




























Comments
Post a Comment