TheoremBase

The Courant–Fischer Min–Max Theorem

For a symmetric matrix with eigenvalues ordered decreasingly, the k-th eigenvalue is the best lower bound of the quadratic form on unit vectors that a k-dimensional subspace can achieve, attained by the span of the first k eigenvectors, and dually the best upper bound over subspaces of dimension n-k+1.

Statement

In the setting of Symmetric and Positive Semidefinite Matrices, the Operator Norm and Spectral Notation and Linear Algebra: Standing Notation, let n∈Nn\in\mathbb{N}, let A∈S(n)A\in\mathcal{S}(n) be a symmetric matrix, let Q∈O(n)Q\in\mathrm{O}(n) and λ∈Rn\lambda\in\mathbb{R}^{n} satisfy

A=(Qdiag⁡(λ))Q⊤,λ1≥λ2≥⋯≥λn,A=(Q\operatorname{diag}(\lambda))Q^{\top},\qquad\lambda_{1}\ge\lambda_{2}\ge\dots\ge\lambda_{n},

as provided by The Spectral Theorem for Real Symmetric Matrices (i), and let k∈[n]k\in[n]. A unit vector is an x∈Rnx\in\mathbb{R}^{n} with ∥x∥=1\lVert x\rVert=1.

Max–min. Every subspace UU of Rn\mathbb{R}^{n} (ℝⁿ Is a Real Vector Space (i)) with dim⁡U=k\dim U=k contains a unit vector xx with x⋅(Ax)≤λkx\cdot(Ax)\le\lambda_{k}. The span Uk=span⁡(Qe1,…,Qek)U_{k}=\operatorname{span}(Qe_{1},\dots,Qe_{k}) is a subspace of dimension kk, and

x⋅(Ax)≥λkfor every unit vector x∈Uk.x\cdot(Ax)\ge\lambda_{k}\qquad\text{for every unit vector }x\in U_{k}.

Min–max. Every subspace UU of Rn\mathbb{R}^{n} with dim⁡U=n−k+1\dim U=n-k+1 contains a unit vector xx with x⋅(Ax)≥λkx\cdot(Ax)\ge\lambda_{k}. The span Vk=span⁡(Qek,…,Qen)V_{k}=\operatorname{span}(Qe_{k},\dots,Qe_{n}) is a subspace of dimension n−k+1n-k+1, and

x⋅(Ax)≤λkfor every unit vector x∈Vk.x\cdot(Ax)\le\lambda_{k}\qquad\text{for every unit vector }x\in V_{k}.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Log in to comment.

Loading…