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 — Examples

1 · Prerequisites

2 · Summary

Examples

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A three-level telescoping estimator and its remaining bias

Example

Take T=1, M=2, L=2, target P=0, and deterministic level values Pℓ=2−ℓ. 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 N0,N1,N2.

[F1]

Geometric MLMC hierarchy and coupled corrections: Δ0=P0 and Δℓ=Pℓf−Pℓ−1c for ℓ≥1, with an estimator equal to the sum of level sample means.

[F2]

Expectation, variance, and MSE of a finite MLMC estimator: the estimator mean is EPL and its MSE is its sampling variance plus the squared difference between EPL and the target mean.

Verification

1.1F1givenalgebra

Since each level is deterministic, [F1] gives Δ0=1, Δ1=12−1=−12, and Δ2=14−12=−14.

2.1F1F2step 1.1algebra∎

Each sample mean equals its constant correction, so μ^2,N=1−12−14=14=EP2. Its sampling variance is zero, while [F2] gives MSE (14−0)2=116.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

Euler strong, weak, and autonomous MLMC rate contracts

Example

Set T=1, M=2, and write ϵ=2−k for integers k→∞. Normalize the bias-rate constant to Cb=1 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-L2 strong route and the separate autonomous all-moment route both have α=12, β=1, and per-path-pair work exponent γ=1. The bias cutoff is met at L=2k+O(1), so hL=2−L=Θ(ϵ2).
  • Under the additional bounded-payoff backward-regularity contract, the finite-L2 weak route has α=1, with the same β=γ=1. The bias cutoff is met at L=k+O(1), so hL=Θ(ϵ).

The two bias contracts therefore require different finest grids, but the same β=γ case of the MLMC theorem gives O(ϵ−2k2)=O(ϵ−2(log⁡ϵ−1)2) 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-L2 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.

[F1]

Autonomous all-moment Euler MLMC logarithmic cost: the autonomous Higham–Mao–Stuart route keeps its exact all-moment premise and gives (α,β)=(1/2,1) and the logarithmic MLMC work bound under the stated work model.

[F2]

Finite-L2 strong and conditional weak Euler MLMC cost: the finite-L2 strong branch gives (α,β)=(1/2,1); the additional backward-regularity branch gives (α,β)=(1,1). Both branches give the logarithmic MLMC work bound under the stated work model.

[F3]

Geometric MLMC hierarchy and coupled corrections: the estimator uses geometrically refined meshes and independent level sample blocks.

[A1]

AC is assumed by the two Euler rate contracts used in this comparison. The Axiom of Choice

Verification

1.1A1F1F2F3givenalgebra

With ϵ=2−k and Cb=T=1, the bias cutoff hLα≤ϵ/2 requires L≥α−1(k+12). Thus the strong routes with α=12 use L=2k+O(1), while the weak route with α=1 uses L=k+O(1). The meshes and level-block independence are those of [F3].

2.1A1F1F2givenstep 1.1algebra∎

For ℓ≥1, the fine and coarse paths take 2ℓ and 2ℓ−1 Euler steps. Summing pairs of fine Brownian increments forms the coarse increments in O(2ℓ) operations. Under the stated fixed-dimension unit-cost model, the coupled sample therefore costs O(2ℓ)=O(hℓ−1); level zero takes one Euler step and also satisfies this bound. Thus γ=1 in every branch, while [F1]–[F2] give β=1 and the logarithmic MLMC work bound O(ϵ−2(log⁡ϵ−1)2)=O(22kk2). The change in α changes the finest mesh count but not this complexity regime.

ExampleConstruction: AI-generatedVerification: AI-generatedOpen item page →

A discontinuous payoff with bias order one and variance order one-half

Example

Fix an integer M≥2, put hℓ=M−ℓ, and choose c∈(0,1]. Let X have density fc(x)=12(1+cx) on [−1,1], let S be an independent Rademacher variable, and use the discontinuous payoff φ(x)=1{x≥0}. The target law is that of P=φ(X), and for each ℓ≥0 the level law is that of Pℓ=φ(X+hℓS). Couple adjacent level laws using the same pair (X,S) within each coupling.

For each correction sample, draw a fresh independent pair (X,S) 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 α=1 and single-correction variance order β=12 for positive levels. The level-zero correction is bounded and h0=1, so enlarge the variance constant to include it. One sample costs O(1), so it also satisfies the abstract theorem's upper work assumption O(hℓ−1). Substituting that conservative work rate into the theorem gives the guarantee O(ϵ−5/2); the example does not claim this is a sharp cost for its constant-work evaluator.

Facts & Assumptions

Given: An integer M≥2, c∈(0,1], the density and payoff above, independence of X and S, and the common-pair coupling across each adjacent level.

[F1]

Geometric MLMC hierarchy and coupled corrections: adjacent corrections may use any joint law with the stated fine and coarse marginals; here the same (X,S) supplies that coupling.

[F2]

MLMC cost complexity under bias, variance, and work rates: with α=1, β=12, and work exponent γ=1, the guaranteed cost exponent is 2+(1−β)/α=5/2.

