Min-max theorem

Not to be confused with Minimax theorem.

"Variational theorem" redirects here. Not to be confused with variational principle.

In linear algebra and functional analysis, the min-max theorem, or variational theorem, or Courant–Fischer–Weyl min-max principle, is a result that gives a variational characterization of eigenvalues of compact Hermitian operators on Hilbert spaces. It can be viewed as the starting point of many results of similar nature. This article first discusses the finite-dimensional case and its applications before considering compact operators on infinite-dimensional Hilbert spaces. We will see that for compact operators, the proof of the main theorem uses essentially the same idea from the finite-dimensional argument. In the case that the operator is non-Hermitian, the theorem provides an equivalent characterization of the associated singular values. The min-max theorem can be extended to self-adjoint operators that are bounded below.

Matrices

Let A be a n × n Hermitian matrix. As with many other variational results on eigenvalues, one considers the Rayleigh–Ritz quotient R_A : Cⁿ \ {0} → R defined by

$R_A(x)=\frac{(Ax,x)}{(x,x)}$

where (⋅, ⋅) denotes the Euclidean inner product on Cⁿ. Clearly, the Rayleigh quotient of an eigenvector is its associated eigenvalue. Equivalently, the Rayleigh–Ritz quotient can be replaced by

$f(x)=(Ax,x),\Vert x\Vert =1.$

For Hermitian matrices A, the range of the continuous function R_A(x), or f(x), is a compact interval [a, b] of the real line. The maximum b and the minimum a are the largest and smallest eigenvalue of A, respectively. The min-max theorem is a refinement of this fact.

Min-max theorem

Let $A$ be Hermitian on an inner product space $V$ with dimension $n$, with spectrum ordered in descending order ${\lambda }_1\ge ...\ge {\lambda }_n$. Let $v_1,...,v_n$ be the corresponding unit-length orthogonal eigenvectors. Reverse the spectrum ordering, so that ${\xi }_1={\lambda }_n,...,{\xi }_n={\lambda }_1$.

(Poincaré’s inequality) — Let $M$ be a subspace of $V$ with dimension $k$, then there exists unit vectors $x,y\in M$, such that $⟨x,Ax⟩\le {\lambda }_k$, and $⟨y,Ay⟩\ge {\xi }_k$.

Proof

Part 2 is a corollary, using $-A$. $M$ is a $k$ dimensional subspace, so if we pick any list of $n-k+1$ vectors, their span $N:=span(v_k,...v_n)$ must intersect $M$ on at least a single line. Take unit $x\in M\cap N$. That’s what we need.

$x={\sum }_{i=k}^n{a}_i{v}_i$, since $x\in N$.

Since ${\sum }_{i=k}^n|a_i{|}^2=1$, we find $⟨x,Ax⟩={\sum }_{i=k}^n|a_i{|}^2{\lambda }_i\le {\lambda }_k$.

min-max theorem — $$\begin{array}{rl}{\lambda }_k& =\underset{\begin{array}{c}{ℳ}\subset V\\ \dim ({ℳ})=k\end{array}}{\max }\underset{\begin{array}{c}x\in {ℳ}\\ \Vert x\Vert =1\end{array}}{\min }⟨x,Ax⟩\\ & =\underset{\begin{array}{c}{ℳ}\subset V\\ \dim ({ℳ})=n-k+1\end{array}}{\min }\underset{\begin{array}{c}x\in {ℳ}\\ \Vert x\Vert =1\end{array}}{\max }⟨x,Ax⟩\text{. }\end{array}$$

Proof

Part 2 is a corollary of part 1, by using $-A$. By Poincare’s inequality, ${\lambda }_k$ is an upper bound to the right side. By setting ${ℳ}=span(v_1,...v_k)$, the upper bound is achieved.

Counterexample in the non-Hermitian case

Let N be the nilpotent matrix

$\left[\begin{array}{cc}0& 1\\ 0& 0\end{array}\right].$

Define the Rayleigh quotient $R_N(x)$ exactly as above in the Hermitian case. Then it is easy to see that the only eigenvalue of N is zero, while the maximum value of the Rayleigh quotient is ⁠1/2⁠. That is, the maximum value of the Rayleigh quotient is larger than the maximum eigenvalue.

Applications

Min-max principle for singular values

The singular values {σ_k} of a square matrix M are the square roots of the eigenvalues of M*M (equivalently MM*). An immediate consequence of the first equality in the min-max theorem is:

${\sigma }_k^{\downarrow }=\underset{S:\dim (S)=k}{\max }\underset{x\in S,\Vert x\Vert =1}{\min }(M^{*}Mx,x{)}^{\frac{1}{2}}=\underset{S:\dim (S)=k}{\max }\underset{x\in S,\Vert x\Vert =1}{\min }\Vert Mx\Vert .$

