Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 E=(Et)t≥0 be a nonnegative test supermartingale Nonnegative test supermartingales for a null family P0. Define pt={1,Et≤0,min⁡(1,1/Et),Et>0. Then p=(pt)t≥0 is an anytime-valid p-value process for P0 Anytime-valid p-value processes. For every P∈P0, fixed t≥0, and u∈[0,1], P(pt≤u)≤u. For every possibly unbounded stopping time τ and u∈[0,1], P(τ<∞, pτ≤u)≤u(P∈P0).

Facts & Assumptions

Given: Assume AC. Let P0 be a null family, E a nonnegative test supermartingale for that family, and pt the process in the Statement.

[F1]

Nonnegative test supermartingales: under every P∈P0, each Et is a finite real-valued measurable random variable and is nonnegative almost surely.

[F2]

Anytime-valid p-value processes: an adapted [0,1]-valued process is anytime-valid when every null law bounds its all-times crossing event by the threshold.

[F3]

Ville's inequality for nonnegative test supermartingales: for every null law P and α∈(0,1), P(sup⁡t≥0Et≥1/α)≤α.

[F4]

Valid p-values: a measurable [0,1]-valued statistic is a valid p-value for a nonempty null when every null law satisfies P(p≤u)≤u for all u∈[0,1].

[A1]

The Axiom of Choice: AC is the assumption used by the supermartingale conditional-expectation convention and Ville's bounded optional-sampling proof.

Proof

1.1F1givenconstruct

The map g:R→[0,1] defined by g(x)=1 for x≤0 and g(x)=min⁡(1,1/x) for x>0 is Borel measurable. Thus pt=g(Et) is Ft-measurable and [0,1]-valued. For 0<α<1, the threshold 1/α>1, so pt≤α holds exactly when Et≥1/α.

2.1F2F3A1step 1.1

Taking the union over all t in the equivalence of step 1.1 and applying F3 gives P(∃t≥0:pt≤α)=P(∃t≥0:Et≥1/α)≤P(sup⁡t≥0Et≥1/α)≤α for every P∈P0. This is the defining anytime-valid condition.

3.1F1F2step 2.1

For a fixed t and 0<u<1, {pt≤u}⊆{∃s:ps≤u}, so its probability is at most u by step 2.1. Since Et is finite, pt>0; hence the bound at u=0 is zero, and at u=1 it is trivial. For any stopping time τ, {τ<∞, pτ≤u}=⋃t≥0({τ=t}∩{pt≤u}) is contained in the all-times crossing event for 0<u<1; the endpoints follow as above. Thus fixed-time and stopping-time validity both hold.

4.1F4step 1.1step 3.1given∎

If P0 is nonempty, form the fixed-time experiment with data space (Ω,Ft), parameter set Θ=P0, laws given by restriction to Ft, and null set Θ0=Θ. The observation is the identity map from the original sample space to this data space. Step 1.1 makes pt a statistic and step 3.1 gives its superuniform inequality under every law in Θ0, so F4 makes it a valid p-value in this experiment. If P0 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