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.
Discrete Ville inequality and anytime threshold validity
Statement
Assume AC. Let be a family of probability laws and let be a nonnegative test supermartingale for . For every and , define Then Moreover, for every discrete stopping time , where the event involving is restricted to .
Facts & Assumptions
Given: Assume AC. Let be a null family, let be a nonnegative test supermartingale for it, and fix and .
Finite-horizon crossing bound for a nonnegative test supermartingale: for every and finite , .
Continuity from below for measures: if measurable events increase, then .
Nonnegative test supermartingales: under every null law, is adapted, integrable, nonnegative almost surely at every time, a supermartingale, and has .
Discrete stopping time: for each , ; a stopping time takes values in .
AC is the axiom used in [F1] through the test-supermartingale definition and bounded optional sampling (The Axiom of Choice).
Proof
For any , set and . The events increase and their union is .
By [F1], for each ; [F2] gives .
Put for . Then and . The countable-supremum event equals : if the supremum is at least , each strictly lower threshold is exceeded by some process value; conversely, crossing every such threshold forces the supremum to be at least their limit . Thus is measurable and, by step 2.1, for every .
Letting in step 3.1 gives . Taking in step 2.1 also gives .
For a discrete stopping time , . The event is measurable by [F3]–[F4], and step 4.1 bounds its probability by .
Remarks
The all-time crossing event and the supremum event are not identified here. The proof uses lower thresholds for the supremum event because a supremum need not be attained.
Depends on
Used by
Dependency tree · two levels
17 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
- Steven R. Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon, Time-uniform Chernoff bounds via nonnegative supermartingales, Probability Surveys 17 (2020), 257–317 (standard reference, not scraped)
- R. L. Wolpert, STA 205: Martingales, Duke University lecture notes (2010) (standard reference, not scraped)