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 uniform moments and interpolation increments
Statement
Assume the coefficient, filtered Brownian-motion, and initial-value hypotheses of Euler–Maruyama recursion on a uniform grid with and , with for a fixed finite . Let , , and be the recursion, step process, and continuous interpolation of Euler–Maruyama step process and continuous interpolation. Then the step process has a predictable representative, the interpolation formula is well-defined, and is adapted and continuous. There is a constant independent of such that For every , These are pointwise-in-time moment bounds; no claim is made about . The estimates hold under the shared half-Hölder time-modulus contract, although this proof uses only the uniform linear-growth bound and the Brownian increment assumptions.
Facts & Assumptions
Given: The Axiom of Choice; finite ; ; with a positive integer; the coefficient assumptions of Euler–Maruyama recursion; an adapted standard -dimensional Brownian motion whose increments are independent of the current filtration; and an -measurable with .
The recursion step is . Euler–Maruyama recursion
A single step satisfies the conditional p-moment and interpolation increment estimates under the stated linear-growth bound. Euler–Maruyama one-step moment and increment estimates
The step process and continuous interpolation use the left endpoint on each interval, with the continuous formula . Euler–Maruyama step process and continuous interpolation
For every real , . for every real , hence
A finite-step predictable integrand with square-integrable coefficients has an Itô integral version equal to its finite sum, even when those coefficients are unbounded. A square-integrable predictable step Itô integral is its finite sum
Brownian increments of length have law . -dimensional Brownian motion
Predictable square-integrable coefficient processes have well-defined finite-coordinate Itô integrals; predictable step processes use the left-endpoint filtration convention. Progressively measurable and predictable processes Ito integral for square-integrable predictable processes
The Axiom of Choice is included only because the Brownian-motion and Itô-integral interfaces in [F3] and [F4] adopt it. No arbitrary-index choice is used in the moment or increment estimates. The Axiom of Choice
Proof
The recursion starts from . If is -measurable and in , the one-step estimate [L2] applies with and , so is in . Since is measurable at and independent of , the recursion also makes -measurable. Induction gives adapted grid values with finite th moments.
In particular the grid values are square-integrable. On each interval, and the coefficient vectors and are -measurable. The growth bound gives Each scalar coordinate integrand is therefore predictable and square-integrable, although its coefficients need not be bounded. By [F3], its Itô integral has the finite-sum version; the ordinary drift integral is the corresponding finite sum as well. These are exactly the recursion and interpolation formulas in [L1]. For each , is -measurable and is -measurable, so the interpolation is adapted. Brownian path continuity and the endpoint recursion make it continuous.
Put . The one-step estimate [L2] gives , hence . Iteration and [F2] yield . This bound is uniform in and .
For , apply [L2]'s first one-step estimate with and to obtain . The step process equals there. The grid estimate from step 2.2 therefore gives the two asserted uniform pointwise moment bounds; at , is covered by the grid bound.
With , [L2]'s second one-step estimate gives on each grid interval. Taking expectations, using step 2.2, and using proves . At grid endpoints the difference is zero by [L1].
The induction and estimates use only finite Brownian increments and the explicitly given hypotheses; [A1] is inherited from the interfaces, not spent as a choice principle. A conclusion for a larger requires ; it does not follow from alone.
Remarks
The half-Hölder time modulus is retained because this pair shares its coefficient contract with later Euler error results. The present moment and increment estimates do not use that modulus, and they do not imply a strong or weak convergence rate.
Depends on
- Euler–Maruyama recursion
- Euler–Maruyama step process and continuous interpolation
- Euler–Maruyama one-step moment and increment estimates
- The Axiom of Choice
- $d$-dimensional Brownian motion
- Ito integral for square-integrable predictable processes
- Progressively measurable and predictable processes
- A square-integrable predictable step Itô integral is its finite sum
- $1+x\le\exp(x)$ for every real $x$, hence $(1-p)^m\le\exp(-mp)$
Used by
- A superlinear drift outside the Euler–Maruyama moment contract Example
- A verified weak-order contract for the Ornstein–Uhlenbeck process Example
- Euler–Maruyama for a constant-coefficient additive-noise equation Example
- Euler–Maruyama strong rate for square-integrable initial data Theorem
- Euler–Maruyama weak order one under backward regularity Theorem
Cited to discharge well-definedness by Euler–Maruyama step process and continuous interpolation.
Dependency tree · two levels
48 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)