Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 6.1 — cEΦ(τ1/2)≤EΦ(X∗(τ))≤CEΦ(τ1/2)cE\Phi(\tau^{1/2})\le E\Phi(X^*(\tau))\le CE\Phi(\tau^{1/2})cEΦ(τ1/2)≤EΦ(X∗(τ))≤CEΦ(τ1/2) for every stopping time τ of Brownian motion

Proved
BurkholderDFI.Brownian.theorem_6_1

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

brownian-motionburkholder-davis-gundyp2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1stopping-time

Let Φ:[0,∞]→[0,∞]\Phi:[0,\infty]\to[0,\infty]Φ:[0,∞]→[0,∞] be non-decreasing and continuous with Φ(0)=0\Phi(0)=0Φ(0)=0 and satisfying the growth condition

Φ(2λ)≤c(6.1) Φ(λ),λ>0.\Phi(2\lambda)\le c_{(6.1)}\,\Phi(\lambda),\qquad\lambda>0 .Φ(2λ)≤c(6.1)​Φ(λ),λ>0.

Let XXX be a one-dimensional Brownian motion with continuous sample functions on a probability space (Ω,A,P)(\Omega,\mathcal A,P)(Ω,A,P), B(t)=σ{X(s),0≤s≤t}\mathcal B(t)=\sigma\{X(s),0\le s\le t\}B(t)=σ{X(s),0≤s≤t}, and τ:Ω→[0,∞]\tau:\Omega\to[0,\infty]τ:Ω→[0,∞] a stopping time of XXX, i.e. {τ<t}∈B(t)\{\tau<t\}\in\mathcal B(t){τ<t}∈B(t) for t>0t>0t>0. Write X∗(τ)=sup⁡t≥0∣X(τ∧t)∣X^*(\tau)=\sup_{t\ge0}|X(\tau\wedge t)|X∗(τ)=supt≥0​∣X(τ∧t)∣. Then

c EΦ(τ1/2)≤EΦ(X∗(τ))≤C EΦ(τ1/2),(6.2)c\,E\Phi(\tau^{1/2})\le E\Phi(X^*(\tau))\le C\,E\Phi(\tau^{1/2}), \tag{6.2}cEΦ(τ1/2)≤EΦ(X∗(τ))≤CEΦ(τ1/2),(6.2)

where the positive constants ccc and CCC depend only on the growth constant c(6.1)c_{(6.1)}c(6.1)​.

For Φ(λ)=λp\Phi(\lambda)=\lambda^pΦ(λ)=λp, 0<p<∞0<p<\infty0<p<∞, this says that E X∗(τ)pE\,X^*(\tau)^pEX∗(τ)p and E τp/2E\,\tau^{p/2}Eτp/2 are comparable for all stopping times, the Brownian prototype of the Burkholder–Davis–Gundy inequalities: the stopping time plays the role of the square function.

Formalization Note The paper states: "the choice of ccc and CCC depends only on c(6.1)c_{(6.1)}c(6.1)​"; we state: for every c(6.1)≥0c_{(6.1)}\ge0c(6.1)​≥0 there exist c,C>0c,C>0c,C>0 such that for every probability space (in universe Type), every Brownian motion, every stopping time and every Φ\PhiΦ with growth constant c(6.1)c_{(6.1)}c(6.1)​ the two inequalities hold. τ\tauτ may be infinite; τ1/2\tau^{1/2}τ1/2, X∗(τ)X^*(\tau)X∗(τ) and both expectations take values in [0,∞][0,\infty][0,∞], so either side may be infinite. Stopping times are the paper's ({τ<t}\{\tau<t\}{τ<t}, raw natural filtration), Brownian motion has every path continuous and each X(t)X(t)X(t) measurable. Φ≢0\Phi\not\equiv0Φ≡0 is not assumed (the statement is trivial for Φ≡0\Phi\equiv0Φ≡0), and the growth condition is required for all λ∈[0,∞]\lambda\in[0,\infty]λ∈[0,∞], equivalent to the paper's by continuity.

Preamble
import Mathlib
import Definitions.Def_BurkholderDFI_SquareFnLp_Martingale
import Definitions.Def_BurkholderDFI_Brownian_Process
open MeasureTheory ProbabilityTheory
open scoped ENNReal NNReal
Formal statement
namespace BurkholderDFI.Brownian

/-- Theorem 6.1, (6.2), p. 25: `c EΦ(τ^{1/2}) ≤ EΦ(X*(τ)) ≤ C EΦ(τ^{1/2})` for every stopping
time `τ` of Brownian motion, with `c, C` depending only on the growth constant of (6.1). -/
theorem theorem_6_1 (c : ℝ≥0) :
    ∃ C₁ C₂ : ℝ≥0, 0 < C₁ ∧ 0 < C₂ ∧
      ∀ (Ω : Type) [MeasurableSpace Ω] (P : Measure Ω) [IsProbabilityMeasure P]
        (X : ℝ≥0 → Ω → ℝ), IsBM X P → ∀ τ : Ω → ℝ≥0∞, IsStoppingTimeOf X τ →
        ∀ Φ : ℝ≥0∞ → ℝ≥0∞, BurkholderDFI.SquareFnLp.IsPhi Φ c →
          (C₁ : ℝ≥0∞) * ∫⁻ ω, Φ (τ ω ^ (1 / 2 : ℝ)) ∂P ≤ ∫⁻ ω, Φ (maxStopped X (τ ω) ω) ∂P ∧
          ∫⁻ ω, Φ (maxStopped X (τ ω) ω) ∂P ≤ (C₂ : ℝ≥0∞) * ∫⁻ ω, Φ (τ ω ^ (1 / 2 : ℝ)) ∂P := by sorry

end BurkholderDFI.Brownian
Source
Burkholder, Distribution Function Inequalities for Martingales, Ann. Probability 1 (1973), Theorem 6.1, (6.2), p. 25
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 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