Alphabeta Math
Pipeline-generated
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.

✓ 6 results · all verified · 2 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 4 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Chaining and Uniform Limits

1 · Prerequisites

2 · Summary

This page defines Glivenko–Cantelli and Donsker classes with explicit pointwise measurability and outer-probability conventions. Finite L1(P) 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-P normalized L2 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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Glivenko–Cantelli classes

Definition

Use the empirical-measure convention of Empirical, centered, and Rademacher processes: for iid observations X1,X2,… with common law P, Pnf=n−1∑i=1nf(Xi) and Pf=∫f dP. Let F be a nonempty class of measurable real-valued functions with a nonnegative measurable integrable envelope F, meaning ∣f∣≤F P-almost surely for every f∈F and PF<∞. It is pointwise measurable if there is a countable subclass F0 such that every f∈F is the pointwise limit of a sequence from F0. For a pointwise-measurable class, dominated convergence Dominated convergence gives Pfk→Pf along the approximating sequence, and finite empirical averages converge pointwise, so the supremum defining the uniform law is determined by F0. The class is P-Glivenko–Cantelli if

sup⁡f∈F∣Pnf−Pf∣⟶0

in probability. It is strongly P-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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Empirical-risk oracle bound under uniform deviation

Statement

Let X1,…,Xn be iid with law P, and let L be a nonempty class of measurable integrable loss functions ℓ such that inf⁡ℓ∈LPℓ is finite. Define population risk R(ℓ)=Pℓ and empirical risk Rn(ℓ)=Pnℓ. Suppose ℓ^∈L satisfies the approximate-minimization inequality

Rn(ℓ^)≤inf⁡ℓ∈LRn(ℓ)+η

for some η≥0. On the event

sup⁡ℓ∈L∣Rn(ℓ)−R(ℓ)∣≤ϵ,

one has

R(ℓ^)≤inf⁡ℓ∈LR(ℓ)+2ϵ+η.

No existence of an exact empirical minimizer is required. The empirical averages use Empirical, centered, and Rademacher processes.

Facts & Assumptions

Given: The class L with finite population risks and finite lower risk infimum, empirical and population risks, ϵ,η≥0, the uniform-deviation event, and the stated approximate-minimization property.

[F1]

Empirical, centered, and Rademacher processes: for iid data, Pnℓ=n−1∑i=1nℓ(Xi) and Pℓ=∫ℓ dP. 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.

1.1givenF1algebra

Fix any ℓ∈L. On the stated event, R(ℓ^)≤Rn(ℓ^)+ϵ by applying the uniform deviation bound to ℓ^.

2.1givenF1step 1.1algebra

The approximate-minimization property gives Rn(ℓ^)≤Rn(ℓ)+η, and the same event gives Rn(ℓ)≤R(ℓ)+ϵ. Combining these inequalities with step 1.1 yields R(ℓ^)≤R(ℓ)+2ϵ+η.

3.1step 2.1algebra∎

Since step 2.1 holds for every ℓ∈L, take the infimum of its right-hand side over L to obtain the claimed bound.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-6-luna)Open item page →

Bracketing maximal inequality for the empirical process

Statement

Let X1,X2,… be iid with law P, and let G be a nonempty countable class of measurable real functions with a nonnegative measurable envelope H, so ∣g∣≤H P-almost everywhere for every g∈G, and 0<∥H∥P,2<∞. Use Gn(g)=n(Png−Pg) as in Empirical, centered, and Rademacher processes. Suppose that for some integer q0≥1 there are nested finite partitions Πq of G, for all q≥q0, with mq nonempty cells. For each cell C∈Πq choose a representative πq(C)∈C and define its pointwise oscillation

Δq,C(x)=sup⁡g,h∈C∣g(x)−h(x)∣.

Assume Δq,C is measurable, 0≤Δq,C≤2H P-almost everywhere, and ∥Δq,C∥P,2≤2−q∥H∥P,2. If C′∈Πq+1 is contained in C∈Πq, then Δq+1,C′≤Δq,C pointwise by definition. Put

Lq=1+log⁡(2mq),aq=2−q∥H∥P,2Lq+1,MG=sup⁡g∈G∥g∥P,2.

The refinement property gives mq+1≥mq, so aq is nonincreasing.

There is a universal constant C<∞ such that

Esup⁡g∈G∣Gn(g)∣≤C[(MG+2−q0∥H∥P,2)Lq0+∥H∥P,2∑q>q02−qLq+n P ⁣(H1{H>naq0/2})].

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.

[F1]

Empirical, centered, and Rademacher processes: Png=n−1∑i=1ng(Xi), Pg=∫g dP, and Gn(g)=n(Png−Pg). Its current batch-15 carrier and manifest entry agree; no Step 1 readiness record was present at this handoff.

[F2]

Bernstein inequality for bounded independent sums: independent centered summands with total variance v and absolute bound b satisfy the two-sided Bernstein tail bound 2exp⁡[−t2/(2(v+bt/3))].

[F3]

For 0 < p < infinity, the layer-cake formula computes the integral of |f|^p from the distribution function: for a nonnegative measurable random variable Y, EY=∫0∞P(Y>t) dt, allowing infinite values.

[F4]

Basic identities for a probability measure: finite and countable subadditivity give the union bounds for events.

[F5]

Dominated convergence: almost-everywhere convergence dominated by one integrable function implies convergence of integrals.

[F6]

Monotone convergence for the integral: increasing limits of nonnegative measurable functions pass through the integral.

