Complete Summary and Solutions for Relations and Functions – NCERT Class XII Mathematics Part I, Chapter 1 – Types of Relations, Functions, Domain, Range, Types of Functions, Composition, Inverse Functions

Comprehensive summary and explanation of Chapter 1 'Relations and Functions' from NCERT Class XII Mathematics Part I textbook, covering ordered pairs, Cartesian product, different types of relations, types of functions including one-one, onto, bijection, composition and inverse of functions, with examples, properties, and all NCERT exercises and solutions.

Updated: 2 days ago

Categories: NCERT, Class XII, Mathematics Part I, Chapter 1, Relations, Functions, Domain, Range, Composition, Inverse, Summary, Questions, Answers
Tags: Relations, Functions, Domain, Range, One-one Function, Onto Function, Bijection, Composition of Functions, Inverse Functions, NCERT, Class 12, Mathematics, Summary, Explanation, Questions, Answers, Chapter 1
Post Thumbnail
Relations and Functions - Class 12 Mathematics Chapter 1 Ultimate Study Guide 2025

Relations and Functions

Chapter 1: Mathematics - Ultimate Study Guide | NCERT Class 12 Notes, Solved Examples, Exercises & Quiz 2025

Full Chapter Summary & Detailed Notes - Relations and Functions Class 12 NCERT

Overview & Key Concepts

  • Chapter Goal: Build on Class XI; focus on types of relations (reflexive, symmetric, transitive, equivalence), functions (one-one, onto, bijective), composition, invertible. Exam Focus: Definitions (3-7), Examples (1-26), Equivalence classes, Finite vs Infinite sets. Fun Fact: Equivalence partitions sets. Core Idea: Relations as subsets; functions as special relations. Real-World: Congruence in geometry. Expanded: All subtopics point-wise with evidence (e.g., Ex 2 congruence), examples (e.g., even/odd integers), debates (finite bijection vs infinite).
  • Wider Scope: From relations to binary ops tease; sources: Pages 1-17, Figs 1.1-1.5.
  • Expanded Content: Include composition/invertible; point-wise for recall; add 2025 relevance like graph theory apps.

1.1 Introduction

  • Relations: Subset of \( A \times B \); \( aRb \) if \( (a,b) \in R \). Ex: Students A to B (brother/sister, age, marks).
  • Functions: Special relations (Class XI review: domain, codomain, range).
  • Objectives: Types of relations/functions, composition, invertible, binary ops.
  • Expanded: Evidence: English analogy; debates: Abstract vs real links.
Conceptual Diagram: Relation vs Function

Relation: Arrows from A to B (any pairs). Function: Exactly one arrow per A element. Ties to Fig 1.2.

Why This Guide Stands Out

Comprehensive: All subtopics point-wise, solved examples integrated; 2025 with proofs, processes analyzed for injectivity/surjectivity.

1.2 Types of Relations

  • Empty/Universal: \( R = \phi \), \( R = A \times A \). Ex 1: Boys school sister (empty), height diff <3m (universal).
  • Reflexive/Symmetric/Transitive: Def 3 (i-iii). Symmetric: \( aRb \implies bRa \).
  • Equivalence: All three (Def 4). Ex 2: Congruent triangles (Fig 1.1). Ex 3: Perpendicular lines (symmetric, not ref/trans). Ex 4: {1,2,3} partial. Ex 5: Even diff in Z.
  • Equivalence Classes: Partitions [a] = {b | bRa}. Ex: Even/odd [0],[1]; mod 3 [0],[1],[2]. Ex 6: Odd/even in {1-7}.
  • Expanded: Evidence: Partitions disjoint/union A; reverse: Subsets define R.

Quick Table: Types of Relations

TypeDefinitionExample
EmptyNo pairsSister in boys school
UniversalAll pairsHeight diff <3m
Reflexive\( (a,a) \in R \)Even diff
Symmetric\( aRb \implies bRa \)Perpendicular
Transitive\( aRb, bRc \implies aRc \)Congruent
EquivalenceAll threeMod 3 classes

1.3 Types of Functions

  • One-One (Injective): Def 5; distinct images. Ex 7: Roll no. (one-one, not onto). Ex 8: \( f(x)=2x \) N→N.
  • Onto (Surjective): Def 6; every y image. Remark: Range=Y.
  • Bijective: Both (Def 7). Ex 9: \( f(x)=2x \) R→R. Ex 10: Piecewise N→N onto not one-one. Ex 11: \( x^2 \) neither. Ex 12: Odd/even shift bijective.
  • Finite Sets: One-one iff onto (Ex 13-14). Infinite: Not (Ex 8,10).
  • Expanded: Evidence: Diagrams Fig 1.2; debates: Infinite counterexamples.

1.4 Composition & Invertible

  • Composition: Def 8 \( (g \circ f)(x) = g(f(x)) \). Ex 15: Sets {2,3,4,5}→{7,11}. Ex 16: cos x & 3x² ≠ commute (Fig 1.5).
  • Invertible: Def 9; \( g \circ f = I_X, f \circ g = I_Y \). Bijection iff invertible. Ex 17: \( f(x)=4x+3 \) N→Y; inverse \( g(y)=(y-3)/4 \).
  • Expanded: Evidence: Proves bijection; real: Encryption functions.

Miscellaneous Examples

  • Ex 18: Intersection equivalence. Ex 19: Ordered pairs xv=yu. Ex 20: Mod 3 same as subsets. Ex 21: Kernel equivalence. Ex 22: 3! one-one. Ex 23: 3 relations reflexive/trans not sym. Ex 24: 2 equiv containing (1,2)(2,1). Ex 25: IN onto, 2IN not. Ex 26: sin+cos not one-one.
  • Expanded: Evidence: Proofs; debates: Finite permutations.

Summary & Exercises

  • Key Takeaways: Relations classify; functions map uniquely; bijections invert.
  • Exercises Tease: Check properties; prove bijections.