Foundations — Invertible matrix theorem — 12+ equivalent conditions

4.5.25 · D1 · Maths › Linear Algebra (Full) › Invertible matrix theorem — 12+ equivalent conditions

Parent theorem ko padhne se pehle, tumhe usmein aane wale har notation ka poora maalik hona chahiye. Hum har ek cheez ko bilkul zero se banate hain — pehle plain words mein, phir ek picture mein, phir woh reason jiske liye theorem ko yeh chahiye. Koi bhi cheez earn kiye bina use nahi ki jaayegi.

1. Ek vector — woh arrow jo hum push karte hain

$x=\left(\begin{array}{c}{x}_1\\ x_2\end{array}\right)\text{means the arrow to the point }(x_1,x_2).$

• Plain words: ek location, ya ek certain length aur direction ka "push."
• Picture: origin se ek arrow. Figure s01 dekho — kaala arrow vector $(3,2)$ hai.
• Yeh topic ko kyun chahiye: poora theorem equation $Ax=b$ ke baare mein hai. $x$ aur $b$ dono vectors hain. Agar tum inhe arrows ke roop mein nahi dekh sakte, toh tum yeh nahi dekh sakte ki matrix unke saath kya karta hai.

Symbol ${\mathbb{R}}^n$ (padho "R-n") bas $n$ numbers wale sab aise arrows ki poori space ko naam deta hai. ${\mathbb{R}}^2$ flat plane hai; ${\mathbb{R}}^3$ 3D space hai.

Woh special arrow $0$ (bold zero) woh vector hai jiske saare numbers $0$ hain — zero length ka ek arrow, origin par hi baitha, kahin point nahi karta.

2. Ek matrix — woh machine

$A=\left(\begin{array}{cc}2& 1\\ 1& 1\end{array}\right)$

• Plain words: ek rulebook jo ek arrow andar leta hai aur ek naya arrow bahar nikalti hai.
• Picture: isse poore plane ki ek transformation ki tarah socho — yeh har arrow ko pakadti hai aur uski tip ko kahin nayi jagah le jaati hai. Dekho Linear Transformations — Injective and Surjective.
• Yeh topic ko kyun chahiye: $A$ yahan ka star hai. "$A$ invertible hai kya?" — yahi poora sawaal hai.

Square kyun matter karta hai. Ek $3\times 5$ (3 rows, 5 columns) grid 5-number arrows andar leti hai aur 3-number arrows bahar deti hai — input aur output alag-alag spaces mein rehte hain, isliye yeh kabhi "cleanly undo" nahi kar sakti. Theorem tab hi apply hoti hai jab input space = output space, yaani jab $A$ square ho.

3. Matrix times vector — machine kaise chalti hai

Yeh poore subject ki sabse important motion hai, isliye hum isse do tarike se picture karte hain.

• Plain words: output ek columns ka weighted sum hai. Number $x_1$ kehta hai "column 1 ka kitna," $x_2$ kehta hai "column 2 ka kitna," aur aise aage. Dekho Linear Independence and Span.
• Kyun yeh view aur boring row-by-row dot product nahi? Kyunki theorem columns ke baare mein hai — kya woh independent hain, kya woh span karte hain. $Ax$ ko column combination ke roop mein likhne se equation $Ax=b$ literally kehti hai: "kya main columns ko mix karke $b$ bana sakta hoon?" Yeh akela reframing theorem ka aadha hissa power karta hai.
• Picture: figure s02 mein column arrows $a_1,a_2$ ko weights se stretch karke tip-to-tail add kiya gaya hai. Laal arrow result $Ax$ hai.

4. Identity $I$ aur inverse $A^{-1}$

$I_2=\left(\begin{array}{cc}1& 0\\ 0& 1\end{array}\right)$

• Plain words: $A$ chalao, phir $A^{-1}$ chalao, aur tum wapas wahi hoge jahan shuru kiye the — poori information preserved.
• Yeh topic ko kyun chahiye: theorem ki condition 1 hi "$A^{-1}$ exist karti hai" hai. Baaki har condition isi cheez ka ek sasta test hai.

5. Equation $Ax=0$ — "kya yeh squash karta hai?" test

Yeh theorem ki dhadkan hai. Har woh arrow $x$ jo machine zero arrow tak crush ho jaata hai, woh ek gawaah hai ki information kho gayi.

• Picture: figure s03 mein ek achhi machine dikhti hai (sirf origin hi origin se map hoti hai) ek buri machine ke against (arrows ki poori laal line origin par collapse ho jaati hai).
• Yeh topic ko kyun chahiye: agar ek bhi nonzero arrow crush ho jaaye, toh do alag inputs ($x$ aur $0$) output $0$ share karte hain — machine undoable nahi hai. Yeh condition 4 hai, aur yeh conditions 5, 6, 14, 17 ko drive karta hai.

Saare arrows ka set jo $A$ $0$ tak crush karta hai uska ek naam hai: null space, likha jaata hai $\mathrm{Nul}A$. Dekho Rank and Nullity. Ek achhi (invertible) machine mein $\mathrm{Nul}A=\{0\}$ hota hai — sirf zero arrow hi crush hota hai.

6. Determinant $\det A$ — area-scaling number

• Plain words: machine ko ek unit square do; $\det A$ us parallelogram ka (signed) area hai jo bahar aata hai.
• Picture: unit square ek squashed parallelogram ban jaata hai. Agar machine square ko ek line par flatten kar de, toh us parallelogram ka zero area hoga — $\det A=0$. Dekho Determinant.
• Yeh topic ko kyun chahiye: $\det A=0$ ka exactly matlab hai ki machine ne space ko kuch lower-dimensional pe flatten kar diya — usne information ka poora ek dimension kho diya. Yeh condition 13 hai, aur yeh often sabse sasta test hota hai.

Ek flattened square = crushed arrows = non-trivial null space. Zero determinant aur squashing ek hi event hai alag-alag windows se dekha gaya — yeh theorem miniature mein hai.

7. Rank, span, independence, basis, eigenvalue — supporting cast

Quick plain-words definitions taaki theorem ki vocabulary complete ho jaye:

• Yeh topic ko kyun chahiye: conditions 5, 8, 15, 16, 14 har ek exactly isi language mein phrased hain. "Full rank $=n$" ka matlab koi dimension nahi khoyi — ek baar phir wahi achhi-machine wali idea.

8. Elementary row operations — hum saste mein test kaise karte hain

• Plain words: grid ko step by step saaf karo bina yeh badle ki woh kaun se arrows crush karti hai.
• Yeh topic ko kyun chahiye: $A$ ko bar bar tidy karne se ya toh identity $I$ milti hai (achhi machine) ya zeros ki ek row pe atka rehta hai (crushed dimension). Yeh conditions 2 aur 3 hain.

Yeh sab theorem ko kaise feed karte hain

"Invertible Matrix Theorem" box mein jaane wala har arrow ek equivalent condition hai — aur sab usi ek root idea se trace hote hain: kya machine koi arrow crush karti hai?

Equipment checklist

Khud ko test karo — right side cover karo aur reveal karne se pehle jawab do.