4.5.14 · Maths › Linear Algebra (Full)
Intuition Theorem ki ek-line soul
Ek linear map T : V → W ek n -dimensional input space ko leta hai aur uske dimensions ko do kamon mein baant deta hai: kuch dimensions zero mein crush ho jaate hain (the kernel), aur baki faithfully bahar bhej diye jaate hain (the image). Koi bhi dimension na kho jaata hai, na naya banta hai — bas sort ho jaata hai. Isliye
crushed dim ( ker T ) + shipped dim ( im T ) = total input dim V .
Definition Rank–Nullity Theorem
Maano V ek finite-dimensional vector space hai field F ke upar, aur T : V → W ek linear map hai. Tab
rank ( T ) + nullity ( T ) = dim V
jahan
Rank = dim ( im T ) , yaani T ke image (range) ki dimension.
Nullity = dim ( ker T ) , yaani T ke kernel (null space) ki dimension, matlab { v ∈ V : T ( v ) = 0 } .
ker T , V ka subspace hai (the input side).
im T , W ka subspace hai (the output side).
Dhyan raho dono numbers milke dim V dete hain — domain ki dimension , codomain W ki nahi.
Intuition Dimensions ka conservation
V ke basis ko n "directions" ki tarah socho. Unhe T se pass karo.
Kuch combinations 0 mein collapse ho jaati hain — woh ker T mein rehti hain. Maano k independent collapsing directions hain.
Baaki n − k directions output mein independently survive karti hain (agar koi survivor baaki par dependent hoti, toh woh secretly kernel mein hoti). Woh n − k survivors im T mein span karti hain aur independent hain .
Toh image dimension = n − k , kernel dimension = k , aur dono milke n dete hain. Neeche ka proof bas is picture ko airtight banata hai.
Hum ise carefully build karte hain. Key trick hai Basis Extension Theorem : kisi bhi subspace ke basis ko poore space ke basis tak extend kiya ja sakta hai.
Setup. Maano dim V = n . Maano nullity ( T ) = k , toh kernel ka ek basis chuno:
{ u 1 , … , u k } a basis of ker T .
Step 1 — Extend. Kyunki ker T ⊆ V hai, ise poore V ke basis tak extend karo:
{ u 1 , … , u k , v 1 , … , v n − k } a basis of V .
Yeh step kyun? Basis-extension theorem guarantee karta hai ki hum n − k vectors add karke V ka full basis bana sakte hain. Yeh "kernel part" ko "baaki sab" se saaf taur par alag kar deta hai.
Claim: B = { T ( v 1 ) , … , T ( v n − k )} is a basis of im T . Agar hum yeh prove kar lein, tab dim ( im T ) = n − k hoga, aur
rank + nullity = ( n − k ) + k = n = dim V . ■
Toh hume dikhana hai ki B (a) spans im T aur (b) is linearly independent .
Step 2 — B spans im T .
Koi bhi w ∈ im T lo, toh w = T ( v ) kisi v ∈ V ke liye. v ko full basis mein likho:
v = ∑ i = 1 k a i u i + ∑ j = 1 n − k b j v j .
T apply karo (linear hai), aur T ( u i ) = 0 use karo kyunki har u i ∈ ker T :
w = T ( v ) = ∑ a i = 0 T ( u i ) + ∑ b j T ( v j ) = ∑ j = 1 n − k b j T ( v j ) .
Yeh step kyun? Har output sirf survivors T ( v j ) se banta hai — kernel directions kuch contribute nahi karti. Isliye B , image ko span karta hai. ✓
Step 3 — B is linearly independent.
Maano ∑ j = 1 n − k c j T ( v j ) = 0 . Linearity se:
T ( ∑ j c j v j ) = 0 ⟹ ∑ j c j v j ∈ ker T .
Yeh step kyun? Agar survivor-outputs ka koi combination zero hai, toh inputs ka matching combination kernel mein hai — humhe wapas u i par le jaata hai.
Kyunki { u 1 , … , u k } is a basis of ker T , hum likh sakte hain
∑ j c j v j = ∑ i d i u i ⟹ ∑ j c j v j − ∑ i d i u i = 0.
Lekin { u 1 , … , u k , v 1 , … , v n − k } is a basis of V , isliye linearly independent hai, toh saare coefficients zero ho jaate hain:
c 1 = ⋯ = c n − k = 0 ( aur d i = 0 ) .
Yeh step kyun? V ke poore basis ki independence c j ko zero hone par majboor karti hai — yahi hume chahiye tha. ✓
Dono (a) aur (b) hold karte hain, toh B , im T ka ek basis hai jiska size n − k hai. Ho gaya.
Worked example Example 1 — ek projection
R 3 → R 3
T ( x , y , z ) = ( x , y , 0 ) (z -coordinate drop kar do).
Kernel: T ( v ) = 0 ke liye x = y = 0 chahiye, z free ⇒ ker T = {( 0 , 0 , z )} , toh nullity = 1 .
Kyun? Sirf z -axis crush hoti hai.
Image: outputs sab ( x , y , 0 ) hain, yaani x y -plane ⇒ rank = 2 .
Kyun? Do independent survivors T ( e 1 ) , T ( e 2 ) .
Check: 2 + 1 = 3 = dim R 3 . ✓
Worked example Example 2 — ek
2 × 3 matrix
A = ( 1 2 2 4 3 6 ) , jo T : R 3 → R 2 ki tarah dekha gaya.
Row reduce karo: row 2 = 2 × row 1, toh sirf 1 pivot ⇒ rank = 1 .
Kyun? Rank = independent rows/pivots ki sankhya = column space (image) ki dimension.
Rank–nullity: nullity = dim V − rank = 3 − 1 = 2 .
Kyun? Hume nullity free mein milti hai bina system solve kiye — yahi theorem ki power hai.
Verify: A x = 0 ⇒ x 1 + 2 x 2 + 3 x 3 = 0 , ek equation mein 3 unknowns ⇒ 2 free variables ⇒ nullity 2 . ✓
Worked example Example 3 — polynomials par derivative
V = P 3 (degree ≤ 3 ke polynomials, dim = 4 ). T = d x d : P 3 → P 3 .
Kernel: p ′ = 0 matlab p constant hai ⇒ ker T = { constants } , nullity = 1 .
Image: { 1 , x , x 2 , x 3 } ke derivatives { 0 , 1 , 2 x , 3 x 2 } dete hain, jo P 2 ko span karte hain ⇒ rank = 3 .
Check: 3 + 1 = 4 = dim P 3 . ✓
Yeh kyun matter karta hai: theorem abstract spaces par bhi apply hota hai, sirf R n par nahi.
dim W , the codomain, ke barabar hona chahiye."
Kyun sahi lagta hai: image W ke andar rehti hai, toh W se balance karna tempting lagta hai.
Fix: rank + nullity yeh count karta hai ki input V kaise partition hoti hai. Image ek bade W ka chhota sa hissa ho sakta hai — W ka woh excess irrelevant hai. Hamesha: = dim V (domain ).
Common mistake "Bas survivors
v j lo — V mein independence se T ( v j ) ki independence mil jaati hai."
Kyun sahi lagta hai: linear maps ke independent vectors kabhi kabhi independent rehte hain.
Fix: Yeh automatic nahi hai! Ek linear map independent vectors ko collapse kar sakta hai. Hume Step 3 ka argument isliye chahiye tha (kernel mein jaana aur full basis use karna) kyunki independence general mein preserve nahi hoti — yahan sirf isliye kaam karta hai kyunki humne kernel directions ko exclude kiya.
V ka finite-dimensional hona bhool jaana."
Kyun sahi lagta hai: formula dimension-free lagta hai.
Fix: basis-extension step aur finite counting ke liye dim V < ∞ zaroori hai. (Infinite-dim version exist karta hai lekin zyada care chahiye.)
Recall Feynman: 12-saal ke bachche ko samjhao
Ek machine socho jisme 3 input levers hain (3 dimensions of input). Jab tum levers push karte ho, kuch pushes kuch nahi karte — machine unhe ignore kar deti hai (woh "kernel" levers hain). Jo pushes kuch karte hain woh output mein movement karte hain. Badi baat yeh hai: har lever ya toh ignore hoti hai ya ek unique naya output banati hai . Toh (ignored levers) + (useful levers) = (total levers). Bas yahi poora theorem hai!
Mnemonic Formula yaad rakho
"RaN = Domain" → R ank a nd N ullity milke Domain ki dimension dete hain.
Yeh bhi: "Kernel kills, image keeps; milke dono input count karte hain."
#flashcards/maths
Rank–nullity theorem kya kehta hai? Ek linear map T : V → W ke liye jahan V finite-dimensional hai, rank ( T ) + nullity ( T ) = dim V .
Rank kis space ki dimension hai? T ki image (range) ki, yaani dim ( im T ) .
Nullity kis space ki dimension hai? T ke kernel (null space) ki, yaani dim ( ker T ) .
Sum domain ki dimension ke barabar hota hai ya codomain ki? Domain V ki.
Kaun sa theorem kernel basis ko V ke basis tak extend karne deta hai? The basis-extension theorem.
Proof mein kaun sa set image ka basis dikhaya gaya hai? { T ( v 1 ) , … , T ( v n − k )} , yaani kernel ke bahar ke basis vectors ki images.
T ( v j ) image ko kyun span karte hain?Koi bhi v , kernel part (jo 0 par map hoti hai) aur v j part mein split hoti hai, toh har output T ( v j ) ka combination hai.
T ( v j ) independent kyun hain?Agar ∑ c j T ( v j ) = 0 toh ∑ c j v j ∈ ker T ; use u i se likhne par aur full-basis independence use karne par saare c j = 0 ho jaate hain.
Rank 1 wale 2 × 3 matrix ki nullity kya hai? 3 − 1 = 2 .
Kya vectors ki independence linear map se hamesha preserve hoti hai? Nahi; ek map independent vectors ko collapse kar sakti hai — isliye proof kernel ke zariye argue karta hai.
Kernel of T, subspace of V
Image of T, subspace of W