Alphabeta Math
TheoremStatement: 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.

Residual reliability and local efficiency for P1 AFEM

Statement

Assume Countable Choice, as in the Sobolev trace and inverse-estimate suppliers.

Let T be a conforming shape-regular triangular mesh, let u∈H01(Ω) solve the model of Residual indicators and data oscillation for P1 AFEM, and let U∈V(T) be its exact P1 Galerkin solution. There are constants Crel,Ceff depending only on the shape bound and ∣b∣hmax⁡ such that ∥∇(u−U)∥22≤Crelη(U,T)2, and for every K∈T, ηK(U)2≤Ceff(∥∇(u−U)∥L2(ωK)2+osc⁡(U,ωK)2), where ωK is the union of K and its edge neighbors. If T∗≥T contains the uniform three-generation subdivision of every cell in the original edge-neighbor patch ω(M) of M⊂T (in particular, every complete call of Dorfler marking and conforming newest-vertex refinement has this property) and U∗ is the exact fine Galerkin solution, then η(U, M)2≤Ceff(∥∇(U∗−U)∥L2(ω(M))2+osc⁡(U,ω(M))2), with ω(M) the union of edge-neighbor patches of marked cells. All constants are independent of the refinement level.

Facts & Assumptions

[A1]

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

Given: Countable Choice, the exact weak solution, conforming P1 Galerkin solution, shape-regular matching mesh, residual estimator, and three-generation refinement of the bulk marks and their original edge neighbors.

[F1]

The error pairs with an arbitrary H01 test function as the sum of cell residuals and negative outward flux jumps (Element and edge residual representation for P1 Galerkin errors).

[F2]

The moment interpolant has local L2, gradient, edge-trace bounds, maps into the conforming zero-boundary P1 space, and reproduces P1 functions (Local approximation and reproduction of the P1 moment interpolant).

[F3]

Polynomial inverse and affine-scaling estimates on shape-regular triangles give uniform norm bounds for fixed-degree barycentric bubbles and P1 hats (Polynomial inverse and discrete trace inequalities, Shape regularity controls affine simplex geometry).

[F4]

Three generations place an interior median midpoint in each requested triangle, with the eight explicit leaves of the reference pattern, and a midpoint in each original edge; the refined family is uniformly shape regular (Shape regularity and local reduction under 2D newest-vertex bisection).

[F5]

Continuous matching piecewise polynomials with zero boundary trace belong to H01 (Continuous matching piecewise polynomials belong to W1p, Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare).

Proof

1.1A1F1F2givenalgebra

Put e=u−U and write a(w,v)=∫Ω∇w⋅∇v+(b⋅∇w)v. By the exact Galerkin equation, a(U,vh)=∫Ωfvh for every vh∈V(T); subtracting from the weak equation gives a(e,vh)=0. For w∈Cc∞(Ω), constancy of b gives ∫(b⋅∇w)w=12∫b⋅∇(w2)=0. The map w↦∫(b⋅∇w)w is continuous in H1, so density extends this identity to all w∈H01. Hence a(e,e)=∥∇e∥22 and, since ITe∈V(T), ∥∇e∥22=a(e,e−ITe). Apply [F1] to e−ITe. Cauchy–Schwarz, the cell and edge interpolation bounds [F2], and finite overlap of vertex patches give ∥∇e∥22≤Cη(U,T)∥∇e∥2. If ∥∇e∥2=0 reliability is immediate; otherwise divide by it and square. This proves the global upper bound.

1.2A1F1F3F5givenalgebra

For each cell let RˉK=ΠK0RK, and let λ1,λ2,λ3 be its barycentric coordinates. The polynomial ψK=27λ1λ2λ3, extended by zero outside K, has zero trace on ∂K, satisfies 0≤ψK≤1, and has ∫KψK=(9/20)∣K∣. Thus vK=RˉKψK is an admissible H01 test by [F5]. By affine scaling and [F3], ∥vK∥L2(K)≤C∥RˉK∥L2(K) and ∥∇vK∥L2(K)≤ChK−1∥RˉK∥L2(K). The residual identity has no edge term for this test, so RˉK∫KvK=a(e,vK)+∫K(RˉK−RK(U))vK. The left side is at least c∥RˉK∥L2(K)2, while the two terms on the right are bounded by C(1+∣b∣hK)hK−1∥∇e∥L2(K)∥RˉK∥L2(K) and C∥RK−RˉK∥L2(K)∥RˉK∥L2(K), respectively. If RˉK≠0, division and multiplication by hK give hK∥RˉK∥L2(K)≤C(1+∣b∣hK)∥∇e∥L2(K)+ChK∥RK−RˉK∥L2(K); if it is zero, the same bound for hK∥RK∥L2(K) follows from RK=RK−RˉK. Hence in all cases hK∥RK∥L2(K)≤C(1+∣b∣hK)∥∇e∥L2(K)+Cosc⁡K(U).

