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.

Discrete Ville inequality and anytime threshold validity

Statement

Assume AC. Let P0 be a family of probability laws and let M=(Mt)t∈N0 be a nonnegative test supermartingale for P0. For every P∈P0 and α∈(0,1), define τα=inf⁡{t≥0:Mt≥1/α},inf⁡∅=∞. Then P ⁣(sup⁡t≥0Mt≥1α)≤α,P(τα<∞)≤α. Moreover, for every discrete stopping time σ, P(σ<∞, Mσ≥1/α)≤α, where the event involving Mσ is restricted to {σ<∞}.

Facts & Assumptions

Given: Assume AC. Let P0 be a null family, let M be a nonnegative test supermartingale for it, and fix P∈P0 and α∈(0,1).

[F1]

Finite-horizon crossing bound for a nonnegative test supermartingale: for every a>0 and finite N, P(max⁡0≤t≤NMt≥a)≤1/a.

[F2]

Continuity from below for measures: if measurable events AN increase, then P(⋃NAN)=lim⁡NP(AN).

[F3]

Nonnegative test supermartingales: under every null law, M is adapted, integrable, nonnegative almost surely at every time, a supermartingale, and has EPM0≤1.

[F4]

Discrete stopping time: for each n, {σ≤n}∈Fn; a stopping time takes values in N0∪{∞}.

[A1]

AC is the axiom used in [F1] through the test-supermartingale definition and bounded optional sampling (The Axiom of Choice).

Proof

1.1givenF1F3A1choose

For any γ∈(0,1), set τγ=inf⁡{t≥0:Mt≥1/γ} and AN={τγ≤N}={max⁡0≤t≤NMt≥1/γ}. The events AN increase and their union is {τγ<∞}={∃t≥0:Mt≥1/γ}.

2.1F1F2step 1.1

By [F1], P(AN)≤γ for each N; [F2] gives P(τγ<∞)=lim⁡NP(AN)≤γ.

3.1givenF3step 2.1choosealgebra

Put γn=α+(1−α)/(n+1) for n≥1. Then γn↓α and 1/γn<1/α. The countable-supremum event H={sup⁡t≥0Mt≥1/α} equals ⋂n≥1{τγn<∞}: if the supremum is at least 1/α, each strictly lower threshold 1/γn is exceeded by some process value; conversely, crossing every such threshold forces the supremum to be at least their limit 1/α. Thus H is measurable and, by step 2.1, P(H)≤γn for every n.

4.1step 2.1step 3.1algebra

Letting n→∞ in step 3.1 gives P(H)≤α. Taking γ=α in step 2.1 also gives P(τα<∞)≤α.

5.1F3F4step 4.1algebra∎

For a discrete stopping time σ, {σ<∞,Mσ≥1/α}=⋃t≥0({σ=t}∩{Mt≥1/α})⊆{τα<∞}. 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 {sup⁡tMt≥1/α} 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