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.

Hydrostatic HLL face fluxes converge under strong state and velocity convergence

Statement

Assume the Axiom of Countable Choice ACω. Let dk,τk>0 tend to zero, set Iik=[idk,(i+1)dk), xik=(i+12)dk, tnk=nτk, and Jnk=[tnk,tn+1k), and let b∈C1(R) be locally Lipschitz. On each cell-time slab let hk,uk be piecewise constant, with hk≥0, uk=0 when hk=0, and mk=hkuk. Suppose hk→h and uk→u strongly in Lloc1(R×(0,T)), u=0 almost everywhere where h=0, and hk,∣uk∣ are locally uniformly bounded. Let Fk(x,t)=F^i+1/2k,n for (x,t)∈Iik×Jnk, with face flux from Hydrostatic reconstruction with a dry-safe HLL flux and one-sided pressure corrections and bed samples b(xik). Then Fk⟶F(h,hu)strongly in Lloc1(R×(0,T)). The primitive-velocity convergence and uniform velocity bound are included because the assigned wave-speed formula uses m/h on wet states, which is not continuous at a dry state as a function of (h,m) alone.

Facts & Assumptions

Given: ACω, the mesh and bed convention, local uniform bounds, strong local L1 convergence of hk,uk, and the hydrostatic HLL face flux.

[A1]

ACω is countable choice (The Axiom of Countable Choice (ACω)).

[F1]

Hydrostatic reconstruction with a dry-safe HLL flux and one-sided pressure corrections: adjacent states are reconstructed by clipping depths against the maximum bed; face velocities are retained when reconstructed depth is positive and set to zero at reconstructed dry states; the HLL speed and flux branches are the displayed ones.

[F2]

Under ACω, spatial translations are continuous in L1(R2) (∥τhf−f∥p→0 in Lp(Rn) as h→0, for 1≤p<∞).

[F3]

Under ACω, bounded measurable subsets of R2 have finite measure (Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure).

[F4]

Strong L1 convergence implies convergence in measure; every sequence converging in measure has a subsequence converging almost everywhere (Convergence in L^1(mu) implies convergence in measure, Riesz's subsequence theorem for convergence in measure).

[F5]

Almost-everywhere convergence under an integrable majorant implies L1 convergence (Dominated convergence).

Proof

1.1A1F2F3F4givenalgebra

Fix a compact space-time rectangle Q and a fixed compact enlargement Q′ containing Q and every spatial translate Q+dk for all sufficiently large k. Choose local bounds H,M so that 0≤hk≤H and ∣uk∣≤M on Q′. Strong local L1 convergence implies the same bounds for h,u almost everywhere on Q′: the sum ∣hk−h∣+∣uk−u∣ tends to zero in L1(Q′), so [F4] gives a subsequence on which both converge almost everywhere and inherit the bounds. By [F3], multiplying h,u by the indicator of Q′ therefore gives L1(R2) functions. The given strong convergence gives hk→h and uk→u in L1(Q). Applying [F2] to the cutoffs shows h(⋅+dk,⋅)→h and u(⋅+dk,⋅)→u in L1(Q). Strong local convergence on Q′ and the triangle inequality then show hk(⋅+dk,⋅)→h and uk(⋅+dk,⋅)→u in L1(Q) as well.

2.1F1F4step 1.1construct

Let L be a Lipschitz constant for b on the spatial enlargement, and write hk+(x,t)=hk(x+dk,t) and uk+(x,t)=uk(x+dk,t). Hydrostatic clipping changes either adjacent depth by at most Ldk. Take any subsequence of k. By step 1.1, the sum of the four errors ∣hk−h∣+∣uk−u∣+∣hk+−h∣+∣uk+−u∣ converges to zero in measure on Q; [F4] gives a further subsequence on which all four errors tend to zero almost everywhere. At a point where h>0, both cell depths are eventually larger than Ldk, so neither reconstructed state is clipped to zero and both reconstructed velocities converge to u. At a point where h=0, the hypothesis gives u=0 and both cell velocities converge to zero; resetting either velocity to zero when its reconstructed depth vanishes therefore still gives convergence to u. The reconstructed depths in both states converge to h as well. Thus along this common further subsequence both reconstructed primitive states converge almost everywhere to (h,u). Since the starting subsequence was arbitrary, every subsequence has such a further subsequence.

3.1F1step 2.1algebra

At a wet limit state h>0, the two face inputs tend to the same (h,hu); the left, middle and right HLL branches all tend to F(h,hu), and the formulas agree at the branch boundaries. At a dry limit state, h=0 and u=0, so both reconstructed fluxes and both speeds tend to zero. In the middle branch write α=aR, β=−aL; its equivalent formula is F^=(αFL∗+βFR∗)/(α+β)−[αβ/(α+β)](UR∗−UL∗). Here αβ/(α+β)≤max⁡(α,β), which tends to zero at the dry state, while FL∗,FR∗,UL∗,UR∗ tend to zero. The outer branches also tend to zero. Thus along the almost-everywhere convergent further subsequence from step 2.1, the HLL flux tends almost everywhere to F(h,hu). The same equivalent formula and α,β≤M+gH give a uniform bound on the fluxes on Q.

4.1F3F5step 2.1step 3.1algebra∎

Starting from any subsequence, step 2.1 supplies a further subsequence with almost-everywhere convergence of both face inputs; step 3.1 gives almost-everywhere convergence of its fluxes and a uniform bound. Since Q has finite measure by [F3], [F5] yields L1(Q) convergence along that further subsequence. If the full flux sequence failed to converge in L1(Q), some subsequence would stay a fixed positive distance from F(h,hu), contradicting this property. Therefore Fk→F(h,hu) in L1(Q). As Q was arbitrary, the convergence is local.

Depends on

Used by

Dependency tree · two levels

51 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