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

The Burgers shock Riemann solution

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) for the analytic prerequisites used below.

Let f(u)=12u2 and let uL>uR. Then the Riemann problem (The self-similar Riemann problem) has the entropy solution u(t,x)={uL,x<st,uR,x>st,s=uL+uR2. Indeed the Rankine--Hugoniot condition at the jump gives s=f(uR)−f(uL)uR−uL=uL+uR2, and the Lax inequalities f′(uR)=uR≤s≤uL=f′(uL) hold because uL>uR; the data are attained in the strong local L1 sense. For example, uL=1, uR=0 gives the shock x=t/2 separating 1 from 0 (The Riemann solver for a strictly convex flux, Kruzhkov entropy solutions).

Facts & Assumptions

Given: Countable Choice, the flux f(u)=12u2, states uL>uR, the single-jump profile u with speed s of the statement, and a test function φ∈Cc∞(ΠT).

[F1]

The strictly convex Riemann solver: for f∈C2 strictly convex with uL>uR the unique Kruzhkov entropy solution of the Riemann problem is the shock with speed s=(f(uR)−f(uL))/(uR−uL); it satisfies the weak conservation law, all Kruzhkov entropy inequalities and the strong local L1 trace (The Riemann solver for a strictly convex flux, The self-similar Riemann problem, Kruzhkov entropy solutions).

[F2]

Rankine--Hugoniot applies to a piecewise C1 weak solution: a nontrivial jump of speed s satisfies s[u]=[f] (The Rankine--Hugoniot jump condition in space--time normal form). For a nontrivial jump satisfying this relation with strictly convex flux, entropy admissibility is equivalent to u−>u+, and an admissible jump obeys f′(u+)≤s≤f′(u−) (The Lax shock inequalities for convex scalar laws, The convex entropy condition for a single shock is the chord condition).

[F3]

For f(u)=12u2 one has f′(u)=u and f′′≡1>0, so f is strictly convex: for a≠b and 0<λ<1, λf(a)+(1−λ)f(b)−f(λa+(1−λ)b)=λ(1−λ)(a−b)2/2>0.

Proof

technique · direct
1.1F1F3algebra

The speed is the chord slope. By [F3], f is C2 and strictly convex, and the given states satisfy uL>uR. The Riemann solver [F1] therefore supplies a weak entropy shock with speed s=(f(uR)−f(uL))/(uR−uL). Since uR−uL≠0, algebra gives s=12(uR2−uL2)/(uR−uL)=12(uL+uR), so this is exactly the profile and speed in the statement.

2.1F2step 1.1

Admissibility. With f′(u)=u, the Lax inequalities read uR=f′(uR)≤s≤f′(uL)=uL, and indeed uR≤12(uL+uR)≤uL because uR≤uL; the jump is compressive and entropy-admissible by [F2]. Alternatively the chord through (uR,12uR2) and (uL,12uL2) lies above the parabola, which is the chord criterion of [F2].

3.1F1step 1.1step 2.1∎

Conclusion via the solver and the initial trace. By [F1] the shock with speed s is the unique Kruzhkov entropy solution of the Riemann problem, so the weak conservation law, all Kruzhkov entropy inequalities and the strong local L1 trace hold. The trace can also be seen directly: the set where u(t,⋅) differs from the step datum u0 is contained in the interval between 0 and st, of length ∣s∣t and amplitude ∣uL−uR∣, so its L1 discrepancy on any compact set is at most ∣uL−uR∣∣s∣t→0. For uL=1, uR=0 the formula gives s=12, so the shock is the ray x=t/2, with state 1 on the left and 0 on the right.

Depends on

Used by

Dependency tree · two levels

32 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