Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Localized energy estimate for nested Galerkin solutions

Statement

Assume Countable Choice, as in the Sobolev interpolation suppliers.

Let T≤T∗ be conforming P1 meshes with exact Galerkin solutions U,U∗. Let R={K∈T:K is subdivided in T∗} and let ω(R) be the union of the vertex stars of cells in R. Then ∥∇(U∗−U)∥L2(Ω)2≤C∑K∈RηK(U)2, where C depends on shape regularity, ∣b∣hmax⁡, and the local interpolant constants.

Facts & Assumptions

[A1]

Countable Choice is assumed in the cited Sobolev and reference-simplex suppliers (The Axiom of Countable Choice (ACω)).

Given: Countable Choice, a nested matching refinement, exact conforming P1 Galerkin solutions, and the constant-convection model.

[F1]

The coarse residual pairs the weak error with any H01 function as the cell residual sum minus the outward flux jump sum (Element and edge residual representation for P1 Galerkin errors).

[F2]

The local moment interpolant is P1-reproducing and satisfies local volume, gradient and edge estimates (Local approximation and reproduction of the P1 moment interpolant).

[F3]

Galerkin orthogonality holds on both nested conforming spaces (Galerkin orthogonality for conforming approximations).

Proof

1.1A1F2givenconstructalgebra

Define an auxiliary coarse moment map J:H01(Ω)→V(T) for this nested pair. At each interior vertex z, choose the least-index incident coarse cell Lz∉R if one exists, otherwise the original selected cell Kz, and use its dual affine moment qz(w)=∫Lzwψz,Lz; at boundary vertices use zero. Set Jw=∑z interiorqz(w)φz. The same conforming zero-boundary membership argument as in [F2] applies. Its bounds are uniform: on a cell K use the patch mean c when K misses the boundary and c=0 otherwise. Then qz(w)−c=∫Lz(w−c)ψz,Lz for interior vertices, while boundary coefficient differences are zero. Because Lz⊂ωK and hLz≍hK, the scaled dual bound gives ∣qz(w)−c∣≤ChK−1∥w−c∥L2(Lz). The hat bounds and patch Poincaré argument in the proof of [F2] therefore give ∥w−Jw∥L2(K)≤ChK∥∇w∥L2(ωK) and ∥∇Jw∥L2(K)≤C∥∇w∥L2(ωK). Applying the same scaled trace inequality as in [F2] gives its edge bound as well. All these operations have input w∈H01(Ω); shifted functions enter only the local integrals.

2.1A1F3step 1.1givenalgebra

Put d=U∗−U. The fine Galerkin equation and coarse equation imply a(u−U∗,d)=0 and a(u−U,Jd)=0. Since b is constant and d∈H01(Ω), ∫(b⋅∇d)d=0, so a(d,d)=∥∇d∥22. Also a(u−U,d)=a(d,d) because u−U=d+(u−U∗) and fine orthogonality kills the latter term paired with d. Hence ∥∇d∥22=a(u−U,d−Jd).

3.1A1F1F2step 1.1step 2.1algebra∎

If K∉R, then d is affine on K. At every interior vertex z of K, the selected Lz is also unchanged, so d∣Lz is affine and its dual moment equals the common nodal value d(z); boundary coefficients equal d(z)=0. Consequently Jd=d on every unchanged cell. The trace of d−Jd also vanishes on every edge incident to an unchanged cell. Thus [F1] applied to step 2.1 contains only volume residuals on R and interior edges with both incident cells in R. Use the volume and edge estimates proved in step 1.1. The surviving squared residual weights are bounded by C∑K∈RηK(U)2, since each surviving edge contribution occurs in the indicators of its incident refined cells. Cauchy–Schwarz and uniformly bounded overlap of the coarse vertex patches bound the other factor by C∥∇d∥2, giving ∥∇d∥22≤C(∑K∈RηK(U)2)1/2∥∇d∥2. If this gradient norm is zero the claim is immediate; otherwise divide by it and square.

Depends on

Used by

Dependency tree · two levels

36 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