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

Linear contraction of AFEM energy error and oscillation

Statement

Assume the Axiom of Choice and Countable Choice for the weak elliptic existence suppliers used to instantiate either model branch.

Let (Tk,Uk) be generated by exact P1 Galerkin solves and the three-generation algorithm with θE,θO∈(0,1], and assume every per-call bisection budget is sufficient for a complete refinement. For the estimator and oscillation of Residual indicators and data oscillation for P1 AFEM, write ek=∥∇(u−Uk)∥2, ηk=η(Uk,Tk) and osc⁡k=osc⁡(Uk,Tk). On the symmetric branch b=0, no initial-mesh smallness is needed. On the constant-convection branch assume the uniform dual-pickup bound of Quasi-orthogonality for constant convection on a fine initial mesh and set μ=CDh0s∣b∣. Define κ=min⁡{12,θECeffCrel},ν={0,b=0,μ/(1−μ),b≠0. In the convection branch assume μ<1, so that ν is defined and the quasi-orthogonality estimate applies, and assume ν<κ. Then there are β>0 and 0<α<1, depending only on the displayed constants and marking parameters, such that ek+12+βosc⁡k+12≤α(ek2+βosc⁡k2).

Moreover, after possibly reducing a positive weight σ, there are β′>0 and 0<α′<1 such that ek+12+β′osc⁡k+12+σηk+12≤α′(ek2+β′osc⁡k2+σηk2). This second assertion records the residual-estimator reduction as part of the usual AFEM quasi-error. Constants and smallness hypotheses belong to the chosen marking and the stated dual-pickup bound.

Facts & Assumptions

[A1]

The Axiom of Choice and Countable Choice are assumed for the weak-solution suppliers and Sobolev spaces (The Axiom of Choice, The Axiom of Countable Choice (ACω)).

Given: The Axiom of Choice, Countable Choice, exact weak and Galerkin solutions, reliability and marked local efficiency, bulk estimator and oscillation sets, three-generation refinement, and in the convection case the stated dual-pickup bound.

[F1]

Reliability gives ek2≤Crelηk2, and marked local efficiency gives ηk(ME)2≤Ceff(∥∇(Uk+1−Uk)∥22+osc⁡k2) (Residual reliability and local efficiency for P1 AFEM).

[F2]

The energy error satisfies exact symmetric orthogonality for b=0 and the stated quasi-orthogonality inequality for constant b (Quasi-orthogonality for constant convection on a fine initial mesh).

[F3]

Data oscillation contracts by osc⁡k+12≤γOosc⁡k2, where γO=1−34θO<1 (Data oscillation reduction under three-generation refinement).

[F4]

The residual estimator satisfies the reduction inequality after marked refinement, with a correction term proportional to ∥∇(Uk+1−Uk)∥22 (Reduction of the P1 residual estimator after marked refinement).

[F5]

Under the stated choice assumptions, weak Dirichlet Poisson has a unique solution (Existence and uniqueness for the weak Dirichlet Poisson problem).

[F6]

Constant-convection weak Dirichlet Poisson has a unique weak solution under the same choice assumptions (Weak well-posedness for constant divergence-free convection).

[F7]

Under Countable Choice, every finite-dimensional conforming subspace has a unique exact Galerkin solution for the bounded coercive form (Céa quasi-optimality for coercive conforming Galerkin problems).

Proof

1.1A1F1F2F5F6F7givenalgebra

By [A1, F5] or [A1, F6], as appropriate to the chosen branch, the weak solution exists uniquely under the stated choice assumptions. By [F7], the finite-dimensional P1 Galerkin solution on each mesh also exists uniquely. Write dk=Uk+1−Uk. The completed algorithm refines every original edge neighbor of ME through three generations, so the marked-correction premise in [F1] holds, including its adjacent-cell tests. By [F1] and the Dörfler property, θEηk2≤ηk(ME)2≤Ceff(∥∇dk∥22+osc⁡k2),ηk2≥ek2/Crel. Thus ∥∇dk∥22≥κek2−osc⁡k2. By [F2], ek+12≤(1+ν)ek2−∥∇dk∥22, where ν=0 in the symmetric case and ν=μ/(1−μ) otherwise. Consequently ek+12≤(1−δ)ek2+osc⁡k2,δ=κ−ν>0.

2.1A1F3step 1.1algebra

Combine step 1.1 with [F3]: ek+12+βosc⁡k+12≤(1−δ)ek2+(1+βγO)osc⁡k2. Choose β>1/(1−γO). Then both coefficients 1−δ and γO+1/β are strictly less than one. Their maximum is a valid α<1, proving the first contraction.

3.1A1F2F3F4step 1.1algebra∎

Set ε=θE/4 in [F4]. Dörfler marking gives ηk+12≤ρEηk2+CE∥∇dk∥22,ρE=1+ε−12θE=1−14θE<1, where CE is finite. Also [F2] implies ∥∇dk∥22≤(1+ν)ek2. Choose σ>0 so σCE(1+ν)<δ/2. Adding σ times this estimator inequality to the error and oscillation bounds gives coefficients strictly below one on ek2 and ηk2. Choose β′ large enough that the coefficient on osc⁡k2, divided by β′, is below one; this is possible by γO<1. The maximum of the three resulting coefficients is α′<1, which proves the second inequality. The case of zero error or zero oscillation satisfies the same inequalities without division.

Depends on

Used by

Dependency tree · two levels

43 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