Alphabeta Math
Pipeline-generated
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 Times and Optional Stopping

1 · Prerequisites

2 · Summary

Stopping times are defined by literal finite-horizon events, with boundedness kept distinct from almost-sure finiteness. Minimum, maximum, and shift formulas record the exact filtration in which each shifted time is stopping. A stopped random variable has an explicit cemetery value on {τ=}, while the finite stopped process never evaluates that value.

The sigma-algebra at a stopping time is verified directly, including FσFτ under pointwise order. Bounded optional sampling is proved through the finite predictable-transform identity and includes martingale equality plus both submartingale/supermartingale directions.

Each unbounded extension supplies its own valid limit mechanism: uniform integrability and a terminal conditional representation, bounded increments together with integrable time, or a direct integrable dominator. Wald's equation instead uses an absolute tail-series/Tonelli calculation and remains choice-free. Gambler's ruin derives both hitting probability and expected duration without assuming duration integrability in advance.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Discrete stopping time

Definition

For a filtration (Fn)n0, a map τ:ΩN0{} is a stopping time if {τn}Fn for every n0. It is bounded if some deterministic N satisfies τN almost surely, and finite if P(τ<)=1. These notions are distinct: finite does not mean bounded.

The event condition is literal, not merely modulo null sets; no completion of the filtration is assumed. Measurability as an extended-integer-valued random variable follows from the equivalent event tests below.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Equivalent event tests for a discrete stopping time

Statement

For a filtration (Fn) and τ:ΩN0{}, the following are equivalent:

  1. {τn}Fn for every n;
  2. {τ=n}Fn for every n;
  3. {τ>n}Fn for every n.

Under any of them, {τn}Fn1 for n1.

Facts & Assumptions

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

[F1]

Discrete stopping time is condition (1).

[F2]

Sigma-algebras supplies closure under complements, differences, and finite unions.

Proof

1.1

Conditions (1) and (3) are equivalent because {τ>n}=Ω{τn} and Fn is closed under complements.

F2
1.2

From (1), {τ=0}={τ0}F0 and, for n1, {τ=n}={τn}{τn1}Fn, using Fn1Fn. Thus (1) implies (2).

F1F2
1.3

From (2), {τn}=k=0n{τ=k}Fn, since each summand lies in FkFn. Thus (2) implies (1), completing the equivalence.

F2
2.1

Finally, for n1, {τn}=Ω{τn1}Fn1. The value is automatically included in this event.

F1F2
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

First hitting time of an adapted process is a stopping time

Statement

If X is adapted and BR is Borel, then τ=inf{n0:XnB},inf=, is a stopping time.

Facts & Assumptions

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

[F1]

Adapted and integrable stochastic process gives {XkB}Fk.

[F2]

Equivalent event tests for a discrete stopping time reduces the claim to the finite-horizon events.

Proof

1.1

For each n, {τn}=k=0n{XkB}. Every term is in FkFn by F1, and the union is finite.

F1
2.1

Hence the event belongs to Fn, so F2 proves that τ is a stopping time. If the path never enters B, it belongs to none of these events and the convention gives exactly τ=.

F2step 1.1
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Minimum, maximum, and bounded shifts of stopping times

Statement

If σ,τ are stopping times, then στ and στ are stopping times. If cN0, then τ+c is a stopping time for (Fn), with +c=. More generally, if ρ is stopping for Gn=Fn+c, then ρ+c is stopping for (Fn). The earlier shift (τc)+ is stopping for (Fn+c) but need not be stopping for (Fn). Finally, for every deterministic NN0, τN is a bounded stopping time.

Facts & Assumptions

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

[F1]

Discrete stopping time supplies the finite-horizon test.

[F2]

Equivalent event tests for a discrete stopping time supplies the complementary tests.

Proof

1.1

The identities {στn}={σn}{τn},{στn}={σn}{τn} prove the first two claims by F1.

F1
1.2

If n<c, {τ+cn}=; if nc, it is {τnc}FncFn. If ρ is stopping for G, the same event is in Gnc=Fn.

