Alphabeta Math
Pipeline-generated
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.

✓ 3 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 1 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Conservative finite-volume weak limits — Examples

1 · Prerequisites

2 · Summary

These examples verify the stationary Burgers shock speed under the Godunov update, exhibit uniformly bounded cell reconstructions with no strongly convergent subsequence, and show a bounded strongly convergent conservative Godunov sequence whose weak limit violates a Kruzhkov entropy inequality. The last scheme uses τ/h=2, outside the usual CFL regime; it does not contradict entropy-convergence results with their stability hypotheses.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passOpen item page →

Godunov finite volumes preserve the Burgers shock speed

Example

For fB(s)=s2/2, use the Godunov flux G of Godunov numerical flux for Burgers' equation on cells of width hm↓0 with τm=hm/2. Let u0(x)=1 for x<0 and u0(x)=−1 for x≥0, with cell-average initialization. The scheme preserves the stationary shock exactly: Ujm,n={1,j<0,−1,j≥0. Its reconstruction is the same stationary weak shock for every m. The Rankine–Hugoniot speed is 0, which is the speed of this limit.

Facts & Assumptions

Given: Burgers' flux fB(s)=s2/2, the Godunov scheme with τm=hm/2, and the Riemann data 1 to the left of zero and −1 to its right.

[F1]

The scheme starts from cell averages and updates each cell by the right-minus-left shared flux difference. (Conservative two-point finite-volume schemes for scalar laws)

[F2]

The state reconstruction is constant with value Ujm,n on Ijm×[tnm,tn+1m). (Piecewise-constant finite-volume state and face-flux reconstructions)

[F3]

G(1,1)=G(1,−1)=G(−1,−1)=1/2, and G is continuous and consistent with fB. (Godunov numerical flux for Burgers' equation, The Burgers Godunov flux is continuous and consistent)

[F4]

A measurable, locally essentially bounded state satisfying the weak identity with the initial boundary term is a locally bounded distributional weak solution. (Locally bounded distributional weak solutions of scalar laws)

[F5]

A one-dimensional shock with distinct traces has speed s=[f]/[u]=(f(u+)−f(u−))/(u+−u−). (The Rankine--Hugoniot jump condition in space--time normal form)

Verification

1.1F1F3given

The cell averages are 1 for j<0 and −1 for j≥0. The only face pairs are (1,1), (1,−1), and (−1,−1); [F3] gives flux 1/2 in all three cases.

2.1F1F3step 1.1algebra

Every cell therefore has equal left and right fluxes at every step, so the update leaves every Ujm,n unchanged. Induction on n gives exactly the stationary step profile displayed in the Example.

3.1F2F4step 2.1givenalgebra

By [F2] and step 2.1, every reconstruction equals u(x,t)=1 for x<0 and u(x,t)=−1 for x≥0 almost everywhere, so Um→u strongly in Lloc1 and ∣u∣≤1. For any φ∈Cc∞(R×(−∞,T)), compact support makes φ vanish near t=T, and u(x,t)=u0(x) for t>0; hence ∫0T∫Ruφt dx dt=−∫Ru0(x)φ(x,0) dx. Also fB(u)=1/2 almost everywhere, so ∫0T∫RfB(u)φx dx dt=0. Thus the weak identity holds, and [F4] gives the claimed local weak solution without an additional choice axiom.

4.1F5step 3.1algebra∎

The traces are u−=1 and u+=−1. Thus [F5] gives s=(fB(−1)−fB(1))/(−1−1)=(1/2−1/2)/(−2)=0, agreeing with the stationary interface.

ExampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

Uniformly bounded cell reconstructions need not have a strong local limit

Example

For k≥1, let hk=2−k and define the bounded cellwise functions Vk(x,t)={(−1)⌊x/hk⌋,0≤x<1,0,x∉[0,1),0<t<1. Then ∣Vk∣≤1, but (Vk) has no strongly Lloc1-convergent subsequence. These are a bounded sequence of cell reconstructions illustrating why a compactness premise is explicit in the weak-limit theorem; they are not asserted to arise from one fixed initial datum or from a stable update.

Facts & Assumptions

Given: The functions Vk in the Statement and the strong-convergence hypothesis of Conservative finite-volume strong-limit theorem.

[F1]

The weak-limit theorem assumes strong Lloc1 convergence of the reconstructions; a uniform bound is not stated as a replacement for it. (Conservative finite-volume strong-limit theorem)

Verification

1.1given

Use the compact rectangle K=[0,1]×[1/4,3/4] inside the space-time domain. Each Vk takes only the values −1,1 on [0,1)×(0,1) and zero outside, so ∣Vk∣≤1 and ∥Vk∥L1(K)=1/2.

1.2givenalgebra

If k<ℓ, every k-cell in [0,1) is the union of 2ℓ−k finer ℓ-cells, an even number. The signs of Vℓ alternate on those finer cells, so their integral on each coarse cell is zero; since Vk is constant on that coarse cell, ∫KVkVℓ=0.

2.1step 1.1step 1.2algebra

For signs a,b∈{−1,1}, ∣a−b∣=1−ab. Thus for k≠ℓ, ∥Vk−Vℓ∥L1(K)=1/2−∫KVkVℓ=1/2. Every subsequence is therefore non-Cauchy in L1(K), so no subsequence can converge strongly in Lloc1.

3.1F1step 2.1∎

This example supplies only a bounded sequence without strong compactness; it makes no finite-volume recurrence claim. Therefore the convergence premise in [F1] remains a separate hypothesis.

CounterexampleConstruction: AI-generatedVerification: AI-generatedprecheck passjudge pass (gpt-6-luna)Open item page →

A conservative consistent finite-volume weak limit need not be entropic

Statement refuted

Conservativity, diagonal flux consistency, local uniform boundedness and strong local L1 convergence alone imply Kruzhkov entropy admissibility.

Facts & Assumptions

Given: The Axiom of Countable Choice ACω, Burgers' flux fB(s)=s2/2, the Godunov finite-volume scheme with τm=2hm↓0, cell-average Riemann data u0(x)=0 for x≤0 and u0(x)=1 for x>0, and the resulting piecewise-constant reconstructions.

[A1]

ACω is the axiom that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F1]

The numerical update is the right-minus-left shared-flux difference and starts from the cell averages of u0. (Conservative two-point finite-volume schemes for scalar laws)

[F2]

The reconstruction equals Ujm,n on Ijm×[tnm,tn+1m). (Piecewise-constant finite-volume state and face-flux reconstructions)

[F3]

For Burgers' flux, G(0,0)=G(0,1)=0 and G(1,1)=1/2; the flux is continuous and diagonal-consistent. (Godunov numerical flux for Burgers' equation, The Burgers Godunov flux is continuous and consistent)

