Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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 B be a standard Brownian motion Brownian motion with raw natural filtration (Ft0) and usual augmentation (Ft) Natural and usual augmented Brownian filtrations, and let μ be Wiener measure on C([0,),R) Wiener measure on continuous path space.

Write uu(t) for a point of the product space R[0,), 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 j:C([0,),R)R[0,) is measurable because its coordinates are continuous. For a bounded Borel functional Φ:R[0,)R put ΨΦ(x):=C([0,),R)Φ(x+w)μ(dw),xR, where x+w denotes the point tx+w(t).

  1. Increment process. For every s0 the random element Z:=(Bs+tBs)t0 is independent of Fs and has the law of B; that is, for every finite cylinder event Γ={z:z(t1)B1,,z(tk)Bk} and every AFs, P(A{ZΓ})=P(A)μcyl(Γ), where μcyl(Γ)=μ({w:w(ti)Bi i}), and the analogous identity holds for every Borel set of the product sigma-algebra.
  2. Conditional future law. For every s0 and every bounded Borel functional Φ on R[0,), E[Φ((Bs+t)t0)Fs]=ΨΦ(Bs)almost surely, and the same identity holds with Fs0 in place of Fs. In particular E[Φ((Bs+t)t0)Fs] is a function of the single state Bs.

The continuous-path formulation uses a common measurable probability-one event A on which all paths of B are continuous. Define Vs(ω)(t)=Bs+t(ω) on A and let Vs(ω) be the zero path off A. For every bounded Borel ϕ:C([0,),R)R, the same conditional identity holds with ϕ(Vs) on the left and ϕ(Bs+w)μ(dw) on the right, for either past sigma-algebra. This convention is independent almost surely of the choice of A.

Facts & Assumptions

Given: AC, a standard Brownian motion B, s0 and a bounded Borel functional Φ on R[0,).

[F1]

Brownian increments along finite strictly increasing lists are independent with laws N(0,Δt), and B0=0 almost surely. Brownian motion

[F3]

Conditioning a known state on independent noise: E[h(X,Y)G]=H(X) for H(x)=h(x,y)μY(dy). Conditioning a known state and independent noise

[F4]

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

[F5]

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

[F6]

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

[F7]

Simple approximation, monotone convergence and dominated convergence on the probability spaces used below; measurability of xΦ(x+w)μ(dw) 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

[F8]

Every set of the completed raw sigma-algebra Fu0 differs from a set of Fu0 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

technique · direct
1.1

Fix distinct times 0t1<<tk and a bounded Borel G:RkR, and let Φ be the cylinder functional Φ(u)=G(u(t1),,u(tk)). Then Y:=(Bs+tiBs)ik is a random element of Rk independent of Fs0 with the law ν of (Wti)ik under Wiener measure: independence follows as in the finite-cylinder argument by deleting repetitions, expressing (Bs,Bs+t1,,Bs+tk) through the independent increments of [F1] and applying [F2]; for any finite past times rjs, include the rj, s and the s+ti in a common ordered grid. The increments before and after s are independent, while B0=0 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 Fs0. The law identity holds because both Y and (Wti) are obtained from independent N(0,titi1) increments (with t0=0) by the same cumulative-sum map, the Wiener marginal being [F4].

F1F2F4
2.1

With Φ and Y as in step 1.1 apply [F3] to X=Bs, the sigma-algebra Fs0, the noise Y, and h(x,y):=G(x+y1,,x+yk): H(x)=G(x+y1,,x+yk)ν(dy) is Borel and E[Φ((Bs+t)t0)Fs0]=H(Bs) almost surely. By step 1.1's law identity, H(x)=Φ(x+w)μ(dw)=ΨΦ(x) for every x, because Φ(x+w)=G(x+w(t1),,x+w(tk)) and the marginal of (w(ti)) under μ is ν.

F3F4step 1.1
3.1

Let D be the class of product-measurable sets ΓR[0,) such that E[1Γ((Bs+t)t0)Fs0]=μΓ(Bs) almost surely, where μΓ(x):=μ(x+WΓ). Each μΓ is Borel by [F7] applied to the constant kernel μ, since (x,w)x+w is product measurable. Finite cylinder sets lie in D by step 2.1, and D is a lambda-system: it contains the whole space because μR[0,)1; it is closed under complements because μΓc=1μΓ 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.

