A Constructive Proof of the Glivenko-Cantelli Theorem
Daniel Salnikov

TL;DR
This paper provides a constructive proof of the Glivenko-Cantelli theorem, demonstrating how empirical distribution functions converge uniformly to the true distribution, reinforcing the validity of sampling for distribution inference.
Contribution
It offers a new constructive proof of the Glivenko-Cantelli theorem, directly deriving convergence from empirical distribution properties and enhancing understanding of sampling-based distribution analysis.
Findings
Empirical distribution functions converge uniformly almost surely to the true distribution.
The proof is constructive, providing explicit derivation of convergence.
Sampling techniques effectively capture distribution behavior as sample size increases.
Abstract
The Glivenko-Cantelli theorem states that the empirical distribution function converges uniformly almost surely to the theoretical distribution for a random variable . This is an important result because it establishes the fact that sampling does capture the dispersion measure the distribution function imposes. In essence, sampling permits one to learn and infer the behavior of by only looking at observations from . The probabilities that are inferred from samples will become more precise as the sample size increases and more data becomes available. Therefore, it is valid to study distributions via samples. The proof present here is constructive, meaning that the result is derived directly from the fact that the empirical distribution function converges pointwise almost surely to the theoretical distribution. The work includes a proof of this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and statistical mechanics · Bayesian Methods and Mixture Models · Markov Chains and Monte Carlo Methods