[F7]

Cauchy-Schwarz inequality for L2: on a probability space, P∣Y∣≤∥Y∥P,2 for every Y∈L2(P).

Proof

Given: The objects and hypotheses in the statement.

1.1F2F3F4givenalgebra

First let h1,…,hm be measurable functions with Phj2≤σ2 and ∣hj∣≤b. Applying [F2] to hj(Xi)−Phj, whose variance is at most σ2 and whose absolute value is at most 2b, gives P{∣Gn(hj)∣>2σ2u+2bu/n}≤2e−u. Put L=log⁡(2m) and Z=max⁡j∣Gn(hj)∣. By [F4], for s≥0, P{Z>ϕ(s)}≤e−s,ϕ(s)=2σ2(L+s)+2b(L+s)/n. Using [F3] to integrate this tail after the increasing change of variable t=ϕ(s) gives EZ≤ϕ(0)+∫0∞e−sϕ′(s) ds≤C0(σL+bL/n), since L≥log⁡2 and ∫0∞e−s(L+s)−1/2ds≤L−1/2. The same bound follows by continuity if σ=0 or b=0.

1.2F4F5F7givenconstructalgebra

For g∈G, abbreviate its cell oscillation by Δqg. The sequence Δqg decreases pointwise and is dominated by 2H, while ∥Δqg∥P,2≤2−q∥H∥P,2. By [F7], PΔqg→0; by [F5] and the integrable majorant 2H, the pointwise limit of Δqg consequently has integral zero and is zero P-almost everywhere. Countability of G 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 Aqg=∏p=q0q1{Δpg≤nap},Bq0g=1{Δq0g>naq0},Bqg=Aq−1g1{Δqg>naq} (q>q0). 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, πqg→g by the vanishing oscillation; in the second, the sum stops at that first failure. In either case, pointwise telescoping gives g−πq0g=(g−πq0g)Bq0g+∑q>q0(g−πqg)Bqg+∑q>q0(πqg−πq−1g)Aq−1g.

2.1F1step 1.1givenalgebra

The mq0 representatives πq0(C) have L2(P) norm at most MG. Clip each representative to zero on {H>naq0}. The clipped functions have absolute bound naq0 and the same L2 bound, so step 1.1 bounds their expected maximum by C0[MGLq0+aq0log⁡(2mq0)]. The unclipped remainders are bounded by H1{H>naq0}, whose empirical-process maximum has expectation at most 2nP(H1{H>naq0}). Since mq0+1≥mq0, the definition of aq0 absorbs the second term into 2−q0∥H∥P,2Lq0. Thus the coarse representatives contribute at most the first and tail terms in the claimed bound, up to a universal factor.

2.2F1step 1.2givenalgebra

The first term on the right of step 1.2 is bounded by 2H1{H>naq0/2}, because Δq0g>naq0 and Δq0g≤2H. For any integrable Y, the triangle inequality and EPn∣Y∣=P∣Y∣ give E∣Gn(Y)∣≤2nP∣Y∣. Thus this first term contributes at most 4nP(H1{H>naq0/2}).

2.3F1step 1.1givenalgebra

Fix q>q0. Because Bqg is constant on its level-q cell, the functions wq=Δqg Bqg take at most mq distinct values. On Bqg=1, Δqg>naq and Δqg≤Δq−1g≤naq−1, so Pwq2≤aq−1aqP(Δqg)2≤aq−1aq4−q∥H∥P,22, and ∣wq∣≤naq−1. Step 1.1 therefore bounds the expected maximum of ∣Gn(wq)∣ by C0[2−q∥H∥P,2aq−1aqLq+aq−1log⁡(2mq)]. For each residual rq=(g−πqg)Bqg, ∣rq∣≤wq, whence ∣Gn(rq)∣≤∣Gn(wq)∣+2nPwq. The cutoff also gives nPwq≤P(Δqg)2/aq≤2−q∥H∥P,2Lq+1. Since aq−1/aq=2Lq+1/Lq and aq−1=2−(q−1)∥H∥P,2/Lq, these bounds are at most a universal multiple of ∥H∥P,22−q(Lq+Lq+1). Summing over q>q0 is bounded by a universal multiple of the entropy tail in the statement.

2.4F1step 1.1givenalgebra

The functions vq=(πqg−πq−1g)Aq−1g take at most mq distinct values by nestedness. On Aq−1g=1, both representatives lie in the level-(q−1) cell, so ∣vq∣≤Δq−1g≤naq−1 and Pvq2≤4−(q−1)∥H∥P,22. Step 1.1 bounds their expected maximum by a universal multiple of ∥H∥P,22−qLq+aq−1log⁡(2mq)≤C1∥H∥P,22−qLq. Summing over q>q0 gives the same entropy-tail bound.

3.1F1F5step 2.1step 1.2step 2.2step 2.3step 2.4F3F6algebra∎

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 g−πq0g, and their absolute values are bounded by 2H 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 g. 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 Xi be iid Bernoulli(1/2), put A={1}, G={c1A:c∈Q, 0<c<1}, and take H=1A, with ∥H∥P,2=1/2. For every q≥1, partition the coefficients into the dyadic half-open intervals [j2−q,(j+1)2−q), 0≤j<2q, restricted to (0,1). 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 2−q1A, hence is measurable, bounded by 2H, and has norm 2−q∥H∥P,2. Here mq=2q, so the entropy series in the bound is finite. At sample size n=1, ∣G1(c1A)∣=c∣X1−1/2∣=c/2 for either observation. Its supremum is 1/2, 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.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Donsker classes and asymptotic equicontinuity

