Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Brownian upper passage: common integrable bound for capped stopped exponentials

Proved
Kyprianou.Ch01.brownianUpperStoppedExponentialUniformBoundPublic

by WillR · Nov 18, 2026 · Mathlib 0df444a (Lean v4.33.1)

brownian-motionfirst-passagekyprianou-ch01stopped-martingale

For a.e. continuous Brownian path started at zero, the capped stopped first upper passage value is at or below the barrier. Since the adjustment root is nonnegative and the discount is positive, every stopped exponential has absolute value bounded by exp(theta*x), uniformly in the horizon N. This supplies the integrable constant required for dominated convergence.

Preamble
import Mathlib.MeasureTheory.Integral.Bochner.Basic
import Mathlib.Analysis.SpecialFunctions.ExpDeriv
import Definitions.Def_Kyprianou_Ch01_McKeanBrownianStopping
import Definitions.Def_Kyprianou_Ch01_ExplicitLevyExamples
open MeasureTheory ProbabilityTheory Kyprianou.Ch01 Filter
open scoped NNReal ENNReal
set_option autoImplicit false
Formal statement
theorem Kyprianou.Ch01.brownianUpperStoppedExponentialUniformBoundPublic
    {Ω : Type*} [MeasurableSpace Ω]
    (P : Measure Ω) [IsProbabilityMeasure P]
    (X : ℝ≥0 → Ω → ℝ)
    (sigma gamma q x : ℝ)
    (hsigma : 0 < sigma) (hq : 0 < q) (hx : 0 < x)
    (hX : IsLinearBrownian P X sigma gamma)
    (hMeas : ∀ t : ℝ≥0, Measurable (X t)) :
    let theta : ℝ :=
      (Real.sqrt (gamma ^ 2 + 2 * sigma ^ 2 * q) - gamma) / sigma ^ 2
    let F : ℕ → Ω → ℝ := fun N ω =>
      let T : ℝ≥0 := N
      let tauT : ℝ≥0 :=
        match firstUpperPassage X x ω with
        | none => T
        | some t => min t T
      Real.exp (theta * X tauT ω - q * (tauT : ℝ))
    ∀ᵐ ω ∂P, ∀ N : ℕ,
      ‖F N ω‖ ≤ Real.exp (theta * x) := by sorry
Source
Kyprianou (2006), Exercise 1.10(ii) worked solution, printed page 306.

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