How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Empirical, centered, and Rademacher processes
Definition
Let be a probability space, let be an integer, and let be IID random elements with law . For a class of measurable, integrable real-valued functions on , write
The map is the centered empirical process, and is its -scaled version. More generally, for independent processes whose marginal expectations are finite for each index , the centered process sum is
On an auxiliary probability-space extension, let be independent signs, each taking and with probability , independent of the observations. The empirical Rademacher process is
The centered Rademacher process is a distinct process; no equality between it and is part of this definition.
For a countable class of measurable functions, each displayed supremum of measurable sample paths is measurable. For an uncountable class, ordinary probability or expectation is used only when a specified countable subclass has the same supremum almost surely for the process in question; this is the separable-version convention used here. Otherwise state results using outer probability
and, for a nonnegative possibly nonmeasurable random quantity , outer expectation
In particular, measurability of every separately does not by itself make an uncountable supremum measurable.
Depends on
Used by
- An uncountable class can have a nonmeasurable empirical supremum Counterexample
- Pointwise strong laws need not give a uniform law Counterexample
- Donsker classes and asymptotic equicontinuity Definition
- Glivenko–Cantelli classes Definition
- One-sided empirical Rademacher complexity Definition
- A two-function class on a Bernoulli sample Example
- The uniform empirical CDF converges to a Brownian bridge Example
- The uniform threshold class is Glivenko–Cantelli Example
- Bracketing entropy implies empirical-process asymptotic equicontinuity Lemma
- Bracketing maximal inequality for the empirical process Lemma
- Integrated and conditional uniform convergence of Cox risk-set sums Lemma
- Uniform convergence of empirical risk-set fractions Lemma
- Empirical-risk oracle bound under uniform deviation Theorem
- Functional central limit theorem by bracketing entropy Theorem
- Glivenko–Cantelli theorem by bracketing entropy Theorem
- Independent-process symmetrization for convex moments Theorem
- Uniform deviation bound for a finite unit-range class Theorem
Dependency tree · two levels
14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- David Pollard, Empirical Processes: Theory and Applications, Chapter 2 (standard reference, not scraped)
- David Pollard, Probability Tools, Tricks, and Miracles, 2026 manuscript, Chapter 13 (standard reference, not scraped)
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1 (standard reference, not scraped)