Definition

For a class H of measurable real functions under a probability measure Q, an envelope H means a nonnegative measurable function with ∣h∣≤H Q-almost surely for every h∈H. Cauchy–Schwarz Cauchy-Schwarz inequality for L2 gives QH≤∥H∥Q,2<∞ when H∈L2(Q).

Let (S,A,P) be a probability space, let X1,X2,… be iid with law P, and let F be a nonempty class of measurable real-valued functions with a nonnegative measurable envelope F satisfying PF2<∞. A class is pointwise measurable if it has a countable subclass F0 such that for each f∈F there is a sequence in F0 converging pointwise to f. Write Gn(f)=n(Pnf−Pf) using Empirical, centered, and Rademacher processes, and put

ρP(f,g)={P[(f−g)−P(f−g)]2}1/2.

This is a pseudometric: distinct functions can have zero distance when their centered difference vanishes P-almost surely. The empirical process is asymptotically equicontinuous in probability with respect to ρP if for every η>0,

lim⁡δ↓0lim sup⁡n→∞P∗(sup⁡f,g∈F: ρP(f,g)<δ∣Gn(f)−Gn(g)∣>η)=0.

Here P∗(A)=inf⁡{P(B):A⊆B, B∈A} is outer probability; bounded nonmeasurable functionals are handled by the corresponding outer expectation E∗Y=inf⁡{EY′:Y′ measurable and Y′≥Y}. For a pointwise-measurable class these conventions agree with ordinary probability whenever the displayed supremum is measurable.

Write ℓ∞(F) for the bounded real-valued functions on the index set F, with norm ∥z∥F=sup⁡f∈F∣z(f)∣. The class is P-Donsker if, for each n, Gn has bounded paths on a measurable event of probability one and, after setting the entire path to zero off that event, the resulting ℓ∞(F)-valued process converges weakly in the outer-expectation sense to a tight Borel law of a centered Gaussian process GP with covariance

Cov⁡(GP(f),GP(g))=P[(f−Pf)(g−Pg)].

Here outer weak convergence means E∗H(Gn)→EH(GP) for every bounded uniformly continuous real function H on ℓ∞(F); 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Dudley entropy-integral bound for sub-Gaussian processes

Statement

Let (T,d) be a nonempty pseudometric space that is totally bounded in the following sense: for every r>0 there is a finite set Er⊆T such that T⊆⋃e∈Er{t∈T:d(t,e)≤r}. Its diameter is D:=sup⁡s,t∈Td(s,t)<∞. For each t∈T, let Xt be a real random variable. Assume the process is separable: a specified countable dense subset T0⊆T, equipped with a fixed listing, has the property that the supremum of every process increment over T equals its supremum over T0 almost surely. Suppose all increments are centered and sub-Gaussian with their d-scale, meaning that for every s,t∈T and λ∈R,

Eexp⁡{λ(Xs−Xt)}≤exp⁡{λ2d(s,t)2/2}.

If

∫0Dlog⁡N(ϵ,T,d) dϵ<∞,

where N(ϵ,T,d) is the least number of closed d-balls of radius ϵ covering T (Covering, packing, bracketing numbers, and metric entropy), then for every t0∈T,

Esup⁡t∈T∣Xt−Xt0∣≤C∫0Dlog⁡N(ϵ,T,d) dϵ

for a universal constant C. If D=0, the integral and the supremum are both zero.

Facts & Assumptions

Given: A nonempty totally bounded pseudometric space (T,d), a separable real process (Xt)t∈T with centered sub-Gaussian increments whose MGF proxy is d(s,t)2, and a finite entropy integral.

[F1]

Covering, packing, bracketing numbers, and metric entropy: N(ϵ,T,d) is the least finite cover size with centers in the class and covering radius ϵ.

[F2]

Sub-Gaussian variables and vectors, and sub-exponential variables: a centered real random variable Y has sub-Gaussian proxy σ2 when EeλY≤eλ2σ2/2 for every real λ.

[F3]

Jensen's inequality for expectation: for an integrable random variable Y and convex φ with integrable or nonnegative φ(Y), φ(EY)≤Eφ(Y).

[F4]

Markov's inequality for random variables: for nonnegative Y and a>0, P(Y≥a)≤EY/a.

[F5]

Monotone convergence for the integral: increasing nonnegative limits pass through the integral.

[F6]

Basic identities for a probability measure: countable unions of null events are null.

Proof

Given: The objects and assumptions in the statement.

1.1F2F3F4givenalgebra

First derive a finite-maximum estimate. If Y1,…,Ym are centered and each has sub-Gaussian proxy at most s2, then for λ>0, Eeλmax⁡j∣Yj∣≤∑j=1m(EeλYj+Ee−λYj)≤2meλ2s2/2. By [F3], Emax⁡j∣Yj∣≤λ−1log⁡(2m)+λs2/2. For s>0, choosing λ=2log⁡(2m)/s gives Emax⁡j∣Yj∣≤s2log⁡(2m); for s=0, the proxy bound forces every Yj=0 almost surely by [F4] applied to e±λYj and letting λ→∞.

2.1F1F6step 1.1givenconstruct

