Unit 6, lesson 30

The Min-Max Principle

How the min-max and max-min principles describe every eigenvalue of a Hermitian matrix in increasing order, proved by a dimension count for intersecting subspaces and an attaining subspace.

  • Video 30
  • Rayleigh Quotients and Min-Max Bounds

For the Hermitian matrix A=diag⁡(1,4,9)A = \operatorname{diag}(1, 4, 9), the smallest and largest values of the Rayleigh quotient are the eigenvalues 11 and 99. The middle eigenvalue 44 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 kk gives the kkth eigenvalue in increasing order for every kk, 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 A∈Fn×nA \in \mathbb{F}^{n \times n} be Hermitian, A∗=AA^{*} = A, where F\mathbb{F} is R\mathbb{R} or C\mathbb{C}. For F=R\mathbb{F} = \mathbb{R} this means that AA is real symmetric. By the spectral theorem the eigenvalues of AA are real and Fn\mathbb{F}^n has an orthonormal basis of eigenvectors of AA. List the eigenvalues in increasing order, each repeated as often as its multiplicity,

λ1≤λ2≤⋯≤λn,\lambda_1 \le \lambda_2 \le \cdots \le \lambda_n,

and choose an orthonormal eigenbasis q1,…,qnq_1, \dots, q_n in the same order, so that Aqj=λjqjAq_j = \lambda_j q_j. Multiplicity here is algebraic multiplicity, which for a Hermitian matrix equals the dimension of the eigenspace. The list of numbers is determined by AA, but the eigenvectors are not. Each qjq_j can be multiplied by a scalar of absolute value 11, and a repeated eigenvalue allows any orthonormal basis of its eigenspace. For a nonzero vector x=c1q1+⋯+cnqnx = c_1 q_1 + \cdots + c_n q_n the Rayleigh quotient is a weighted average of the eigenvalues,

RA(x)=x∗Axx∗x=∑j=1nλj∣cj∣2∑j=1n∣cj∣2.R_A(x) = \frac{x^{*}Ax}{x^{*}x} = \frac{\sum_{j=1}^{n} \lambda_j \lvert c_j \rvert^2}{\sum_{j=1}^{n} \lvert c_j \rvert^2}.

Two consequences are used throughout. If x≠0x \ne 0 lies in span⁡(q1,…,qk)\operatorname{span}(q_1, \dots, q_k), then only eigenvalues at most λk\lambda_k receive positive weight, so RA(x)≤λkR_A(x) \le \lambda_k. If x≠0x \ne 0 lies in span⁡(qk,…,qn)\operatorname{span}(q_k, \dots, q_n), then RA(x)≥λkR_A(x) \ge \lambda_k for the same reason. In both cases the vector qkq_k gives equality. Here and below a tuple such as (1,1,1)(1, 1, 1) 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 kk eigenvectors cannot score above λk\lambda_k, and a vector built only from the last n−k+1n - k + 1 cannot score below it.

Example For A=diag⁡(5,2,2)A = \operatorname{diag}(5, 2, 2) the increasing list is λ1=λ2=2\lambda_1 = \lambda_2 = 2 and λ3=5\lambda_3 = 5. One orthonormal eigenbasis in this order is e2,e3,e1e_2, e_3, e_1, and another is

q1=12(0,1,1),q2=12(0,1,−1),q3=e1.\begin{gathered} q_1 = \tfrac{1}{\sqrt{2}}(0, 1, 1), \\[0.4em] q_2 = \tfrac{1}{\sqrt{2}}(0, 1, -1), \\[0.4em] q_3 = e_1. \end{gathered}

The numbers λk\lambda_k are the same for both choices. In the first basis the vector x=(1,1,1)x = (1, 1, 1) has coefficients 1,1,11, 1, 1, so each eigenvalue gets weight 1/31/3 and RA(x)=(2+2+5)/3=3R_A(x) = (2 + 2 + 5)/3 = 3. The direct computation x∗Ax/x∗x=(5+2+2)/3x^{*}Ax / x^{*}x = (5 + 2 + 2)/3 agrees.

Dimension count for intersecting subspaces

Definition Let UU and WW be subspaces of a vector space VV of finite dimension nn over F\mathbb{F}. Then

dim⁡(U∩W)≥dim⁡U+dim⁡W−n.\dim(U \cap W) \ge \dim U + \dim W - n.

