Home / Class 12 / Mathematics / Chapter 1
संबंध एवं फलन
Relations ke types, equivalence classes aur one-one/onto ka full game
Relations & Functions 5 animated scenes mein - relation explorer (LIVE checker!), equivalence class lab, function machine (one-one/onto arrows!), counting calculator, aur quiz.
Walkthrough Kholo →Concept pakka karne ke liye — aaram se padho
💡 Feel: relation = pairing ka rule. "Is brother of" bhi ek relation hai logon ke set pe!
🎯 Symmetric + Transitive ≠ Reflexive zaroori nahi! Empty relation symmetric aur transitive dono hai, par reflexive nahi. Classic trap!
💡 Equivalence relation = "same category" ka formal version. Classes = alag-alag dabbe jisme samaan sort ho jaata hai.
🎯 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!
💡 Finite sets pe: one-one ⟺ onto ⟺ bijective. Infinite pe ye nahi chalta (f(n) = 2n pe N → even numbers: one-one hai par... socho!)
💡 संबंध = युग्म बनाने का नियम।
🎯 सममित + संक्रामक ≠ स्वतुल्य आवश्यक नहीं! रिक्त संबंध सममित और संक्रामक है, पर स्वतुल्य नहीं।
💡 तुल्यता संबंध = "समान श्रेणी" का औपचारिक रूप।
🎯 f(x) = x², R → R: एकैकी नहीं, आच्छादक नहीं। प्रांत/सहप्रांत बदलते ही उत्तर बदल जाता है!
💡 परिमित समुच्चयों पर: एकैकी ⟺ आच्छादक ⟺ एकैकी आच्छादक।
💡 Feel: a relation is a pairing rule. "Is a brother of" is a relation on a set of people!
🎯 Symmetric + Transitive does NOT force Reflexive! The empty relation is symmetric and transitive, but not reflexive. Classic trap!
💡 An equivalence relation formalizes "same category". Classes = separate boxes into which everything gets sorted.
🎯 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!
💡 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!)
Exam se pehle sirf yeh dohrao
Pehle khud solve karo, phir answer dekho.
n(A) = 3 → A × A me 9 pairs → 2⁹ = 512 relations.
Haan — har a ke liye (a, a) ∈ R kyunki a = a. (Symmetric aur transitive bhi hai — equivalence relation!)
Nahi — 1 < 2 matlab (1, 2) ∈ R, par 2 < 1 false hai, to (2, 1) ∉ R.
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!
[a] = {x : (x, a) ∈ R} — a se related saare elements ka set. Do classes ya to same hoti hain ya disjoint.
Nahi — f(2) = f(−2) = 4, alag inputs ka same output.
Haan — koi bhi y ∈ R ke liye x = (y − 3)/2 ∈ R deta hai f(x) = y. Range = codomain. (One-one bhi hai → bijective!)
⁵P₃ = 5×4×3 = 60.
4! = 24 — equal finite sets pe bijection = permutation.
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.