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.
The safeguarded Euler pressure solver preserves its root bracket and terminates
Statement
For admissible non-vacuum input data, the algorithm in Finite-budget safeguarded Newton–bisection for Euler star pressure terminates after at most outer iterations and returns either a singleton exact root, a bracket containing the unique from The ideal-gas star-pressure root exists uniquely exactly below vacuum threshold, or an explicit budget-exhausted status with that root still bracketed. After completed non-exact iterations the bracket width is at most . Thus any budget satisfying returns a pressure-bracket status. No floating-point or nonlinear convergence guarantee is asserted.
Facts & Assumptions
Given: An admissible non-vacuum Euler pressure problem, positive tolerance, finite budget, and the specified exact-arithmetic primitives.
The ideal-gas star-pressure root exists uniquely exactly below vacuum threshold: there is a unique with , initially bracketed by with ; is strictly increasing.
Finite-budget safeguarded Newton–bisection for Euler star pressure: each query is either the midpoint or a Newton iterate in the central quarter, and the endpoint with the same residual sign is replaced.
Finite-budget Newton for a square vector residual: on an open domain with a residual, finite budget returns one of its declared statuses and a last valid iterate.
Newton correction for a square vector residual: for a scalar residual, the correction procedure evaluates a one-by-one determinant and solves the single linear equation using Cramer's rule.
The algorithm's exact-arithmetic model assumes each scalar evaluation, comparison, square root, real power on a positive argument, and arithmetic operation returns in finite time.
Proof
At , [F2] initializes with by [F1], so it contains . This establishes the initial bracket.
Assume the current bracket contains with nonpositive left and nonnegative right residuals. A midpoint query lies in its central half; any accepted Newton query is in the central quarter, and all other Newton outcomes use the midpoint. By strict increase in [F1], a negative query residual leaves the root to its right and a positive one to its left, so the corresponding endpoint replacement preserves the bracket; an exact zero returns the singleton. Every nonexact query is at least one quarter of the old width from either endpoint, so the new width is at most of the old width.
Induction on completed nonexact queries using the base step 1.1 and the preserved-bracket transition in step 1.2 gives containment and width at most . Each outer pass calls the Newton procedure with budget , so [F3] supplies at most one correction and finitely many scalar residual evaluations; the one-dimensional correction is finite by [F4], and all primitive operations terminate by [A1]. At most passes therefore return one of the defined statuses.
If , the width test in [F2] succeeds no later than the final check, so the algorithm returns a pressure bracket unless it already returned an exact singleton. Otherwise a budget-exhausted result retains the bracket invariant from step 2.1.
Depends on
Used by
Dependency tree · two levels
14 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
- Randall J. LeVeque, Numerical Methods for Conservation Laws (standard reference, not scraped)
- E. Hairer and G. Wanner, Solving Ordinary Differential Equations II, Chapter VI: Iterative Methods—Nonlinear Equations (standard reference, not scraped)