If D=0, every pair in T 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 D>0. Fix k≥1 and put ϵk=2−kD. Total boundedness gives a finite cover of T by N(ϵk/4,T,d) closed balls of radius ϵk/4. Approximate each center by a point of the dense set T0 within ϵk/4 to obtain a cover of T by the same number of balls of radius ϵk/2. Since the specified countable dense set is listed, choose the first finite tuple under its induced enumeration that is an ϵk-net and has cardinality at most this cover size; such a tuple exists by the construction. Denote it by Tk. For each t, choose the least-index point πk(t)∈Tk within ϵk. These canonical choices across scales require no choice axiom. Put T0(0)={t0} and π0(t)=t0.

2.2F1step 1.1algebra

For a finite subset A⊂T0, telescope Xt−Xt0 through π1(t),…,πm(t) for every t∈A. At level 1 there are at most ∣T1∣ increments, each with proxy at most D2; for k≥2 there are at most ∣Tk∣∣Tk−1∣ increments, each with proxy at most (ϵk+ϵk−1)2=(3ϵk)2. Applying step 1.1 to the finite set of increments at each level, and the triangle inequality for their maxima, yields Emax⁡t∈A∣Xπm(t)−Xt0∣≤C1∑k=1mϵk1+log⁡N(ϵk/4,T,d) for a universal C1; the k=1 term is absorbed using ϵ1=D/2 and N(ϵ1/4)≥1.

3.1F1F5step 2.2step 1.1givenalgebra∎

The residual maximum over A has expectation at most ϵm2log⁡(2∣A∣) by step 1.1, since d(t,πm(t))≤ϵm. Letting m→∞ for this fixed finite A removes the residual. The dyadic sum in step 2.2 is bounded by a universal multiple of the entropy integral: on each interval [ϵk/8,ϵk/4], monotonicity of N makes the integral at least (ϵk/8)log⁡N(ϵk/4,T,d). Also, for 0<ϵ<D/2, one ball of radius ϵ cannot cover a set of diameter D, so N(ϵ,T,d)≥2 and the entropy integral is at least (D/2)log⁡2; this absorbs the geometric contribution from the added 1. Hence Emax⁡t∈A∣Xt−Xt0∣≤C∫0Dlog⁡N(ϵ,T,d) dϵ. Taking an increasing sequence of finite subsets whose union is T0, [F5] and the separability assumption give the asserted supremum over T.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Glivenko–Cantelli theorem by bracketing entropy

Statement

Let X1,X2,… be iid with law P, and let F be a nonempty pointwise-measurable class of measurable real functions with a nonnegative integrable envelope F. Suppose N[](ϵ,F,L1(P))<∞ for every ϵ>0. Then F is P-Glivenko–Cantelli: sup⁡f∈F∣Pnf−Pf∣→0 in probability. If Countable Choice is assumed, then the stronger conclusion holds that this convergence is almost sure. The terms Pn, P, 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 P, a pointwise-measurable class with integrable envelope, and finite L1(P) bracketing number at every positive scale.

[A1]

For the strong-law branch, assume Countable Choice (The Axiom of Countable Choice (ACω)) to select one finite bracketing family of width at most 1/(2m) for each integer m≥1. The convergence-in-probability branch does not use this axiom.

[F1]

Empirical, centered, and Rademacher processes: Pnf=n−1∑i=1nf(Xi) and Pf=∫f dP.

[F2]

Covering, packing, bracketing numbers, and metric entropy: an L1(P) bracket [l,u] has measurable endpoints, satisfies l≤f≤u P-almost surely, and has width P(u−l).

[F3]

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.

[F4]

Dominated convergence: pointwise convergence dominated by one integrable envelope implies convergence of integrals.

[F5]

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.

1.1F2F5givenconstruct

Fix ϵ>0 and let F0 be the countable pointwise-dense subclass. Choose a finite L1(P) bracketing cover of F with widths at most ϵ/2, which is strictly below ϵ; discard brackets not meeting F0. For each retained bracket, choose one member of F0 in it. The envelope and that member imply that clipping its endpoints to [−F,F] preserves every inclusion in the bracket P-almost surely, and cannot increase the width. Since only finitely many endpoints remain and each is bounded by the integrable F, they are integrable. Countability and [F5] give one probability-one event on which all pointwise-dense-class bracket inclusions hold at every observation.

2.1F1F3F4step 1.1algebra

If f∈[lj,uj], then Pnf−Pf≤Pnuj−Plj=(Pnuj−Puj)+P(uj−lj); likewise Pf−Pnf≤(Plj−Pnlj)+P(uj−lj). Hence sup⁡f∈F0∣Pnf−Pf∣≤max⁡1≤j≤m∣Pnuj−Puj∣∨max⁡1≤j≤m∣Pnlj−Plj∣+ϵ/2. Each endpoint is integrable, so [F3] makes both finite maxima tend to zero almost surely. For arbitrary f∈F, choose pointwise approximants fk∈F0; [F4] gives Pfk→Pf, and the finite empirical averages give Pnfk→Pnf at every sample. Thus the supremum over F equals the countable supremum over F0 samplewise. Given any target η>0, take ϵ=η; the endpoint maxima then imply P(sup⁡f∈F∣Pnf−Pf∣>η)→0. No simultaneous choice of brackets across scales is used for this probability-convergence conclusion.

3.1A1F3F5step 2.1algebra∎

