Alphabeta Math
Pipeline-generated
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

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: O(ϵ−2) for β>1, O(ϵ−2(log⁡ϵ−1)2) for β=1, and O(ϵ−2−(1−β)/α) for 0<β<1. 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-L2 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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Geometric MLMC hierarchy and coupled corrections

Definition

Fix a refinement factor M∈N with M≥2, a base scale T>0, and a finite level L∈N∪{0}. The geometric mesh widths are hℓ=TM−ℓ for 0≤ℓ≤L. Let P be a real random variable with E∣P∣<∞, and for each ℓ let Pℓ be a real random variable with E[Pℓ2]<∞.

At level 0, set Δ0=P0. At each level ℓ≥1, choose a joint law for a pair (Pℓf,Pℓ−1c) whose marginals are the laws of Pℓ and Pℓ−1, respectively. Such a joint law is a coupling of the two levels. Define the correction Δℓ=Pℓf−Pℓ−1c. This construction gives EΔℓ=EPℓ−EPℓ−1.

For each level choose a positive integer Nℓ and take Δℓ,1,…,Δℓ,Nℓ to be independent copies of Δℓ. Require the complete sample blocks from distinct levels to be independent. Write Δˉℓ=Nℓ−1∑i=1NℓΔℓ,i. The finite-level multilevel Monte Carlo estimator is μ^L,N=∑ℓ=0LΔˉℓ. 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.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Expectation, variance, and MSE of a finite MLMC estimator

Statement

Use the finite hierarchy and estimator of Geometric MLMC hierarchy and coupled corrections. Put Vℓ=Var⁡(Δℓ). Then Eμ^L,N=EPL,Var⁡(μ^L,N)=∑ℓ=0LVℓNℓ, and the mean square error for the target EP is exactly E[(μ^L,N−EP)2]=∑ℓ=0LVℓNℓ+(EPL−EP)2.

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.

[F1]

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.

[F2]

Geometric MLMC hierarchy and coupled corrections: every correction has finite second moment because its two level approximations do.

[F3]

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.

[F4]

Linearity, monotonicity, and the modulus bound for expectation: expectation is linear for finite sums of integrable random variables.

[F5]

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.

1.1F1F2F3

For each level ℓ, the sample Δℓ,1,…,Δℓ,Nℓ is IID by [F1] and square-integrable by [F2]. Applying [F3] to its sample mean gives EΔˉℓ=EΔℓ and Var⁡(Δˉℓ)=Vℓ/Nℓ.

2.1F1F4step 1.1algebra

The level-zero mean is EΔ0=EP0. For ℓ≥1, the coupling marginals in [F1] give EΔℓ=EPℓ−EPℓ−1. Finite linearity [F4] and telescoping therefore yield Eμ^L,N=∑ℓ=0LEΔˉℓ=EPL.

2.2F1F5step 1.1

Set ξℓ=Δˉℓ−EΔˉℓ. 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 Var⁡(μ^L,N)=∑ℓ=0LVar⁡(Δˉℓ)=∑ℓ=0LVℓ/Nℓ, using step 1.1.

3.1F5step 2.1step 2.2∎

The single error E=μ^L,N−EP is square-integrable. By step 2.1 its mean is EPL−EP, and by step 2.2 its variance is ∑ℓ=0LVℓ/Nℓ. The one-variable case of [F5] gives E[E2]=Var⁡(E)+(EE)2, which is the asserted MSE identity.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

MLMC cost complexity under bias, variance, and work rates

Statement

