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 maximum bound for entropy solutions
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). Let , , let be locally Lipschitz and , and let be a bounded Kruzhkov entropy solution with initial datum . Then, with essential extrema taken with respect to Lebesgue measure, in particular for almost every . For a representative continuous in local , the same bound holds at every : local convergence from times in the full-measure set preserves the range bound (The essential supremum of a measurable function with respect to a measure, The space as the quotient by null functions).
Facts & Assumptions
Given: Countable Choice, , , a locally Lipschitz flux , a bounded Kruzhkov entropy solution on with datum , and the essential bounds , , both finite.
Constant functions on are Kruzhkov entropy solutions with their own constant value as initial datum, for every flux: for the weak equation is the equality , and for every the functions and are constant in , so in distributions; the strong local trace of the constant is the constant , with for every compact (Kruzhkov entropy solutions).
Order preservation: if two bounded Kruzhkov entropy solutions on have and almost everywhere, then almost everywhere on (Uniqueness, comparison and order preservation of entropy solutions).
The cited essential-supremum definition defines using bounds on (The essential supremum of a measurable function with respect to a measure). Here define the signed extrema explicitly by and . Since is essentially bounded on the nonnull space , these are finite. For each integer , the infimum property gives an essential upper bound below , so a.e.; the supremum property similarly gives a.e. Discarding the countable union of exceptional null sets and letting yields a.e. Thus . Conversely every essential absolute bound gives and , so ; taking its infimum proves equality. Inequalities between classes are a.e. (The space as the quotient by null functions). Fubini transfers null sets to spatial slices for a.e. time (Fubini's theorem for L^1 functions on a sigma-finite product).
Proof
Comparison with the constant ceilings and floors. By [F1] the constants and are bounded Kruzhkov entropy solutions. Since almost everywhere and almost everywhere by [F3], choose a finite common bound for , , and . Then [F2] applied to the pairs and gives almost everywhere and almost everywhere on , that is, for almost every .
The almost-everywhere bound. Integrating the pointwise almost-everywhere bound of step 1.1 over spatial slices and using Fubini, for almost every one has for almost every , hence for almost every .
Every time for a continuous representative. Suppose has a representative on continuous into : for and every compact , in . Fix and choose with in the full-measure set of step 2.1. For each ball , the bound preserves the range directly; exhausting by countably many balls, the bound holds for almost every at this time .
Depends on
- Uniqueness, comparison and order preservation of entropy solutions
- Kruzhkov entropy solutions
- The essential supremum of a measurable function with respect to a measure
- The space $L^p(\mu)$ as the quotient by null functions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- Fubini's theorem for L^1 functions on a sigma-finite product
Used by
Dependency tree · two levels
29 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)