Now assume Countable Choice. For each integer m≥1, choose one finite bracket family of width at most 1/(2m). Step 2.1 with ϵ=1/m and [F3] give a probability-one event on which lim sup⁡nsup⁡f∣Pnf−Pf∣≤1/(2m). By [F5], the countable intersection of these events still has probability one. On it the nonnegative supremum has limsup at most 1/(2m) for every m, hence converges to zero. This is strong P-Glivenko–Cantelli convergence as defined in Glivenko–Cantelli classes.

LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Bracketing entropy implies empirical-process asymptotic equicontinuity

Statement

For a class H of measurable real functions under a probability measure Q, an envelope H means a nonnegative measurable function with ∣h∣≤H Q-almost surely for every h∈H. Cauchy–Schwarz Cauchy-Schwarz inequality for L2 gives QH≤∥H∥Q,2<∞ when H∈L2(Q).

Assume Countable Choice. Let X1,X2,… be iid with law P, and let F be a nonempty pointwise-measurable class of measurable functions with a nonnegative envelope F satisfying PF2<∞. Assume 0<∥F∥P,2<∞ and

∫01log⁡N[](ϵ∥F∥P,2,F,L2(P)) dϵ<∞.

Use the empirical process Gn and semimetric ρP from Empirical, centered, and Rademacher processes and Donsker classes and asymptotic equicontinuity. Then Gn is asymptotically equicontinuous in probability with respect to ρP.

Facts & Assumptions

Given: Countable Choice; an iid sequence, pointwise-measurable class F, square-integrable envelope F, and the finite normalized L2(P) bracketing entropy integral in the statement.

[A1]

Countable Choice permits fixing a finite bracket family at each of countably many dyadic scales (The Axiom of Countable Choice (ACω)).

[A2]

Empirical, centered, and Rademacher processes defines Pn, P, Gn, outer probability, and the countable separable-version convention.

[F1]

Donsker classes and asymptotic equicontinuity: ρP(f,g)={P[(f−g)−P(f−g)]2}1/2 and asymptotic equicontinuity is the vanishing-in-probability condition for the supremum of ∣Gn(f)−Gn(g)∣ over ρP(f,g)<δ.

[F2]

Bracketing maximal inequality for the empirical process: nested finite partitions with cell oscillation envelopes of dyadic L2(P) 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.

[F3]

Covering, packing, bracketing numbers, and metric entropy: an L2(P) bracket has measurable endpoints ordered P-almost surely and width ∥u−l∥P,2; N[](r,F,L2(P)) counts such brackets of width at most r.

[F4]

Dominated convergence: pointwise convergence dominated by an integrable function implies convergence in L1.

[F5]

Markov's inequality for random variables: for nonnegative Y and r>0, P(Y>r)≤EY/r.

[F6]

Cauchy-Schwarz inequality for L2: on a probability space, P∣Y∣≤∥Y∥P,2 for every Y∈L2(P).

Proof

Given: The objects and hypotheses in the statement.

1.1A2F1F6givenconstructalgebra

Choose a countable pointwise-dense subclass F0⊆F. For δ>0, set Hδ={(f−g)−P(f−g):f,g∈F0, ρP(f,g)≤δ}. Every h∈Hδ has ∥h∥P,2≤δ and is bounded in absolute value by H:=2F+2PF, with ∥H∥P,2≤4∥F∥P,2.

1.2A2givenF1F3F6algebra

If f and g lie in L2(P) brackets [li,ui] and [lj,uj] of width at most r∥F∥P,2, respectively, then (f−g)−P(f−g) lies in the bracket [li−uj−P(ui−lj), ui−lj−P(li−uj)]. Its width is wi+wj+P(wi+wj), where wi=ui−li and wj=uj−lj; Cauchy–Schwarz gives its L2(P) norm at most 2(∥wi∥P,2+∥wj∥P,2)≤4r∥F∥P,2. Thus N[](4r∥F∥P,2,Hδ,L2(P))≤N[](r∥F∥P,2,F,L2(P))2.

2.1A1A2F1F2F3step 1.2algebra

Fix 0<δ<∥H∥P,2/2 and choose q0≥1 with δ/2<2−q0∥H∥P,2≤δ. For each q≥q0, take a finite bracketing cover of Hδ at width 2−q∥H∥P,2 and partition the class by assigning each function to the first bracket containing it. Refine these finite partitions cumulatively through level q; by [A1], the countable family of finite covers and their representatives can be selected. If bq is the unrefined level-q count, step 1.2 gives bq≤N[](rq∥F∥P,2,F,L2(P))2 for rq=2−q∥H∥P,2/(4∥F∥P,2), and the refined count satisfies mq≤∏p=q0qbp. Consequently, using 1+∑xp≤1+∑xp for xp≥0 and summing the resulting geometric weights, ∑q≥q02−q1+log⁡(2mq)≤C1∫0C2δ/∥F∥P,21+log⁡N[](ϵ∥F∥P,2,F,L2(P)) dϵ for universal constants C1,C2: the unrefined entropy terms at scale rq are bounded by the integrand on the adjacent dyadic interval [rq/2,rq] by monotonicity of bracketing numbers, and cumulative refinement contributes only a geometric sum of earlier terms. The added 1 contributes a geometric sum of order 2−q0, which is also bounded by the displayed integral because its integrand is at least 1. On each refined cell C, define Δq,C=sup⁡h,h′∈C∣h−h′∣ and choose πq(C)∈C. Countability makes this pointwise supremum measurable; containment in a level-q bracket gives Δq,C≤u−l P-almost everywhere, so it has the required L2(P) 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.

3.1A1F2F4step 2.1algebra

