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
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
- 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
This page defines Glivenko–Cantelli and Donsker classes with explicit pointwise measurability and outer-probability conventions. Finite bracketing entropy yields a uniform law, with separate convergence-in-probability and strong branches; the strong branch declares Countable Choice. A deterministic comparison converts uniform empirical-risk deviation into an oracle inequality. The page also proves a sub-Gaussian chaining bound, a local bracketing maximal inequality, asymptotic equicontinuity under the fixed- normalized bracketing entropy integral, and the resulting functional central limit theorem. The functional theorem states its finite-variance, measurability, and Axiom of Choice hypotheses, then proves tightness of the Gaussian limit and process-level convergence locally.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Glivenko–Cantelli classes
Definition
Use the empirical-measure convention of Empirical, centered, and Rademacher processes: for iid observations with common law , and . Let be a nonempty class of measurable real-valued functions with a nonnegative measurable integrable envelope , meaning -almost surely for every and . It is pointwise measurable if there is a countable subclass such that every is the pointwise limit of a sequence from . For a pointwise-measurable class, dominated convergence Dominated convergence gives along the approximating sequence, and finite empirical averages converge pointwise, so the supremum defining the uniform law is determined by . The class is -Glivenko–Cantelli if
in probability. It is strongly -Glivenko–Cantelli if the same convergence holds almost surely. For an uncountable class with a countable pointwise-dense subclass, the supremum is interpreted using outer probability unless the chosen version makes it measurable. For a pointwise-measurable class the supremum is determined by the countable subclass and is measurable. That subclass has a common conull envelope bound, so the supremum is finite almost surely; after choosing a real-valued version, almost-sure convergence implies convergence in probability by Almost-sure convergence implies convergence in probability.
Empirical-risk oracle bound under uniform deviation
Statement
Let be iid with law , and let be a nonempty class of measurable integrable loss functions such that is finite. Define population risk and empirical risk . Suppose satisfies the approximate-minimization inequality
for some . On the event
one has
No existence of an exact empirical minimizer is required. The empirical averages use Empirical, centered, and Rademacher processes.
Facts & Assumptions
Given: The class with finite population risks and finite lower risk infimum, empirical and population risks, , the uniform-deviation event, and the stated approximate-minimization property.
Empirical, centered, and Rademacher processes: for iid data, and . 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.
Proof
Given: The iid experiment, the loss class and risks, the uniform-deviation event, and the approximate-minimization property.
Fix any . On the stated event, by applying the uniform deviation bound to .
The approximate-minimization property gives , and the same event gives . Combining these inequalities with step 1.1 yields .
Since step 2.1 holds for every , take the infimum of its right-hand side over to obtain the claimed bound.
Bracketing maximal inequality for the empirical process
Statement
Let be iid with law , and let be a nonempty countable class of measurable real functions with a nonnegative measurable envelope , so -almost everywhere for every , and . Use as in Empirical, centered, and Rademacher processes. Suppose that for some integer there are nested finite partitions of , for all , with nonempty cells. For each cell choose a representative and define its pointwise oscillation
Assume is measurable, -almost everywhere, and . If is contained in , then pointwise by definition. Put
The refinement property gives , so is nonincreasing.
There is a universal constant such that
This is a local maximal estimate: the nested partitions and their oscillation bounds are hypotheses. Empirical-process notation uses Empirical, centered, and Rademacher processes.
Facts & Assumptions
Given: The iid experiment, the countable class and square-integrable envelope, and the nested partitions and oscillation bounds in the statement.
Empirical, centered, and Rademacher processes: , , and . Its current batch-15 carrier and manifest entry agree; no Step 1 readiness record was present at this handoff.
Bernstein inequality for bounded independent sums: independent centered summands with total variance and absolute bound satisfy the two-sided Bernstein tail bound .
For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function: for a nonnegative measurable random variable , , allowing infinite values.
Basic identities for a probability measure: finite and countable subadditivity give the union bounds for events.
Dominated convergence: almost-everywhere convergence dominated by one integrable function implies convergence of integrals.
Monotone convergence for the integral: increasing limits of nonnegative measurable functions pass through the integral.
Cauchy-Schwarz inequality for : on a probability space, for every .
Proof
Given: The objects and hypotheses in the statement.
First let be measurable functions with and . Applying [F2] to , whose variance is at most and whose absolute value is at most , gives Put and . By [F4], for , Using [F3] to integrate this tail after the increasing change of variable gives , since and . The same bound follows by continuity if or .
For , abbreviate its cell oscillation by . The sequence decreases pointwise and is dominated by , while . By [F7], ; by [F5] and the integrable majorant , the pointwise limit of consequently has integral zero and is zero -almost everywhere. Countability of and finiteness of each partition give one common full-measure set on which all envelope and oscillation bounds hold and every oscillation tends to zero; iid observations avoid its null complement almost surely. Define Nestedness makes these indicators constant on the corresponding cells. At each point either every cutoff passes or there is a unique first failed cutoff. In the first case, by the vanishing oscillation; in the second, the sum stops at that first failure. In either case, pointwise telescoping gives
The representatives have norm at most . Clip each representative to zero on . The clipped functions have absolute bound and the same bound, so step 1.1 bounds their expected maximum by . The unclipped remainders are bounded by , whose empirical-process maximum has expectation at most . Since , the definition of absorbs the second term into . Thus the coarse representatives contribute at most the first and tail terms in the claimed bound, up to a universal factor.
The first term on the right of step 1.2 is bounded by , because and . For any integrable , the triangle inequality and give . Thus this first term contributes at most .
Fix . Because is constant on its level- cell, the functions take at most distinct values. On , and , so and . Step 1.1 therefore bounds the expected maximum of by For each residual , , whence . The cutoff also gives . Since and , these bounds are at most a universal multiple of . Summing over is bounded by a universal multiple of the entropy tail in the statement.
The functions take at most distinct values by nestedness. On , both representatives lie in the level- cell, so and . Step 1.1 bounds their expected maximum by a universal multiple of Summing over gives the same entropy-tail bound.
If the entropy tail in the claimed bound is infinite, the result is immediate. Otherwise take finite partial sums in the decomposition of step 1.2: they stabilize at a first failed cutoff or telescope to , and their absolute values are bounded by outside the common null set from step 1.2. Dominated convergence [F5] and convergence of the finite sample averages therefore let the linear empirical-process map pass to the decomposition for each . Now take the supremum over the countable class. Step 2.1 bounds the coarse representatives, step 2.2 bounds the first failed-cutoff term, and steps 2.3–2.4 bound the two series; [F6] justifies summing the nonnegative expected maxima by monotone convergence. Combining these estimates and increasing the universal constant gives the stated inequality.
Remarks
The supremum in the Statement need not be attained, so replacing it by a maximum would leave the claim undefined for some permitted countable classes. For an explicit instance satisfying all the partition hypotheses, let be iid Bernoulli, put , , and take , with . For every , partition the coefficients into the dyadic half-open intervals , , restricted to . Each cell is nonempty, the partitions refine one another, and any supplied rational representative in each cell is permitted. The oscillation of each cell is exactly , hence is measurable, bounded by , and has norm . Here , so the entropy series in the bound is finite. At sample size , for either observation. Its supremum is , but no coefficient in the class attains that value. This explicitly refutes maximum attainment under the original hypotheses; the proof above bounds the measurable countable supremum throughout.
Donsker classes and asymptotic equicontinuity
Definition
For a class of measurable real functions under a probability measure , an envelope means a nonnegative measurable function with -almost surely for every . Cauchy–Schwarz Cauchy-Schwarz inequality for gives when .
Let be a probability space, let be iid with law , and let be a nonempty class of measurable real-valued functions with a nonnegative measurable envelope satisfying . A class is pointwise measurable if it has a countable subclass such that for each there is a sequence in converging pointwise to . Write using Empirical, centered, and Rademacher processes, and put
This is a pseudometric: distinct functions can have zero distance when their centered difference vanishes -almost surely. The empirical process is asymptotically equicontinuous in probability with respect to if for every ,
Here is outer probability; bounded nonmeasurable functionals are handled by the corresponding outer expectation . For a pointwise-measurable class these conventions agree with ordinary probability whenever the displayed supremum is measurable.
Write for the bounded real-valued functions on the index set , with norm . The class is -Donsker if, for each , has bounded paths on a measurable event of probability one and, after setting the entire path to zero off that event, the resulting -valued process converges weakly in the outer-expectation sense to a tight Borel law of a centered Gaussian process with covariance
Here outer weak convergence means for every bounded uniformly continuous real function on ; the outer expectation is the infimum of expectations of measurable majorants. The law is tight in the sense of Tight family of probability measures. Finite-dimensional convergence means weak convergence of the vector of process values at every finite list of indices, as in Convergence in distribution of random elements.
Dudley entropy-integral bound for sub-Gaussian processes
Statement
Let be a nonempty pseudometric space that is totally bounded in the following sense: for every there is a finite set such that . Its diameter is . For each , let be a real random variable. Assume the process is separable: a specified countable dense subset , equipped with a fixed listing, has the property that the supremum of every process increment over equals its supremum over almost surely. Suppose all increments are centered and sub-Gaussian with their -scale, meaning that for every and ,
If
where is the least number of closed -balls of radius covering (Covering, packing, bracketing numbers, and metric entropy), then for every ,
for a universal constant . If , the integral and the supremum are both zero.
Facts & Assumptions
Given: A nonempty totally bounded pseudometric space , a separable real process with centered sub-Gaussian increments whose MGF proxy is , and a finite entropy integral.
Covering, packing, bracketing numbers, and metric entropy: is the least finite cover size with centers in the class and covering radius .
Sub-Gaussian variables and vectors, and sub-exponential variables: a centered real random variable has sub-Gaussian proxy when for every real .
Jensen's inequality for expectation: for an integrable random variable and convex with integrable or nonnegative , .
Markov's inequality for random variables: for nonnegative and , .
Monotone convergence for the integral: increasing nonnegative limits pass through the integral.
Basic identities for a probability measure: countable unions of null events are null.
Proof
Given: The objects and assumptions in the statement.
First derive a finite-maximum estimate. If are centered and each has sub-Gaussian proxy at most , then for , By [F3], . For , choosing gives ; for , the proxy bound forces every almost surely by [F4] applied to and letting .
If , every pair in has distance zero. The proxy-zero case of step 1.1 applied to each increment, together with separability and [F6] for the countable intersection of probability-one events, makes the supremum zero. Assume . Fix and put . Total boundedness gives a finite cover of by closed balls of radius . Approximate each center by a point of the dense set within to obtain a cover of by the same number of balls of radius . Since the specified countable dense set is listed, choose the first finite tuple under its induced enumeration that is an -net and has cardinality at most this cover size; such a tuple exists by the construction. Denote it by . For each , choose the least-index point within . These canonical choices across scales require no choice axiom. Put and .
For a finite subset , telescope through for every . At level there are at most increments, each with proxy at most ; for there are at most increments, each with proxy at most . Applying step 1.1 to the finite set of increments at each level, and the triangle inequality for their maxima, yields for a universal ; the term is absorbed using and .
The residual maximum over has expectation at most by step 1.1, since . Letting for this fixed finite removes the residual. The dyadic sum in step 2.2 is bounded by a universal multiple of the entropy integral: on each interval , monotonicity of makes the integral at least . Also, for , one ball of radius cannot cover a set of diameter , so and the entropy integral is at least ; this absorbs the geometric contribution from the added . Hence Taking an increasing sequence of finite subsets whose union is , [F5] and the separability assumption give the asserted supremum over .
Glivenko–Cantelli theorem by bracketing entropy
Statement
Let be iid with law , and let be a nonempty pointwise-measurable class of measurable real functions with a nonnegative integrable envelope . Suppose for every . Then is -Glivenko–Cantelli: in probability. If Countable Choice is assumed, then the stronger conclusion holds that this convergence is almost sure. The terms , , and the outer-probability convention are those of Empirical, centered, and Rademacher processes, and the class notion is Glivenko–Cantelli classes.
Facts & Assumptions
Given: Iid observations with law , a pointwise-measurable class with integrable envelope, and finite bracketing number at every positive scale.
For the strong-law branch, assume Countable Choice (The Axiom of Countable Choice ()) to select one finite bracketing family of width at most for each integer . The convergence-in-probability branch does not use this axiom.
Covering, packing, bracketing numbers, and metric entropy: an bracket has measurable endpoints, satisfies -almost surely, and has width .
Kolmogorov iid l1 strong law: for iid real random variables with finite first absolute moment, their sample means converge almost surely to their common mean.
Dominated convergence: pointwise convergence dominated by one integrable envelope implies convergence of integrals.
Basic identities for a probability measure: countable subadditivity implies that a countable union of null sets is null.
Proof
Given: The objects and hypotheses in the statement.
Fix and let be the countable pointwise-dense subclass. Choose a finite bracketing cover of with widths at most , which is strictly below ; discard brackets not meeting . For each retained bracket, choose one member of in it. The envelope and that member imply that clipping its endpoints to preserves every inclusion in the bracket -almost surely, and cannot increase the width. Since only finitely many endpoints remain and each is bounded by the integrable , they are integrable. Countability and [F5] give one probability-one event on which all pointwise-dense-class bracket inclusions hold at every observation.
If , then ; likewise . Hence Each endpoint is integrable, so [F3] makes both finite maxima tend to zero almost surely. For arbitrary , choose pointwise approximants ; [F4] gives , and the finite empirical averages give at every sample. Thus the supremum over equals the countable supremum over samplewise. Given any target , take ; the endpoint maxima then imply . No simultaneous choice of brackets across scales is used for this probability-convergence conclusion.
Now assume Countable Choice. For each integer , choose one finite bracket family of width at most . Step 2.1 with and [F3] give a probability-one event on which . By [F5], the countable intersection of these events still has probability one. On it the nonnegative supremum has limsup at most for every , hence converges to zero. This is strong -Glivenko–Cantelli convergence as defined in Glivenko–Cantelli classes.
Bracketing entropy implies empirical-process asymptotic equicontinuity
Statement
For a class of measurable real functions under a probability measure , an envelope means a nonnegative measurable function with -almost surely for every . Cauchy–Schwarz Cauchy-Schwarz inequality for gives when .
Assume Countable Choice. Let be iid with law , and let be a nonempty pointwise-measurable class of measurable functions with a nonnegative envelope satisfying . Assume and
Use the empirical process and semimetric from Empirical, centered, and Rademacher processes and Donsker classes and asymptotic equicontinuity. Then is asymptotically equicontinuous in probability with respect to .
Facts & Assumptions
Given: Countable Choice; an iid sequence, pointwise-measurable class , square-integrable envelope , and the finite normalized bracketing entropy integral in the statement.
Countable Choice permits fixing a finite bracket family at each of countably many dyadic scales (The Axiom of Countable Choice ()).
Empirical, centered, and Rademacher processes defines , , , outer probability, and the countable separable-version convention.
Donsker classes and asymptotic equicontinuity: and asymptotic equicontinuity is the vanishing-in-probability condition for the supremum of over .
Bracketing maximal inequality for the empirical process: nested finite partitions with cell oscillation envelopes of dyadic size bound the expected supremum by a coarse finite-class term, an envelope-tail term, and the sum of dyadic widths times square-root log cell counts. Its complete revised proof is in this batch.
Covering, packing, bracketing numbers, and metric entropy: an bracket has measurable endpoints ordered -almost surely and width ; counts such brackets of width at most .
Dominated convergence: pointwise convergence dominated by an integrable function implies convergence in .
Markov's inequality for random variables: for nonnegative and , .
Cauchy-Schwarz inequality for : on a probability space, for every .
Proof
Given: The objects and hypotheses in the statement.
Choose a countable pointwise-dense subclass . For , set . Every has and is bounded in absolute value by , with .
If and lie in brackets and of width at most , respectively, then lies in the bracket Its width is , where and ; Cauchy–Schwarz gives its norm at most . Thus .
Fix and choose with . For each , take a finite bracketing cover of at width and partition the class by assigning each function to the first bracket containing it. Refine these finite partitions cumulatively through level ; by [A1], the countable family of finite covers and their representatives can be selected. If is the unrefined level- count, step 1.2 gives for , and the refined count satisfies . Consequently, using for and summing the resulting geometric weights, for universal constants : the unrefined entropy terms at scale are bounded by the integrand on the adjacent dyadic interval by monotonicity of bracketing numbers, and cumulative refinement contributes only a geometric sum of earlier terms. The added contributes a geometric sum of order , which is also bounded by the displayed integral because its integrand is at least . On each refined cell , define and choose . Countability makes this pointwise supremum measurable; containment in a level- bracket gives -almost everywhere, so it has the required bound. Intersecting partitions makes these oscillations nonincreasing on child cells. Thus these partitions and widths satisfy the hypotheses of [F2] when the local maximal inequality is applied.
Apply [F2] to with envelope and this nested partition. Its coarse term is at most , its dyadic tail is bounded by the right-hand side of step 2.1, and its final envelope-tail term tends to zero as for this fixed : for each fixed , by [F4].
The entropy integral in the statement makes the integral in step 2.1 tend to zero with . It also gives for each fixed : if , monotonicity yields . Therefore step 3.1 implies .
By [F5], Markov's inequality converts the expected-supremum limit in step 4.1 into asymptotic equicontinuity for pairs in . For arbitrary , choose pointwise approximants . The common envelope gives convergence by [F4]; applying [F4] to and also gives convergence. Pointwise convergence gives and for each fixed finite sample, so and the empirical-process increment converges pointwise to the desired increment. Hence a pair with is a limit of pairs from with distance below . The outer-probability modulus over is therefore bounded by the countable-class modulus over at radius , proving the asserted asymptotic equicontinuity.
Functional central limit theorem by bracketing entropy
Statement
For a class of measurable real functions under a probability measure , an envelope means a nonnegative measurable function with -almost surely for every . Cauchy–Schwarz Cauchy-Schwarz inequality for gives when .
Assume the Axiom of Choice. Let be iid with law on a measurable space, and let be a nonempty pointwise-measurable class of measurable real functions with a measurable envelope satisfying . If , the empirical process is the zero process almost surely. Otherwise assume
where is the least number of measurable brackets with -almost surely and that cover . Then is -Donsker in the sense of Donsker classes and asymptotic equicontinuity: the empirical process converges weakly in outer expectation in to a tight centered Gaussian bridge with covariance
The bracketing number and width use Covering, packing, bracketing numbers, and metric entropy.
Facts & Assumptions
Given: Assume AC. Let be iid with law , let be pointwise measurable with envelope , and assume the displayed bracketing entropy integral is finite.
AC supplies Countable Choice (The Axiom of Choice, The Axiom of Countable Choice ()). AC is used by the multivariate iid CLT, the consistent Gaussian-process extension, and tightness of the Gaussian law; Countable Choice is used by metric completion and compactness constructions.
The Axiom of Countable Choice () defines Countable Choice and states that AC implies it. In particular, the metric-completion construction below has its stated choice hypothesis.
Empirical, centered, and Rademacher processes: , , , and uncountable suprema use the stated outer-probability/outer-expectation convention unless a countable separable version applies.
Covering, packing, bracketing numbers, and metric entropy: an bracket has measurable endpoints -almost everywhere and width .
Cauchy-Schwarz inequality for : on a probability space, for nonnegative .
Asymptotic distribution: for a finite-dimensional random vector, an asymptotic distribution is a weak limit of its laws; this does not assert moment convergence.
Multivariate iid central limit theorem: under AC, iid vectors with finite second moment converge after centering and scaling to a centered multivariate normal vector whose covariance matrix is the original covariance matrix, including singular matrices.
Multivariate normal law, including singular covariance: under AC, a positive-semidefinite covariance matrix specifies an existing centered multivariate normal law, including in singular directions.
Assuming the Axiom of Choice, Kolmogorov extension for arbitrary families of standard Borel coordinate spaces: under AC, consistent finite-dimensional laws on standard Borel coordinate spaces extend to a probability law on their cylinder sigma-algebra.
Dudley entropy-integral bound for sub-Gaussian processes: for a separable sub-Gaussian process with totally bounded index pseudometric and finite entropy integral, the expected supremum of increments from a base point is bounded by the corresponding entropy integral.
Bracketing entropy implies empirical-process asymptotic equicontinuity: the stated square-integrable-envelope and fixed- bracketing integral imply asymptotic equicontinuity of in .
Dominated convergence: pointwise convergence dominated by an integrable function implies convergence in .
Every metric space has a completion, constructed as the equivalence classes of its Cauchy sequences: under Countable Choice, a metric space embeds isometrically and densely in a complete metric space; A complete, totally bounded metric space is compact, proved from countable choice used exactly once makes the completion of a totally bounded space compact.
is complete in the supremum metric for every nonempty compact metric space and Countable uniformly dense tests on a compact metric space: for compact metric , is complete and separable in the supremum norm.
Polish spaces are separable completely metrizable spaces: a separable completely metrizable space is Polish. Every borel probability on a polish space is tight: under AC, every Borel probability on a Polish space is tight.
Markov's inequality for random variables: for nonnegative and , . First Borel-Cantelli lemma for events: if event probabilities are summable, only finitely many of the events occur almost surely.
Characteristic function of a normal law and Uniqueness of a law from its characteristic function: a centered normal variable of variance has characteristic function , and equal characteristic functions determine real probability laws.
and for with the Euclidean metric are complete, componentwise from the Cauchy criterion in makes the usual real line complete. is countably infinite makes countable, and The rationals embed densely in the reals embeds it in with a rational strictly between any two distinct reals. Thus every open ball contains an embedded rational, so this image is a countable dense subset. By Polish spaces are separable completely metrizable spaces, The Borel sigma-algebra of a topological space, and Standard Borel spaces, the usual real line is Polish and its Borel measurable space is standard Borel.
Cramer wold device: Borel probability laws on a finite-dimensional Euclidean space are determined by all their one-dimensional projection laws.
Basic identities for a probability measure: countable subadditivity implies that a countable union of null sets is null.
Standard normal and normal laws: under AC, is the law of under the standard normal density law. The standard normal density has total mass one: is positive and Borel measurable with Lebesgue integral one.
Integrating against a density agrees with integrating the product: integrating a nonnegative measurable function against a density measure equals integrating its product with the density.
Substitution: if is differentiable on with integrable and is continuous on an interval containing , then : a differentiable change of variable with integrable derivative permits compact-interval substitution for a continuous integrand. A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion gives bounded Riemann integrability of continuous compact-interval functions; A bounded Riemann integrable function on a closed bounded interval is Lebesgue measurable and has the same integral identifies these integrals with Lebesgue integrals under Countable Choice.
Monotone convergence for the integral: increasing nonnegative measurable functions have integrals increasing to the integral of their pointwise limit.
Proof
Given: Assume AC and let , , , and satisfy the statement. Put and .
If , every member of a countable pointwise-dense subclass is zero -almost surely. By [F15], countable subadditivity gives a probability-one event on which all those functions vanish at every observation. Pointwise approximation then makes every vanish at the observations; dominated convergence gives for each . Thus is the zero process in outer probability and the conclusion holds with the zero Gaussian bridge.
Assume . The countable pointwise-dense subclass has a common measurable conull set on which its members are bounded by ; pointwise approximation extends that bound to every on the same set. By [F15], all observations lie in it on one measurable event of probability one. On that event, for every , by [L3]. Set the entire empirical path to zero off that event, as required by the Donsker definition. Each finite bracket of width has -diameter at most , because . The entropy integral being finite forces for every : if it were infinite at one positive scale, monotonicity would make the integral infinite on an interval below that scale. Therefore the quotient of by zero -distance is totally bounded. The countable pointwise-dense subclass is dense in this quotient, since and [F7] gives .
Enumerate the countable dense subclass as . For any finite list , the covariance matrix is positive semidefinite, since . [F3] supplies the centered Gaussian law . For any sublist, both the corresponding marginal and the Gaussian law constructed from its covariance have, in every direction, the same centered normal projection; [F14] makes the laws equal. Thus these finite-dimensional laws are consistent.
The coordinate space with its Borel sigma-algebra is standard Borel by [F13], so [F4] extends the consistent Gaussian laws to a centered Gaussian process indexed by , with covariance . Each increment is centered normal with variance .
For any centered normal with variance , if then [F16] makes almost surely and . If , [F16]–[F17] give by completing the square. For and positive integer , apply [F18] to the translation , whose derivative is the integrable constant one, and the continuous integrand . Both compact integrands are continuous and bounded, so the Riemann–Lebesgue bridge in [F18], with Countable Choice from [A1], gives . These intervals increase to as ; [F19] on both sides and the normalization in [F16] give . Thus every centered Gaussian increment with variance has MGF proxy , as needed for chaining.
For , index the Gaussian increment process by pairs with , and write . Its canonical pseudometric is . The triangle inequality in gives , while every has standard deviation at most , so the -diameter of this pair set is at most . By step 4.1 its increments are centered sub-Gaussian with their -scale. A product of two -nets of covers the pair set within -distance . Its centers might lie outside the restricted pair set; from each product ball that meets the pair set, choose one pair inside it. The triangle inequality then gives an -net with centers in the pair set and cardinality at most . Applying [F5] with the diagonal base point yields which tends to zero as by the bracketing cover bound in step 1.2.
Choose rational so that the expectation in step 5.1 is at most . By [F11], the probability that the corresponding modulus exceeds is at most , and the first Borel–Cantelli lemma makes only finitely many such events occur almost surely. Thus the Gaussian sample paths are uniformly -continuous on almost surely. By [A2], Countable Choice is available for the metric-completion construction in [F8], so the metric quotient embeds densely in a complete metric completion ; compactness and the pathwise extension are established below.
Fix and take a finite -net in the totally bounded metric quotient from step 1.2. Its image in is still a finite -net for the dense embedded quotient. For any , density gives a quotient point with , and some net point satisfies ; hence . Thus is totally bounded, and it is compact by its completeness from [F8] and the complete-plus-totally-bounded theorem in [F8]. To extend a path that is uniformly -continuous on the listed dense subset , for each and let be the first listed point of within of . The sequence is Cauchy by uniform continuity and therefore has a real limit by [F13]. Any two sequences from converging to have pairwise distances tending to zero, so uniform continuity makes their value limits equal. Define by this common limit. To verify continuity, given choose so that for implies . If , approximating sequences and eventually satisfy ; passing to their value limits gives . Density makes this extension unique.
Uniform continuity on the countable set is a measurable path event: for each integer , the condition that some positive rational radius makes every coordinate increment below for pairs in closer than that radius is a countable union and intersection of measurable coordinate events. By step 6.1 this event has probability one. On it use the extension from step 7.1, and define the function to be zero off it. The resulting map is a Borel random element of : evaluations at the countable dense set are measurable, and for continuous functions the supremum distance is the supremum over , so preimages of open balls are measurable; separability makes every open set a countable union of such balls. By [F9], is complete and separable; [F10] makes it Polish and its Gaussian law tight. For any finite list , choose pointwise approximants for each . By [F7], . Fix coefficients and put and . Step 7.1 gives almost surely. Each is centered normal with variance . Dominated convergence [F7] applied to , whose modulus is one, gives convergence of characteristic functions. By [F12], the limit is and determines the centered normal law of variance . Every linear combination of the limiting vector is therefore centered normal; [F3] identifies that vector as multivariate normal with covariance . This proves that the pathwise extension has the required Gaussian finite-dimensional laws. Define by , where is the image of in the metric quotient and its completion. Since these images are dense in and is continuous, , so is an isometry and is continuous. Its pushforward of the tight Borel law on is a tight Borel Gaussian bridge on .
Fix any finite . The vectors are iid and have finite second moments, bounded in squared norm by almost surely. [F2] gives convergence of their normalized sums to , the corresponding finite-dimensional law of the Gaussian bridge from step 8.1. This proves finite-dimensional convergence, with the asymptotic-distribution convention of [F1].
By [F6], the empirical processes are asymptotically equicontinuous in . For each , the totally bounded quotient from step 1.2 has a finite -net with centers in the dense subset ; density then makes it an -net for all of . List its finitely many centers and assign to each the first center within distance , obtaining . Define and . Their ranges lie in a finite-dimensional subspace of ; the linear map from the selected coordinate vector to that subspace is continuous in the supremum norm. Thus the finite-dimensional convergence in step 9.1, tested after composition with any bounded continuous functional, gives for each fixed .
The sup-norm error is bounded by the empirical-process modulus over pairs at -distance at most ; it is therefore bounded by the modulus at radius in [F6], which tends to zero in outer probability as . Uniform continuity of the Gaussian paths gives almost surely. For bounded uniformly continuous , put , which tends to zero as . If are random elements and , a measurable event of probability arbitrarily close to covers the exceptional set; outside it , and everywhere the difference is at most . This gives by measurable majorants. Use the three-term bound For fixed the middle term tends to zero by step 10.1; then letting makes the other two terms vanish by the outer-probability approximation bound and . This is the outer weak convergence in Donsker classes and asymptotic equicontinuity, with the tight Gaussian bridge from step 8.1. AC is used in [F2], [F4], [F10], and the countable-choice completion in [F8]; no finite-dimensional limit is used as a substitute for the process-level equicontinuity step.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §1
- David Pollard, Empirical Processes: Theory and Applications, Section 1
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §§5–6
- David Pollard, Empirical Processes: Theory and Applications, Sections 8–10
- Cornell CS 3780/5780, Lecture 16: Empirical Risk Minimization and Model Selection
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §7, Theorem 7.6 and preceding proof
- David Pollard, Empirical Processes: Theory and Applications, Section 8
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §§1–2
- David Pollard, Empirical Processes: Theory and Applications, Sections 9–10
- David Pollard, Empirical Processes: Theory and Applications, Section 3, Lemma 3.4 and Theorem 3.5
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §3, Corollary 3.5
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §6, Theorem 6.1
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §7, Theorems 7.4–7.6
- David Pollard, Empirical Processes: Theory and Applications, Section 10
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §§2 and 7