Alphabeta Math
DefinitionDefinition: AI-adaptedProof: 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.

Canonical group-sequential alpha-spending design

Definition

Assume the Axiom of Choice (The Axiom of Choice). Fix a finite integer maximum K≥1, prescheduled information fractions 0<t1<⋯<tK=1 (where tj is the fraction of total planned information available at look j), and a nominal level α∈(0,1). An alpha-spending function is a nondecreasing map A:[0,1]→[0,α] with A(0)=0 and A(1)=α.

Under the stipulated simple null law P0, the standardized look vector is Z=(Z1,…,ZK)∼NK(0,Σ), where Σjk=tj/tk(j≤k),Σjk=Σkj(j>k). Here NK is the finite-dimensional multivariate normal law of Multivariate normal law, including singular covariance, whose projection characterization determines the law by Characteristic function of a multivariate normal law. The construction of this covariance matrix as a valid Gaussian covariance is proved in Group-sequential boundaries exist uniquely and spend alpha exactly ↗. The standardized coordinates are correlated; independence of the Zj is not assumed.

For a one-sided upper-boundary design, look j rejects when Zj≥bj. For a symmetric two-sided design, look j rejects when ∣Zj∣≥cj. In either case, the procedure stops at its first crossing. For each k, its cumulative type-I probability is the probability under the stipulated null law of crossing at one of looks 1,…,k. The design is exactly calibrated to A when this cumulative probability equals A(tk) for every k. If it is embedded in an experiment with a nonempty alternative and singleton null hypothesis, this null rejection probability is the test size in the sense of Test size and power.

The fractions and joint null law are assumptions of this definition. It does not derive a Gaussian model from an asymptotic central limit theorem, justify data-dependent look timing, justify estimated variance, or establish error control over an unspecified composite null. A two-sided design calibrates its two-sided crossing events separately; one-sided boundaries are not doubled to obtain two-sided boundaries.

Depends on

Used by

Dependency tree · two levels

44 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