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.
A test supermartingale gives anytime-valid p-values
Statement
Assume AC. Let be a nonnegative test supermartingale Nonnegative test supermartingales for a null family . Define Then is an anytime-valid p-value process for Anytime-valid p-value processes. For every , fixed , and , . For every possibly unbounded stopping time and ,
Facts & Assumptions
Given: Assume AC. Let be a null family, a nonnegative test supermartingale for that family, and the process in the Statement.
Nonnegative test supermartingales: under every , each is a finite real-valued measurable random variable and is nonnegative almost surely.
Anytime-valid p-value processes: an adapted -valued process is anytime-valid when every null law bounds its all-times crossing event by the threshold.
Ville's inequality for nonnegative test supermartingales: for every null law and , .
Valid p-values: a measurable -valued statistic is a valid p-value for a nonempty null when every null law satisfies for all .
The Axiom of Choice: AC is the assumption used by the supermartingale conditional-expectation convention and Ville's bounded optional-sampling proof.
Proof
The map defined by for and for is Borel measurable. Thus is -measurable and -valued. For , the threshold , so holds exactly when .
Taking the union over all in the equivalence of step 1.1 and applying F3 gives for every . This is the defining anytime-valid condition.
For a fixed and , , so its probability is at most by step 2.1. Since is finite, ; hence the bound at is zero, and at it is trivial. For any stopping time , is contained in the all-times crossing event for ; the endpoints follow as above. Thus fixed-time and stopping-time validity both hold.
If is nonempty, form the fixed-time experiment with data space , parameter set , laws given by restriction to , and null set . The observation is the identity map from the original sample space to this data space. Step 1.1 makes a statistic and step 3.1 gives its superuniform inequality under every law in , so F4 makes it a valid p-value in this experiment. If is empty, all lawwise assertions are vacuous.
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, Nonparametric, Nonasymptotic Confidence Sequences, Lemma 3 and §6 (standard reference, not scraped)
- Aaditya Ramdas, Peter Grunwald, Vladimir Vovk and Glenn Shafer, Game-Theoretic Statistics and Safe Anytime-Valid Inference, §§2.5 and 2.7 (standard reference, not scraped)