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.

HLL depth flux is a bounded outflow/inflow combination

Statement

At a face of the scheme in Hydrostatic reconstruction with a dry-safe HLL flux and one-sided pressure corrections, write α=aR and β=−aL. There are coefficients p,q≥0 such that F^h=phL∗−qhR∗,p≤α,q≤β. If α>0 and hL∗>0, then p<α; if β>0 and hR∗>0, then q<β. These statements include the branches where one speed is zero and the all-dry branch.

Facts & Assumptions

Given: The hydrostatic reconstructed states, physical flux and HLL branch definitions. Derive the mass-flux coefficients and their bounds without assuming exact Riemann speeds.

[F1]

Hydrostatic reconstruction with a dry-safe HLL flux and one-sided pressure corrections: α=max⁡(0,uL∗+cL∗,uR∗+cR∗), β=max⁡(0,cL∗−uL∗,cR∗−uR∗), and the middle mass flux is the first component of the displayed HLL formula.

[F2]

Hydrostatic reconstruction with a dry-safe HLL flux and one-sided pressure corrections: Fh(Us∗)=hs∗us∗, and cs∗=ghs∗; when hs∗=0, both us∗ and F(Us∗) are zero.

Proof

1.1givenF1F2algebra

In the middle branch α,β>0. Define p=α(uL∗+β)/(α+β) and q=β(α−uR∗)/(α+β). Substituting aL=−β and aR=α into [F1], then using [F2], gives F^h=(αhL∗uL∗+βhR∗uR∗−αβ(hR∗−hL∗))/(α+β)=phL∗−qhR∗.

2.1F1F2step 1.1algebra

The speed definitions give uL∗+β≥cL∗≥0, α−uL∗≥cL∗≥0, α−uR∗≥cR∗≥0, and β+uR∗≥cR∗≥0. Hence the coefficients in step 1.1 satisfy p,q≥0, p≤α, and q≤β. When hL∗>0, cL∗>0 and α−uL∗>0, so p<α; when hR∗>0, cR∗>0 and β+uR∗>0, so q<β.

3.1F1F2step 2.1algebra∎

If aL=0<aR, the first HLL branch gives F^h=hL∗uL∗; the speed definitions imply uL∗≥cL∗≥0 and α≥uL∗+cL∗, so take p=uL∗ and q=0. If aL<0=aR, the second branch gives F^h=hR∗uR∗, with uR∗≤−cR∗≤0 and β≥cR∗−uR∗, so take p=0 and q=−uR∗. If both speeds vanish, their definitions force us∗−cs∗≥0 and us∗+cs∗≤0 on each side, hence cs∗=us∗=hs∗=0 and the first branch returns zero. These choices satisfy the bounds in step 2.1 and cover every equality-speed branch.

Depends on

Used by

Dependency tree · two levels

2 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