How the Rayleigh quotient of a Hermitian matrix ignores scaling, equals a weighted average of eigenvalues, and has the smallest and largest eigenvalues as its minimum and maximum, attained on whole eigenspaces.
Let x run around the unit circle and record xTAx for the symmetric matrix A with rows (2,1) and (1,2). Writing x=(cosθ,sinθ) gives the reading 2+sin2θ, which swings between 1 and 3, exactly the eigenvalues of A, and reaches them along the eigenvectors (1,−1) and (1,1). This lesson explains why that happens for every Hermitian matrix. The tool is the Rayleigh quotient, which turns out to be a weighted average of eigenvalues, and the same argument shows which vectors attain the extremes, what changes when an eigenvalue repeats, and why the matrix must be Hermitian.
Key terms
Rayleigh quotient
Definition Let F be R or C, and let A∈Fn×n be Hermitian (real symmetric when F=R). The Rayleigh quotient of A is the function defined for nonzero x∈Fn by
RA(x)=x∗xx∗Ax=⟨x,x⟩⟨x,Ax⟩.
The denominator is ∥x∥2>0, and the numerator is real because A is Hermitian, so RA(x) is a real number. If Ax=λx with x=0, then RA(x)=λx∗x/x∗x=λ, so every eigenvalue of A is a value of the quotient.
In plain words The quotient measures the quadratic form per unit of squared length. At an eigenvector it reads off the eigenvalue.
Example For the matrix A with rows (2,1) and (1,2) and the vector x=(1,2),
RA(x)=1+42+2+2+8=514.
At the eigenvectors (1,1) and (1,−1) the quotient is 6/2=3 and 2/2=1.
Scale invariance of the quotient
Definition For every nonzero x∈Fn and every nonzero scalar c∈F,
RA(cx)=ccx∗xccx∗Ax=RA(x).
So the quotient is constant along each line through the origin, with the origin itself removed. In particular RA(x)=RA(x/∥x∥), and RA(u)=u∗Au when ∥u∥=1, so the values of the quotient are exactly the values of u∗Au on the unit sphere. Over C the scalar c may be complex, so all the phase multiples eiθx give the same value.
In plain words Only the direction of x matters, not its length, and over C not its phase either. That is why one may restrict attention to unit vectors without losing any value.
Example With A and x=(1,2) as above, the numerator is 14 at x and 126 at −3x=(−3,−6), but the quotients agree, since
RA(−3x)=45126=514.
Over C the vector (2−i)x gives the same value, with the common factor ∣2−i∣2=5 in numerator and denominator.
Weighted average of eigenvalues
Definition Let A∈Fn×n be Hermitian, and let q1,…,qn be an orthonormal basis of Fn with Aqj=λjqj and every λj real, as the spectral theorem provides. Write a nonzero x as x=c1q1+⋯+cnqn with cj=qj∗x. Then Ax=∑jλjcjqj, orthonormality removes every mixed term, and
x∗Ax=j=1∑nλj∣cj∣2,x∗x=j=1∑n∣cj∣2.
Hence
RA(x)=j=1∑nwjλj,wj=∥x∥2∣cj∣2.
The weights are nonnegative and add up to 1, so the quotient is a weighted average of the eigenvalues. The eigenvalues are the same for every input, and only the weights depend on x. For a unit vector the weights are simply ∣cj∣2. The argument works over C because each ∣cj∣2 is a nonnegative real number.
In plain words Split x into its eigenvector components. Each component contributes its eigenvalue, weighted by the share of the squared length that it carries.
Example For the matrix A with rows (2,1) and (1,2), take q1=(1,−1)/2 with λ1=1 and q2=(1,1)/2 with λ2=3. For x=(1,2) the coefficients are c1=−1/2 and c2=3/2, so ∣c1∣2=1/2 and ∣c2∣2=9/2, which add up to ∥x∥2=5. The weights are 1/10 and 9/10, and
RA(x)=101⋅1+109⋅3=514,
as computed directly before.
Minimum and maximum of the Rayleigh quotient
Definition Let A∈Fn×n be Hermitian with eigenvalues ordered as λ1≤λ2≤⋯≤λn, repeated according to multiplicity. Then
λ1≤RA(x)≤λn
for every nonzero x∈Fn, and both bounds are attained, so
x=0minRA(x)=λ1,x=0maxRA(x)=λn.
With the weights wj from the eigenvector expansion, the lower bound follows from RA(x)−λ1=∑jwj(λj−λ1), a sum of nonnegative terms, and the upper bound from λn−RA(x)=∑jwj(λn−λj) in the same way. A unit eigenvector for λ1 gives the value λ1, and one for λn gives λn, so the bounds are sharp. The Hermitian hypothesis is needed. The real form xTBx of a real matrix B only detects its symmetric part, so the eigenvalues of a nonsymmetric B need not bound it. A complex matrix that is not Hermitian can give nonreal values, as iI does, with quotient i at every nonzero vector, and then a minimum does not even make sense.
In plain words A weighted average can never fall below its smallest ingredient or rise above its largest, and it reaches either one by putting all the weight there. So the extreme readings of the quotient are the extreme eigenvalues.
Example For A=diag(1,4) and the real unit vector x=(cosθ,sinθ),
RA(x)=cos2θ+4sin2θ=1+3sin2θ,
which runs from 1 at θ=0 to 4 at θ=π/2. The level set x12+4x22=1 is a different picture. It is an ellipse, and its point in the unit direction u lies at distance 1/RA(u) from the origin, so its radii run from 1/2 to 1. Without symmetry the conclusion can fail. The matrix B with rows (1,4) and (0,1) has both eigenvalues equal to 1, but on real unit vectors xTBx=1+4x1x2 ranges from −1 to 3. Those are the eigenvalues of its symmetric part, the matrix with rows (1,2) and (2,1).
Extremizers in a repeated eigenspace
Definition Let A∈Fn×n be Hermitian with eigenvalues λ1≤⋯≤λn. For nonzero x,
RA(x)=λ1⟺Ax=λ1x,
and likewise RA(x)=λn exactly when Ax=λnx. In the sum RA(x)−λ1=∑jwj(λj−λ1), equality with 0 forces wj=0, that is cj=0, for every j with λj>λ1, so x lies in the eigenspace Eλ1=ker(A−λ1I). Conversely every nonzero vector of that eigenspace gives λ1. The unit minimizers are therefore exactly the unit vectors of Eλ1, whose dimension is the multiplicity m of λ1. When m=1 they are ±q1 over R, or eiθq1 over C. When m≥2 they fill the whole unit sphere of an m-dimensional subspace, no single eigenvector is preferred, and any orthonormal basis of the eigenspace can serve in the expansion. The same holds for the maximizers and Eλn.
In plain words The extreme values are reached on whole eigenspaces, not just at one chosen eigenvector. When the smallest eigenvalue repeats there is a whole circle or sphere of minimizing directions, and there is no such thing as the minimizing eigenvector. The same goes for the largest.
Example The matrix
A=311131113
satisfies x∗Ax=2∥x∥2+∣x1+x2+x3∣2, so
RA(x)=2+∥x∥2∣x1+x2+x3∣2.
Its eigenvalues are 2, 2 and 5. The minimum 2 is attained exactly when x1+x2+x3=0. That plane is the eigenspace for 2, and every unit vector in it is a minimizer, including the orthogonal pair (1,−1,0)/2 and (1,1,−2)/6 and every unit combination of them. The maximum 5 needs ∣x1+x2+x3∣2=3∥x∥2, the equality case of the Cauchy-Schwarz inequality, so x is a multiple of (1,1,1). Over R the unit maximizers are only ±(1,1,1)/3.
Check yourself
The symmetric matrix A with rows (5,2) and (2,2) has eigenvectors (1,−2) for the eigenvalue 1 and (2,1) for the eigenvalue 6. Compute RA(e1) directly and as a weighted average of the eigenvalues, and give the range of RA.
Show the answer
Directly, RA(e1)=e1TAe1/1=5. The unit eigenvectors are q1=(1,−2)/5 and q2=(2,1)/5, so c1=q1Te1=1/5 and c2=2/5. The weights are 1/5 and 4/5, and
RA(e1)=51⋅1+54⋅6=5.
Every value of RA lies in [1,6], the minimum 1 is attained exactly at the nonzero multiples of (1,−2), and the maximum 6 exactly at the nonzero multiples of (2,1). For 0≤t≤1 the unit vector 1−tq1+tq2 has weights 1−t and t and quotient 1+5t, so every value in between occurs as well, and the range is exactly [1,6].
The real matrix B with rows (2,3) and (0,2) has the double eigenvalue 2. Someone concludes that xTBx/xTx=2 for every nonzero real x. Test this at (1,1) and (1,−1), find the true range, and explain what went wrong.
Show the answer
The numerator is xTBx=2x12+3x1x2+2x22. At (1,1) the quotient is 7/2, and at (1,−1) it is 1/2, so it is not constant. The matrix B is not symmetric, so the theorem does not apply. The form only detects the symmetric part
H=2B+BT=[23/23/22],
whose eigenvalues are 1/2 and 7/2. On nonzero real vectors the quotient of B equals RH, so its range is [1/2,7/2], while the eigenvalues of B itself do not determine it.
For the real symmetric matrix below, find the minimum and maximum of RA and all real unit vectors that attain each. Is the minimizer unique up to sign?
A=200031013Show the answer
Subtracting 2∥x∥2 from the form leaves x22+2x2x3+x32, so
RA(x)=2+∥x∥2(x2+x3)2.
The minimum is 2, attained exactly when x2+x3=0. The minimizing unit vectors are all unit vectors in the plane spanned by e1 and (0,1,−1), such as e1, (0,1,−1)/2 and (1,1,−1)/3. That plane is the eigenspace of the double eigenvalue 2, so the minimizers form a whole circle and are not unique up to sign.
For the maximum, (x2+x3)2≤2(x22+x32)≤2∥x∥2, with equality exactly when x2=x3 and x1=0. So the maximum is 4, attained only at ±(0,1,1)/2, and indeed A(0,1,1)=4(0,1,1). The eigenvalues are 2, 2 and 4.
May we count page visits to understand which courses and learning features are useful? Cloudflare collects visit and performance statistics, without your account details or answers. Your choice does not affect access. Details