Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 8.1.2 — the whole random walk embedded in a Brownian motion

Open
DurrettProbability.skorokhod_embedding_walk

by naimengye · Sep 19, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisprobabilitystochastic-systems

Let μ\muμ be a probability measure on R\mathbb{R}R with mean zero and variance one: ∫x dμ=0\int x\,d\mu=0∫xdμ=0 and ∫x2 dμ=1\int x^2\,d\mu=1∫x2dμ=1, both integrals absolutely convergent.

Then there exist a probability space, a Brownian motion BBB on it, an increasing family FtF_tFt​ of σ\sigmaσ-fields containing the Brownian past σ(Bs:s≤t)\sigma(B_s:s\le t)σ(Bs​:s≤t), and times T0,T1,T2,…T_0,T_1,T_2,\dotsT0​,T1​,T2​,… such that

  1. each TnT_nTn​ is a stopping time for FFF, and T0=0T_0=0T0​=0 with Tn≤Tn+1T_n\le T_{n+1}Tn​≤Tn+1​ everywhere;
  2. the process n↦B(Tn)n\mapsto B(T_n)n↦B(Tn​) has the law of the partial-sum process of an i.i.d. sequence with step law μ\muμ — that is, the push-forward of ω↦(B(Tnω))n≥0\omega\mapsto(B(T_n\omega))_{n\ge0}ω↦(B(Tn​ω))n≥0​ on the sequence space RN\mathbb{R}^{\mathbb N}RN equals the push-forward of (xk)↦(∑k<nxk)n≥0(x_k)\mapsto\bigl(\sum_{k<n}x_k\bigr)_{n\ge0}(xk​)↦(∑k<n​xk​)n≥0​ under the infinite product measure μ⊗N\mu^{\otimes\mathbb N}μ⊗N;
  3. the gaps Tn+1−TnT_{n+1}-T_nTn+1​−Tn​ are independent, and each has the law of T1−T0T_1-T_0T1​−T0​.

Iterating Skorokhod's representation puts the entire walk inside one Brownian motion, read at a sequence of stopping times whose increments are i.i.d.

Formalization Note As in Theorem 8.1.1 the probability space is produced rather than assumed, for the same reason: the construction needs an i.i.d. sequence of auxiliary pairs independent of the Brownian motion.

The book's "Sn=dB(Tn)S_n=_d B(T_n)Sn​=d​B(Tn​)" is read as equality of the laws of the whole processes on sequence space, not as equality of one-dimensional marginals for each nnn; the latter would be strictly weaker and would not support the proof of Donsker's theorem, where the whole embedded path is compared with the Brownian one. Indexing starts at n=0n=0n=0 with the empty sum, matching T0=0T_0=0T0​=0.

The gaps are taken as real numbers, differences of the coercions of Tn+1T_{n+1}Tn+1​ and TnT_nTn​; since TTT is monotone these are non-negative. Independence is joint independence of the whole family, not merely pairwise.

The hypotheses are satisfiable — any centred law of variance one, for instance the standard Gaussian or the symmetric two-point law — so the statement is not vacuous.

Preamble
import Mathlib
import Definitions.Def_DurrettProbability_Brownian
import Definitions.Def_DurrettProbability_Donsker

open Filter MeasureTheory ProbabilityTheory
open scoped NNReal Topology
Formal statement
namespace DurrettProbability

theorem skorokhod_embedding_walk (μ : Measure ℝ) [IsProbabilityMeasure μ]
    (hint : Integrable id μ) (hmean : ∫ x, x ∂μ = 0)
    (hsq : Integrable (fun x : ℝ => x ^ 2) μ) (hvar : ∫ x : ℝ, x ^ 2 ∂μ = 1) :
    ∃ (Ω : Type) (mΩ : MeasurableSpace Ω) (P : @Measure Ω mΩ) (_ : IsProbabilityMeasure P)
      (B : ℝ≥0 → Ω → ℝ) (F : ℝ≥0 → MeasurableSpace Ω) (T : ℕ → Ω → ℝ≥0),
      IsBrownianReal B P ∧
      (∀ s t : ℝ≥0, s ≤ t → F s ≤ F t) ∧ (∀ t, F t ≤ mΩ) ∧ (∀ t, pastSigma B t ≤ F t) ∧
      (∀ n, ∀ t : ℝ≥0, MeasurableSet[F t] {ω | T n ω ≤ t}) ∧
      T 0 = 0 ∧ (∀ n ω, T n ω ≤ T (n + 1) ω) ∧
      Measure.map (fun ω (n : ℕ) => B (T n ω) ω) P
        = Measure.map (fun (x : ℕ → ℝ) (n : ℕ) => ∑ k ∈ Finset.range n, x k)
            (Measure.infinitePi fun _ : ℕ => μ) ∧
      iIndepFun (fun n ω => (T (n + 1) ω : ℝ) - (T n ω : ℝ)) P ∧
      (∀ n, IdentDistrib (fun ω => (T (n + 1) ω : ℝ) - (T n ω : ℝ))
        (fun ω => (T 1 ω : ℝ) - (T 0 ω : ℝ)) P P) := by sorry

end DurrettProbability
Source
Durrett, Probability: Theory and Examples, Version 5 (11 January 2019), p. 391 (PDF p. 399), Theorem 8.1.2: 'Let X_1, X_2, ... be i.i.d. with a distribution F, which has mean 0 and variance 1, and let S_n = X_1 + ... + X_n. There is a sequence of stopping times T_0 = 0, T_1, T_2, ... such that S_n =d B(T_n) and T_n - T_{n-1} are independent and identically distributed.' Proof: 'Let (U_1, V_1), (U_2, V_2), ... be i.i.d. and have distribution given in (8.1.1) and let B_t be an independent Brownian motion. Let T_0 = 0, and for n >= 1, let T_n = inf{t >= T_{n-1} : B_t - B(T_{n-1}) not in (U_n, V_n)}.' sha256 aeac36cbf5e44c53d69fa60a2d29a393e2d0e8c955ee103bd845d925fd910886
Human review
  • Endorsed by Shuze Chen · Sep 25, 2026

    Confirmed by the moderator at approval.

  • Endorsed by naimengye · Sep 25, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me