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.

Local L1 contraction for two entropy solutions

Statement

Assume Countable Choice. Let n≥1, T>0, and f ⁣:R→Rn be C1. Let M,L≥0 and assume ∣f(a)−f(b)∣≤L∣a−b∣ for all a,b∈[−M,M]. Let u,v be bounded Kruzhkov entropy solutions on ΠT in the sense of Kruzhkov entropy solutions, with ∣u∣,∣v∣≤M almost everywhere and initial data u0,v0∈L∞∩Lloc1. For each fixed x0∈Rn and R>0, for almost every t∈(0,T) satisfying Lt<R, ∫B(x0,R−Lt)∣u(t,x)−v(t,x)∣ dx≤∫B(x0,R)∣u0(x)−v0(x)∣ dx. In particular, for each fixed x0,R, if u0=v0 almost everywhere on B(x0,R), then u(t,⋅)=v(t,⋅) almost everywhere on B(x0,R−Lt) for almost every t with Lt<R. The exceptional null set may depend on x0 and R.

Facts & Assumptions

Given: n≥1, T>0, f∈C1(R;Rn), constants M,L≥0 with ∣f(a)−f(b)∣≤L∣a−b∣ on [−M,M], bounded Kruzhkov entropy solutions u,v on ΠT with ∣u∣,∣v∣≤M almost everywhere and initial data u0,v0∈L∞∩Lloc1(Rn), a centre x0∈Rn and radius R>0, and the abbreviations w=∣u−v∣, q=sgn⁡(u−v)(f(u)−f(v)).

[F1]

Kato's inequality: for every nonnegative φ∈Cc∞(ΠT), ∫ΠT(w φt+q⋅∇xφ) dx dt≥0. Since ∣u∣,∣v∣≤M almost everywhere and f is L-Lipschitz on [−M,M], also ∣q∣≤Lw almost everywhere (The Kruzhkov doubling inequality for two entropy solutions, Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction, Kruzhkov entropy solutions).

[F2]

Strong local L1 initial traces: for every compact K⊆Rn, lim⁡δ↓0ess sup⁡0<t<δ∫K∣u(t,x)−u0(x)∣ dx=0, and the same holds for v and v0 (Kruzhkov entropy solutions).

[F3]

Cutoff profiles: for every σ>0 there is a smooth nonincreasing βσ ⁣:R→[0,1] with βσ=1 on (−∞,R−σ] and βσ=0 on [R,∞), obtained by integrating a nonnegative smooth bump supported in (R−σ,R); then βσ′≤0 and Φσ(t,x)=βσ(∣x−x0∣+Lt) satisfies ∂tΦσ+L∣∇xΦσ∣=0 on the region where ∣x−x0∣+Lt>R−σ, and Φσ=1 on the region where ∣x−x0∣+Lt≤R−σ; hence Φσ is smooth on the slab 0<t<t3 whenever Lt3<R−σ, has compact spatial support contained in B(x0,R), and vanishes identically for t≥R/L if L>0 (A Euclidean bump for a compact set inside an open set, Open ball, closed ball and sphere in a metric space).

[F4]

Slice functions: Fσ(t)=∫Rnw(t,x)Φσ(t,x) dx is well defined for almost every t and locally integrable on its interval of definition, because w is bounded and Φσ is bounded with compact spatial support; hence almost every point is a Lebesgue point of Fσ, and the intersection of countably many full-measure sets is again full measure. Dominated and monotone convergence justify limits of integrals with uniformly bounded integrands against fixed integrable functions (Lebesgue differentiation theorem on Rn, Dominated convergence, The space Lp(μ) as the quotient by null functions, The Axiom of Countable Choice (ACω)).

Proof

technique · direct
1.1F1F3F4

Cutoff inequalities on a time slab. Fix t3∈(0,T) with Lt3<R — for L>0 such t3 exist by taking t3<min⁡{T,R/L}, and for L=0 every t3∈(0,T) works — and fix σ∈(0,R−Lt3). Let Φσ be as in [F3] and set Fσ(t)=∫Rnw(t,x)Φσ(t,x) dx and Gσ(t)=∫Rn(w ∂tΦσ+q⋅∇xΦσ)(t,x) dx for t∈(0,t3). Because βσ′≤0 and [F3] holds, Gσ≤∫Rnw(∂tΦσ+L∣∇xΦσ∣) dx=0 by [F1]. For nonnegative η∈Cc∞((0,t3)) the function φ=ηΦσ is an admissible nonnegative test function in [F1], since Φσ is smooth on the slab and compactly supported in x; hence 0≤∫0t3(Fση′+Gση)≤∫0t3Fση′, that is, ∫0t3Fση′≥0.

2.1F4step 1.1

Monotonicity in time. Fix a nonnegative smooth bump ζ supported in (0,1) with ∫01ζ=1 and put H(r)=∫−∞rζ. For 0<s<t<t3 and small ε>0, the function ηε(τ)=H(τ−sε)−H(τ−tε) is admissible in step 1.1 and ηε′→δs−δt as ε↓0. At Lebesgue points s<t of Fσ, step 1.1 gives Fσ(s)−Fσ(t)=lim⁡ε↓0∫0t3Fσηε′≥0, so Fσ(s)≥Fσ(t) for all Lebesgue points 0<s<t<t3 of Fσ, a full-measure set of pairs by [F4].

3.1F2F4step 2.1

The limit as s↓0. We claim ess lim⁡s↓0Fσ(s)=∫Rn∣u0(x)−v0(x)∣ βσ(∣x−x0∣) dx. Indeed, the difference is bounded by ∫B(x0,R)∣u(s)−u0∣ βσ+∫B(x0,R)∣v(s)−v0∣ βσ+∫Rn∣u0−v0∣ ∣βσ(∣x−x0∣+Ls)−βσ(∣x−x0∣)∣; the first two terms tend to 0 by [F2], since βσ is supported in B(x0,R), and the third tends to 0 because βσ has bounded derivative and ∣u0−v0∣∈Lloc1. Combining with step 2.1 and letting s↓0 through Lebesgue points of Fσ, for almost every t∈(0,t3), Fσ(t)≤∫Rn∣u0−v0∣ βσ(∣x−x0∣) dx.

4.1F4step 3.1∎

Removing the cutoff. Let σj↓0 with σj<R−Lt3 and intersect the full-measure sets of step 3.1 over all j using [F4]: for almost every t∈(0,t3) the inequality of step 3.1 with σ=σj holds for every j. For such t, βσj(∣x−x0∣+Lt)→1{∣x−x0∣<R−Lt}(x) pointwise away from the sphere ∣x−x0∣=R−Lt, and the corresponding integrands are dominated by w(t,⋅)1B(x0,R) respectively ∣u0−v0∣1B(x0,R), which are integrable; hence dominated convergence gives ∫B(x0,R−Lt)∣u−v∣(t,x) dx≤∫B(x0,R)∣u0−v0∣(x) dx. Every t∈(0,T) with Lt<R lies in (0,t3) for some admissible t3 — put H=min⁡{T,R/L} for L>0, and H=T for L=0, and use the explicit sequence t3(j)=H(1−1/(j+1))↑H — so the estimate holds for almost every such t, with exceptional set depending on x0,R. If u0=v0 almost everywhere on B(x0,R) the right-hand side vanishes, so u(t,⋅)=v(t,⋅) almost everywhere on B(x0,R−Lt) for almost every such t.

Depends on

Used by

Dependency tree · two levels

56 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