In particular, if dim⁡U+dim⁡W>n\dim U + \dim W > n, then U∩WU \cap W contains a nonzero vector. This follows from the dimension formula for a sum. The sum U+WU + W is a subspace of VV, so its dimension is at most nn, and

dim⁡(U∩W)=dim⁡U+dim⁡W−dim⁡(U+W)≥dim⁡U+dim⁡W−n.\begin{aligned} &\dim(U \cap W) \\[0.4em] &\quad = \dim U + \dim W \\[0.4em] &\qquad - \dim(U + W) \\[0.4em] &\quad \ge \dim U + \dim W - n. \end{aligned}

Both principles below use this with dimensions kk and n−k+1n - k + 1, whose sum is n+1n + 1. All dimensions are taken over the same field F\mathbb{F}, so for F=C\mathbb{F} = \mathbb{C} 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 R3\mathbb{R}^3 let S=span⁡((1,1,0),(0,1,1))S = \operatorname{span}\big((1, 1, 0), (0, 1, 1)\big) and E=span⁡(e2,e3)E = \operatorname{span}(e_2, e_3). The count gives dim⁡(S∩E)≥2+2−3=1\dim(S \cap E) \ge 2 + 2 - 3 = 1. A vector of SS has the form

a(1,1,0)+b(0,1,1)=(a,a+b,b),a(1, 1, 0) + b(0, 1, 1) = (a, a + b, b),

and it lies in EE exactly when its first coordinate aa is 00. So S∩ES \cap E is the line spanned by (0,1,1)(0, 1, 1). When the dimensions add up to only nn the count promises nothing. The line span⁡(e3)\operatorname{span}(e_3) and the plane span⁡(e1,e2)\operatorname{span}(e_1, e_2) have dimensions adding up to 1+2=31 + 2 = 3 and meet only in 00.

Min-max principle

Definition Let A∈Fn×nA \in \mathbb{F}^{n \times n} be Hermitian, where F\mathbb{F} is R\mathbb{R} or C\mathbb{C}, with eigenvalues λ1≤⋯≤λn\lambda_1 \le \cdots \le \lambda_n in increasing order. For every k=1,…,nk = 1, \dots, n,

λk=min⁡S⊆Fndim⁡S=k max⁡x∈Sx≠0RA(x),\lambda_k = \min_{\substack{S \subseteq \mathbb{F}^n \\ \dim S = k}} \ \max_{\substack{x \in S \\ x \ne 0}} R_A(x),

where SS runs over all subspaces of Fn\mathbb{F}^n of dimension kk. The inner maximum exists for each SS. The quotient does not change when xx is multiplied by a nonzero scalar, so on SS it takes the same values as on the unit sphere of SS, which is compact because SS is finite-dimensional, and the quotient is continuous there. The outer minimum exists because the subspace S0S_0 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 TT on an nn-dimensional inner product space over F\mathbb{F}, with RT(v)=⟨v,Tv⟩/⟨v,v⟩R_T(v) = \langle v, Tv \rangle / \langle v, v \rangle.

For the proof, let S0=span⁡(q1,…,qk)S_0 = \operatorname{span}(q_1, \dots, q_k). Every nonzero vector of S0S_0 has quotient at most λk\lambda_k, and qk∈S0q_k \in S_0 has quotient exactly λk\lambda_k, so the maximum on S0S_0 is λk\lambda_k. Now let SS be any subspace of dimension kk, and let E=span⁡(qk,…,qn)E = \operatorname{span}(q_k, \dots, q_n), of dimension n−k+1n - k + 1. Since k+(n−k+1)=n+1>nk + (n - k + 1) = n + 1 > n, the dimension count gives a nonzero x∈S∩Ex \in S \cap E. Because x∈Ex \in E, its quotient is at least λk\lambda_k, so the maximum on SS is at least λk\lambda_k. Every kk-dimensional subspace has maximum at least λk\lambda_k and S0S_0 has maximum exactly λk\lambda_k, which proves the formula. For k=1k = 1 the subspaces are lines and the formula is the minimum of the quotient over all nonzero vectors, which is λ1\lambda_1. For k=nk = n the only subspace is Fn\mathbb{F}^n, and the formula gives the maximum λn\lambda_n. The Hermitian hypothesis supplies the real quotient, the real eigenvalues and the orthonormal eigenbasis that the proof uses.

