Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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 T>0, f∈C2(R), and let I⊂R be a bounded closed interval with f′′≥κ>0 on I. Let u0∈L∞(R) and let u∈L∞((0,T)×R) be a distributional weak solution of ut+∂xf(u)=0, with u0 and the essential range of u in I, and with the strong local L1 initial trace u0 in Kruzhkov entropy solutions. The following are equivalent: (i) u is a Kruzhkov entropy solution with that trace; (ii) for almost every t∈(0,T) and almost every pair x<y, u(t,y)−u(t,x)≤y−xκt; (iii) for almost every t∈(0,T), Dxu(t,⋅)≤(κt)−1L1 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 C1 solutions, the bound in particular excludes upward jumps, and the convex chord criterion makes the remaining shocks entropy-admissible. The state-slope constant 1/κ requires uniform convexity on the solution range.

Facts & Assumptions

Given: Countable and Dependent Choice, T>0, f∈C2(R), a bounded closed interval I with f′′≥κ>0 on I, a bounded weak solution u with datum u0∈L∞, both taking values in I, and a nonnegative test function φ in the arguments below.

[F1]

The weak equation and the trace: ∫ΠT(uφt+f(u)φx)=0 for every φ∈Cc∞(ΠT), and u has the strong local L1 trace u0; a Kruzhkov entropy solution is a bounded weak solution satisfying ∂t∣u−k∣+∂xqk(u)≤0 for all k, qk(s)=sgn⁡(s−k)(f(s)−f(k)) (Kruzhkov entropy solutions).

[F2]

The viscous construction supplies bounded C1,2 solutions for C2 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 Ht of initial data, Normalisation, parabolic scaling, heat equation and derivative bounds for the heat kernel). For a smooth flux, these also make p=vx classical: p satisfies the differentiated divergence equation with source g′(v)p, which is parabolically Hölder by the gradient estimate in the construction. Applying its second-kernel cancellation first gives Hölder px; then the source −g′(v)px−g′′(v)p2 is Hölder, and the nondifferentiated heat-potential estimate gives p∈C1,2 locally. Chain and product rules are The chain rule, in one line from Carathéodory: if g is differentiable at c and f is differentiable at g(c), then f∘g is differentiable at c with (f∘g)′(c)=f′(g(c)) g′(c) and Sums, scalar multiples, products and quotients: (f+g)′(c)=f′(c)+g′(c), (αf)′(c)=αf′(c), (fg)′(c)=f′(c)g(c)+f(c)g′(c), and (f/g)′(c)=(f′(c)g(c)−f(c)g′(c))/g(c)2 when g(c)≠0. Smooth flux regularization is used before this differentiation.

[F3]

Vanishing viscosity: for each smooth compactly supported datum the viscous solutions have a subsequence converging in Lloc1(ΠT) 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 L1).

[F4]

Local contraction: two bounded Kruzhkov entropy solutions with data in Lloc1∩L∞ satisfy ∫B(x0,R−L′t)∣v−w∣≤∫B(x0,R)∣v0−w0∣ for almost every t with L′t<R, where L′ is a Lipschitz constant of the (shifted) flux on the common range (Local L1 contraction for two entropy solutions).

[F5]

Mollification and distributional calculus: convolutions with radial mollifiers are smooth and converge in L1 (or Lloc1) to the original function; derivatives may be taken inside the convolution; approximate identities converge in Lp; distributional derivatives commute with convolution against test functions; almost-everywhere convergence is available along subsequences of L1-convergent sequences (A radial mollifier family in Rn, A unit-mass smooth bump generates an L1 approximate identity, Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Distributional derivatives commute with test-function convolution, Every L1 approximate identity converges to the identity in Lp for 1≤p<∞, 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 Lp(μ) as the quotient by null functions).

[F6]

Piecewise C1 interpretation: at a single shock satisfying the Rankine--Hugoniot condition, the entropy inequalities for all convex C2 pairs hold iff the chord residual F(z)=f(z)−f(u−)−s(z−u−) satisfies F(z)(u+−u−)≥0 between the states; in particular only compressive jumps u−>u+ are admissible (The convex entropy condition for a single shock is the chord condition).

Proof

technique · direct
1.1F2

