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.
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.
Depends on
Used by
- Pointwise strong laws need not give a uniform law Counterexample
- The uniform threshold class is Glivenko–Cantelli Example
- Integrated and conditional uniform convergence of Cox risk-set sums Lemma
- Uniform convergence of empirical risk-set fractions Lemma
- Glivenko–Cantelli theorem by bracketing entropy Theorem
Dependency tree · two levels
19 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
- Jon A. Wellner, Empirical Processes: Theory and Applications, Chapter 1, §1 (standard reference, not scraped)
- David Pollard, Empirical Processes: Theory and Applications, Section 1 (standard reference, not scraped)