Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

Burgers Godunov flux under the invariant-interval CFL bound

Example

Assume ACω, and also assume Dependent Choice DC if u0∈L1(R). Let fB(s)=s2/2 and use the Godunov flux G of Godunov numerical flux for Burgers' equation. For every compact invariant interval I⊆[−M,M] with M>0, the two coordinate Lipschitz bounds can be taken to be L1=L2=M, and G is nondecreasing in its first argument and nonincreasing in its second. Therefore, for any u0∈BVb(R) with values in I, every mesh family satisfying τmhm≤12M,τmhm≥c∗>0,hm,τm→0 falls under Strong entropy convergence of monotone finite-volume schemes and converges strongly locally to the unique Burgers entropy solution.

Facts & Assumptions

Given: ACω, fB(s)=s2/2, a compact interval I⊆[−M,M] with M>0, bounded BV data u0 in I, the Godunov flux G, and λ=τ/h; additionally assume DC when u0∈L1(R).

[F1]

The Godunov flux has the listed increasing-state and decreasing-state branches (Godunov numerical flux for Burgers' equation).

[F2]

G is continuous and consistent: G(a,a)=fB(a) (The Burgers Godunov flux is continuous and consistent).

[F3]

Data in BVb(R) have finite translation variation and are locally integrable equivalence classes (Bounded BV data on the real line).

[F4]

Under ACω, and with DC additionally when u0∈L1(R), if F is locally Lipschitz, consistent and coordinatewise monotone on the data range, and λ(L1+L2)≤1 with positive lower λ, the corresponding finite-volume reconstructions converge strongly locally to the unique entropy solution (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, Strong entropy convergence of monotone finite-volume schemes).

Verification

1.1F1F2givenalgebra

Fix b∈[−M,M]. On each branch in [F1], the function a↦G(a,b) is either constant, a2/2, or max⁡{a2,b2}/2. It is nondecreasing: when a≤b, the active values are b2/2 on the negative-negative branch, 0 on the crossing branch, and a2/2 on the nonnegative branch; when b<a, the maximum is constant while ∣a∣≤∣b∣ and increases as a2/2 once a is the larger positive magnitude. The branch values agree at their boundaries by [F2], so the monotonicity persists across each switch.

1.2F1F2algebra

Fix a∈[−M,M]. On the branches of [F1], b↦G(a,b) is either constant, b2/2 for b≤0, or max⁡{a2,b2}/2 on b<a. As b increases, b2/2 decreases on the negative axis; on b<a, the maximum decreases while ∣b∣>∣a∣ and is constant after ∣b∣≤∣a∣; the remaining a≤b branches are constant or decrease to zero. Boundary values agree by [F2]. Hence G(a,⋅) is nonincreasing.

1.3F1F2algebra

On every smooth branch the derivative in the varying coordinate has absolute value at most R on [−R,R]2. The maximum branch has the same bound because max⁡{a2,b2}/2 is piecewise one of the two square branches. The finite branch partition and continuity from [F2] therefore give coordinate Lipschitz bounds R on every compact square [−R,R]2, proving that G is locally Lipschitz on R2. Applying the same estimate with R=M gives coordinate Lipschitz bounds L1=L2=M on the target square. Consistency is [F2], so the full CFL bound is λ(L1+L2)=2Mλ≤1.

2.1F3F4step 1.1step 1.2step 1.3given∎

The hypotheses of [F4] now hold for every stated family: the data are bounded BV by [F3], the flux is locally Lipschitz, monotone and consistent by steps 1.1–1.3, the full CFL bound holds, and the mesh ratio has the required positive lower bound. Thus the reconstructions converge strongly in local L1 to the unique entropy solution.

Depends on

Used by

Dependency tree · two levels

34 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