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.
First-order HLL update preserves a convex invariant domain under admissible fan averages
Statement
Let be a convex set in the state domain, and consider a periodic uniform mesh and one first-order HLL update as defined in First-order finite-volume update using supplied HLL speeds. Assume every cell mean . At every face impose the HLL fan-average hypothesis that the two adjacent half-cell averages from First-order HLL updates are averages of adjacent half-cell fan averages lie in , with that lemma's local CFL bounds. Then every updated mean belongs to . A sufficient condition for the fan-average hypothesis is that every HLL intermediate state , because the stated CFL makes each half-cell average a convex combination of a cell state and . The result does not assert a bound on exact nonlinear wave speeds.
Facts & Assumptions
Given: A convex , cell means in , and the HLL half-cell fan-average hypothesis with its local CFL bounds. Prove one update remains in .
Convex invariant domains for a one-step update: convexity means every segment between two members of lies in .
First-order HLL updates are averages of adjacent half-cell fan averages: each is the mean of the right half-cell HLL average at the left face and the left half-cell HLL average at the right face.
Proof
At each face, the stated HLL fan-average hypothesis gives . In the sufficient intermediate-state case, the CFL bounds make the coefficients in each formula of [F2] nonnegative and sum to one, so convexity and give the same conclusion.
By [F2], . This is a convex combination of two members of , so for every cell. The argument is one-step and uses only the supplied HLL speeds and the explicit CFL bounds.
Depends on
Used by
Dependency tree · two levels
6 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
- J.-L. Guermond and B. Popov, Invariant Domains and First-Order Continuous Finite Element Approximation for Hyperbolic Systems (standard reference, not scraped)
- D. I. Ketcheson, R. J. LeVeque, and M. J. del Razo, Riemann Problems and Jupyter Solutions (standard reference, not scraped)