(8) — for
ProvedGilesMLMC.Complexity.eq_8geometric-seriesmultilevel-monte-carlop2o-batch-pfp2bp2o-gran-per-chapterp2o-plan-paperp2o-v1
Let be an integer, , , and . Then
The bound is uniform in ; it converts the variance and the cost of case (b) into bounds that do not grow with the number of levels.
Formalization Note Only the outer strict inequality is stated; the middle equality is the identity . Powers with real exponents are real powers.
Preamble
import Mathlib import Definitions.Def_GilesMLMC_Complexity_Setup
Formal statement
namespace GilesMLMC.Complexity
/-- Inequality (8) (Giles 2008, §3, proof of Theorem 3.1, case (b), p. 610, PDF 4, left column): for `β > 1`, `Σ_{l=0}^L h_l^{(β−1)/2} = T^{(β−1)/2} Σ_{l=0}^L (M^{−(β−1)/2})^l < T^{(β−1)/2}(1 − M^{−(β−1)/2})⁻¹`.
Formalization Note. Only the outer strict inequality is stated (the middle equality is the computation `h_l = T M^{-l}`). Powers with real exponents are `Real.rpow`. It holds for every `L : ℕ`. -/
theorem eq_8
(M : ℕ) (hM : 2 ≤ M) (T : ℝ) (hT : 0 < T)
(β : ℝ) (hβ : 1 < β) (L : ℕ) :
∑ l ∈ Finset.range (L + 1), h M T l ^ ((β - 1) / 2) <
T ^ ((β - 1) / 2) * (1 - (M : ℝ) ^ (-(β - 1) / 2))⁻¹ := by sorry
end GilesMLMC.Complexity
Source
Giles, Multilevel Monte Carlo path simulation, Operations Research 56(3) (2008), §3, proof of Theorem 3.1, case (b), (8), p. 610
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.