Apply [F2] to Hδ with envelope H and this nested partition. Its coarse term is at most Cδ1+log⁡(2mq0), its dyadic tail is bounded by the right-hand side of step 2.1, and its final envelope-tail term tends to zero as n→∞ for this fixed δ: for each fixed a>0, nP(H1{H>an})≤a−1P(H21{H>an})→0 by [F4].

4.1F1F3step 2.1step 3.1algebra

The entropy integral in the statement makes the integral in step 2.1 tend to zero with δ. It also gives δlog⁡N[](cδ∥F∥P,2,F,L2(P))→0 for each fixed c>0: if h(ϵ)=log⁡N[](ϵ∥F∥P,2,F,L2(P)), monotonicity yields (ϵ/2)h(ϵ)≤∫ϵ/2ϵh(u) du→0. Therefore step 3.1 implies lim⁡δ↓0lim sup⁡nEsup⁡h∈Hδ∣Gn(h)∣=0.

5.1A2F1F4F5step 4.1givenalgebra∎

By [F5], Markov's inequality converts the expected-supremum limit in step 4.1 into asymptotic equicontinuity for pairs in F0. For arbitrary f,g∈F, choose pointwise approximants fk,gk∈F0. The common envelope gives L1(P) convergence by [F4]; applying [F4] to ∣fk−f∣2≤4F2 and ∣gk−g∣2≤4F2 also gives L2(P) convergence. Pointwise convergence gives Pnfk→Pnf and Pngk→Png for each fixed finite sample, so ρP(fk,gk)→ρP(f,g) and the empirical-process increment converges pointwise to the desired increment. Hence a pair with ρP(f,g)<δ/2 is a limit of pairs from F0 with distance below δ. The outer-probability modulus over F is therefore bounded by the countable-class modulus over F0 at radius δ, proving the asserted asymptotic equicontinuity.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passOpen item page →

Functional central limit theorem by bracketing entropy

Statement

For a class H of measurable real functions under a probability measure Q, an envelope H means a nonnegative measurable function with ∣h∣≤H Q-almost surely for every h∈H. Cauchy–Schwarz Cauchy-Schwarz inequality for L2 gives QH≤∥H∥Q,2<∞ when H∈L2(Q).

Assume the Axiom of Choice. Let X1,X2,… be iid with law P on a measurable space, and let F be a nonempty pointwise-measurable class of measurable real functions with a measurable envelope F≥0 satisfying PF2<∞. If ∥F∥P,2=0, the empirical process is the zero process almost surely. Otherwise assume

∫01log⁡N[](ϵ∥F∥P,2,F,L2(P)) dϵ<∞,

where N[](r,F,L2(P)) is the least number of measurable brackets [l,u] with l≤f≤u P-almost surely and ∥u−l∥P,2≤r that cover F. Then F is P-Donsker in the sense of Donsker classes and asymptotic equicontinuity: the empirical process Gn=n(Pn−P) converges weakly in outer expectation in ℓ∞(F) to a tight centered Gaussian bridge with covariance

K(f,g)=P[(f−Pf)(g−Pg)].

The L2(P) bracketing number and width use Covering, packing, bracketing numbers, and metric entropy.

Facts & Assumptions

Given: Assume AC. Let Xi be iid with law P, let F be pointwise measurable with envelope F∈L2(P), and assume the displayed bracketing entropy integral is finite.

[A1]

AC supplies Countable Choice (The Axiom of Choice, The Axiom of Countable Choice (ACω)). 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.

[A2]

The Axiom of Countable Choice (ACω) defines Countable Choice and states that AC implies it. In particular, the metric-completion construction below has its stated choice hypothesis.

[L1]

Empirical, centered, and Rademacher processes: Pnf=n−1∑i=1nf(Xi), Pf=∫f dP, Gn(f)=n(Pnf−Pf), and uncountable suprema use the stated outer-probability/outer-expectation convention unless a countable separable version applies.

[L2]

Covering, packing, bracketing numbers, and metric entropy: an L2(P) bracket has measurable endpoints l≤f≤u P-almost everywhere and width ∥u−l∥P,2.

[L3]

Cauchy-Schwarz inequality for L2: on a probability space, PF≤∥F∥P,2 for nonnegative F∈L2(P).

[F1]

Asymptotic distribution: for a finite-dimensional random vector, an asymptotic distribution is a weak limit of its laws; this does not assert moment convergence.

[F2]

Multivariate iid central limit theorem: under AC, iid vectors with finite second moment converge after centering and n−1/2 scaling to a centered multivariate normal vector whose covariance matrix is the original covariance matrix, including singular matrices.

[F3]

Multivariate normal law, including singular covariance: under AC, a positive-semidefinite covariance matrix specifies an existing centered multivariate normal law, including in singular directions.

[F4]

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.

[F5]

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.

[F6]

Bracketing entropy implies empirical-process asymptotic equicontinuity: the stated square-integrable-envelope and fixed-P bracketing integral imply asymptotic equicontinuity of Gn in ρP(f,g)={P[(f−g)−P(f−g)]2}1/2.

[F7]

Dominated convergence: pointwise convergence dominated by an integrable function implies convergence in L1.

[F8]

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.

[F10]

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.

[F11]

Markov's inequality for random variables: for nonnegative Y and a>0, P(Y>a)≤EY/a. First Borel-Cantelli lemma for events: if event probabilities are summable, only finitely many of the events occur almost surely.

[F12]

