Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Existence of bounded Kruzhkov entropy solutions

Statement

Assume Countable Choice and Dependent Choice (The Axiom of Countable Choice (ACω), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) for the heat-kernel, L1 completeness and vanishing-viscosity extraction interfaces used below. Let n≥1, T>0, let f ⁣:R→Rn be locally Lipschitz and C1, and let u0∈L∞(Rn)∩L1(Rn). Then there exists a Kruzhkov entropy solution u∈L∞(ΠT)∩C0([0,T];Lloc1(Rn)) of ut+div⁡xf(u)=0 with u(⋅,0)=u0 in the strong Lloc1 sense, satisfying ∥u(t,⋅)∥∞≤∥u0∥∞ for every t. By Uniqueness, comparison and order preservation of entropy solutions this solution is unique. The route is vanishing viscosity, and the compactness comes from the translation lemmas, not from the energy dissipation alone (Scalar conservation laws, fluxes and Cauchy data, Kruzhkov entropy solutions).

Facts & Assumptions

Given: Countable and Dependent Choice, n≥1, T>0, a locally Lipschitz C1 flux f, and u0∈L∞(Rn)∩L1(Rn) with M=∥u0∥∞.

[F1]

The weak formulation: u is a distributional weak solution of ut+div⁡xf(u)=0 on ΠT iff ∫ΠT(uφt+f(u)⋅∇φ)=0 for every φ∈Cc∞(ΠT); subtracting the constant f(0) from the flux changes neither the divergence term nor the Kruzhkov fluxes sgn⁡(u−k)(f(u)−f(k)), so all existence and entropy statements may be proved for the normalized flux f~=f−f(0) and transferred back (Scalar conservation laws, fluxes and Cauchy data, Kruzhkov entropy solutions).

[F2]

Viscous solutions: for every C2 flux g with g(0)=0, every ε∈(0,1] and every datum in Cc∞, there is a global classical solution of ut+div⁡xg(u)=εΔu with u∈C([0,T];Cb)∩C([0,T];L1)∩C1,2(Rn×(0,T)), range contained in the initial range, and ∥u(t,⋅)∥1≤∥u0∥1 (The viscous scalar Cauchy problem with smooth data has a global classical solution, Uniform L-infinity, mass and energy bounds for the viscous approximations).

[F3]

Viscous entropy balance: for every convex C2 entropy η with flux q′=η′g′, ∂tη(u)+div⁡xq(u)=εΔη(u)−εη′′(u)∣∇u∣2 pointwise, and the Laplacian term integrates by parts against compactly supported tests (The viscous entropy dissipation identity).

[F4]

Mollification: convolving a locally integrable function with a radial mollifier gives a smooth function; the mollified derivatives are the convolutions of the derivatives, and on compact sets the mollified flux and its derivative converge uniformly to the original for C1 data; approximate identities converge in L1, and the classes of Lp are equivalence classes (A unit-mass smooth bump generates an L1 approximate identity, Convolution with a mollifier is smooth, and derivatives pass under the integral sign, The space Lp(μ) as the quotient by null functions). The norm convergence assertion is Every L1 approximate identity converges to the identity in Lp for 1≤p<∞; the compact cutoffs are A Euclidean bump for a compact set inside an open set.

[F5]

Vanishing-viscosity compactness: for smooth compactly supported data, C2 fluxes fm with fm(0)=0 and uniformly bounded derivatives on the range [−M−1,M+1], and 0<εm≤1, εm↓0, the viscous solutions have a subsequence converging in L1(K) for every compact K⋐ΠT and almost everywhere on ΠT to u∈L∞∩Lloc1(ΠT) with ∥u∥∞≤M, having a representative in C([0,T];Lloc1) with u(0)=u0 in Lloc1; the extraction uses Dependent Choice (Vanishing-viscosity families are locally precompact in L1).

[F6]

Contraction and uniqueness: for data in L1∩L∞ the global L1 difference of two entropy solutions is bounded by the L1 difference of their data, at every time if the representatives are Lloc1-continuous; two bounded Kruzhkov entropy solutions with the same data coincide almost everywhere (Global L1 contraction from the local estimate, Uniqueness, comparison and order preservation of entropy solutions).