Shifting and positive-strip gradient bounds. Fix c∈I and put J:=I−c, which contains 0. Set f~(s):=f(s)−f(0) and g(v):=f~(v+c)−f~(c)=f(v+c)−f(c). Then g(0)=0 and g′′≥κ on J. For a smooth compactly supported datum v0s with values in J, apply [F2] to flux g and datum v0s, obtaining vε with values in J. The unshifted profile Uε:=vε+c has datum v0s+c, equals c outside a compact set, and solves the equation with normalized flux f~; thus the compact datum to which [F2] is applied is v0s, not the generally noncompact function v0s+c or a nonzero-tail shift. The Oleinik slope is unchanged by adding c. Set Mv:=∥v0s∥∞ and G0:=sup⁡v∈J∣g′(v)∣<∞. By variation of constants, for 0<d<t, vε(t)=Hε(t−d)vε(d)−∫dt∂xHε(t−s)g(vε(s)) ds. Indeed, differentiating Hε(t−s)vε(s) for d<s<t and using the viscous equation gives −∂xHε(t−s)g(vε(s)); the integral converges at s=t because ∥∂xΓεr∥1≤Cεr−1/2. The Gaussian derivative bounds [F2] also give ∥∂xΓεr(⋅+h)−∂xΓεr∥1≤min⁡(Cεr−1/2,Cε∣h∣r−1),∥∂r∂xΓεr∥1≤Cεr−3/2. Splitting the spatial integral at r=∣h∣2 and the time integral at r=∣t−t′∣ in the restarted identity shows that, for every 0<α<1 and every τ>0, ∣vε(t,x+h)−vε(t,x)∣≤Cτ,T∣h∣α,∣vε(t,x)−vε(t′,x)∣≤Cτ,T∣t−t′∣1/2 on [τ/2,T]×R. Fix τ>0, put d=τ/2, and differentiate the restarted identity for t≥τ, first omitting its final η-length of integration and then letting η↓0. Since ∫∂xxΓεr=0, cancellation gives p(t,x)=∂xHε(t−d)vε(d,x)−∫0t−d∫R∂xxΓεr(z)(g(vε(t−r,x−z))−g(vε(t,x))) dz dr. The range bound and the positive-strip estimates imply ∣g(vε(t−r,x−z))−g(vε(t,x))∣≤G0Cτ,T(∣z∣α+r1/2). By scaling, ∫∣∂xxΓεr(z)∣(∣z∣α+r1/2) dz≤Cε,α(r−1+α/2+r−1/2), which is integrable at r=0; the first term is bounded by Cε,τMv because t−d≥τ/2. Thus sup⁡(t,x)∈[τ,T]×R∣p(t,x)∣<∞. This bound is global in space and holds on every positive-time strip.

1.2F5

Equivalence of the pointwise and distributional forms. Fix t∈(0,T), assume first that (ii) holds at this t, and put w(x)=u(t,x)−x/(κt), so that w(y)≤w(x) for almost every x<y. For n≥1 set a:=1/n and wn(x)=n∫xx+aw(z) dz. If x<x′, put d:=x′−x>0. When d≤a, cancellation of the overlap gives wn(x)−wn(x′)=n(∫xx+dw(z) dz−∫x+ax+a+dw(ζ) dζ)≥0, because the two intervals have equal length d and every interior pair z∈[x,x+d], ζ∈[x+a,x+a+d] satisfies z<ζ; explicitly, d(∫xx+dw−∫x+ax+a+dw)=∫[x,x+d]×[x+a,x+a+d](w(z)−w(ζ)) dz dζ≥0 by the assumed a.e. pair inequality. When d≥a, the intervals [x,x+a] and [x′,x′+a] are ordered and have equal length, so wn(x)−wn(x′)=n(∫xx+aw(z) dz−∫x′x′+aw(ζ) dζ)≥0, since a(∫xx+aw−∫x′x′+aw)=∫[x,x+a]×[x′,x′+a](w(z)−w(ζ)) dz dζ≥0. Thus wn is nonincreasing and Dxwn≤0 distributionally. Since wn→w in Lloc1 as n→∞, distributional differentiation passes to the limit, so Dxw≤0, which is (iii) at this t. Conversely, assume (iii) at some t and let ρδ be a nonnegative spatial mollifier; then wδ=w∗ρδ is smooth with Dxwδ=(Dxw)∗ρδ≤0, so wδ is nonincreasing and wδ(y)≤wδ(x) for all x<y; since wδ→w in Lloc1, passing to an almost-everywhere convergent subsequence gives the two-point inequality of (ii) at this t for almost every pair. Hence (ii) and (iii) hold for the same full-measure set of times, proving the equivalence.

1.3F5

Mollification commutator. Assume (iii). Fix a nonnegative test function φ supported in [a,b]×[−R,R] with 0<a<b<T, and let ρδ be a nonnegative unit-mass mollifier on R2 supported in the ball of radius δ<12min⁡{a,T−b}. Extend u boundedly to all of R2 by a fixed value in I outside (0,T)×R, and set uδ=u∗ρδ, Fδ=f(u)∗ρδ, rδ=f(uδ)−Fδ. By [F5], distributional derivatives commute with convolution, so on a neighbourhood of the support of φ the identity ∂tuδ+∂xFδ=0 holds; since the mollification averages only over times ≥a−δ>a/2, the distributional bound (iii) gives ∂xuδ≤2/(κa) there; and uδ still takes values in I. The tangent inequality f(s)≥f(uδ)+f′(uδ)(s−uδ) for convex f, averaged against ρδ, gives rδ≤0. Finally, localizing u and f(u) by a cutoff equal to 1 on a slightly larger compact set and applying approximate-identity convergence in L1 [F5] gives uδ→u, Fδ→f(u) and rδ→0 in L1 on the support of φ, the last two also using that f is Lipschitz on the bounded interval I.

2.1F2F5step 1.1

