Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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.

Conservative finite-volume strong-limit theorem

Statement

Assume the Axiom of Countable Choice ACω. Let T>0, f ⁣:R→R be continuous, u0∈L∞(R)∩Lloc1(R), and F ⁣:R2→R be continuous with F(a,a)=f(a) for every a∈R. For each m, form the conservative finite-volume scheme and space-time reconstruction of Conservative two-point finite-volume schemes for scalar laws and Piecewise-constant finite-volume state and face-flux reconstructions using hm,τm→0 and initial cell averages of u0. Suppose reconstructions converge strongly in Lloc1(R×(0,T)) to u, and for every bounded interval I⊂R and T′<T there is MI,T′<∞ such that ∣Um∣≤MI,T′ almost everywhere on I×[0,T′] for every m. Then u is a locally bounded distributional weak solution in the sense of Locally bounded distributional weak solutions of scalar laws; explicitly, for every φ∈Cc∞(R×(−∞,T)),

∫0T∫R(uφt+f(u)φx) dx dt+∫Ru0(x)φ(x,0) dx=0.

The strong convergence and local uniform bounds are hypotheses, not conclusions. No CFL condition or entropy inequality is assumed, so the theorem proves a weak limit only; it does not claim Kruzhkov entropy admissibility. If the limit is also globally essentially bounded, this identity is the published bounded weak formulation in Distributional weak solutions of the Cauchy problem.

Facts & Assumptions

Given: ACω, the scalar flux f, initial datum u0, the scheme and reconstructions, hm,τm→0, local uniform bounds on the states up to t=0, strong Lloc1 convergence to u, and a compactly supported smooth test φ whose support may meet t=0.

[A1]

The Axiom of Countable Choice says that every countable family of nonempty sets has a choice function (The Axiom of Countable Choice (ACω)).

[F1]

The initial states are cell averages of u0, and the update is the shared-flux difference hm(Ujm,n+1−Ujm,n)+τm(Qj+1/2m,n−Qj−1/2m,n)=0. (Conservative two-point finite-volume schemes for scalar laws)

[F2]

Um=Ujm,n and Qm=Qj+1/2m,n on each Ijm×Jnm, and the face flux equals F(Um(x,t),Um(x+hm,t)) almost everywhere. (Piecewise-constant finite-volume state and face-flux reconstructions)

[F3]

For the averaged test Φjm,n, the exact discrete identity is

∑jhmUjm,0Φjm,0+∑n=1N−1∑jhmUjm,n(Φjm,n−Φjm,n−1)+∑n=0N−1∑jτmQj+1/2m,n(Φj+1m,n−Φjm,n)=0

when the test vanishes for t≥tN−1m. (Discrete weak identity for a conservative finite-volume update)

[F4]

Under strong local L1 convergence and local uniform bounds up to t=0, u is locally essentially bounded and Qm→f(u) in L1 on every bounded interval times (0,T′). (Strong local convergence of consistent finite-volume face fluxes)

[F5]

A locally bounded distributional weak solution is a measurable, locally essentially bounded u for which the displayed weak identity with initial boundary term holds for every test meeting t=0. (Locally bounded distributional weak solutions of scalar laws)

[F6]

If the state is globally bounded and satisfies this initial weak identity, it meets the published bounded weak-solution definition. (Distributional weak solutions of the Cauchy problem)

Proof

1.1F1F2F3givenchoose

Fix φ∈Cc∞(R×(−∞,T)). Its time support on [0,T) is contained in [0,Tφ] for some Tφ<T. For all sufficiently large m, choose Nm≥3 with Tφ<tNm−2m<tNm−1m<tNmm<T. By [F1] and [F2] these are precisely the scheme states and face fluxes of the reconstruction, so [F3] gives the exact summed update identity for this test.

2.1F1F2F3step 1.1givenalgebra

The initial term in [F3] converges to the desired boundary term. Indeed, hmUjm,0=∫Ijmu0, while Φjm,0 is the average of φ on Ijm×[0,τm). Smoothness gives ∣Φjm,0−φ(x,0)∣≤Cφ(hm+τm) for x∈Ijm; summing the resulting errors over the finitely many cells meeting the support bounds the total by Cφ(hm+τm)∫K∣u0∣→0 on a fixed compact K.

2.2F2F3step 1.1givenalgebra

For n≥1, the difference Φjm,n−Φjm,n−1 differs from hm−1∫Ijm∫Jnmφt by at most Cφτm2, by Taylor's formula in time for the smooth function t↦hm−1∫Ijmφ(x,t) dx. After multiplication by hmUjm,n and summation over O(hm−1) cells and O(τm−1) time slabs in the fixed support, the total error is O(τm). The missing first-slab integral is also O(τm) because ∣Um∣ is uniformly bounded on the compact support and φt is bounded. Hence the time sum in [F3] differs from ∫0T∫Umφt by a quantity tending to zero.

2.3F1F2F3step 1.1givenalgebra

For each j,n, translation of a cell interval and the fundamental theorem of calculus give τm(Φj+1m,n−Φjm,n)=∫Jnm∫Ijm1hm∫0hmφx(x+s,t) ds dx dt. Its difference from ∫Jnm∫Ijmφx is at most Cφhm2τm, by the bound on φxx. The numerical face fluxes are uniformly bounded on cells meeting the test support because F is continuous on the compact state square supplied by local boundedness. Summing over the finitely many cells and time slabs meeting the test support gives total error O(hm). Thus the flux sum in [F3] differs from ∫0T∫Qmφx by a quantity tending to zero.

3.1A1F3F4F5F6step 2.1step 2.2step 2.3givenalgebra∎

Strong local L1 convergence gives ∫Umφt→∫uφt on times bounded away from zero. On I×(0,ϵ), the local uniform bound for both Um and u makes the integral difference at most a constant times ∣I∣ϵ; letting ϵ↓0 proves convergence on the full test support. By [F4], ∫Qmφx→∫f(u)φx on that support. Step 2.1 gives the initial term limit, and steps 2.2–2.3 identify the limits of the discrete sums. Taking the limit in [F3] proves the weak identity. By [F4], u is locally essentially bounded, and [F5] identifies it as the stated local weak solution.

Depends on

Used by

Dependency tree · two levels

34 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