4.5.38 · D5 · HinglishLinear Algebra (Full)
Question bank — Symmetric matrices — spectral theorem (real eigenvalues, orthogonal eigenvectors)
4.5.38 · D5· Maths › Linear Algebra (Full) › Symmetric matrices — spectral theorem (real eigenvalues, ort
Prerequisite ideas jo tumhare paas pehle se honi chahiye: Eigenvalues and Eigenvectors, Orthogonal Matrices, Diagonalization, Gram-Schmidt Process.
True or false — justify
Har real symmetric matrix ke eigenvalues sirf real hote hain.
True — proof mein real scalar banta hai; symmetry usse apne conjugate ke barabar force karti hai, isliye .
Har wo matrix jiske sirf real eigenvalues hon, symmetric hoti hai.
False — ke real eigenvalues hain lekin ye symmetric nahi hai; real spectrum symmetry ke liye necessary hai, sufficient nahi.
Ek symmetric matrix ke eigenvectors jo ek hi eigenvalue se belong karte hain, automatically orthogonal hote hain.
False — orthogonality ka proof tabhi kaam karta hai jab ho; ek hi eigenspace ke andar tumhe Gram-Schmidt Process se orthogonal basis choose karni padti hai.
Ek symmetric matrix jiska repeated eigenvalue ho, diagonalizable hone mein fail ho sakti hai.
False — symmetric matrices kabhi defective nahi hoti; har eigenvalue ki geometric multiplicity uski algebraic multiplicity ke barabar hoti hai, isliye full eigenbasis hamesha exist karti hai.
Agar distinct eigenvalues ke unit-length eigenvectors se bana ho, to .
True — orthonormal columns se milta hai, jo ek orthogonal matrix ki exact definition hai jiska transpose uska inverse hota hai.
aur ek hi baat hai.
False — dono ko diagonalize karte hain, lekin sirf orthonormal columns ke liye hota hai; ek generic unnormalized/non-orthogonal eigenvectors se hoga.
Koi bhi matrix jo satisfy kare, uska orthonormal eigenbasis hoga.
True — ye normal matrices hain; par ye unitarily diagonalizable hain, lekin ek real normal matrix ko complex eigenvectors ki zaroorat pad sakti hai (jaise ek rotation).
Identity matrix ke liye infinitely many alag-alag valid hain.
True — ka ek eigenvalue full multiplicity ka hai, isliye har orthonormal basis ek eigenbasis hai; bilkul free hai.
Ek symmetric matrix ke hamesha distinct eigenvalues hote hain.
False — repeats ko koi roka nahi hai (jaise mein repeat hota hai); ye poora orthonormal eigenset guarantee karta hai, distinctness nahi.
Spot the error
" ka eigenvalue hai, aur kyunki symmetric hai to ye theek hai, complex eigenvalues allowed hain."
Error yeh hai: symmetric matrices ke non-real eigenvalues nahi ho sakte, isliye impossible hai — sawal mein jo matrix hai wo truly symmetric nahi hai.
"Maine apni symmetric ko se diagonalize kiya lekin , to Spectral Theorem galat hai."
Error yeh hai: tum eigenvectors ko normalize karna bhool gaye; unit-length orthogonal columns se milta hai, aur lengths theek karne ke baad theorem sahi rahega.
" ke eigenvectors aur orthogonal nahi hain, jo Spectral Theorem ko contradict karta hai."
Error yeh hai: wo matrix symmetric nahi hai (), isliye orthogonality ki guarantee pehle se apply hi nahi hoti thi.
"Repeated eigenvalue ke liye mujhe do eigenvectors mile jo perpendicular nahi hain, to meri matrix defective hogi."
Error yeh hai: ek repeated eigenspace ke andar non-perpendicular basis vectors normal hain — unhe orthogonalize karne ke liye Gram-Schmidt Process apply karo; matrix phir bhi fully diagonalizable hai.
" ek scalar hai, isliye spectral sum ek number hai."
Error yeh hai: ek outer product hai (column times row) jo ek rank-1 matrix deta hai; scalar hota.
"Trace diagonal entries ka sum hai, isliye eigenvalues se uska koi lena-dena nahi."
Error yeh hai: kisi bhi square matrix ke liye trace ; ek symmetric ke liye ye compute kiye gaye eigenvalues ko turant sanity-check karne deta hai.
" symmetric hai, to nahi bhi ho sakti."
Error yeh hai: agar aur invertible hai, to bhi hoga — inverse lena symmetry ko preserve karta hai (eigenvalues bas ban jaate hain).
Why questions
Real-eigenvalue proof mein sirf transpose ki jagah conjugate transpose kyun use karte hain?
Kyunki a priori complex ho sakta hai, isliye complex hai; real aur positive sirf conjugation se rahta hai, jo force karta hai.
Symmetry specifically orthogonal eigenvectors kyun produce karti hai, sirf independent nahi?
Proof ko inner product ke across se move karne par pivot karta hai; wo swap hi deta hai, aur symmetry ke bina fail ho jaata hai.
ko sirf invertible ki jagah orthogonal kyun kaha jaata hai?
Iske columns orthonormal hain, isliye ; geometrically ye stretch kiye bina rotate/reflect karta hai, matlab eigen-coordinates mein jaane par lengths aur angles preserve hote hain.
ka matlab kyun hai ki ek symmetric matrix "koi twisting nahi" karta?
Right se left padhte hain: eigen-axes mein rotate karta hai, sirf un axes ke along stretch karta hai, wapas rotate karta hai — perpendicular directions ke along pure stretch, koi shear nahi.
Rank-1 spectral piece mein eigenvectors unit vectors kyun hone chahiye?
us axis par orthogonal projector tab hi hai jab ; warna projector galat scale hoga aur pieces mein sum nahi karenge.
Symmetric matrices mein repeated eigenvalue ek matching dimension ka eigenspace kyun deta hai lekin general matrices mein nahi?
Symmetric (aur isliye normal) matrices kabhi defective nahi hoti, isliye geometric multiplicity algebraic ke barabar hoti hai; ek general matrix jaise Jordan block ki algebraic multiplicity lekin sirf -dimensional eigenspace ho sakta hai.
Hum spectral theorem ko Quadratic Forms se kyun relate kar sakte hain?
Symmetric ke saath quadratic form eigen-coordinates mein ban jaata hai, isliye eigenvalues form ke pure stretch coefficients hain.
Edge cases
Zero matrix ke liye spectral theorem kya deta hai?
Har eigenvalue hai (), aur har orthonormal basis ki tarah kaam karti hai; "stretch" saari directions ko ek point par collapse kar deta hai.
Kya ek matrix spectral theorem satisfy karta hai?
Haan trivially — ye symmetric hai, iska akela eigenvalue hai, aur ; ye general statement ka degenerate base case hai.
Jab eigenvalue ho to eigenvectors ki orthogonality ka kya hota hai?
Kuch nahi badalta — ek bilkul valid distinct eigenvalue hai, isliye iske eigenvectors doosre eigenvalues ke eigenvectors se orthogonal rehte hain; matrix bas singular ho jaati hai.
Kya ek symmetric matrix ke negative eigenvalues ho sakte hain, aur geometrically iska matlab kya hai?
Haan — negative ka matlab hai ki us eigen-axis ke along sign flip karta hai ( se stretch plus ek reflection); ye Positive Definite Matrices se juda hai jo kisi hone par fail hoti hai.
Agar ek symmetric matrix ke saare eigenvalues ke barabar hon, to matrix kya hai?
Ye zaroori hogi — full-multiplicity eigenspace poora hai, isliye uniform scaling ki tarah act karta hai aur koi bhi orthogonal ho sakta hai.
Jab symmetric aur positive definite ho, to spectral theorem kaise specialize hota hai?
Saare eigenvalues strictly positive hain, isliye ka ek invertible square root hota hai, jo Positive Definite Matrices aur Singular Value Decomposition se connect karta hai.
Ek general (non-symmetric) matrix ke liye, orthonormal factors paane ke liye spectral decomposition ki jagah kya aata hai?
Singular Value Decomposition do alag orthonormal bases aur non-negative singular values use karta hai, ki zaroorat ke bina "orthogonal stretch" picture recover karta hai.
Agar do symmetric matrices aur commute karein (), to unke eigenvectors ke baare mein kya kaha ja sakta hai?
Unhe simultaneously orthogonally diagonalize kiya ja sakta hai — ek shared orthonormal eigenbasis exist karta hai, isliye ek hi dono ko diagonalize karta hai.
Recall Lock in karne ke liye ek-line summary
Real spectrum, orthogonal eigenvectors, kabhi defective nahi ::: Ye teen hi poora theorem hain; upar har trap inhi mein se ek ko doubt karna, over-generalize karna, ya non-symmetric matrix par apply karna hai.