Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Optional stopping fails for an unbounded simple-random-walk hitting time

Statement

Assume AC. For simple symmetric random walk S0=0 and τ=inf⁡{n≥0:Sn=1}, define Sτ=0 on {τ=∞}. Then τ is almost surely finite, but Sτ=1 almost surely and ESτ=1≠0=ES0.

Facts & Assumptions

Given: The hypotheses, objects, and conventions in the Statement.

[F1]

Gambler's ruin hitting probability from optional stopping computes finite-interval hitting probabilities.

[F2]
[F3]

The Axiom of Choice is inherited from F1 and the martingale interface.

Counterexample

1.1F1

For a≥1, let Ea be the event that the walk hits 1 before −a. Translating the symmetric ruin interval to {0,a+1} with starting point a, F1 gives P(Ea)=aa+1. The Ea increase, and their union is {τ<∞}: a path that reaches 1 has a finite minimum before that time and therefore belongs to some Ea. Continuity from below gives P(τ<∞)=1.

2.1F2F3step 1.1∎

By definition, Sτ=1 on this probability-one event, whereas S0=0. Thus their expectations differ. This explicitly shows that almost-sure finiteness alone cannot justify passing from τ∧n to τ in bounded optional sampling, as F2 warns. AC has exactly the inherited role in F3.

Depends on

Used by

Dependency tree · two levels

9 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