Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

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 N outer iterations and returns either a singleton exact root, a bracket containing the unique p∗ 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 k completed non-exact iterations the bracket width is at most (3/4)kP. Thus any budget satisfying (3/4)NP≤τ 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.

[F1]

The ideal-gas star-pressure root exists uniquely exactly below vacuum threshold: there is a unique p∗>0 with Φ(p∗)=0, initially bracketed by [0,P] with Φ(0+)<0<Φ(P); Φ is strictly increasing.

[F2]

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.

[F3]

Finite-budget Newton for a square vector residual: on an open domain with a C1 residual, finite budget 1 returns one of its declared statuses and a last valid iterate.

[F4]

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.

[A1]

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

1.1givenF1F2base

At k=0, [F2] initializes [0,P] with Φ(0+)<0<Φ(P) by [F1], so it contains p∗. This establishes the initial bracket.

1.2givenF1F2IHalgebra

Assume the current bracket contains p∗ 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 3/4 of the old width.

2.1step 1.1step 1.2F3F4A1IHinduction

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 (3/4)kP. Each outer pass calls the Newton procedure with budget 1, 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 N passes therefore return one of the defined statuses.

3.1step 2.1F1F2discharge-induction∎

If (3/4)NP≤τ, 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