Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Doob maximal bound at every finite grid for nonnegative unit-mean martingales

Proved
AvramDividend.Classical.nat_positive_martingale_finite_grid_maximal_unit_bound

by WillR · Oct 26, 2026 · Mathlib 0df444a (Lean v4.33.1)

martingalemaximal-inequalityprobabilitywiener-hopf

For any nonnegative real discrete-time martingale of constant unit expectation under a finite measure, the measure of sample paths where its maximum over times zero through n exceeds threshold a, multiplied by a, is at most one. This is the exact finite-grid Doob maximal inequality, intended for the compensated negative Esscher density-ratio martingale and the downward-passage threshold exp(εx).

Preamble
import Mathlib.Probability.Martingale.OptionalStopping
import Mathlib.MeasureTheory.Integral.Bochner.Set
import Mathlib.Data.ENNReal.Real
open MeasureTheory Set
open scoped NNReal ENNReal
Formal statement
theorem AvramDividend.Classical.nat_positive_martingale_finite_grid_maximal_unit_bound
    {Ω : Type*} [mΩ : MeasurableSpace Ω]
    {μ : Measure Ω} [IsFiniteMeasure μ]
    {𝓕 : Filtration ℕ mΩ}
    (Z : ℕ → Ω → ℝ) (hZ : Martingale Z 𝓕 μ)
    (hpos : ∀ n ω, 0 ≤ Z n ω)
    (hunit : ∀ n, (∫ ω, Z n ω ∂μ) = 1)
    (a : ℝ≥0) (n : ℕ) :
    (a : ℝ≥0∞) *
      μ {ω | (a : ℝ) ≤
        (Finset.range (n + 1)).sup'
          (Finset.nonempty_range_add_one) (fun k => Z k ω)} ≤ 1 := by sorry
Source
Invoke the pinned Mathlib `MeasureTheory.maximal_ineq` for nonnegative submartingales, use `setIntegral_le_integral` to bound the restricted terminal mean by the total unit expectation, and convert the real integral upper bound to ENNReal. The theorem is generic and assumes the genuine fixed-measure martingale; it does not assume that such a process already exists under the finite Esscher law.

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me