F3F5F7step 2.1
4.1

The finite cylinder sets are a pi-system containing the whole space and generate the product sigma-algebra, so [F6] gives D= all product-measurable sets: for every product-measurable Γ, E[1Γ((Bs+t)t0)Fs0]=μΓ(Bs) almost surely.

F6step 3.1
5.1

For bounded nonnegative Φ, choose simple functionals snΦ and use step 4.1 together with linearity of the integral to get Asn((Bs+t))dP=AΨsn(Bs)dP for every AFs0; monotone convergence [F7] applied to both sides gives AΦ((Bs+t))dP=AΨΦ(Bs)dP. Since ΨΦ(Bs) is bounded and Fs0-measurable, [F5] gives E[Φ((Bs+t))Fs0]=ΨΦ(Bs) 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.

F5F7step 4.1
6.1

We next prove the identity for the usual augmentation, first for a bounded continuous cylinder Φ(u)=G(u(t1),,u(tk)). Set un=s+1/n. For AFsFun0, the raw identity of step 5.1 at time un extends from Fun0 to its completion by [F8], and gives AΦ((Bun+t)t0)dP=AΨΦ(Bun)dP. Brownian continuity makes the left integrand converge almost surely to Φ((Bs+t)t0). Also BunBs almost surely and ΨΦ is continuous, because bounded convergence under Wiener measure applies to Φ(xn+w)Φ(x+w) for a continuous cylinder. Dominated convergence therefore yields AΦ((Bs+t))dP=AΨΦ(Bs)dP.

F1F4F5F7F8step 5.1
7.1

Approximate each half-line coordinate-cylinder indicator by decreasing bounded continuous cylinder functions using gm,c(x)=max(0,1mmax(xc,0)) 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 AFs 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 ΨΦ(Bs) is bounded and Fs-measurable by [F7], [F5] identifies it as E[Φ((Bs+t))Fs]. This completes assertion 2 without reversing the tower property.

F5F6F7step 6.1
8.1

For assertion 1, fix a finite cylinder Γ={z:z(t1)B1,,z(tk)Bk} and let ΦΓ(u):=1Γ((u(t)u(0))t0), a bounded Borel functional. For every x, ΦΓ(x+w)=1Γ((w(t)w(0))t0) is independent of x, so ΨΦΓ(x)=μcyl(Γ) is the constant qΓ; step 7.1 therefore gives P(A{ZΓ})=qΓP(A) for every AFs, and qΓ=P(ZΓ). Hence σ(Z) is independent of Fs: the class of product-measurable Γ satisfying P(A{ZΓ})=P(A)P(ZΓ) for all AFs 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 Z is the pushforward jμ on the product sigma-algebra; this is the assertion that the increment process is a Brownian motion independent of the past.

F6step 7.1
8.2

For the continuous-path formulation, every coordinate of Vs is ambient-measurable and every value is in continuous path space, so [F4] makes Vs a Borel random element. For a continuous-path cylinder functional its evaluation at Vs agrees almost surely with the corresponding product cylinder evaluated on the original future, simultaneously in every time on A. Thus steps 2.1 and 6.1 give its raw and augmented event-integral identities. The translation map (x,w)x+w 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 Bs. Two choices of A give identical paths on their probability-one intersection, proving the asserted independence of the convention.

F3F4F5F6F7step 2.1step 3.1step 5.1step 6.1step 7.1
9.1

The degenerate and endpoint cases are covered and consistent: if k=0 or Φ is constant, both sides equal that constant; if t1=0 then Φ(u)=G(u(0),u(t2),) and the coordinate Bs+0Bs=0, so Y has a degenerate first coordinate and ν charges it correspondingly, while μ's marginal at time 0 is the point mass at w(0) — the identity of step 1.1 remains valid because both laws are the same law of a vector with a deterministic coordinate; for s=0 one has B0=0 almost surely, ΨΦ(B0)=ΨΦ(0), and the past sigma-algebras F00=σ(B0) and F0=u>0Fu0 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.

F8givenstep 1.1step 7.1

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

Used by

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