Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generated
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 [0,T]: 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 X 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 N<∞ almost surely and step lengths bounded by a deterministic 0<h≤T (one may take h=min⁡{hmax⁡,T}). 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 N≤B. Then there is a finite constant C, depending only on T, the coefficient bounds, m, and E∣X0∣2, such that sup⁡0≤t≤TE∣Xt−Yt∣2≤Ch. Thus the one-time root-mean-square error is O(h1/2), 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 N<∞ almost surely and step lengths bounded by a deterministic 0<h≤T; and its complete Euler interpolation Y.

[F1]

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

[F2]

On a predictable interval of length hn, the adaptive update is Yn+1=Yn+b(τn,Yn)hn+σ(τn,Yn)(Wτn+1−Wτn), with the corresponding continuous left-endpoint interpolation. Euler–Maruyama on a predictable grid with bridge-refinement status Predictable stopping-time grid

[F3]

The complete interpolation has Esup⁡t≤T∣Yt∣2≤C0 with C0 independent of the controller and mesh. Uniform second moment for Euler–Maruyama on predictable grids

[F4]

For a square-integrable Fτ-measurable coefficient on a stopping interval (τ,σ], its It^o integral is the coefficient times Wt∧σ−Wt∧τ. Itô integral of a step on a stopping-time interval

[F5]

A strong solution exists and Esup⁡t≤T∣Xt∣2<∞ under the global Lipschitz and linear-growth hypotheses. Global strong well-posedness for Lipschitz Itô SDEs

[F6]

For a scalar predictable H and scalar Brownian coordinate Wj, E(∫0tHs dWsj)2=E∫0tHs2ds. Ito isometry and linearity in predictable L2

[F7]

If u(t)≤A+C∫0tu(s)ds for continuous nonnegative u, then u(t)≤AeCt. Gronwall's integral inequality with variable and constant coefficients

[F8]

For each scalar Brownian coordinate and predictable square-integrable H, Esup⁡t≤T∣∫0tHs dWsj∣2≤4E∫0THs2ds. Doob maximal bound for the Ito integral d-dimensional Brownian motion

[F9]

Increasing partial sums of nonnegative measurable terms converge in expectation to the expectation of their sum. Monotone convergence for the integral

[F10]

Almost-sure convergence under an integrable dominating random variable passes to expectations. Dominated convergence

[A1]

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

1.1F1F3F4F5F6F9given

Put η(s)=τn and Yˉs=Yn on each active interval τn<s≤τn+1, and put bˉs=b(τn,Yn) and σˉs=σ(τn,Yn) 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], ∑n<Nhn=T, and [F3] give E∫0T(∣bˉs∣2+∥σˉs∥F2)ds<∞. Truncating after the first k intervals gives finite-step integral identities by [F4]. Their integrands converge in L2(ds dP) to the full coefficients: the tail vanishes almost surely because N<∞, 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 et:=Xt−Yt=∫0t(b(s,Xs)−bˉs)ds+∑j=1m∫0t(σ⋅j(s,Xs)−σˉ⋅j,s)dWsj, where σ⋅j denotes column j.

1.2F1F3F4F6F8F9givenalgebra

On interval n, put bn=b(τn,Yn), σn=σ(τn,Yn), and hn=τn+1−τn. The interpolation increment is Ys−Yˉs=bn(s−τn)+σn(Ws−Wτn). Its drift contribution is ∫τnτn+1∣bn∣2(s−τn)2ds=13∣bn∣2hn3≤13h2∣bn∣2hn. For the diffusion put Msn=σn(Ws∧τn+1−Ws∧τn). Each entry is the stopped It^o integral of σnij1(τn,τn+1]; [F4], [F6], and [F8] imply Esup⁡s≤T∣Msn∣2≤4mE[∥σn∥F2hn]. Therefore E∫τnτn+1∣σn(Ws−Wτn)∣2ds≤4mhE[∥σn∥F2hn]. Sum over n using [F9], ∑n<Nhn=T, the growth bound [F1], and moment bound [F3]: ∫0TE∣Ys−Yˉs∣2ds≤C1h, where C1 is independent of the controller and mesh; here h2≤Th.

1.3F1F3algebra

The state-Lipschitz and time-modulus bounds in [F1], together with ∣Xs−Yˉs∣≤∣es∣+∣Ys−Yˉs∣, imply for a constant C2 fixed by the coefficient bounds, ∣b(s,Xs)−b(η(s),Yˉs)∣2+∥σ(s,Xs)−σ(η(s),Yˉs)∥F2≤C2(∣es∣2+∣Ys−Yˉs∣2+(1+∣Yˉs∣2)(s−η(s))). Since s−η(s)≤h and [F3] bounds Esup⁡s≤T∣Ys∣2, the time-modulus term has integral at most C3h.

2.1F3F5F7F8F10step 1.1step 1.2step 1.3given

Put v(t)=Esup⁡r≤t∣er∣2. The moment bounds [F3] and [F5], with [F10], make v finite and continuous: pathwise running suprema are continuous and dominated by the integrable variable 2sup⁡r≤T(∣Xr∣2+∣Yr∣2). Apply Cauchy–Schwarz to the drift in step 1.1 and [F8] to each scalar diffusion coordinate, using ∣∑j=1mzj∣2≤m∑j=1m∣zj∣2. Then v(t)≤2T∫0tE∣b(s,Xs)−bˉs∣2ds+8m∫0tE∥σ(s,Xs)−σˉs∥F2ds. Insert steps 1.2 and 1.3 and use E∣es∣2≤v(s) to obtain v(t)≤C4∫0tv(s)ds+C5h, with constants independent of the controller and mesh. Gronwall [F7] gives v(T)≤C5eC4Th, hence also sup⁡t≤TE∣et∣2≤Ch.

3.1A1F2step 2.1given∎

The pathwise inequality ∣eτn∣2≤sup⁡t≤T∣et∣2 and step 2.1 give E∣eτn∣2≤Ch at each random grid endpoint. The constant does not depend on N, 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

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