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.
Uniform second moment for Euler–Maruyama on predictable grids
Statement
Work on a filtered probability space satisfying the usual conditions for the It^o integral. Assume the coefficient and Brownian hypotheses of Euler–Maruyama recursion on : finite state/noise dimensions, a square integrable -measurable initial value, globally Lipschitz state dependence, linear growth, and the stated half-Hölder time modulus. Let a finite predictable grid as in Predictable stopping-time grid have almost surely and maximum step at most . Form the complete continuous Euler interpolation by applying the predictable-grid updates in Euler–Maruyama on a predictable grid with bridge-refinement status on every interval. A finite-budget execution returns this interpolation as complete when its budget satisfies . Then a finite constant satisfies The bound is uniform over the controller and the number and placement of its predictable steps; no deterministic bound on is needed for this moment estimate.
Facts & Assumptions
Given: AC; the usual filtered-space hypotheses for the It^o integral; the global Lipschitz, linear-growth and time-modulus hypotheses of Euler–Maruyama recursion; ; a finite predictable grid with almost surely and maximum step at most ; and its complete continuous Euler interpolation .
The update on each interval is , with coefficients measurable at . Euler–Maruyama on a predictable grid with bridge-refinement status Predictable stopping-time grid
Stopping a locally square-integrable predictable It^o integral at a stopping time is the same as integrating the predictable integrand multiplied by . Stopping an Ito integral
A square-integrable coefficient measurable at on a stopping-time interval gives a predictable step whose It^o integral is the stopped Brownian increment times that coefficient. Itô integral of a step on a stopping-time interval
For a scalar Brownian It^o integral , . Doob maximal bound for the Ito integral
The coefficient growth condition gives . Euler–Maruyama recursion
If a continuous nonnegative satisfies , then . Gronwall's integral inequality with variable and constant coefficients
If almost surely and , then . Fatou's lemma
For a continuous adapted path, the running supremum is measurable from its values on a dense countable time set; this makes the first hitting time of a closed level a stopping time. Continuous-time stopping times and stopped sigma-algebras The rationals embed densely in the reals
If measurable random variables converge almost surely and are dominated in absolute value by an integrable random variable, their expectations converge. Dominated convergence
AC is inherited through the Brownian and It^o-integral interfaces [F1]–[F4]. The stopping and localization argument uses no further choice. The Axiom of Choice
Proof
For define , taking if the set is empty. For an integer , set and . Continuity, adaptedness and [F8] make a stopping time, so is a stopping time. For the first intervals, multiply each left-endpoint coefficient by . These factors are measurable at , the truncated coefficients are in by [F5], and they agree with the original coefficients before , except at time endpoints which do not affect the integrals. Thus [F3] gives their finite-step integral representation, to which [F2] applies. Before , every active left-endpoint value is bounded by ; [F5] and therefore give finite expected coefficient energy. Applying [F2] at to the finite-step integral representation yields , where , and on active intervals, with arbitrary values at . Also , so is finite and continuous by [F9], since the path suprema converge pointwise with and are bounded by the integrable variable .
Write each coordinate of the stopped martingale as , with . For every , [F4] applies to the scalar Brownian coordinate . The inequalities and give the martingale bound . Cauchy–Schwarz bounds the squared drift supremum by . On an active interval with , its left endpoint satisfies , so and . Outside this range the stopped-integral indicator is zero; using [F5] in the representation of step 1.1 yields .
Apply [F6] to with and . Then , uniformly in .
Since almost surely, for almost every path for all sufficiently large . Thus eventually equals uniformly on ; [F7] passes the bound of step 3.1 to . Each continuous path is bounded on , so uniformly almost surely as , and [F7] gives the stated bound. The cases or are covered by the same inequality, and no lower mesh bound or deterministic bound on is used. AC is inherited only through [A1].
Depends on
- Euler–Maruyama on a predictable grid with bridge-refinement status
- Euler–Maruyama recursion
- Predictable stopping-time grid
- Itô integral of a step on a stopping-time interval
- Stopping an Ito integral
- Doob maximal bound for the Ito integral
- Ito isometry and linearity in predictable L2
- Gronwall's integral inequality with variable and constant coefficients
- Fatou's lemma
- Dominated convergence
- Continuous-time stopping times and stopped sigma-algebras
- The rationals embed densely in the reals
- The Axiom of Choice
Used by
Dependency tree · two levels
66 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 (standard reference, not scraped)
- Simo Särkkä and Arno Solin, Applied Stochastic Differential Equations, §8.2 (standard reference, not scraped)