For the Hermitian matrix , the smallest and largest values of the Rayleigh quotient are the eigenvalues and . The middle eigenvalue is neither the minimum nor the maximum of the quotient over all nonzero vectors, so optimizing over all directions at once cannot single it out. It is the answer to a two-level problem instead. Give each plane through the origin the largest quotient it contains, then choose the plane whose largest quotient is as small as possible. This lesson proves that the same problem over subspaces of dimension gives the th eigenvalue in increasing order for every , and that a matching max-min problem does too. Both proofs use a dimension count, the weighted average form of the quotient and a subspace that attains the bound.
Key terms
Eigenvalues in increasing order
Definition Let be Hermitian, , where is or . For this means that is real symmetric. By the spectral theorem the eigenvalues of are real and has an orthonormal basis of eigenvectors of . List the eigenvalues in increasing order, each repeated as often as its multiplicity,
and choose an orthonormal eigenbasis in the same order, so that . Multiplicity here is algebraic multiplicity, which for a Hermitian matrix equals the dimension of the eigenspace. The list of numbers is determined by , but the eigenvectors are not. Each can be multiplied by a scalar of absolute value , and a repeated eigenvalue allows any orthonormal basis of its eigenspace. For a nonzero vector the Rayleigh quotient is a weighted average of the eigenvalues,
Two consequences are used throughout. If lies in , then only eigenvalues at most receive positive weight, so . If lies in , then for the same reason. In both cases the vector gives equality. Here and below a tuple such as stands for a column vector.
In plain words Sort the eigenvalues from smallest to largest, counting repeats. The quotient of a vector averages the eigenvalues, weighted by how much of the vector lies along each eigenvector. A vector built only from the first eigenvectors cannot score above , and a vector built only from the last cannot score below it.
Example For the increasing list is and . One orthonormal eigenbasis in this order is , and another is
The numbers are the same for both choices. In the first basis the vector has coefficients , so each eigenvalue gets weight and . The direct computation agrees.
Dimension count for intersecting subspaces
Definition Let and be subspaces of a vector space of finite dimension over . Then
In particular, if , then contains a nonzero vector. This follows from the dimension formula for a sum. The sum is a subspace of , so its dimension is at most , and
Both principles below use this with dimensions and , whose sum is . All dimensions are taken over the same field , so for they are complex dimensions. The count only says that a shared nonzero vector exists. Which vector it is depends on both subspaces, and the argument uses no angles or orthogonality.
In plain words Two subspaces whose dimensions add up to more than the dimension of the whole space have no room to stay apart, so they must share a direction.
Example In let and . The count gives . A vector of has the form
and it lies in exactly when its first coordinate is . So is the line spanned by . When the dimensions add up to only the count promises nothing. The line and the plane have dimensions adding up to and meet only in .
Min-max principle
Definition Let be Hermitian, where is or , with eigenvalues in increasing order. For every ,
where runs over all subspaces of of dimension . The inner maximum exists for each . The quotient does not change when is multiplied by a nonzero scalar, so on it takes the same values as on the unit sphere of , which is compact because is finite-dimensional, and the quotient is continuous there. The outer minimum exists because the subspace in the proof attains it. The result is also called the Courant-Fischer theorem. It holds in the same form for a self-adjoint operator on an -dimensional inner product space over , with .
For the proof, let . Every nonzero vector of has quotient at most , and has quotient exactly , so the maximum on is . Now let be any subspace of dimension , and let , of dimension . Since , the dimension count gives a nonzero . Because , its quotient is at least , so the maximum on is at least . Every -dimensional subspace has maximum at least and has maximum exactly , which proves the formula. For the subspaces are lines and the formula is the minimum of the quotient over all nonzero vectors, which is . For the only subspace is , and the formula gives the maximum . The Hermitian hypothesis supplies the real quotient, the real eigenvalues and the orthonormal eigenbasis that the proof uses.
In plain words Give each -dimensional subspace the largest quotient it contains. The span of the first eigenvectors keeps that largest value down to . No -dimensional subspace does better, because it is too large to miss the span of the eigenvectors from on.
Example Take and . On the quotient is , with equality at , so the maximum on is . The tilted plane meets in the line through , whose quotient is . So the maximum on is at least . In fact a nonzero vector has quotient
so the maximum on is exactly . No plane has a maximum below , and the minimum over all planes is .
Max-min principle
Definition Let be Hermitian, where is or , with eigenvalues in increasing order. For every ,
where runs over all subspaces of of dimension . The inner minimum exists for the same compactness reason as before. For the proof, let . Every nonzero vector of has quotient at least and gives equality, so the minimum on is . For any of dimension , the subspace has dimension , the dimensions add up to , and the two share a nonzero vector with . So the minimum on is at most , and attains this value. The same formula also follows from the min-max principle applied to , whose eigenvalues in increasing order are .
The dimension belongs with increasing order. With the same order, the maximum over -dimensional subspaces of the minimum quotient is , the th largest eigenvalue. Pairing dimension with the max-min is the convention for eigenvalues listed in decreasing order.
In plain words Now each subspace is judged by the smallest quotient it contains, and the goal is to make that smallest value as large as possible. The span of the last eigenvectors reaches . Nothing reaches higher, because every subspace of that dimension shares a direction with the span of the first eigenvectors.
Example Take and , so the subspaces have dimension . The plane has minimum quotient , reached at . The plane meets in the line through , whose quotient is , so the minimum on is at most . Watch the dimension at the ends. For the max-min uses the whole space , whose minimum quotient is . Maximizing over lines instead gives the largest quotient of any direction, which is .
Attaining subspace
Definition Let be Hermitian with eigenvalues . In the min-max principle, a -dimensional subspace attains the bound when its maximum quotient equals . In the max-min principle, an -dimensional subspace attains it when its minimum quotient equals . For every orthonormal eigenbasis in increasing order, the subspaces
attain. Because these subspaces exist, the outer optimizations are a true minimum and a true maximum, and no compactness argument over the family of all subspaces is needed. The principles determine the number , but they need not determine the subspace. Suppose first that the eigenvalues are distinct. For and the subspaces and are the only attaining subspaces, but for each principle has infinitely many, and they need not be spanned by eigenvectors. When is repeated, at least one of and contains only part of the eigenspace of , so it depends on the eigenbasis and can be chosen in many ways. Every nonzero vector of that eigenspace has quotient .
In plain words An extreme value needs two arguments, a bound that every candidate obeys and one candidate that meets it. The attaining subspace is that candidate. It shows the bound is sharp, but other subspaces may meet it too.
Example Take and in the min-max principle. The plane is not spanned by eigenvectors. Its nonzero vectors are , and
because , with equality only when . So the maximum on is , reached at , and attains the bound just as does. The same computation shows that for a nonzero vector the plane attains exactly when . A repeated eigenvalue can allow this freedom even at the ends. For and , every line inside attains the value .
Check yourself
- Let over . List its eigenvalues in increasing order with an orthonormal eigenbasis. For , state the dimension of the subspaces in each principle and give an attaining subspace for each.
Show the answer
Sorting the diagonal gives , , and , with , , and . Here and .
The min-max principle uses subspaces of dimension . The subspace , the vectors with first coordinate , has maximum quotient , reached at , so it attains. Every three-dimensional meets , since , so its maximum is at least .
The max-min principle uses dimension . The plane has minimum quotient , reached at , so it attains. Every plane meets , since , so its minimum is at most . Both principles give . Reading the eigenvalues in their diagonal order instead of sorting them would put , with eigenvalue , into the min-max candidate and give the wrong spans.
- For , let be the plane in . Use the dimension count to find a nonzero vector of with quotient at least and one with quotient at most . Does attain the bound for in either principle?
Show the answer
The plane and have dimensions adding up to . A shared vector has and , for example , with quotient . Likewise meets , where and , for example at , with quotient .
So the maximum on is at least , and does not attain the min-max bound. The minimum on is at most , so does not attain the max-min bound either. Both failures have one cause. A plane that attains the min-max bound shares a nonzero vector with . That vector has quotient at least because of where it lies, and at most because the plane attains, so its quotient is exactly . A plane that attains the max-min bound likewise shares a vector of quotient exactly with . On either coordinate plane the quotient equals only along , so every attaining plane contains . The vector has coordinate sum , so it is not in .
- Let be the real matrix with rows and , whose only eigenvalue is , repeated. Find the smallest value of over nonzero and compare it with the min-max formula for . Which hypothesis fails?
Show the answer
The numerator is . For a unit vector the quotient is
which ranges over . The smallest value is reached at and the largest value at . The minimum over lines is , not the eigenvalue , so the formula fails. The matrix is not symmetric, so it is not Hermitian. A real quadratic form only sees the symmetric part
whose eigenvalues and are exactly these extremes. Over the quotient need not even be real. The vector gives .