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

Local compactness and initial trace for BV finite-volume states

Statement

Let u0∈BVb(R) with V=TV⁡(u0) and I=[a−,a+]. Let (hm,τm) satisfy hm,τm→0 and the full invariant-interval CFL bound for the scheme of Monotone finite-volume scheme and invariant-interval CFL. Let Wm and Um be the piecewise-linear and piecewise-constant reconstructions of Piecewise-linear time interpolant of a finite-volume scheme. Then every subsequence has a further subsequence for which Wm converges uniformly in time in L1(K) on every bounded interval K⊂R to a map t↦u(t)∈Lloc1(R), continuous in local L1, with u(0)=u0 and a−≤u(t)≤a+ almost everywhere. On that subsequence the piecewise-constant reconstructions converge strongly to the same u in Lloc1(R×(0,T)).

Facts & Assumptions

Given: u0∈BVb(R), the monotone flux scheme, meshes hm,τm→0 satisfying its full CFL bound, the time interpolants Wm, and a finite time interval [0,T].

[F1]

The initial translation variation bound is ∥u0(⋅+h)−u0∥L1(R)≤hV for h>0 (Bounded BV data on the real line).

[F2]

The update has range I, spatial discrete variation at most V, and hτ∑j∣Ujn+1−Ujn∣≤(L1+L2)V (Invariant range, TVD and time increments for a monotone finite-volume update).

[F3]

On a time slab, Wm=(1−θ)Un+θUn+1 on each spatial cell, while Um=Un on that slab (Piecewise-linear time interpolant of a finite-volume scheme).

[F5]

There is a bijection from N onto Q, so fix an enumeration of the rationals without repetitions (Q is countably infinite).

[F6]

Every bounded real sequence has a convergent subsequence (Bolzano-Weierstrass: every bounded real sequence has a convergent subsequence).

[F7]

Almost-everywhere convergence under an integrable majorant on a finite interval implies L1 convergence (Dominated convergence).

[F8]

For a nondecreasing sequence of nonnegative measurable functions, the integral of its pointwise limit is the limit of the integrals; finite nonnegative integral implies finiteness almost everywhere (Monotone convergence for the integral, A nonnegative measurable function with finite integral is finite almost everywhere).

[F9]

Fubini's theorem applies to every integrable space-time function: its time sections are locally L1 for almost every time, and its space-time integral equals the integral of the section integrals. In particular, an integrable nonnegative sum of space-time differences has finite spatial integral on almost every time section (Fubini's theorem for L^1 functions on a sigma-finite product).

Proof

1.1F2F4F6givenchoose

For every t, Wm(⋅,t) is piecewise constant with values in I and spatial variation at most V: on each time slab it is a convex combination of two states whose variations are at most V by [F2]. Here the variation of a piecewise-constant section on an interval is the sum of the absolute jump sizes inside that interval. Fix an integer R≥1 and consider any sequence vm of such sections on [−R,R]. At each rational point in [−R,R], the values lie in the compact interval I. The bounded-value subsequence at one rational point exists by [F6]; explicitly, partition I into finitely many closed intervals of length at most 2−1, take the first interval containing infinitely many values, and repeat inside it with successive meshes 2−2,2−3,…, always selecting the first subinterval with infinitely many retained indices. The nested intervals have diameters tending to zero, so the least increasing indices in the nested sets give a convergent subsequence. Use the enumeration fixed by [F5], and repeat this deterministic extraction successively on the current subsequence at each enumerated rational that lies in [−R,R], skipping the others. The nested subsequences yield a diagonal subsequence converging at every rational point; each interval and index is selected by a least-index rule, so this uses no choice axiom. Given δ>0, choose a finite rational partition of [−R,R] with mesh at most δ, possible by [F4]. For each subinterval J=[ri,ri+1] and any two selected functions vp,vq, variation gives ∣vp(x)−vq(x)∣≤∣vp(ri)−vq(ri)∣+Var⁡J(vp)+Var⁡J(vq) for almost every x∈J. Integrating and summing yields ∥vp−vq∥L1([−R,R])≤2δV+2Rmax⁡i∣vp(ri)−vq(ri)∣. For the fixed partition the maximum tends to zero as p,q→∞; then taking δ↓0 proves the selected sections are Cauchy in local L1.

2.1F2F5step 1.1algebra

On each slab, ∂tWm=(Ujn+1−Ujn)/τm on cell Ij. By [F2], its L1(R) norm is at most C:=(L1+L2)V. Integrating over any time interval gives ∥Wm(⋅,t)−Wm(⋅,s)∥L1(R)≤C∣t−s∣. Use the enumeration fixed by [F5] and process its indices together with integers R≥1 in order of increasing sum. For each pair (ℓ,R), if qℓ∈[0,T], apply step 1.1 at time qℓ on [−R,R]; otherwise skip that pair. The resulting diagonal extraction covers every rational time in [0,T] and every integer interval. The subsequence converges in L1([−R,R]) at every rational time for every integer R; this recursive construction uses no choice axiom.

