Goal: ek matrix dekho aur ek dam se jawab do "invertible hai ya nahi?" aur "determinant kya hai?" bina poori recipe chalaye.
Recall Solution 1.1
Hum kya karenge:detA=ad−bc apply karo a=3,b=2,c=5,d=4 ke saath.
Kyun: invertibility poori tarah determinant se decide hoti hai — yes/no question ka jawab dene ke liye inverse banana zaroori nahi.
detA=(3)(4)−(2)(5)=12−10=2.
Kyunki detA=2=0, A invertible hai (non-singular).
Recall Solution 1.2
Hum kya karenge: har determinant compute karo; singular matlab woh 0 ke barabar ho.
detP=(1)(4)−(2)(2)=4−4=0 → singular (row 2, row 1 ka 2× hai).
detQ=(6)(2)−(3)(4)=12−12=0 → singular (row 1, row 2 ka 1.5× hai).
detR=(0)(0)−(5)(5)=0−25=−25=0 → invertible (negative determinant theek hai — iska matlab sirf itna hai ki transform orientation flip karta hai, dekho Linear transformations and area).
R log ko kyun surprised karta hai: diagonal par do zeros hona degenerate lagta hai, lekin degeneracy parallel columns ke baare mein hai, na ki zeros kisi bhi jagah hone ke baare mein.
Goal: swap–negate–divide recipe ko shuru se aakhir tak, sahi tarike se run karo.
Recall Solution 2.1
Step 1 — determinant (hamesha pehle).detA=(4)(2)−(3)(3)=8−9=−1. Non-zero ⟹ aage badho.
Kyun pehle? Poori recipe detA se divide karti hai; agar woh 0 hota to inverse exist hi nahi karta aur baad ke har step waste ho jaate (zero se division). Ise pehle compute karna dead end pakadne ka sabse sasta tarika hai.
Step 2 — adjugate. Corners 4↔2 swap karo, middle 3→−3 flip karo (yahi upar define kiya hua adjA hai):
adjA=(2−3−34).Step 3 — det se divide karo.A−1=−11(2−3−34)=(−233−4).Step 4 — verify (sasti insurance): (4332)(−233−4)=(−8+9−6+612−129−8)=(1001)=I ✓.
Recall Solution 2.2
Step 1 — pehle determinant.detB=(1)(5)−(2)(3)=5−6=−1 (non-zero ⟹ inverse exist karta hai).
Step 2 — adjugate phir divide.B−1=−11(5−3−21)=(−532−1).Step 3 — solve karo.Bx=b ko left-multiply karo B−1 se taaki x=B−1b mile (dekho Solving linear systems):
x=(−532−1)(74)=(3(4)+(−1)(7)(−5)(4)+2(7))=(12−7−20+14)=(5−6).Check:1(−6)+2(5)=−6+10=4 ✓, 3(−6)+5(5)=−18+25=7 ✓. To x=−6,y=5.
Goal: machinery ke baare mein reason karo — det kaise behave karta hai, edge par kya hota hai.
Recall Solution 3.1
detA=(2)(3)−(0)(1)=6.
A−1=61(3−102)=(1/2−1/601/3).det(A−1)=(21)(31)−(0)(−61)=61.Relationship:det(A−1)=detA1.
Kyun yeh sach hona hi chahiye (area picture):A har area ko detA=6 factor se scale karta hai. Undo-machine A−1 ko area ko reciprocal 61 se scale karna chahiye taaki dono karne par original area wapas aaye — dekho Linear transformations and area.
Recall Solution 3.2
Singular condition:detM=k⋅k−2⋅8=k2−16=0⇒k=±4.
To M ka koi inverse nahi hoga exactly jab ==k=4== ya ==k=−4== (do rows proportional ho jaati hain).
Otherwise (k=±4):
M−1=k2−161(k−8−2k).Sanity check k=6 par:det=36−16=20, M−1=201(6−8−26); wapas multiply karo I confirm karne ke liye.
Goal: inverse ko multiplication, identities aur systems ke saath combine karo.
Recall Solution 4.1
Proof. Yeh dikhane ke liye ki matrix X, AB ka inverse hai, yeh kaafi hai ki (AB)X=I dikhao (dekho Identity matrix). X=B−1A−1 lo:
(AB)(B−1A−1)=A(BB−1)A−1=AIA−1=AA−1=I.
Humne associativity use ki regroup karne ke liye, phir BB−1=I aur I multiplication ke under disappear ho jaata hai. To (AB)−1=B−1A−1.
Order kyun flip hota hai (glove picture): "pehle socks, phir shoes" ko undo karne ke liye tumhe "pehle shoes utaro, phir socks" karna hoga — pehle last operation reverse karo.
Numeric check.AB=(1011)(2002)=(2022), det=4, to
(AB)−1=41(20−22)=(1/20−1/21/2).
Alag se A−1=(10−11), B−1=(1/2001/2), aur
B−1A−1=(1/2001/2)(10−11)=(1/20−1/21/2).
Match ✓.
Recall Solution 4.2
Key idea:(A−1)−1=A — undo ka undo original return karta hai. To bas di gayi matrix ko invert karo.
Maano C=A−1. detC=(2)(2)−(−1)(−3)=4−3=1.A=C−1=11(2312)=(2312).Check:AA−1=(2312)(2−3−12)=(4−36−6−2+2−3+4)=I ✓.
Goal: ek general fact prove karo aur ek fully symbolic / limiting case handle karo.
Recall Solution 5.1
Step 1 — A2 compute karoA=(acbd) ke liye:
A2=(a2+bcca+dcab+bdcb+d2)=(a2+bcc(a+d)b(a+d)d2+bc).Step 2 — (a+d)A subtract karo:A2−(a+d)A=(a2+bc−a(a+d)00d2+bc−d(a+d))=(bc−ad00bc−ad)=−(detA)I.Step 3 — rearrange karo:A2−(a+d)A+(detA)I=O ✓ (yeh identity har2×2 matrix ke liye hold karti hai).
Step 4 — inverse extract karo. Maano detA=0. Pehle do terms mein se A factor out karo:
A(A−(a+d)I)=−(detA)I⇒A⋅detA(a+d)I−A=I.
Isliye
A−1=detA(a+d)I−A=detA1(d−c−ba),
jo bilkul adjugate formula hai — pure algebra se recover hua, koi hand-swapping nahi.
Yeh beautiful kyun hai: wahi swap/negate pattern jo parent note ne chaar equations solve karke nikala tha, woh ek polynomial identity se nikal aata hai.
Recall Solution 5.2
Step 1 — determinant.detAε=(1)(1+ε)−(1)(1)=1+ε−1=ε.Step 2 — inverse (corners swap, middle flip, ε se divide karo):
Aε−1=ε1(1+ε−1−11)=(ε1+ε−ε1−ε1ε1).Step 3 — limiting behaviour. Jaise ε→0+, divisor ε zero ki taraf shrink hota hai, to har entry ε1,ε1+ε→+∞ (aur −ε1→−∞): inverse bina bound ke blow up ho jaata hai.
Step 4 — singular limit. Exactly ε=0 par hamare paas A0=(1111) hai jiska detA0=0 hai aur do identical (isliye parallel) columns hain, to A0 singular hai: koi inverse exist hi nahi karta. Step 3 mein blow-up algebra ka woh warning hai, jaise tum us wall ke paas aate ho, ki undo-machine impossible hone wali hai.
The story (edge picture): near-singular matrices ke inverses huge, unstable hote hain — input data mein thodi si wobble 1/ε factor se amplify ho jaati hai. Wall ε=0 par area ek line mein collapse ho jaata hai aur inverse bilkul exist karna band kar deta hai. Isliye tiny determinant se divide karna numerically dangerous hai — dekho Singular vs non-singular matrices.
Neeche wali figure exactly is collapse ko plot karti hai.