Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 L∞ maximum bound for entropy solutions

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let n≥1, T>0, let f be locally Lipschitz and C1, and let u be a bounded Kruzhkov entropy solution with initial datum u0∈L∞. Then, with essential extrema taken with respect to Lebesgue measure, ess inf⁡Rnu0 ≤ u(t,x) ≤ ess sup⁡Rnu0for a.e. (t,x)∈ΠT; in particular ∥u(t,⋅)∥∞≤∥u0∥∞ for almost every t. For a representative continuous in local L1, the same bound holds at every t: local L1 convergence from times in the full-measure set preserves the range bound (The essential supremum of a measurable function with respect to a measure, The space Lp(μ) as the quotient by null functions).

Facts & Assumptions

Given: Countable Choice, n≥1, T>0, a locally Lipschitz C1 flux f, a bounded Kruzhkov entropy solution u on ΠT with datum u0∈L∞(Rn), and the essential bounds m0=ess inf⁡u0, M0=ess sup⁡u0, both finite.

[F1]

Constant functions on ΠT are Kruzhkov entropy solutions with their own constant value as initial datum, for every flux: for u≡c the weak equation is the equality ∂tc+div⁡xf(c)=0, and for every k the functions ηk(c)=∣c−k∣ and qk(c)=sgn⁡(c−k)(f(c)−f(k)) are constant in (t,x), so ∂tηk(c)+div⁡xqk(c)=0≤0 in distributions; the strong local L1 trace of the constant c is the constant c, with ∫K∣c−c∣ dx=0 for every compact K (Kruzhkov entropy solutions).

[F2]

Order preservation: if two bounded Kruzhkov entropy solutions v,w on ΠT have ∣v∣,∣w∣≤M and v0≤w0 almost everywhere, then v≤w almost everywhere on ΠT (Uniqueness, comparison and order preservation of entropy solutions).

[F3]

The cited essential-supremum definition defines ∥u0∥∞ using bounds on ∣u0∣ (The essential supremum of a measurable function with respect to a measure). Here define the signed extrema explicitly by M0=inf⁡{b∈R:u0≤b a.e.} and m0=sup⁡{a∈R:a≤u0 a.e.}. Since u0 is essentially bounded on the nonnull space Rn, these are finite. For each integer j≥1, the infimum property gives an essential upper bound below M0+1/j, so u0≤M0+1/j a.e.; the supremum property similarly gives m0−1/j≤u0 a.e. Discarding the countable union of exceptional null sets and letting j→∞ yields m0≤u0≤M0 a.e. Thus ∥u0∥∞≤max⁡{∣m0∣,∣M0∣}. Conversely every essential absolute bound B gives m0≥−B and M0≤B, so max⁡{∣m0∣,∣M0∣}≤B; taking its infimum proves equality. Inequalities between L∞ classes are a.e. (The space Lp(μ) as the quotient by null functions). Fubini transfers null sets to spatial slices for a.e. time (Fubini's theorem for L^1 functions on a sigma-finite product).

Proof

technique · direct
1.1F1F2F3

Comparison with the constant ceilings and floors. By [F1] the constants c=M0 and c′=m0 are bounded Kruzhkov entropy solutions. Since u0≤M0 almost everywhere and m0≤u0 almost everywhere by [F3], choose a finite common bound for u, m0, and M0. Then [F2] applied to the pairs (u,M0) and (m0,u) gives u≤M0 almost everywhere and m0≤u almost everywhere on ΠT, that is, m0≤u(t,x)≤M0 for almost every (t,x).

2.1F3step 1.1

The almost-everywhere L∞ bound. Integrating the pointwise almost-everywhere bound of step 1.1 over spatial slices and using Fubini, for almost every t∈(0,T) one has m0≤u(t,x)≤M0 for almost every x, hence ∥u(t,⋅)∥∞≤max⁡{∣m0∣,∣M0∣}=∥u0∥∞ for almost every t.

3.1F3step 2.1∎

Every time for a continuous representative. Suppose u has a representative on [0,T] continuous into Lloc1(Rn): for tj→t and every compact K, u(tj)→u(t) in L1(K). Fix t∈[0,T] and choose tj→t with tj in the full-measure set of step 2.1. For each ball BR, the bound ∥(u(t)−M0)+∥L1(BR)+∥(m0−u(t))+∥L1(BR)≤2∥u(t)−u(tj)∥L1(BR)→0 preserves the range directly; exhausting Rn by countably many balls, the bound holds for almost every x∈Rn at this time t.

Depends on

Used by

Dependency tree · two levels

29 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