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 , use dyadic step sizes , and let be Lipschitz. At each level form the Milstein approximation ; couple adjacent levels by using the same Brownian path, so each coarse increment is the sum of its two fine increments. Put and let for , as in Geometric MLMC hierarchy and coupled corrections. For fixed finite and bounded-cost coefficient and derivative evaluations, constants independent of satisfy 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 for all sufficiently small . 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 , a Lipschitz payoff , the dyadic hierarchy, nested Brownian coupling, and bounded work per Milstein step.
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.
Strong order one for scalar and commutative-noise Milstein schemes: on a shared Brownian path, for all sufficiently small grid steps .
Geometric MLMC hierarchy and coupled corrections: dyadic levels use , a fine/coarse coupling, and correction .
MLMC cost complexity under bias, variance, and work rates: if bias is with , correction variance is with , and one correction sample costs , then the MLMC work is when .
Cauchy-Schwarz for random variables: for square-integrable real variables; applied to norms it gives the triangle bound and .
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.
For all sufficiently fine levels, [L2] gives , where . 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 therefore makes the same error bound valid for every level. The same argument gives , since .
A level- fine path has steps and its coarse companion has steps. Each commutative Milstein step uses a fixed finite number of coefficient/derivative evaluations and Gaussian vector samples for fixed ; [L1] requires no Lévy-area sampler. Thus one correction sample has work at most , including the finitely many coarse initial levels after increasing .
The fine and coarse approximations in use the same Brownian path and hence the same exact terminal value . By [F3], ; with this gives For each , the Lipschitz property yields . At level zero, by [F1] and has finite variance by step 1.1; increasing to also dominate makes the same envelope hold there.
Again by the Lipschitz property and [F3], The finite-level second-moment statement in step 1.1 verifies the square-integrability premise of [F1].
The estimates in steps 2.1, 2.2, and 1.2 verify [F2] with and . Since and , applying [F2] proves the stated 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
- Kloeden and Platen, Numerical Solution of Stochastic Differential Equations, Sections 10.3 and 10.6, printed pp. 345-365 (standard reference, not scraped)
- M. Tretyakov, Lecture Notes for a Mini-Course on Numerical Methods for SDEs, Section 6.4 (standard reference, not scraped)