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 be a -chain and let be bounded and product-measurable. Then is -measurable and, for every ,
Facts & Assumptions
Given: Choice, a -chain, a fixed time , and a bounded measurable path functional .
The one-step Markov identity holds for every bounded measurable state function. (Bounded-function form of the Markov property)
Integration of a product-measurable function against a probability kernel is measurable in the source. (Measurability of integration against a kernel)
A lambda-system containing a generating pi-system contains the generated sigma-algebra. (Dynkin's pi-lambda theorem)
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)
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
Let be a [F1, F2, F5] rectangular path cylinder. Backward kernel integration gives the measurable function By [F5], it equals under the canonical chain started from . Starting at time and applying [F1] backward times, with and the already exposed factors left outside, gives The formula also covers , an empty , and all .
Let be the path events for which [F3, F4, step 1.1] is measurable and the conditional identity in step 1.1 holds with . The whole path space belongs to , with . Complements remain in because . For pairwise disjoint , countable additivity gives ; measurable partial sums increase to this function, and dominated convergence in the defining event integrals gives the conditional identity for the union. Hence is a lambda-system. Rectangular cylinders form a pi-system and belong by step 1.1, so [F3] yields every product-measurable path event.
Finite real linear combinations of event indicators now satisfy both [F4, step 2.1] measurability and the identity. If , choose simple by [F4]. Then by dominated convergence, making 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 and subtract. Zero, one, constant, and degenerate one-point path functionals are included. Choice enters through the canonical laws and conditional-expectation versions used by [F1].
Depends on
- The Axiom of Choice
- Shift operator and future-coordinate sigma-algebra
- Canonical Markov chain on path space
- Bounded-function form of the Markov property
- The monotone class generated by an algebra equals the sigma-algebra it generates
- Dynkin's pi-lambda theorem
- Measurability of integration against a kernel
- Every nonnegative measurable function is the increasing limit of simple measurable functions
- Dominated convergence
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
- Durrett, Probability: Theory and Examples, Section 5.2 (standard reference, not scraped)