Similarly,

${\sigma }_k^{\downarrow }=\underset{S:\dim (S)=n-k+1}{\min }\underset{x\in S,\Vert x\Vert =1}{\max }\Vert Mx\Vert .$

Here ${\sigma }_k^{\downarrow }$ denotes the k^th entry in the decreasing sequence of the singular values, so that ${\sigma }_1^{\downarrow }\ge {\sigma }_2^{\downarrow }\ge \cdots$.

Cauchy interlacing theorem

Main article: Poincaré separation theorem

Let A be a symmetric n × n matrix. The m × m matrix B, where m ≤ n, is called a compression of A if there exists an orthogonal projection P onto a subspace of dimension m such that PAP* = B. The Cauchy interlacing theorem states:

Theorem. If the eigenvalues of A are α₁ ≤ ... ≤ α_n, and those of B are β₁ ≤ ... ≤ β_j ≤ ... ≤ β_m, then for all j ≤ m,

${\alpha }_j\le {\beta }_j\le {\alpha }_{n-m+j}.$

This can be proven using the min-max principle. Let β_i have corresponding eigenvector b_i and S_j be the j dimensional subspace S_j = span{b₁, ..., b_j}, then

${\beta }_j=\underset{x\in S_j,\Vert x\Vert =1}{\max }(Bx,x)=\underset{x\in S_j,\Vert x\Vert =1}{\max }(PA{P}^{*}x,x)\ge \underset{S_j}{\min }\underset{x\in S_j,\Vert x\Vert =1}{\max }(A(P^{*}x),P^{*}x)={\alpha }_j.$

According to first part of min-max, α_j ≤ β_j. On the other hand, if we define S_m−j+1 = span{b_j, ..., b_m}, then

${\beta }_j=\underset{x\in S_{m-j+1},\Vert x\Vert =1}{\min }(Bx,x)=\underset{x\in S_{m-j+1},\Vert x\Vert =1}{\min }(PA{P}^{*}x,x)=\underset{x\in S_{m-j+1},\Vert x\Vert =1}{\min }(A(P^{*}x),P^{*}x)\le {\alpha }_{n-m+j},$

where the last inequality is given by the second part of min-max. When n − m = 1, we have α_j ≤ β_j ≤ α_j+1, hence the name interlacing theorem.

Compact operators

Let A be a compact, Hermitian operator on a Hilbert space H. Recall that the spectrum of such an operator (the set of eigenvalues) is a set of real numbers whose only possible cluster point is zero. It is thus convenient to list the positive eigenvalues of A as

$\cdots \le {\lambda }_k\le \cdots \le {\lambda }_1,$

where entries are repeated with multiplicity, as in the matrix case. (To emphasize that the sequence is decreasing, we may write ${\lambda }_k={\lambda }_k^{\downarrow }$.) When H is infinite-dimensional, the above sequence of eigenvalues is necessarily infinite. We now apply the same reasoning as in the matrix case. Letting S_k ⊂ H be a k dimensional subspace, we can obtain the following theorem.

Theorem (Min-Max). Let A be a compact, self-adjoint operator on a Hilbert space H, whose positive eigenvalues are listed in decreasing order ... ≤ λ_k ≤ ... ≤ λ₁. Then:

$\begin{array}{rl}\underset{S_k}{\max }\underset{x\in S_k,\Vert x\Vert =1}{\min }(Ax,x)& ={\lambda }_k^{\downarrow },\\ \underset{S_{k-1}}{\min }\underset{x\in S_{k-1}^{\perp },\Vert x\Vert =1}{\max }(Ax,x)& ={\lambda }_k^{\downarrow }.\end{array}$

A similar pair of equalities hold for negative eigenvalues.

Proof

Let S' be the closure of the linear span $S^{\prime }=\mathrm{span}\{u_k,u_{k+1},\dots \}$. The subspace S' has codimension k − 1. By the same dimension count argument as in the matrix case, S' ∩ S_k has positive dimension. So there exists x ∈ S'  ∩ S_k with $\Vert x\Vert =1$. Since it is an element of S' , such an x necessarily satisfy

$(Ax,x)\le {\lambda }_k.$

Therefore, for all S_k

$\underset{x\in S_k,\Vert x\Vert =1}{\inf }(Ax,x)\le {\lambda }_k$

But A is compact, therefore the function f(x) = (Ax, x) is weakly continuous. Furthermore, any bounded set in H is weakly compact. This lets us replace the infimum by minimum:

$\underset{x\in S_k,\Vert x\Vert =1}{\min }(Ax,x)\le {\lambda }_k.$

So

