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.
Uniqueness, comparison and order preservation of entropy solutions
Statement
Assume Countable Choice (The Axiom of Countable Choice ()) for the analytic prerequisites used below.
Let , and let be (hence Lipschitz on bounded intervals).
(i) If are bounded Kruzhkov entropy solutions on in the sense of Kruzhkov entropy solutions with and almost everywhere, then almost everywhere on .
(ii) There is at most one bounded Kruzhkov entropy solution with a given initial datum ; if almost everywhere on the whole of , then almost everywhere on .
(iii) The positive part contracts: for almost every whenever both sides are finite (Absolute value in an ordered field, The space as the quotient by null functions).
Facts & Assumptions
Given: Countable Choice, , , a flux , bounded Kruzhkov entropy solutions on with common essential bound , and a constant with for .
Entropy solutions are distributional weak solutions: in ; moreover each of has the strong local initial trace: for every compact , as , and likewise for (Kruzhkov entropy solutions).
Kato's inequality: in (The Kruzhkov doubling inequality for two entropy solutions).
Positive-part identities: for every , and for ; at the flux difference is zero, so the flux identity remains valid with , so adding [F1] and [F2] gives in ; writing and , the Lipschitz hypothesis gives almost everywhere, since and is -Lipschitz on (Absolute value in an ordered field).
Cutoff machinery of Local contraction for two entropy solutions: for with and there is a smooth nonincreasing with on and on , and satisfies , is compactly supported in , and is admissible as a test factor on ; for with strong local initial trace and , testing against and letting along a decreasing sequence yields for almost every with ; the argument uses Lebesgue points of , monotone and dominated convergence (Dominated convergence, Monotone convergence for the integral, The space as the quotient by null functions).
Proof
The positive-part inequality. By [F1] and [F2], the sum of the weak equation for and Kato's inequality is the distributional inequality with and by the identities of [F3], and almost everywhere.
Local positive-part estimate. Apply the cutoff computation [F4] to the pair of step 1.1 with any centre and radius : for almost every with . Indeed the structural hypotheses of [F4] are met: the strong local trace of at is because almost everywhere, the positive part being -Lipschitz, and holds by step 1.1; the cutoff, Lebesgue-point, initial-trace and steps are those of the proof of Local contraction for two entropy solutions with replaced by .
Order preservation. Assume almost everywhere, so almost everywhere and the right-hand side of step 2.1 vanishes for every centre and radius. Take centres and radii , , so that for every ; intersecting the countably many full-measure sets of times supplied by step 2.1, for almost every one has for every with , hence almost everywhere on the union . By Fubini, almost everywhere on , that is, almost everywhere.
Uniqueness. If are bounded entropy solutions with the same datum , then both and hold almost everywhere, so step 3.1 gives and almost everywhere on , whence almost everywhere. This proves both assertions of (ii).
Positive-part contraction. Let be any two bounded entropy solutions with both integrals finite; step 2.1 with centre and radii gives for almost every outside a null set . On the complement of the null set , all these inequalities hold, and monotone convergence over the increasing balls gives , which is (iii).
Depends on
- Local $L^1$ contraction for two entropy solutions
- Kruzhkov entropy solutions
- The Kruzhkov doubling inequality for two entropy solutions
- Dominated convergence
- Monotone convergence for the integral
- The space $L^p(\mu)$ as the quotient by null functions
- Absolute value in an ordered field
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
- The L^∞ maximum bound for entropy solutions Corollary
- Rankine--Hugoniot alone does not give uniqueness Counterexample
- The convex-flux Riemann formula fails for a nonconvex flux Counterexample
- Gradient catastrophe before shock formation Example
- Nonconvex Riemann data can require a composite shock--rarefaction wave Example
- Existence of bounded Kruzhkov entropy solutions Theorem
- The entropy solution semigroup on L¹∩ L^∞ Theorem
- The Hamilton--Jacobi correspondence in one dimension Theorem
- The Riemann solver for a strictly convex flux Theorem
Dependency tree · two levels
46 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
- S. N. Kruzhkov, “First order quasilinear equations in several independent variables,” Mat. USSR-Sbornik 10 (1970), 217–243, complete English translation (standard reference, not scraped)
- 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)