F1
1.3

For the earlier shift, {(τc)+n}={τn+c}Fn+c, so it is stopping for the shifted filtration. The right side need not lie in Fn, which is why no unshifted assertion is made.

F1
2.1

A deterministic N is a stopping time, so step 1.1 makes τN a stopping time, and it is bounded by N. All empty and infinite-value cases follow from the displayed identities.

F1F2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Sigma-algebra at a stopping time

Definition

For a stopping time τ, define Fτ={AF:A{τn}Fn for every n0}. It represents the events observable by time τ. The definition applies when τ may equal and treats events as literal sets, not modulo null sets. Its closure and comparison properties are proved in the next lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

The stopping-time sigma-algebra is a sigma-algebra

Statement

For every stopping time τ, Fτ is a σ-algebra contained in F. For deterministic τ=n it equals Fn. If στ pointwise, then FσFτ.

Facts & Assumptions

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

[F1]

Sigma-algebra at a stopping time gives the defining intersection tests.

[F2]

Sigma-algebras supplies closure operations.

Proof

1.1

Since {τn}Fn, Ω passes every test. If A passes, then Ac{τn}={τn}(A{τn})Fn. If all Aj pass, distributivity gives (jAj){τn}=j(Aj{τn})Fn. Thus Fτ is a σ-algebra, and containment in F is part of F1.

F1F2
1.2

If τn, all tests below n are vacuous and the test at n is AFn; upward nesting then supplies every later test. Hence Fτ=Fn.

F1
2.1

Suppose στ and AFσ. For each n, A{τn}=k=0n(A{σk}){τ=k}. On {τ=k} the condition σk is automatic, so the equality is exact. Each term belongs to FkFn, proving AFτ. The order hypothesis is not weakened to an untracked almost-sure order.

F1F2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Stopped random variable and stopped process

Definition

For an adapted real process X, a stopping time τ, and a fixed real cemetery value x, define Xτ=k0Xk1{τ=k}+x1{τ=}. The level events are disjoint and exactly one displayed term is active, so the value is unambiguous. If an actual terminal variable X is separately supplied, it may replace x on {τ=}, but that convention must be stated.

The stopped process is Xnτ=Xnτ. Because nτ{0,,n}, this expression never evaluates the cemetery value and equals the finite sum k=0n1Xk1{τ=k}+Xn1{τn}.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A stopped random variable is measurable at the stopping time

Statement

If X is adapted, τ is a stopping time, and the value on {τ=} is a fixed real number, then Xτ is Fτ-measurable. In particular, Xτn is Fτn-measurable.

Facts & Assumptions

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

[F1]

Stopped random variable and stopped process gives the disjoint level-set formula.

[F2]

Sigma-algebra at a stopping time gives the event tests for Fτ.

[F3]

Proof

1.1

For Borel B, {XτB}=k0({τ=k}{XkB})  ({τ=} if xB). All finite-level terms lie in F, and {τ=} is the complement of their countable union, so the inverse image is in F.

F1F3
2.1

Intersecting that inverse image with {τm} deletes the infinity term and all levels above m, leaving k=0m{τ=k}{XkB}Fm. Thus every inverse image passes F2's tests and Xτ is Fτ-measurable. Apply the same proof to the bounded stopping time τn for the final assertion.

F2F3step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A stopped martingale is a martingale

Statement

Assume AC. If M is a martingale and τ is a stopping time, then Mnτ=Mnτ is a martingale with respect to the original filtration.

Facts & Assumptions

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

[F1]

Stopped random variable and stopped process gives a finite formula for every Mnτ.

[F2]

Equivalent event tests for a discrete stopping time gives {τn}Fn1.

[F3]

Discrete martingale transform interprets the stopped increments as a bounded predictable transform.

[F4]

Martingale submartingale and supermartingale supplies the conditional mean-zero increments.

[F5]

The Axiom of Choice states AC, assumed here because the martingale and conditional-expectation interfaces require it.

