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
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Estimators and Randomized Procedures
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- Tests, Neyman–Pearson and Valid P-values
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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 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
Selected-size conditional validity yields a conditionally superuniform p-value
Statement
Assume AC. Let be a probability space, let be the interim sigma-algebra, let be an -measurable sample size taking values in a nonempty set , and let be the selected stage-2 p-value. For , put . Suppose that for every , every fixed , and every , Then for every fixed , 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 ; a sub-sigma-algebra ; a nonempty set ; an -measurable map ; a measurable p-value ; and the displayed event inequality for every .
AC is assumed for the library's conditional-expectation existence interface. The Axiom of Choice
Under AC, is the unique almost-sure class of integrable -measurable versions satisfying the event-integral identities. Conditional expectation as an ae class
A p-value is a measurable statistic with values in ; its null validity is the superuniform event inequality for each fixed . Valid p-values
A probability measure is a countably additive measure of total mass one. Probability measures and probability spaces Measures on sigma-algebras
The integral of an event indicator is its probability. The expectation of an indicator is the probability of the event
Conditional expectation preserves nonnegativity and order. Basic algebra and order properties of conditional expectation
The nonnegative integral is monotone: if , then . Monotonicity and nonnegative homogeneity of the nonnegative integral
Proof
Fix and . The event is measurable by the p-value statistic definition [F2]. The events , , are pairwise disjoint and partition . Countable additivity [F3] gives and . Summing the assumed stratum inequalities over the increasing enumeration of (equivalently, taking finite partial sums and then their limits) yields .
Let be a version of , which exists by [A1] and [F1]. The event identities in [F1] and [F4] turn step 1.1 into for every . Also almost surely by [F5]. If , then for some integer the set has positive probability, because . Monotonicity [F6] gives , contradicting the preceding event-integral bound. Thus almost surely. The argument is for each fixed 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.
Conditional-error budget for two-stage adaptation
Statement
Assume AC. Let be one fixed null probability law on , and let be the interim sigma-algebra. Let be the original design's rejection event, and let be the adapted design's event of any eventual rejection, including early and final decisions. Choose versions For , if and almost surely, then . The original conditional error 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 ; a sub-sigma-algebra ; events ; ; ; and versions of the stated conditional expectations with almost surely.
AC is assumed for the library's conditional-expectation existence interface. The Axiom of Choice
Under AC, the conditional expectation is the unique almost-sure class of integrable, -measurable versions satisfying all event-integral identities. Conditional expectation as an ae class
Conditional expectation preserves order and ordinary expectation, and a constant is its own conditional expectation. Basic algebra and order properties of conditional expectation
For nested sigma-algebras, conditioning twice gives the conditional expectation at the smaller sigma-algebra. Tower property of conditional expectation
The expectation of an event indicator is the probability of that event. The expectation of an indicator is the probability of the event
Proof
By [A1] and [F1], both conditional-expectation classes exist. Since for , order preservation and the constant rule in [F2] give almost surely. All representatives of either class agree almost surely by [F1], so the rejection probabilities do not depend on the chosen versions.
Let . By [F3], . Each side is constant almost surely because it is -measurable; testing its defining event identity at shows its constant is its ordinary expectation. Thus [F4] gives . The same argument gives . Order preservation [F2], applied to with conditioning sigma-algebra , gives ; these constants are and , so .
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.
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 be a measurable stage-2 p-value with values in . Choose an -measurable representative of the original conditional-error class that takes values in everywhere; such a representative exists by clipping any version on its null exceptional set. Changing to this version changes only on a null set. Suppose that for every fixed , Then the adapted rejection event satisfies and hence . The conditional p-value inequality is assumed separately for each fixed ; no common exceptional set over all is required.
Facts & Assumptions
Given: AC; one fixed null law ; a sub-sigma-algebra ; an original rejection event with a conditional-error version chosen to take values in everywhere, and ; and a measurable stage-2 p-value satisfying the displayed conditional inequality for every fixed .
AC supplies the conditional-expectation existence interface used for and the rejection-event conditional expectation. The Axiom of Choice
Conditional-expectation classes have measurable integrable versions satisfying the event-integral identities and are unique almost surely. Conditional expectation as an ae class
A p-value statistic is measurable and takes values in . Valid p-values
If is bounded and -measurable, then . Taking out what is known
Conditional expectation preserves increasing limits of nonnegative variables and decreasing limits of integrable variables. Conditional monotone convergence
Conditional expectation is linear, preserves constants, and preserves order. Basic algebra and order properties of conditional expectation
If the adapted conditional rejection probability is at most almost surely and , then the adapted null rejection probability is at most . Conditional-error budget for two-stage adaptation
Proof
Conditional order and the constant rule [F5] give almost surely. Clipping a version on the measurable null set where it leaves preserves its conditional-expectation class and changes only on a null set, so take everywhere. For each integer , define . Its level sets are and for , so they are in . The inequality shows , and , hence is finite-valued and . Write its values as , , and put . By [F2], the events are measurable. Let . The disjoint partition by , linearity [F5], and taking out the bounded known indicator [F3] give almost surely. For all these inequalities hold on one probability-one set, because only countably many fixed dyadic thresholds occur.
The events decrease to . Their complement indicators are bounded and hence integrable, and increase to . Thus [F4] gives almost surely. By linearity and the constant rule [F5], this is equivalent to . Taking limits in step 1.1 and using yields almost surely.
Apply [F6] to : its conditional rejection probability is the of step 2.1 and is at most , while the original conditional-error budget has expectation at most . Therefore .
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.