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.
Conforming finite-element eigenvalues have a quadratic best-approximation error
Statement
Assume Countable Choice and the compact coercive form setting of Discrete spectrum and min–max principle for a compact coercive form. Let be finite-dimensional, let with , and let be the first continuous eigen-directions. Write as in Best-approximation gap of a finite-dimensional eigenspace. There are and , depending only on and the first continuous eigenvalues, such that if , then the th conforming Ritz value satisfies The lower bound holds for every conforming of dimension at least ; the upper error bound requires the stated small-gap condition. More generally, let be a Hermitian lower-bounded form on the same , and suppose a specified shift makes bounded, Hermitian and coercive, with the same injective compact dense map . Define using the energy norm and the first eigenspace directions for . The theorem applies to the shifted problem with ; its continuous and discrete eigenvalues are the corresponding unshifted eigenvalues plus . Subtracting preserves their ordering and the difference .
Facts & Assumptions
Given: Countable Choice, the compact coercive form pair , a finite-dimensional conforming subspace , an index with , and below the threshold in The conforming Ritz matrix differs quadratically in the eigenspace gap.
The continuous eigenvalues and Rayleigh quotient satisfy the attained continuous min–max principle (Discrete spectrum and min–max principle for a compact coercive form).
The finite-dimensional conforming Ritz eigenvalues satisfy their own min–max formula (Finite-dimensional conforming Ritz values satisfy min–max).
The energy projection is best approximation and is injective on when (The conforming energy projection is the best approximation).
On , every Rayleigh quotient is at most under the stated small-gap bound (The conforming Ritz matrix differs quadratically in the eigenspace gap).
Proof
Given: The continuous and discrete form problems, , , , , and .
For every -dimensional subspace , conformity gives . The continuous min–max principle [F1] therefore gives . Taking the minimum over such and applying [F2] yields .
For the shift branch, the form eigenrelation for is which is equivalent to the unshifted relation with eigenvalue . The same equivalence holds on , because the mass form is unchanged. Thus every continuous and discrete eigenvalue shifts by the same scalar, preserving the ordering and satisfying .
Since , [F3] makes an -dimensional subspace of . The local Ritz-matrix estimate [F4] gives By the discrete min–max principle [F2], is no greater than this maximum. This proves the upper bound.
Apply steps 1.1–2.1 to the bounded, Hermitian, coercive shifted form using its own best-approximation gap . It gives under that gap's smallness condition. Step 1.2 subtracts from both eigenvalues, leaving the same ordering and error.
Depends on
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Best-approximation gap of a finite-dimensional eigenspace
- The conforming energy projection is the best approximation
- The conforming Ritz matrix differs quadratically in the eigenspace gap
- Finite-dimensional conforming Ritz values satisfy min–max
- Discrete spectrum and min–max principle for a compact coercive form
Used by
Dependency tree · two levels
32 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, Chapter 47 (standard reference, not scraped)
- Bertrand Mercier, Topics in Finite Element Solution of Elliptic Problems, Chapter 8 (standard reference, not scraped)