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- SDE, initial-value, coefficient, and nested-grid hypotheses of Shared-Brownian Euler level correction rates, with , fixed integer , and a globally Lipschitz payoff . For every , set and for this same SDE, with target . These levels give the infinite compatible family required by MLMC cost complexity under bias, variance, and work rates. The finite- 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 . With shared Brownian increments within each fine/coarse pair and independent sample blocks across levels, the strong-route rates are and the MLMC work is .
If, in addition, is bounded and its backward value function solves the backward equation with the mixed derivative and polynomial-growth bounds and the moment condition in Euler–Maruyama weak order one under backward regularity, then the weak bias rate is while and the same logarithmic work bound follows. In the strong branch by the finite- scheme moment bound and the Lipschitz payoff; in the weak branch it is bounded. The level-zero path has finite work, and because 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- 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 .
Shared-Brownian Euler level correction rates: under the finite- SDE contract and common nested Brownian increments, the level-pair correction has variance , the strong-payoff bias is , and one coupled path-pair sample costs ; the stated backward regularity improves only the bias to .
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 .
MLMC cost complexity under bias, variance, and work rates: with , the case gives work for either or .
This corollary assumes AC, as do the exact Euler rate suppliers. The Axiom of Choice
Proof
Given: The hypotheses in the Statement.
Under the strong-route part of [F1], the positive-level bias exponent is , the correction-variance exponent is , and the cost exponent is . At level , the finite- scheme moment bound and Lipschitz payoff give , while the single Euler path has finite work. Since is fixed, enlarge the constants so the level-zero variance and work satisfy the same rate bounds. Thus the all-level rates meet and the hypotheses of [F3], which gives MSE at most with work .
Under the additional bounded-payoff and backward-regularity premises of [F2], its weak error result gives . The shared-level result [F1] leaves the positive-level variance and work exponents at . At level , is bounded in this branch, and the one-step path has finite work; since 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
- Michael B. Giles, Multilevel Monte Carlo Path Simulation, §§2–3 (standard reference, not scraped)