How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Discrete spectrum and min–max principle for a compact coercive form
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). Let be an infinite-dimensional real or complex Hilbert space, let be a real or complex Hilbert space over the same field, and let be an injective, bounded, compact linear map with dense range (Compact linear operator). Let be bounded, Hermitian and coercive with constants (Bounded, coercive and symmetric sesquilinear forms). Then there is a sequence of eigenpairs such that where each eigenvalue is repeated according to multiplicity, , , and The vectors form an orthonormal basis of , and form an orthonormal basis of for the energy inner product . In particular, for , and the Rayleigh quotient satisfies the attained min–max identity This is the abstract continuous spectral interface used below. The published elliptic suppliers on the Dirichlet branch have their own stated domain and axiom hypotheses; this theorem does not enlarge those imported interfaces.
Facts & Assumptions
Given: Countable Choice, the Hilbert spaces , the injective compact inclusion with dense range, and the bounded Hermitian coercive form .
Boundedness, Hermitian symmetry and coercivity mean , , and (Bounded, coercive and symmetric sesquilinear forms).
Countable Choice permits Lax–Milgram for a bounded coercive form on a Hilbert space (The Lax--Milgram theorem, The Axiom of Countable Choice ()).
A compact operator composed after a bounded operator is compact (Compact linear operator, Compositions with a compact operator are compact).
A compact self-adjoint operator on a Hilbert space has finite-dimensional nonzero eigenspaces, at most countably many nonzero eigenvalues accumulating only at zero, and the closed span of its nonzero eigenspaces is the orthogonal complement of its kernel. Its orthogonal eigenprojections give a norm convergent spectral expansion (Spectral theorem for compact self adjoint operators).
A complete orthonormal family in a Hilbert space gives norm convergence of its Fourier sums and Parseval's identity (Fourier expansion in a Hilbert space, Parseval equivalences for an orthonormal family).
A closed subspace of a Hilbert space has an orthogonal decomposition (Orthogonal decomposition by a closed subspace).
A linear map from an -dimensional space to an -dimensional space has a nonzero kernel (Rank-nullity: ).
The unit sphere of a finite-dimensional subspace is compact, and a continuous real-valued function on it attains its maximum (Heine-Borel in : with the Euclidean metric a subset of is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line, A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value).
Proof
Given: The data of the statement and .
For , the functional is bounded on because . Apply [F2] to obtain a unique satisfying for every . Uniqueness makes linear.
Testing with and using coercivity gives If , divide by ; if the same bound is immediate. Thus is bounded from to with .
Set . By [F3], is compact. For , testing the defining equations for and at and respectively and using Hermitian symmetry gives ; hence is self-adjoint. Also . If , injectivity of gives , so for every by step 1.1. Density of then gives . Thus is positive and injective.
Apply [F4] to . Its nonzero eigenvalues are positive because is positive, and its kernel is zero by step 2.2; therefore the eigenspaces of its nonzero eigenvalues span . There are infinitely many eigenvalue occurrences, because each eigenspace has finite dimension while is infinite-dimensional. Write . Recursively list a largest eigenvalue among those whose multiplicity has not yet been exhausted: after any finite number of entries the remaining set is nonempty, and if is any remaining value, only finitely many remaining eigenvalues are at least , each with finite multiplicity. Iterated trichotomy gives a maximum of these finitely many occurrences, which is then maximal in the whole remainder. The resulting sequence lists every exactly times, since only finitely many occurrences are at least its value. Thus includes all multiplicities. Compactness gives ; Countable Choice selects an orthonormal basis of each finite-dimensional eigenspace, and these bases give the ordered family [F2, F4].
Since and is injective, each belongs to the image . Identify it with its unique preimage . The equation and imply Set . Then , , , and the displayed form eigenrelation holds.
By [F1], the energy norm induced by is equivalent to , so is complete in that norm. Put . The eigenrelation in step 4.1 gives , so is an orthonormal family in with inner product . If is -orthogonal to every , the same eigenrelation gives for every . The vectors are an orthonormal basis of by step 3.1, so ; injectivity of gives . Thus the closed span of has zero orthogonal complement in , and [F6] implies it is all of .
Parseval in for and in for yields, for every , For , by injectivity, so is the weighted average of the with weights .
Let . Step 6.1 shows for every nonzero , with equality at ; hence . This gives one inequality in the min–max identity, attained by .
Let have dimension . The map taking to has a nonzero kernel by [F7]. For a nonzero vector in that kernel, the expansion of step 6.1 has no terms with index below , so . Thus the maximum Rayleigh quotient on every such is at least . It is attained on the unit sphere by [F8], so the outer minimum is at least and equals the value from step 7.1.
Remarks
The proof uses Countable Choice through Lax–Milgram and the compact self-adjoint spectral theorem. It does not use the Axiom of Choice. A specified coercive shift of a lower-bounded Hermitian form is handled by applying this theorem to the shifted form and subtracting the same shift from every continuous and discrete eigenvalue; the ordering is unchanged.
Depends on
- Bounded, coercive and symmetric sesquilinear forms
- Compact linear operator
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Hilbert space
- Real and complex inner-product spaces and their induced length
- Compositions with a compact operator are compact
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
- Heine-Borel in $\mathbb{R}^n$: with the Euclidean metric a subset of $\mathbb{R}^n$ is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line
- Fourier expansion in a Hilbert space
- The Lax--Milgram theorem
- Orthogonal decomposition by a closed subspace
- Parseval equivalences for an orthonormal family
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
- Spectral theorem for compact self adjoint operators
Used by
- A repeated eigenspace can be stable while chosen eigenvectors oscillate Example
- A repeated unit-cube Maxwell eigenvalue cluster Example
- An explicit PEC standing wave in the unit cube Example
- The conforming Ritz matrix differs quadratically in the eigenspace gap Lemma
- Conforming finite-element eigenvalues have a quadratic best-approximation error Theorem
- Conforming Galerkin invariant subspaces converge across an isolated cluster Theorem
- Spectral convergence and no nonzero pollution for PEC edge elements Theorem
Dependency tree · two levels
118 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jean-Luc Guermond, MATH 661 Finite Element Methods, Fall 2025, Chapters 46–47 (standard reference, not scraped)
- Jean-Luc Guermond, MATH 661 Finite Element Methods, Fall 2025, Chapter 47 (standard reference, not scraped)
- Bertrand Mercier, Topics in Finite Element Solution of Elliptic Problems, Chapter 8 (standard reference, not scraped)