Alphabeta Math
ExampleConstruction: 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.

Stopping a likelihood-ratio martingale

Statement

Assume AC. Let N∈N0, let (Fn)0≤n≤N be a filtration on a probability space (Ω,FN,P), and let Q be a probability measure on FN with Q≪P. Let Ln=EP[dQ/dP∣Fn],0≤n≤N. For every stopping time τ≤N, Lτ is nonnegative, Fτ-measurable, and EPLτ=1. Moreover Q(A)=EP[1ALτ](A∈Fτ).

Facts & Assumptions

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

[F2]

Conditional expectation process is a martingale makes Ln a nonnegative martingale.

[F3]

Optional sampling for bounded stopping times gives conditional and unconditional identities at τ.

[F5]

The Axiom of Choice is used exactly for Radon–Nikodym and conditional-expectation existence.

Proof

1.1F1F2F3F4

F1 and conditional positivity make every Ln nonnegative; F2 makes the process a martingale. F4 makes Lτ Fτ-measurable. Applying F3 between τ and deterministic N gives Lτ=EP[LN∣Fτ],EPLτ=EPLN=Q(Ω)=1.

2.1F1F3F5step 1.1∎

For A∈Fτ, the defining conditional-expectation identity in step 1.1 gives EP[1ALτ]=EP[1ALN]=Q(A), where the final equality is the Radon–Nikodym identity and A∈Fτ⊆FN. AC has precisely the role in F5.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

20 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