Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 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.

Depends on

Used by

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