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.

Sequential likelihood-ratio test

Definition

Assume the Axiom of Choice, which states that every family of nonempty sets has a choice function. Let (Ω,F,(Ft)t≥0) be a discrete filtration on a common measurable space and let P0,P1 be probability measures on it. Assume that for every t≥0, the restrictions P0∣Ft and P1∣Ft are mutually absolutely continuous: each restriction assigns measure zero to exactly the same Ft events as the other. For each t, choose a nonnegative Ft-measurable representative Lt of the likelihood-ratio density d(P1∣Ft)/d(P0∣Ft) Likelihood ratio as a Radon–Nikodym derivative. The filtration and stopping-time conventions are those of Filtration and filtered probability space and Discrete stopping time.

Input thresholds α,β∈(0,1). At times t=1,2,…, compute Lt and apply these instructions:

  1. If Lt≥1/α, stop and decide H1.
  2. Otherwise, if Lt≤β, stop and decide H0.
  3. Otherwise continue to the next observation.

The two boundaries are disjoint because β<1<1/α. The output time is τ=inf⁡{t≥1:Lt≥1/α or Lt≤β},inf⁡∅=∞. If τ=∞, the procedure has no finite terminal decision. It does not itself assert that a crossing occurs.

Depends on

Used by

Dependency tree · two levels

19 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