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.

Markov property for bounded future path functionals

Statement

Assume Choice. Let X be a K-chain and let H:EN0R be bounded and product-measurable. Then h(x):=Ex[H(X0,X1,)] is E-measurable and, for every n0, E[H(Xn,Xn+1,)Fn]=h(Xn)a.s.

Facts & Assumptions

Given: Choice, a K-chain, a fixed time n, and a bounded measurable path functional H.

[F1]

The one-step Markov identity holds for every bounded measurable state function. (Bounded-function form of the Markov property)

[F2]

Integration of a product-measurable function against a probability kernel is measurable in the source. (Measurability of integration against a kernel)

[F3]

A lambda-system containing a generating pi-system contains the generated sigma-algebra. (Dynkin's pi-lambda theorem)

[F4]

Nonnegative measurable functions have increasing simple approximations, and dominated convergence applies under a common integrable bound. (Every nonnegative measurable function is the increasing limit of simple measurable functions, Dominated convergence)

[F5]

For every initial law, in particular every Dirac law, there is a unique canonical path-space Markov-chain law. (Canonical Markov chain on path space)

Proof

1.1

Let C=A0××Ar×E×E× be a [F1, F2, F5] rectangular path cylinder. Backward kernel integration gives the measurable function hC(x)=1A0(x)K(1A1K(K1Ar))(x). By [F5], it equals Px(C) under the canonical chain started from x. Starting at time n+r1 and applying [F1] backward r times, with 1A0(Xn) and the already exposed factors left outside, gives E[1C(Xn,Xn+1,)Fn]=hC(Xn). The formula also covers r=0, an empty Aj, and all Aj=E.

F1F2F5
2.1

Let D be the path events D for which [F3, F4, step 1.1] hD(x)=Px(D) is measurable and the conditional identity in step 1.1 holds with D. The whole path space belongs to D, with h=1. Complements remain in D because hDc=1hD. For pairwise disjoint DjD, countable additivity gives hDj=jhDj; measurable partial sums increase to this function, and dominated convergence in the defining event integrals gives the conditional identity for the union. Hence D is a lambda-system. Rectangular cylinders form a pi-system and belong by step 1.1, so [F3] yields every product-measurable path event.

F3F4step 1.1
3.1

Finite real linear combinations of event indicators now satisfy both [F4, step 2.1] measurability and the identity. If 0HM, choose simple HjH by [F4]. Then hj(x)=ExHjExH=h(x) by dominated convergence, making h measurable. The same theorem passes the limit through all event tests for conditional expectation and proves the displayed identity. Apply this to the positive and negative parts of a general bounded real H and subtract. Zero, one, constant, and degenerate one-point path functionals are included. Choice enters through the canonical laws Px and conditional-expectation versions used by [F1].

F4step 2.1

Depends on

Used by

Dependency tree · two levels

37 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