Characteristic function of a normal law and Uniqueness of a law from its characteristic function: a centered normal variable of variance σ2 has characteristic function e−t2σ2/2, and equal characteristic functions determine real probability laws.

[F13]

R and Rn for n≥1 with the Euclidean metric are complete, componentwise from the Cauchy criterion in R makes the usual real line complete. Q is countably infinite makes Q countable, and The rationals embed densely in the reals embeds it in R 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.

[F14]

Cramer wold device: Borel probability laws on a finite-dimensional Euclidean space are determined by all their one-dimensional projection laws.

[F15]

Basic identities for a probability measure: countable subadditivity implies that a countable union of null sets is null.

[F16]

Standard normal and normal laws: under AC, N(0,σ2) is the law of x↦σx under the standard normal density law. The standard normal density has total mass one: ϕ(x)=e−x2/2/2π is positive and Borel measurable with Lebesgue integral one.

[F17]

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.

[F19]

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 Xi, P, F, and F satisfy the statement. Put ρP(f,g)={P[(f−g)−P(f−g)]2}1/2 and K(f,g)=P[(f−Pf)(g−Pg)].

1.1A1L1L3F7F15given

If ∥F∥P,2=0, every member of a countable pointwise-dense subclass is zero P-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 f∈F vanish at the observations; dominated convergence gives Pf=0 for each f. Thus Gn is the zero process in outer probability and the conclusion holds with the zero Gaussian bridge.

1.2A1L1L2L3F7F15givenalgebra

Assume ∥F∥P,2>0. The countable pointwise-dense subclass has a common measurable conull set on which its members are bounded by F; pointwise approximation extends that bound to every f∈F on the same set. By [F15], all observations lie in it on one measurable event of probability one. On that event, sup⁡f∈F∣Gn(f)∣≤n(PnF+PF)<∞ for every n, by [L3]. Set the entire empirical path to zero off that event, as required by the Donsker definition. Each finite L2(P) bracket of width r has ρP-diameter at most r, because ρP(f,g)≤∥f−g∥P,2≤∥u−l∥P,2. The entropy integral being finite forces N[](r,F,L2(P))<∞ for every r>0: if it were infinite at one positive scale, monotonicity would make the integral infinite on an interval below that scale. Therefore the quotient of F by zero ρP-distance is totally bounded. The countable pointwise-dense subclass is dense in this quotient, since ∣fk−f∣2≤4F2 and [F7] gives ∥fk−f∥P,2→0.

2.1A1L1L3F3F14givenalgebrastep 1.2

Enumerate the countable dense subclass as F0={fj:j∈J}. For any finite list fj1,…,fjm, the covariance matrix Σab=K(fja,fjb) is positive semidefinite, since cTΣc=P[∑aca(fja−Pfja)]2≥0. [F3] supplies the centered Gaussian law Nm(0,Σ). 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.

3.1A1F3F4F13step 2.1

The coordinate space R with its Borel sigma-algebra is standard Borel by [F13], so [F4] extends the consistent Gaussian laws to a centered Gaussian process G0 indexed by F0, with covariance K. Each increment G0(f)−G0(g) is centered normal with variance ρP(f,g)2.

4.1A1F16F17F18F19step 3.1algebra

For any centered normal Y with variance σ2, if σ=0 then [F16] makes Y=0 almost surely and EeλY=1. If σ>0, [F16]–[F17] give EeλY=∫Reλσxϕ(x) dx=eλ2σ2/2∫Rϕ(x−λσ) dx, by completing the square. For a=λσ and positive integer R>∣a∣, apply [F18] to the translation x↦x−a, 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 ∫[−R,R]ϕ(x−a) dx=∫[−R−a,R−a]ϕ(u) du. These intervals increase to R as R→∞; [F19] on both sides and the normalization in [F16] give ∫Rϕ(x−a) dx=1. Thus every centered Gaussian increment with variance σ2 has MGF proxy σ2, as needed for chaining.

5.1F5step 1.2step 3.1step 4.1algebra

For δ>0, index the Gaussian increment process by pairs (f,g)∈F02 with ρP(f,g)≤δ, and write Yf,g=G0(f)−G0(g). Its canonical pseudometric is dY((f,g),(f′,g′))={E[(Yf,g−Yf′,g′)2]}1/2. The triangle inequality in L2(P) gives dY≤ρP(f,f′)+ρP(g,g′), while every Yf,g has standard deviation at most δ, so the dY-diameter of this pair set is at most 2δ. By step 4.1 its increments are centered sub-Gaussian with their dY-scale. A product of two ϵ/4-nets of F0 covers the pair set within dY-distance ϵ/2. 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 N(ϵ/4,F0,ρP)2. Applying [F5] with the diagonal base point (f∗,f∗) yields Esup⁡f,g∈F0: ρP(f,g)≤δ∣G0(f)−G0(g)∣≤C∫0C′δlog⁡N(ϵ,F0,ρP) dϵ, which tends to zero as δ↓0 by the bracketing cover bound in step 1.2.

6.1A2F8F11step 5.1choose

Choose rational δk↓0 so that the expectation in step 5.1 is at most 2−3k. By [F11], the probability that the corresponding modulus exceeds 2−k is at most 2−2k, and the first Borel–Cantelli lemma makes only finitely many such events occur almost surely. Thus the Gaussian sample paths are uniformly ρP-continuous on F0 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 T; compactness and the pathwise extension are established below.

7.1A2F8F13step 1.2step 6.1constructalgebra

