Alphabeta Math
CorollaryStatement: Literature-sourcedProof: 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.

Wald first equation under integrable stopping

Statement

Let X1,X2,… be iid integrable real random variables with mean μ, let Fn=σ(X1,…,Xn), and let τ be an (Fn)-stopping time with Eτ<∞. Then ∑k=1τXk is integrable and E∑k=1τXk=μEτ.

Facts & Assumptions

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

[F1]

Equivalent event tests for a discrete stopping time gives {τ≥k}∈Fk−1.

Proof

1.1F1

Pointwise, ∑k=1τXk=∑k≥1Xk1{τ≥k},τ=∑k≥11{τ≥k}. The first identity is understood through finite partial sums; the integrability calculation below shows that τ=∞ is null.

2.1F2F3F4

By F1, F2, F3, E[∣Xk∣1{τ≥k}]=E∣X1∣ P(τ≥k). MCT applied to the nonnegative partial sums and to the second identity in step 1.1 gives E∑k≥1∣Xk∣1{τ≥k}=E∣X1∣∑k≥1P(τ≥k)=E∣X1∣ Eτ<∞. Thus the stopped series is absolutely integrable and τ<∞ almost surely.

3.1F3F4step 1.1step 2.1∎

The signed partial sums are dominated by the integrable absolute series in step 2.1. DCT and finite linearity therefore give E∑k=1τXk=∑k≥1E[Xk1{τ≥k}]=∑k≥1μP(τ≥k)=μEτ, where F3 gives the middle factorization. This argument is choice-free: the given iid sequence and stopping time supply all indexed objects, and no conditional-expectation version is chosen.

Depends on

Used by

Dependency tree · two levels

40 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