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

Second-order max-norm error for the centered Dirichlet scheme

Statement

Let u:[0,1]→R have four continuous derivatives, satisfy −u′′=g and u(0)=u(1)=0, and let M≥0 satisfy ∣u(4)(x)∣≤M on [0,1]. For N≥1, set h=1/(N+1), xj=jh, gh=(g(x1),…,g(xN)), and ugrid=(u(x1),…,u(xN)). If vh∈RN has residual ρh:=Ahvh−gh for the scheme of Centered finite differences for the zero-Dirichlet boundary-value problem, then

∥vh−ugrid∥∞≤Mh296+∥ρh∥∞8,

where ∥z∥∞=max⁡1≤j≤N∣zj∣. The justified exact-arithmetic algorithm returns a solution for every admissible input, and its output has ρh=0, so its global max-norm error is at most Mh2/96. The zero Dirichlet boundary closure contributes no additional residual.

Facts & Assumptions

Given: The C4 solution u, data g=−u′′, fourth-derivative bound M, and N≥1 as in the statement.

[F1]

Centered finite differences for the zero-Dirichlet boundary-value problem defines Ah=h−2tridiag⁡(−1,2,−1), fixes U0=UN+1=0, and on success returns a vector satisfying AhU=gh exactly.

[F2]

Discrete maximum principle and uniform inverse bound for the Dirichlet stencil proves that the Thomas recurrence defined in Centered finite differences for the zero-Dirichlet boundary-value problem returns the unique solution of AhU=gh for every admissible exact input, so neither linear-solve-failure branch is reached. It also proves that Ah is invertible and ∥Ah−1r∥∞≤∥r∥∞/8 for every r∈RN.

[F3]

Centered-difference residual bound with exact Dirichlet closure: the exact nodal vector has residual τh=Ahugrid−gh with ∥τh∥∞≤Mh2/12, and the imposed endpoint residuals are zero.

[F4]

The triangle inequality: for real x,y, ∣x+y∣≤∣x∣+∣y∣; the coordinatewise maximum-norm estimate applies this inequality at each coordinate.

Proof

1.1givenF3

Let τh=Ahugrid−gh. By [F3], ∥τh∥∞≤Mh2/12 and the exact endpoint values agree with the imposed endpoint closure, so the endpoint error is zero.

2.1givenF1F2step 1.1algebra

For eh:=vh−ugrid, subtracting the definitions of ρh and τh gives Aheh=ρh−τh. Since Ah is invertible by [F2], eh=Ah−1(ρh−τh).

3.1F2F4step 2.1algebra

By [F2], each coordinate satisfies ∣(eh)j∣≤∥ρh−τh∥∞/8. The coordinatewise triangle inequality [F4] gives ∥ρh−τh∥∞≤∥ρh∥∞+∥τh∥∞, because for each j, ∣ρj−τj∣≤∥ρh∥∞+∥τh∥∞.

4.1F2F3step 1.1step 3.1algebra∎

Substituting the residual bound from [F3] into step 3.1 yields ∥eh∥∞≤∥ρh∥∞/8+Mh2/(8⋅12)=∥ρh∥∞/8+Mh2/96. For the exact algorithm output, [F2] guarantees that the recurrence returns the unique solution and the exact equation check succeeds, so ρh=0; exact endpoint closure was recorded in step 1.1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

8 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