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 for a constant-coefficient additive-noise equation
Facts & Assumptions
Given: AC, , for an integer , and . Work on a complete filtered probability space whose filtration is right-continuous and contains every null subset in . Let be a scalar standard Brownian motion adapted to this filtration, with independent of for every . Take and .
The Euler–Maruyama step is . Euler–Maruyama recursion
On , the interpolation is . Euler–Maruyama step process and continuous interpolation
The uniform-moment theorem bounds whenever . Euler–Maruyama uniform moments and interpolation increments
The Itô integral of the constant integrand equals the Brownian increment. Ito integral for square-integrable predictable processes
A strong solution is an adapted continuous process satisfying the finite-coordinate Itô equation indistinguishably. Itô SDE data and strong solution
The finite-energy Itô-integral process has a continuous martingale version, and any two such continuous versions agree at all times on a measurable probability-one event. The Ito integral process has a continuous martingale version
AC is inherited from the Brownian-motion and Itô-integral interfaces; the explicit calculation below makes no choice. The Axiom of Choice
Example
Consider the scalar additive-noise equation on . The coefficients are constant, and for each the uniform mesh has steps of length .
Verification
The functions and are jointly Borel, globally Lipschitz in state with constant , and satisfy the stated linear-growth bound with a finite . Their time increments vanish, so the required half-Hölder time modulus holds. The deterministic initial value is -measurable, independent of future Brownian increments, and has every finite moment.
From [F1], induction gives . Substituting the coefficients into [F2] gives on every interval. By [F4], at every fixed time the candidate path satisfies the integral equation. The continuous-version theorem [F6] and equality at all rational times identify these processes indistinguishably; hence [F5] makes this adapted continuous candidate a strong solution. Any strong solution with the same data equals directly from the constant-coefficient equation, so this is the exact path.
The initial value has every finite moment. Applying [F3] for each finite therefore proves finite moments of the grid, step, and interpolated processes uniformly in and . The explicit identity from step 1.2 also identifies the exact path. AC in [A1] is inherited from the cited interfaces; no choice enters these computations.
Depends on
- Euler–Maruyama recursion
- Euler–Maruyama step process and continuous interpolation
- Euler–Maruyama uniform moments and interpolation increments
- The Axiom of Choice
- $d$-dimensional Brownian motion
- Ito integral for square-integrable predictable processes
- Itô SDE data and strong solution
- The Ito integral process has a continuous martingale version
Used by
Nothing in the library uses this result yet.
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)
- Tiejun Li, Lecture 16: Numerical SDEs: Basics, §1 and §2 (standard reference, not scraped)