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

Classical solutions are distributional weak solutions, and conversely

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) for the injectivity interface below. Let n≥1, T>0, f∈C1(R;Rn) and u0∈L∞(Rn)∩Lloc1(Rn).

(i) If u∈C1(ΠT)∩C0([0,T];Lloc1(Rn))∩L∞(ΠT) satisfies ut+div⁡xf(u)=0 pointwise in ΠT and has initial trace u(⋅,t)→u0 in Lloc1 as t↓0, then u is a distributional weak solution in the sense of Distributional weak solutions of the Cauchy problem.

(ii) Conversely, if u is a bounded distributional weak solution, u∈C1(ΠT), and u(⋅,t) has an Lloc1-continuous trace uˉ0 as t↓0, then ut+div⁡xf(u)=0 pointwise in ΠT and uˉ0=u0 as Lloc1 equivalence classes.

The initial-trace conclusion is an almost-everywhere class equality; no pointwise representative on t=0 is asserted (Scalar conservation laws, fluxes and Cauchy data).

Facts & Assumptions

Given: Countable Choice, n≥1, T>0, f∈C1(R;Rn), u0∈L∞∩Lloc1, a classical solution u∈C1(ΠT) satisfying ut+div⁡xf(u)=0 pointwise with an Lloc1 initial trace (i), and, in (ii), a bounded distributional weak solution u∈C1(ΠT) with an Lloc1-continuous initial trace uˉ0.

[F2]

Integration by parts on a box follows coordinatewise from The second fundamental theorem: if G is differentiable on [a,b] with G′=f and f is integrable, then ∫abf=G(b)−G(a) and Fubini's theorem for L^1 functions on a sigma-finite product applied to the C1 products uφ and fi(u)φ. Compact support kills spatial and terminal faces. No surface divergence theorem is used.

[F3]

A continuous function on an open set whose integral against every compactly supported smooth test function vanishes is identically zero there; testing against a translate of a fixed nonzero smooth compactly supported bump gives a nonzero pairing where the function does not vanish (Explicit compactly supported smooth cutoffs).

[F4]

Under Countable Choice, two locally integrable functions with equal pairings against every smooth compactly supported test represent the same almost-everywhere class (Locally integrable functions embed in distributions).

Proof

technique · direct
1.1F1F2

Fix φ∈Cc∞(Rn×(−∞,T)) and choose QR=(−R,R)n and τ with supp⁡φ⊂QR×(−∞,τ), τ<T. Multiplying the pointwise equation by φ and integrating over QR×(δ,τ), 0<δ<τ, [F2] gives 0=∫QRuφ∣δτ dx−∫δτ ⁣ ⁣∫QRu φt−∫δτ ⁣ ⁣∫QRf(u)⋅∇xφ, since φ vanishes on the lateral and terminal faces.

1.2F1F3given

For (ii), test the weak identity with φ∈Cc∞(ΠT) (so φ=0 near t=0): integration by parts over the support of φ gives 0=∫ΠT(uφt+f(u)⋅∇xφ)=−⟨ut+div⁡xf(u),φ⟩, where the residual R:=ut+div⁡xf(u) is continuous by [F1]. By [F3] applied on the open set ΠT, R≡0, so the equation holds pointwise.

2.1F2givenstep 1.1

In step 1.1 the terminal term vanishes and φ(⋅,δ)→φ(⋅,0) uniformly on the compact spatial support while u(⋅,δ)→u0 in Lloc1; letting δ↓0 gives ∫ΠT(uφt+f(u)⋅∇xφ) dx dt+∫Rnu0φ(⋅,0) dx=0, which is the weak formulation for this test function. As φ was arbitrary, (i) holds.

3.1F2F4givenstep 1.2step 2.1∎

Identification of the trace. Fix ψ∈Cc∞(Rn) and β∈Cc∞((−∞,T)) with β(0)=1. The pointwise equation from step 1.2, integrated on a box times (δ,τ) containing the positive-time support of ψβ, gives the calculation of steps 1.1 and 2.1 with trace uˉ0. Hence ∫ΠT(uφt+f(u)⋅∇φ)+∫uˉ0ψ=0 for φ=ψβ. Subtract the given weak identity, whose bottom term is ∫u0ψ, to get ∫(uˉ0−u0)ψ=0. By [F4], uˉ0=u0 almost everywhere.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

60 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