Relations and Functions | Class 12 Mathematics Chapter 1 Notes
Interactive Visual Walkthrough
Relations & Functions 5 scenes - relation explorer, equivalence class lab, function machine, counting calculator, quiz.
Home / Class 12 / Mathematics / Chapter 1
Relations and Functions
संबंध एवं फलन
Relations ke types, equivalence classes aur one-one/onto ka full game
Long Notes — Full Explanation
Concept pakka karne ke liye — aaram se padho
1️⃣ Relation Kya Hota Hai — Sets Ke Beech Connection
- Relation: do sets A aur B ke elements ke beech connection — mathematically, A × B (Cartesian product) ka koi bhi subset ek relation hai. (a, b) ∈ R matlab "a ka b se relation hai".
- Cartesian product A × B: saare ordered pairs (a, b) jahan a ∈ A, b ∈ B. n(A × B) = n(A) × n(B).
- Domain: relation me aa rahe saare first elements. Range: saare second elements. Codomain: poora B set (range ⊆ codomain!).
- A set pe total relations: agar n(A) = n, to A × A ke 2^(n²) subsets → 2^(n²) possible relations!
💡 Feel: relation = pairing ka rule. "Is brother of" bhi ek relation hai logon ke set pe!
2️⃣ Relations Ke Types — Reflexive, Symmetric, Transitive ⭐
- Empty relation: koi pair nahi. Universal relation: saare pairs (poora A × A).
- Reflexive ⭐: HAR element ka khud se relation — (a, a) ∈ R sab a ke liye. ("Is equal to" reflexive hai; "is sister of" nahi!)
- Symmetric ⭐: (a, b) ∈ R → (b, a) ∈ R — relation dono taraf chale. (a ⊥ b symmetric hai.)
- Transitive ⭐: (a, b) ∈ R aur (b, c) ∈ R → (a, c) ∈ R — chain complete ho. (a > b, b > c → a > c: transitive!)
- Check karte time: ek bhi counterexample kaafi hai relation todne ke liye; prove karne ke liye SAB pairs check karo.
🎯 Symmetric + Transitive ≠ Reflexive zaroori nahi! Empty relation symmetric aur transitive dono hai, par reflexive nahi. Classic trap!
3️⃣ Equivalence Relation aur Equivalence Classes ⭐
- Equivalence relation ⭐⭐: jo relation REFLEXIVE + SYMMETRIC + TRANSITIVE teeno ho. Example: "is congruent to" triangles pe, "a − b even hai" integers pe.
- Equivalence class [a]: a se related SAARE elements ka set — [a] = {x : (x, a) ∈ R}. Equivalence classes ya to barabar hoti hain ya disjoint — kabhi partial overlap nahi!
- Equivalence relation set ko partitions me tod deta hai — har element exactly ek class me.
- Example: Z pe R = {(a, b) : a − b, 3 se divisible hai} → classes [0], [1], [2] (remainders!). Yehi modulo arithmetic ka base hai.
💡 Equivalence relation = "same category" ka formal version. Classes = alag-alag dabbe jisme samaan sort ho jaata hai.
4️⃣ Functions — One-One aur Onto ⭐
- Function f : A → B: har input ka EXACTLY ek output. Har element of A use hona chahiye, aur sirf ek baar map ho.
- One-one (injective) ⭐: alag inputs → alag outputs. f(x₁) = f(x₂) → x₁ = x₂. Horizontal line test: koi horizontal line graph ko ek se zyada baar na kaate.
- Onto (surjective) ⭐: codomain ka HAR element kisi ka image ho — range = codomain. Koi bhi b ∈ B ke liye f(a) = b ka solution mile.
- Bijective ⭐⭐: one-one + onto dono — perfect matching! Tabhi inverse ban sakta hai (par NCERT me inverse function ab deleted hai — bas concept samjho).
- Many-one: multiple inputs same output (f(x) = x² pe 2 aur −2 dono → 4). Into: kuch codomain elements unused.
🎯 f(x) = x²: R → R me one-one NAHI (±2 same image), onto NAHI (negatives ka preimage nahi). Domain/codomain badalte hi answer badal jaata hai — hamesha dono padho!
5️⃣ Functions Ginna aur Smart Checks
- n(A) = m, n(B) = n → total functions A → B: n^m (har element ke n choices).
- One-one functions (m ≤ n): ⁿPₘ = n!/(n−m)!. m > n ho to ZERO one-one functions!
- Bijections jab n(A) = n(B) = n: n! — aur tab har onto function apne aap one-one bhi hota hai. ⭐
- Strictly increasing/decreasing function hamesha one-one hota hai (calculus me yahi use hota hai).
- Odd function ya even ho sakta hai: f(−x) = −f(x) (odd), f(−x) = f(x) (even) — one-one check me kaam aata hai.
💡 Finite sets pe: one-one ⟺ onto ⟺ bijective. Infinite pe ye nahi chalta (f(n) = 2n pe N → even numbers: one-one hai par... socho!)
1️⃣ संबंध क्या है — समुच्चयों के बीच कनेक्शन
- संबंध (relation): दो समुच्चयों A और B के अवयवों के बीच संबंध — A × B का कोई भी उपसमुच्चय एक संबंध है।
- कार्तीय गुणन A × B: सभी क्रमित युग्म (a, b) जहां a ∈ A, b ∈ B। n(A × B) = n(A) × n(B)।
- प्रांत (domain): सभी प्रथम अवयव। परिसर (range): सभी द्वितीय अवयव। सहप्रांत (codomain): पूरा B।
- n अवयवों वाले समुच्चय पर कुल संबंध: 2^(n²)।
💡 संबंध = युग्म बनाने का नियम।
2️⃣ संबंधों के प्रकार — स्वतुल्य, सममित, संक्रामक ⭐
- रिक्त संबंध: कोई युग्म नहीं। सार्वत्रिक संबंध: सभी युग्म।
- स्वतुल्य ⭐: प्रत्येक अवयव का स्वयं से संबंध — सभी a के लिए (a, a) ∈ R।
- सममित ⭐: (a, b) ∈ R → (b, a) ∈ R — संबंध दोनों ओर चले।
- संक्रामक ⭐: (a, b) ∈ R और (b, c) ∈ R → (a, c) ∈ R।
- खंडन के लिए एक प्रत्युदाहरण पर्याप्त है; सिद्ध करने के लिए सभी युग्म जांचें।
🎯 सममित + संक्रामक ≠ स्वतुल्य आवश्यक नहीं! रिक्त संबंध सममित और संक्रामक है, पर स्वतुल्य नहीं।
3️⃣ तुल्यता संबंध और तुल्यता वर्ग ⭐
- तुल्यता संबंध ⭐⭐: जो स्वतुल्य + सममित + संक्रामक तीनों हो। उदाहरण: "a − b सम है" पूर्णांकों पर।
- तुल्यता वर्ग [a]: a से संबंधित सभी अवयव — [a] = {x : (x, a) ∈ R}। वर्ग या तो समान होते हैं या असंयुक्त।
- तुल्यता संबंध समुच्चय को विभाजनों में बांटता है — प्रत्येक अवयव ठीक एक वर्ग में।
- उदाहरण: Z पर R = {(a, b) : a − b, 3 से विभाज्य} → वर्ग [0], [1], [2]।
💡 तुल्यता संबंध = "समान श्रेणी" का औपचारिक रूप।
4️⃣ फलन — एकैकी और आच्छादक ⭐
- फलन f : A → B: प्रत्येक इनपुट का ठीक एक आउटपुट।
- एकैकी (injective) ⭐: भिन्न इनपुट → भिन्न आउटपुट। f(x₁) = f(x₂) → x₁ = x₂।
- आच्छादक (surjective) ⭐: सहप्रांत का प्रत्येक अवयव किसी का प्रतिबिंब हो — परिसर = सहप्रांत।
- एकैकी आच्छादक (bijective) ⭐⭐: एकैकी + आच्छादक दोनों — पूर्ण मिलान!
- बहु-एकैकी: कई इनपुट एक ही आउटपुट। अंतःक्षेपी: कुछ सहप्रांत अवयव अप्रयुक्त।
🎯 f(x) = x², R → R: एकैकी नहीं, आच्छादक नहीं। प्रांत/सहप्रांत बदलते ही उत्तर बदल जाता है!
5️⃣ फलनों की गिनती और स्मार्ट जांच
- n(A) = m, n(B) = n → कुल फलन: n^m।
- एकैकी फलन (m ≤ n): ⁿPₘ = n!/(n−m)!। m > n हो तो शून्य!
- एकैकी आच्छादक (जब n(A) = n(B) = n): n! — तब प्रत्येक आच्छादक फलन स्वतः एकैकी। ⭐
- निरंतर वर्धमान/ह्रासमान फलन सदैव एकैकी।
- विषम फलन: f(−x) = −f(x); सम फलन: f(−x) = f(x)।
💡 परिमित समुच्चयों पर: एकैकी ⟺ आच्छादक ⟺ एकैकी आच्छादक।
1️⃣ What Is a Relation — Connecting Two Sets
- Relation: a connection between elements of sets A and B — mathematically, any subset of A × B (the Cartesian product) is a relation. (a, b) ∈ R means "a is related to b".
- Cartesian product A × B: all ordered pairs (a, b) with a ∈ A, b ∈ B. n(A × B) = n(A) × n(B).
- Domain: all first elements in the relation. Range: all second elements. Codomain: the whole set B (range ⊆ codomain!).
- Relations on a set with n elements: A × A has 2^(n²) subsets → 2^(n²) possible relations!
💡 Feel: a relation is a pairing rule. "Is a brother of" is a relation on a set of people!
2️⃣ Types of Relations — Reflexive, Symmetric, Transitive ⭐
- Empty relation: no pairs. Universal relation: all pairs (the full A × A).
- Reflexive ⭐: EVERY element relates to itself — (a, a) ∈ R for all a. ("Is equal to" is reflexive; "is sister of" is not!)
- Symmetric ⭐: (a, b) ∈ R → (b, a) ∈ R — the relation runs both ways.
- Transitive ⭐: (a, b) ∈ R and (b, c) ∈ R → (a, c) ∈ R — the chain must complete.
- While checking: one counterexample is enough to break a property; to prove it, check ALL pairs.
🎯 Symmetric + Transitive does NOT force Reflexive! The empty relation is symmetric and transitive, but not reflexive. Classic trap!
3️⃣ Equivalence Relations and Classes ⭐
- Equivalence relation ⭐⭐: one that is REFLEXIVE + SYMMETRIC + TRANSITIVE — all three. Example: "a − b is even" on integers.
- Equivalence class [a]: ALL elements related to a — [a] = {x : (x, a) ∈ R}. Two classes are either equal or disjoint — never partially overlapping!
- An equivalence relation splits the set into partitions — every element lands in exactly one class.
- Example: R = {(a, b) : a − b divisible by 3} on Z → classes [0], [1], [2] (the remainders!). This is the base of modular arithmetic.
💡 An equivalence relation formalizes "same category". Classes = separate boxes into which everything gets sorted.
4️⃣ Functions — One-One and Onto ⭐
- Function f : A → B: every input has EXACTLY one output. Every element of A must be used, exactly once.
- One-one (injective) ⭐: different inputs → different outputs. f(x₁) = f(x₂) → x₁ = x₂. Horizontal line test: no horizontal line cuts the graph more than once.
- Onto (surjective) ⭐: EVERY codomain element is some input's image — range = codomain. For every b ∈ B, f(a) = b has a solution.
- Bijective ⭐⭐: one-one AND onto — a perfect matching!
- Many-one: several inputs share an output (on f(x) = x², both 2 and −2 map to 4). Into: some codomain elements stay unused.
🎯 f(x) = x², R → R: NOT one-one (±2 give the same image), NOT onto (negatives have no preimage). Change the domain/codomain and the answer changes — always read both!
5️⃣ Counting Functions and Smart Checks
- n(A) = m, n(B) = n → total functions A → B: n^m (each element gets n choices).
- One-one functions (m ≤ n): ⁿPₘ = n!/(n−m)!. If m > n, there are ZERO one-one functions!
- Bijections when n(A) = n(B) = n: n! — and then every onto function is automatically one-one. ⭐
- A strictly increasing/decreasing function is always one-one (used heavily in calculus).
- Odd/even functions: f(−x) = −f(x) (odd), f(−x) = f(x) (even) — handy in one-one checks.
💡 On finite sets: one-one ⟺ onto ⟺ bijective. On infinite sets this fails (f(n) = 2n on N → even numbers is one-one but not onto!)
Short Notes — Quick Revision
Exam se pehle sirf yeh dohrao
Relation basics
- Relation = A × B ka subset
- Domain = first elements, Range = second
- n elements pe 2^(n²) relations
Types ⭐
- Reflexive: (a,a) sabke liye
- Symmetric: (a,b) → (b,a)
- Transitive: (a,b),(b,c) → (a,c)
Equivalence ⭐
- R + S + T teeno chahiye
- Equivalence class [a] = a se related sab
- Classes: barabar ya disjoint
Functions ⭐
- One-one: alag input → alag output
- Onto: range = codomain
- Bijective = one-one + onto
Counting ⭐
- Total functions: n^m
- One-one: ⁿPₘ
- Bijections (equal sets): n!
मूल
- संबंध = A × B का उपसमुच्चय
- प्रांत = प्रथम अवयव, परिसर = द्वितीय
- n अवयवों पर 2^(n²) संबंध
प्रकार ⭐
- स्वतुल्य: (a,a) सभी के लिए
- सममित: (a,b) → (b,a)
- संक्रामक: (a,b),(b,c) → (a,c)
तुल्यता ⭐
- स्वतुल्य + सममित + संक्रामक
- वर्ग [a] = a से संबंधित सभी
- वर्ग: समान या असंयुक्त
फलन ⭐
- एकैकी: भिन्न इनपुट → भिन्न आउटपुट
- आच्छादक: परिसर = सहप्रांत
- एकैकी आच्छादक = दोनों
गिनती ⭐
- कुल फलन: n^m
- एकैकी: ⁿPₘ
- एकैकी आच्छादक (समान समुच्चय): n!
Relation basics
- Relation = subset of A × B
- Domain = first elements, Range = second
- n elements → 2^(n²) relations
Types ⭐
- Reflexive: (a,a) for all
- Symmetric: (a,b) → (b,a)
- Transitive: (a,b),(b,c) → (a,c)
Equivalence ⭐
- Needs R + S + T
- Class [a] = everything related to a
- Classes: equal or disjoint
Functions ⭐
- One-one: distinct inputs → distinct outputs
- Onto: range = codomain
- Bijective = one-one + onto
Counting ⭐
- Total functions: n^m
- One-one: ⁿPₘ
- Bijections (equal sets): n!
JEE Practice — 10 Questions
Pehle khud solve karo, phir answer dekho.
Answer dekho
n(A) = 3 → A × A me 9 pairs → 2⁹ = 512 relations.
Answer dekho
Haan — har a ke liye (a, a) ∈ R kyunki a = a. (Symmetric aur transitive bhi hai — equivalence relation!)
Answer dekho
Nahi — 1 < 2 matlab (1, 2) ∈ R, par 2 < 1 false hai, to (2, 1) ∉ R.
Answer dekho
A friend of B aur B friend of C ka matlab ye nahi ki A friend of C — transitive fail. Dosti chain guarantee nahi deti!
Answer dekho
[a] = {x : (x, a) ∈ R} — a se related saare elements ka set. Do classes ya to same hoti hain ya disjoint.
Answer dekho
Nahi — f(2) = f(−2) = 4, alag inputs ka same output.
Answer dekho
Haan — koi bhi y ∈ R ke liye x = (y − 3)/2 ∈ R deta hai f(x) = y. Range = codomain. (One-one bhi hai → bijective!)
Answer dekho
⁵P₃ = 5×4×3 = 60.
Answer dekho
4! = 24 — equal finite sets pe bijection = permutation.
Answer dekho
Zaroori nahi — empty relation (ya {(a,b),(b,a),(a,a),(b,b)} jaisa partial) counterexample hai. Sab elements ka self-pair hona alag se check karna padta hai.
Comments
Post a Comment