RECORD
A proof of Sanov's Theorem via discretizations
Probability · Submitted 8 Dec 2021
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim We present an alternative proof of Sanov's theorem for Polish spaces in the weak topology that follows via discretization arguments.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
We present an alternative proof of Sanov's theorem for Polish spaces in the weak topology that follows via discretization arguments. We combine the simpler version of Sanov's Theorem for discrete finite spaces and well chosen finite discretizations of the Polish space. The main tool in our proof is an explicit control on the rate of convergence for the approximated measures.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We present an alternative proof of Sanov's theorem for Polish spaces in the weak topology that follows via discretization arguments. | contribution 1.00 | 0.94 | 0.75 | asserted 1.00 |
| s1 | We combine the simpler version of Sanov's Theorem for discrete finite spaces and well chosen finite discretizations of the Polish space. | method 0.98 | 0.82 | 0.11 | asserted 0.99 |
| s2 | The main tool in our proof is an explicit control on the rate of convergence for the approximated measures. | method 0.87 | 0.87 | 0.15 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v2
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original abstract
We present an alternative proof of Sanov's theorem for Polish spaces in the weak topology that follows via discretization arguments. We combine the simpler version of Sanov's Theorem for discrete finite spaces and well chosen finite discretizations of the Polish space. The main tool in our proof is an explicit control on the rate of convergence for the approximated measures.
Human review
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.