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.

Ville's inequality for nonnegative test supermartingales

Statement

Assume AC. Let P0 be a family of probability laws on a common discrete filtered measurable space and let E=(Et)t≥0 be a nonnegative test supermartingale for P0 Nonnegative test supermartingales. For every P∈P0 and every α∈(0,1), P ⁣(sup⁡t≥0Et≥1α)≤α.

Facts & Assumptions

Given: Assume AC. If P0 is empty the conclusion is vacuous; otherwise fix P∈P0, α∈(0,1), and the nonnegative test supermartingale E. All stopping times below use the discrete filtration and time starts at zero.

[F1]

Nonnegative test supermartingales: under every null law P, E is adapted, integrable, nonnegative almost surely at each time, a supermartingale, and EPE0≤1.

[F2]

Discrete stopping time: a map into N0∪{∞} is a stopping time when {τ≤n}∈Fn for each n, and it is bounded if some deterministic N satisfies τ≤N almost surely.

[F3]

Optional sampling for bounded stopping times: under AC, for bounded stopping times and a supermartingale the expectation inequality points downward.

[F4]

Continuity from below for measures: for an increasing sequence of measurable events, the measure of the union is the limit of their measures.

[A1]

The Axiom of Choice: AC supplies the conditional-expectation clauses used by the supermartingale definition and bounded optional-sampling theorem.

Proof

1.1givenF1F2choose

Fix any γ∈(0,1) and define τγ=inf⁡{t≥0:Et≥1/γ}, with inf⁡∅=∞. For every n, {τγ≤n}=⋃k=0n{Ek≥1/γ}∈Fn, so τγ is a stopping time. Also {τγ∧N≤n}={τγ≤n} for n<N and is the whole space for n≥N, so each τγ∧N is a bounded stopping time.

2.1F1F2F3A1step 1.1

The constant time 0 is a stopping time bounded by 0, and step 1.1 shows τγ∧N is a bounded stopping time. Bounded optional sampling therefore gives EPEτγ∧N≤EPE0≤1.

3.1F1step 2.1algebra

On {τγ≤N}, Eτγ∧N≥1/γ; on its complement the stopped value is EN≥0 almost surely. Hence EPEτγ∧N≥γ−1P(τγ≤N), and step 2.1 yields P(τγ≤N)≤γ.

4.1F4step 3.1

The events {τγ≤N} increase with N and their union is {τγ<∞}=⋃t≥0{Et≥1/γ}. Continuity from below and step 3.1 therefore give P(∃t≥0:Et≥1/γ)≤γ.

5.1step 4.1algebraassume-contrachoosecontradictiondischarge-contradiction∎

Let H={sup⁡t≥0Et≥1/α} and suppose q=P(H)>α. Since q≤1, β=(α+q)/2 lies in (α,1), so 1/β<1/α. If every Et≤1/β, then sup⁡tEt≤1/β<1/α, contrary to H; hence H⊆{∃t:Et≥1/β} even if the supremum is not attained. Step 4.1 with γ=β gives q≤β<q, a contradiction. Therefore P(H)≤α, and since P was arbitrary, the bound holds under every null law.

Depends on

Used by

Dependency tree · two levels

18 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