4.5.13 · Maths › Linear Algebra (Full)
Intuition Matrix ke baare mein do fundamental questions
Ek matrix A ek machine hai jo input vectors x ko output vectors A x mein badal deti hai.
Column space poochta hai: kaunse outputs produce kar sakta hoon main? (pahunchne wala set)
Null space poochta hai: kaunse inputs zero ho jaate hain? (wo "kho jaane wali" directions)
Har linear map ke ye do saaye hote hain. Inhe samajhna = map ko samajhna.
Definition Column space (image)
A ∈ R m × n ke liye, column space hai
Col ( A ) = { A x : x ∈ R n } ⊆ R m .
Ye ==A ke columns ka span== hai. Ye output space R m mein rehta hai.
Definition Null space (kernel)
Null space hai
Null ( A ) = { x ∈ R n : A x = 0 } ⊆ R n .
Un sabhi inputs ka set jo matrix zero vector mein crush kar deta hai . Ye input space R n mein rehta hai.
Intuition Har ek subspace KYU hai?
Ek set subspace hota hai agar usme 0 ho aur wo addition aur scaling ke under closed ho.
Null ( A ) : agar A x = 0 aur A y = 0 to A ( α x + β y ) = α ⋅ 0 + β ⋅ 0 = 0 . ✓
Col ( A ) : outputs A x , A y combine hote hain α A x + β A y = A ( α x + β y ) ke roop mein, jo phir bhi ek output hai. ✓
Linearity dono ko majboor karti hai ki wo origin se guzarne wali flat sheets banen — kabhi curved nahi, kabhi offset nahi.
Sab kuch row reduction to RREF se aata hai. A ko R mein reduce karna null space ko nahi badalta (row operations A x = 0 ke solution sets nahi badlte), lekin ye column space ko zaroor badalta hai — isliye hum columns original A se padhte hain.
Definition Pivot vs free columns
RREF R mein, ek pivot column mein ek leading 1 hota hai.
r = number of pivots = rank ( A ) .
Pivot variables ↔ pivot columns. Free variables ↔ free columns.
Original columns KYU? Row reduction rows ko mix karta hai, column entries distort ho jaati hain, isliye generally Col ( R ) = Col ( A ) hota hai. Lekin RREF sahi batata hai ki kaunse columns independent hain — wo dependence relations exactly preserved rehte hain (wo null space mein rehte hain, jo unchanged hai). Isliye hum indices rakhte hain, lekin columns A se lete hain.
R x = 0 solve karo. Pivot variables ko free variables ke terms mein express karo; ek free variable ko 1 aur baaki ko 0 karo ek baar mein. Har free variable ek special solution deta hai.
Intuition YE sach KYU hona chahiye
n input columns mein se har ek ya to pivot hota hai (genuinely nayi output direction contribute karta hai → rank mein count hota hai) ya free hota hai (ye dependent hai → zero mein collapse hone ki ek degree of freedom contribute karta hai → nullity mein count hota hai). Har column exactly ek baar count hota hai. Isliye dono numbers ka sum n hona zaroori hai.
Worked example Example 1 — ek 3×4 matrix
A = 1 3 1 2 6 2 2 6 3 4 12 6
Step 1: Row reduce.
R 2 → R 2 − 3 R 1 , R 3 → R 3 − R 1 :
\begin{bmatrix}1&2&0&0\\0&0&1&2\\0&0&0&0\end{bmatrix}=R.$$
*Ye step KYU?* RREF pivots ko cleanly expose karta hai; pivots ke upar clear karne se free-variable formulas directly mil jaate hain.
**Step 2: Pivots** columns 1 aur 3 mein hain → $r=2$.
**Col(A) basis** = *original $A$* ke columns 1 aur 3: $\{(1,3,1)^\top,\ (2,6,3)^\top\}$. To $\dim\mathrm{Col}=2$.
*Original columns KYU?* $R$ ke mixed columns ab sahi output directions mein nahi point karte.
**Step 3: Null space.** Free variables $x_2,x_4$. $R$ se:
$x_1=-2x_2$, $x_3=-2x_4$.
- $x_2=1,x_4=0$: $s_1=(-2,1,0,0)^\top$.
- $x_2=0,x_4=1$: $s_2=(0,0,-2,1)^\top$.
**Null(A) basis** $=\{s_1,s_2\}$, $\dim\mathrm{Null}=2$.
**Check:** $r+\text{nullity}=2+2=4=n$. ✓ Aur indeed $A s_1 = -2(\text{col}_1)+(\text{col}_2)=0$. ✓
Worked example Example 2 — full column rank (trivial kernel)
A = 1 0 1 0 1 1 .
RREF = 1 0 0 0 1 0 , dono columns mein pivots hain → r = 2 = n .
Koi free variable nahi ⇒ Null ( A ) = { 0 } , dim = 0 .
Col ( A ) = span {( 1 , 0 , 1 ) , ( 0 , 1 , 1 )} , jo R 3 ke andar ek 2-D plane hai.
Full column rank ka matlab trivial kernel KYU hota hai? Koi free variable nahi ⇒ A x = 0 ka ek hi solution hai x = 0 ⇒ map injective hai.
Worked example Example 3 — rank jaldi padhna (80/20)
A = [ 2 1 4 2 ] .
Row 1 = 2 × Row 2 ⇒ sirf 1 pivot ⇒ r = 1 . Tab dim Null = 2 − 1 = 1 .
Null basis: 2 x 1 + 4 x 2 = 0 ⇒ x 1 = − 2 x 2 , special solution ( − 2 , 1 ) ⊤ .
Ye fast KYU? Ek dependence spot karna full reduction ko skip karta hai — zyaadatar exam matrices mein ek obvious dependence hoti hai.
Common mistake "Col(A) ke liye RREF ke columns use karo."
Ye sahi kyun lagta hai: RREF hi simplified matrix hai, to zaroor uske columns simplified column space hain. Ye galat kyun hai: row operations column entries ko scramble karte hain, output vectors ko move karte hain. RREF preserve karta hai ki kaunse columns independent hain, unki actual values nahi.
Fix: RREF se pivot positions identify karo, phir wo columns original A se lo.
Common mistake "Null space
R m mein rehta hai."
Ye sahi kyun lagta hai: tumne ise A ki rows se compute kiya jinki m hoti hain. Ye galat kyun hai: null space vectors inputs x hain, isliye unme n components hote hain (ek per column). Col(A) R m mein rehta hai (outputs).
Fix: Null ⊆ input space R n ; Col ⊆ output space R m .
Common mistake "Nullity = RREF mein zero rows ki sankhya."
Ye sahi kyun lagta hai: zero rows 'khoyi hui' information jaisi lagti hain. Ye galat kyun hai: zero rows dependent rows count karti hain (row rank). Nullity free columns count karta hai = n − r .
Fix: nullity = n − ( number of pivots ) , hamesha columns count karo.
Recall Quick self-test (answers cover karo)
Col(A) ki dimension? → rank r .
Null(A) ki dimension? → n − r .
Kaunsa space R m mein rehta hai? → Col(A).
Col(A) basis ke columns kahan se lete hain? → original A se, pivot positions par.
Kitne special solutions hote hain? → ek per free variable.
Recall Feynman: ek 12-saal ke bacche ko samjhao
Ek vending machine imagine karo. Tum buttons dabate ho (ye tumhara input x hai).
Column space wo hai — machine kabhi bhi jo snacks de sakti hai woh saare — shayad sirf chips aur soda stocked hain, to chahe kuch bhi press karo, chocolate nahi milegi.
Null space wo hai — button combos jo tumhe kuch nahi dete — ye press karo aur machine bas tumhari mehnat kha jaati hai aur khaali haath wapas deti hai.
Counting rule: jo bhi button tum press karo wo ya to useful hai (naya snack deta hai) ya wasted hai (kuch naya nahi karta). Total buttons = useful + wasted. Ye hai rank + nullity = n .
Mnemonic Ghar aur sizes yaad rakho
"CO lumns O utputs hain (R m ), N ull iN puts hai (R n )."
Sizes: "Rank Plus Null = N" → r + ( n − r ) = n .
Rank of a matrix — rank hi dim Col ( A ) hai.
Rank–Nullity Theorem — yahan use ki gayi counting identity.
Row reduction & RREF — dono bases ka engine.
Linear independence and basis — pivots ⇔ independent columns.
Injective and surjective linear maps — trivial kernel ⇔ injective; full row rank ⇔ surjective.
Four fundamental subspaces — Col(A), Null(A), Row(A), Null(Aᵀ).
Solving Ax=b — solvable tabhi jab b ∈ Col ( A ) ; solution set = particular + Null(A).
Definition of Col(A)? A ke columns ka span; set { A x } , jo output space R m mein rehta hai.
Definition of Null(A)? { x : A x = 0 } , un inputs ka set jo zero ho jaate hain, jo input space R n mein rehta hai.
Basis of Col(A)? ORIGINAL matrix A se liye gaye pivot columns (pivot positions RREF se milti hain).
Basis of Null(A)? Special solutions — ek per free variable, R x = 0 solve karke milte hain.
Dimension of Col(A)? Rank r = pivots ki sankhya.
Dimension of Null(A) (nullity)? n − r = free variables ki sankhya.
State Rank–Nullity. dim Col ( A ) + dim Null ( A ) = n , yaani r + ( n − r ) = n .
Why derive Rank–Nullity? n columns mein se har ek ya pivot hai (rank mein count hota hai) ya free hai (nullity mein count hota hai); columns ko do tareekon se count karo.
Why use original columns, not RREF columns, for Col(A)? Row ops column values badal dete hain; RREF sirf batata hai ki kaunse columns independent hain, unki actual output directions nahi.
When is Null(A)={0}? Jab koi free variable na ho, yaani full column rank r = n ho; map injective hota hai.
Why is Null(A) a subspace? Agar A x = 0 , A y = 0 to A ( α x + β y ) = 0 ; 0 contain karta hai aur linear combos ke under closed hai.
Row reduction effect on the two spaces? Null(A) preserve karta hai (A x = 0 ka same solution set); Col(A) badal deta hai.
pivot columns of original A
free variables give special solutions