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.
Euler–Maruyama step process and continuous interpolation
Definition
Use the data and grid of Euler–Maruyama recursion, and let be its recursion. The left-endpoint map is The right-continuous step process is The continuous interpolation is the pathwise process At a shared grid endpoint the formulas agree because the recursion gives . In particular for every , including .
For stochastic integration, define the predictable left-endpoint version by and on , and set and on . Its coefficient integrands use the same fixed left endpoints. When the recursion is adapted, each coordinate of and each coefficient composition is a predictable finite-step process: on its value is -measurable. These coefficients need not be bounded, so the integrands need not be elementary in the bounded-coefficient sense of Elementary predictable Brownian integrands. Values at the finitely many grid points do not change either integral. Once square integrability is established, A square-integrable predictable step Itô integral is its finite sum identifies each finite-coordinate Itô integral of Ito integral for square-integrable predictable processes with its finite-sum version, giving the equivalent formula where on and denotes column of the matrix.
The justified-by theorem Euler–Maruyama uniform moments and interpolation increments ↗ establishes the required integrability and well-definedness under the stated coefficient and initial-moment conditions.
Remarks
For well-definedness on any allowed grid, including , put , , , , and on . The rescaled Brownian increments have covariance and are independent of for . The rescaled coefficients inherit the Borel, state-Lipschitz, linear-growth and half-Hölder time-modulus assumptions with finite constants depending on . The normalized mesh is , and substitution in the recursion and interpolation gives exactly and , respectively. Thus Euler–Maruyama uniform moments and interpolation increments ↗, applied to these rescaled data with , gives adapted square-integrable grid values and an adapted continuous interpolation for every original .
In particular, the original coefficient integrands satisfy Their predictability follows from left-endpoint measurability as above. The drift integral is its finite sum, and A square-integrable predictable step Itô integral is its finite sum identifies every coordinate Itô integral with its finite sum on one common measurable probability-one event. This gives the displayed integral representation without any mesh restriction. The quantitative estimates in the justified-by theorem retain their stated restriction when applied directly to the original data.
The distinction between and is only at deterministic grid times. The first records the value used at each time by the left-endpoint convention; the second is the predictable representative used by the stochastic integral.
Depends on
Used by
- A verified weak-order contract for the Ornstein–Uhlenbeck process Example
- Additive-noise Ornstein–Uhlenbeck Euler strong error Example
- Euler–Maruyama for a constant-coefficient additive-noise equation Example
- Shared-increment Euler coupling and payoff rates Example
- Euler–Maruyama one-step moment and increment estimates Lemma
- Euler–Maruyama strong rate for square-integrable initial data Theorem
- Euler–Maruyama uniform moments and interpolation increments Theorem
- Euler–Maruyama weak order one under backward regularity Theorem
- Shared-Brownian Euler level correction rates Theorem
Dependency tree · two levels
38 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
- Simo Särkkä and Arno Solin, Applied Stochastic Differential Equations, Algorithm 8.1 (standard reference, not scraped)
- Desmond J. Higham, Xuerong Mao, and Andrew M. Stuart, Strong Convergence of Euler-Type Methods for Nonlinear Stochastic Differential Equations, §2 (standard reference, not scraped)
- Tiejun Li, Lecture 16: Numerical SDEs: Basics, §1 and §2 (standard reference, not scraped)