A real matrix can have complex eigenvalues — this happens when the characteristic polynomial has no real roots. Geometrically, no real direction is mapped to a scalar multiple of itself; the transformation involves rotation. Complex eigenvalues of real matrices always come in conjugate pairs, and each pair corresponds to a rotation-scaling action on a two-dimensional subspace.
When Complex Eigenvalues Appear
A real matrix with real entries can have complex eigenvalues. This occurs when the characteristic polynomial — a polynomial with real coefficients — has roots that are not real.
For a 2×2 matrix, complex eigenvalues appear when the discriminant tr(A)2−4det(A)<0. The quadratic formula produces λ=2tr(A)±negative, which involves −1=i.
The geometric interpretation is clear: no real direction in R2 is mapped to a scalar multiple of itself. Every vector is rotated, not just stretched or compressed. The simplest example is rotation by 90°, with matrix (01−10) and characteristic polynomial λ2+1=0. The eigenvalues are ±i — purely imaginary, reflecting pure rotation with no scaling.
Conjugate Pairs
For a real matrix, complex eigenvalues always come in conjugate pairs. If λ=a+bi is an eigenvalue (with b=0), then λˉ=a−bi is also an eigenvalue.
The proof uses the fact that the characteristic polynomial has real coefficients. If p(λ)=0 and every coefficient of p is real, then p(λˉ)=p(λ)=0=0. Complex conjugation passes through the polynomial because the coefficients are their own conjugates.
The corresponding eigenvectors are also conjugates: if v is an eigenvector for λ=a+bi, then vˉ is an eigenvector for λˉ=a−bi.
One consequence for odd-dimensional real matrices: at least one eigenvalue must be real. Complex roots pair up, consuming an even number of the n roots. When n is odd, at least one root is left unpaired, and an unpaired root of a real polynomial must be real.
The 2×2 Case in Detail
A 2×2 real matrix with complex eigenvalues λ=a±bi (where b=0) acts as a rotation composed with a scaling. The eigenvalues have modulus r=a2+b2 and argument θ=arctan(b/a).
When r=1 (equivalently, det(A)=a2+b2=1), the transformation is a pure rotation by angle θ. When r>1, it is a rotation with outward spiraling. When r<1, it is a rotation with inward spiraling.
Worked Example
For A=(31−21): tr(A)=4, det(A)=5, discriminant =16−20=−4. The eigenvalues are
λ=24±−4=2±i
The modulus is r=4+1=5 and the argument is θ=arctan(1/2). The transformation rotates by arctan(1/2)≈26.6° while scaling distances by 5≈2.24. Since r>1, repeated application spirals outward.
Complex Eigenvectors
The eigenvectors corresponding to complex eigenvalues have complex entries. To find them, solve (A−λI)v=0 using complex arithmetic.
Continuing the example with A=(31−21) and λ=2+i:
A−(2+i)I=(1−i1−2−1−i)
The second row gives v1+(−1−i)v2=0, so v1=(1+i)v2. Setting v2=1: v=(1+i,1)T.
This eigenvector splits into real and imaginary parts: v=u(1,1)T+iw(1,0)T. The real vectors u and w encode the rotation — they span the two-dimensional subspace on which the rotation-scaling acts. The conjugate eigenvector for λˉ=2−i is vˉ=(1−i,1)T.
Real Canonical Form
A 2×2 real matrix with eigenvalues a±bi is similar (over R) to the matrix
(ab−ba)=r(cosθsinθ−sinθcosθ)
where r=a2+b2 and θ=arctan(b/a). This is a rotation by θ scaled by r.
The similarity is achieved by the real matrix P=[uw], where v=u+iw is the complex eigenvector. Then P−1AP=(ab−ba).
This is the real alternative to diagonalization: instead of a diagonal matrix with complex entries (which is valid over C but not over R), we get a real 2×2 rotation-scaling block. The transformation is expressed in its simplest real form.
Complex Eigenvalues in Larger Matrices
For an n×n real matrix, complex eigenvalues still come in conjugate pairs. Each pair contributes a 2×2 rotation-scaling block to the real canonical form. Real eigenvalues contribute 1×1 blocks (just the eigenvalue itself).
A 4×4 matrix with eigenvalues 2±3i and −1±i has real canonical form
2300−320000−1100−1−1
A 3×3 matrix with eigenvalues 5 and 1±2i has real canonical form
5000120−21
The real canonical form is the real analogue of diagonalization: it achieves the simplest possible real matrix that is similar to A, with the block structure directly reflecting the eigenvalue spectrum.
Dynamical Systems Interpretation
Complex eigenvalues produce oscillatory behavior in dynamical systems.
In the discrete system xn+1=Axn, an eigenvalue λ=a+bi with modulus r=∣λ∣=a2+b2 generates a spiraling trajectory. When r>1, the spiral grows outward — the system is unstable. When r<1, the spiral decays inward — the system converges to the origin. When r=1, the trajectory traces a closed curve — perpetual oscillation without growth or decay.
In the continuous system x′=Ax, an eigenvalue λ=a+bi contributes a term eat(cosbt,sinbt) to the solution. The real part a determines exponential growth (a>0) or decay (a<0). The imaginary part b determines the oscillation frequency. When a=0, the oscillation is sustained. When a<0, it is damped. When a>0, it grows without bound.
Stability of a linear system reduces to eigenvalue analysis: the system is stable if and only if every eigenvalue has negative real part (continuous) or modulus less than 1 (discrete).
The Fundamental Theorem of Algebra Connection
Over C, every polynomial of degree n factors completely into n linear factors. This means every n×n matrix — real or complex — has exactly n eigenvalues counted with algebraic multiplicity when the characteristic polynomial is factored over C.
Over R, some factors may be irreducible quadratics rather than linear, corresponding to conjugate pairs of complex eigenvalues. The characteristic polynomial of a real matrix factors into linear terms (real eigenvalues) and irreducible quadratic terms (complex conjugate pairs).
Working over C simplifies the theory considerably. Every matrix is triangularizable over C (Schur decomposition): A=UTU∗ where U is unitary and T is upper triangular with eigenvalues on the diagonal. Diagonalizability depends only on whether the geometric multiplicities match the algebraic multiplicities, with no additional complications from irreducible quadratics.
The choice between working over R and C is a recurring theme. Real matrices are the natural objects of computation, but complex eigenvalues are the natural objects of spectral theory. Both perspectives are needed.