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 expansion shock is weak but not entropic
Statement
Assume Countable Choice (The Axiom of Countable Choice ()) for the analytic prerequisites used below.
Let and let the Riemann data be for and for . The increasing-state jump with left state , right state , and speed is It is a distributional weak solution with those data because the Rankine--Hugoniot condition holds. It is not a Kruzhkov entropy solution: for the convex entropy with flux , the jump production is . It also fails the Kruzhkov test : , , and , so . For the same Riemann data, The Burgers rarefaction Riemann solution gives an entropy solution, so the Rankine--Hugoniot condition alone admits both the expansion shock and the entropy rarefaction (The Rankine--Hugoniot jump condition in space--time normal form, Kruzhkov entropy solutions, Distributional weak solutions of the Cauchy problem).
Facts & Assumptions
Given: Countable Choice, the flux , the Riemann datum , the expansion-shock profile with speed , and a test function .
Interface computation: for a single jump with traces on the left and on the right of the ray , the weak residual against a test concentrated near the ray is proportional to with ; the Rankine--Hugoniot condition makes it vanish, so a jump profile with that condition is a distributional weak solution (The Rankine--Hugoniot jump condition in space--time normal form, Distributional weak solutions of the Cauchy problem).
Entropy production at a jump: for an entropy pair the distribution equals , so the entropy inequality holds iff ; this is the general chord condition, and for the Kruzhkov pairs , the same test applies (The convex entropy condition for a single shock is the chord condition, Kruzhkov entropy solutions, Convex entropy--entropy flux pairs).
For the same Riemann data the Burgers rarefaction for , for , for is the entropy solution (The Burgers rarefaction Riemann solution).
Proof
The shock is a weak solution. With , : and , so satisfies . By [F1] the interface coefficient of the weak residual vanishes, so is a distributional weak solution of with datum ; the strong local trace is immediate because equals the step datum except on the interval of length .
Failure of the convex entropy inequality. Take and , so that and is a convex entropy pair. The jump coefficients are and , so by [F2] the entropy production is . The entropy inequality fails strictly at the jump.
Failure in the Kruzhkov family. For , , so ; and gives and , so . Hence , directly violating a Kruzhkov entropy inequality that every entropy solution must satisfy. Equivalently, the chord through and lies above the convex parabola, so the one-sided chord condition of [F2] fails for the upward jump .
Conclusion. The expansion shock is a distributional weak solution with the prescribed data but fails the entropy condition, while the rarefaction of [F3] is the entropy solution of the same Riemann problem. Thus the Rankine--Hugoniot condition and the weak formulation alone admit non-entropic solutions, and an entropy selection principle is needed.
Depends on
- The Rankine--Hugoniot jump condition in space--time normal form
- Kruzhkov entropy solutions
- The convex entropy condition for a single shock is the chord condition
- Convex entropy--entropy flux pairs
- The Burgers rarefaction Riemann solution
- Distributional weak solutions of the Cauchy problem
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Rankine--Hugoniot alone does not give uniqueness Counterexample
Dependency tree · two levels
33 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
- G. A. Chechkin and A. Yu. Goritsky (translated by B. Andreianov), “S. N. Kruzhkov’s lectures on first-order quasilinear PDEs,” in Analytical and Numerical Aspects of PDEs, de Gruyter 2009, complete lecture-notes text (standard reference, not scraped)
- Victor Ivrii, Partial Differential Equations, University of Toronto, current complete 415-page PDF (standard reference, not scraped)