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.

Finite propagation for scalar conservation laws

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), with Lipschitz constant L≥0 on the common essential range of the solutions below. Let u,v be bounded Kruzhkov entropy solutions on ΠT in the sense of Kruzhkov entropy solutions. Fix x0∈Rn and R>0. If u0=v0 almost everywhere on B(x0,R), then for almost every t∈(0,T) with Lt<R, u(t,⋅)=v(t,⋅)almost everywhere on B(x0,R−Lt). For L=0 this holds for almost every t∈(0,T) on the stationary ball B(x0,R). In particular, if u0=0 almost everywhere outside B(x0,R), then u(t,x)=0 for almost every (t,x)∈ΠT with ∣x−x0∣>R+Lt. The conclusions are almost-everywhere statements for each fixed cone; an every-time claim requires a chosen time-continuous representative (Open ball, closed ball and sphere in a metric space).

Facts & Assumptions

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

[F1]

Local L1 contraction: for almost every t∈(0,T) with Lt<R, ∫B(x0,R−Lt)∣u(t,x)−v(t,x)∣ dx≤∫B(x0,R)∣u0(x)−v0(x)∣ dx, with an exceptional null set depending on x0,R; when L=0 the time condition is vacuous and the ball is stationary (Local L1 contraction for two entropy solutions, Lipschitz map, α-Hölder map for rational 0<α≤1, and contraction, Kruzhkov entropy solutions).

[F2]

The function identically 0 on ΠT is a Kruzhkov entropy solution with initial datum 0 for every flux f: for each k∈R the functions ηk(0)=∣k∣ and qk(0)=sgn⁡(−k)(f(0)−f(k)) are constant, so ∂tηk(0)+div⁡xqk(0)=0 in distributions, and the strong local L1 initial condition holds because ∫K∣0−0∣ dx=0 for every compact K (Kruzhkov entropy solutions).

[F3]

A nonnegative function in Lloc1 has vanishing integral over an open ball if and only if it vanishes almost everywhere there; almost-everywhere statements are statements about equivalence classes (The space Lp(μ) as the quotient by null functions).

[F4]

Countable measure bookkeeping: Q is countable and dense in R (Q is countably infinite, Both Q and R∖Q are dense in R, and every nonempty open subset of R is uncountable), hence finite products are countable (A product of two at most countable sets is at most countable). To approximate a point of Rn within δ, approximate each coordinate by a rational within δ/n; this proves density of Qn. a countable intersection of full-measure sets of times is full measure, and a countable union of null subsets of ΠT is null; Fubini gives the section-to-product nullity implication (Fubini's theorem for L^1 functions on a sigma-finite product). A countable union of null sets is null: finite-union indicators are bounded by the finite sums of the null-set indicators, and monotone convergence passes to their increasing union. Limits of integrals over expanding balls are covered by monotone and dominated convergence (Monotone convergence for the integral, Dominated convergence, Open ball, closed ball and sphere in a metric space).

Proof

technique · direct
1.1F1F3

The local estimate with vanishing right-hand side. Fix x0,R and suppose first that u0=v0 almost everywhere on B(x0,R). By [F1], for almost every t∈(0,T) with Lt<R, ∫B(x0,R−Lt)∣u(t,x)−v(t,x)∣ dx≤∫B(x0,R)∣u0(x)−v0(x)∣ dx=0, so u(t,⋅)=v(t,⋅) almost everywhere on B(x0,R−Lt) by [F3]. If L=0 the condition Lt<R reads 0<R and is automatic, the ball B(x0,R−Lt)=B(x0,R) is stationary, and the statement holds for almost every t∈(0,T).

2.1F2step 1.1

The support claim for the atomic ball. Suppose now that u0=0 almost everywhere outside B(x0,R) and let q∈Rn, r0>0 with B(q,r0)⊆Rn∖B‾(x0,R). Then u0=0 almost everywhere on B(q,r0), so step 1.1 applied to the pair (u,0) with centre q and radius r0 — legitimate because 0 is an entropy solution with datum 0 by [F2] — gives u(t,⋅)=0 almost everywhere on B(q,r0−Lt) for almost every t with Lt<r0.

3.1F4step 2.1

Covering the exterior cone. Let Q consist of rational pairs (q,r0)∈Qn×Q>0 satisfying r0<∣q−x0∣−R, and let C(q,r0)={(t,x):Lt<r0, ∣x−q∣<r0−Lt}. If ∣x−x0∣>R+Lt, choose rational q sufficiently close to x that Lt+∣x−q∣<∣q−x0∣−R, then a rational r0 between these bounds. Thus B(q,r0) lies in the strict exterior of the initial ball and (t,x)∈C(q,r0). The countable family of these cones covers the strict exterior cone.

4.1F4step 2.1step 3.1∎

Conclusion of the support claim. For each (q,r0)∈Q, step 2.1 exhibits a null set of times t with Lt<r0 such that u(t,⋅)≠0 on a positive-measure subset of B(q,r0−Lt); hence the set N(q,r0)={(t,x)∈C(q,r0) ⁣:u(t,x)≠0} is a null subset of ΠT, by Fubini: its sections are null for almost every time, and bounded spatial sections at the exceptional null set of times contribute zero. A countable union of null sets is null by [F4], so N=⋃(q,r0)∈QN(q,r0) is null, and by step 3.1 the set {(t,x)∈ΠT ⁣:∣x−x0∣>R+Lt, u(t,x)≠0} is contained in N. Therefore u=0 almost everywhere in the exterior cone.

Depends on

Used by

Dependency tree · two levels

76 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