Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

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.

Depends on

Used by

Dependency tree · two levels

20 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