Alphabeta Math
ExampleConstruction: AI-generatedVerification: 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.

A first-order Neumann closure limits the global rate

Example

Fix c∈R and consider the mixed-boundary problem −u′′=1 on (0,1), u(0)=0, u′(1)=c. On the grid xj=jh, h=1/(N+1), use the same centered interior stencil as Centered finite differences for the zero-Dirichlet boundary-value problem, but close the right boundary with the first-order backward difference (UN+1−UN)/h=c. The exact solution is u(x)=−x2/2+(c+1)x. This example changes the boundary condition and closure; it makes no claim that the assigned zero-Dirichlet theorem covers Neumann data.

Facts & Assumptions

Given: N≥1, h=1/(N+1), c∈R, the BVP and finite-difference equations in the Example, and the exact sampled values Uˉj=u(xj).

[F1]

Centered finite differences for the zero-Dirichlet boundary-value problem supplies the uniform nodes xj=jh and centered interior operator (−Uj−1+2Uj−Uj+1)/h2; this example replaces its right Dirichlet closure by the stated backward-difference condition.

Verification

1.1givenalgebra

For u(x)=−x2/2+(c+1)x, one has u′′=−1, u(0)=0, and u′(1)=−(1)+(c+1)=c, so u solves the stated mixed-boundary BVP.

1.2givenF1constructalgebra

Put dj=Uj−Uj−1. Each interior equation is equivalent to dj+1=dj−h2, while the boundary closure sets dN+1=hc. Starting from this last difference and applying dj=dj+1+h2 for j=N,…,1 determines every dj; then U0=0 and Uj=Uj−1+dj determine a unique discrete vector.

2.1givenF1step 1.1algebra

The exact quadratic samples satisfy each centered interior equation exactly. Their final backward difference is (UˉN+1−UˉN)/h=u′(1)−hu′′(1)/2=c+h/2, so the boundary difference error for ej:=Uj−Uˉj is eN+1−eN=−h2/2.

3.1step 2.1algebra

Subtracting the identical interior equations gives 2ej−ej−1−ej+1=0, hence the increments ej−ej−1 are constant. Since e0=0 and the final increment is −h2/2 by step 2.1, every increment equals −h2/2, and therefore ej=−jh2/2=−hxj/2 for 0≤j≤N+1.

4.1step 3.1givenalgebra∎

Thus max⁡0≤j≤N+1∣ej∣=h/2. This is not O(h2) as N→∞: such a bound would imply 1/(2h)≤C for all h=1/(N+1), whereas 1/(2h)=(N+1)/2 is unbounded. The first-order boundary closure has reduced the global rate to first order despite the interior stencil being exact on the quadratic solution.

Remarks

The modified problem has a Neumann condition at the right endpoint, so this is a boundary-closure witness rather than a counterexample to the zero-Dirichlet error theorem.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · one level

1 result within one dependency step 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