Fix ε>0 and take a finite ε/2-net in the totally bounded metric quotient from step 1.2. Its image in T is still a finite ε/2-net for the dense embedded quotient. For any x∈T, density gives a quotient point q with d(x,q)<ε/2, and some net point y satisfies d(q,y)≤ε/2; hence d(x,y)<ε. Thus T 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 G0 that is uniformly ρP-continuous on the listed dense subset F0, for each x∈T and n≥1 let fn(x) be the first listed point of F0 within 1/n of x. The sequence G0(fn(x)) is Cauchy by uniform continuity and therefore has a real limit by [F13]. Any two sequences from F0 converging to x have pairwise distances tending to zero, so uniform continuity makes their value limits equal. Define G‾0(x) by this common limit. To verify continuity, given η>0 choose τ>0 so that d(u,v)<τ for u,v∈F0 implies ∣G0(u)−G0(v)∣<η/2. If d(x,y)<τ/3, approximating sequences un→x and vn→y eventually satisfy d(un,vn)<τ; passing to their value limits gives ∣G‾0(x)−G‾0(y)∣≤η/2<η. Density makes this extension unique.

8.1A1A2L3F3F7F9F10F12step 3.1step 6.1step 7.1

Uniform continuity on the countable set F0 is a measurable path event: for each integer m, the condition that some positive rational radius makes every coordinate increment below 1/m for pairs in F0 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 C(T,R): evaluations at the countable dense set F0 are measurable, and for continuous functions the supremum distance is the supremum over F0, so preimages of open balls are measurable; separability makes every open set a countable union of such balls. By [F9], C(T,R) is complete and separable; [F10] makes it Polish and its Gaussian law tight. For any finite list f1,…,fm∈F, choose pointwise approximants fi,k∈F0 for each i. By [F7], ∥fi,k−fi∥P,2→0. Fix coefficients c1,…,cm and put Sk=∑iciG0(fi,k) and S=∑iciG‾0([fi]). Step 7.1 gives Sk→S almost surely. Each Sk is centered normal with variance σk2→σ2=∑i,jcicjK(fi,fj)=P[∑ici(fi−Pfi)]2≥0. Dominated convergence [F7] applied to eitSk, whose modulus is one, gives convergence of characteristic functions. By [F12], the limit is e−t2σ2/2 and determines the centered normal law of variance σ2. Every linear combination of the limiting vector is therefore centered normal; [F3] identifies that vector as multivariate normal with covariance (K(fi,fj)). This proves that the pathwise extension has the required Gaussian finite-dimensional laws. Define R:C(T,R)→ℓ∞(F) by R(z)(f)=z([f]), where [f] is the image of f in the metric quotient and its completion. Since these images are dense in T and z−w is continuous, ∥R(z)−R(w)∥F=sup⁡f∈F∣z([f])−w([f])∣=sup⁡t∈T∣z(t)−w(t)∣, so R is an isometry and is continuous. Its pushforward of the tight Borel law on C(T,R) is a tight Borel Gaussian bridge on ℓ∞(F).

9.1F1F2L3givenstep 8.1

Fix any finite f1,…,fm∈F. The vectors (f1(Xi)−Pf1,…,fm(Xi)−Pfm) are iid and have finite second moments, bounded in squared norm by 2m(F(Xi)2+(PF)2) almost surely. [F2] gives convergence of their normalized sums to Nm(0,(K(fa,fb))a,b), 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].

10.1A1F6step 1.2step 9.1construct

By [F6], the empirical processes are asymptotically equicontinuous in ρP. For each ϵ>0, the totally bounded quotient from step 1.2 has a finite ϵ/2-net with centers in the dense subset F0; density then makes it an ϵ-net for all of F. List its finitely many centers and assign to each f the first center within distance ϵ, obtaining πϵ(f). Define Gn,ϵ(f)=Gn(πϵ(f)) and Gϵ(f)=GP(πϵ(f)). Their ranges lie in a finite-dimensional subspace of ℓ∞(F); 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 Gn,ϵ⇒Gϵ for each fixed ϵ.

11.1A1F2F4F5F6F8F9F10step 8.1step 9.1step 10.1algebra∎

The sup-norm error ∥Gn−Gn,ϵ∥F is bounded by the empirical-process modulus over pairs at ρP-distance at most ϵ; it is therefore bounded by the modulus at radius 2ϵ in [F6], which tends to zero in outer probability as ϵ↓0. Uniform continuity of the Gaussian paths gives ∥GP−Gϵ∥F→0 almost surely. For bounded uniformly continuous H, put ωH(r)=sup⁡∥x−y∥F≤r∣H(x)−H(y)∣, which tends to zero as r↓0. If Z,Z′ are random elements and P∗(∥Z−Z′∥>r)=p, a measurable event of probability arbitrarily close to p covers the exceptional set; outside it ∣H(Z)−H(Z′)∣≤ωH(r), and everywhere the difference is at most 2∥H∥∞. This gives ∣E∗H(Z)−E∗H(Z′)∣≤ωH(r)+2∥H∥∞p by measurable majorants. Use the three-term bound ∣E∗H(Gn)−EH(GP)∣≤∣E∗H(Gn)−E∗H(Gn,ϵ)∣+∣EH(Gn,ϵ)−EH(Gϵ)∣+∣EH(Gϵ)−EH(GP)∣. For fixed ϵ the middle term tends to zero by step 10.1; then letting ϵ↓0 makes the other two terms vanish by the outer-probability approximation bound and ωH(r)→0. 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