Invertible matrix theorem — 12+ equivalent conditions

4.5.25 · Maths › Linear Algebra (Full)

Hum kya claim kar rahe hain

Definition Invertible Matrix Theorem (IMT)

Maano $A$ ek $n \times n$ square matrix hai $R$ ke upar. Niche diye gaye sab equivalent hain — agar inme se koi ek true hai, toh sab true hain; agar koi ek fail kare, toh sab fail karte hain.

$A$ invertible hai (koi $B$ exist karta hai jiske saath $A B = B A = I$ ).
$A$ , ==row equivalent to $I_{n}$ == hai (RREF identity hai).
$A$ mein $n$ pivot positions hain (har row aur column mein ek pivot).
$A x = 0$ ka sirf trivial solution $x = 0$ hai.
$A$ ke columns linearly independent hain.
Linear map $x \mapsto A x$ one-to-one (injective) hai.
$A x = b$ ka == $R^{n}$ ke har $b$ ke liye ek solution== hai.
$A$ ke columns ==span $R^{n}$ == karte hain.
Map $x \mapsto A x$ onto (surjective) hai.
Koi matrix $C$ hai jiske saath $C A = I$ hai (left inverse).
Koi matrix $D$ hai jiske saath $A D = I$ hai (right inverse).
$A^{T}$ invertible hai.
$det A \neq = 0$ .
Number $0$ , $A$ ka eigenvalue nahi hai.
$rank A = n$ (full rank).
$A$ ke columns $R^{n}$ ka basis form karte hain.
$Col A = R^{n}$ aur $Nul A = {0}$ (yani $dim Nul A = 0$ ).

Zaroori caveat: yeh theorem sirf square matrices ke liye hai. Ek $3 \times 5$ matrix ke columns ya toh independent ho sakte hain ya spanning ho sakte hain lekin dono ek saath kabhi nahi, isliye IMT apply nahi hota.

Yeh saari cheezein ek jaisi KYUN hain? (Scratch se derivation)

Hum 17 facts yaad nahi karte. Hum ek logical loop banate hain taaki arrows follow karne se sab equivalent sabit ho jaayein. Kisi bhi step ke liye hume sirf formula ki zaroorat nahi — har link ke paas ek reason hai.

Figure — Invertible matrix theorem — 12+ equivalent conditions

Link A: invertible $\Rightarrow$ trivial null space (1 ⟹ 4)

Maano $A^{- 1}$ exist karta hai aur $A x = 0$ . Dono sides ko left mein $A^{- 1}$ se multiply karo: $A^{- 1} A x = A^{- 1} 0 ⟹ I x = 0 ⟹ x = 0 .$ Yeh step kyun? Left-multiply karna inverse se $A$ ko "undo" karta hai aur $x$ ko isolate karta hai. Toh koi bhi nonzero vector $A$ se kill nahi ho sakta.

Link B: trivial null space ⟺ independent columns (4 ⟺ 5)

$A = [a_{1} a_{2} \dots a_{n}]$ likho columns $a_{i}$ ke saath. Tab $A x = x_{1} a_{1} + x_{2} a_{2} + \dots + x_{n} a_{n} .$ Yeh step kyun? Matrix–vector multiplication hai hi columns ka linear combination jisme $x$ ki entries weights hain. Toh $A x = 0$ ka matlab hai columns ka combination zero ke barabar hai. "Sirf $x = 0$ kaam karta hai" yeh exactly linear independence ki definition hai.

Link C: square matrix ke independent columns ⟹ har column mein pivot ⟹ RREF $= I$ (5 ⟹ 3 ⟹ 2)

$n$ independent columns ka matlab hai koi bhi column free (non-pivot) column nahi hai, toh saare $n$ columns pivot columns hain. Ek $n \times n$ matrix ke liye, $n$ pivots har row aur column ko fill karte hain, aur reduced row echelon form zaroor $I_{n}$ hoga. Yeh step kyun? Ek free column ek nonzero null-space vector deta, jo independence ke contradict karta.

Link D: row equivalent to $I$ ⟹ invertible (2 ⟹ 1)

Agar $A \sim I$ , toh elementary row operations ki ek sequence $A$ ko $I$ mein convert karti hai. Har operation = ek invertible elementary matrix $E_{i}$ se multiply karna: $E_{k} \dots E_{2} E_{1} A = I .$ Maano $B = E_{k} \dots E_{1}$ (invertibles ka product, isliye invertible). Tab $B A = I$ , toh $B = A^{- 1}$ . Yeh step kyun? Row operations reversible hote hain — isliye har $E_{i}$ invertible hai — toh unka product ek genuine inverse hai.