[F6]

Taking out what is known permits the bounded Fn1-measurable indicator in step 1.2 to be taken outside conditional expectation.

Proof

1.1

The finite formula in F1 makes Mnτ Fn-measurable and integrable: it is a finite sum of Mk1{τ=k} for k<n and Mn1{τn}.

F1F2
1.2

Pathwise, MnτM(n1)τ=1{τn}(MnMn1). The indicator is bounded and Fn1-measurable by F2, so this is the nth increment of the predictable transform in F3.

F2F3
2.1

Taking the conditional expectation of step 1.2 and pulling out the indicator by F6 gives zero by F4. Together with adaptedness and integrability from step 1.1, this is exactly the martingale condition. The stopped process never evaluates a value at infinity; AC has only the role in F5.

F4F5F6step 1.1step 1.2
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Optional sampling for bounded stopping times

Statement

Assume AC. If M is a martingale and στ are stopping times bounded by a deterministic N, then E[MτFσ]=Mσa.s., so EMτ=EMσ. For a submartingale X the conditional and expectation inequalities point upward; for a supermartingale they point downward.

Facts & Assumptions

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

[F1]

Sigma-algebra at a stopping time gives the events usable in conditional testing.

[F2]

A stopped random variable is measurable at the stopping time gives the required measurability of stopped values.

[F3]

Bounded predictable transforms preserve martingales gives zero expected martingale transforms. Nonnegative predictable transforms preserve submartingale gains gives the upward sign for submartingales and nonnegative holdings; applying it to X gives the downward sign for supermartingales.

[F4]

Conditional expectation as an ae class identifies a conditional expectation from all event integrals.

[F5]

The Axiom of Choice supplies conditional-expectation representatives.

Proof

1.1

Put Hk=1{σ<kτ} for 1kN. Both {σ<k}={σk1} and {τk} lie in Fk1, so H is nonnegative, bounded, and predictable. On the probability-one event {στN}, the finite pathwise telescope is XτXσ=k=1NHk(XkXk1). The integral identities below use this almost-sure equality; no equality is asserted on a null outcome with τ>N.

F1
2.1

Fix AFσ. On {σk}, Hk=0; hence 1AHk=1A{σk1}Hk, and the first factor on the right is Fk1-measurable by F1. Thus 1AH is another bounded nonnegative predictable process.

F1step 1.1
3.1

Apply F3's one-step conditional calculation and sum: for a submartingale, A(XτXσ)dP0; for a martingale equality holds, and for a supermartingale the inequality reverses. Almost-sure boundedness identifies every stopped value almost surely with a finite sum of integrable variables, while F2 gives Fσ-measurability of Xσ. F4 therefore identifies the stated conditional relation. Taking A=Ω gives the expectation relation. AC has exactly the role in F5.

F2F3F4F5step 1.1step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Optional stopping under uniform integrability

Statement

Assume AC. Let M be a uniformly integrable martingale and let στ be pointwise ordered, almost-surely finite stopping times. Define Mσ and Mτ using the fixed cemetery value 0 on the respective null events where the stopping time is infinite. Then Mσ,MτL1 and E[MτFσ]=Mσa.s.,EMτ=EMσ.

Facts & Assumptions

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

[F1]

Closed martingale characterization supplies ML1 with Mn=E[MFn] and makes conditional expectations of this fixed variable uniformly integrable.

[F2]

Optional sampling for bounded stopping times handles every truncated time.

[F3]

Stopped random variable and stopped process gives pointwise stabilization at an almost-surely finite time.

[F4]

Sigma-algebra at a stopping time gives the stopped-event tests, and Tower property of conditional expectation applies to nested sigma-algebras.

[F5]

The Axiom of Choice records the background AC hypothesis. The conditional-expectation and representative properties used here are supplied by [F1], [F2], and [F4].

[F6]

The stopping-time sigma-algebra is a sigma-algebra proves FσFτ for pointwise στ.

Proof

1.1