Let M≥2 be an integer, T>0, and hℓ=TM−ℓ. Let P be an integrable real target. Suppose we are given an infinite compatible hierarchy: for every ℓ≥0 a square-integrable level approximation Pℓ, and for every ℓ≥1 a fixed coupling of the laws of Pℓ and Pℓ−1. Define Δ0=P0 and, under each coupling, Δℓ=Pℓf−Pℓ−1c. For each finite L, use the first L+1 levels and their couplings, with independent sample blocks across levels, as in Geometric MLMC hierarchy and coupled corrections. Suppose there are constants Cb,Cv,Cc>0 and exponents α≥12 and β>0 such that, for every ℓ≥0, ∣EPℓ−EP∣≤Cbhℓα,Var⁡(Δℓ)≤Cvhℓβ, and the work for one level-ℓ correction sample is at most Cchℓ−1. For every sufficiently small ϵ>0, there are a finite level L and positive integer sample counts N0,…,NL for which the estimator of Geometric MLMC hierarchy and coupled corrections satisfies E[(μ^L,N−EP)2]≤ϵ2 and its total work has the following upper bounds, with constants independent of ϵ: {O(ϵ−2),β>1,O ⁣(ϵ−2(log⁡ϵ−1)2),β=1,O ⁣(ϵ−2−(1−β)/α),0<β<1. 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, α≥12, β>0, positive constants Cb,Cv,Cc, 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.

[F1]

Geometric MLMC hierarchy and coupled corrections: the geometric mesh widths are hℓ=TM−ℓ.

[F2]

Geometric MLMC hierarchy and coupled corrections: the estimator is the sum of level sample means, with independent sample blocks at distinct levels.

[F3]

Expectation, variance, and MSE of a finite MLMC estimator: its mean is EPL, its variance is ∑ℓ=0LVℓ/Nℓ, and its MSE is that variance plus squared bias.

Proof

Given: The rate hypotheses in the Statement.

1.1givenF1choosealgebra

For sufficiently small ϵ, choose L=⌈log⁡(2 CbTα/ϵ)αlog⁡M⌉. Then CbhLα≤ϵ/2. The ceiling also gives hL−1=O(ϵ−1/α) and L+1=O(log⁡ϵ−1).

2.1F2F3step 1.1constructalgebra

Put vℓ=Cvhℓβ, cℓ=Cchℓ−1, and SL=∑ℓ=0Lvℓcℓ. Choose Nℓ=⌈2ϵ−2SLvℓcℓ⌉,0≤ℓ≤L. Each Nℓ is a positive integer. Since Vℓ≤vℓ and Nℓ≥2ϵ−2SLvℓ/cℓ, [F3] gives Var⁡(μ^L,N)≤∑ℓ=0LvℓNℓ≤ϵ22SL∑ℓ=0Lvℓcℓ=ϵ22. The bias bound from step 1.1 and the MSE identity [F3] imply the required MSE bound.

2.2F1givenstep 1.1algebra

The ceiling inequality ⌈x⌉≤x+1 and the per-sample work bound imply Work⁡≤∑ℓ=0LNℓcℓ≤2ϵ−2SL2+∑ℓ=0Lcℓ. Because hℓ=hLML−ℓ, the geometric-series formula gives ∑ℓ=0Lcℓ=Cc∑ℓ=0Lhℓ−1≤Cc1−M−1hL−1=O(ϵ−1/α).

3.1givenstep 2.2algebra

If β>1, put q=(β−1)/2>0. Then SL=CvCc∑ℓ=0Lhℓq≤CvCc Tq1−M−q=O(1). The first term in step 2.2 is O(ϵ−2). Its rounding term is also O(ϵ−2), since 1/α≤2.

3.2givenstep 1.1step 2.2algebra

If β=1, then SL=CvCc(L+1)=O(log⁡ϵ−1) by step 1.1. The first term in step 2.2 is therefore O(ϵ−2(log⁡ϵ−1)2), and its rounding term is no larger for sufficiently small ϵ, again because 1/α≤2.

3.3givenstep 1.1step 2.2algebra

If 0<β<1, put q=(1−β)/2>0. Then SL=CvCc∑ℓ=0Lhℓ−q≤CvCc1−M−qhL−q. The lower geometric bound from step 1.1 gives hL−1=O(ϵ−1/α), so SL2=O(ϵ−(1−β)/α). The first term in step 2.2 is O(ϵ−2−(1−β)/α). The rounding term O(ϵ−1/α) is smaller because 1/α≤2<2+(1−β)/α.

4.1step 2.1step 3.1step 3.2step 3.3∎

The estimates in steps 3.1–3.3 cover respectively β>1, β=1, and 0<β<1. Each case gives the stated total-work upper bound while step 2.1 gives the same MSE bound.

CorollaryStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

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, C1 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 L2 initial condition alone is not a substitute.

Fix 0<T≤1, an integer M≥2, and for every ℓ≥0 set hℓ=TM−ℓ and Pℓ=φ(YThℓ), for a globally Lipschitz real payoff φ with constant Lφ. These levels of the same SDE give the infinite compatible family required by MLMC cost complexity under bias, variance, and work rates, with target Eφ(XT). At each level pair, use the same initial value and Brownian path for the fine and coarse Euler paths, summing the M fine Brownian increments to form each coarse increment. Use independent sample blocks across levels as in Geometric MLMC hierarchy and coupled corrections. For ℓ≥1, the coupled correction variance is O(hℓ); the finest-level payoff bias is O(hL1/2); and one coupled path-pair sample costs O(hℓ−1). At level 0, P0∈L2 by the all-moment premise and the Lipschitz payoff, and one Euler path has finite work. Since h0=T is fixed, enlarge the rate constants to include Var⁡(P0)=O(h0) and the level-zero work O(h0−1). Hence (α,β)=(1/2,1) and the MLMC estimator has MSE at most ϵ2 with work O(ϵ−2(log⁡ϵ−1)2).

Facts & Assumptions

Given: The exact autonomous all-moment SDE/Euler contract above; 0<T≤1; fixed M≥2; 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 P0.

[F1]

Euler–Maruyama strong rate under Higham–Mao–Stuart hypotheses: under its exact C1, one-sided-Lipschitz, globally-Lipschitz-diffusion, polynomial-drift, and uniform all-moment hypotheses, Esup⁡t≤T∣Xt−Yth∣2≤Ch for 0<h≤1 on an integral grid.

[F2]

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.

[F3]

Cauchy-Schwarz for random variables: for square-integrable real Z, E∣Z∣≤(E∣Z∣2)1/2.

[F4]

MLMC cost complexity under bias, variance, and work rates: with bias order α≥1/2, correction variance order β>0, and work order hℓ−1, the case β=1 has cost O(ϵ−2(log⁡ϵ−1)2).

[A1]

This corollary assumes AC, as does the exact Euler strong-rate supplier. The Axiom of Choice

Proof

Given: The hypotheses in the Statement.

1.1A1F1F2givenalgebra

For ℓ≥1, hℓ−1=Mhℓ≤1. Couple the fine and coarse paths using the same exact solution X and the common Brownian path specified in the Statement. Then ∣YThℓ−YThℓ−1∣2≤2∣YThℓ−XT∣2+2∣YThℓ−1−XT∣2. Taking expectations and applying [F1] at both step sizes gives E∣YThℓ−YThℓ−1∣2≤2C(1+M)hℓ.

1.2A1F1F3givenalgebra

Again by the Lipschitz bound and [F3], ∣Eφ(XT)−Eφ(YThL)∣≤Lφ E∣XT−YThL∣≤Lφ(E∣XT−YThL∣2)1/2≤C1/2LφhL1/2. Thus α=1/2.

2.1givenstep 1.1algebra

Put Dℓ=φ(YThℓ)−φ(YThℓ−1). The Lipschitz bound gives ∣Dℓ∣≤Lφ∣YThℓ−YThℓ−1∣, and Var⁡(Dℓ)≤EDℓ2. Step 1.1 therefore implies Var⁡(Dℓ)≤2C(1+M)Lφ2hℓ, so β=1.

3.1A1F4step 1.2step 2.1given∎

A level-ℓ fine path has T/hℓ steps and its coarse partner has T/(Mhℓ) steps. For fixed T,M, dimension, and unit-cost coefficient and payoff evaluations, their total work is O(hℓ−1) for ℓ≥1. At level 0, YTh0 has finite second moment by the all-moment premise, so the Lipschitz payoff gives P0∈L2; the single Euler path has finite work. Since h0=T is fixed, enlarge the constants so that the level-zero variance and work also satisfy the rate bounds required by [F4]. Applying [F4] with α=1/2, β=1, and γ=1 gives the stated MSE and work bound. AC is inherited only from [A1]; no choice principle is used in the rate estimates.

CorollaryStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Finite-L2 strong and conditional weak Euler MLMC cost

Statement

Assume the Axiom of Choice and the exact finite-L2 SDE, initial-value, coefficient, and nested-grid hypotheses of Shared-Brownian Euler level correction rates, with 0<T≤1, fixed integer M≥2, and a globally Lipschitz payoff φ. For every ℓ≥0, set hℓ=TM−ℓ and Pℓ=φ(YThℓ) for this same SDE, with target Eφ(XT). These levels give the infinite compatible family required by MLMC cost complexity under bias, variance, and work rates. The finite-L2 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 E∣X0∣2<∞. With shared Brownian increments within each fine/coarse pair and independent sample blocks across levels, the strong-route rates are (α,β)=(1/2,1) and the MLMC work is O(ϵ−2(log⁡ϵ−1)2).

If, in addition, φ is bounded and its backward value function u(t,x)=E[φ(XTt,x)] solves the backward equation with the mixed derivative and polynomial-growth bounds and the p≥2q+8 moment condition in Euler–Maruyama weak order one under backward regularity, then the weak bias rate is α=1 while β=1 and the same logarithmic work bound follows. In the strong branch P0∈L2 by the finite-L2 scheme moment bound and the Lipschitz payoff; in the weak branch it is bounded. The level-zero path has finite work, and because h0=T 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-L2 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 P0.

[F1]

Shared-Brownian Euler level correction rates: under the finite-L2 SDE contract and common nested Brownian increments, the level-pair correction has variance O(hℓ), the strong-payoff bias is O(hL1/2), and one coupled path-pair sample costs O(hℓ−1); the stated backward regularity improves only the bias to O(hL).

[F2]

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 O(h).

[F3]

MLMC cost complexity under bias, variance, and work rates: with γ=1, the case β=1 gives work O(ϵ−2(log⁡ϵ−1)2) for either α=1/2 or α=1.

[A1]

This corollary assumes AC, as do the exact Euler rate suppliers. The Axiom of Choice

Proof

Given: The hypotheses in the Statement.

1.1A1F1F3given

Under the strong-route part of [F1], the positive-level bias exponent is α=1/2, the correction-variance exponent is β=1, and the cost exponent is γ=1. At level 0, the finite-L2 scheme moment bound and Lipschitz payoff give P0∈L2, while the single Euler path has finite work. Since h0=T is fixed, enlarge the constants so the level-zero variance and work satisfy the same rate bounds. Thus the all-level rates meet α≥1/2 and the hypotheses of [F3], which gives MSE at most ϵ2 with work O(ϵ−2(log⁡ϵ−1)2).

2.1A1F1F2F3step 1.1given∎

Under the additional bounded-payoff and backward-regularity premises of [F2], its weak error result gives α=1. The shared-level result [F1] leaves the positive-level variance and work exponents at β=γ=1. At level 0, P0 is bounded in this branch, and the one-step path has finite work; since h0=T 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