In plain words Give each kk-dimensional subspace the largest quotient it contains. The span of the first kk eigenvectors keeps that largest value down to λk\lambda_k. No kk-dimensional subspace does better, because it is too large to miss the span of the eigenvectors from qkq_k on.

Example Take A=diag⁡(1,4,9)A = \operatorname{diag}(1, 4, 9) and k=2k = 2. On S0=span⁡(e1,e2)S_0 = \operatorname{span}(e_1, e_2) the quotient is (∣x1∣2+4∣x2∣2)/(∣x1∣2+∣x2∣2)≤4(\lvert x_1 \rvert^2 + 4\lvert x_2 \rvert^2)/(\lvert x_1 \rvert^2 + \lvert x_2 \rvert^2) \le 4, with equality at e2e_2, so the maximum on S0S_0 is 44. The tilted plane S=span⁡(e1,e2+e3)S = \operatorname{span}(e_1, e_2 + e_3) meets E=span⁡(e2,e3)E = \operatorname{span}(e_2, e_3) in the line through (0,1,1)(0, 1, 1), whose quotient is (4+9)/2=13/2(4 + 9)/2 = 13/2. So the maximum on SS is at least 13/213/2. In fact a nonzero vector ae1+b(e2+e3)a e_1 + b(e_2 + e_3) has quotient

∣a∣2+13∣b∣2∣a∣2+2∣b∣2≤132,\frac{\lvert a \rvert^2 + 13\lvert b \rvert^2}{\lvert a \rvert^2 + 2\lvert b \rvert^2} \le \frac{13}{2},

so the maximum on SS is exactly 13/213/2. No plane has a maximum below 44, and the minimum over all planes is λ2=4\lambda_2 = 4.

Max-min principle

Definition Let A∈Fn×nA \in \mathbb{F}^{n \times n} be Hermitian, where F\mathbb{F} is R\mathbb{R} or C\mathbb{C}, with eigenvalues λ1≤⋯≤λn\lambda_1 \le \cdots \le \lambda_n in increasing order. For every k=1,…,nk = 1, \dots, n,

λk=max⁡L⊆Fndim⁡L=n−k+1 min⁡x∈Lx≠0RA(x),\lambda_k = \max_{\substack{L \subseteq \mathbb{F}^n \\ \dim L = n - k + 1}} \ \min_{\substack{x \in L \\ x \ne 0}} R_A(x),

where LL runs over all subspaces of Fn\mathbb{F}^n of dimension n−k+1n - k + 1. The inner minimum exists for the same compactness reason as before. For the proof, let L0=span⁡(qk,…,qn)L_0 = \operatorname{span}(q_k, \dots, q_n). Every nonzero vector of L0L_0 has quotient at least λk\lambda_k and qkq_k gives equality, so the minimum on L0L_0 is λk\lambda_k. For any LL of dimension n−k+1n - k + 1, the subspace span⁡(q1,…,qk)\operatorname{span}(q_1, \dots, q_k) has dimension kk, the dimensions add up to n+1n + 1, and the two share a nonzero vector xx with RA(x)≤λkR_A(x) \le \lambda_k. So the minimum on LL is at most λk\lambda_k, and L0L_0 attains this value. The same formula also follows from the min-max principle applied to −A-A, whose eigenvalues in increasing order are −λn≤⋯≤−λ1-\lambda_n \le \cdots \le -\lambda_1.

The dimension n−k+1n - k + 1 belongs with increasing order. With the same order, the maximum over kk-dimensional subspaces of the minimum quotient is λn−k+1\lambda_{n - k + 1}, the kkth largest eigenvalue. Pairing dimension kk 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 n−k+1n - k + 1 eigenvectors reaches λk\lambda_k. Nothing reaches higher, because every subspace of that dimension shares a direction with the span of the first kk eigenvectors.

Example Take A=diag⁡(1,4,9)A = \operatorname{diag}(1, 4, 9) and k=2k = 2, so the subspaces have dimension 3−2+1=23 - 2 + 1 = 2. The plane L0=span⁡(e2,e3)L_0 = \operatorname{span}(e_2, e_3) has minimum quotient 44, reached at e2e_2. The plane L=span⁡(e1+e2,e3)L = \operatorname{span}(e_1 + e_2, e_3) meets span⁡(e1,e2)\operatorname{span}(e_1, e_2) in the line through (1,1,0)(1, 1, 0), whose quotient is (1+4)/2=5/2(1 + 4)/2 = 5/2, so the minimum on LL is at most 5/25/2. Watch the dimension at the ends. For k=1k = 1 the max-min uses the whole space F3\mathbb{F}^3, whose minimum quotient is 1=λ11 = \lambda_1. Maximizing over lines instead gives the largest quotient of any direction, which is 9=λ39 = \lambda_3.

