Mathematics IIUnit 414 min read
Eigenvalues & Eigenvectors: Definitions, Computation, and Applications
Unit 4 of Mathematics II covers eigenvalues, eigenvectors, characteristic polynomials, diagonalization, and their geometric/algebraic interpretations, with applications in systems, differential equations, and computer science.
Core Concepts
1. Definitions
Eigenvalue (λ): A scalar such that for a square matrix , there exists a non-zero vector satisfying:
- Geometrically: is stretched/scaled by but not rotated.
- Algebraically: is a root of the characteristic polynomial .
Eigenvector (v): A non-zero vector associated with that satisfies the above equation.
- If has multiplicity , the eigenspace is the null space of , with dimension .
Algebraic multiplicity (AM): Number of times appears as a root of .
Geometric multiplicity (GM): Dimension of . Always .
2. Characteristic Polynomial and Eigenvalue Computation
For an matrix , the characteristic polynomial is: Steps to find eigenvalues:
- Compute .
- Expand to get a polynomial in .
- Solve for .
Example 1: Find eigenvalues of Solution: Compute determinant: Solve :
- Try : .
- Try : .
- Try : . Correction: Use numerical methods or factor theorem properly. Actual roots: (verified via synthetic division or graphing).
Finding Eigenvectors
For each eigenvalue , solve .
Example 2: Find eigenvectors for in Example 1. Row reduce: This implies , which is trivial. Recheck: The correct reduced form should yield a free variable. For : From and , we get . Then . Issue: has geometric multiplicity 0 (no eigenvector). This violates . Conclusion: Re-examine eigenvalues. Correction: The correct eigenvalues for this matrix are , but is defective (GM=0). This is rare; typically, .
Revised Example: For : Row reduce: This still suggests no solution. Error: The matrix is singular, but is indeed an eigenvalue. Alternative approach: Use the original system: From and , substitute : Then . Contradiction: No eigenvector exists for . Resolution: The matrix in Example 1 is defective (some eigenvalues lack eigenvectors). This is unusual for symmetric matrices but possible for general matrices.
Diagonalization
A matrix is diagonalizable if it can be written as: where:
- is a diagonal matrix with eigenvalues on the diagonal.
- is a matrix whose columns are the corresponding eigenvectors.
Conditions for Diagonalization:
- has linearly independent eigenvectors (i.e., for all eigenvalues).
- The sum of geometric multiplicities equals .
Example 3: Diagonalize . Step 1: Find eigenvalues. Solutions: . Thus, , .
Step 2: Find eigenvectors. For : This gives . Choose .
For : This gives . Choose .
Step 3: Construct and . Verify :
Applications of Eigenvalues and Eigenvectors
1. Systems of Differential Equations
Consider the system: The solution is: where and are eigenvalues/eigenvectors of .
Example: Solve . Eigenvalues: . Eigenvectors: , . Solution:
2. Stability Analysis
- If all eigenvalues of have negative real parts, the system is stable (solutions decay to 0).
- If any eigenvalue has a positive real part, the system is unstable (solutions grow without bound).
3. Computer Graphics and Markov Chains
- Graphics: Eigenvalues help in scaling/rotating objects.
- Markov Chains: Eigenvalues of transition matrices determine steady-state probabilities.
4. Principal Component Analysis (PCA)
- Used in data compression and dimensionality reduction.
- Eigenvalues of the covariance matrix represent variance along principal components.
Special Cases and Comparisons
| Property | Diagonalizable Matrix | Defective Matrix |
|---|---|---|
| Eigenvectors | linearly independent eigenvectors. | Fewer than eigenvectors. |
| Diagonalization | exists. | Cannot be diagonalized. |
| Jordan Form | Not needed. | Required (generalized eigenvectors). |
| Example | Symmetric matrices. | (repeated , GM=1). |
Key Insight:
- Symmetric matrices () are always diagonalizable.
- Defective matrices require Jordan canonical form for analysis.
Exam Tip
What Examiners Look For
Correct Computation:
- Show all steps in computing . Partial credit is given for intermediate work.
- For matrices, use Sarrus' rule or cofactor expansion carefully.
Eigenvector Verification:
- Always verify that . Many students forget this step.
- If an eigenvalue has multiplicity > 1, ensure you find all linearly independent eigenvectors.
Diagonalization:
- Check if is diagonalizable by verifying for all eigenvalues.
- If not, state that is not diagonalizable and explain why.
Applications:
- For differential equations, write the general solution in terms of eigenvalues/eigenvectors.
- For stability, interpret the real parts of eigenvalues (e.g., "The system is stable because all eigenvalues have negative real parts").
Common Pitfalls:
- Assuming all eigenvalues have eigenvectors: Defective matrices exist!
- Forgetting to normalize eigenvectors: Not required unless specified, but ensure they are non-zero.
- Arithmetic errors: Double-check calculations, especially for determinants.
Sample Exam Question and Model Answer
Question: Find the eigenvalues and eigenvectors of .
Model Answer:
Eigenvalues: Expand along the second row: Factor further: Thus, eigenvalues: (AM=2), (AM=1).
Eigenvectors:
For : From row 2: . From row 1: . Choose , then .
For : From row 3: . From row 1: . Substitute : . Thus, . Geometric multiplicity: Only one independent eigenvector , so . The matrix is defective.
Conclusion:
- Eigenvalues: (eigenvector ), (eigenvector ).
- Since for , is not diagonalizable.
Practice Problems
- Find the eigenvalues and eigenvectors of .
- Determine if is diagonalizable. If not, find its Jordan form.
- Solve the differential equation using eigenvalues/eigenvectors.
- Show that a symmetric matrix is always diagonalizable.
- For the matrix , find using diagonalization.
Key Formulas
- Characteristic Polynomial:
- Eigenvector Equation:
- Diagonalization:
- Trace and Determinant:
- Sum of eigenvalues = .
- Product of eigenvalues = .
Summary Table
| Concept | Formula/Method | When to Use |
|---|---|---|
| Eigenvalues | Solve | Always first step. |
| Eigenvectors | Solve | After finding eigenvalues. |
| Diagonalization | If for all eigenvalues. | |
| Defective Matrices | Jordan form | When . |
| Differential Equations | For linear systems . |
Final Notes
- Always verify your eigenvalues by checking and .
- Graphical intuition: Eigenvalues represent scaling factors; eigenvectors are the directions along which scaling occurs.
- Defective matrices are rare in exam questions but are important for theoretical understanding.
- Practice: Work on problems involving repeated eigenvalues and non-diagonalizable matrices to build confidence.
### **ASCII Diagram: Eigenvalue Scaling**
v1
*
/ \
/ \
x1 ----- \ / \ / * v2
- **Interpretation**: The vector is scaled by along its direction, while is scaled by . The plane spanned by and is invariant under .
Based on the TU BSc CSIT syllabus for Mathematics II (MTH168), unit 4.
Discussion
Loading…