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

One-dimensional SUPG energy error bound with explicit tau dependence

Statement

Assume the homogeneous one-dimensional problem and uniform P1 SUPG form of One-dimensional stationary convection–diffusion model and uniform P1 space and One-dimensional residual SUPG form with the exact cell parameter. Assume Countable Choice, and let u∈C2([0,1]) be the exact solution and uh∈Vh the unique discrete solution from One-dimensional P1 SUPG is consistent and coercive. For every continuous, piecewise-H1 function w with w(0)=w(1)=0, define ∥w∥SD2:=ϵ∥w′∥L2(0,1)2+τb2∥w′∥L2(0,1)2,M:=∥u′′∥L∞(0,1). This is the product L2 norm of (ϵw′,τ∣b∣w′), so it has the triangle inequality. Then ∥u−uh∥SD≤[hϵ+τb2+hϵ+h∣b∣τ+ϵτ+h2τ]M. With c∗ from The one-dimensional SUPG parameter is positive and bounded, there is a universal C∗>0 such that also ∥u−uh∥SD≤C∗(hϵ+h3/2∣b∣)M.

Facts & Assumptions

Given: Countable Choice; ϵ>0, b≠0, a uniform mesh of size h, a homogeneous exact solution u∈C2([0,1]), and its discrete SUPG solution uh.

[F1]

One-dimensional residual SUPG form with the exact cell parameter: for P1 functions ah(vh,vh)=ϵ∥vh′∥22+τb2∥vh′∥22, while for piecewise smooth w its stabilization uses −ϵw′′+bw′; τ=h(2∣b∣)−1(coth⁡(Pe)−1/Pe).

[F2]

One-dimensional P1 SUPG is consistent and coercive: ah(u−uh,vh)=0 for every vh∈Vh, and ah(vh,vh)=∥vh∥SD2.

[F3]

One-dimensional P1 interpolation has a first-derivative error bound under Countable Choice: for the nodal P1 interpolant Ihu, ∥(u−Ihu)′∥2≤h∥u′′∥∞.

[F4]

One-dimensional P1 interpolation has an L2 error bound: ∥u−Ihu∥2≤h2∥u′′∥∞.

[F5]

The one-dimensional SUPG parameter is positive and bounded: τ<h/(2∣b∣), τ≥(c∗/2)min⁡{h2/(2ϵ),h/∣b∣}, and τ≤h2/(8ϵ).

[A1]

Countable Choice is assumed only for the imported interpolation result [F3] (The Axiom of Countable Choice (ACω)); no arbitrary choice is used elsewhere in this finite-mesh proof.

Proof

1.1A1F3F4givenconstruct

Let Ihu be the nodal interpolant, η:=u−Ihu, and eh:=uh−Ihu. The homogeneous endpoint data imply Ihu∈Vh, so eh∈Vh. By [F3] and [F4], ∥η′∥2≤hM and ∥η∥2≤h2M.

2.1F1F2step 1.1algebra

By [F2], ah(eh,eh)=ah(η,eh). The convection term satisfies (bη′,eh)=−(bη,eh′): cell boundary terms cancel at interior nodes because η and eh are continuous, and the two outer terms vanish. The diffusion and P1 stabilization terms are bounded by ϵ∥η′∥2∥eh∥SD and ∣b∣τ∥η′∥2∥eh∥SD. The additional consistency-extension term involving −ϵη′′ is bounded by ϵτ∥η′′∥2∥eh∥SD, because τ∣b∣∥eh′∥2≤∥eh∥SD. The integrated convection term is bounded by ∥η∥2∥eh∥SD/τ, since τ∣b∣∥eh′∥2≤∥eh∥SD. Therefore ∣ah(η,eh)∣≤(ϵ∥η′∥2+∣b∣τ∥η′∥2+ϵτ∥η′′∥2+∥η∥2τ)∥eh∥SD.

3.1F2step 2.1algebra

If eh=0, its norm estimate is immediate. Otherwise, divide step 2.1 by ∥eh∥SD and use [F2] to get ∥eh∥SD≤(ϵ+∣b∣τ)∥η′∥2+ϵτ∥η′′∥2+∥η∥2/τ.

4.1F1F3F4step 1.1step 3.1algebra

Since Ihu is affine on each cell, η′′=u′′ cellwise and ∥η′′∥2≤M. With u−uh=η−eh, the triangle inequality, [F1], [F3], [F4], and step 3.1 give ∥u−uh∥SD≤[hϵ+τb2+hϵ+h∣b∣τ+ϵτ+h2τ]M.

5.1F1F5step 4.1algebra∎

From [F5], h∣b∣τ≤h3/2∣b∣/2. If Pe≤1, then τ≥c∗h2/(4ϵ), so h2/τ≤2c∗−1/2hϵ, and ϵτ≤hϵ/8. If Pe≥1, then τ≥c∗h/(2∣b∣), so h2/τ≤(2/c∗)1/2h3/2∣b∣; also ϵ≤∣b∣h/2 and τ<h/(2∣b∣) imply ϵτ≤h3/2∣b∣/(22). Finally hϵ+τb2≤hϵ+h∣b∣τ. These inequalities prove the second estimate with a universal constant depending only on c∗.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

19 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