4.5.14 · D3 · Maths › Linear Algebra (Full) › Rank-nullity theorem — proof
Yeh rank–nullity theorem ka drill-ground hai. Theorem ek hi cheez kehta hai:
rank ( T ) + nullity ( T ) = dim V ,
jahan rank ( T ) = dim ( im T ) (wo dimensions jo bach jaati hain) aur nullity ( T ) = dim ( ker T ) (wo dimensions jo 0 mein crush ho jaati hain). Agar koi bhi word unfamiliar lage toh Kernel and Image of a Linear Map dekho.
Humara goal yahan: har tarah ki situation ko cover karna jisme theorem aa sakta hai, taaki koi bhi exam problem surprise na kare.
Har rank–nullity problem actually yeh poochhti hai ki kitni input directions collapse hoti hain . Neeche diye gaye cases mein woh saari shapes cover hoti hain jo ho sakti hain.
Cell
Case class
Kya cheez ise distinct banati hai
Example
A
Injective, nullity = 0
kuch crush nahi; image utni badi jitna domain
Ex 1
B
Surjective, rank = dim W
image codomain ko fill karti hai
Ex 2
C
General middle case (0 < nullity < dim V )
kuch crush, kuch survive
Ex 3
D
Zero map (fully degenerate)
sab kuch crush, rank = 0
Ex 4
E
Wide matrix (m < n , forced nullity)
outputs se zyada inputs
Ex 5
F
Tall matrix (m > n , forced non-surjective)
inputs se kam outputs
Ex 6
G
Abstract space (not R n )
polynomials / functions
Ex 7
H
Real-world word problem
ek scenario ko T mein translate karo
Ex 8
I
Exam-style twist (solve for unknown dim)
rank/nullity diya hai, ek dhundo
Ex 9
Intuition Matrix ko ek dial ki tarah padhho
Ek dial ghuma lo "kuch nahi collapses" (nullity 0 , Cell A) se lekar "sab kuch collapses" (nullity = dim V , Cell D) tak. Har problem us dial par kahin na kahin baithe gi. Ek baar problem ki jagah pata chal jaaye, toh uski shape pehle se pata hoti hai.
T : R 2 → R 3 , T ( x , y ) = ( x , y , x + y ) .
Rank aur nullity dhundo.
Forecast: map karne ke baad dono inputs independent lagte hain — nullity guess karo, phir rank.
Kernel dhundo. T ( x , y ) = ( 0 , 0 , 0 ) set karo: yeh force karta hai x = 0 , y = 0 . Toh ker T = {( 0 , 0 )} .
Yeh step kyun? Kernel hamesha pehle compute karo — iska dimension nullity hai, aur rank theorem se seedha milti hai.
Nullity = 0 . Kernel sirf zero vector hai, ek 0 -dimensional space.
Yeh step kyun? Ek akela point (origin) ki koi independent direction nahi hoti, isliye dim = 0 . Dekho Dimension of a Vector Space .
Rank by the theorem. rank = dim V − nullity = 2 − 0 = 2 .
Yeh step kyun? Image ko directly describe karne ki zaroorat nahi padi — rank–nullity ne seedha de diya.
Verify: T ( 1 , 0 ) = ( 1 , 0 , 1 ) aur T ( 0 , 1 ) = ( 0 , 1 , 1 ) R 3 mein independent hain (koi ek doosre ka scalar multiple nahi hai), toh image 2 -dimensional hai. 2 + 0 = 2 = dim R 2 . ✓
Nullity 0 ⇔ injective — dekho Invertible Linear Maps and Isomorphisms .
T : R 3 → R 2 , T ( x , y , z ) = ( x + z , y + z ) .
Dikhao ki T surjective hai aur uski nullity dhundo.
Forecast: teen inputs, do outputs — guess karo ki image poora R 2 ho sakta hai ya nahi.
Check karo ki image sab tak pahunche. Kisi bhi target ( a , b ) ke liye, x = a , y = b , z = 0 lo: toh T ( a , b , 0 ) = ( a , b ) . Har point hit hota hai.
Yeh step kyun? Surjective ka matlab image = R 2 , isliye rank = 2 .
Rank = 2 (poora codomain).
Yeh step kyun? dim ( im T ) = dim R 2 = 2 .
Nullity by the theorem. nullity = dim V − rank = 3 − 2 = 1 .
Yeh step kyun? Theorem kernel system solve karne se bachata hai.
Verify: x + z = 0 , y + z = 0 solve karo: milta hai x = − z , y = − z , z free. Kernel = {( − t , − t , t )} , ek line, toh nullity = 1 . 2 + 1 = 3 = dim R 3 . ✓
Worked example Example 3 (geometric)
T : R 3 → R 3 , x y -plane par projection: T ( x , y , z ) = ( x , y , 0 ) .
Rank aur nullity dhundo aur crush ko picture karo.
Forecast: ek axis mar jaata hai, do survive karte hain — split guess karo.
Kernel. T ( x , y , z ) = 0 ke liye x = 0 , y = 0 , z free chahiye. ker T = {( 0 , 0 , z )} = the z -axis. Nullity = 1 .
Yeh step kyun? Vertical axis flat hokar origin par crush ho jaata hai — yahi "crush" hai.
Image. Outputs saare ( x , y , 0 ) hain — poora x y -plane. Rank = 2 .
Yeh step kyun? Do independent survivors, T ( e 1 ) = ( 1 , 0 , 0 ) aur T ( e 2 ) = ( 0 , 1 , 0 ) .
Check. 2 + 1 = 3 = dim R 3 . ✓
Verify: Neeche figure mein, laal z -axis (kernel) origin par collapse hoti hai; violet x y -plane (image) survive karta hai. Crushed + survived = 1 + 2 = 3 . ✓
T : R 4 → R 5 , T ( v ) = 0 har every v ke liye.
Rank aur nullity dhundo.
Forecast: sab kuch crush ho raha hai — dial kahan baitha hai?
Kernel. T ( v ) = 0 saare v ke liye hold karta hai, toh ker T = R 4 = V . Nullity = 4 .
Yeh step kyun? Kuch survive nahi karta; poora domain kernel hai. Yeh dial ka extreme end hai.
Image. Akela output 0 hai, toh im T = { 0 } , ek 0 -dimensional space. Rank = 0 .
Yeh step kyun? Ek akele point ki koi independent direction nahi hoti.
Check. 0 + 4 = 4 = dim R 4 . ✓
Verify: rank 0 (image sirf origin hai) + nullity 4 (kernel poora R 4 hai) = 4 = dim V . ✓ Dhyan do ki sum dim V = 4 hai, not dim W = 5 nahi — codomain irrelevant hai.
A = ( 1 2 2 4 3 6 ) as T : R 3 → R 2 .
Rank aur nullity dhundo.
Forecast: row 2 row 1 ki copy lagti hai — guess karo kitni independent rows hain.
Row reduce karo. Row 2 − 2 × Row 1 = ( 0 , 0 , 0 ) . Ek pivot bachta hai. Rank = 1 .
Yeh step kyun? Rank = pivots ki sankhya = column space (image) ka dimension. Dekho Rank of a Matrix (row vs column space) .
Nullity by the theorem. nullity = 3 − 1 = 2 .
Yeh step kyun? Jab input directions (3 ) rank se zyada hain, kuch toh collapse honga hi.
Free variables se confirm karo. A x = 0 reduce hota hai x 1 + 2 x 2 + 3 x 3 = 0 par: ek equation, 3 unknowns ⇒ 2 free variables. Dekho Solving Linear Systems — free variables count .
Verify: free-variable count = 3 − ( pivots ) = 3 − 1 = 2 = nullity. 1 + 2 = 3 = dim R 3 . ✓
A = 1 0 1 0 1 1 as T : R 2 → R 3 .
Rank, nullity dhundo aur decide karo ki T surjective hai ya nahi.
Forecast: sirf 2 input directions hain lekin 3 output slots — kya image R 3 fill kar sakti hai?
Rank. Columns ( 1 , 0 , 1 ) aur ( 0 , 1 , 1 ) independent hain (koi ek doosre ka multiple nahi). Rank = 2 .
Yeh step kyun? Rank = column space ka dimension = independent columns ki sankhya.
Nullity. nullity = dim V − rank = 2 − 2 = 0 .
Yeh step kyun? Koi input direction collapse nahi hoti, toh T injective hai.
Surjective? Image 3 -dimensional R 3 ke andar 2 -dimensional hai, toh im T = R 3 . Surjective nahi hai.
Yeh step kyun? Rank 2 < dim W = 3 ; ek tall full-rank map kabhi bhi bade codomain ke har point tak nahi pahunch sakta.
Verify: 2 + 0 = 2 = dim R 2 . ✓ Rank 2 < 3 non-surjectivity confirm karta hai — theorem domain R 2 ke against balance karta hai, R 3 ke nahi.
V = P 3 , degree ≤ 3 ke polynomials, toh dim V = 4 with basis { 1 , x , x 2 , x 3 } .
T = d x d : P 3 → P 3 . Rank aur nullity dhundo.
Forecast: kin polynomials ki derivative zero hogi?
Kernel. p ′ ( x ) = 0 matlab p ek constant hai. ker T = { c ⋅ 1 } , nullity = 1 .
Yeh step kyun? Constants exactly woh polynomials hain jinhe derivative 0 par crush karti hai.
Image. d x d of 1 , x , x 2 , x 3 deta hai 0 , 1 , 2 x , 3 x 2 . Nonzero wale P 2 = { 1 , x , x 2 } span karte hain. Rank = 3 .
Yeh step kyun? { 1 , 2 x , 3 x 2 } teen independent polynomials hain, jo saare degree-≤ 2 polys span karte hain.
Check. 3 + 1 = 4 = dim P 3 . ✓
Verify: nullity 1 (constants) + rank 3 (image = P 2 ) = 4 = dim P 3 . ✓ Abstract space par bhi kaam karta hai — koi R n zaroorat nahi.
Ek factory 4 raw ingredients (input vector in R 4 ) ko blend karke 2 measured outputs banati hai — total mass aur total cost:
T ( a , b , c , d ) = ( a + b + c + d , 2 a + 2 b + 2 c + 2 d ) .
Kitne independent "recipe adjustments" hain jo dono outputs unchanged rakhte hain?
Forecast: doosra output pehle ka proportional lagta hai — guess karo outputs mein kitni actually information hai.
Matrix ki tarah model karo. A = ( 1 2 1 2 1 2 1 2 ) , T : R 4 → R 2 .
Yeh step kyun? "Recipe adjustments jo kuch nahi badlate" exactly kernel hai.
Rank. Row 2 = 2 × Row 1 , toh ek pivot. Rank = 1 .
Yeh step kyun? Mass aur cost mein sirf ek independent piece of information hai.
Nullity = answer. nullity = dim V − rank = 4 − 1 = 3 .
Yeh step kyun? Teen independent tarike hain jisse ingredients tweak kar sako jab dono outputs fixed rahen.
Verify: A x = 0 ek equation hai a + b + c + d = 0 jisme 4 unknowns hain ⇒ 3 free variables. 1 + 3 = 4 = dim R 4 . ✓ Concretely, ( 1 , − 1 , 0 , 0 ) , ( 1 , 0 , − 1 , 0 ) , ( 1 , 0 , 0 , − 1 ) teen independent kernel vectors hain.
Ek linear map T : V → W hai jisme dim V = 9 . Bataya gaya hai ki rank ( T ) = 6 aur codomain ka dim W = 12 hai.
Nullity dhundo, aur batao ki T injective ya surjective ho sakta hai ya nahi.
Forecast: rank diya hua hai; theorem ek hi line mein nullity deta hai — lekin dhyan rakho ki yeh kis dimension use karta hai.
Nullity. nullity = dim V − rank = 9 − 6 = 3 .
Yeh step kyun? Theorem dim V = 9 ke against balance karta hai, dim W = 12 ke nahi . Woh 12 ek distractor hai.
Injective? Injective ke liye nullity = 0 chahiye. Yahan nullity = 3 = 0 , toh injective nahi hai.
Yeh step kyun? 3 independent input directions 0 par collapse ho rahi hain.
Surjective? Surjective ke liye rank = dim W = 12 chahiye. Yahan rank = 6 < 12 , toh surjective nahi hai.
Yeh step kyun? Image ek 12 -dimensional codomain ke andar ek 6 -dimensional sliver hai.
Verify: rank + nullity = 6 + 3 = 9 = dim V . ✓ dim W = 12 kabhi sum mein nahi aata — sirf surjectivity verdict pe affect karta hai.
Common mistake Example 9 mein classic trap
Rank ko dim W ke against balance karna: likho "nullity = 12 − 6 = 6 ". Galat — rank–nullity hamesha domain ke dimension tak sum karta hai. dim W sirf yeh batata hai ki image codomain ko fill kar sakti hai ya nahi.
Recall Quick self-test across the matrix
Injective ka matlab nullity kitne ke barabar hoti hai? ::: 0
Surjective ka matlab rank kitne ke barabar hoti hai? ::: dim W (codomain ka dimension)
Zero map R 4 → R 5 ka rank aur nullity kya hoga? ::: rank 0 , nullity 4
Ek wide 2 × 3 rank-1 matrix ki nullity kya hogi? ::: 2
Agar dim V = 9 aur rank = 6 , toh nullity kya hai? ::: 3
Rank–nullity dim V tak sum karta hai ya dim W tak? ::: dim V (the domain)