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.
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, 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 initial condition alone is not a substitute.
Fix , an integer , and for every set and , for a globally Lipschitz real payoff with constant . These levels of the same SDE give the infinite compatible family required by MLMC cost complexity under bias, variance, and work rates, with target . At each level pair, use the same initial value and Brownian path for the fine and coarse Euler paths, summing the fine Brownian increments to form each coarse increment. Use independent sample blocks across levels as in Geometric MLMC hierarchy and coupled corrections. For , the coupled correction variance is ; the finest-level payoff bias is ; and one coupled path-pair sample costs . At level , by the all-moment premise and the Lipschitz payoff, and one Euler path has finite work. Since is fixed, enlarge the rate constants to include and the level-zero work . Hence and the MLMC estimator has MSE at most with work .
Facts & Assumptions
Given: The exact autonomous all-moment SDE/Euler contract above; ; fixed ; 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 .
Euler–Maruyama strong rate under Higham–Mao–Stuart hypotheses: under its exact , one-sided-Lipschitz, globally-Lipschitz-diffusion, polynomial-drift, and uniform all-moment hypotheses, for on an integral grid.
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.
Cauchy-Schwarz for random variables: for square-integrable real , .
MLMC cost complexity under bias, variance, and work rates: with bias order , correction variance order , and work order , the case has cost .
This corollary assumes AC, as does the exact Euler strong-rate supplier. The Axiom of Choice
Proof
Given: The hypotheses in the Statement.
For , . Couple the fine and coarse paths using the same exact solution and the common Brownian path specified in the Statement. Then Taking expectations and applying [F1] at both step sizes gives .
Again by the Lipschitz bound and [F3], Thus .
Put . The Lipschitz bound gives , and . Step 1.1 therefore implies , so .
A level- fine path has steps and its coarse partner has steps. For fixed , dimension, and unit-cost coefficient and payoff evaluations, their total work is for . At level , has finite second moment by the all-moment premise, so the Lipschitz payoff gives ; the single Euler path has finite work. Since is fixed, enlarge the constants so that the level-zero variance and work also satisfy the rate bounds required by [F4]. Applying [F4] with , , and gives the stated MSE and work bound. AC is inherited only from [A1]; no choice principle is used in the rate estimates.
Depends on
Used by
Dependency tree · two levels
17 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)
- Desmond J. Higham, Xuerong Mao, and Andrew M. Stuart, Strong Convergence of Euler-Type Methods for Nonlinear Stochastic Differential Equations, §4, Assumptions 3.1/4.1/4.2 and Theorem 4.4 (standard reference, not scraped)