Alphabeta Math
Pipeline-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.

Two-stage conditional-error adaptation

1 · Prerequisites

2 · Summary

For one fixed null law and interim sigma-algebra, the page proves that an adapted design keeps its null rejection probability within the original conditional-error budget whenever its conditional probability of any eventual rejection is bounded almost surely by the original conditional error. A finite-size stratification lemma makes the selected-sample-size null law explicit. The stage-2 p-value corollary handles the random threshold p2≤A by finite dyadic approximations, so conditional superuniformity is required at each fixed threshold, not through an unproved jointly chosen conditional distribution. Fresh independent stage-2 data provide one route only when the null law at each selected size is stated and calibrated.

The scope is single-hypothesis two-stage sample-size or continuation adaptation. Conditional power is distinct from type-I control. Treatment allocation learning, endpoint selection, multiarm selection, and multi-stage closed testing are outside this page.

3 · Logical flowchart

4 · Definitions, theorems and proofs

LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Selected-size conditional validity yields a conditionally superuniform p-value

Statement

Assume AC. Let (Ω,F,P0) be a probability space, let F1⊆F be the interim sigma-algebra, let N be an F1-measurable sample size taking values in a nonempty set M⊆N>0, and let pN be the selected stage-2 p-value. For m∈M, put Dm={N=m}. Suppose that for every m∈M, every fixed u∈[0,1], and every H∈F1, P0(H∩Dm∩{pN≤u})≤uP0(H∩Dm). Then for every fixed u∈[0,1], E0[1{pN≤u}∣F1]≤ualmost surely. Thus conditional validity within each selected-size stratum implies conditional superuniformity after an interim-measurable finite sample size is selected, even when the set of allowed sample sizes is countably infinite.

Facts & Assumptions

Given: AC; a probability space (Ω,F,P0); a sub-sigma-algebra F1; a nonempty set M⊆N>0; an F1-measurable map N:Ω→M; a measurable p-value pN:Ω→[0,1]; and the displayed event inequality for every m,u,H.

[A1]

AC is assumed for the library's conditional-expectation existence interface. The Axiom of Choice

[F1]

Under AC, E0[X∣F1] is the unique almost-sure class of integrable F1-measurable versions satisfying the event-integral identities. Conditional expectation as an ae class

[F2]

A p-value is a measurable statistic with values in [0,1]; its null validity is the superuniform event inequality for each fixed u. Valid p-values

[F3]

A probability measure is a countably additive measure of total mass one. Probability measures and probability spaces Measures on sigma-algebras

[F4]

The integral of an event indicator is its probability. The expectation of an indicator is the probability of the event

[F5]

Conditional expectation preserves nonnegativity and order. Basic algebra and order properties of conditional expectation

[F6]

The nonnegative integral is monotone: if f≤g, then ∫f dμ≤∫g dμ. Monotonicity and nonnegative homogeneity of the nonnegative integral

Proof

technique · partition the event by selected sample size, then use the defining event integrals to verify the conditional bound
1.1givenF2F3

Fix u∈[0,1] and H∈F1. The event {pN≤u} is measurable by the p-value statistic definition [F2]. The events Dm, m∈M, are pairwise disjoint and partition Ω. Countable additivity [F3] gives P0(H∩{pN≤u})=∑m∈MP0(H∩Dm∩{pN≤u}) and P0(H)=∑m∈MP0(H∩Dm). Summing the assumed stratum inequalities over the increasing enumeration of M (equivalently, taking finite partial sums and then their limits) yields P0(H∩{pN≤u})≤uP0(H).

2.1A1F1F4F5F6step 1.1choosealgebra∎

