4.5.38 · D3 · Maths › Linear Algebra (Full) › Symmetric matrices — spectral theorem (real eigenvalues, ort
Yeh page parent topic ki "worked-out drill" child hai. Parent ne prove kiya kyun real symmetric matrices aisa behave karti hain. Yahan hum har tarah ka case cover karenge jo ek problem mein aa sakta hai, aur har ek ko numeric answer tak grind karenge.
Shuru karne se pehle, ek plain-words reminder taaki koi cheez use hone se pehle build ho jaye.
Definition Woh teen objects jo hum baar baar reuse karte hain
Ek symmetric matrix A ek square grid of numbers hai jo apni main diagonal ke across same padhti hai: row i , column j wala number row j , column i wale number ke barabar hota hai. Symbolically A = A ⊤ , jahan A ⊤ (bolo "A transpose") A ko us diagonal ke across flip karna hai.
Ek eigenvalue λ aur uska eigenvector v satisfy karte hain A v = λ v : v ko A mein daalne par woh sirf λ number se stretch hota hai, koi turning nahi. Dekho Eigenvalues and Eigenvectors .
Orthogonal ka matlab hai "right angle par": do vectors u , v orthogonal hote hain jab unka dot product u ⋅ v = u 1 v 1 + u 2 v 2 + ⋯ = 0 ho. Dot product kyun? Kyunki u ⋅ v = ∥ u ∥ ∥ v ∥ cos θ , toh yeh exactly tab zero hota hai jab angle θ 9 0 ∘ ho.
Har symmetric-matrix problem inhi cells mein se ek mein aati hai. Neeche ke examples labeled hain us cell se jo woh cover karte hain, taaki saath milke koi gap na rahe .
#
Case class
Kya unusual hai
Example
C1
Dono eigenvalues positive
ordinary "stretch/stretch"
Ex 1
C2
Mixed signs (ek + , ek − )
andar ek reflection chhupa hai
Ex 2
C3
Ek zero eigenvalue (singular A )
A ek poori direction ko 0 par squash karta hai
Ex 3
C4
Repeated eigenvalue (multiplicity 2)
eigenvectors forced nahi — tum choose karte ho
Ex 4
C5
Diagonal A (degenerate/limiting)
eigenvectors khud axes hain
Ex 5
C6
3 × 3 ek clean block ke saath
3D mein poora spectral decomposition
Ex 6
C7
Word problem (real-world)
pehle symmetric matrix banana padega
Ex 7
C8
Exam twist — A ko Q , Λ se rebuild karo
theorem ko ulta chalao
Ex 8
A = ( 4 1 1 4 ) ko orthogonally diagonalize karo.
Forecast: trace = 8 , det = 16 − 1 = 15 . Kaunse do numbers 8 mein add hote hain aur 15 mein multiply? Aage padhne se pehle guess karo.
Steps:
λ 2 − 8 λ + 15 = 0 = ( λ − 5 ) ( λ − 3 ) solve karo, toh λ = 5 , 3 .
Yeh step kyun? Characteristic quadratic directly trace aur det se banti hai — haath se det ( A − λ I ) expand karne ki zaroorat nahi.
λ = 5 : ( A − 5 I ) x = ( − 1 1 1 − 1 ) x = 0 solve karo. Dono rows kehti hain − x 1 + x 2 = 0 , toh x = ( 1 , 1 ) .
Yeh step kyun? Ek eigenvector koi bhi nonzero vector hai jise shifted matrix 0 par bhej de; dono rows agree karte hain, jo confirm karta hai eigenvalue sahi hai.
λ = 3 : ( A − 3 I ) x = ( 1 1 1 1 ) x = 0 ⇒ x = ( 1 , − 1 ) .
Normalize karo (har ek ko uski length 2 se divide karo): q 1 = 2 1 ( 1 , 1 ) , q 2 = 2 1 ( 1 , − 1 ) .
Yeh step kyun? Sirf unit-length columns hi Q ⊤ = Q − 1 banate hain, jo P Λ P − 1 ko tidy Q Λ Q ⊤ mein turn karta hai. Dekho Diagonalization aur Orthogonal Matrices .
Q = 2 1 ( 1 1 1 − 1 ) , Λ = ( 5 0 0 3 ) .
Verify: dot product ( 1 , 1 ) ⋅ ( 1 , − 1 ) = 0 ✓ (orthogonal, jaise distinct eigenvalues ke liye promise tha). Rebuild: Q Λ Q ⊤ = ( 4 1 1 4 ) = A ✓. Dono λ > 0 , toh A stretch karta hai (kabhi flip nahi karta) — yeh positive definite hai, dekho Positive Definite Matrices .
Dono eigenvalues positive matlab har direction outward push hoti hai. Neeche ki picture eigen-axes dikhati hai (woh sirf do directions jinhein A same pointing chhod deta hai) aur kaise ek circle balloon hokar ellipse ban jaati hai.
A = ( 1 2 2 1 ) ko diagonalize karo.
Forecast: trace = 2 , det = 1 − 4 = − 3 . Ek negative determinant matlab eigenvalues ki opposite signs hain (unka product negative hai). Unhe guess karo.
Steps:
λ 2 − 2 λ − 3 = 0 = ( λ − 3 ) ( λ + 1 ) , toh λ = 3 , − 1 .
Yeh step kyun? Negative eigenvalue koi error nahi hai — iska matlab hai A us eigen-axis ke along reflect karta hai (points wapas ulti direction mein point karte hain).
λ = 3 : ( − 2 2 2 − 2 ) x = 0 ⇒ x = ( 1 , 1 ) .
λ = − 1 : ( 2 2 2 2 ) x = 0 ⇒ x = ( 1 , − 1 ) .
Same normalized Q jaise Example 1 mein, lekin ab Λ = ( 3 0 0 − 1 ) .
Verify: ( 1 , 1 ) ⋅ ( 1 , − 1 ) = 0 ✓. Eigenvalues ka product 3 × ( − 1 ) = − 3 = det ✓, sum 3 + ( − 1 ) = 2 = trace ✓. q 2 ke along vector A ( 1 , − 1 ) = ( − 1 , 1 ) = − 1 ⋅ ( 1 , − 1 ) — genuinely flip hua.
Neeche ki magenta arrow reflect hoti eigen-direction hai: same line, reversed arrow.
A = ( 1 1 1 1 ) ko diagonalize karo.
Forecast: trace = 2 , det = 1 − 1 = 0 . Ek zero determinant matlab ek eigenvalue 0 hai (eigenvalues ka product 0 hai). Doosra poora trace hona chahiye. Unhe guess karo.
Steps:
λ 2 − 2 λ + 0 = 0 = λ ( λ − 2 ) , toh λ = 2 , 0 .
Yeh step kyun? Ek zero eigenvalue matlab A ek poori direction ko origin par flatten kar deta hai — woh direction null space hai.
λ = 2 : ( − 1 1 1 − 1 ) x = 0 ⇒ x = ( 1 , 1 ) .
λ = 0 : seedha A x = 0 ⇒ ( 1 , 1 ) ⋅ ( x 1 , x 2 ) ... x 1 + x 2 = 0 solve karo ⇒ x = ( 1 , − 1 ) .
Yeh step kyun? λ = 0 ka eigenvector null space hi hai : line x = ( t , − t ) par sab kuch 0 par bhej diya jaata hai.
Q = 2 1 ( 1 1 1 − 1 ) , Λ = ( 2 0 0 0 ) .
Verify: A ( 1 , − 1 ) = ( 0 , 0 ) ✓ (squash hua). A ( 1 , 1 ) = ( 2 , 2 ) = 2 ( 1 , 1 ) ✓. Spectral sum: A = 2 q 1 q 1 ⊤ = 2 ⋅ 2 1 ( 1 1 1 1 ) = A ✓ (λ = 0 wala piece kuch contribute nahi karta — exactly yahi reason hai kyun singular matrices rank lose karti hain).
Neeche ki orange line squashed direction hai — us par har point origin par land karta hai.
A = ( 3 0 0 3 ) ko diagonalize karo... ruko, yeh toh bahut easy hai. Disguised version A = ( 3 0 0 3 ) lo lekin prove karo ki eigenvalue repeat hota hai aur koi bhi orthonormal pair kaam karta hai.
Forecast: trace = 6 , det = 9 . Do numbers jo 6 mein sum aur 9 mein multiply hote hain: dono 3 hone chahiye. Toh eigenvectors kya hain?
Steps:
λ 2 − 6 λ + 9 = ( λ − 3 ) 2 , toh λ = 3 twice.
Yeh step kyun? Ek repeated root warn karta hai ki eigenvector ek single line par force nahi hai .
( A − 3 I ) x = ( 0 0 0 0 ) x = 0 solve karo. Har vector yeh solve karta hai.
Yeh step kyun? Shifted matrix sab zeros hai, toh eigenspace poora plane hai — ek 2D eigenspace, kabhi defective nahi (parent ka promise symmetric matrices ke liye).
Kyunki koi bhi do perpendicular unit vectors valid Q banate hain, axes q 1 = ( 1 , 0 ) , q 2 = ( 0 , 1 ) choose karo, YA rotated pair 2 1 ( 1 , 1 ) , 2 1 ( 1 , − 1 ) . Dono dete hain Λ = ( 3 0 0 3 ) .
Yeh step kyun? Jab eigen-directions distinguish nahi kar sakte, tum ek orthonormal basis choose karte ho (higher dimensions mein Gram-Schmidt Process use karo).
Verify: Rotated pair ke liye, Q Λ Q ⊤ = 3 Q Q ⊤ = 3 I = A ✓ kyunki kisi bhi orthogonal Q ke liye Q Q ⊤ = I . Scalar-multiple-of-identity tumhari axis choice ke liye invariant hoti hai — yahi "repeated eigenvalue" ka geometric meaning hai.
A = ( 7 0 0 − 2 ) (already diagonal) ko diagonalize karo.
Forecast: Agar A already diagonal hai, toh kya kaam bacha? Q aur Λ guess karo.
Steps:
Off-diagonals 0 hain, toh eigenvalues simply diagonal entries hain: λ = 7 , − 2 .
Yeh step kyun? A e 1 = ( 7 , 0 ) = 7 e 1 aur A e 2 = ( 0 , − 2 ) = − 2 e 2 — standard axes already eigenvectors hain.
Q = I = ( 1 0 0 1 ) , Λ = A .
Yeh step kyun? Yeh degenerate/limiting case hai: "special axes dhundho" trivial hai kyunki A apni hi eigen-basis mein likha tha shuroo se.
Verify: I Λ I ⊤ = Λ = A ✓. Note karo ek eigenvalue negative hai — mixed signs phir, det = − 14 < 0 ke saath consistent.
A = 5 0 0 0 2 1 0 1 2 ko diagonalize karo.
Forecast: Top-left 2 × 2 bottom block se decoupled hai. Teen eigenvalues kya hain?
Steps:
Isolated 5 deta hai λ = 5 eigenvector ( 1 , 0 , 0 ) ke saath.
Yeh step kyun? Row/column 1 mein koi coupling nahi, toh e 1 seedha pass hota hai: A e 1 = 5 e 1 .
Bottom block ( 2 1 1 2 ) : trace 4 , det 3 , toh λ = 3 , 1 (y , z slots mein eigenvectors ( 1 , 1 ) aur ( 1 , − 1 ) ).
Yeh step kyun? Sub-block par Ex 1 ka exact 2 × 2 trick reuse karo; block-diagonal problems independent chhote problems mein split hoti hain.
Full eigenvectors: λ = 5 : ( 1 , 0 , 0 ) ; λ = 3 : ( 0 , 1 , 1 ) ; λ = 1 : ( 0 , 1 , − 1 ) . Last do ko 2 se normalize karo.
Q = 1 0 0 0 2 1 2 1 0 2 1 − 2 1 , Λ = 5 0 0 0 3 0 0 0 1 .
Verify: Teeno eigenvectors pairwise orthogonal: ( 1 , 0 , 0 ) ⋅ ( 0 , 1 , 1 ) = 0 , ( 1 , 0 , 0 ) ⋅ ( 0 , 1 , − 1 ) = 0 , ( 0 , 1 , 1 ) ⋅ ( 0 , 1 , − 1 ) = 1 − 1 = 0 ✓. Rebuild Q Λ Q ⊤ = A ✓. Yeh Singular Value Decomposition se link karta hai: symmetric positive-definite A ke liye, SVD equals spectral decomposition.
Ek stretchy sheet deform hoti hai taaki position ( x , y ) par point move ho ( x + 0.5 y , 0.5 x + y ) par. Strain symmetric hai. Do perpendicular directions of pure stretch aur unke stretch factors dhundho.
Forecast: Transformation matrix hai A = ( 1 0.5 0.5 1 ) . Trace = 2 , det = 1 − 0.25 = 0.75 . Stretch factors guess karo.
Steps:
Confirm karo A symmetric hai: off-diagonals dono 0.5 ✓, toh Spectral Theorem apply hota hai aur pure-stretch axes exist karti hain.
Yeh step kyun? Physically, ek symmetric strain mein principal axes hote hain bina shear ke — theorem unhe guarantee karta hai.
λ 2 − 2 λ + 0.75 = 0 . λ = 2 2 ± 4 − 3 = 2 2 ± 1 use karke, toh λ = 1.5 , 0.5 .
Yeh step kyun? Yeh stretch factors hain: 1.5 (50% stretch) aur 0.5 (half tak compress).
λ = 1.5 : direction ( 1 , 1 ) (4 5 ∘ diagonal). λ = 0.5 : direction ( 1 , − 1 ) (anti-diagonal).
Yeh step kyun? ( 1 , 1 ) ke along sheet sabse zyada stretch hoti hai; perpendicular ( 1 , − 1 ) ke along compress hoti hai. Yeh exactly ek ellipse ki axes ki Quadratic Forms geometry hai.
Verify: A ( 1 , 1 ) = ( 1.5 , 1.5 ) = 1.5 ( 1 , 1 ) ✓; A ( 1 , − 1 ) = ( 0.5 , − 0.5 ) = 0.5 ( 1 , − 1 ) ✓. Directions perpendicular: ( 1 , 1 ) ⋅ ( 1 , − 1 ) = 0 ✓. Units: stretch factors dimensionless ratios hain (new length / old length) ✓.
Tumhe diya gaya hai Q = 2 1 ( 1 1 − 1 1 ) aur Λ = ( 6 0 0 2 ) . Symmetric matrix A = Q Λ Q ⊤ reconstruct karo aur confirm karo ki yeh symmetric hai.
Forecast: Eigenvalues 6 aur 2 (dono positive) aur 4 5 ∘ -rotated eigen-axes ke saath, guess karo ki kya A ke equal diagonal entries hain aur nonzero off-diagonal.
Steps:
Pehle Λ Q ⊤ : Λ Q ⊤ = ( 6 0 0 2 ) ⋅ 2 1 ( 1 − 1 1 1 ) = 2 1 ( 6 − 2 6 2 ) .
Yeh step kyun? Right-to-left multiply karne se har matrix chota rehta hai; Q ⊤ woh Q hai jiske rows aur columns swap hain.
Phir Q ( Λ Q ⊤ ) = 2 1 ( 1 1 − 1 1 ) ⋅ 2 1 ( 6 − 2 6 2 ) = 2 1 ( 8 4 4 8 ) = ( 4 2 2 4 ) .
Yeh step kyun? Yeh spectral theorem constructively use hai — tum chosen orthonormal axes aur chosen eigenvalues se koi bhi symmetric matrix manufacture kar sakte ho.
Verify: A = ( 4 2 2 4 ) mein A = A ⊤ ✓ (off-diagonals dono 2 ). Trace = 8 = 6 + 2 ✓, det = 16 − 4 = 12 = 6 × 2 ✓. Recovered eigenvalues Λ se match karte hain.
Recall Quick self-test
Ek symmetric 2 × 2 matrix ke liye det A < 0 diya hai, eigenvalues ke baare mein kya keh sakte ho? ::: Unki opposite signs hain (product negative hai), toh A ek eigen-axis ke along reflect karta hai (Case C2).
Ek symmetric matrix ka det = 0 hai. Ek eigenvalue kya equal hai, aur geometrically kya hota hai? ::: Ek eigenvalue 0 hai; woh eigen-direction origin par squash ho jaati hai — A singular hai (Case C3).
Ek symmetric matrix par repeated eigenvalue ke liye, kya eigenvectors uniquely determined hain? ::: Nahi — eigenspace full-dimensional hai, toh tum ek orthonormal basis choose karte ho (Gram–Schmidt) (Case C4).
2 × 2 symmetric matrix ko ek nazar mein padhna
T race sum batata hai, D eterminant product batata hai. Det ka sign: + = same-sign eigenvalues, − = mixed, 0 = ek eigenvalue vanish ho jaata hai.