Fix a stopping time ρ equal to either σ or τ. For rn, F2 applied to ρnr gives Mρn=E[MrFρn]. Let r in L1 using F1 and conditional contraction to obtain Mρn=E[MFρn].

F1F2
2.1

The sigma-algebras Fρn increase with n. Thus the sequence in step 1.1 is a closed, hence uniformly integrable, martingale by F1. Since ρ< almost surely, F3 gives MρnMρ almost surely; F1's UI convergence implication upgrades this to L1, proving MρL1.

F1F3step 1.1
3.1

For AFρ, the event A{ρn} belongs to Fρn (check the defining finite-level intersections). Apply the conditional identity in step 1.1 on this event, then let n. The left side converges by step 2.1; the right side converges by dominated convergence for M1A{ρn}. Hence AMρdP=AMdP, so Mρ=E[MFρ].

F1F4step 1.1step 2.1
4.1

Since στ pointwise, F6 gives FσFτ. Apply the tower property in F4 to the two representations from step 3.1: E[MτFσ]=E[E[MFτ]Fσ]=E[MFσ]=Mσ. Taking expectations finishes. AC is the background hypothesis recorded in F5; the conditional-expectation identities come from F1 and F4.

F1F4F5F6step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Optional stopping with integrable time and bounded increments

Statement

Assume AC. Let M be a martingale with MnMn1C almost surely for every n1, for deterministic C<. If τ is a stopping time with Eτ<, define Mτ=0 on the null event {τ=}. Then MτL1 and EMτ=EM0.

Facts & Assumptions

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

[F1]

Optional sampling for bounded stopping times gives EMτn=EM0.

[F2]

Expectation of a nonnegative or integrable random variable defines Eτ as an extended nonnegative integral; Markov's inequality for random variables bounds P(τm) by Eτ/m for each m>0.

[F3]

Dominated convergence passes the stopped values in L1.

[F4]

The Axiom of Choice is inherited from the martingale and bounded optional-sampling theorem.

Proof

1.1

For every positive integer m, F2 gives P(τ=)P(τm)Eτ/m. Since Eτ<, letting m shows τ< almost surely. On that event, MτnMτC(τn)+Cτ, because the difference telescopes over at most (τn)+ increments. It tends pointwise to zero and has the integrable dominator Cτ.

F2
2.1

F3 gives MτnMτ in L1; in particular Mτ is integrable. F1 gives EMτn=EM0 for every n, so taking the L1 limit proves the equality. Bounded increments and integrability of τ are used exactly in step 1.1. AC has only the role in F4.

F1F3F4step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Optional stopping with a dominating integrable variable

Statement

Assume AC. Let M be a martingale and τ an almost-surely finite stopping time. If YL1 and MτnY almost surely for every n, define Mτ=Mτ(ω)(ω) on {τ<} and Mτ=0 on {τ=}. Then MτL1 and EMτ=EM0.

Facts & Assumptions

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

[F1]

Optional sampling for bounded stopping times gives the expectation identity at τn.

[F2]

Dominated convergence passes to the finite-time limit.

[F3]

The Axiom of Choice is inherited from the martingale and optional-sampling interfaces.

Proof

1.1

Since τ< almost surely, Mτn eventually equals Mτ almost surely. On the null event {τ=} the stipulated cemetery value makes the stopped variable total; all limit assertions are almost-sure assertions. The assumed bound passes to MτY, proving integrability, and also gives MτnMτ2Y. F2 therefore yields L1 convergence.

F2
2.1

F1 gives EMτn=EM0 for every n. Pass to the L1 limit from step 1.1 to get EMτ=EM0. AC has exactly the inherited role in F3.

F1F3step 1.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

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 Ek=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}Fk1.

Proof

1.1

Pointwise, k=1τXk=k1Xk1{τk},τ=k11{τk}. The first identity is understood through finite partial sums; the integrability calculation below shows that τ= is null.

F1
2.1