Attaining subspace

Definition Let A∈Fn×nA \in \mathbb{F}^{n \times n} be Hermitian with eigenvalues λ1≤⋯≤λn\lambda_1 \le \cdots \le \lambda_n. In the min-max principle, a kk-dimensional subspace SS attains the bound when its maximum quotient equals λk\lambda_k. In the max-min principle, an (n−k+1)(n - k + 1)-dimensional subspace LL attains it when its minimum quotient equals λk\lambda_k. For every orthonormal eigenbasis in increasing order, the subspaces

S0=span⁡(q1,…,qk),L0=span⁡(qk,…,qn)\begin{gathered} S_0 = \operatorname{span}(q_1, \dots, q_k), \\[0.4em] L_0 = \operatorname{span}(q_k, \dots, q_n) \end{gathered}

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 λk\lambda_k, but they need not determine the subspace. Suppose first that the eigenvalues are distinct. For k=1k = 1 and k=nk = n the subspaces S0S_0 and L0L_0 are the only attaining subspaces, but for 1<k<n1 < k < n each principle has infinitely many, and they need not be spanned by eigenvectors. When λk\lambda_k is repeated, at least one of S0S_0 and L0L_0 contains only part of the eigenspace of λk\lambda_k, so it depends on the eigenbasis and can be chosen in many ways. Every nonzero vector of that eigenspace has quotient λk\lambda_k.

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 A=diag⁡(1,4,9)A = \operatorname{diag}(1, 4, 9) and k=2k = 2 in the min-max principle. The plane S=span⁡(e2,(2,0,1))S = \operatorname{span}\big(e_2, (2, 0, 1)\big) is not spanned by eigenvectors. Its nonzero vectors are x=(2t,s,t)x = (2t, s, t), and

RA(x)=13∣t∣2+4∣s∣25∣t∣2+∣s∣2≤4,R_A(x) = \frac{13\lvert t \rvert^2 + 4\lvert s \rvert^2}{5\lvert t \rvert^2 + \lvert s \rvert^2} \le 4,

because 13∣t∣2+4∣s∣2≤20∣t∣2+4∣s∣213\lvert t \rvert^2 + 4\lvert s \rvert^2 \le 20\lvert t \rvert^2 + 4\lvert s \rvert^2, with equality only when t=0t = 0. So the maximum on SS is 44, reached at e2e_2, and SS attains the bound just as S0=span⁡(e1,e2)S_0 = \operatorname{span}(e_1, e_2) does. The same computation shows that for a nonzero vector (a,0,c)(a, 0, c) the plane span⁡(e2,(a,0,c))\operatorname{span}\big(e_2, (a, 0, c)\big) attains exactly when 5∣c∣2≤3∣a∣25\lvert c \rvert^2 \le 3\lvert a \rvert^2. A repeated eigenvalue can allow this freedom even at the ends. For diag⁡(2,2,5)\operatorname{diag}(2, 2, 5) and k=1k = 1, every line inside span⁡(e1,e2)\operatorname{span}(e_1, e_2) attains the value λ1=2\lambda_1 = 2.

Check yourself

  1. Let A=diag⁡(7,−2,3,1)A = \operatorname{diag}(7, -2, 3, 1) over R\mathbb{R}. List its eigenvalues in increasing order with an orthonormal eigenbasis. For λ3\lambda_3, state the dimension of the subspaces in each principle and give an attaining subspace for each.
Show the answer

Sorting the diagonal gives λ1=−2\lambda_1 = -2, λ2=1\lambda_2 = 1, λ3=3\lambda_3 = 3 and λ4=7\lambda_4 = 7, with q1=e2q_1 = e_2, q2=e4q_2 = e_4, q3=e3q_3 = e_3 and q4=e1q_4 = e_1. Here n=4n = 4 and k=3k = 3.

