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.

Almost-surely finite stopping does not imply integrable stopping

Statement

Assume AC. The first time τ that a simple symmetric random walk started at zero hits 1 is almost surely finite but satisfies Eτ=.

Facts & Assumptions

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

[F1]

Optional stopping fails for an unbounded simple-random-walk hitting time proves τ< almost surely and computes Sτ=1, S0=0.

[F2]
[F3]

The Axiom of Choice is inherited from the martingale results.

Proof

1.1

F1 proves that τ< almost surely. Suppose for contradiction that Eτ<.

F1assume-contra
2.1

The walk is a martingale and SnSn1=1, so F2 would imply ESτ=ES0. But F1 computes the two sides as 1 and 0. This contradiction proves Eτ=. AC has exactly the inherited role in F3.

F1F2F3step 1.1discharge-contradiction

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

10 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