Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Rankine--Hugoniot alone does not give uniqueness

Statement

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

Let f(u)=12u2 and let the Riemann data be uL=0, uR=1. Then both of the following are weak solutions of the same Cauchy problem: the expansion shock from The expansion shock is weak but not entropic and the rarefaction fan from The Burgers rarefaction Riemann solution, ushock(t,x)={0,x<t/2,1,x>t/2,ufan(t,x)={0,x≤0,x/t,0<x<t,1,x≥t. Only the fan is a Kruzhkov entropy solution (The Riemann solver for a strictly convex flux); the shock violates the entropy inequality. Thus the Rankine--Hugoniot condition and the weak formulation do not by themselves determine the solution, and an entropy selection is indispensable (Kruzhkov entropy solutions, Uniqueness, comparison and order preservation of entropy solutions).

Facts & Assumptions

Given: Countable Choice, the flux f(u)=12u2, the Riemann datum u0=1(0,∞), the expansion-shock profile ushock and the rarefaction fan ufan displayed in the statement.

[F1]

The expansion shock ushock is a distributional weak solution with datum u0: it has left state u−=0, right state u+=1, speed s=12 satisfying Rankine--Hugoniot, and it fails the Kruzhkov entropy inequality (for k=12 the production coefficient is 14>0) (The expansion shock is weak but not entropic).

[F2]

The rarefaction fan ufan is the unique Kruzhkov entropy solution of the same Riemann problem: it is a weak solution, satisfies all Kruzhkov inequalities, and attains the datum in the strong local L1 sense (The Burgers rarefaction Riemann solution, The Riemann solver for a strictly convex flux, The self-similar Riemann problem).

[F3]

The weak formulation admits every distributional weak solution, while the entropy class is unique: two bounded Kruzhkov entropy solutions with the same datum agree almost everywhere (Uniqueness, comparison and order preservation of entropy solutions, Kruzhkov entropy solutions).

Proof

technique · direct
1.1F1F2

Two weak solutions of the same problem. By [F1] the expansion shock is a distributional weak solution with datum u0; by [F2] the rarefaction fan is also a distributional weak solution with the same datum. Both are bounded and piecewise smooth.

2.1F1F2step 1.1

They differ on a set of positive measure. On the open region {(t,x):t>0, t/2<x<t} the shock takes the value 1, while the fan takes the value x/t<1; the region has positive Lebesgue measure, so the two classes differ.

3.1F3step 1.1step 2.1∎

Only the fan is entropic, and the entropy class is unique. The shock fails the Kruzhkov entropy inequality by [F1], so it is not a Kruzhkov entropy solution; the fan is the unique Kruzhkov entropy solution of these data by [F2], and any two bounded Kruzhkov entropy solutions with the same datum coincide almost everywhere by [F3]. Therefore Rankine--Hugoniot and the weak formulation alone determine neither the value of the solution nor its uniqueness, while the entropy condition selects the rarefaction fan and restores uniqueness in the entropy class.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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