YE RULES KYUN? Ek subspace ek "origin se guzarne wali flat cheez" honi chahiye (ek line, plane, hyperplane...). Agar tum scale aur add karo aur kabhi bahar na jao, toh tumhare paas ek poora vector world hai bina kisi edge ke. Ek line jo origin se nahi guzarti wo rule 1 fail karti hai, isliye wo subspace nahi hai.
KYUN:Ax=x1a1+⋯+xnanliterally columns ka combination hai. Toh saare possible outputs b=Ax ka set exactly columns ka span hai. KAISE use karein:Ax=b solvable hai ⟺b∈C(A).
Maano r=rank(A)= row reduction ke baad pivots ki sankhya.
Derivation.A ko RREF mein row reduce karo.
Pivot columns linearly independent hote hain aur C(A) ko span karte hain ⇒dimC(A)=r.
Row operations row space nahi badlate, aur RREF ki r nonzero rows independent hain ⇒dimC(AT)=r. Toh row rank = column rank. Isliye "rank" ek hi number hota hai.
Free variables = n−r. Har free variable Ax=0 ka ek independent special solution deta hai ⇒dimN(A)=n−r.
AT par usi argument se (size n×m, rank bhi r hai): dimN(AT)=m−r.
Reduce karne se pehle, charon dimensions predict karo, phir check karo.
A ek 4×6 matrix hai rank 3 ke saath.
Forecast:dimC(A)=3, dimC(AT)=3, dimN(A)=6−3=3, dimN(AT)=4−3=1. Sums: 3+3=6=n ✓, 3+1=4=m ✓. Agar tumhara forecast sahi sum nahi karta, toh tumhara rank guess galat hai.
Recall Feynman: 12-saal ke bacche ko samjhao
Socho ek fancy juice mixer (matrix) hai. Tum usme fruits daalo (input vectors).
Kuch fruit combos kuch nahi dete — mixer unhe cancel kar deta hai. Un "waste" recipes ka collection null space hai.
Jo bhi alag-alag juices tum possibly bana sakte ho, woh column space hai.
Mixer sirf itne hi distinct juices bana sakta hai — woh count rank hai.
Aur kuch juices hain jo tum kabhi nahi bana sakte chahe kuch bhi karo — woh "impossible juice" zone left null space hai.
Inme se do tumhare recipes (inputs) ke baare mein baat karte hain, do juices (outputs) ke baare mein, aur jo recipes bacha deti hain woh hamesha important recipes ke bilkul right angles par hoti hain.