Alphabeta Math
CorollaryStatement: 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.

Uniqueness, comparison and order preservation of entropy solutions

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) for the analytic prerequisites used below.

Let n≥1, T>0 and let f ⁣:R→Rn be C1 (hence Lipschitz on bounded intervals).

(i) If u,v are bounded Kruzhkov entropy solutions on ΠT in the sense of Kruzhkov entropy solutions with ∣u∣,∣v∣≤M and u0≤v0 almost everywhere, then u≤v almost everywhere on ΠT.

(ii) There is at most one bounded Kruzhkov entropy solution with a given initial datum u0∈L∞∩Lloc1; if u0=v0 almost everywhere on the whole of Rn, then u=v almost everywhere on ΠT.

(iii) The positive part contracts: ∫Rn(u(t,⋅)−v(t,⋅))+ dx≤∫Rn(u0−v0)+ dx for almost every t∈(0,T) whenever both sides are finite (Absolute value in an ordered field, The space Lp(μ) as the quotient by null functions).

Facts & Assumptions

Given: Countable Choice, n≥1, T>0, a C1 flux f, bounded Kruzhkov entropy solutions u,v on ΠT with common essential bound M, and a constant L≥0 with ∣f(a)−f(b)∣≤L∣a−b∣ for a,b∈[−M,M].

[F1]

Entropy solutions are distributional weak solutions: ∂t(u−v)+div⁡x(f(u)−f(v))=0 in D′(ΠT); moreover each of u,v has the strong local L1 initial trace: for every compact K⊆Rn, ess sup⁡0<t<δ∫K∣u(t,x)−u0(x)∣ dx→0 as δ↓0, and likewise for v (Kruzhkov entropy solutions).

[F2]

Kato's inequality: ∂t∣u−v∣+div⁡x(sgn⁡(u−v)(f(u)−f(v)))≤0 in D′(ΠT) (The Kruzhkov doubling inequality for two entropy solutions).

[F3]

Positive-part identities: for every r∈R, (r)+=12(∣r∣+r) and 1{r>0}=12(sgn⁡(r)+1) for r≠0; at u=v the flux difference is zero, so the flux identity remains valid with sgn⁡(0)=0, so adding [F1] and [F2] gives ∂t(u−v)++div⁡x(1{u>v}(f(u)−f(v)))≤0 in D′(ΠT); writing w=(u−v)+ and q=1{u>v}(f(u)−f(v)), the Lipschitz hypothesis gives ∣q∣≤Lw almost everywhere, since ∣u∣,∣v∣≤M and f is L-Lipschitz on [−M,M] (Absolute value in an ordered field).

[F4]

Cutoff machinery of Local L1 contraction for two entropy solutions: for t3∈(0,T) with Lt3<R and 0<σ<R−Lt3 there is a smooth nonincreasing βσ with βσ=1 on (−∞,R−σ] and βσ=0 on [R,∞), and Φσ(t,x)=βσ(∣x−x0∣+Lt) satisfies ∂tΦσ+L∣∇xΦσ∣=0, is compactly supported in x, and is admissible as a test factor on (0,t3); for w≥0 with strong local L1 initial trace w0 and ∣q∣≤Lw, testing ∂tw+div⁡xq≤0 against ηΦσ and letting σ↓0 along a decreasing sequence yields ∫B(x0,R−Lt)w(t,x) dx≤∫B(x0,R)w0(x) dx for almost every t∈(0,T) with Lt<R; the argument uses Lebesgue points of t↦∫wΦσ, monotone and dominated convergence (Dominated convergence, Monotone convergence for the integral, The space Lp(μ) as the quotient by null functions).

Proof

technique · direct
1.1F1F2F3

The positive-part inequality. By [F1] and [F2], the sum of the weak equation for (u−v) and Kato's inequality is the distributional inequality ∂tw+div⁡xq≤0 with w=(u−v)+ and q=1{u>v}(f(u)−f(v)) by the identities of [F3], and ∣q∣≤Lw almost everywhere.

2.1F4step 1.1

Local positive-part estimate. Apply the cutoff computation [F4] to the pair (w,q) of step 1.1 with any centre x0 and radius R: ∫B(x0,R−Lt)(u−v)+(t,x) dx≤∫B(x0,R)(u0−v0)+(x) dx for almost every t∈(0,T) with Lt<R. Indeed the structural hypotheses of [F4] are met: the strong local L1 trace of w at 0 is w0=(u0−v0)+ because ∣w(t,x)−w0(x)∣≤∣u(t,x)−u0(x)∣+∣v(t,x)−v0(x)∣ almost everywhere, the positive part being 1-Lipschitz, and ∣q∣≤Lw holds by step 1.1; the cutoff, Lebesgue-point, initial-trace and σ↓0 steps are those of the proof of Local L1 contraction for two entropy solutions with ∣u−v∣ replaced by (u−v)+.

3.1F4step 2.1

Order preservation. Assume u0≤v0 almost everywhere, so (u0−v0)+=0 almost everywhere and the right-hand side of step 2.1 vanishes for every centre and radius. Take centres x0=0 and radii Rm=LT+m, m≥1, so that B(0,Rm−Lt)⊇B(0,m−LT) for every t∈(0,T); intersecting the countably many full-measure sets of times supplied by step 2.1, for almost every t∈(0,T) one has ∫B(0,m−LT)(u−v)+(t,x) dx=0 for every m with m>LT, hence (u−v)+(t,⋅)=0 almost everywhere on the union ⋃mB(0,m−LT)=Rn. By Fubini, (u−v)+=0 almost everywhere on ΠT, that is, u≤v almost everywhere.

4.1step 3.1

Uniqueness. If u,v are bounded entropy solutions with the same datum u0=v0, then both u0≤v0 and v0≤u0 hold almost everywhere, so step 3.1 gives u≤v and v≤u almost everywhere on ΠT, whence u=v almost everywhere. This proves both assertions of (ii).

5.1F4step 2.1∎

Positive-part contraction. Let u,v be any two bounded entropy solutions with both integrals finite; step 2.1 with centre 0 and radii Rm=LT+m gives ∫B(0,Rm−Lt)(u−v)+≤∫B(0,Rm)(u0−v0)+≤∫Rn(u0−v0)+<∞ for almost every t outside a null set Nm. On the complement of the null set ⋃mNm, all these inequalities hold, and monotone convergence over the increasing balls B(0,Rm−Lt)↑Rn gives ∫Rn(u(t,⋅)−v(t,⋅))+ dx≤∫Rn(u0−v0)+ dx, which is (iii).

Depends on

Used by

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