Eigenvalues and eigenvectors close out Module 5 of VTU Engineering Mathematics 1, and for most students they’re the first genuinely abstract idea in the whole semester. Everything before this point — differentiation, integration, differential equations — still resembles PUC mathematics in shape. Eigenvalues don’t. The question "for which vectors does multiplying by this matrix just scale the vector, without changing its direction?" doesn’t have an obvious PUC analogue, which is exactly why this topic needs to be taught from the geometry first, not just the algorithm.
What an Eigenvalue Actually Means
For a square matrix A, an eigenvector v is a nonzero vector that, when multiplied by A, comes out as a scalar multiple of itself: Av = λv. The scalar λ is the eigenvalue. Geometrically, most vectors change both length and direction when multiplied by a matrix — eigenvectors are the special directions that only get stretched or compressed, never rotated. Every square matrix has at least one eigenvalue (possibly complex), and finding them is what this module is actually about.
The Characteristic Equation
Rearranging Av = λv gives (A − λI)v = 0. For this to have a nonzero solution v, the matrix (A − λI) must be singular — meaning its determinant is zero: det(A − λI) = 0. This is the characteristic equation, and its roots are the eigenvalues of A. For a 2×2 matrix, this reduces neatly to λ² − (trace)λ + (determinant) = 0, where trace is the sum of the diagonal entries.
Worked Example 1 — A 2×2 Matrix
Find the eigenvalues and eigenvectors of A = [[4,1],[2,3]]. Trace = 4+3 = 7, determinant = (4×3)−(1×2) = 10. Characteristic equation: λ² − 7λ + 10 = 0, factoring to (λ−5)(λ−2) = 0, giving λ = 5 and λ = 2.
For λ = 5: substitute into (A − 5I)v = 0, giving [[−1,1],[2,−2]]v = 0. Both rows reduce to the same relation, −v₁+v₂ = 0, so v₁ = v₂. Eigenvector: (1,1).
For λ = 2: (A − 2I)v = 0 gives [[2,1],[2,1]]v = 0, so 2v₁+v₂ = 0, meaning v₂ = −2v₁. Eigenvector: (1,−2).
Verify: A×(1,1) should equal 5×(1,1). (4×1+1×1, 2×1+3×1) = (5,5) = 5(1,1). Correct. Check any 2×2 or 3×3 matrix instantly with the Eigenvalue & Eigenvector Calculator →
Worked Example 2 — Repeated Eigenvalues
Find the eigenvalues of A = [[2,1],[0,2]]. Trace = 4, determinant = 4. Characteristic equation: λ² − 4λ + 4 = 0, factoring to (λ−2)² = 0 — a repeated root, λ = 2 (multiplicity 2). Substituting into (A−2I)v = 0 gives [[0,1],[0,0]]v = 0, so v₂ = 0 and v₁ is free — only one independent eigenvector, (1,0), exists despite the eigenvalue having algebraic multiplicity 2. This gap between algebraic and geometric multiplicity is exactly the kind of subtlety VTU papers test directly, and it’s the most commonly misunderstood part of this topic.
The Cayley-Hamilton Theorem
Every square matrix satisfies its own characteristic equation. If the characteristic equation of A is λ² − 7λ + 10 = 0, then substituting A for λ gives A² − 7A + 10I = 0 (a genuine matrix equation, with I as the identity matrix). This theorem’s real exam value is that it lets you express higher powers of A, and even the inverse of A, purely in terms of A and I — without directly multiplying matrices repeatedly. From A² = 7A − 10I, you can substitute repeatedly to find A³, A⁴, and so on with far less arithmetic than direct multiplication.
Where Marks Are Actually Lost
Mistake 1 — Sign errors in (A − λI). Subtracting λ from the diagonal entries only, and forgetting the off-diagonal entries stay unchanged, is the single most common arithmetic slip in this topic.
Mistake 2 — Not checking the eigenvector by substituting back. A found eigenvector should always satisfy Av = λv exactly — verifying this catches sign and arithmetic errors before they cost the whole question.
Mistake 3 — Assuming every eigenvalue gives a full set of independent eigenvectors. As shown above, repeated eigenvalues sometimes yield fewer independent eigenvectors than their multiplicity suggests — a distinction VTU examiners deliberately test for.
Frequently Asked Questions
Q: Can eigenvalues be complex?
Yes — whenever the characteristic equation’s discriminant is negative, the eigenvalues come in complex conjugate pairs, and the matrix represents a rotation rather than a simple stretch.
Q: Do I need to memorise the Cayley-Hamilton theorem’s statement, or just apply it?
VTU exams typically ask you to verify the theorem for a specific matrix and then use it to find an inverse or higher power — knowing the statement and the substitution technique matters more than a formal proof.
Q: Is there a shortcut for 2×2 eigenvalues?
Yes — λ² − (trace)λ + (determinant) = 0 skips building the full characteristic matrix and goes straight to the quadratic, saving real time under exam pressure.
Eigenvalues close out the Linear Algebra module of Engineering Maths 1. Return to the full module-wise guide → or brush up on the matrix operations this topic builds on with the Matrix Determinant Calculator →
See how Daniel Classes teaches VTU Engineering Mathematics →