The min-max principle uses subspaces of dimension 33. The subspace S0=span⁡(e2,e4,e3)S_0 = \operatorname{span}(e_2, e_4, e_3), the vectors with first coordinate 00, has maximum quotient 33, reached at e3e_3, so it attains. Every three-dimensional SS meets span⁡(e3,e1)\operatorname{span}(e_3, e_1), since 3+2=5>43 + 2 = 5 > 4, so its maximum is at least 33.

The max-min principle uses dimension n−k+1=2n - k + 1 = 2. The plane L0=span⁡(e3,e1)L_0 = \operatorname{span}(e_3, e_1) has minimum quotient 33, reached at e3e_3, so it attains. Every plane meets span⁡(e2,e4,e3)\operatorname{span}(e_2, e_4, e_3), since 2+3=5>42 + 3 = 5 > 4, so its minimum is at most 33. Both principles give λ3=3\lambda_3 = 3. Reading the eigenvalues in their diagonal order instead of sorting them would put e1e_1, with eigenvalue 77, into the min-max candidate and give the wrong spans.

  1. For A=diag⁡(1,4,9)A = \operatorname{diag}(1, 4, 9), let PP be the plane x1+x2+x3=0x_1 + x_2 + x_3 = 0 in R3\mathbb{R}^3. Use the dimension count to find a nonzero vector of PP with quotient at least 44 and one with quotient at most 44. Does PP attain the bound for k=2k = 2 in either principle?
Show the answer

The plane PP and span⁡(e2,e3)\operatorname{span}(e_2, e_3) have dimensions adding up to 4>34 > 3. A shared vector has x1=0x_1 = 0 and x2+x3=0x_2 + x_3 = 0, for example (0,1,−1)(0, 1, -1), with quotient (4+9)/2=13/2≥4(4 + 9)/2 = 13/2 \ge 4. Likewise PP meets span⁡(e1,e2)\operatorname{span}(e_1, e_2), where x3=0x_3 = 0 and x1+x2=0x_1 + x_2 = 0, for example at (1,−1,0)(1, -1, 0), with quotient (1+4)/2=5/2≤4(1 + 4)/2 = 5/2 \le 4.

So the maximum on PP is at least 13/2>413/2 > 4, and PP does not attain the min-max bound. The minimum on PP is at most 5/2<45/2 < 4, so PP 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 span⁡(e2,e3)\operatorname{span}(e_2, e_3). That vector has quotient at least 44 because of where it lies, and at most 44 because the plane attains, so its quotient is exactly 44. A plane that attains the max-min bound likewise shares a vector of quotient exactly 44 with span⁡(e1,e2)\operatorname{span}(e_1, e_2). On either coordinate plane the quotient equals 44 only along e2e_2, so every attaining plane contains e2e_2. The vector e2e_2 has coordinate sum 11, so it is not in PP.

  1. Let NN be the real matrix with rows (1,4)(1, 4) and (0,1)(0, 1), whose only eigenvalue is 11, repeated. Find the smallest value of xTNx/xTxx^{\mathsf{T}}Nx / x^{\mathsf{T}}x over nonzero x∈R2x \in \mathbb{R}^2 and compare it with the min-max formula for k=1k = 1. Which hypothesis fails?
Show the answer

The numerator is x12+4x1x2+x22x_1^2 + 4x_1x_2 + x_2^2. For a unit vector (cos⁡θ,sin⁡θ)(\cos\theta, \sin\theta) the quotient is

1+4cos⁡θsin⁡θ=1+2sin⁡2θ,1 + 4\cos\theta\sin\theta = 1 + 2\sin 2\theta,

which ranges over [−1,3][-1, 3]. The smallest value −1-1 is reached at (1,−1)/2(1, -1)/\sqrt{2} and the largest value 33 at (1,1)/2(1, 1)/\sqrt{2}. The minimum over lines is −1-1, not the eigenvalue 11, so the formula fails. The matrix NN is not symmetric, so it is not Hermitian. A real quadratic form only sees the symmetric part

12(N+NT)=[1221],\tfrac{1}{2}(N + N^{\mathsf{T}}) = \begin{bmatrix} 1 & 2 \\ 2 & 1 \end{bmatrix},

whose eigenvalues −1-1 and 33 are exactly these extremes. Over C\mathbb{C} the quotient x∗Nx/x∗xx^{*}Nx / x^{*}x need not even be real. The vector x=(1,i)x = (1, i) gives (2+4i)/2=1+2i(2 + 4i)/2 = 1 + 2i.

How this lesson connects