Loop closed: $1 \Rightarrow 4 \Rightarrow 5 \Rightarrow 3 \Rightarrow 2 \Rightarrow 1$ . Paanchon equivalent hain. ✔

Baaki ko hook karna

6 (injective) $\equiv$ 4: ek linear map one-to-one hoti hai iff uska kernel ${0}$ ho (agar $A u = A v$ toh $A (u - v) = 0$ ).
7, 8, 9: "har $b$ ke liye solution" ka matlab hai har $b$ columns ka combination hai $\Rightarrow$ columns span karte hain $\Rightarrow$ map onto hai. Ek square matrix ke liye, $n$ pivots ek saath independence aur spanning dono dete hain — isliye injective aur surjective yahan coincide karte hain.
13 ( $det \neq = 0$ ): elementary operations $det$ ko nonzero factors se scale karte hain; $det I = 1$ . Toh $A \sim I ⟺ det A \neq = 0$ .
14: $det A = \prod (eigenvalues)$ , toh $det A \neq = 0 ⟺$ koi eigenvalue $0$ nahi. Saath hi $0$ eigenvalue ka matlab hai $\exists x \neq = 0, A x = 0 x = 0$ — ek nonzero null vector, jo (4) ko contradict karta hai.
12 ( $A^{T}$ ): row rank $=$ column rank, aur $det A^{T} = det A$ .
15, 16, 17: rank $= n$ ⟺ pivots columns fill karte hain ⟺ columns ek basis hain ⟺ $dim Nul A = 0$ .

Worked Examples

Common Mistakes (Steel-manned)

Recall Feynman: 12-saal ke bacche ko samjhao

Socho ek machine hai jo koi bhi LEGO model leta hai aur uske bricks ko ek naye model mein rearrange karta hai. Ek achhi machine kabhi bhi information destroy nahi karti: output se tum hamesha exact input rebuild kar sakte ho — woh ek invertible machine hai. Ek buri machine kabhi-kabhi do alag inputs ko same output mein squash kar deti hai, toh tum undo nahi kar sakte. Amazing baat yeh hai: machine "achhi" hai ya nahi, yeh test karne ke kai alag-alag tarike hain, jaise "kya woh kabhi non-empty model ko nothing mein turn karti hai?", "kya woh har possible model produce kar sakti hai?", "kya uske building rules overlap karte hain?" — aur square machines ke liye yeh saare tests ek hi yes/no answer dete hain. Toh bas sabse aasan test run karo.

Active-Recall Flashcards

Square matrix ke liye,

A x = 0

ka sirf

x = 0

hona kya imply karta hai?

Woh invertible hai — aur equivalently uske columns independent hain,

det \neq = 0

, rank

= n

, etc. (IMT).

IMT ko matrix ka square hona kyun zaroori hai?

Sirf

n \times n

ke liye "independent columns" aur "spanning columns" coincide karte hain; non-square matrices ek satisfy kar sakti hain lekin dono kabhi nahi.

IMT ki determinant criterion do.

A

invertible

⟺ det A \neq = 0

Eigenvalues ke baare mein kya baat batati hai ki matrix invertible hai?

0

eigenvalue NAHI hai (kyunki

A x = 0 x

ek nonzero null vector deta).

Agar ek square matrix

A

A D = I

satisfy kare, toh kya woh invertible hai?

Haan — square matrices ke liye ek one-sided inverse automatically two-sided hota hai (conditions 10/11).

A x =

"columns ka linear combination" yeh proof mein kaise help karta hai ki null

= {0}

⟺ independent columns?

Kyunki

A x = x_{1} a_{1} + \dots + x_{n} a_{n}

, toh

A x = 0

exactly columns ke beech ek dependence relation hai.

Invertibility ke liye rank condition kya hai?

rank A = n

(full rank / har column mein pivot).

det

check karna smart shortcut kyun hai?

Yeh ek sasta computation hai jo, IMT ke zariye, EK SAATH saari equivalent properties decide kar deta hai.

Agar ek square

A

ke columns

R^{n}

span karte hain, toh kya woh independent hain?

Haan — square matrices ke liye spanning ⟺ independent ⟺ invertible.

Ek invertible matrix ka RREF kya hota hai?

Identity matrix

I_{n}

Connections

Determinant — scalar test $det A \neq = 0$ (condition 13).
Rank and Nullity — Rank–Nullity Theorem 15 ⟺ 17 ko immediate banata hai.
Linear Independence and Span — conditions 5 aur 8.
Eigenvalues and Eigenvectors — condition 14, $0$ eigenvalue nahi.
Elementary Matrices and Row Reduction — 2 ⟹ 1 ke peeche engine.
Linear Transformations — Injective and Surjective — conditions 6 aur 9.
Basis and Dimension — condition 16, columns ek basis ke roop mein.