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.

Empirical-Bernstein confidence-sequence interval update

Definition

Inputs are real bounds a≤b, a nominal error level δ∈(0,1), an observation stream (Xt)t≥1 with Xt∈[a,b] almost surely and Xt measurable with respect to Ft, a forecast stream (X^t)t≥1 with X^t∈[a,b] almost surely and X^t measurable with respect to Ft−1, and, when c=b−a>0, an evaluation procedure for a Borel one-sided sub-exponential uniform boundary uδ/2,c with crossing probability δ/2 and scale c. The output is one interval Ct at each positive integer time t.

  1. If c=0, return Ct=[a,a] at each time.

  2. If c>0, initialize Xˉ0=0 and V0=0. After receiving forecast X^t and then observation Xt, update Xˉt=(1−1t)Xˉt−1+Xtt,Vt=Vt−1+(Xt−X^t)2. Return Ct=[Xˉt−uδ/2,c(Vt)t,  Xˉt+uδ/2,c(Vt)t].

The procedure uses observations only through time t. The accumulated quantity Vt is the observed sum of squared forecast errors; it is not a predictable conditional-variance process.

Definition references

Filtration and filtered probability space: Ft records information available at integer time t.

Predictable discrete time process: the forecast at time t is measurable with respect to Ft−1 before the observation at time t.

One-sided sub-exponential uniform boundary: the supplied boundary has the stated scale and crossing-probability guarantee.

Confidence sequence for a time-varying target: the output intervals are considered for simultaneous coverage of a target process.

A Howard et al., Theorem 4, §4.1

Depends on

Used by

Dependency tree · two levels

11 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