Alphabeta Math
AlgorithmAlgorithm: AI-adaptedProof: Not applicablePipeline-generated
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.

Kahan compensated summation with range-failure status

Definition

For a finite list of n≥0 real floating-point inputs x1,…,xn, initialize s0=c0=0. For i=1,…,n compute yi=fl⁡(xi−ci−1), si=fl⁡(si−1+yi), di=fl⁡(si−si−1), and ci=fl⁡(di−yi), in that order. Return sn, or the first range-failure and its operation index.

Remarks

The separate Finite arithmetic schedules terminate, with early failure counted separately applies to the four ordered rounded operations at each input index. It gives finite execution with at most 4n attempted rounded operations and exactly 4n on success, including zero for n=0. The successful error identity is proved in Kahan and Neumaier summation satisfy explicit finite data-dependent error bounds.

Depends on

Used by

Dependency tree · two levels

3 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