3.1F4F7F8F9step 2.1algebrachoose

Fix R and ε>0, and put δ:=ε/(4(C+1)). Choose a finite set of rational times in [0,T] that is a δ-net: include 0, choose q∈Q∩[0,T] with T−q<δ (using q=0 if T<δ), and subdivide [0,q] by rational points with gaps below δ, possible by [F4]. At those finitely many times the subsequence in step 2.1 is Cauchy in L1([−R,R]). For any t∈[0,T], choose a net time s within the gap bound; the triangle inequality and the uniform time estimate in step 2.1 give ∥Wp(⋅,t)−Wq(⋅,t)∥L1([−R,R])≤2C∣t−s∣+∥Wp(⋅,s)−Wq(⋅,s)∥L1([−R,R]). Thus the subsequence is uniformly Cauchy in time in local L1. For fixed t,R, its bounded measurable sections have an L1([−R,R]) limit: for each j, let Nj be the least integer such that all p,q≥Nj have L1([−R,R]) difference below 2−j, which exists by Cauchyness. Put N^j:=max⁡1≤r≤jNr and recursively choose the least increasing indices nj≥N^j. Then both nj,nj+1≥Nj, so successive differences have norms below 2−j. By [F8] their pointwise absolute sum is finite almost everywhere, and dominated convergence [F7] gives the L1 limit. Uniqueness makes these limits consistent as R increases, and the uniform Cauchy estimate makes t↦u(t) continuous in each local L1 norm. The subsequence is also Cauchy in L1([−R,R]×(0,T)) for every integer R, by integrating its uniform-in-time Cauchy bound. For each j, let Mj be the least integer such that all p,q≥Mj have difference below 2−j on every cylinder with integer R≤j; this exists because there are finitely many such cylinders and the sequence is Cauchy on each. Put M^j:=max⁡1≤r≤jMr and recursively choose the least increasing indices mj≥M^j. For every fixed integer R and every j≥R, both mj,mj+1≥Mj, so their successive differences have norm below 2−j on that cylinder. [F8] then gives a finite pointwise sum of differences almost everywhere on each cylinder, and [F7] yields a measurable space-time limit v with strong local L1 convergence. For each integer R, the sum of the L1([−R,R]×(0,T)) norms of these successive differences is finite. By [F9], for almost every t their spatial absolute sum is integrable on [−R,R]; hence Wmj(⋅,t) converges almost everywhere in x there to v(⋅,t). Since all these sections and their limit take values in the bounded interval I, dominated convergence [F7] gives convergence to v(⋅,t) in L1([−R,R]). But this is a subsequence of the sequence that converges in L1([−R,R]) to u(t) for every t, so uniqueness of the L1 limit gives v(⋅,t)=u(t) for almost every t. Intersecting these full-measure time sets over integer R shows that the space-time limit and the continuous local-L1 map are the same limit on all bounded intervals.

4.1F2step 3.1algebra

Every Wm takes values in I, so its local L1 limit also takes values in I almost everywhere: if, for example, u(t)>a+ on a set of positive measure, then some set where u(t)≥a++1/r has positive measure, contradicting L1 convergence from functions bounded by a+. The same argument applies to the lower bound.

4.2F1F3step 3.1algebra

For r<0, translation invariance of Lebesgue measure gives the same bound as for −r, so ∥u0(⋅+r)−u0∥L1(R)≤∣r∣V for every r∈R. On each cell, the initial cell-average error is controlled by translations: ∑j∫Ij∣u0(x)−Uj0∣ dx≤1h∫−hh∫R∣u0(x+r)−u0(x)∣ dx dr≤hV. The first inequality follows by writing each cell average as an integral over that same cell, applying the triangle inequality, and changing variables to r=y−x; the restriction that x and x+r lie in the same cell can only decrease the integral. Since Wm(⋅,0)=U0, step 3.1 gives u(0)=u0 in local L1.

5.1F2F3step 3.1algebra∎

On each slab, ∣Wm−Ujn∣=θ∣Ujn+1−Ujn∣. Integrating in time contributes the factor τm/2; the time-increment bound in [F2] gives, on [0,T], ∥Wm−Um∥L1(R×(0,T))≤(T+τm)τm2(L1+L2)V⟶0. Consequently Um converges strongly in local space-time L1 to the same limit as Wm.

Depends on

Used by

Dependency tree · two levels

64 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