Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(6) — the choice of LLL gives 12M−αε<c1hLα≤12ε\tfrac1{\sqrt2}M^{-\alpha}\varepsilon<c_1h_L^\alpha\le\tfrac1{\sqrt2}\varepsilon2​1​M−αε<c1​hLα​≤2​1​ε

Proved
GilesMLMC.Complexity.eq_6

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 and T,α,c1,ε>0T,\alpha,c_1,\varepsilon>0T,α,c1​,ε>0. Choose the integer

L=⌈log⁡(2 c1Tαε−1)αlog⁡M⌉L=\left\lceil \frac{\log(\sqrt2\,c_1T^\alpha\varepsilon^{-1})}{\alpha\log M}\right\rceilL=⌈αlogMlog(2​c1​Tαε−1)​⌉

and let hL=M−LTh_L=M^{-L}ThL​=M−LT. Then

12M−αε<c1hLα≤12ε.\frac1{\sqrt2}M^{-\alpha}\varepsilon< c_1h_L^\alpha\le\frac1{\sqrt2}\varepsilon .2​1​M−αε<c1​hLα​≤2​1​ε.

The right inequality makes the bias at level LLL at most ε/2\varepsilon/\sqrt2ε/2​; the left one bounds hL−1h_L^{-1}hL−1​, and hence the number of levels and the cost.

Formalization Note The statement holds for every value of the ceiling, including a negative one, so LLL is an integer and hLh_LhL​ uses an integer power. ε>0\varepsilon>0ε>0 is implicit in the paper.

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

/-- Inequality (6) (Giles 2008, §3, proof of Theorem 3.1, p. 609, PDF 3, right column, top): with `L = ⌈log(√2 c₁ T^α ε⁻¹)/(α log M)⌉`, `(1/√2) M^{-α} ε < c₁ h_L^α ≤ (1/√2) ε`.

Formalization Note. Here `L` is the integer `Lchoice M T α c₁ ε` (`Int.ceil`), and `h_L = T M^{-L}` is `hz` (an integer power), so the statement holds for every value of the ceiling, including a negative one. Powers with real exponents are `Real.rpow`. `ε > 0` is implicit in the paper. -/
theorem eq_6
    (M : ℕ) (hM : 2 ≤ M) (T : ℝ) (hT : 0 < T)
    (α c₁ ε : ℝ) (hα : 0 < α) (hc₁ : 0 < c₁) (hε : 0 < ε) :
    (M : ℝ) ^ (-α) * ε / Real.sqrt 2 < c₁ * hz M T (Lchoice M T α c₁ ε) ^ α ∧
      c₁ * hz M T (Lchoice M T α c₁ ε) ^ α ≤ ε / Real.sqrt 2 := by sorry

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