[F7]

Limits and completeness: dominated and monotone convergence for integrals over fixed compact sets with uniformly bounded integrands, and completeness of L1(K) for compact K (Dominated convergence, Monotone convergence for the integral, Riesz-Fischer completeness of Lp for 1≤p≤∞).

Proof

technique · direct
1.1F1F4

Normalization and smooth flux approximation. By [F1] it suffices to treat f~=f−f(0). Choose a radial mollifier and, for m≥1, set fm(s)=χ(s) (f~∗ρ1/m)(s)−(f~∗ρ1/m)(0), where χ∈Cc∞ equals 1 on [−M−12,M+12] and is supported in [−M−1,M+1]. Then each fm is C∞ (hence C2), fm(0)=0, and on [−M−12,M+12] one has fm→f~ and fm′=f~′∗ρ1/m→f~′ uniformly by [F4]; in particular sup⁡msup⁡∣s∣≤M+1∣fm′(s)∣<∞.

1.2F2F5

Smooth-datum case: extraction. Let u0∈Cc∞(Rn) with ∥u0∥∞=M, choose εm↓0 with 0<εm≤1, and let um be the global classical solution with flux fm and datum u0 given by [F2]. Then ∣um(t,x)∣≤∥u0∥∞=M by the range bound of [F2], so the hypotheses of [F5] are met; passing to a subsequence (relabelled) there is u∈L∞∩Lloc1(ΠT) with ∥u∥∞≤M, um→u in L1(K) for every compact K⋐ΠT and almost everywhere, and u has a representative in C([0,T];Lloc1) with u(0)=u0 in Lloc1. At every time t this representative obeys ∣u(t,⋅)∣≤M almost everywhere: for t in the full-measure set where the construction of [F5] passes the bound, slicewise almost-everywhere convergence preserves it, and general t follows by Lloc1-continuity.

2.1F1F7step 1.1step 1.2

The weak equation passes to the limit. For φ∈Cc∞(ΠT), testing the pointwise viscous equation of um gives ∫ΠT(umφt+fm(um)⋅∇φ)=−εm∫ΠTumΔφ, whose right side is bounded by εmM∥Δφ∥1→0. The left side converges to ∫ΠT(uφt+f~(u)⋅∇φ) by [F7], because um→u almost everywhere with uniform bounds and fm→f~ uniformly on [−M,M]; hence u is a weak solution for f~, and therefore for f by [F1].

2.2F3F4F7step 1.1step 1.2

Entropy inequalities for ∣k∣≤M. Fix k∈[−M,M] and δ>0, and put ηδ(r)=r2+δ2−δ, a convex C2 function with 0≤ηδ≤∣⋅∣, ∣ηδ(r)−∣r∣∣≤δ, and ηδ′′≥0; let qδ,k,m(s)=∫ksηδ′(r−k)fm′(r) dr, so qδ,k,m′=ηδ′(⋅−k)fm′. Let φ∈Cc∞(Rn×[0,T)) be nonnegative. Multiplying the exact viscous balance [F3] for the pair (ηδ(⋅−k),qδ,k,m) by φ, integrating over ΠT and integrating the Laplacian by parts gives Im,δ:=∫ΠT(ηδ(um−k)φt+qδ,k,m(um)⋅∇φ)+∫Rnηδ(u0−k)φ(x,0) dx=−εm∫ΠTηδ(um−k)Δφ+εm∫ΠTηδ′′(um−k)∣∇um∣2φ — the only boundary term is the one at t=0, displayed with the initial datum; the last term is nonnegative and the first is bounded by εm⋅2M∥Δφ∥1→0, so lim inf⁡mIm,δ≥0. On the other hand Im,δ converges by [F7]: um→u almost everywhere, ∣ηδ(um−k)∣≤2M, and qδ,k,m→qδ,k uniformly on [−M,M], where qδ,k(s)=∫ksηδ′(r−k)f~′(r) dr, so the limit obeys Iδ=∫ΠT(ηδ(u−k)φt+qδ,k(u)⋅∇φ)+∫Rnηδ(u0−k)φ(x,0) dx≥0.

