Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck pass
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.

Practical DPG residual is reliable and efficient up to data oscillation

Statement

Assume Countable Choice. Assume the continuous trial-to-test operator is boundedly invertible with lower inf-sup constant β>0, and let Π:V→Vr be the bounded Fortin map with b(Uh,(I−Π)V)=0. For any exact solution x=B−1F and any x~h∈Uh, define the practical residual estimator η=∥F−Bx~h∥Vr′ and Fortin data oscillation osc⁡(F)=∥F∘(I−Π)∥V′. Then β2∥x−x~h∥U2≤η2+(∥Π∥η+osc⁡(F))2,η≤∥b∥∥x−x~h∥U, osc⁡(F)≤∥b∥∥I−Π∥inf⁡zh∈Uh∥x−zh∥U. For the stated P1/R3 Poisson Fortin map, osc⁡(Ff)≤C(∑KhK2∥f−fK∥L2(K)2)1/2, where fK=∣K∣−1∫Kf; it vanishes for cellwise constant f.

Facts & Assumptions

Given: The continuous inf-sup bound, the bounded Fortin map, Countable Choice, and an arbitrary discrete approximation.

[A1]

Countable Choice is declared for Hilbert Riesz representation. (The Axiom of Countable Choice (ACω))

[F1]

The DPG trial/test spaces and load functional are fixed by the formulation. (Ultraweak Poisson DPG spaces and plan-consistent bilinear form)

[F2]

The practical Fortin map preserves the trial form and has the local mean-preserving approximation bound. (A uniformly bounded Fortin map for the practical P1/R3 DPG family)

[F3]

The practical quasi-optimality theorem records the continuous inf-sup and boundedness hypotheses used here. (Fortin stability and quasi-optimality for practical DPG)

[F4]

Hilbert Riesz gives unique representatives of bounded linear functionals and identifies their dual norms with the norms of those representatives. (Riesz representation for Hilbert spaces)

Proof

1.1A1F2F3F4given

Let e=x−x~h and let ϵ∈V represent F−Bx~h by Riesz. Choose an orthonormal basis e1,…,eN of the finite-dimensional polynomial space Vr and set ϵh=∑j=1N(ϵ,ej)Vej. Then δ=ϵ−ϵh is orthogonal to Vr, η=∥ϵh∥V=∥F−Bx~h∥Vr′, and ∥ϵ∥2=η2+∥δ∥2. Continuous inf-sup gives β∥e∥≤∥ϵ∥.

1.2F1F2F4givenalgebra

Riesz gives η≤∥Be∥V′≤∥b∥∥e∥. For any zh∈Uh, Fortin orthogonality gives F((I−Π)y)=b(x−zh,(I−Π)y); take the dual norm and infimum to obtain the oscillation approximation bound.

2.1F2F4step 1.1algebra

Since Πδ∈Vr, ∥δ∥2=(δ,δ−Πδ). Substitute ϵ−ϵh for δ; Fortin orthogonality kills b(x~h,(I−Π)δ), leaving F((I−Π)δ)+(ϵh,Πδ). Hence ∥δ∥≤osc⁡(F)+∥Π∥η. Combine with step 1.1 to get the reliability inequality.

3.1F1F2step 1.2algebra∎

For the Poisson load, mean preservation gives ∫K(v−Π3gradv)=0, so Ff((I−Π)(τ,v))=∑K(f−fK,v−Π3gradv)K. By [F2], each difference is bounded by ChK∥∇v∥K. Cauchy–Schwarz over cells yields the stated data oscillation; it is zero if every f∣K=fK.

Depends on

Used by

Dependency tree · two levels

38 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