By F1, F2, F3, E[Xk1{τk}]=EX1P(τk). MCT applied to the nonnegative partial sums and to the second identity in step 1.1 gives Ek1Xk1{τk}=EX1k1P(τk)=EX1Eτ<. Thus the stopped series is absolutely integrable and τ< almost surely.

F2F3F4
3.1

The signed partial sums are dominated by the integrable absolute series in step 2.1. DCT and finite linearity therefore give Ek=1τXk=k1E[Xk1{τk}]=k1μ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.

F3F4step 1.1step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Gambler's ruin hitting probability from optional stopping

Statement

Assume AC. Let N2 and i{1,,N1} be integers, let Sn=i+k=1nξk, where the independent increments take 1 and 1 with probability 1/2, and use the natural filtration Fn=σ(ξ1,,ξn), with F0 trivial. For τ=inf{n:Sn{0,N}}, τ is almost surely finite; use the cemetery value Sτ=0 on {τ=}. Then P(Sτ=N)=i/N.

Facts & Assumptions

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

[F2]
[F3]

Optional stopping with a dominating integrable variable passes from the bounded stopped times to τ.

[F4]

The Axiom of Choice is inherited from martingale conditioning and optional stopping.

Proof

1.1

Adaptedness and F1 make τ a stopping time. At the start of any block of N fresh increments, conditional on not yet having exited, the event that all N increments are +1 has probability 2N and forces an upper exit within that block. Independence of successive increments therefore gives inductively P(τ>mN)(12N)m0. Thus τ< almost surely.

F1
2.1

Since Eξk=0 and ξk is independent of the past, F2 gives E[SkFk1]=Sk1. Before and at exit the nearest-neighbour path stays in [0,N], so SτnN. F3 with dominator N yields ESτ=ES0=i.

F2F3step 1.1
3.1

At the finite exit time, Sτ{0,N}; the chosen value zero on the null event {τ=} preserves this assertion everywhere. Therefore i=ESτ=NP(Sτ=N), which gives the result. AC is used exactly through F4.

F4step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Expected duration of symmetric gambler's ruin

Statement

Assume AC. In the symmetric gambler's ruin setting with S0=i and absorbing levels 0,N, the exit time satisfies Eτ=i(Ni).

Facts & Assumptions

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

[F1]

Gambler's ruin hitting probability from optional stopping gives almost-sure finiteness and P(Sτ=N)=i/N.

[F2]

Square minus predictable quadratic variation is a martingale makes Sn2n a martingale for unit-variance increments.

[F4]

Dominated convergence and Monotone convergence for the integral pass the two stopped terms separately.

[F5]

The Axiom of Choice is inherited from the martingale and optional-sampling interfaces.

Proof

1.1

The predictable quadratic variation of the symmetric walk is n, since every increment has conditional square one. Thus F2 and bounded optional sampling give E[Sτn2]E(τn)=i2.

F2F3
1.2

The stopped position lies in [0,N] and converges almost surely to Sτ by F1. DCT gives E[Sτn2]ESτ2=N2P(Sτ=N)=Ni. Meanwhile τnτ, so MCT gives E(τn)Eτ, initially allowing infinity.

F1F4
2.1

Taking limits in step 1.1 forces the latter value to be finite and gives NiEτ=i2,Eτ=i(Ni). The argument does not assume integrability of τ before proving it. AC has exactly the role in F5.

F5step 1.1step 1.2
RemarkRemark: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Optional stopping requires a passage-to-the-limit hypothesis

Remark

Assume AC. Bounded optional sampling proves EMτn=EM0; almost-sure convergence MτnMτ does not by itself permit expectations to pass to the limit. Almost-sure finiteness of τ alone is insufficient, and even Eτ< is insufficient when the martingale increments are unrestricted.

Three valid mechanisms established here are distinct:

The companion counterexamples witness both advertised failures. This remark adds no new optional-stopping theorem. AC is exactly the conditional-expectation dependence inherited from the three cited results.

5 · Examples, counterexamples and false statements

None yet.

Sources