4.5.33 · Maths › Linear Algebra (Full)
Intuition Badi picture (KYU)
Ordinary dot product u ⋅ v = u 1 v 1 + u 2 v 2 + ⋯ + u n v n secretly teen kaam karta hai: length measure karta hai (∥ v ∥ = v ⋅ v ), angle measure karta hai (cos θ = ∥ u ∥∥ v ∥ u ⋅ v ), aur perpendicularity detect karta hai (u ⋅ v = 0 ).
Deep idea yeh hai: geometry ek single algebraic operation se aati hai. Toh agar hum weird spaces — polynomials, functions, random variables — par geometry chahte hain, toh bas ek aisa operation invent karna hoga jo dot product ki tarah behave kare. Woh operation jo rules follow kare, woh hain inner product ke axioms . Jo bhi unhe satisfy kare, usse automatically length, angle, aur orthogonality "free mein" mil jaati hai.
Maano V ek real vector space hai. Ek inner product ek function ⟨ ⋅ , ⋅ ⟩ : V × V → R hota hai jo vectors ke har pair ko ek real number assign karta hai, aur yeh conditions satisfy karta hai sab u , v , w ∈ V aur scalar c ke liye:
Symmetry: ⟨ u , v ⟩ = ⟨ v , u ⟩
Linearity (1st slot mein): ⟨ c u + w , v ⟩ = c ⟨ u , v ⟩ + ⟨ w , v ⟩
Positive-definiteness: ⟨ v , v ⟩ ≥ 0 , aur == ⟨ v , v ⟩ = 0 ⟺ v = 0 ==
Ek vector space jo aise function se equipped ho, woh ek inner product space hai.
YEH TEEN AXIOMS KYU? Har ek geometry ka ek piece bachata hai:
Symmetry → u , v ke beech ka angle wahi hai jo v , u ke beech hoga.
Linearity → "vector ko stretch karna uske projections scale karta hai", isse compute karna possible hota hai.
Positive-definiteness → guarantee karta hai ki ∥ v ∥ = ⟨ v , v ⟩ ek real, non-negative number hai, aur sirf zero vector ki length zero hoti hai.
Intuition Cauchy–Schwarz ki zaroorat kyun hai
cos θ = ∥ u ∥∥ v ∥ ⟨ u , v ⟩ ek genuine cosine ho, iske liye yeh [ − 1 , 1 ] mein hona chahiye. Yeh exactly Cauchy–Schwarz inequality hai. Toh yeh inequality "admission ka price" hai taaki "angle" ka koi matlab ho.
Worked example Derivation: Cauchy–Schwarz
∣ ⟨ u , v ⟩ ∣ ≤ ∥ u ∥ ∥ v ∥
Trick: vector u − t v ki length-squared har real t ke liye non-negative hai.
0 ≤ ⟨ u − t v , u − t v ⟩
Yeh step kyun? Positive-definiteness (axiom 3) guarantee karta hai ki right side ≥ 0 hai, jo humein ek free inequality deta hai.
Linearity + symmetry use karke expand karo:
0 ≤ ⟨ u , u ⟩ − 2 t ⟨ u , v ⟩ + t 2 ⟨ v , v ⟩
Kyun? Yeh t mein ek quadratic hai: f ( t ) = ∥ v ∥ 2 t 2 − 2 ⟨ u , v ⟩ t + ∥ u ∥ 2 ≥ 0 sab t ke liye.
Ek quadratic a t 2 + b t + c jo kabhi negative nahi hota, uska discriminant ≤ 0 hota hai:
b 2 − 4 a c ≤ 0 ⇒ 4 ⟨ u , v ⟩ 2 − 4∥ v ∥ 2 ∥ u ∥ 2 ≤ 0
Kyun? Agar discriminant positive hota toh parabola zero se neeche jaata, jo axiom 3 ko contradict karta.
⇒ ⟨ u , v ⟩ 2 ≤ ∥ u ∥ 2 ∥ v ∥ 2 ⇒ ∣ ⟨ u , v ⟩ ∣ ≤ ∥ u ∥∥ v ∥ ■
Worked example Derivation: Triangle inequality
∥ u + v ∥ ≤ ∥ u ∥ + ∥ v ∥
∥ u + v ∥ 2 = ⟨ u + v , u + v ⟩ = ∥ u ∥ 2 + 2 ⟨ u , v ⟩ + ∥ v ∥ 2
Yeh step kyun? Linearity se expand karo taaki cross term saamne aaye.
≤ ∥ u ∥ 2 + 2∥ u ∥∥ v ∥ + ∥ v ∥ 2 = ( ∥ u ∥ + ∥ v ∥ ) 2
Kyun? Humne ⟨ u , v ⟩ ≤ ∣ ⟨ u , v ⟩ ∣ ≤ ∥ u ∥∥ v ∥ Cauchy–Schwarz use karke bound kiya. Square root lo. ■
R 2 par weighted inner product
Define karo ⟨ u , v ⟩ = 3 u 1 v 1 + 2 u 2 v 2 . Kya yeh inner product hai?
Symmetry ✓ (multiplication commute karta hai). Linearity ✓ (distribute karta hai).
Positivity: ⟨ v , v ⟩ = 3 v 1 2 + 2 v 2 2 ≥ 0 , zero sirf tab jab v 1 = v 2 = 0 . ✓
Weights matter kyun karte hain? Weights axes ko stretch karte hain — is space mein distances usual wali nahi hain. (Negative weights positivity tod denge → inner product nahi.)
Compute karo ∥ ( 1 , 1 ) ∥ = 3 ( 1 ) + 2 ( 1 ) = 5 .
Worked example 2. Evaluation ke zariye polynomials ka inner product
Degree ≤ 1 ke polynomials par, define karo ⟨ p , q ⟩ = p ( 0 ) q ( 0 ) + p ( 1 ) q ( 1 ) .
Lo p ( x ) = x , q ( x ) = 1 − x .
⟨ p , q ⟩ = p ( 0 ) q ( 0 ) + p ( 1 ) q ( 1 ) = ( 0 ) ( 1 ) + ( 1 ) ( 0 ) = 0
Yeh nice kyun hai? x aur 1 − x is inner product ke under orthogonal hain! Polynomials par geometry.
Worked example 3. Function inner product (integral)
[ 0 , 1 ] par continuous functions par: ⟨ f , g ⟩ = ∫ 0 1 f ( x ) g ( x ) d x .
Dikhao ki sin ( 2 π x ) aur cos ( 2 π x ) orthogonal hain:
∫ 0 1 sin ( 2 π x ) cos ( 2 π x ) d x = 2 1 ∫ 0 1 sin ( 4 π x ) d x = 2 1 [ − 4 π c o s 4 π x ] 0 1 = 0
Yeh step kyun? sin A cos A = 2 1 sin 2 A use kiya, phir ek full period par integrate kiya → zero. Yeh orthogonality Fourier series ka engine hai.
Common mistake "Koi bhi bilinear symmetric form inner product hoti hai."
Yeh sahi kyun lagta hai: symmetry + linearity "zyaadatar rules" ki tarah lagte hain, toh log positive-definiteness skip kar dete hain.
Fix: ⟨ u , v ⟩ = u 1 v 1 − u 2 v 2 symmetric aur bilinear hai, lekin ⟨( 0 , 1 ) , ( 0 , 1 )⟩ = − 1 < 0 . Length imaginary ho jaati! Positive-definiteness negotiate nahi hoti .
cos θ result 1.4 aa sakta hai, koi problem nahi."
Yeh sahi kyun lagta hai: tum bas formula mein plug karte ho.
Fix: Cauchy–Schwarz ∣ cos θ ∣ > 1 ko forbid karta hai. Agar > 1 aa raha hai, toh arithmetic error hai ya tumne non-inner-product use ki. Yeh inequality ek built-in error check hai.
Common mistake "Orthogonal ka matlab hamesha usual right angle hota hai."
Yeh sahi kyun lagta hai: R 2 mein dot product ke saath yahi hota hai.
Fix: x aur 1 − x evaluation inner product ke under "perpendicular" hain lekin kaagaz par obviously 90° par nahi hain. Orthogonality chosen inner product ke relative hoti hai.
Real inner product ke teen axioms Symmetry, linearity in first slot, positive-definiteness (⟨ v , v ⟩ ≥ 0 , = 0 ⟺ v = 0 ).
Inner product se norm kaise define hoti hai Cauchy–Schwarz ka statement ∣ ⟨ u , v ⟩ ∣ ≤ ∥ u ∥ ∥ v ∥ .
Cauchy–Schwarz derive karne ki key trick ⟨ u − t v , u − t v ⟩ ≥ 0 sab t ke liye use karo, phir discriminant ≤ 0 force karo.
Discriminant ≤ 0 kyun hona chahiye Ek quadratic in t jo kabhi negative nahi hota woh axis cross nahi kar sakta, isliye b 2 − 4 a c ≤ 0 .
Inner product space mein angle ki definition cos θ = ∥ u ∥∥ v ∥ ⟨ u , v ⟩ , valid hai kyunki Cauchy–Schwarz ise [ − 1 , 1 ] mein rakhta hai.
Do vectors orthogonal kab hote hain Jab ⟨ u , v ⟩ = 0 ho (us inner product ke relative).
u 1 v 1 − u 2 v 2 ke liye kaunsa axiom fail hota haiPositive-definiteness (negative ho sakta hai).
C [ 0 , 1 ] par inner product⟨ f , g ⟩ = ∫ 0 1 f ( x ) g ( x ) d x .
Triangle inequality aur woh kis par depend karta hai ∥ u + v ∥ ≤ ∥ u ∥ + ∥ v ∥ ; cross term bound karne ke liye Cauchy–Schwarz par depend karta hai.
Recall Feynman: 12-saal ke bachche ko explain karo
Socho ek magic ruler hai. Normally ek ruler length measure karta hai. Lekin yeh magic ruler do arrows ke beech ka angle bhi bata sakta hai aur yeh bhi ki woh perfect corner bana rahe hain ya nahi. Dot product normal arrows ke liye wahi magic ruler hai. Ab socho tumhare "arrows" actually shapes hain, ya wiggly sound waves hain, ya numbers ki lists hain. Hume bas unke liye ek magic ruler invent karna hai — ek aisa rule jo in do cheezein leta ho aur ek number deta ho. Jab tak rule teen fairness rules follow kare (order se fark nahi padta, stretching ke saath theek se kaam karta hai, aur kisi cheez ki length kabhi negative nahi hoti), toh yeh turant shapes aur sounds ke liye lengths, angles, aur "right angles" de deta hai — chahe hum unhe draw bhi na kar sakein!
Mnemonic Teen axioms yaad karo:
"SLP"
S ymmetry, L inearity, P ositive-definite → "S uper L egit P roduct" . Agar koi bhi letter fail ho, toh woh inner product nahi hai.
Dot Product — woh prototype jise yeh generalize karta hai.
Norms and Distance — ⟨ v , v ⟩ se build ki gayi length.
Orthogonality and Gram-Schmidt — "perpendicular" define karne ke liye inner product chahiye.
Cauchy-Schwarz Inequality — guarantee ki angles exist karte hain.
Fourier Series — functions par integral inner product use karta hai.
Orthogonal Projections — ⟨ ⋅ , ⋅ ⟩ use karke subspaces par project karna.
Computation of projections