Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Milstein MLMC correction variance and inverse-epsilon-squared cost

Statement

Assume AC and the scalar or commutative-noise SDE hypotheses of Strong order one for scalar and commutative-noise Milstein schemes. Let T>0, use dyadic step sizes hℓ=T2−ℓ, and let ψ:Rd→R be Lipschitz. At each level form the Milstein approximation Yℓ(T); couple adjacent levels by using the same Brownian path, so each coarse increment is the sum of its two fine increments. Put Pℓ=ψ(Yℓ(T)) and let Δℓ=Pℓf−Pℓ−1c for ℓ≥1, as in Geometric MLMC hierarchy and coupled corrections. For fixed finite d,m and bounded-cost coefficient and derivative evaluations, constants independent of ℓ satisfy ∣EPℓ−Eψ(XT)∣≤Cbhℓ,Var⁡(Δℓ)≤Cvhℓ2,Cℓ≤Cchℓ−1. The exact statement and proof of MLMC cost complexity under bias, variance, and work rates then give an MLMC estimator with root-mean-square error at most ϵ and total work O(ϵ−2) for all sufficiently small ϵ>0. The variance statement is for Lipschitz terminal payoffs and the stated nested coupling; no Euler correction-rate theorem or area-sampling cost is substituted.

Facts & Assumptions

Given: The SDE and Milstein hypotheses, a fixed finite horizon T, a Lipschitz payoff ψ, the dyadic hierarchy, nested Brownian coupling, and bounded work per Milstein step.

[L1]

Milstein updates, iterated Brownian integrals, and commutative noise: under commutative noise the Milstein update uses Brownian increments and coefficient derivatives, with no iterated-area samples.

[L2]

Strong order one for scalar and commutative-noise Milstein schemes: on a shared Brownian path, E∣Yh(T)−XT∣2≤Ch2 for all sufficiently small grid steps h.

[F1]

Geometric MLMC hierarchy and coupled corrections: dyadic levels use hℓ=T2−ℓ, a fine/coarse coupling, and correction Δℓ=Pℓf−Pℓ−1c.

[F2]

MLMC cost complexity under bias, variance, and work rates: if bias is O(hα) with α≥1/2, correction variance is O(hβ) with β>0, and one correction sample costs O(h−1), then the MLMC work is O(ϵ−2) when β>1.

[F3]

Cauchy-Schwarz for random variables: E∣UV∣≤(E∣U∣2)1/2(E∣V∣2)1/2 for square-integrable real variables; applied to norms it gives the L2 triangle bound and E∣U∣≤∥U∥2.

[A1]

The Axiom of Choice: AC is inherited through the Brownian and strong Milstein interfaces; no additional choice is used in the coupling or rate argument.

Proof

Given: The hypotheses above.

1.1L1L2given

For all sufficiently fine levels, [L2] gives ∥Yℓ(T)−XT∥2≤Chℓ, where ∥Z∥2=(E∣Z∣2)1/2. There are only finitely many coarser dyadic levels; each has finitely many steps and finite second moments because the coefficients and derivatives are bounded. Enlarging C therefore makes the same error bound valid for every level. The same argument gives E∣ψ(Yℓ(T))∣2<∞, since ∣ψ(x)∣≤∣ψ(0)∣+Lip⁡(ψ)∣x∣.

1.2L1F1givenalgebra

A level-ℓ fine path has T/hℓ=2ℓ steps and its coarse companion has 2ℓ−1 steps. Each commutative Milstein step uses a fixed finite number of coefficient/derivative evaluations and Gaussian vector samples for fixed d,m; [L1] requires no Lévy-area sampler. Thus one correction sample has work at most C(2ℓ+2ℓ−1)≤Cchℓ−1, including the finitely many coarse initial levels after increasing Cc.

2.1givenL2F1F3step 1.1algebra

The fine and coarse approximations in Δℓ use the same Brownian path and hence the same exact terminal value XT. By [F3], ∥U+V∥2≤∥U∥2+∥V∥2; with hℓ−1=2hℓ this gives ∥Yℓf(T)−Yℓ−1c(T)∥2≤∥Yℓf(T)−XT∥2+∥Yℓ−1c(T)−XT∥2≤C(hℓ+hℓ−1)≤C′hℓ. For each ℓ≥1, the Lipschitz property yields Var⁡(Δℓ)≤E∣Δℓ∣2≤Lip⁡(ψ)2E∣Yℓf(T)−Yℓ−1c(T)∣2≤Cvhℓ2. At level zero, Δ0=P0 by [F1] and has finite variance by step 1.1; increasing Cv to also dominate Var⁡(P0)/h02 makes the same envelope hold there.

2.2L2F1F3step 1.1algebra

Again by the Lipschitz property and [F3], ∣EPℓ−Eψ(XT)∣≤E∣ψ(Yℓ(T))−ψ(XT)∣≤Lip⁡(ψ)∥Yℓ(T)−XT∥2≤Cbhℓ. The finite-level second-moment statement in step 1.1 verifies the square-integrability premise of [F1].

3.1F2L2A1step 2.1step 2.2step 1.2∎

The estimates in steps 2.1, 2.2, and 1.2 verify [F2] with α=1 and β=2. Since 2>1 and 1≥1/2, applying [F2] proves the stated O(ϵ−2) MLMC work bound. The local variance argument uses only the strong order-one result [L2] for nested commutative-Milstein paths; AC is inherited as stated in [A1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

16 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources