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.
Céa quasi-optimality for coercive conforming Galerkin problems
Statement
Assume Countable Choice. Let be a real or complex Hilbert space and let be linear in its first argument, conjugate-linear in its second, bounded by , and coercive with constant : Let be bounded and conjugate-linear, and let be finite-dimensional. Then there are unique and with The solutions satisfy The real bilinear case uses linear functionals and reads as the identity.
Facts & Assumptions
Given: Countable Choice; the Hilbert space ; the bounds for ; a bounded conjugate-linear ; and a finite-dimensional subspace .
Boundedness and coercivity mean the two displayed inequalities, with linear in the first slot and conjugate-linear in the second (Bounded, coercive and symmetric sesquilinear forms).
A Hilbert space is complete in its induced norm (Hilbert space).
A finite-dimensional normed subspace, including the zero subspace, is closed in its ambient normed space (A finite-dimensional normed subspace is closed).
Under Countable Choice, Lax–Milgram gives a unique solution for a bounded coercive form and bounded conjugate-linear data (The Lax--Milgram theorem, The Axiom of Countable Choice ()).
For a conforming subspace, the continuous and restricted discrete variational equations imply for every (Galerkin orthogonality for conforming approximations).
Proof
Apply [F4] on ; its hypotheses are exactly the boundedness, coercivity, Hilbert, and datum assumptions in Given. This gives a unique with for all .
Fix a finite ordered basis of . By [F3], is closed in . A Cauchy sequence in is Cauchy in , so [F2] gives a limit in ; the closedness puts the limit in . The restricted inner product is complete, so is Hilbert, also when .
The restrictions of and to retain the same bounds and , and is bounded. Apply [F4] on the Hilbert space from step 1.2. This gives a unique satisfying the discrete equations.
By [F5], with , we have for every .
Fix any . Since and , [F5] gives Coercivity and boundedness therefore give
If , the claimed estimate is immediate. Otherwise divide step 4.1 by and then take the infimum over all . This proves Céa's estimate.
Depends on
Used by
- Hermitian Galerkin solutions are best in the energy norm Corollary
- Semidiscrete parabolic energy and L2 rates from elliptic approximation Corollary
- The h^(r+s) L² rate under primal and dual approximation Corollary
- The P1 AFEM approximation class Definition
- A broken P1 test exposes a nonzero consistency residual Example
- A nonsymmetric coercive form attains the M over alpha factor Example
- The conforming energy projection is the best approximation Lemma
- Aubin–Nitsche L² error estimate from adjoint approximation Theorem
- Boundary-preserving NURBS projection and matching-patch energy approximation Theorem
- Cea and O(h) energy error for conforming metric graph P1 FEM Theorem
- Cea transfers the fixed-mesh analytic p rate to the energy error Theorem
- Conditional O(h2) variational control error under H2 regularity and full uniform L2 estimates Theorem
- Conforming elliptic finite-element reduced gradients have an energy-norm error budget Theorem
- Dirichlet elasticity energy bound and Galerkin estimate Theorem
- Exact-geometry isogeometric Poisson Galerkin estimate Theorem
- Exponential hp energy convergence for weighted-analytic polygon corners Theorem
- Galerkin energy error with local h, trace degree and Sobolev regularity Theorem
- Linear contraction of AFEM energy error and oscillation Theorem
- Piecewise-constant control with shape-regular finite elements has O(h) error Theorem
- Stochastic Galerkin coercivity and Cea quasi-optimality Theorem
Dependency tree · two levels
41 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 Fall 2025, Part VI, Chapter 26, Basic error analysis (standard reference, not scraped)
- Thomas Richter, Die Finite Elemente Methode für partielle Differentialgleichungen (standard reference, not scraped)