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.
Sub-Gaussian mixture confidence sequences
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Compactness
- 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
- Determinants of Matrices over a Commutative Ring
- Discrete test supermartingales and Ville
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- 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
- Outer Measure and the Caratheodory Extension Theorem
- 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
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Sequential Validity and Ville's Inequality
- 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
- Sine, Cosine, and the Definition of Pi
- Stopping Times and Optional Stopping
- Subspaces, Products, and Quotients
- Suprema and Infima
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- 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 in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- 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
- Weak Convergence Tightness and Representation
2 · Summary
Objective
This page derives a time-uniform confidence sequence for a scalar mean from a discrete-time conditional moment-generating-function bound. At every step and for every real tuning value, the increment around the fixed mean must satisfy the same known sub-Gaussian proxy bound given the past. Independence and identical distribution are not required.
The proof builds the fixed-parameter exponential supermartingales, mixes them over a centered normal law with precision , evaluates the Gaussian integral, and converts the crossing boundary into closed intervals. The simultaneous coverage guarantee follows from Ville's inequality. The proxy is an upper mgf bound, not a claim that it equals the variance.
Marginal sub-Gaussianity alone does not supply the conditional premise, as the repeated-Rademacher example shows; finite variance alone need not even give a marginal sub-Gaussian bound (Finite variance does not imply a sub-Gaussian tail). This is a discrete-time statement; no continuous-time extension or conditional-on-covariates guarantee is asserted.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Conditionally sub-Gaussian increments
Definition
Assume the Axiom of Choice (AC) The Axiom of Choice for the conditional-expectation existence convention. Let be a discrete filtered probability space Filtration and filtered probability space, and let be a real-valued adapted process Adapted and integrable stochastic process. Fix and a proxy . The increments are conditionally sub-Gaussian around with proxy when, for every integer and every fixed , is integrable and where conditional expectation means the class of integrable versions of Conditional expectation as an ae class represented as in Conditional expectation given a sigma algebra. The exceptional null set may depend on and ; no common null set over the uncountable set is assumed.
The integrability of follows from the two cases and : conditional expectation preserves the integral, so both and have finite expectation, and . The proxy is an upper bound in the conditional moment-generating-function inequality; it is not asserted to be a variance. Independence and identical distribution of the increments are not part of this definition.
Gaussian-mixture confidence-sequence boundary
Definition
Let be a supplied scale, let be a tuning parameter, and let . For define The expression is real because . For a real data sequence , set and define The endpoints are included. This definition specifies an interval rule only; it makes no coverage or time-uniform validity assertion.
Closed form for a Gaussian exponential mixture
Statement
Assume AC. For , , and , let under the normal-law convention of Standard normal and normal laws. Then
Facts & Assumptions
Given: Assume AC, , , and .
Standard normal and normal laws: is the law of the affine image of the standard normal law, whose density is .
Change of variables for expectation: Integrating a nonnegative measurable function against a random element's law equals its expectation on the underlying space.
The standard normal density has total mass one: The standard normal density integrates to one.
A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions: If is a diffeomorphism between open subsets of and is Lebesgue measurable, then, assuming countable choice,
Continuous functions on Euclidean spaces are Borel measurable and Assuming countable choice, every Borel subset of is Lebesgue measurable: Under countable choice, every continuous function on is Borel measurable, and every Borel set is Lebesgue measurable.
Square roots exist: a unique with ; the positives are : Every nonnegative real has a unique nonnegative square root.
The Axiom of Choice: AC asserts that every family of nonempty sets has a choice function; it is assumed here.
The Axiom of Countable Choice (): AC implies countable choice, so the countable-choice premise of [F4] follows from the assumed AC.
Proof
Let have the standard normal law. By [F1] and [F6], has law ; [F2] and the density in [F1] give with a continuous nonnegative integrand, which [F5] makes Lebesgue measurable.
Set and . Completing the square in [step 1.1] gives The map has the inverse , so it is a diffeomorphism from to , and . The function is continuous and nonnegative, hence Lebesgue measurable by [F5]. By [A2], AC supplies the countable-choice hypothesis of [F4]; applying [F4] to and gives by [F3]. Therefore .
Conditional sub-Gaussian increments generate exponential test supermartingales
Statement
Assume AC and let , , , and satisfy Conditionally sub-Gaussian increments. For each fixed , set Then is a nonnegative test supermartingale for the singleton null family , with .
Facts & Assumptions
Given: Assume AC, the conditional sub-Gaussian model, and a fixed real .
Conditionally sub-Gaussian increments: for each and fixed , is integrable and its conditional expectation given is at most almost surely.
Taking out what is known: a bounded measurable factor can be taken out of a conditional expectation; the identity also holds for finite measurable factors when both products are integrable.
Monotone convergence for the integral: an increasing sequence of nonnegative measurable functions has integrals increasing to the integral of its pointwise limit.
Martingale submartingale and supermartingale: an adapted integrable process is a supermartingale when almost surely at every adjacent pair.
Nonnegative test supermartingales: under AC, an adapted, integrable, almost surely nonnegative supermartingale with initial expectation at most one is a nonnegative test supermartingale.
The Axiom of Choice: AC supplies the conditional-expectation convention used in the supermartingale and test-supermartingale definitions.
Proof
Fix , put and . By [F1], is integrable and . Starting from , suppose is integrable and let . The bounded-factor clause of [F2] gives . Since , [F3] shows is integrable and . Thus induction establishes integrability at every time.
The process is adapted and nonnegative by its definition. Since and both products are integrable by step 1.1, the unbounded-factor clause of [F2] gives . Also . Therefore [F4] and [F5] give the asserted test-supermartingale property.
The Gaussian-mixture threshold is the stated square-root boundary
Statement
Let , , , and . Define For from Gaussian-mixture confidence-sequence boundary,
Facts & Assumptions
Given: , , , and .
Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: the natural logarithm is strictly increasing on and satisfies for positive .
Square roots exist: a unique with ; the positives are : every nonnegative real has a unique nonnegative square root.
Proof
Since , applying the strictly increasing logarithm [F2] shows iff . Multiplying by and combining logarithms gives .
The ratio exceeds , so its logarithm is positive and [F3] supplies the nonnegative root in [F1]. Thus the last inequality in step 1.1 is exactly .
The Gaussian mixture is a sub-Gaussian test supermartingale
Statement
Assume AC. Let and satisfy Conditionally sub-Gaussian increments for with known proxy . Fix . Define , , , and Then is a nonnegative test supermartingale for , with .
Facts & Assumptions
Given: Assume AC and the conditional sub-Gaussian model for fixed , , and .
Conditional sub-Gaussian increments generate exponential test supermartingales: for each fixed , is a nonnegative test supermartingale with initial value one.
Mixtures of null test supermartingales: if each component is a nonnegative test supermartingale under every null law and is product-measurable, its probability mixture is a test supermartingale; the theorem uses a real-valued modification only where the integral is infinite.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for sigma-finite measure spaces and nonnegative product-measurable functions, section integrals are measurable and equal the corresponding iterated integrals.
Closed form for a Gaussian exponential mixture: for , , and , the mixture of under equals .
Standard normal and normal laws: is a probability law under the affine-image normal-law convention.
The Axiom of Choice: AC is required by the conditional-expectation and test-supermartingale conventions in [F1] and [F2].
Proof
For each fixed , [F1] supplies the component process . At fixed , is -measurable, so is measurable on : it is the composition of the measurable coordinate maps with continuous arithmetic and exponential operations. Each component is nonnegative.
Mix these components using the probability law from [F5]. Both this prior and are probability measures, hence sigma-finite. The product-measurability in step 1.1 and the component conditions in [F1] meet [F2]; [F3] gives the needed measurable nonnegative section integrals. Therefore the mixture process is a nonnegative test supermartingale. By [F4] its value is the displayed finite formula for every finite , so the mixture theorem's infinite-integral modification is never applied. At the formula gives .
A Gaussian mixture confidence sequence for conditional sub-Gaussian means
Statement
Assume AC. Let , let be a common discrete filtered measurable space, and let be a family of probability laws on it. Let be a common real-valued process that is adapted under each , and suppose that for every its increments are conditionally sub-Gaussian around with the same known proxy under in the sense of Conditionally sub-Gaussian increments. Fix and . For , set where is from Gaussian-mixture confidence-sequence boundary, and set . Then is a confidence sequence for : The claim is pointwise in and requires no measurable structure on , independence, or identical distribution of the observations.
Facts & Assumptions
Given: Assume AC and all data, law, filtration, proxy, and tuning hypotheses in the Statement.
Conditionally sub-Gaussian increments: for each fixed , time , and , the conditional mgf of given is at most almost surely.
The Gaussian mixture is a sub-Gaussian test supermartingale: under each , is a nonnegative test supermartingale with .
Discrete Ville inequality and anytime threshold validity: under AC, for every null law and each , a nonnegative test supermartingale has .
Confidence sequences: a confidence sequence has -measurable membership events and covers each true parameter at all integer times with probability at least .
The Axiom of Choice: AC supplies the conditional-expectation and test-supermartingale conventions used in [F2] and [F4].
Proof
Fix . The process is adapted under , so each for and hence is -measurable. Therefore is -measurable for every , and it is the whole space at .
For , if , the interval in the Statement has closed endpoints, so . By [F3], this implies . Consequently the event that is ever excluded from is contained in .
By [F2] and Ville's inequality [F4], the latter event has -probability at most . Its complement therefore has probability at least and is contained in . Since [F5] requires exactly these membership and coverage clauses, is a confidence sequence.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform, nonparametric, nonasymptotic confidence sequences, The Annals of Statistics 49(2) (2021), §§2–3
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform Chernoff bounds via nonnegative supermartingales, Probability Surveys 17 (2020), Definition 1
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform, nonparametric, nonasymptotic confidence sequences, Proposition 5
- Aaditya Ramdas, Martingales 1: Concentration Inequalities — Conjugate Mixtures, 36-771 lecture notes, Carnegie Mellon University, Fall 2018, Proposition 1
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform, nonparametric, nonasymptotic confidence sequences, Proposition 5 and Appendix A.3
- Aaditya Ramdas, Martingales 1: Concentration Inequalities — Conjugate Mixtures, 36-771 lecture notes, Carnegie Mellon University, Fall 2018
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform Chernoff bounds via nonnegative supermartingales, Probability Surveys 17 (2020), §§2.1–2.2
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform, nonparametric, nonasymptotic confidence sequences, §2
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform, nonparametric, nonasymptotic confidence sequences, Lemma 2 and Appendix A.3
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform, nonparametric, nonasymptotic confidence sequences, Lemma 2, Proposition 5, and Appendix A.3
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform Chernoff bounds via nonnegative supermartingales, Theorem 1 and §2.3