Let Yu be a version of E0[1{pN≤u}∣F1], which exists by [A1] and [F1]. The event identities in [F1] and [F4] turn step 1.1 into ∫HYu dP0≤uP0(H) for every H∈F1. Also Yu≥0 almost surely by [F5]. If P0(Yu>u)>0, then for some integer k≥1 the set Hk={Yu≥u+1/k}∈F1 has positive probability, because {Yu>u}=⋃k≥1Hk. Monotonicity [F6] gives ∫HkYu dP0≥(u+1/k)P0(Hk)>uP0(Hk), contradicting the preceding event-integral bound. Thus Yu≤u almost surely. The argument is for each fixed u and does not assert a common exceptional set over uncountably many thresholds.

Source notes

The lemma is the local countable-stratification argument that makes the selected-size conditional law explicit. Sugiura–Uesaka describe fresh nonoverlapping stage samples and warn that the selected stage-2 sample size cannot simply replace the prespecified value in inverse-normal weights; Minas states conditional invariance for the stage-2 p-value after adaptation. Neither citation replaces the event-partition proof above.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Conditional-error budget for two-stage adaptation

Statement

Assume AC. Let P0 be one fixed null probability law on (Ω,F), and let F1⊆F be the interim sigma-algebra. Let R0∈F be the original design's rejection event, and let R1∈F be the adapted design's event of any eventual rejection, including early and final decisions. Choose versions A=E0[1R0∣F1],Q=E0[1R1∣F1]. For α∈[0,1], if P0(R0)≤α and Q≤A almost surely, then P0(R1)≤α. The original conditional error A is an almost-sure class; changing its version does not change any rejection probability.

Facts & Assumptions

Given: AC; one probability space and one fixed null law P0; a sub-sigma-algebra F1; events R0,R1∈F; α∈[0,1]; P0(R0)≤α; and versions A,Q of the stated conditional expectations with Q≤A almost surely.

[A1]

AC is assumed for the library's conditional-expectation existence interface. The Axiom of Choice

[F1]

Under AC, the conditional expectation is the unique almost-sure class of integrable, F1-measurable versions satisfying all F1 event-integral identities. Conditional expectation as an ae class

[F2]

Conditional expectation preserves order and ordinary expectation, and a constant is its own conditional expectation. Basic algebra and order properties of conditional expectation

[F3]

For nested sigma-algebras, conditioning twice gives the conditional expectation at the smaller sigma-algebra. Tower property of conditional expectation

[F4]

The expectation of an event indicator is the probability of that event. The expectation of an indicator is the probability of the event

Proof

technique · identify the mean conditional errors by the tower property, then compare their expectations
1.1A1F1F2

By [A1] and [F1], both conditional-expectation classes exist. Since 0≤1Rj≤1 for j=0,1, order preservation and the constant rule in [F2] give 0≤A,Q≤1 almost surely. All representatives of either class agree almost surely by [F1], so the rejection probabilities do not depend on the chosen versions.

2.1F2F3F4given∎

Let F0={∅,Ω}. By [F3], E0[A∣F0]=E0[1R0∣F0]. Each side is constant almost surely because it is F0-measurable; testing its defining event identity at Ω shows its constant is its ordinary expectation. Thus [F4] gives E0A=E01R0=P0(R0)≤α. The same argument gives E0Q=P0(R1). Order preservation [F2], applied to Q≤A with conditioning sigma-algebra F0, gives E0[Q∣F0]≤E0[A∣F0]; these constants are E0Q and E0A, so P0(R1)=E0Q≤E0A≤α.

Source notes

Both treatments express the global null rejection probability as the mean of the interim conditional rejection probability. The proof here states the event and sigma-algebra hypotheses directly and uses the published conditional-expectation tower and order properties; the source exposition alone is not used as a proof.

CorollaryStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

A conditionally superuniform stage-2 p-value preserves conditional error

Statement

