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.
PCHIP slope selection has no zero denominator
Statement
For every admissible input to PCHIP slope selection, each branch is defined over and every selected slope is finite; in particular, the algorithm never divides by zero.
Facts & Assumptions
Given: A finite strictly increasing real node list with at least two nodes and real data values.
PCHIP slope selection: widths are positive; the only interior division by a secant occurs when the two adjacent secants have positive product; endpoint formulas divide by a sum of positive widths; and the two-node branch uses one secant.
Proof
Each is positive, so every secant is defined and finite. In the two-node branch both slopes equal the already defined secant, and neither endpoint formula is evaluated. When , the endpoint denominators and exist and are positive.
The interior harmonic-mean branch is entered only when . Thus both secants are nonzero and have the same sign; the weights and are positive. The two terms and therefore have that same nonzero sign, so their sum is nonzero and finite. The endpoint clip and cap branches only compare finite real quantities and introduce no division. Hence every output slope is defined and finite.
Depends on
Used by
- PCHIP slopes are second-order accurate on uniform nonstationary grids Lemma
- PCHIP endpoint slopes lie in the Hermite monotonicity square Theorem
- PCHIP has third-order value accuracy on uniform nonstationary grids Theorem
- PCHIP is C1, monotone on each data segment, and has no interval overshoot Theorem
Cited to discharge well-definedness by PCHIP slope selection.
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.