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 — Examples
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
- Multilevel Monte Carlo and cost theorem
- 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
Examples
- A three-level telescoping estimator and its remaining bias computes the finite-level telescope and shows the remaining discretization bias separately from sampling variance.
- Euler strong, weak, and autonomous MLMC rate contracts compares the finite- strong, conditional weak-order-one, and autonomous all-moment Euler contracts.
- A discontinuous payoff with bias order one and variance order one-half gives an exact coupled discontinuous-payoff hierarchy with bias exponent one and correction-variance exponent one-half.
- Finite correction variance cannot replace bias control shows that finite correction variances and bounded work do not control target bias.
- Nondecaying correction variance can force cubic cost gives a hierarchy whose nondecaying correction variance forces at least cubic work despite bias order one.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
A three-level telescoping estimator and its remaining bias
Example
Take , , , target , and deterministic level values . Every correction sample is constant, so sample counts do not change the estimate. The three levels make the telescoping identity and the remaining finest-level bias explicit.
Facts & Assumptions
Given: The deterministic target and level values above, with any positive integer sample counts .
Geometric MLMC hierarchy and coupled corrections: and for , with an estimator equal to the sum of level sample means.
Expectation, variance, and MSE of a finite MLMC estimator: the estimator mean is and its MSE is its sampling variance plus the squared difference between and the target mean.
Verification
Since each level is deterministic, [F1] gives , , and .
Each sample mean equals its constant correction, so . Its sampling variance is zero, while [F2] gives MSE .
Euler strong, weak, and autonomous MLMC rate contracts
Example
Set , , and write for integers . Normalize the bias-rate constant to to display the level counts. Fix the state and Brownian dimensions, and count arithmetic operations, Brownian increment draws, coefficient evaluations, and payoff evaluations as unit work.
- The finite- strong route and the separate autonomous all-moment route both have , , and per-path-pair work exponent . The bias cutoff is met at , so .
- Under the additional bounded-payoff backward-regularity contract, the finite- weak route has , with the same . The bias cutoff is met at , so .
The two bias contracts therefore require different finest grids, but the same case of the MLMC theorem gives work in each branch. The weak-rate branch is conditional on its stated backward regularity; it is not supplied by a Lipschitz payoff alone.
Facts & Assumptions
Given: AC; the finite- SDE contract; the autonomous all-moment SDE contract; a globally Lipschitz payoff; fixed state and Brownian dimensions and the unit-cost work model above; and, for the weak branch only, the bounded-payoff backward regularity and moment hypotheses.
Autonomous all-moment Euler MLMC logarithmic cost: the autonomous Higham–Mao–Stuart route keeps its exact all-moment premise and gives and the logarithmic MLMC work bound under the stated work model.
Finite-L2 strong and conditional weak Euler MLMC cost: the finite- strong branch gives ; the additional backward-regularity branch gives . Both branches give the logarithmic MLMC work bound under the stated work model.
Geometric MLMC hierarchy and coupled corrections: the estimator uses geometrically refined meshes and independent level sample blocks.
AC is assumed by the two Euler rate contracts used in this comparison. The Axiom of Choice
Verification
With and , the bias cutoff requires . Thus the strong routes with use , while the weak route with uses . The meshes and level-block independence are those of [F3].
For , the fine and coarse paths take and Euler steps. Summing pairs of fine Brownian increments forms the coarse increments in operations. Under the stated fixed-dimension unit-cost model, the coupled sample therefore costs ; level zero takes one Euler step and also satisfies this bound. Thus in every branch, while [F1]–[F2] give and the logarithmic MLMC work bound . The change in changes the finest mesh count but not this complexity regime.
A discontinuous payoff with bias order one and variance order one-half
Example
Fix an integer , put , and choose . Let have density on , let be an independent Rademacher variable, and use the discontinuous payoff . The target law is that of , and for each the level law is that of . Couple adjacent level laws using the same pair within each coupling.
For each correction sample, draw a fresh independent pair with the stated law; within each positive-level correction use that same pair for the fine and coarse payoffs, and take all samples in distinct level blocks independently as required by the definition. This gives an infinite compatible family whose finite prefixes are MLMC hierarchies. The example has bias order and single-correction variance order for positive levels. The level-zero correction is bounded and , so enlarge the variance constant to include it. One sample costs , so it also satisfies the abstract theorem's upper work assumption . Substituting that conservative work rate into the theorem gives the guarantee ; the example does not claim this is a sharp cost for its constant-work evaluator.
Facts & Assumptions
Given: An integer , , the density and payoff above, independence of and , and the common-pair coupling across each adjacent level.
Geometric MLMC hierarchy and coupled corrections: adjacent corrections may use any joint law with the stated fine and coarse marginals; here the same supplies that coupling.
MLMC cost complexity under bias, variance, and work rates: with , , and work exponent , the guaranteed cost exponent is .
Verification
This is a hierarchy of the form in [F1]. The density is nonnegative on because , and its integral is . The target mean is . Writing and averaging over gives Thus , so the bias exponent is .
For , put and . The correction is when and , is when and , and is zero otherwise. Integrating the density on those two intervals and averaging over the two signs gives The level-0 correction is bounded, so it has finite variance as well.
The two signed crossing probabilities give . Since , . For , and The last inequality follows from for . Hence , which proves the exact order .
The sample evaluator uses a constant number of draws, so its cost is because . Substituting , , into [F2] gives the stated upper guarantee under that work-rate bound.
Finite correction variance cannot replace bias control
Statement refuted
Finite correction variances and per-sample work bounds alone guarantee that increasing the number of levels and samples can make the MLMC MSE arbitrarily small for any integrable target.
Facts & Assumptions
Given: The finite MLMC hierarchy, and the universal guarantee stated above, which is to be refuted.
Geometric MLMC hierarchy and coupled corrections: the estimator is the sum of level sample means, with and coupled fine-minus-coarse corrections at later levels.
Counterexample
Take , , target , and deterministically for every . Use the deterministic coupling at every positive level. Charge one level- sample at cost .
Given: Any finite and any positive integer sample counts .
By [F1], and for every . All correction variances are zero and all sample costs satisfy the stated work bound.
By [F1], every sample mean equals its constant correction, so for every and every sample allocation. The target mean is zero, hence the MSE is exactly and cannot be made arbitrarily small. The missing hypothesis is convergence of to ; here the bias remains .
Nondecaying correction variance can force cubic cost
Statement refuted
Bias order one and per-sample work alone guarantee the logarithmic MLMC work bound .
Facts & Assumptions
Given: The finite MLMC hierarchy, the claimed universal complexity bound above, and the counterexample construction below.
Geometric MLMC hierarchy and coupled corrections: adjacent-level couplings need only have the correct marginal laws, and level sample blocks are independent.
Expectation, variance, and MSE of a finite MLMC estimator: the MLMC MSE is squared finest-level bias plus the sum of each correction variance divided by its sample count.
Counterexample
Let , , , target , and where each is Rademacher. At level , couple the fine and coarse marginals independently: use independent Rademacher variables and and set At level , use . Take the level sample blocks independent and charge work per draw.
Given: Any finite level and positive integer sample counts for which the estimator has MSE at most .
Since , the finest-level bias is , so this hierarchy has bias order . For , the independent centered Rademacher terms have variance , hence and no bound holds for any . The sample cost is exactly .
By [F2], the MSE is Thus MSE at most requires and . The finest-level work alone is therefore . This grows faster than , so the claimed logarithmic bound fails without a positive correction-variance decay rate.