Verification

1.1F1givenalgebra

This is a hierarchy of the form in [F1]. The density is nonnegative on [−1,1] because c≤1, and its integral is 12∫−11(1+cx) dx=1. The target mean is EP=12+c/4. Writing δ=hℓ and averaging over S=±1 gives EPℓ=12(P(X≥−δ)+P(X≥δ))=EP−cδ24. Thus ∣EPℓ−EP∣=chℓ/4, so the bias exponent is α=1.

1.2F1givenalgebra

For ℓ≥1, put δf=hℓ and δc=hℓ−1=M δf. The correction Δℓ=Pℓ−Pℓ−1 is +1 when S=−1 and δf≤X<δc, is −1 when S=+1 and −δc≤X<−δf, and is zero otherwise. Integrating the density on those two intervals and averaging over the two signs gives P(Δℓ≠0)=δc−δf2=M−12hℓ=:pℓ. The level-0 correction is bounded, so it has finite variance as well.

2.1givenstep 1.2algebra

The two signed crossing probabilities give EΔℓ=c(M−1)hℓ/4. Since Δℓ2=1{Δℓ≠0}, Var⁡(Δℓ)=pℓ−(EΔℓ)2. For ℓ≥1, hℓ≤1/M and (EΔℓ)2pℓ=c2(M−1)2hℓ3/28(M−1)≤c2(M−1)(M+1)28M3/2≤c24≤14. The last inequality follows from (M−1)(M+1)2≤2M3/2 for M≥2. Hence 34pℓ≤Var⁡(Δℓ)≤pℓ, which proves the exact order β=12.

3.1F2step 1.1step 2.1algebra∎

The sample evaluator uses a constant number of draws, so its cost is O(1)≤O(hℓ−1) because 0<hℓ≤1. Substituting α=1, β=12, γ=1 into [F2] gives the stated O(ϵ−5/2) upper guarantee under that work-rate bound.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Finite correction variance cannot replace bias control

Statement refuted

Finite correction variances and per-sample work bounds O(hℓ−1) 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.

[F1]

Geometric MLMC hierarchy and coupled corrections: the estimator is the sum of level sample means, with Δ0=P0 and coupled fine-minus-coarse corrections at later levels.

Counterexample

Take T=1, M=2, target P=0, and Pℓ=1 deterministically for every ℓ≥0. Use the deterministic coupling (Pℓf,Pℓ−1c)=(1,1) at every positive level. Charge one level-ℓ sample at cost hℓ−1.

Given: Any finite L≥0 and any positive integer sample counts N0,…,NL.

1.1F1givenalgebra

By [F1], Δ0=1 and Δℓ=0 for every ℓ≥1. All correction variances are zero and all sample costs satisfy the stated work bound.

2.1F1givenstep 1.1algebra∎

By [F1], every sample mean equals its constant correction, so μ^L,N=1 for every L and every sample allocation. The target mean is zero, hence the MSE is exactly 1 and cannot be made arbitrarily small. The missing hypothesis is convergence of EPL to EP; here the bias remains 1.

CounterexampleConstruction: AI-generatedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

Nondecaying correction variance can force cubic cost

Statement refuted

Bias order one and per-sample work O(hℓ−1) alone guarantee the logarithmic MLMC work bound O(ϵ−2(log⁡ϵ−1)2).

Facts & Assumptions

Given: The finite MLMC hierarchy, the claimed universal complexity bound above, and the counterexample construction below.

[F1]

Geometric MLMC hierarchy and coupled corrections: adjacent-level couplings need only have the correct marginal laws, and level sample blocks are independent.

[F2]

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 T=1, M=2, hℓ=2−ℓ, target P=0, and Pℓ=hℓ+Zℓ, where each Zℓ is Rademacher. At level ℓ≥1, couple the fine and coarse marginals independently: use independent Rademacher variables Zℓf and Zℓ−1c and set Δℓ=(hℓ+Zℓf)−(hℓ−1+Zℓ−1c). At level 0, use Δ0=1+Z0. Take the level sample blocks independent and charge hℓ−1 work per draw.

Given: Any finite level L and positive integer sample counts for which the estimator has MSE at most ϵ2.

1.1F1givenalgebra

Since EPℓ=hℓ, the finest-level bias is hL, so this hierarchy has bias order α=1. For ℓ≥1, the independent centered Rademacher terms have variance 1+1=2, hence Var⁡(Δℓ)=2 and no bound O(hℓβ) holds for any β>0. The sample cost is exactly hℓ−1.

2.1F2step 1.1givenalgebra∎

By [F2], the MSE is hL2+1N0+2∑ℓ=1L1Nℓ. Thus MSE at most ϵ2 requires hL≤ϵ and NL≥2ϵ−2. The finest-level work alone is therefore NLhL−1≥2ϵ−3. This grows faster than ϵ−2(log⁡ϵ−1)2, so the claimed logarithmic bound fails without a positive correction-variance decay rate.

Sources