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

Unlimited centered reconstruction creates new extrema on a step

Statement refuted

An unlimited centered-slope reconstruction with the reconstructed upwind forward-Euler update is TVD and range-preserving for every scalar grid sequence whenever ∣a∣Δt/h≤1.

Facts & Assumptions

Given: Cells Ii=[ih,(i+1)h), h=a=1, Δt=1/2, initial averages Ui=1 for i≤−1 and Ui=0 for i≥0, and unlimited centered increments σi=(Ui+1−Ui−1)/2.

[F1]

Finite-volume MUSCL, nodal ENO2 and WENO5 reconstruction conventions: for a>0, the direct update uses Fi+1/2=Ui+σi/2 and Uin+1=Uin−(Δt/h)(Fi+1/2−Fi−1/2).

Counterexample

1.1givenF1algebra

The initial sequence has one jump from 1 to 0, so TV⁡(U0)=1. The centered increments are σ−1=(U0−U−2)/2=−1/2 and σ0=(U1−U−1)/2=−1/2; all other increments vanish.

2.1F1step 1.1algebra

The relevant upwind fluxes are F−3/2=1, F−1/2=3/4, F1/2=−1/4, and F3/2=0. With Δt/h=1/2, the update gives U−11=9/8, U01=1/2, and U11=−1/8, with the adjacent exterior states still 1 and 0.

3.1step 1.1step 2.1algebra∎

The new variation is ∣9/8−1∣+∣1/2−9/8∣+∣−1/8−1/2∣+∣0−(−1/8)∣=3/2>1. The method creates both an overshoot and an undershoot at a CFL number of one half, refuting the statement.

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.