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.
Future-path Markov property
Statement
Assume the Axiom of Choice, let be a standard Brownian motion Brownian motion with raw natural filtration and usual augmentation Natural and usual augmented Brownian filtrations, and let be Wiener measure on Wiener measure on continuous path space.
Write for a point of the product space , whose product sigma-algebra is by definition generated by all finite coordinate cylinders (it exists by Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal). Here Borel on the product means measurable for that sigma-algebra. The inclusion is measurable because its coordinates are continuous. For a bounded Borel functional put where denotes the point .
- Increment process. For every the random element is independent of and has the law of ; that is, for every finite cylinder event and every , , where , and the analogous identity holds for every Borel set of the product sigma-algebra.
- Conditional future law. For every and every bounded Borel functional on , and the same identity holds with in place of . In particular is a function of the single state .
The continuous-path formulation uses a common measurable probability-one event on which all paths of are continuous. Define on and let be the zero path off . For every bounded Borel , the same conditional identity holds with on the left and on the right, for either past sigma-algebra. This convention is independent almost surely of the choice of .
Facts & Assumptions
Given: AC, a standard Brownian motion , and a bounded Borel functional on .
Brownian increments along finite strictly increasing lists are independent with laws , and almost surely. Brownian motion
Grouping finite independent families and the pi-system criterion for independent sigma-algebras. Disjoint groups of an independent sigma-algebra family remain independent Independent pi-systems generate independent sigma-algebras Independent sigma-algebras and independent events Independent random elements
Conditioning a known state on independent noise: for . Conditioning a known state and independent noise
Wiener measure is the law of a continuous Brownian motion, so its finite-dimensional marginals are the Brownian increment laws of [F1], and its Borel sigma-algebra is generated by the coordinates on a countable dense set. Wiener measure on continuous path space Borel sigma-algebra of continuous path space is generated by coordinates
Conditional-expectation versions are characterized by event integrals and are unique almost surely; the tower identity holds for nested sigma-algebras. Conditional expectation as an ae class Conditional expectation is unique almost surely Tower property of conditional expectation
A lambda-system containing a pi-system contains the generated sigma-algebra. By the convention in the statement, finite coordinate cylinders generate the product sigma-algebra; coordinate cylinders generate the Borel sigma-algebra of continuous path space. Dynkin's pi-lambda theorem Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal Borel sigma-algebra of continuous path space is generated by coordinates
Simple approximation, monotone convergence and dominated convergence on the probability spaces used below; measurability of by the constant-kernel integration theorem. Every nonnegative measurable function is the increasing limit of simple measurable functions Monotone convergence for the integral Dominated convergence Measurability of integration against a kernel Measure kernel and probability kernel
Every set of the completed raw sigma-algebra differs from a set of by a null set, and bounded integrals over the two sets agree; AC supplies the conditional-expectation interface. Natural and usual augmented Brownian filtrations The Axiom of Choice
Proof
Fix distinct times and a bounded Borel , and let be the cylinder functional . Then is a random element of independent of with the law of under Wiener measure: independence follows as in the finite-cylinder argument by deleting repetitions, expressing through the independent increments of [F1] and applying [F2]; for any finite past times , include the , and the in a common ordered grid. The increments before and after are independent, while almost surely causes no change in event probabilities. This proves independence from every finite past cylinder, and [F2] extends it to their generated sigma-algebra . The law identity holds because both and are obtained from independent increments (with ) by the same cumulative-sum map, the Wiener marginal being [F4].
With and as in step 1.1 apply [F3] to , the sigma-algebra , the noise , and : is Borel and almost surely. By step 1.1's law identity, for every , because and the marginal of under is .
Let be the class of product-measurable sets such that almost surely, where . Each is Borel by [F7] applied to the constant kernel , since is product measurable. Finite cylinder sets lie in by step 2.1, and is a lambda-system: it contains the whole space because ; it is closed under complements because and conditional expectations are additive on bounded inputs; and for disjoint sets in the class, countable additivity of the kernel and monotone convergence of the nonnegative finite sums give the event-integral identity for their union. Thus it is closed under disjoint countable unions, as required for a lambda-system.
The finite cylinder sets are a pi-system containing the whole space and generate the product sigma-algebra, so [F6] gives all product-measurable sets: for every product-measurable , almost surely.
For bounded nonnegative , choose simple functionals and use step 4.1 together with linearity of the integral to get for every ; monotone convergence [F7] applied to both sides gives . Since is bounded and -measurable, [F5] gives almost surely, and splitting a bounded real into positive and negative parts extends this to all bounded Borel . This is the raw-filtration half of assertion 2.
We next prove the identity for the usual augmentation, first for a bounded continuous cylinder . Set . For , the raw identity of step 5.1 at time extends from to its completion by [F8], and gives . Brownian continuity makes the left integrand converge almost surely to . Also almost surely and is continuous, because bounded convergence under Wiener measure applies to for a continuous cylinder. Dominated convergence therefore yields .
Approximate each half-line coordinate-cylinder indicator by decreasing bounded continuous cylinder functions using and finite products of these functions; dominated convergence in step 6.1 gives the same event-integral identity for all half-line cylinders. The class of product-measurable sets for which that identity holds for every is a lambda-system by the same event-integral and disjoint-union calculation as step 3.1; half-line cylinders form a generating pi-system, so it is the whole product sigma-algebra by [F6]. Increasing simple approximation and monotone convergence then extend the identity to every bounded nonnegative Borel , and positive-minus-negative decomposition to every bounded real . Since is bounded and -measurable by [F7], [F5] identifies it as . This completes assertion 2 without reversing the tower property.
For assertion 1, fix a finite cylinder and let , a bounded Borel functional. For every , is independent of , so is the constant ; step 7.1 therefore gives for every , and . Hence is independent of : the class of product-measurable satisfying for all is a lambda-system containing the cylinder pi-system, so equals the product sigma-algebra by [F6]. Its finite-dimensional marginals are those of by step 1.1's law identity, so the law of is the pushforward on the product sigma-algebra; this is the assertion that the increment process is a Brownian motion independent of the past.
For the continuous-path formulation, every coordinate of is ambient-measurable and every value is in continuous path space, so [F4] makes a Borel random element. For a continuous-path cylinder functional its evaluation at agrees almost surely with the corresponding product cylinder evaluated on the original future, simultaneously in every time on . Thus steps 2.1 and 6.1 give its raw and augmented event-integral identities. The translation map into continuous path space is measurable because all its coordinates are measurable and [F4] gives the target sigma-algebra. Use the half-line approximation of step 7.1 for the augmented identity, then apply the lambda-system calculation of step 3.1 to cylinder sets in continuous path space, then [F6] and the simple approximation of step 5.1, to obtain both identities for every bounded Borel . This argument asserts no adaptedness of the normalized coordinates: the right side is measurable with respect to the past because it is a Borel function of the original . Two choices of give identical paths on their probability-one intersection, proving the asserted independence of the convention.
The degenerate and endpoint cases are covered and consistent: if or is constant, both sides equal that constant; if then and the coordinate , so has a degenerate first coordinate and charges it correspondingly, while 's marginal at time is the point mass at — the identity of step 1.1 remains valid because both laws are the same law of a vector with a deterministic coordinate; for one has almost surely, , and the past sigma-algebras and are handled by steps 5.1 and 7.1 unchanged. AC is inherited from the Brownian and Wiener interfaces and from [F8], including ambient completion and the conditional-expectation interface. The time sequence is explicit and no pathwise selection is made.
Source notes
Durrett, Section 7.2, and Sousi's argument preceding Theorem 6.13, state the future-path Markov property for the completed filtration. The proof above separates the finite-cylinder identity, the Dynkin extension over future-path events, and the passage from the raw past to the usual augmentation, so that Blumenthal's law and the strong Markov theorem can cite exactly the half they need.
Depends on
- Natural and usual augmented Brownian filtrations
- Brownian motion
- Wiener measure on continuous path space
- Borel sigma-algebra of continuous path space is generated by coordinates
- Conditioning a known state and independent noise
- Disjoint groups of an independent sigma-algebra family remain independent
- Independent pi-systems generate independent sigma-algebras
- Independent sigma-algebras and independent events
- Independent random elements
- Conditional expectation as an ae class
- Conditional expectation is unique almost surely
- Tower property of conditional expectation
- Dynkin's pi-lambda theorem
- Every nonnegative measurable function is the increasing limit of simple measurable functions
- Monotone convergence for the integral
- Measurability of integration against a kernel
- Measure kernel and probability kernel
- The Axiom of Choice
- Dominated convergence
- Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal
Used by
- One-dimensional Brownian motion is recurrent Corollary
- Strong Markov fails at a nonstopping random time Counterexample
- Elementary predictable Brownian integrands Definition
- Brownian step-potential resolvent at zero Lemma
- Raw versus usual filtrations in the strong Markov theorem Remark
- Blumenthal's zero-one law Theorem
- Strong Markov property of Brownian motion Theorem
- The last Brownian zero has the arcsine law Theorem
Dependency tree · two levels
87 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
- Rick Durrett, Probability: Theory and Examples, fifth edition, Section 7.2 (standard reference, not scraped)
- Perla Sousi, Advanced Probability, Definition 6.10 and the argument preceding Theorem 6.13 (standard reference, not scraped)