$\underset{S_k}{\sup }\underset{x\in S_k,\Vert x\Vert =1}{\min }(Ax,x)\le {\lambda }_k.$

Because equality is achieved when $S_k=\mathrm{span}\{u_1,\dots ,u_k\}$,

$\underset{S_k}{\max }\underset{x\in S_k,\Vert x\Vert =1}{\min }(Ax,x)={\lambda }_k.$

This is the first part of min-max theorem for compact self-adjoint operators. Analogously, consider now a (k − 1)-dimensional subspace S_k−1, whose the orthogonal complement is denoted by S_k−1^⊥. If S' = span{u₁...u_k},

$S^{\prime }\cap S_{k-1}^{\perp }\ne 0.$

So

$\mathrm{\exists }x\in S_{k-1}^{\perp }\Vert x\Vert =1,(Ax,x)\ge {\lambda }_k.$

This implies

$\underset{x\in S_{k-1}^{\perp },\Vert x\Vert =1}{\max }(Ax,x)\ge {\lambda }_k$

where the compactness of A was applied. Index the above by the collection of k-1-dimensional subspaces gives

$\underset{S_{k-1}}{\inf }\underset{x\in S_{k-1}^{\perp },\Vert x\Vert =1}{\max }(Ax,x)\ge {\lambda }_k.$

Pick S_k−1 = span{u₁, ..., u_k−1} and we deduce

$\underset{S_{k-1}}{\min }\underset{x\in S_{k-1}^{\perp },\Vert x\Vert =1}{\max }(Ax,x)={\lambda }_k.$

Self-adjoint operators

The min-max theorem also applies to (possibly unbounded) self-adjoint operators. Recall the essential spectrum is the spectrum without isolated eigenvalues of finite multiplicity. Sometimes we have some eigenvalues below the essential spectrum, and we would like to approximate the eigenvalues and eigenfunctions.

Theorem (Min-Max). Let A be self-adjoint, and let $E_1\le E_2\le E_3\le \cdots$ be the eigenvalues of A below the essential spectrum. Then

$E_n=\underset{{\psi }_1,\dots ,{\psi }_n}{\min }\max \{⟨\psi ,A\psi ⟩:\psi \in \mathrm{span}({\psi }_1,\dots ,{\psi }_n),\Vert \psi \Vert =1\}$. If we only have N eigenvalues and hence run out of eigenvalues, then we let $E_n:=\inf {\sigma }_{ess}(A)$ (the bottom of the essential spectrum) for n>N, and the above statement holds after replacing min-max with inf-sup.

Theorem (Max-Min). Let A be self-adjoint, and let $E_1\le E_2\le E_3\le \cdots$ be the eigenvalues of A below the essential spectrum. Then

$E_n=\underset{{\psi }_1,\dots ,{\psi }_{n-1}}{\max }\min \{⟨\psi ,A\psi ⟩:\psi \perp {\psi }_1,\dots ,{\psi }_{n-1},\Vert \psi \Vert =1\}$. If we only have N eigenvalues and hence run out of eigenvalues, then we let $E_n:=\inf {\sigma }_{ess}(A)$ (the bottom of the essential spectrum) for n > N, and the above statement holds after replacing max-min with sup-inf. The proofs use the following results about self-adjoint operators:

Theorem. Let A be self-adjoint. Then $(A-E)\ge 0$ for $E\in \mathbb{ℝ}$ if and only if $\sigma (A)\subseteq [E,\mathrm{\infty })$.

Theorem. If A is self-adjoint, then

$\inf \sigma (A)=\underset{\psi \in \mathfrak{𝔇}(A),\Vert \psi \Vert =1}{\inf }⟨\psi ,A\psi ⟩$ and $\sup \sigma (A)=\underset{\psi \in \mathfrak{𝔇}(A),\Vert \psi \Vert =1}{\sup }⟨\psi ,A\psi ⟩$.

See also

• Courant minimax principle
• Max–min inequality

External links and citations to related work

• Fisk, Steve (2005). "A very short proof of Cauchy's interlace theorem for eigenvalues of Hermitian matrices". arXiv:math/0502408.
• Hwang, Suk-Geun (2004). "Cauchy's Interlace Theorem for Eigenvalues of Hermitian Matrices". The American Mathematical Monthly. 111 (2): 157–159. doi:10.2307/4145217. JSTOR 4145217.
• Kline, Jeffery (2020). "Bordered Hermitian matrices and sums of the Möbius function". Linear Algebra and Its Applications. 588: 224–237. doi:10.1016/j.laa.2019.12.004.
• Reed, Michael; Simon, Barry (1978). Methods of Modern Mathematical Physics IV: Analysis of Operators. Academic Press. ISBN 978-0-08-057045-7.