4.5.34 · Maths › Linear Algebra (Full)
Intuition Badi picture kya hai
Ek basis sirf ek coordinate system hoti hai. Lekin ek generic basis painful hoti hai: kisi bhi vector ke coordinates nikalne ke liye aapko ek linear system solve karna padta hai. Ek orthonormal basis dream coordinate system hoti hai — axes ek doosre ke perpendicular hote hain aur unit-length ke, isliye ek coordinate sirf ek dot product hota hai. Koi solving nahi chahiye.
WHY care: Yeh "solve A x = b " ko "dot products lo" mein badal deta hai. Yahi projections, least squares, Fourier series, aur QR/SVD ke peeche ka engine hai.
Definition Orthogonal set
R n mein { u 1 , … , u p } ka ek set orthogonal hai agar har distinct pair perpendicular ho:
u i ⋅ u j = 0 whenever i = j .
Kisi vector ka khud se koi condition nahi hai.
Definition Orthonormal set
Ek orthogonal set jisme additionally har vector ek unit vector ho:
u i ⋅ u j = { 0 1 i = j i = j
Ek orthonormal basis ek orthonormal set hai jo subspace ke liye basis bhi ho.
DIFFERENCE kya hai? Orthogonal = sirf perpendicular. Orthonormal = perpendicular aur length 1. Aap ek orthogonal set ko orthonormal banate ho har vector ko uski apni length se divide karke (normalizing ).
Nonzero orthogonal vectors ka ek set automatically linearly independent hota hai. Toh aapko independence free mein milti hai — independence check karne ke liye kabhi row-reduce karne ki zaroorat nahi.
Derivation from scratch. Maano
c 1 u 1 + c 2 u 2 + ⋯ + c p u p = 0 .
Dono sides ka dot product ek fixed vector u j ke saath lo:
u j ⋅ ( ∑ i c i u i ) = u j ⋅ 0 = 0.
Dot product distribute karo:
∑ i c i ( u j ⋅ u i ) = 0.
Yeh step kyun? Orthogonality ki wajah se, i = j ke alawa har term zero ho jaati hai (woh dot products 0 hain). Jo bachta hai:
c j ( u j ⋅ u j ) = c j ∥ u j ∥ 2 = 0.
Kyunki u j = 0 hai, ∥ u j ∥ 2 > 0 hai, jo c j = 0 force karta hai. Yeh har j ke liye hold karta hai, toh saare coefficients zero hain → independent . ■
HOW hum yeh paate hain (first principles). Kyunki yeh ek basis hai, kuch coefficients exist karte hain:
y = c 1 u 1 + ⋯ + c p u p .
Abhi tak hume c i pata nahi. Dono sides ka dot u j ke saath lo:
y ⋅ u j = ∑ i c i ( u i ⋅ u j ) .
Yeh step kyun? Wahi purani trick — orthogonality saare cross terms nuke kar deti hai, sirf c j ( u j ⋅ u j ) bachta hai:
y ⋅ u j = c j ( u j ⋅ u j ) ⇒ c j = u j ⋅ u j y ⋅ u j .
Har coordinate decoupled hai — koi system solve nahi karna. Yahi poora magic hai.
Definition Orthonormal columns wali matrix
Maano U = [ u 1 ⋯ u p ] ke orthonormal columns hain. Tab
U T U = I p .
Agar U orthonormal columns ke saath square hai, toh ise orthogonal matrix kehte hain, aur tab
U − 1 = U T , U U T = I .
WHY U T U = I ? U T U ki ( i , j ) entry exactly u i ⋅ u j hai. Orthonormality kehti hai yeh diagonal par 1 hai, bahar 0 — yaani identity.
Worked example Example A — orthogonality verify karo, phir coordinates nikalo
Maano u 1 = 3 1 1 , u 2 = − 1 2 1 , u 3 = − 1 − 4 7 , aur y = 6 1 − 8 .
Step 1 — orthogonal check karo. Kyun? Taaki hum dot-product shortcut use kar sakein.
u 1 ⋅ u 2 = − 3 + 2 + 1 = 0 . u 1 ⋅ u 3 = − 3 − 4 + 7 = 0 . u 2 ⋅ u 3 = 1 − 8 + 7 = 0 . ✓ R 3 ka Orthogonal basis.
Step 2 — coordinates compute karo. Yeh formula kyun? Section 3 kehta hai c j = u j ⋅ u j y ⋅ u j .
y ⋅ u 1 = 18 + 1 − 8 = 11 , u 1 ⋅ u 1 = 9 + 1 + 1 = 11 ⇒ c 1 = 1.
y ⋅ u 2 = − 6 + 2 − 8 = − 12 , u 2 ⋅ u 2 = 1 + 4 + 1 = 6 ⇒ c 2 = − 2.
y ⋅ u 3 = − 6 − 4 − 56 = − 66 , u 3 ⋅ u 3 = 1 + 16 + 49 = 66 ⇒ c 3 = − 1.
Step 3 — check karo. 1 u 1 − 2 u 2 − 1 u 3 = 3 + 2 + 1 1 − 4 + 4 1 − 2 − 7 = 6 1 − 8 = y . ✓
Worked example Example B — orthonormal banane ke liye normalize karo
Upar u 1 ko normalize karo. ∥ u 1 ∥ = 11 , toh unit vector hai
q 1 = 11 1 3 1 1 .
Length se kyun divide karte hain? q 1 ⋅ q 1 = 1 force karne ke liye bina direction change kiye. Yeh teeno ke saath karne par ek orthonormal basis { q 1 , q 2 , q 3 } milti hai, aur phir coordinates sirf y ⋅ q j hain (koi denominator nahi).
Worked example Example C — orthonormal matrix length preserve karti hai
U = [ cos θ sin θ − sin θ cos θ ] . Columns: cos 2 θ + sin 2 θ = 1 har ek ke liye, aur − cos θ sin θ + sin θ cos θ = 0 → orthonormal. Toh ∥ U x ∥ = ∥ x ∥ : rotation length ko same rakhta hai. Yeh kyun important hai: numerically stable transforms kabhi data blow up ya shrink nahi karte.
Common mistake "Orthogonal matrix matlab sirf orthogonal columns kaafi hain."
Kyun sahi lagta hai: naam literally "orthogonal" kehta hai. Trap: term orthogonal matrix mein columns orthonormal (unit length bhi) AND matrix square honi chahiye. Sirf-orthogonal columns U T U = diagonal dete hain, I nahi. Fix: normalize karo, aur yaad rakho "orthogonal matrix = orthonormal square matrix" (historical misnaming).
Common mistake "Coordinates nikalne ke liye mujhe ek system solve karna hi padega."
Kyun sahi lagta hai: general basis ke liye hamesha yahi karte ho. Fix: agar basis orthogonal hai, mat karo — c j = u j ⋅ u j y ⋅ u j use karo. Solve karna waste hai.
Common mistake "Orthogonal vectors dependent ho sakte hain, toh chalo independence check karein."
Kyun sahi lagta hai: caution. Fix: nonzero orthogonal ⇒ already independent (Section 2). Sirf zero vector yeh tod sakta hai.
Common mistake Denominator bhool jaana jab basis sirf orthogonal ho (orthonormal nahi).
Kyun sahi lagta hai: orthonormal formula mein koi denominator nahi hota. Fix: pehle lengths check karo; u j ⋅ u j rakho jab tak yeh 1 ke barabar na ho.
Recall Quick self-test (answers dhako)
Orthonormal basis mein coordinate dene wala single operation kya hai? → ek dot product .
Orthonormal columns ke liye U T U = ? → == I == .
Nonzero orthogonal vectors independent kyun hote hain? → dependence relation ko u j ke saath dot karne se c j ∥ u j ∥ 2 = 0 isolate hota hai.
Orthogonal set kya hota hai? Vectors ka ek set jahan har distinct pair ka dot product 0 ho (u i ⋅ u j = 0 for i = j ).
Set ko orthonormal banane ki extra condition kya hai? Har vector ek unit vector ho (∥ u i ∥ = 1 ), yaani u i ⋅ u i = 1 .
Nonzero orthogonal set automatically linearly independent kyun hota hai? ∑ c i u i = 0 ko u j ke saath dot karne par c j ∥ u j ∥ 2 = 0 bachta hai, jo c j = 0 force karta hai.
Orthogonal basis mein coordinate formula? c j = u j ⋅ u j y ⋅ u j .
Orthonormal basis mein coordinate formula? c j = y ⋅ u j (denominator 1 hai).
Orthonormal columns wali matrix U ke liye U T U kya hai? Identity I .
U − 1 = U T kab hold karta hai?Jab U orthonormal columns ke saath square ho (ek orthogonal matrix).
Orthonormal transforms length preserve kyun karte hain? ∥ U x ∥ 2 = x T U T U x = x T x = ∥ x ∥ 2 .
Orthogonal set ko orthonormal mein kaise badlate ho? Normalize karo: har vector ko uske apne norm se divide karo.
"Orthogonal matrix" ke saath common misnomer trap? Ismein actually orthonormal (unit) columns aur square shape chahiye.
Recall Feynman: ek 12-saal ke bachche ko samjhao
Socho arrows alag-alag directions mein point kar rahe hain jo saare perfect right angles par hain, jaise ek room ke edges (left-right, forward-back, up-down). Agar koi kahin khada hai aur aap batana chahte ho woh kahan hai , toh aapko koi puzzle solve nahi karna — bas poochho "floor ke saath kitna aage?" aur "kitna upar?" alag-alag, kyunki directions ek doosre mein interfere nahi karte. Dot product exactly wahi "is arrow ke saath kitna door" measurement hai. Orthonormal matlab bhi yeh hai ki har arrow exactly ek step lamba hai, toh tumhare answers already sahi units mein hain. Isliye yeh duniya ka sabse aasaan coordinate system hai.
"O-N: Off-diagonal Nil, diagonal One." Orthonormal ⇒ dot products ki table identity hai. Aur "perpendicular ⇒ free independence; unit length ⇒ free denominators."
Dot product and norms — yahan har cheez ke peeche measuring tool.
Gram-Schmidt process — kisi bhi basis se orthogonal/orthonormal basis kaise banate hain.
Orthogonal projection — Section 3 ka formula literally projections ka sum hai.
Least squares — orthonormal bases normal equations ko trivial bana dete hain.
QR decomposition — Q ke orthonormal columns hain; R coordinates store karta hai.
Eigenvalues and eigenvectors — symmetric matrices ke orthonormal eigenbases hote hain (Spectral Theorem).
Orthogonal set: perpendicular pairs
Orthonormal set: perpendicular and unit
Normalize: divide by length
Linearly independent for free
Dot product trick: cross terms die
Coordinates by dot product
Projections, least squares, QR/SVD