How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Multilevel Monte Carlo and cost theorem
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- Brownian Path Properties
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Euler–Maruyama Scheme and Coefficient Conditions
- Euler–Maruyama Strong and Weak Convergence
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Finite Probability Spaces and Random Variables
- Forward Itô SDE Well-Posedness
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- IID Monte Carlo integration and error
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Itos Formula and Brownian Martingales
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Martingale Inequalities and Convergence
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Statistical, resampling, simulation, and numerical error ledger
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Ito Integral with Respect to Brownian Motion
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
- Weak Laws and Series of Independent Random Variables
2 · Summary
Summary
This page defines a geometric hierarchy of approximations, coupled adjacent-level corrections, independent level sample blocks, and the finite MLMC estimator. The cost theorem assumes an infinite compatible family of level laws and adjacent couplings, while each estimator uses only a finite prefix. The local moment lemma proves that its expectation telescopes to the finest approximation and that its MSE splits into sampling variance and squared bias. The cost theorem then proves all three regimes from explicit bias, correction-variance, and per-sample work bounds: for , for , and for . These are upper bounds; the theorem supplies neither rate verification nor matching lower bounds.
The Euler applications keep their contracts separate. The autonomous Higham–Mao–Stuart branch uses its one-sided-Lipschitz, polynomial-drift, and all-moment hypotheses. The other branch has a direct finite- strong route, with a separate weak-order-one upgrade only under the stated bounded-payoff backward-regularity and moment conditions. A Lipschitz payoff alone does not supply that weak regularity. The two SDE routes are not transferred into each other, and adaptive bias stopping remains heuristic.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Geometric MLMC hierarchy and coupled corrections
Definition
Fix a refinement factor with , a base scale , and a finite level . The geometric mesh widths are for . Let be a real random variable with , and for each let be a real random variable with .
At level , set . At each level , choose a joint law for a pair whose marginals are the laws of and , respectively. Such a joint law is a coupling of the two levels. Define the correction . This construction gives .
For each level choose a positive integer and take to be independent copies of . Require the complete sample blocks from distinct levels to be independent. Write . The finite-level multilevel Monte Carlo estimator is All corrections have finite second moments because each level approximation does. The shared randomness inside one fine/coarse pair is what can reduce the correction variance; the estimator still uses independent sample blocks across levels.
Remarks
The definition makes no claim that a coupling is optimal, that the bias or correction variance has a particular rate, or that a data-dependent stopping rule reliably estimates the remaining bias.
Expectation, variance, and MSE of a finite MLMC estimator
Statement
Use the finite hierarchy and estimator of Geometric MLMC hierarchy and coupled corrections. Put . Then and the mean square error for the target is exactly
Facts & Assumptions
Given: A finite MLMC hierarchy with square-integrable level corrections, independent identically distributed samples within each level, and independent sample blocks at distinct levels.
Geometric MLMC hierarchy and coupled corrections: each level uses independent identically distributed copies of its correction, and complete sample blocks from distinct levels are independent.
Geometric MLMC hierarchy and coupled corrections: every correction has finite second moment because its two level approximations do.
Unbiasedness and exact variance of the IID Monte Carlo mean: for an IID real sample with finite second moment, its mean is unbiased and has variance equal to the single-draw variance divided by the sample size.
Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for finite sums of integrable random variables.
MSE of a sum of error components includes covariance terms: for square-integrable errors, the MSE of their sum is the squared total bias plus the sum of variances and pairwise covariance terms; pairwise-independent centered errors have zero covariance correction.
Proof
Given: The hypotheses above.
For each level , the sample is IID by [F1] and square-integrable by [F2]. Applying [F3] to its sample mean gives and .
The level-zero mean is . For , the coupling marginals in [F1] give . Finite linearity [F4] and telescoping therefore yield .
Set . Each is square-integrable, centered, and measurable with respect to its own level sample block. The blocks are independent by [F1], so the are pairwise independent. Applying [F5] to their finite sum gives , using step 1.1.
The single error is square-integrable. By step 2.1 its mean is , and by step 2.2 its variance is . The one-variable case of [F5] gives , which is the asserted MSE identity.
MLMC cost complexity under bias, variance, and work rates
Statement
Let be an integer, , and . Let be an integrable real target. Suppose we are given an infinite compatible hierarchy: for every a square-integrable level approximation , and for every a fixed coupling of the laws of and . Define and, under each coupling, . For each finite , use the first levels and their couplings, with independent sample blocks across levels, as in Geometric MLMC hierarchy and coupled corrections. Suppose there are constants and exponents and such that, for every , and the work for one level- correction sample is at most . For every sufficiently small , there are a finite level and positive integer sample counts for which the estimator of Geometric MLMC hierarchy and coupled corrections satisfies and its total work has the following upper bounds, with constants independent of : This is an upper bound under the three rate assumptions; it does not assert a matching lower bound or that the rates hold for a particular discretization.
Facts & Assumptions
Given: The infinite compatible hierarchy and target above, , , positive constants , the bias and correction-variance bounds, and the per-sample work bound. Every finite prefix, with independent level sample blocks, satisfies the definition cited in the Statement.
Geometric MLMC hierarchy and coupled corrections: the geometric mesh widths are .
Geometric MLMC hierarchy and coupled corrections: the estimator is the sum of level sample means, with independent sample blocks at distinct levels.
Expectation, variance, and MSE of a finite MLMC estimator: its mean is , its variance is , and its MSE is that variance plus squared bias.
Proof
Given: The rate hypotheses in the Statement.
For sufficiently small , choose Then . The ceiling also gives and .
Put , , and . Choose Each is a positive integer. Since and , [F3] gives The bias bound from step 1.1 and the MSE identity [F3] imply the required MSE bound.
The ceiling inequality and the per-sample work bound imply Because , the geometric-series formula gives
If , put . Then The first term in step 2.2 is . Its rounding term is also , since .
If , then by step 1.1. The first term in step 2.2 is therefore , and its rounding term is no larger for sufficiently small , again because .
If , put . Then The lower geometric bound from step 1.1 gives , so . The first term in step 2.2 is . The rounding term is smaller because .
The estimates in steps 3.1–3.3 cover respectively , , and . Each case gives the stated total-work upper bound while step 2.1 gives the same MSE bound.
Autonomous all-moment Euler MLMC logarithmic cost
Statement
Assume the Axiom of Choice. Use the autonomous SDE and Euler scheme contract of Euler–Maruyama strong rate under Higham–Mao–Stuart hypotheses: finite-dimensional state and Brownian noise, drift and diffusion, a one-sided Lipschitz drift, globally Lipschitz diffusion, polynomial local-Lipschitz drift, and the stipulated uniform moments of every order for the exact solution and Euler step and interpolation processes. In particular, retain that theorem's all-moment premise; an initial condition alone is not a substitute.
Fix , an integer , and for every set and , for a globally Lipschitz real payoff with constant . These levels of the same SDE give the infinite compatible family required by MLMC cost complexity under bias, variance, and work rates, with target . At each level pair, use the same initial value and Brownian path for the fine and coarse Euler paths, summing the fine Brownian increments to form each coarse increment. Use independent sample blocks across levels as in Geometric MLMC hierarchy and coupled corrections. For , the coupled correction variance is ; the finest-level payoff bias is ; and one coupled path-pair sample costs . At level , by the all-moment premise and the Lipschitz payoff, and one Euler path has finite work. Since is fixed, enlarge the rate constants to include and the level-zero work . Hence and the MLMC estimator has MSE at most with work .
Facts & Assumptions
Given: The exact autonomous all-moment SDE/Euler contract above; ; fixed ; a globally Lipschitz payoff; the sequence of levels from the same SDE; nested fine/coarse increments from a common Brownian path; and independent level sample blocks. The level-zero correction is .
Euler–Maruyama strong rate under Higham–Mao–Stuart hypotheses: under its exact , one-sided-Lipschitz, globally-Lipschitz-diffusion, polynomial-drift, and uniform all-moment hypotheses, for on an integral grid.
Autonomous Euler–Maruyama scheme and interpolation: the Euler step and continuous interpolation use the left-endpoint coefficient values and the Brownian increments on each uniform interval.
Cauchy-Schwarz for random variables: for square-integrable real , .
MLMC cost complexity under bias, variance, and work rates: with bias order , correction variance order , and work order , the case has cost .
This corollary assumes AC, as does the exact Euler strong-rate supplier. The Axiom of Choice
Proof
Given: The hypotheses in the Statement.
For , . Couple the fine and coarse paths using the same exact solution and the common Brownian path specified in the Statement. Then Taking expectations and applying [F1] at both step sizes gives .
Again by the Lipschitz bound and [F3], Thus .
Put . The Lipschitz bound gives , and . Step 1.1 therefore implies , so .
A level- fine path has steps and its coarse partner has steps. For fixed , dimension, and unit-cost coefficient and payoff evaluations, their total work is for . At level , has finite second moment by the all-moment premise, so the Lipschitz payoff gives ; the single Euler path has finite work. Since is fixed, enlarge the constants so that the level-zero variance and work also satisfy the rate bounds required by [F4]. Applying [F4] with , , and gives the stated MSE and work bound. AC is inherited only from [A1]; no choice principle is used in the rate estimates.
Finite-L2 strong and conditional weak Euler MLMC cost
Statement
Assume the Axiom of Choice and the exact finite- SDE, initial-value, coefficient, and nested-grid hypotheses of Shared-Brownian Euler level correction rates, with , fixed integer , and a globally Lipschitz payoff . For every , set and for this same SDE, with target . These levels give the infinite compatible family required by MLMC cost complexity under bias, variance, and work rates. The finite- contract here is the globally state-Lipschitz and linear-growth coefficient condition, the half-Hölder time modulus, an adapted initial value independent of future Brownian increments, and . With shared Brownian increments within each fine/coarse pair and independent sample blocks across levels, the strong-route rates are and the MLMC work is .
If, in addition, is bounded and its backward value function solves the backward equation with the mixed derivative and polynomial-growth bounds and the moment condition in Euler–Maruyama weak order one under backward regularity, then the weak bias rate is while and the same logarithmic work bound follows. In the strong branch by the finite- scheme moment bound and the Lipschitz payoff; in the weak branch it is bounded. The level-zero path has finite work, and because is fixed, enlarging the rate constants makes its variance and work satisfy the same bounds. This second branch is conditional on backward regularity; Lipschitz continuity of alone does not imply it.
Facts & Assumptions
Given: AC; the finite- contract and sequence of levels in the Statement; a globally Lipschitz payoff; and, only for the weak branch, the bounded-payoff backward regularity and moment contract. The level-zero correction is .
Shared-Brownian Euler level correction rates: under the finite- SDE contract and common nested Brownian increments, the level-pair correction has variance , the strong-payoff bias is , and one coupled path-pair sample costs ; the stated backward regularity improves only the bias to .
Euler–Maruyama weak order one under backward regularity: the weak-rate conclusion requires a bounded payoff, a solution of the stated backward equation with mixed derivatives through two time and four space derivatives of polynomial growth, and the specified moment bound; under those premises, the weak bias is .
MLMC cost complexity under bias, variance, and work rates: with , the case gives work for either or .
This corollary assumes AC, as do the exact Euler rate suppliers. The Axiom of Choice
Proof
Given: The hypotheses in the Statement.
Under the strong-route part of [F1], the positive-level bias exponent is , the correction-variance exponent is , and the cost exponent is . At level , the finite- scheme moment bound and Lipschitz payoff give , while the single Euler path has finite work. Since is fixed, enlarge the constants so the level-zero variance and work satisfy the same rate bounds. Thus the all-level rates meet and the hypotheses of [F3], which gives MSE at most with work .
Under the additional bounded-payoff and backward-regularity premises of [F2], its weak error result gives . The shared-level result [F1] leaves the positive-level variance and work exponents at . At level , is bounded in this branch, and the one-step path has finite work; since is fixed, enlarging constants includes both in the theorem's rate assumptions. Thus [F3] gives the same logarithmic work bound. The proof uses the supplier's backward regularity premise and does not infer it from the payoff being Lipschitz.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Michael B. Giles, Multilevel Monte Carlo Path Simulation, §2
- Christoph Reisinger, Stochastic Simulation: Lecture 9a, Multilevel Monte Carlo Theory, slides 4–8
- Christoph Reisinger, Stochastic Simulation: Lecture 9a, Multilevel Monte Carlo Theory, slides 4–9
- Michael B. Giles, Multilevel Monte Carlo Path Simulation, Theorem 3.1 and proof
- Christoph Reisinger, Stochastic Simulation: Lecture 9a, Multilevel Monte Carlo Theory, slides 9–12
- Michael B. Giles, Multilevel Monte Carlo Path Simulation, §§2–3
- Desmond J. Higham, Xuerong Mao, and Andrew M. Stuart, Strong Convergence of Euler-Type Methods for Nonlinear Stochastic Differential Equations, §4, Assumptions 3.1/4.1/4.2 and Theorem 4.4