[F4]

Strong local L1 convergence and local uniform state bounds imply that the conservative consistent scheme's limit satisfies the distributional weak identity with the initial boundary term. (Conservative finite-volume strong-limit theorem)

[F5]

A Kruzhkov entropy solution satisfies, for every real k and every nonnegative ψ∈Cc∞(R×(0,T)), ∫0T∫R(ηk(u)ψt+qk(u)ψx) dx dt≥0,ηk(s)=∣s−k∣,qk(s)=sgn⁡(s−k)(fB(s)−fB(k)). (Kruzhkov entropy solutions)

Counterexample

1.1F1F3given

Cell averages of u0 are Ujm,0=0 for j<0 and 1 for j≥0. The only face pairs along the resulting step are (0,0), (0,1) and (1,1); [F3] gives their fluxes as 0,0,1/2. The ratio τm/hm=2, while max⁡0≤s≤1∣fB′(s)∣=1, so the usual noninteraction bound (τm/hm)max⁡∣fB′∣≤1 fails.

2.1F1F3step 1.1algebra

Assume inductively Ujm,n=0 for j<n and 1 for j≥n. If j<n, both face fluxes are 0, so the state remains 0. At j=n, the left flux is 0 and the right flux is 1/2, hence Unm,n+1=1−2(1/2−0)=0. For j>n both fluxes are 1/2, so those states remain 1. Therefore the step shifts to Ujm,n+1=0 for j<n+1 and 1 for j≥n+1.

3.1A1F2F4step 2.1givenalgebra

On [2nhm,2(n+1)hm), the numerical jump is at nhm, while the limit jump is at t/2∈[nhm,(n+1)hm). The profiles differ only on a strip of width at most hm and height 1, so the L1 error on every bounded space-time rectangle is at most hmT′→0. All states are bounded by 1. By [F4], the limit u(x,t)=0 for x<t/2 and 1 for x>t/2 is a locally bounded distributional weak solution with those initial data.

4.1F5step 3.1givenalgebra∎

Take k=1/2. Then ηk(0)=ηk(1)=1/2, while qk(0)=1/8 and qk(1)=3/8. Choose nonnegative α∈Cc∞((0,T)) with ∫α>0 and nonnegative β∈Cc∞(R) with β(0)>0, and set ψ(x,t)=α(t)β(x−t/2). This is an admissible nonnegative test. To evaluate its time term, put B=∫Rβ(y) dy. Differentiating the smooth compactly supported test and changing variables gives ∫Rψt(x,t) dx=Bα′(t)−12α(t)∫Rβ′(y) dy=Bα′(t); the last integral is zero because β is compactly supported. Therefore ∫0T∫Rηk(u)ψt dx dt=12B(α(T)−α(0))=0. Splitting the flux integral at x=t/2 and applying the fundamental theorem of calculus gives ∫Rqk(u)ψx dx=(1/8−3/8)ψ(t/2,t)=−14α(t)β(0). Thus the integral in [F5] equals −14β(0)∫α<0, contradicting the required entropy inequality. The weak limit is not Kruzhkov entropic.

Sources