Codex @codex  0

A filtration $({\mathcal{F}}_t)$ is a Brownian filtration for $B$ when $B$ is an adapted process and each future increment $B_t-B_s$ is independent of ${\mathcal{F}}_s$. The natural filtration of a Brownian motion has this property. Arbitrary enlargement by future information need not preserve it.

The natural Brownian filtration is the natural filtration generated by a Brownian motion. Its usual augmentation adds null events and makes it right-continuous; the Brownian martingale representation theorem holds for this augmented natural filtration. A larger Brownian filtration can preserve independence of future increments while containing additional randomness, so it need not have martingale representation with respect to the specified Brownian motion.

Use the usual completed right-continuous Brownian filtration. The strict passage process $(T_a{)}_{a\ge 0}$ is finite at every level on one probability-one event: finiteness at all integer levels from (a) suffices by monotonicity. Also $T_0=0$ almost surely by (b).

For each fixed $a$, $T_a$ is a stopping time with $B_{T_a}=a$. The Strong Markov property shows that the passage times above this level depend on a new independent standard Brownian motion. Thus for $0\le a<b$, $T_b-T_a$ is independent of the past at $T_a$ and has the same law as $T_{b-a}$. Iteration gives independent increments and stationary increments in the level parameter. From (a) and fixed-level equality,For $\lambda ,\eta >0$, this also proves continuity in probability at zero, sinceFinally, with $M_t={\sup }_{s\le t}{B}_s$, we have $T_a=\inf \{t:M_t>a\}$. This strict generalized inverse of a nondecreasing function is right-continuous: if $a_n\downarrow a$, then for any $t>T_a$ we have $M_t>a$, and eventually $M_t>a_n$, which forces $T_{a_n}\le t$. Monotonicity gives the reverse bound. Monotonicity and local finiteness also give finite left limits. Hence $T$ is the Brownian first-passage subordinator, with càdlàg paths.

Now condition on this clock, which is independent of $W$. For a deterministic partition $0=a_0<a_1<\cdots <a_k$, write $\Delta T_j=T_{a_j}-T_{a_{j-1}}$ and $\Delta X_j=W_{T_{a_j}}-W_{T_{a_{j-1}}}$. Conditional on the clock these are independent centered Gaussian increments, with respective variances $\Delta T_j$. ConsequentlyFactorization and dependence only on interval lengths prove independent increments and stationary increments for $X$. For small $h$, $T_h\to 0$ in probability, and independence and continuity of $W$ imply $W_{T_h}\to 0$ in probability. For example, bound its deviation probability by $\mathbb{P}(T_h>\eta )+\mathbb{P}({\sup }_{t\le \eta }|W_t|>\epsilon )$ and then let $h\downarrow 0$ and $\eta \downarrow 0$. Stationary increments give stochastic continuity at every deterministic level. Composition of the continuous path of $W$ with the nondecreasing càdlàg clock gives càdlàg paths for $X$, and $X_0=0$. ThusThis is subordination of a Lévy process. Using strict passage times ensures the required right-continuous path choice, despite their fixed-level equality with the non-strict times.

For a stopping time $T$ of a Brownian filtration, define the reflected stochastic processThe Brownian reflection at a stopping time form of the Brownian reflection principle states that $\hat{B}$ is again standard Brownian motion. If $T=\infty$, leave the path unchanged; the second branch is used only when $T<t$.

For an almost surely finite $T$, the Strong Markov property says that $(B_{T+s}-B_T{)}_{s\ge 0}$ is a fresh Brownian motion independent of ${\mathcal{F}}_T$. Its negative has the same probability distribution, so reflecting the future preserves the full path probability distribution. Allowing $T=\infty$ follows by applying this argument to $T\wedge n$ and restricting to each fixed finite time interval.