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.
Empirical-Process Complexity — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- 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
- Empirical-Process Complexity
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Algebra Methods in Combinatorics
- 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
- Simple Field Extensions and the Construction of the Complex Numbers
- Suprema and Infima
- 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 Riemann Integral: Definition and Integrability
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
The finite Bernoulli example computes a one-sided empirical Rademacher complexity and its uniform deviation directly. The threshold counterexample uses finite uniform sample spaces to show why the VC entropy growth must retain its dependence on . The uncountable-class example states its Countable Choice assumption and shows that separate measurability of every function need not make the empirical supremum measurable.
3 · Logical flowchart
4 · Definitions, theorems and proofs
An uncountable class can have a nonmeasurable empirical supremum
Statement
Assume Countable Choice. Let , let be the countable-cocountable sigma-algebra, and define
For , take the uncountable class of functions with . Every is measurable and , but for one observation ,
which is not measurable because is neither countable nor cocountable.
Facts & Assumptions
Given: The Axiom of Countable Choice and the stated .
Countable Choice implies that a countable union of at most countable sets is at most countable (The Axiom of Countable Choice (), Countable unions of at most countable sets, assuming ). The sigma-algebra closure of the stated family is established locally in step 1.1.
Every nondegenerate real interval is uncountable (Every nondegenerate interval of is uncountable).
Every singleton is countable and every subset of a countable set is countable (Finite, countably infinite, countable, uncountable, Every subset of an at most countable set is at most countable).
A probability measure is a countably additive measure of total mass one (Measures on sigma-algebras, Probability measures and probability spaces).
For one observation, the empirical average is and is the integral of (Empirical, centered, and Rademacher processes).
A family containing the empty set and closed under complements and countable unions is a sigma-algebra (Sigma-algebras).
Proof
Given: The Axiom of Countable Choice and the objects of the Counterexample.
By [F1], is uncountable. The empty set is at most countable, and complementation exchanges the countable and cocountable alternatives, so contains the empty set and is complement-closed. For a sequence in , if every is countable then [A1] makes their union countable; otherwise some is cocountable, and is countable by [F2]. Thus the union lies in in either case, proving all sigma-algebra axioms in [F5]. The assignment is well-defined: a set and its complement cannot both be countable, since their union would make countable.
Let be pairwise disjoint members of . If every is countable, [A1] makes their union countable; then . Otherwise choose with cocountable. For , disjointness gives , a countable set, so [F2] makes countable. The union is cocountable and its measure is . Also and is nonnegative, so [F3] shows that is a probability measure.
Regard as the observation space and let be its identity random element, which has law . For each , the singleton is in by [F2], so is measurable and . If , then and , so is injective; since is uncountable by [F1], is uncountable.
For any , if then the index gives , while if every differs from and all the function values are zero. Hence the displayed supremum equals . Both and contain a nondegenerate interval and are uncountable by [F1]; therefore , so the supremum is nonmeasurable.
Finite thresholds rule out an r-independent VC covering bound
Statement
For each positive integer , let be the natural number obtained by multiplying by itself times. Equip with the uniform probability . For , define the threshold function , with . Put .
These are nested threshold indicators. Their VC-subgraph index is , while for and ,
Thus a purported entropy bound whose right side has no dependence on is false even when the VC index is fixed.
Facts & Assumptions
Given: A positive integer , the finite uniform probability space, and the threshold class in the Counterexample.
A class of functions is VC-subgraph when its measurable strict subgraphs have finite VC index (VC-subgraph classes, envelopes, and the first-unshattered index); for set classes, the index is one plus the VC dimension (Shattering, VC dimension, and first-unshattered index for set classes).
The distance is the th-root of the integral of the absolute difference to power , and covers use centers in the class (Covering, packing, bracketing numbers, and metric entropy).
Positive-base real powers satisfy , are defined by , and agree with rational powers at rational exponents (Real powers for positive bases, with the zero-base positive-exponent convention, The exponent, product, quotient, and iterated-power laws for positive real bases and real exponents, Rational powers of a positive base, Laws of rational exponents, The exponential definition of real powers agrees with the existing rational powers, Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm).
A finite uniform law assigns mass to each of its points and is a probability measure by finite additivity (Probability measures and probability spaces).
The natural powers grow beyond every fixed real bound: by the binomial theorem, and the Archimedean property supplies arbitrarily large (Integer powers , The binomial theorem in : , Every complete ordered field is Archimedean).
Proof
Given: The data in the Counterexample.
The real-power definition gives . Its exponent law gives for every natural , so induction identifies the real power with the natural product defining . By [F3],
The subgraphs are nested in increasing . A point belongs to and not to , so a singleton is shattered. No two-point set is shattered by a nested family, since shattering would require both opposite singleton traces, which nested sets cannot realize. Therefore the VC-subgraph dimension is exactly one and its index is .
For , the functions differ on exactly atoms. By [F2] and [F4],
Since , a closed ball of radius centered at a class member cannot contain two distinct class members: the triangle inequality would make their distance at most . Thus every cover needs at least centers; taking each member as its own center gives a cover with . This proves the exact covering number.
Fix any proposed finite right side that depends only on , the VC index, and constants independent of . At and it is a fixed finite number. By [F5], choose so large that exceeds that number. Step 3.1 then contradicts the proposed bound, so this family rules out a VC covering bound whose right-hand side is independent of .
A two-function class on a Bernoulli sample
Example
Let with . Let , and take the two-function class with and .
Facts & Assumptions
Given: The Bernoulli probability space, the observation , and the class .
, , and the empirical Rademacher process is (Empirical, centered, and Rademacher processes).
For one observation, (One-sided empirical Rademacher complexity).
A finite nonempty class of measurable -valued functions satisfies for every (Uniform deviation bound for a finite unit-range class).
Proof
Given: The sample and class of the Example.
Direct evaluation gives , , , and . Hence for both possible observations.
If , then for either sign. If , then , whose uniform-sign expectation is . Thus and its expectation over the sample is .
Applying [F3] with and gives for every . At the event has probability one by step 1.1, and the displayed estimate is the stated finite-class guarantee for this class.
5 · Examples, counterexamples and false statements
None yet.
Sources
- David Pollard, Probability Tools, Tricks, and Miracles, 2026 manuscript, Section 13.3
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Sections 5-6
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, Theorem 8.1
- David Pollard, Probability Tools, Tricks, and Miracles, 2026 manuscript, Section 14.5
- Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar, Foundations of Machine Learning, 2nd ed., Chapter 3
- Philippe Rigollet and Jan-Christian Hütter, High-Dimensional Statistics: Lecture Notes, Chapter 1