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.
Chaining and Uniform Limits — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Chaining and Uniform Limits
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Concentration
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Consistency and Limiting Distributions
- 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
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Empirical-Process Complexity
- Equivalent Forms of Completeness
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- 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
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- 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
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- 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
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- 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
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Strong Laws of Large Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- 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 Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
The finite-subset counterexample separates pointwise strong laws from a uniform law by choosing the realized finite sample as the witnessing set. Under Countable Choice, deterministic interval brackets show that the Uniform threshold class is strongly Glivenko–Cantelli. Under AC, the same brackets have integrable square-root entropy and give a functional empirical-CDF limit; direct covariance calculation identifies its tight Gaussian bridge as the standard Brownian bridge.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Pointwise strong laws need not give a uniform law
Statement refuted
The assertion that pointwise strong laws for every member of a class imply a uniform law of large numbers is false without a class-separability or entropy hypothesis.
Witness
Let be iid Uniform and let be the class of all finite subsets of , with indicator class . For every fixed , almost surely, but for every and every realized sample,
Facts & Assumptions
Given: The iid Uniform sequence and the class of all finite subsets of .
Identical distribution and IID families: iid observations are independent and each has the same law .
Uniform law convention: every interval is Borel and equals its interval length.
Empirical, centered, and Rademacher processes: . Its current carrier and batch-15 manifest entry agree, and its current owner Step 1 record marks it construction-ready; that status is not independent mathematical approval.
Basic identities for a probability measure: finite and countable subadditivity give the finite-union and countable-union probability bounds.
Glivenko–Cantelli classes: a class is -Glivenko–Cantelli if in probability.
Refutation
Fix a finite set . If , then . Otherwise write . Given , for each let . These intervals cover , and each has length at most . By [A1] and finite subadditivity [F2], . Since this holds for every , . By [F1], each event has probability zero; countable subadditivity [F2] gives . Hence with probability one for every . This proves the pointwise strong law for this fixed , without asserting one common event for all finite sets.
For any realized finite sample , the set is finite, so , , and . Every indicator deviation is at most one, so the supremum over equals one for every sample. This supremum is the constant measurable function one; by [F4] it does not converge to zero in probability.
The uniform threshold class is Glivenko–Cantelli
Example
Assume Countable Choice. Let be uniform probability on , let be iid with law , and let Then is strongly -Glivenko–Cantelli:
Facts & Assumptions
Given: Countable Choice, the iid Uniform experiment, the threshold class , and the bracketing Glivenko–Cantelli theorem.
for , and the envelope is integrable.
Countable Choice supplies the theorem's strong-law branch and, for each fixed , a sequence of rational approximants chosen from the intervals (The Axiom of Countable Choice ()).
Glivenko–Cantelli classes: uniform convergence of to over the class defines the Glivenko–Cantelli property.
Covering, packing, bracketing numbers, and metric entropy: an bracket has measurable endpoints, contains functions lying between them -almost everywhere, and has width .
Empirical, centered, and Rademacher processes: for iid observations, and .
Glivenko–Cantelli theorem by bracketing entropy: a pointwise-measurable class with an integrable envelope and finite bracketing number at every positive scale is strongly -Glivenko–Cantelli when Countable Choice is assumed.
is countably infinite: is countable.
Every subset of an at most countable set is at most countable: every subset of an at most countable set is at most countable.
The rationals embed densely in the reals: between any two distinct real numbers there is a rational.
Verification
Given: The objects and facts above.
The class is pointwise measurable. Since , the rational thresholds together with are indexed by , a countable set by [F5]–[F6]. For each fixed , Countable Choice [A2] selects , which exist by [F7]. Then from above, so for every .
For each integer , the brackets , , cover and have width . Thus for every , taking an integer gives . The envelope condition is [A1].
By [F4] under [A2], the hypotheses verified in steps 1.1 and 1.2 imply almost surely, which is the claimed strong Glivenko–Cantelli property by [F1].
The uniform empirical CDF converges to a Brownian bridge
Example
Assume the Axiom of Choice. Let be iid Uniform, , and . The empirical process , , converges weakly in outer expectation in to the standard Brownian bridge: the tight centered Gaussian process with covariance
Facts & Assumptions
Given: Iid Uniform observations and the fixed- bracketing functional CLT.
For , and the envelope of is , so .
AC is the premise of the functional CLT [F4] and permits choosing one rational approximant from each of the countably many nonempty intervals used in step 1.1 (The Axiom of Choice).
Donsker classes and asymptotic equicontinuity: a -Donsker limit is a tight centered Gaussian bridge with covariance .
Covering, packing, bracketing numbers, and metric entropy: bracket width in is the norm of the nonnegative endpoint difference.
Functional central limit theorem by bracketing entropy: under pointwise measurability, a square-integrable envelope, and a finite fixed- normalized bracketing entropy integral, the process converges in outer expectation to a tight Gaussian bridge.
is countably infinite: is countable.
Every subset of an at most countable set is at most countable: every subset of an at most countable set is at most countable.
The rationals embed densely in the reals: between any two distinct real numbers there is a rational.
Verification
Given: The objects and facts above.
The class is pointwise measurable. Since , the rational thresholds together with are indexed by , which is countable by [F5]–[F6]. For each fixed , [A2] and [F7] give rationals for every integer , so from above and for every . For , use the constant sequence . The envelope is measurable and square-integrable.
For an integer , the brackets have width , since their endpoint difference is the indicator of an interval of length . Thus for , choosing gives .
Consequently for . Since , the square-root entropy is bounded by , an integrable function on . All hypotheses of [F4] hold.
Applying [F4] gives a tight centered Gaussian limit. For , and , so [F2] gives covariance . This is precisely the defining covariance of the standard Brownian bridge stated in the example, proving the claimed limit. AC is carried from [F4].
Sources
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §§1 and 6
- David Pollard, Empirical Processes: Theory and Applications, Sections 1 and 8
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §6, Theorem 6.1
- David Pollard, Empirical Processes: Theory and Applications, Section 8
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §§1–2 and 7
- David Pollard, Empirical Processes: Theory and Applications, Section 10