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.
Oleinik's one-sided estimate characterizes bounded entropy solutions
Statement
Assume Countable Choice and Dependent Choice, as used by the mollification and vanishing-viscosity compactness interfaces. Let , , and let be a bounded closed interval with on . Let and let be a distributional weak solution of , with and the essential range of in , and with the strong local initial trace in Kruzhkov entropy solutions. The following are equivalent: (i) is a Kruzhkov entropy solution with that trace; (ii) for almost every and almost every pair , (iii) for almost every , in distributional order. The initial trace and weak equation are hypotheses of the equivalence; the slope bound alone is not a definition of an entropy solution. For piecewise solutions, the bound in particular excludes upward jumps, and the convex chord criterion makes the remaining shocks entropy-admissible. The state-slope constant requires uniform convexity on the solution range.
Facts & Assumptions
Given: Countable and Dependent Choice, , , a bounded closed interval with on , a bounded weak solution with datum , both taking values in , and a nonnegative test function in the arguments below.
The weak equation and the trace: for every , and has the strong local trace ; a Kruzhkov entropy solution is a bounded weak solution satisfying for all , (Kruzhkov entropy solutions).
The viscous construction supplies bounded solutions for fluxes and smooth compactly supported data (The viscous scalar Cauchy problem with smooth data has a global classical solution). Its heat-potential cancellation estimates apply on every positive-time strip (The heat evolution of initial data, Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel). For a smooth flux, these also make classical: satisfies the differentiated divergence equation with source , which is parabolically Hölder by the gradient estimate in the construction. Applying its second-kernel cancellation first gives Hölder ; then the source is Hölder, and the nondifferentiated heat-potential estimate gives locally. Chain and product rules are The chain rule, in one line from Carathéodory: if is differentiable at and is differentiable at , then is differentiable at with and Sums, scalar multiples, products and quotients: , , , and when . Smooth flux regularization is used before this differentiation.
Vanishing viscosity: for each smooth compactly supported datum the viscous solutions have a subsequence converging in and almost everywhere to the unique bounded Kruzhkov entropy solution of that datum, and the entropy inequalities pass to the limit (Existence of bounded Kruzhkov entropy solutions, Vanishing-viscosity families are locally precompact in ).
Local contraction: two bounded Kruzhkov entropy solutions with data in satisfy for almost every with , where is a Lipschitz constant of the (shifted) flux on the common range (Local contraction for two entropy solutions).
Mollification and distributional calculus: convolutions with radial mollifiers are smooth and converge in (or ) to the original function; derivatives may be taken inside the convolution; approximate identities converge in ; distributional derivatives commute with convolution against test functions; almost-everywhere convergence is available along subsequences of -convergent sequences (A radial mollifier family in Rn, A unit-mass smooth bump generates an approximate identity, Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Distributional derivatives commute with test-function convolution, Every approximate identity converges to the identity in for , Convergence in L^1(mu) has an almost-everywhere convergent subsequence, Dominated convergence, Fubini's theorem for L^1 functions on a sigma-finite product, The space as the quotient by null functions).
Piecewise interpretation: at a single shock satisfying the Rankine--Hugoniot condition, the entropy inequalities for all convex pairs hold iff the chord residual satisfies between the states; in particular only compressive jumps are admissible (The convex entropy condition for a single shock is the chord condition).
Proof
Shifting and positive-strip gradient bounds. Fix and put , which contains . Set and Then and on . For a smooth compactly supported datum with values in , apply [F2] to flux and datum , obtaining with values in . The unshifted profile has datum , equals outside a compact set, and solves the equation with normalized flux ; thus the compact datum to which [F2] is applied is , not the generally noncompact function or a nonzero-tail shift. The Oleinik slope is unchanged by adding . Set and . By variation of constants, for , Indeed, differentiating for and using the viscous equation gives ; the integral converges at because . The Gaussian derivative bounds [F2] also give Splitting the spatial integral at and the time integral at in the restarted identity shows that, for every and every , on . Fix , put , and differentiate the restarted identity for , first omitting its final -length of integration and then letting . Since , cancellation gives The range bound and the positive-strip estimates imply . By scaling, which is integrable at ; the first term is bounded by because . Thus This bound is global in space and holds on every positive-time strip.
Equivalence of the pointwise and distributional forms. Fix , assume first that (ii) holds at this , and put , so that for almost every . For set and . If , put . When , cancellation of the overlap gives because the two intervals have equal length and every interior pair , satisfies ; explicitly, by the assumed a.e. pair inequality. When , the intervals and are ordered and have equal length, so since . Thus is nonincreasing and distributionally. Since in as , distributional differentiation passes to the limit, so , which is (iii) at this . Conversely, assume (iii) at some and let be a nonnegative spatial mollifier; then is smooth with , so is nonincreasing and for all ; since in , passing to an almost-everywhere convergent subsequence gives the two-point inequality of (ii) at this for almost every pair. Hence (ii) and (iii) hold for the same full-measure set of times, proving the equivalence.
Mollification commutator. Assume (iii). Fix a nonnegative test function supported in with , and let be a nonnegative unit-mass mollifier on supported in the ball of radius . Extend boundedly to all of by a fixed value in outside , and set , , . By [F5], distributional derivatives commute with convolution, so on a neighbourhood of the support of the identity holds; since the mollification averages only over times , the distributional bound (iii) gives there; and still takes values in . The tangent inequality for convex , averaged against , gives . Finally, localizing and by a cutoff equal to on a slightly larger compact set and applying approximate-identity convergence in [F5] gives , and in on the support of , the last two also using that is Lipschitz on the bounded interval .
A classical barrier after flux regularization. Take smooth normalized converging to in on the compact state interval , with and there (mollify at sufficiently small scales). Choose tending to zero, and let have the fixed smooth datum of step 1.1 and flux . Its range lies in . By [F2], is classical at positive times, is bounded globally on positive strips by step 1.1, and satisfies . Fix , put , and . Where , since . If , choose and , so the same operator applied to is strictly positive. For , is negative at some sufficiently close to , by the positive-strip bound on , and negative on the sides of a sufficiently large rectangle. A positive maximum on that rectangle would have , , , contradicting the strict operator inequality there. Thus . Let and then to get ; integrating in gives . This uses a classical maximum argument, with no Sobolev positive-part test.
The entropy production tends to a nonpositive limit. For any convex and , the chain and product rules applied to give , using and from step 1.3. Tested against the nonnegative , the first term is bounded by after an integration by parts, and the second by ; both tend to as . Since distributionally by [F5] (local convergence of and continuity of ), the limit satisfies for every nonnegative test function supported in .
Passage to the smooth-datum entropy solution. The varying-flux family of step 2.1 satisfies the common range and derivative bounds of the compactness lemma [F3]. Extract a locally and almost-everywhere convergent subsequence. The existence proof passes its weak and entropy identities to the limit because in on the range; the uniform local time modulus supplies the initial trace. Uniqueness identifies the limit as the entropy solution for with this smooth datum. Fubini gives slicewise convergence at almost every time, and passage to the bound in step 2.1, with , gives for almost every time and almost every pair .
Approximation for general data: (i) implies (ii). Now let be the given entropy solution with datum and range in , and fix . For set , where is a nonnegative mollifier of radius : then , its values lie in (a convex combination of values of ), and in . Let be the entropy solution with datum for the flux : by step 3.1 each satisfies the two-point estimate, and by [F4] applied to and , the differences converge to in on every compact cylinder; a diagonal subsequence converges almost everywhere on . Passing the two-point estimate to that almost-everywhere limit proves (ii) for .
Kruzhkov pairs and conclusion of (iii) implies (i). For and put and , so is a smooth convex entropy pair. Step 2.2 gives for every ; letting , and uniformly on the bounded interval by dominated convergence, so the distributional inequality passes to the limit and every Kruzhkov inequality holds. Together with the weak equation and the strong local trace (hypotheses), is a Kruzhkov entropy solution, proving (iii) implies (i); the reverse implication (i) implies (ii) is step 4.1, and the equivalence of (ii) and (iii) is step 1.2.
The piecewise remark. If is piecewise with a single jump at a curve and satisfies the hypotheses, then (ii) forces the right trace not to exceed the left trace across an upward jump: taking , in the two-point inequality and letting gives , so an upward jump is excluded; for the remaining jumps with the Rankine--Hugoniot condition and the chord criterion [F6] make them entropy-admissible. This shows how the slope bound encodes admissibility in the piecewise smooth class, while the equivalence itself was proved for all bounded weak solutions.
Depends on
- Kruzhkov entropy solutions
- The convex entropy condition for a single shock is the chord condition
- The viscous scalar Cauchy problem with smooth data has a global classical solution
- The heat evolution $H_t$ of initial data
- Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel
- Vanishing-viscosity families are locally precompact in $L^1$
- Existence of bounded Kruzhkov entropy solutions
- Local $L^1$ contraction for two entropy solutions
- A radial mollifier family in Rn
- A unit-mass smooth bump generates an $L^1$ approximate identity
- Convolution with a mollifier is smooth, and derivatives pass under the integral sign
- 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)$
- Sums, scalar multiples, products and quotients: $(f+g)'(c) = f'(c) + g'(c)$, $(\alpha f)'(c) = \alpha f'(c)$, $(fg)'(c) = f'(c)g(c) + f(c)g'(c)$, and $(f/g)'(c) = \bigl(f'(c)g(c) - f(c)g'(c)\bigr)/g(c)^{2}$ when $g(c) \ne 0$
- Dominated convergence
- Convergence in L^1(mu) has an almost-everywhere convergent subsequence
- The space $L^p(\mu)$ as the quotient by null functions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Distributional derivatives commute with test-function convolution
- Every $L^1$ approximate identity converges to the identity in $L^p$ for $1 \le p < \infty$
- Fubini's theorem for L^1 functions on a sigma-finite product
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
118 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)
- Alberto Bressan, “Hyperbolic Conservation Laws: An Illustrated Tutorial,” 2009, complete lecture notes (standard reference, not scraped)
- C. De Lellis, F. Otto and M. Westdickenberg, “Minimal entropy conditions for Burgers equation,” complete article (standard reference, not scraped)