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 rarefaction Riemann solution
Statement
Assume Countable Choice (The Axiom of Countable Choice ()) for the analytic prerequisites used below.
Let and . Then the entropy solution of the Riemann problem (The self-similar Riemann problem) is the centred rarefaction The middle branch satisfies , the outer branches are constant, and the values match continuously across the rays and . For every the profile is locally Lipschitz in (on the fan ); thus the chain rule gives zero distributional production for every convex entropy pair on . The solution attains the Riemann data in the strong local sense as . For , , the fan is on (The Riemann solver for a strictly convex flux, Kruzhkov entropy solutions).
Facts & Assumptions
Given: Countable Choice, the flux , states , the centred rarefaction profile of the statement, and a test function .
The strictly convex Riemann solver: for strictly convex with , the unique Kruzhkov entropy solution of the Riemann problem is the centred rarefaction for , for , and for ; it satisfies the weak conservation law, all Kruzhkov entropy inequalities and the strong local initial trace (The Riemann solver for a strictly convex flux, Kruzhkov entropy solutions, The self-similar Riemann problem).
For one has and , so is strictly convex with for all (directly, the Jensen gap for is , positive for and ).
Calculus on the self-similar profile: the chain rule computes and for ; a continuous piecewise profile with equal traces across an interface produces no interface term in the weak or entropy residual, since the traces of , , and of , for continuous pairs coincide from both sides (The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with ).
Proof
Specialisation of the solver. By [F2], and ; the three branches of the strictly convex Riemann solver [F1] read for , for , and for , which is exactly the displayed centred rarefaction. Hence by [F1] it is the unique Kruzhkov entropy solution of the Riemann problem, satisfies the weak conservation law, all Kruzhkov entropy inequalities, and attains the Riemann datum in the strong local sense.
Direct check of the middle branch and the interfaces. On the fan, , so , and by the chain rule [F3]; on the two outer regions is constant, so both derivatives vanish there. At the three-branch formula gives from both the first and middle branches, and at it gives from both the middle and last branches; the traces of and of therefore agree across the rays, so by [F3] no interface terms arise in the weak residual and the profile is a distributional weak solution.
Entropy production and regularity. For any convex pair with , the chain rule gives on each smooth branch; this vanishes on the fan by step 1.2 and on the outer branches because is constant. Across the rays the traces of and agree because is continuous there, so no interface measure arises: the entropy production is identically on for every convex pair. (For the non-smooth Kruzhkov pairs, the entropy inequalities are supplied by the solver [F1].) On the fan , so the profile is locally Lipschitz on every compact subset of the open strip ; no uniform Lipschitz bound as is claimed.
Initial trace and the special case. The discrepancy from the initial step is supported between and , and is bounded by . Thus . When , , the fan is on , with outer states and . For nonsmooth convex pairs, smooth convex approximation and uniform convergence of the integral fluxes pass the zero-production identity of step 2.1 to the limit; thus production is zero, not merely nonpositive.
Depends on
- The self-similar Riemann problem
- The Riemann solver for a strictly convex flux
- Kruzhkov entropy solutions
- The chain rule, in one line from Carathéodory: if $g$ is differentiable at $c$ and $f$ is differentiable at $g(c)$, then $f \circ g$ is differentiable at $c$ with $(f \circ g)'(c) = f'(g(c))\,g'(c)$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- Rankine--Hugoniot alone does not give uniqueness Counterexample
- The expansion shock is weak but not entropic Counterexample
- The Hamilton--Jacobi primitive of a Burgers solution Example
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)