Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 V be a real or complex Hilbert space and let a:V×V→K be linear in its first argument, conjugate-linear in its second, bounded by M, and coercive with constant α>0: ∣a(v,w)∣≤M∥v∥V∥w∥V,Re⁡a(v,v)≥α∥v∥V2. Let F:V→K be bounded and conjugate-linear, and let Vh⊆V be finite-dimensional. Then there are unique u∈V and uh∈Vh with a(u,v)=F(v)(v∈V). a(uh,vh)=F(vh)(vh∈Vh). The solutions satisfy ∥u−uh∥V≤Mαinf⁡vh∈Vh∥u−vh∥V. The real bilinear case uses linear functionals and reads Re⁡ as the identity.

Facts & Assumptions

Given: Countable Choice; the Hilbert space V; the bounds M,α for a; a bounded conjugate-linear F; and a finite-dimensional subspace Vh⊆V.

[F1]

Boundedness and coercivity mean the two displayed inequalities, with a linear in the first slot and conjugate-linear in the second (Bounded, coercive and symmetric sesquilinear forms).

[F2]

A Hilbert space is complete in its induced norm (Hilbert space).

[F3]

A finite-dimensional normed subspace, including the zero subspace, is closed in its ambient normed space (A finite-dimensional normed subspace is closed).

[F4]

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 (ACω)).

[F5]

For a conforming subspace, the continuous and restricted discrete variational equations imply a(u−uh,vh)=0 for every vh∈Vh (Galerkin orthogonality for conforming approximations).

Proof

1.1F1F2F4given

Apply [F4] on V; its hypotheses are exactly the boundedness, coercivity, Hilbert, and datum assumptions in Given. This gives a unique u∈V with a(u,v)=F(v) for all v∈V.

1.2F2F3given

Fix a finite ordered basis of Vh. By [F3], Vh is closed in V. A Cauchy sequence in Vh is Cauchy in V, so [F2] gives a limit in V; the closedness puts the limit in Vh. The restricted inner product is complete, so Vh is Hilbert, also when Vh={0}.

2.1F1F2F4step 1.2given

The restrictions of a and F to Vh retain the same bounds M and α, and F∣Vh is bounded. Apply [F4] on the Hilbert space from step 1.2. This gives a unique uh∈Vh satisfying the discrete equations.

3.1F5step 1.1step 2.1

By [F5], with e:=u−uh, we have a(e,wh)=0 for every wh∈Vh.

4.1F1F5step 3.1algebra

Fix any vh∈Vh. Since u−vh=e+(uh−vh) and uh−vh∈Vh, [F5] gives a(e,e)=a(e,u−vh)−a(e,uh−vh)=a(e,u−vh). Coercivity and boundedness therefore give α∥e∥V2≤Re⁡a(e,e)≤∣a(e,u−vh)∣≤M∥e∥V∥u−vh∥V.

5.1step 4.1algebra∎

If e=0, the claimed estimate is immediate. Otherwise divide step 4.1 by α∥e∥V and then take the infimum over all vh∈Vh. This proves Céa's estimate.

Depends on

Used by

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