Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Case (a) — L+1≤c5log⁡ε−1L+1\le c_5\log\varepsilon^{-1}L+1≤c5​logε−1

Proved
GilesMLMC.Complexity.L_succ_le_c5

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

multilevel-monte-carlop2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1real-analysis

Let M≥2M\ge2M≥2 be an integer, T,α,c1>0T,\alpha,c_1>0T,α,c1​>0 and 0<ε<e−10<\varepsilon<e^{-1}0<ε<e−1. For the integer level L=⌈log⁡(2c1Tαε−1)/(αlog⁡M)⌉L=\lceil\log(\sqrt2c_1T^\alpha\varepsilon^{-1})/(\alpha\log M)\rceilL=⌈log(2​c1​Tαε−1)/(αlogM)⌉ of (6),

L+1≤c5log⁡ε−1,c5=1αlog⁡M+max⁡(0,log⁡(2 c1Tα)αlog⁡M)+2.L+1\le c_5\log\varepsilon^{-1},\qquad c_5=\frac{1}{\alpha\log M}+\max\Big(0,\frac{\log(\sqrt2\,c_1T^\alpha)}{\alpha\log M}\Big)+2 .L+1≤c5​logε−1,c5​=αlogM1​+max(0,αlogMlog(2​c1​Tα)​)+2.

The number of levels thus grows only logarithmically in ε−1\varepsilon^{-1}ε−1, with a constant independent of ε\varepsilonε; in case (a) this is the source of the factor (log⁡ε)2(\log\varepsilon)^2(logε)2.

Formalization Note LLL is the integer ceiling, cast to the reals; the bound holds whatever its sign. ε>0\varepsilon>0ε>0 is implicit in "ε<e−1\varepsilon<e^{-1}ε<e−1".

Preamble
import Mathlib
import Definitions.Def_GilesMLMC_Complexity_Setup
import Definitions.Def_GilesMLMC_Complexity_Choices
Formal statement
namespace GilesMLMC.Complexity

/-- Case (a) of the proof of Theorem 3.1, bound on `L` (Giles 2008, §3, p. 609, PDF 3, right column, bottom): for `ε < e⁻¹`, `L + 1 ≤ c₅ log ε⁻¹` with `c₅ = 1/(α log M) + max(0, log(√2 c₁ T^α)/(α log M)) + 2`.

Formalization Note. `L` is the integer ceiling `Lchoice M T α c₁ ε` of (6), cast to ℝ; the bound holds whatever its sign. `ε > 0` is implicit in "ε < e⁻¹". -/
theorem L_succ_le_c5
    (M : ℕ) (hM : 2 ≤ M) (T : ℝ) (hT : 0 < T)
    (α c₁ ε : ℝ) (hα : 0 < α) (hc₁ : 0 < c₁) (hε : 0 < ε) (hε1 : ε < Real.exp (-1)) :
    ((Lchoice M T α c₁ ε : ℤ) : ℝ) + 1 ≤ c₅ M T α c₁ * Real.log ε⁻¹ := by sorry

end GilesMLMC.Complexity
Source
Giles, Multilevel Monte Carlo path simulation, Operations Research 56(3) (2008), §3, proof of Theorem 3.1, case (a), bound on L, p. 609
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