Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge 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.

PCHIP slope selection

Definition

Inputs: An integer n≥2, strictly increasing real nodes x0<⋯<xn−1, and real values y0,…,yn−1. All operations here are over the real numbers.

Output: Slopes m0,…,mn−1 and the piecewise cubic Hermite interpolant determined by these nodes, values, and slopes under Piecewise cubic Hermite interpolant.

Put hi=xi+1−xi>0 and di=(yi+1−yi)/hi for 0≤i<n−1. Write sgn⁡(r)∈{−1,0,1} for the sign of a real number.

  • If n=2, set m0=m1=d0.
  • If n≥3, for each interior node 1≤k≤n−2, set mk=0 when dk−1dk≤0. When dk−1dk>0, put w1=2hk+hk−1, w2=hk+2hk−1, and mk=w1+w2w1/dk−1+w2/dk.
  • For n≥3, at the left endpoint compute m^0=(2h0+h1)d0−h0d1h0+h1. Set m0=0 if sgn⁡(m^0)≠sgn⁡(d0). Otherwise set m0=3d0 if d0d1<0 and ∣m^0∣>3∣d0∣; in all remaining cases set m0=m^0.
  • For n≥3, at the right endpoint compute m^n−1=(2hn−2+hn−3)dn−2−hn−2dn−3hn−2+hn−3. Apply the preceding clip and cap rule with d0,d1 replaced by dn−2,dn−3 and m0,m^0 replaced by mn−1,m^n−1.

For n≥3, the algorithm returns the Hermite pieces from the stated values and selected slopes. The two-node branch is the line through the two input points.

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