Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(28), p. 21 β€” π’ž(𝒴) ≀ (Tβ‚€/Ξ³β‚€)(1 + (3/2)(2^{(π”žβˆ’1)/2} βˆ’ 1)⁻¹) if π”ž > 1, Tβ‚€(1 + (3/2)R)/Ξ³β‚€ if π”ž = 1

Proved
MLLangevin.General.display_28

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

complexitymultilevel-monte-carlop2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1

Let a∈[1,2]\mathfrak a\in[1,2]a∈[1,2], Ξ³0>0\gamma_0>0Ξ³0​>0, T0>0T_0>0T0​>0 and R∈NR\in\mathbb NR∈N, and set Ξ³r=Ξ³02βˆ’r\gamma_r=\gamma_02^{-r}Ξ³r​=Ξ³0​2βˆ’r and Tr=T02βˆ’1+a2rT_r=T_02^{-\frac{1+\mathfrak a}2r}Tr​=T0​2βˆ’21+a​r. Then the complexity C(Y)=T0Ξ³0+βˆ‘r=1R(TrΞ³r+TrΞ³rβˆ’1)\mathcal C(\mathcal Y)=\frac{T_0}{\gamma_0}+\sum_{r=1}^R\big(\frac{T_r}{\gamma_r}+\frac{T_r}{\gamma_{r-1}}\big)C(Y)=Ξ³0​T0​​+βˆ‘r=1R​(Ξ³r​Tr​​+Ξ³rβˆ’1​Tr​​) satisfies

C(Y)≀{T0Ξ³0(1+32(2aβˆ’12βˆ’1)βˆ’1)ifΒ a>1,T0(1+32R)Ξ³0ifΒ a=1.\mathcal C(\mathcal Y)\le\begin{cases}\dfrac{T_0}{\gamma_0}\Big(1+\tfrac32\big(2^{\frac{\mathfrak a-1}2}-1\big)^{-1}\Big)&\text{if }\mathfrak a>1,\\[2mm] \dfrac{T_0(1+\tfrac32R)}{\gamma_0}&\text{if }\mathfrak a=1.\end{cases}C(Y)β‰€βŽ©βŽ¨βŽ§β€‹Ξ³0​T0​​(1+23​(22aβˆ’1β€‹βˆ’1)βˆ’1)Ξ³0​T0​(1+23​R)​​ifΒ a>1,ifΒ a=1.​

When a>1\mathfrak a>1a>1 the cost of all correcting levels together is of the order of the cost of level 000; when a=1\mathfrak a=1a=1 it grows linearly in RRR.

Formalization Note. The complexity is the formula of p. 6, used for all horizons (the page gives it for horizons that are multiples of the steps). The statement is arithmetic about that formula.

Preamble
import Mathlib
import Definitions.Def_MLLangevin_General_Setting
Formal statement
namespace MLLangevin.General

theorem display_28 (π”ž Ξ³β‚€ Tβ‚€ : ℝ) (R : β„•) (hπ”ž : 1 ≀ π”ž ∧ π”ž ≀ 2) (hΞ³β‚€ : 0 < Ξ³β‚€) (hTβ‚€ : 0 < Tβ‚€) :
    cost R Ξ³β‚€ (geomHorizon Tβ‚€ π”ž)
      ≀ if 1 < π”ž then Tβ‚€ / Ξ³β‚€ * (1 + 3 / 2 * ((2 : ℝ) ^ ((π”ž - 1) / 2) - 1)⁻¹)
        else Tβ‚€ * (1 + 3 / 2 * (R : ℝ)) / Ξ³β‚€ := by sorry

end MLLangevin.General
Source
EgΓ©a–Panloup, arXiv:2109.07753v2, (28), p. 21, in Proposition 3.1
Human review
  • Endorsed by Shuze Chen Β· Oct 14, 2026

    Confirmed by the moderator at approval.

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