Under the hypotheses and notation of Conditional-error budget for two-stage adaptation, let p2 be a measurable stage-2 p-value with values in [0,1]. Choose an F1-measurable representative A of the original conditional-error class that takes values in [0,1] everywhere; such a representative exists by clipping any version on its null exceptional set. Changing to this version changes R2 only on a null set. Suppose that for every fixed u∈[0,1], E0[1{p2≤u}∣F1]≤ualmost surely. Then the adapted rejection event R2={p2≤A} satisfies E0[1R2∣F1]≤Aalmost surely, and hence P0(R2)≤α. The conditional p-value inequality is assumed separately for each fixed u; no common exceptional set over all u∈[0,1] is required.

Facts & Assumptions

Given: AC; one fixed null law P0; a sub-sigma-algebra F1; an original rejection event with a conditional-error version A chosen to take values in [0,1] everywhere, and E0A=P0(R0)≤α; and a measurable stage-2 p-value p2 satisfying the displayed conditional inequality for every fixed u∈[0,1].

[A1]

AC supplies the conditional-expectation existence interface used for A and the rejection-event conditional expectation. The Axiom of Choice

[F1]

Conditional-expectation classes have measurable integrable versions satisfying the event-integral identities and are unique almost surely. Conditional expectation as an ae class

[F2]

A p-value statistic is measurable and takes values in [0,1]. Valid p-values

[F3]

If Z is bounded and F1-measurable, then E0[ZX∣F1]=ZE0[X∣F1]. Taking out what is known

[F4]

Conditional expectation preserves increasing limits of nonnegative variables and decreasing limits of integrable variables. Conditional monotone convergence

[F5]

Conditional expectation is linear, preserves constants, and preserves order. Basic algebra and order properties of conditional expectation

[F6]

If the adapted conditional rejection probability is at most A almost surely and E0A≤α, then the adapted null rejection probability is at most α. Conditional-error budget for two-stage adaptation

Proof

technique · approximate the interim-measurable threshold from above by finite-valued thresholds, then pass to the decreasing limit
1.1A1F1F2F3F5givenchoosealgebra

Conditional order and the constant rule [F5] give 0≤A≤1 almost surely. Clipping a version on the measurable null set where it leaves [0,1] preserves its conditional-expectation class and changes R2 only on a null set, so take 0≤A≤1 everywhere. For each integer n≥1, define An=2−n⌈2nA⌉. Its level sets are {An=0}={A=0} and {An=k2−n}={(k−1)2−n<A≤k2−n} for 1≤k≤2n, so they are in F1. The inequality ⌈2x⌉≤2⌈x⌉ shows An+1≤An, and 0≤An−A<2−n, hence An is finite-valued and An↓A. Write its values as tn,k=k2−n, k=0,…,2n, and put Sn,k={An=tn,k}. By [F2], the events {p2≤tn,k} are measurable. Let Qn=E0[1{p2≤An}∣F1]. The disjoint partition by Sn,k, linearity [F5], and taking out the bounded known indicator [F3] give Qn=∑k=02n1Sn,kE0[1{p2≤tn,k}∣F1]≤∑k=02ntn,k1Sn,k=An almost surely. For all n these inequalities hold on one probability-one set, because only countably many fixed dyadic thresholds occur.

2.1F4F5step 1.1algebra

The events Bn={p2≤An} decrease to B={p2≤A}. Their complement indicators are bounded and hence integrable, and increase to 1Bc. Thus [F4] gives E0[1Bnc∣F1]↑E0[1Bc∣F1] almost surely. By linearity and the constant rule [F5], this is equivalent to Qn↓Q:=E0[1B∣F1]. Taking limits in step 1.1 and using An↓A yields Q≤A almost surely.

3.1F6step 2.1∎

Apply [F6] to R2=B: its conditional rejection probability is the Q of step 2.1 and is at most A, while the original conditional-error budget has expectation at most α. Therefore P0(R2)≤α.

Source notes

The dyadic argument handles the random threshold without assuming a regular conditional distribution or a jointly chosen version of all fixed-threshold conditional probabilities. Conditional superuniformity at each fixed threshold is sufficient because the approximating thresholds use only countably many dyadic values.

5 · Examples, counterexamples and false statements

None yet.

Sources