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.
Strong error bound for Euler–Maruyama on a predictable grid
Statement
Assume AC and the coefficient hypotheses of Euler–Maruyama recursion on : finite state and noise dimensions, a square-integrable initial value independent of future Brownian increments, global Lipschitz dependence on the state, the stated linear-growth bound, and the stated half-Hölder time modulus. Work on the usual filtered Brownian space required by the It^o integral. Let be the strong solution of Itô SDE data and strong solution, whose existence and path-supremum second moment are supplied by Global strong well-posedness for Lipschitz Itô SDEs. Let a finite predictable grid as in Predictable stopping-time grid have almost surely and step lengths bounded by a deterministic (one may take ). Form the complete continuous Euler interpolation by applying the predictable-grid updates of Euler–Maruyama on a predictable grid with bridge-refinement status on every interval. A finite-budget execution returns it as complete when . Then there is a finite constant , depending only on , the coefficient bounds, , and , such that Thus the one-time root-mean-square error is , uniformly over predictable controllers and finite meshes. The estimate is not an expectation of the path-supremum error. It does not cover a grid whose step choice or acceptance decision uses the endpoint of the interval being selected. No finite expected step-count or asymptotic cost claim follows without an additional step-count hypothesis.
Facts & Assumptions
Given: AC; the coefficient, Brownian, initial-value and strong-solution hypotheses above; a finite predictable grid with almost surely and step lengths bounded by a deterministic ; and its complete Euler interpolation .
The coefficients are globally Lipschitz in state, have linear growth, and are half-Hölder in time with the stated state-weighted bound; the fixed-grid Euler update uses left-endpoint coefficients and the Brownian increment. Euler–Maruyama recursion
On a predictable interval of length , the adaptive update is , with the corresponding continuous left-endpoint interpolation. Euler–Maruyama on a predictable grid with bridge-refinement status Predictable stopping-time grid
The complete interpolation has with independent of the controller and mesh. Uniform second moment for Euler–Maruyama on predictable grids
For a square-integrable -measurable coefficient on a stopping interval , its It^o integral is the coefficient times . Itô integral of a step on a stopping-time interval
A strong solution exists and under the global Lipschitz and linear-growth hypotheses. Global strong well-posedness for Lipschitz Itô SDEs
For a scalar predictable and scalar Brownian coordinate , . Ito isometry and linearity in predictable L2
If for continuous nonnegative , then . Gronwall's integral inequality with variable and constant coefficients
For each scalar Brownian coordinate and predictable square-integrable , . Doob maximal bound for the Ito integral -dimensional Brownian motion
Increasing partial sums of nonnegative measurable terms converge in expectation to the expectation of their sum. Monotone convergence for the integral
Almost-sure convergence under an integrable dominating random variable passes to expectations. Dominated convergence
AC is inherited through the Brownian-motion, strong-solution and stochastic-integral interfaces [F1], [F4]–[F6], and [F8]; no selection is made in the error estimate. The Axiom of Choice
Proof
Put and on each active interval , and put and there. Values at the countable grid endpoints do not affect time or It^o integrals. Each coefficient step is predictable by [F4]; the countable sum is predictable. Growth [F1], , and [F3] give . Truncating after the first intervals gives finite-step integral identities by [F4]. Their integrands converge in to the full coefficients: the tail vanishes almost surely because , and the increasing partial energy sums converge to the integrable total energy by [F9], so the expected tail energy tends to zero. Isometry [F6] and Cauchy–Schwarz for the drift pass these identities to the limit. Combining with the strong-solution identity gives , where denotes column .
On interval , put , , and . The interpolation increment is . Its drift contribution is . For the diffusion put . Each entry is the stopped It^o integral of ; [F4], [F6], and [F8] imply . Therefore . Sum over using [F9], , the growth bound [F1], and moment bound [F3]: , where is independent of the controller and mesh; here .
The state-Lipschitz and time-modulus bounds in [F1], together with , imply for a constant fixed by the coefficient bounds, . Since and [F3] bounds , the time-modulus term has integral at most .
Put . The moment bounds [F3] and [F5], with [F10], make finite and continuous: pathwise running suprema are continuous and dominated by the integrable variable . Apply Cauchy–Schwarz to the drift in step 1.1 and [F8] to each scalar diffusion coordinate, using . Then . Insert steps 1.2 and 1.3 and use to obtain , with constants independent of the controller and mesh. Gronwall [F7] gives , hence also .
The pathwise inequality and step 2.1 give at each random grid endpoint. The constant does not depend on , the lower step lengths, or the controller. The endpoint-refinement mode of [F2] does not meet the predictability hypothesis and is not covered. This proof claims no asymptotic cost law. AC is used only through [A1].
Depends on
- Euler–Maruyama on a predictable grid with bridge-refinement status
- Euler–Maruyama recursion
- Predictable stopping-time grid
- $d$-dimensional Brownian motion
- Itô SDE data and strong solution
- Global strong well-posedness for Lipschitz Itô SDEs
- Uniform second moment for Euler–Maruyama on predictable grids
- Itô integral of a step on a stopping-time interval
- Ito isometry and linearity in predictable L2
- Doob maximal bound for the Ito integral
- Gronwall's integral inequality with variable and constant coefficients
- Monotone convergence for the integral
- Dominated convergence
- The Axiom of Choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
86 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
- Desmond J. Higham, Xuerong Mao, and Andrew M. Stuart, Strong Convergence of Euler-Type Methods for Nonlinear Stochastic Differential Equations, §2, Theorem 2.2 and proof (standard reference, not scraped)
- Simo Särkkä and Arno Solin, Applied Stochastic Differential Equations, §8.2, Algorithm 8.1 (standard reference, not scraped)