3.1F7step 2.1step 2.2

The Kruzhkov inequalities. Letting δ↓0 in step 2.2, ηδ(r−k)→∣r−k∣ uniformly on [−M,M] and qδ,k(s)→∫kssgn⁡(r−k)f~′(r) dr=sgn⁡(s−k)(f~(s)−f~(k))=qk(s) uniformly on [−M,M] by dominated convergence, since ∣ηδ′∣≤1 and f~′ is continuous there; hence dominated convergence gives ∫ΠT(∣u−k∣φt+qk(u)⋅∇φ)+∫∣u0−k∣φ(x,0) dx≥0 for every nonnegative φ∈Cc∞(Rn×[0,T)) and every k∈[−M,M]. If k>M, then u−k<0 almost everywhere, ηk is affine on the range [−M,M], and qk(s)=f~(k)−f~(s), so the identity ∂tηk(u)+div⁡xqk(u)=−(ut+div⁡xf~(u))=0 holds by step 2.1, and similarly for k<−M; thus all Kruzhkov inequalities hold and, with the trace of step 1.2, u is a bounded Kruzhkov entropy solution with datum u0.

4.1F4F6step 2.1step 2.2step 3.1

General datum: approximation and Cauchy property. Now let u0∈L∞∩L1 be arbitrary. By [F4] choose u0r∈Cc∞ with ∥u0r∥∞≤∥u0∥∞ and u0r→u0 in L1 (truncate u0 to a large ball and mollify). Steps 1.1–3.1 applied to each smooth datum u0r give bounded Kruzhkov entropy solutions ur for the flux f, with Lloc1-continuous representatives and ∥ur(t,⋅)∥∞≤∥u0r∥∞≤M. By [F6], for every t∈[0,T], ∥ur(t)−uℓ(t)∥1≤∥u0r−u0ℓ∥1, so sup⁡t∈[0,T]∥ur(t)−uℓ(t)∥L1(K)≤∥u0r−u0ℓ∥1 for every compact K, and the right side tends to 0 as r,ℓ→∞.

5.1F7step 3.1step 4.1

The limit for general datum. By completeness of L1(K) [F7] and the uniform-in-time contraction in step 4.1, ur converges in C([0,T];L1(K)) for each compact ball K, consistently on nested balls, to u∈C([0,T];Lloc1(Rn)). Since ur(0)=u0r→u0 in L1, this representative has initial trace u0. For every t and ball K, the inequality (∣u(t)∣−M)+≤∣u(t)−ur(t)∣+(∣ur(t)∣−M)+ and ∥ur(t)∥∞≤M show, after integration on K and passage to the L1(K) limit, that (∣u(t)∣−M)+=0 almost everywhere there. Thus ∥u(t)∥∞≤M for every t. The weak equation passes to the limit because f is Lipschitz on [−M,M] and ur→u in local L1. For each fixed k∈R, s↦∣s−k∣ is 1-Lipschitz and qk(s)=sgn⁡(s−k)(f(s)−f(k)) is Lipschitz on [−M,M] with constant at most sup⁡∣s∣≤M∣f′(s)∣. Therefore the entropy and flux terms in the inequality of step 3.1 converge in L1 on every test support; the initial entropy term converges by u0r→u0 in L1 and the same Lipschitz bound for ∣⋅−k∣. Passing to the limit proves every Kruzhkov inequality without requiring an almost-everywhere subsequence for the general-data approximation. Hence u is a bounded Kruzhkov entropy solution with datum u0.

6.1F6step 1.2step 5.1∎

Uniqueness and conclusion. If v is another bounded Kruzhkov entropy solution with the same datum u0, then u=v almost everywhere on ΠT by [F6], so the constructed solution is the unique bounded Kruzhkov entropy solution with this datum; this completes the proof.

Depends on

Used by

Dependency tree · two levels

101 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