A classical barrier after flux regularization. Take smooth normalized gl converging to g in C2 on the compact state interval J, with gl(0)=0 and gl′′≥κl:=κ−1/l>0 there (mollify g at sufficiently small scales). Choose 0<εl≤1 tending to zero, and let vl have the fixed smooth datum of step 1.1 and flux gl. Its range lies in J. By [F2], p=vxl is classical at positive times, is bounded globally on positive strips by step 1.1, and satisfies pt+gl′(vl)px+gl′′(vl)p2=εlpxx. Fix τ>0, put q(t)=1/(κl(t−τ)), b=gl′(vl) and W=p−q. Where W>0, (∂t+b∂x−εl∂xx)W<0 since p>q>0. If Gl=sup⁡J∣gl′∣, choose A>Gl+2εl and Φ=eA(t−τ)(1+x2), so the same operator applied to Φ is strictly positive. For ρ>0, Z=W−ρΦ is negative at some t0>τ sufficiently close to τ, by the positive-strip bound on p, and negative on the sides of a sufficiently large rectangle. A positive maximum on that rectangle would have Zt≥0, Zx=0, Zxx≤0, contradicting the strict operator inequality there. Thus Z≤0. Let ρ↓0 and then τ↓0 to get vxl≤1/(κlt); integrating in x gives vl(t,y)−vl(t,x)≤(y−x)/(κlt). This uses a classical maximum argument, with no Sobolev positive-part test.

2.2F5step 1.3

The entropy production tends to a nonpositive limit. For any convex η∈C2 and q′=η′f′, the chain and product rules applied to ∂tuδ+∂x(f(uδ)−rδ)=0 give ∂tη(uδ)+∂xq(uδ)=∂x(η′(uδ)rδ)−η′′(uδ)(∂xuδ)rδ≤∂x(η′(uδ)rδ)+2∥η′′∥L∞(I)κa(−rδ), using rδ≤0 and ∂xuδ≤2/(κa) from step 1.3. Tested against the nonnegative φ, the first term is bounded by ∥η′∥L∞(I)∥φx∥∞∥rδ∥L1(supp⁡φ) after an integration by parts, and the second by 2∥η′′∥∞κa∥φ∥∞∥rδ∥L1(supp⁡φ); both tend to 0 as δ↓0. Since ∂tη(uδ)+∂xq(uδ)→∂tη(u)+∂xq(u) distributionally by [F5] (local L1 convergence of uδ and continuity of η,q), the limit satisfies ⟨∂tη(u)+∂xq(u),φ⟩≤0 for every nonnegative test function supported in (0,T)×R.

3.1F3F4F5step 2.1

Passage to the smooth-datum entropy solution. The varying-flux family vl of step 2.1 satisfies the common range and derivative bounds of the compactness lemma [F3]. Extract a locally L1 and almost-everywhere convergent subsequence. The existence proof passes its weak and entropy identities to the limit because gl→g in C1 on the range; the uniform local time modulus supplies the initial trace. Uniqueness identifies the limit as the entropy solution v for g with this smooth datum. Fubini gives slicewise convergence at almost every time, and passage to the bound in step 2.1, with κl→κ, gives v(t,y)−v(t,x)≤(y−x)/(κt) for almost every time and almost every pair x<y.

4.1F4F5step 3.1

Approximation for general data: (i) implies (ii). Now let u be the given entropy solution with datum u0 and range in I, and fix c∈I. For j≥1 set wj=((u0−c)1[−j,j])∗ρδj, where ρδj is a nonnegative mollifier of radius δj↓0: then wj∈Cc∞, its values lie in I−c (a convex combination of values of u0−c), and wj→u0−c in Lloc1(R). Let vj be the entropy solution with datum wj for the flux g: by step 3.1 each vj satisfies the two-point estimate, and by [F4] applied to vj and u~=u−c, the differences converge to 0 in L1 on every compact cylinder; a diagonal subsequence converges almost everywhere on ΠT. Passing the two-point estimate to that almost-everywhere limit proves (ii) for u.

5.1F1F5step 4.1step 1.2step 2.2

Kruzhkov pairs and conclusion of (iii) implies (i). For k∈R and m≥1 put ηm(s)=(s−k)2+m−2 and qm(s)=∫ksηm′(z)f′(z) dz, so (ηm,qm) is a smooth convex entropy pair. Step 2.2 gives ∂tηm(u)+∂xqm(u)≤0 for every m; letting m→∞, ηm→∣s−k∣ and qm→sgn⁡(s−k)(f(s)−f(k)) uniformly on the bounded interval I 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 L1 trace (hypotheses), u 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.

6.1F6step 4.1step 1.2step 5.1∎

The piecewise C1 remark. If u is piecewise C1 with a single jump at a curve x=s(t) and satisfies the hypotheses, then (ii) forces the right trace not to exceed the left trace across an upward jump: taking x↑s(t), y↓s(t) in the two-point inequality and letting x,y→s(t) gives u+−u−≤0, so an upward jump u+>u− is excluded; for the remaining jumps with u−>u+ 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

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