Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Markov property of Brownian motion

Statement

Assume the Axiom of Choice, let B be a standard Brownian motion with raw natural filtration (Ft0) and usual augmentation (Ft) Natural and usual augmented Brownian filtrations, and let pt, Pt be the Brownian transition kernel and operators The Brownian transition semigroup.

For all deterministic s,t0 and every bounded Borel f:RR, E[f(Bs+t)Fs0]=Ptf(Bs)andE[f(Bs+t)Fs]=Ptf(Bs) almost surely. Thus the Markov property holds both for the raw past and for the usual augmented past.

Facts & Assumptions

Given: AC, a standard Brownian motion B, deterministic s,t0, and a bounded Borel f.

[F1]

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

[F2]

Grouping a finite independent family of sigma-algebras by disjoint index sets gives independent generated sigma-algebras, and independent pi-systems containing the whole space generate 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

[F3]

For a G-measurable random element X and a random element Y independent of G with law μ, the conditional expectation of h(X,Y) is H(X) with H(x)=h(x,y)μ(dy), for bounded product-measurable h. Conditioning a known state and independent noise Independent random elements

[F4]

Ptf(x)=E[f(x+Bt)] for bounded Borel f and t>=0. For t>0 this equals Rf(v)pt(x,v)dv; at t=0, P0f=f and there is no density p_0. The Brownian kernels form a semigroup The Brownian transition semigroup

[F5]

Conditional-expectation versions are characterized by their event integrals and are unique almost surely. Bounded pointwise-convergent random variables may be passed through event integrals by dominated convergence. Conditional expectation as an ae class Conditional expectation is unique almost surely Dominated convergence

[F6]

Every set in the completed raw sigma-algebra Fu0 differs from a set of Fu0 by a subset of a P-null event, and the two integrals of a bounded measurable function over such sets agree. Natural and usual augmented Brownian filtrations

[F7]

AC supplies the conditional-expectation interface of [F5]. The Axiom of Choice

Proof

technique · direct
1.1

First suppose t>0 and put Y=B_{s+t}-B_s. For any finite set of past times in [0,s], form their increasing union with {0,s,s+t}, delete repetitions, and apply [F1]. The past values differ almost surely from the cumulative sums of the increments up to s only by B_0=0; the final increment Y is independent of all those earlier increments by [F2]. For any Borel past cylinder its indicator agrees almost surely with the corresponding cylinder in those cumulative sums, so its joint probability with {Y in C} factors for every Borel C. This includes cylinders involving time zero and the case s=0, where all past cylinders have probability zero or one. Finite past cylinders generate the entire raw past; the pi-system criterion [F2] therefore makes sigma(Y) independent of that past. Finally Y has law N(0,t), also the law of B_t since B_0=0 almost surely.

F1F2given
2.1

Apply [F3] with X=Bs, which is Fs0-measurable, with Y as in step 1.1, and with h(x,y):=f(x+y): the function H(x)=Rf(x+y)μ(dy) with μ=N(0,t) is Borel, and E[f(Bs+t)Fs0]=H(Bs) almost surely. Since μ is also the law of Bt, step 1.1 and [F4] identify H(x)=E[f(x+Bt)]=Ptf(x) for every x. This proves the raw-filtration assertion.

F3F4step 1.1
3.1

Suppose t>0 and put un=s+t/(n+2) for integers n>=0, so uns with s<un<s+t. Put hn=s+tun>0. Applying step 2.1 at the time pair (un,hn) and then completing the conditioning sigma-algebra as in [F6] gives E[f(Bs+t)Fun0]=Phnf(Bun) almost surely. Indeed, bounded event integrals are unchanged when an event is replaced by a raw event differing by a null set.

F5F6step 2.1
4.1

On the probability-one continuity event, BunBs and hnt. The Gaussian densities vphn(Bun,v) converge pointwise to pt(Bs,v) and, for all large n, are bounded by an integrable envelope: choose a finite M bounding all the centers including B_s. Since hn[t/2,t], each density is at most (πt)1/2exp(((vM)+)2/(2t)), which is integrable (bounded on [-M,M], with Gaussian tails). This bound may depend on the fixed path; that is sufficient for this pathwise integral limit. Dominated convergence therefore gives their L1 convergence, and hence Phnf(Bun)Ptf(Bs) for bounded f. If AFs=u>sFu0, then AFun0 for every n, so step 3.1 gives Af(Bs+t)dP=APhnf(Bun)dP. A second bounded dominated-convergence passage yields Af(Bs+t)dP=APtf(Bs)dP. Since Ptf(Bs) is Fs-measurable, [F5] proves the usual-filtration assertion.

F4F5F6step 3.1
5.1

For t=0 the transition convention gives P0f=f and both identities read E[f(Bs)G]=f(Bs), true because Bs is G-measurable for G{Fs0,Fs}. The proof also covers s=0 when t>0, and then Ptf(B0)=Ptf(0) almost surely. If f0 both sides vanish. AC is inherited from the Brownian and normal-law interfaces, the null-envelope witnesses in [F6], and in particular [F7] for conditional expectation; the independence and transition computations make no further choice.

F4F7givenstep 4.1

Source notes

Durrett, Theorem 7.2.1, proves the raw statement by conditioning on the known state and the independent increment; Sousi uses the same argument for the right-continuous filtration. The proof here separates the two filtrations explicitly and obtains the usual augmentation by conditioning at later raw times and passing those times down to the target time.

Depends on

Used by

Dependency tree · two levels

61 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