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.
Uniform convergence of the empirical right-censoring risk set
Statement
Let be IID real-valued observed times. For every positive integer , define and . For every finite ,
Facts & Assumptions
Given: The observed times are IID real random variables; .
The at-risk process is . (Nelson–Aalen, Kaplan–Meier, and Greenwood estimators)
IID means a common law and mutual independence across the whole subject family. (Identical distribution and IID families)
Proof
Put , let , and let . Then and . Both CDFs are right-continuous, so their supremum error over is the supremum over rational ; over it is the supremum over (with alone when ). Thus both suprema are measurable. Fix . Choose the finitely many distinct quantiles for , together with and , where is the number of distinct finite cutpoints. Between consecutive distinct quantiles , the quantile construction gives ; any jump at a cutpoint is isolated as its singleton point. At each finite cutpoint, both and converge in probability to their expectations by Chebyshev's inequality applied to the IID indicators and . For , monotonicity gives and ; hence is at most the largest one-sided endpoint error plus . At singleton cutpoints, direct endpoint convergence applies. Taking the maximum over the finite partition, then and , proves the first convergence.
Let . Since , for every , . Step 1.1 makes the second term tend to zero; then letting proves the expected-square convergence.
Depends on
Used by
Dependency tree · two levels
6 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
- R. M. Dudley, Uniform Central Limit Theorems, Theorem 1.3, PDF pp. 1–2 (standard reference, not scraped)