Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Discrete strong Markov property

Statement

Assume Choice. Let X be a K-chain, let τ:ΩN0{} be a stopping time, and let H be a bounded measurable path functional. Put h(x)=ExH and define the everywhere meaningful random variables ZH:=n01{τ=n}H(Xn,Xn+1,),Rh:=n01{τ=n}h(Xn). Both are defined to be zero on {τ=}. Then E[ZHFτ]=Rha.s. This is the precise meaning of the usual eventwise notation E[1{τ<}H(Xτ,Xτ+1,)Fτ]=1{τ<}h(Xτ): no value X is used. If τ< almost surely, the indicators can be omitted.

Facts & Assumptions

Given: Choice, the chain, stopping time and bounded H in the statement.

[F1]

At deterministic time n, E[H(Xn,Xn+1,)Fn]=h(Xn), with measurable h. (Markov property for bounded future path functionals)

[F2]

If AFτ, then A{τ=n}Fn for every finite n. (Sigma-algebra at a stopping time)

[F3]

A stopped adapted random variable, set to a fixed value on {τ=}, is Fτ-measurable. (A stopped random variable is measurable at the stopping time)

[F4]

Dominated convergence passes the partial-sum limit through expectation. (Dominated convergence)

Proof

1.1

Since h is measurable, (h(Xn)) is adapted. Applying [F3] with value [F1, F3] zero at infinity shows that Rh is Fτ-measurable. Moreover ZH,RhH, so both variables are integrable. This also covers H=0, constant H=1, and the event {τ=}, where both variables vanish by definition.

F1F3
2.1

Fix AFτ. For every finite n, [F2] and [F1] give [F1, F2, F4, step 1.1] E[1A{τ=n}H(Xn,Xn+1,)]=E[1A{τ=n}h(Xn)]. Sum from n=0 to N. The partial sums on either side are bounded in absolute value by H and converge pointwise to 1AZH and 1ARh. By [F4], letting N gives E[1AZH]=E[1ARh]. Together with step 1.1 this is the defining event test for the displayed conditional expectation. Empty A, full A, τ=0, and an almost-surely infinite τ require no separate argument.

F1F2F4step 1.1
3.1

If P(τ<)=1, the exceptional infinity event is null, so [step 2.1] ZH=H(Xτ,Xτ+1,) and Rh=h(Xτ) almost surely for any arbitrary values assigned there. This proves the finite form. Choice is used only by [F1] and the conditional expectation in the conclusion.

step 2.1

Depends on

Used by

Dependency tree · two levels

28 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