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

The Kruzhkov doubling inequality for two entropy solutions

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥1, T>0, f∈C1(R;Rn), and let u,v be bounded Kruzhkov entropy solutions on ΠT in the sense of Kruzhkov entropy solutions. Then, in the sense of distributions on ΠT, ∂t∣u−v∣+div⁡x(sgn⁡(u−v)(f(u)−f(v)))≤0. Equivalently, for every nonnegative φ∈Cc∞(ΠT), ∫ΠT(∣u−v∣ φt+sgn⁡(u−v)(f(u)−f(v))⋅∇xφ) dx dt≥0. Here sgn⁡(0)=0. Together with the weak equation this is the doubling-variables inequality from which uniqueness and the local L1 contraction are read off (Distribution, Distributional derivative).

Facts & Assumptions

Given: Countable Choice, n≥1, T>0, f∈C1, bounded entropy solutions u,v on ΠT, a nonnegative test function φ∈Cc∞(ΠT), and nonnegative unit-mass even mollifiers θh on R and ρh on Rn with ∫ρh=1, supp⁡θh⊂(−h,h) and supp⁡ρh⊂Bh (A radial mollifier family in Rn, Convolution of a distribution with a test function).

[F1]

For every k∈R the pair (ηk,qk) with ηk(s)=∣s−k∣, qk(s)=sgn⁡(s−k)(f(s)−f(k)) is a convex entropy pair with qk′=ηk′f′, and each of u,v satisfies the corresponding distributional inequality against every nonnegative test function (Kruzhkov entropy solutions, Convex entropy--entropy flux pairs, Absolute value in an ordered field).

[F2]

Fubini and dominated convergence apply on compact supports (Fubini's theorem for L^1 functions on a sigma-finite product, Dominated convergence). After multiplication by a fixed cutoff, u,v lie in L1(Rn+1) and their translations are norm continuous under Countable Choice (∥τhf−f∥p→0 in Lp(Rn) as h→0, for 1≤p<∞, The Axiom of Countable Choice (ACω), The space Lp(μ) as the quotient by null functions). This is the L1 diagonal interface; distributional mollifier convergence alone would not supply it.

Proof

technique · direct
1.1F2given

The doubled test function. For h>0 smaller than half the distance of the temporal support of φ from {0,T}, set gh(t,x,τ,y)=φ(t+τ2,x+y2)θh(t−τ)ρh(x−y); it is nonnegative and smooth with compact support in each pair of variables, and ∂tgh+∂τgh=(∂tφ)(t+τ2,x+y2)θh(t−τ)ρh(x−y), ∇xgh+∇ygh=(∇φ)(t+τ2,x+y2)θh(t−τ)ρh(x−y).

1.2F2given

The inequality for u with state k=v(τ,y). For almost every (τ,y) the constant k=v(τ,y) is admissible in [F1], and testing the entropy inequality for u by the nonnegative function gh(⋅,⋅,τ,y) gives ∫ΠT(∣u(t,x)−v(τ,y)∣ ∂tgh+sgn⁡(u−v(τ,y))(f(u)−f(v(τ,y)))⋅∇xgh) dx dt≥0; the integrand is bounded by a constant times the compactly supported smooth gh and its derivatives, so the left side is a bounded measurable function of (τ,y).

2.1F2step 1.2

Adding the symmetric inequality. Integrating the inequality of step 1.2 over (τ,y)∈ΠT, and likewise testing the entropy inequality for v with k=u(t,x) and integrating over (t,x), then adding, Fubini's theorem gives 0≤∫ ⁣ ⁣∫ΠT×ΠT[∣u−v∣ (∂tgh+∂τgh)+sgn⁡(u−v)(f(u)−f(v))⋅(∇xgh+∇ygh)]; the two integrals have the same bounded integrand because of the symmetry of gh.

3.1F2step 1.1step 2.1∎

Passing to the diagonal. Put z=(t,x) and z′=(τ,y)=z−h′. On a fixed compact set containing the doubled supports, translation continuity gives ∥v(⋅−h′)−v∥1→0 uniformly for ∣h′∣≤2h. The map Q(a,b)=sgn⁡(a−b)(f(a)−f(b)) is Lipschitz in each variable on the common bounded range: when a variable crosses the other one, split the interval at that point and use Q(b,b)=0 and the flux Lipschitz bound. Hence replacing v(z′) by v(z) changes the doubled integral by at most Csup⁡∣h′∣≤2h∥v(⋅−h′)−v∥1. Replacing Dφ((z+z′)/2) by Dφ(z) has error O(h) by smoothness, boundedness and unit kernel mass. Step 2.1 therefore converges to ∫ΠT(∣u−v∣φt+Q(u,v)⋅∇φ)≥0.

Depends on

Used by

Dependency tree · two levels

48 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