2.1A1F1F3F5step 1.2algebra

On an interior edge E=K+∩K− write ωE=K+∪K−, and let λi±,λj± be the barycentric coordinates of its endpoints on the two incident cells. Define ψE=4λi+λj+ on K+, ψE=4λi−λj− on K−, and zero outside their union. These traces agree on E, vanish on the other edges of the patch, and satisfy ∫EψE=(2/3)hE, ∥ψE∥L2(K+∪K−)≤ChE, and ∥∇ψE∥L2(K+∪K−)≤C by [F3]. The function ψE is an admissible H01 test by [F5]. Put J=JE(U), which is constant for P1 with A=I, and test [F1] with vE=JψE. All edge terms other than the one on E vanish. Its magnitude is (2/3)hEJ2. The cell terms are bounded by ChE∣J∣(∥RK+(U)∥2+∥RK−(U)∥2), and the form term by C(1+∣b∣hE)∣J∣∥∇e∥L2(K+∪K−). Use step 1.2, hE≍hK±, and the definitions of the oscillations to obtain hE∣J∣≤C(1+∣b∣hmax⁡)(∥∇e∥L2(K+∪K−)+osc⁡(U,K+∪K−)); the bound is trivial if J=0. Since hE1/2∥JE(U)∥L2(E)=hE∣J∣, summing with bounded patch overlap and the cell estimate of step 1.2 proves the local efficiency assertion.

2.2F1F3F4F5step 1.2algebra

Set d=U∗−U. For every original cell L in ω(M), use its fixed uniform-three-generation pattern from [F4]. Its P1 hat ϕL at the interior median midpoint is zero on ∂L. Exactly four of the eight equal-area leaves meet that midpoint, so ∫LϕL=4(∣L∣/8)/3=∣L∣/6. Reference scaling gives ∥ϕL∥L2(L)≤ChL and ∥∇ϕL∥L2(L)≤C. Extend by zero and prolong to T∗: containment of the fixed pattern makes this a fine P1 function even after arbitrary additional closure or refinement. For every fine test v∗, fine Galerkin orthogonality gives a(u−U,v∗)=a(d,v∗). Testing with v∗=RˉLϕL, where RˉL=ΠL0RL, yields the cell estimate by exactly the residual splitting and zero-mean remainder argument of step 1.2, now with ∫LϕL=∣L∣/6: hL∥RL(U)∥L2(L)≤C(1+∣b∣hmax⁡)∥∇d∥L2(L)+Cosc⁡L(U). The case RˉL=0 uses only the oscillation remainder, so no zero quantity is divided by. This bound is now available on every neighbor needed below.

3.1F1F3F4F5step 2.1step 2.2algebra∎

For each interior edge E incident to a cell of M, both original incident cells belong to ω(M). Define a common trace tent tE on E: it is zero at its two endpoints, one at its midpoint, and affine on each half. On each incident cell's fixed three-generation pattern, prescribe nodal values tE(z) at nodes on E and zero at every pattern node off E, then interpolate P1. In particular any quarter points on a reference edge have value 1/2, rather than zero. The traces from the two cells equal the same full tent even when their reference labels differ; all other original edge traces are zero. Thus the two pieces glue to a continuous function ψE supported on ωE, zero on its boundary, with ∫EψE=hE/2,∥ψE∥L2(ωE)≤ChE,∥∇ψE∥L2(ωE)≤C. Indeed each cell uses eight fixed-shape leaves, nodal values in [0,1], and affine scaling; shape regularity gives hL≍hE for the two cells. Prolong these reference functions to T∗, retaining their values, support, integrals and bounds; do not replace them by nodal hats on the possibly much finer actual mesh. For J=JE(U), test with JψE. The only original edge term is J2hE/2, so the residual identity and local form bound give hE∣J∣≤C(1+∣b∣hE)∥∇d∥L2(ωE)+ChE∑L⊂ωE∥RL(U)∥L2(L). For J=0 this is immediate. Applying step 2.2 on both incident cells yields the desired edge estimate in terms of correction energy and oscillation on ωE. Summing squared cell and edge estimates over M has bounded overlap: each triangle belongs to at most its own and its three neighbors' patches. This proves the marked estimate with precisely ω(M) on the right and constants independent of all extra refinement.

Depends on

Used by

Dependency tree · two levels

39 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