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.
Geometric MLMC hierarchy and coupled corrections
Definition
Fix a refinement factor with , a base scale , and a finite level . The geometric mesh widths are for . Let be a real random variable with , and for each let be a real random variable with .
At level , set . At each level , choose a joint law for a pair whose marginals are the laws of and , respectively. Such a joint law is a coupling of the two levels. Define the correction . This construction gives .
For each level choose a positive integer and take to be independent copies of . Require the complete sample blocks from distinct levels to be independent. Write . The finite-level multilevel Monte Carlo estimator is All corrections have finite second moments because each level approximation does. The shared randomness inside one fine/coarse pair is what can reduce the correction variance; the estimator still uses independent sample blocks across levels.
Remarks
The definition makes no claim that a coupling is optimal, that the bias or correction variance has a particular rate, or that a data-dependent stopping rule reliably estimates the remaining bias.
Used by
- Autonomous all-moment Euler MLMC logarithmic cost Corollary
- Finite-L2 strong and conditional weak Euler MLMC cost Corollary
- MLMC work bound for bounded finite-state Poisson tau-leaping Corollary
- Finite correction variance cannot replace bias control Counterexample
- Nondecaying correction variance can force cubic cost Counterexample
- A discontinuous payoff with bias order one and variance order one-half Example
- A three-level telescoping estimator and its remaining bias Example
- Euler strong, weak, and autonomous MLMC rate contracts Example
- Expectation, variance, and MSE of a finite MLMC estimator Lemma
- Milstein MLMC correction variance and inverse-epsilon-squared cost Theorem
- MLMC cost complexity under bias, variance, and work rates Theorem
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.
Sources
- Michael B. Giles, Multilevel Monte Carlo Path Simulation, §2 (standard reference, not scraped)
- Christoph Reisinger, Stochastic Simulation: Lecture 9a, Multilevel Monte Carlo Theory, slides 4–8 (standard reference, not scraped)