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 Validity and Ville's Inequality
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Conditional Distributions and Regular Conditional Probability
- 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
- Discrete Time Martingales
- 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
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- 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
- Stopping Times and Optional Stopping
- 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
Objective
Develop discrete-time, null-uniform validity for optional monitoring from nonnegative test supermartingales. Starting from the filtration, supermartingale, and bounded optional-sampling definitions, prove Ville's inequality by stopping at the first crossing truncated at a deterministic horizon and taking the increasing-event limit. Prove that a fixed product-measurable mixture of null test supermartingales remains a test supermartingale. Convert a test supermartingale into an anytime-valid p-value process and invert a parameter-indexed family into a confidence sequence. Every guarantee is under each law in the stated null family. The page makes no continuous-time, adaptive-allocation, or bandit claim.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Nonnegative test supermartingales
Definition
Assume the Axiom of Choice (AC) The Axiom of Choice. Let be a discrete filtration on a measurable space, and let be a family of probability laws on . A real-valued process is a nonnegative test supermartingale for if, for every , it is adapted and integrable under Filtration and filtered probability space Martingale submartingale and supermartingale, satisfies for every , and has .
The same process must satisfy the supermartingale condition under every law in the null family; that is what makes the definition uniform over a composite null. The initial value may be random and need not be bounded by one pointwise. Time starts at zero.
Remarks
A nonnegative test supermartingale is a standard sufficient process for anytime-valid testing. Some literature uses e-process for a broader class, allowing a process dominated under each null law by a different test martingale. This item defines the planned common test-supermartingale class; it does not assert that every e-process is itself a supermartingale.
Ville's inequality for nonnegative test supermartingales
Statement
Assume AC. Let be a family of probability laws on a common discrete filtered measurable space and let be a nonnegative test supermartingale for Nonnegative test supermartingales. For every and every ,
Facts & Assumptions
Given: Assume AC. If is empty the conclusion is vacuous; otherwise fix , , and the nonnegative test supermartingale . All stopping times below use the discrete filtration and time starts at zero.
Nonnegative test supermartingales: under every null law , is adapted, integrable, nonnegative almost surely at each time, a supermartingale, and .
Discrete stopping time: a map into is a stopping time when for each , and it is bounded if some deterministic satisfies almost surely.
Optional sampling for bounded stopping times: under AC, for bounded stopping times and a supermartingale the expectation inequality points downward.
Continuity from below for measures: for an increasing sequence of measurable events, the measure of the union is the limit of their measures.
The Axiom of Choice: AC supplies the conditional-expectation clauses used by the supermartingale definition and bounded optional-sampling theorem.
Proof
Fix any and define , with . For every , , so is a stopping time. Also for and is the whole space for , so each is a bounded stopping time.
The constant time is a stopping time bounded by , and step 1.1 shows is a bounded stopping time. Bounded optional sampling therefore gives .
On , ; on its complement the stopped value is almost surely. Hence , and step 2.1 yields .
The events increase with and their union is . Continuity from below and step 3.1 therefore give .
Let and suppose . Since , lies in , so . If every , then , contrary to ; hence even if the supremum is not attained. Step 4.1 with gives , a contradiction. Therefore , and since was arbitrary, the bound holds under every null law.
Mixtures of null test supermartingales
Statement
Assume AC. Let be a probability space and let be a family of laws on a common discrete filtered measurable space . For each , let be a nonnegative test supermartingale for . Suppose that, for every , the map is measurable with respect to . Before mixing, take its pointwise nonnegative version , and define Then is a nonnegative test supermartingale for . The modification on the infinite-integral set makes a real-valued version common to all null laws.
Facts & Assumptions
Given: Assume AC. Let , , and the product-measurable family of component test supermartingales satisfy the Statement. If is empty, its lawwise conclusion is vacuous; otherwise fix any when checking the test-supermartingale conditions.
Nonnegative test supermartingales: under each , every component is nonnegative, adapted, integrable, a supermartingale, and has initial expectation at most one.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for a nonnegative product-measurable function, section integrals are measurable and the product integral equals either iterated integral.
Optional sampling for bounded stopping times: under AC, bounded stopping of a supermartingale gives a downward expectation inequality; deterministic times are bounded stopping times.
Conditional expectation as an ae class: under AC, the conditional-expectation class exists and is represented by conditional-expectation versions.
Conditional expectation given a sigma algebra: a conditional-expectation version is measurable and has the same integral as the original variable on every event in the conditioning sigma-algebra.
The Axiom of Choice: AC supplies conditional-expectation classes used in the supermartingale and optional-sampling clauses.
Proof
Fix and . For every , , so -almost surely and has the same expectation. Apply F3 at the deterministic times and to get . The pointwise nonnegative map is product-measurable; Tonelli F2 makes -measurable and gives . Hence is null under every . The common modification off and on is finite, adapted, nonnegative and integrable under every null law, with .
Fix , , and . Since -almost surely for , the component supermartingale condition and the event-integral identity F5 give for every . Tonelli F2 integrates these inequalities over ; since and are -null, replacing the mixtures by and does not change these integrals. Thus .
Let , which exists by F4 and AC A1. For every , the event-integral identity F5 and step 2.1 give . Take . If , then for some integer the subset where has positive measure, making that integral strictly positive, a contradiction. Therefore almost surely. As and were arbitrary, is a test supermartingale for .
Anytime-valid p-value processes
Definition
Let be a family of probability laws on a common discrete filtered probability space . A process is an anytime-valid p-value process for if each is -measurable with values in and, for every and ,
At time , the rejection rule at threshold is the -measurable test function in the sense of Randomized tests: the indicator supplies a binary probability kernel by Every measurable rejection function defines a randomized test. For any stopping time Discrete stopping time, the rejection event is For , ; for , by the stopping-time condition and filtration property. Thus each term is in , so this event is measurable and is contained in the all-times crossing event; the definition therefore controls rejection after data-dependent stopping.
A test supermartingale gives anytime-valid p-values
Statement
Assume AC. Let be a nonnegative test supermartingale Nonnegative test supermartingales for a null family . Define Then is an anytime-valid p-value process for Anytime-valid p-value processes. For every , fixed , and , . For every possibly unbounded stopping time and ,
Facts & Assumptions
Given: Assume AC. Let be a null family, a nonnegative test supermartingale for that family, and the process in the Statement.
Nonnegative test supermartingales: under every , each is a finite real-valued measurable random variable and is nonnegative almost surely.
Anytime-valid p-value processes: an adapted -valued process is anytime-valid when every null law bounds its all-times crossing event by the threshold.
Ville's inequality for nonnegative test supermartingales: for every null law and , .
Valid p-values: a measurable -valued statistic is a valid p-value for a nonempty null when every null law satisfies for all .
The Axiom of Choice: AC is the assumption used by the supermartingale conditional-expectation convention and Ville's bounded optional-sampling proof.
Proof
The map defined by for and for is Borel measurable. Thus is -measurable and -valued. For , the threshold , so holds exactly when .
Taking the union over all in the equivalence of step 1.1 and applying F3 gives for every . This is the defining anytime-valid condition.
For a fixed and , , so its probability is at most by step 2.1. Since is finite, ; hence the bound at is zero, and at it is trivial. For any stopping time , is contained in the all-times crossing event for ; the endpoints follow as above. Thus fixed-time and stopping-time validity both hold.
If is nonempty, form the fixed-time experiment with data space , parameter set , laws given by restriction to , and null set . The observation is the identity map from the original sample space to this data space. Step 1.1 makes a statistic and step 3.1 gives its superuniform inequality under every law in , so F4 makes it a valid p-value in this experiment. If is empty, all lawwise assertions are vacuous.
Confidence sequences
Definition
Let be a parameter set and a family of probability laws on a common discrete filtered measurable space Filtration and filtered probability space. For , a confidence sequence is a sequence of set-valued rules such that, for each fixed , the membership event belongs to for every and
The coverage is simultaneous over all discrete times. The definition makes no claim of conditional-on-covariates coverage or validity under a changed sampling law.
Confidence sequences by test-supermartingale inversion
Statement
Assume AC and fix . Let be a parameter set, a family of laws on a common discrete filtered measurable space, and, for each , let be a nonnegative test supermartingale for the singleton null family . Define Then is a confidence sequence Confidence sequences.
No measurable structure on or joint measurability across is needed for this pointwise membership and coverage statement.
Facts & Assumptions
Given: Assume AC, , the parameter family, and the candidate test-supermartingale for each . If is empty the conclusion is vacuous; otherwise fix an arbitrary when proving its coverage bound.
Nonnegative test supermartingales: for each fixed , is adapted and nonnegative under .
A test supermartingale gives anytime-valid p-values: transforming a test supermartingale by when and otherwise gives an anytime-valid p-value process under its null law.
Confidence sequences: each fixed-parameter membership event must be adapted and the true parameter must be covered simultaneously with probability at least .
The Axiom of Choice: AC is required by the conditional-expectation convention in the test-supermartingale definition and its validity theorem.
Proof
Fix . Under , define when and otherwise. By adaptedness in F1 and the Borel transformation used in F2, each is -measurable. Hence is -measurable.
For this fixed , F2 gives . The complement is exactly , whose probability is therefore at least .
Steps 1.1 and 2.1 hold for every . They give the membership measurability and simultaneous-coverage clauses in F3, so is a confidence sequence.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Aaditya Ramdas, Peter Grunwald, Vladimir Vovk and Glenn Shafer, Game-Theoretic Statistics and Safe Anytime-Valid Inference, §§2.2-2.4
- Aaditya Ramdas, Peter Grunwald, Vladimir Vovk and Glenn Shafer, Game-Theoretic Statistics and Safe Anytime-Valid Inference, §2.5
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe and Jasjeet Sekhon, Time-Uniform, Nonparametric, Nonasymptotic Confidence Sequences, Lemma 2 and Appendix A.3
- Robert L. Wolpert, STA 711 Martingales lecture notes, §1
- Aaditya Ramdas, Peter Grunwald, Vladimir Vovk and Glenn Shafer, Game-Theoretic Statistics and Safe Anytime-Valid Inference, §§2.3-2.4
- Aaditya Ramdas, Peter Grunwald, Vladimir Vovk and Glenn Shafer, Game-Theoretic Statistics and Safe Anytime-Valid Inference, §2.7
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe and Jasjeet Sekhon, Time-Uniform, Nonparametric, Nonasymptotic Confidence Sequences, Lemma 3 and §6
- Aaditya Ramdas, Peter Grunwald, Vladimir Vovk and Glenn Shafer, Game-Theoretic Statistics and Safe Anytime-Valid Inference, §§2.5 and 2.7
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe and Jasjeet Sekhon, Time-Uniform, Nonparametric, Nonasymptotic Confidence Sequences, Introduction
- Aaditya Ramdas, Peter Grunwald, Vladimir Vovk and Glenn Shafer, Game-Theoretic Statistics and Safe Anytime-Valid Inference, §2.8