Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-luna)
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 strong rate for square-integrable initial data

Statement

Assume the Axiom of Choice. Let d,m≥1 be finite, fix T>0, and work on the complete usual filtered probability space of Itô SDE data and strong solution. Let 0<h≤1 with N=T/h∈N. Use Euclidean state norms and the Frobenius matrix norm. Let W be an adapted standard m-dimensional Brownian motion whose increments are independent of the current filtration. Let b:[0,T]×Rd→Rd and σ:[0,T]×Rd→Rd×m be jointly Borel, and suppose finite nonnegative constants L,K satisfy, for all s,t∈[0,T] and x,y∈Rd, ∣b(t,x)−b(t,y)∣+∥σ(t,x)−σ(t,y)∥F≤L∣x−y∣, ∣b(t,x)∣2+∥σ(t,x)∥F2≤K2(1+∣x∣2), and ∣b(t,x)−b(s,x)∣+∥σ(t,x)−σ(s,x)∥F≤K(1+∣x∣)∣t−s∣1/2. Let X0 be F0-measurable, independent of σ(Wt−W0:0≤t≤T), with E∣X0∣2<∞. Let X be the exact continuous strong solution with Esup⁡t≤T∣Xt∣2<∞, and let Yh,Yˉh be the continuous Euler interpolation and left-endpoint step process of Euler–Maruyama step process and continuous interpolation. The uniform pointwise moment and interpolation-increment bounds of Euler–Maruyama uniform moments and interpolation increments then imply that a constant C, independent of h, satisfies Esup⁡0≤t≤T∣Xt−Yth∣2≤Ch. Thus the grid-point root-mean-square error is O(h1/2). The constant may depend on T,d,m,L,K and the exact-solution supremum-moment bound supplied by the P-SDE-01 existence theorem.

Facts & Assumptions

Given: AC; finite d,m; the stated horizon, Brownian, coefficient and initial-value hypotheses; the exact strong solution X and its finite supremum second moment; and the Euler recursion/interpolation.

[F1]

The continuous Euler interpolation is Yt=Yk+b(tk,Yk)(t−tk)+σ(tk,Yk)(Wt−Wtk) on [tk,tk+1], with Ytk=Yk and left-endpoint step process Yˉt=Yk on [tk,tk+1). Euler–Maruyama step process and continuous interpolation

[F2]

Under the stated global Lipschitz, linear-growth, half-Hölder time, Brownian-increment and initial-value conditions, sup⁡t≤TE∣Yˉt∣2 and sup⁡t≤TE∣Yt∣2 are bounded uniformly in h, and sup⁡t≤TE∣Yt−Yˉt∣2≤Ch. Euler–Maruyama uniform moments and interpolation increments

[F3]

For each scalar Brownian integral Mt=∫0tHs dBs with finite energy, Esup⁡t≤T∣Mt∣2≤4E∫0THs2ds. Doob maximal bound for the Ito integral

[F4]

For a finite-dimensional continuous Brownian Itô process, its component processes have the coordinatewise drift and Brownian-integral representation stated in the definition. Continuous Brownian Ito processes

[F5]

Stopping a finite-energy Brownian Itô integral at a stopping time agrees with integrating its predictable stopped integrand. Stopping an Ito integral

[F6]

If v(t)≤A+∫0tBv(s) ds for nonnegative continuous v and constants A,B≥0, then v(t)≤AeBt. Gronwall's integral inequality with variable and constant coefficients

[F7]

The stated squared growth bound implies ∣b(t,x)∣+∥σ(t,x)∥F≤2K(1+∣x∣); with the global Lipschitz, usual-filtration and initial-value conditions, the P-SDE-01 theorem supplies a unique exact strong solution and Esup⁡t≤T∣Xt∣2<∞. Itô SDE data and strong solution Global strong well-posedness for Lipschitz Itô SDEs

[F8]

A map ρ is a stopping time when {ρ≤t}∈Ft for every t≥0. Continuous-time stopping times and stopped sigma-algebras

[F9]

For a continuous adapted process, the supremum on [0,t] equals the supremum over rational times in [0,t] together with t, and is Ft-measurable. The rationals embed densely in the reals

[F10]

Cauchy–Schwarz for time integrals gives ∣∫0tus ds∣2≤t∫0t∣us∣2ds. Holder's inequality for integrals, including the endpoint cases

[F11]

If ZR↑Z are nonnegative measurable random variables, then EZR↑EZ. Monotone convergence for the integral

[F12]

Tonelli's theorem exchanges time integration and expectation for nonnegative measurable integrands. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[A1]

AC is stated because the SDE, Brownian, Itô-integral and maximal-inequality interfaces in [F3]–[F7] adopt it. The Axiom of Choice

Proof

Given: AC; finite d,m; the stated horizon, Brownian, coefficient and initial-value hypotheses; the exact strong solution X and its finite supremum second moment; and the Euler recursion/interpolation.

[F1] The continuous Euler interpolation is Yt=Yk+b(tk,Yk)(t−tk)+σ(tk,Yk)(Wt−Wtk) on [tk,tk+1], with Ytk=Yk and left-endpoint step process Yˉt=Yk on [tk,tk+1). Euler–Maruyama step process and continuous interpolation

[F2] Under the stated global Lipschitz, linear-growth, half-Hölder time, Brownian-increment and initial-value conditions, sup⁡t≤TE∣Yˉt∣2 and sup⁡t≤TE∣Yt∣2 are bounded uniformly in h, and sup⁡t≤TE∣Yt−Yˉt∣2≤Ch. Euler–Maruyama uniform moments and interpolation increments

[F3] For each scalar Brownian integral Mt=∫0tHs dBs with finite energy, Esup⁡t≤T∣Mt∣2≤4E∫0THs2ds. Doob maximal bound for the Ito integral

[F4] For a finite-dimensional continuous Brownian Itô process, its component processes have the coordinatewise drift and Brownian-integral representation stated in the definition. Continuous Brownian Ito processes

[F5] Stopping a finite-energy Brownian Itô integral at a stopping time agrees with integrating its predictable stopped integrand. Stopping an Ito integral

[F6] If v(t)≤A+∫0tBv(s) ds for nonnegative continuous v and constants A,B≥0, then v(t)≤AeBt. Gronwall's integral inequality with variable and constant coefficients

[F7] The stated squared growth bound implies ∣b(t,x)∣+∥σ(t,x)∥F≤2K(1+∣x∣); with the global Lipschitz, usual-filtration and initial-value conditions, the P-SDE-01 theorem supplies a unique exact strong solution and Esup⁡t≤T∣Xt∣2<∞. Itô SDE data and strong solution Global strong well-posedness for Lipschitz Itô SDEs

[F8] A map ρ is a stopping time when {ρ≤t}∈Ft for every t≥0. Continuous-time stopping times and stopped sigma-algebras

[F9] For a continuous adapted process, the supremum on [0,t] equals the supremum over rational times in [0,t] together with t, and is Ft-measurable. The rationals embed densely in the reals

[F10] Cauchy–Schwarz for time integrals gives ∣∫0tus ds∣2≤t∫0t∣us∣2ds. Holder's inequality for integrals, including the endpoint cases

[F11] If ZR↑Z are nonnegative measurable random variables, then EZR↑EZ. Monotone convergence for the integral

[F12] Tonelli's theorem exchanges time integration and expectation for nonnegative measurable integrands. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[A1] AC is stated because the SDE, Brownian, Itô-integral and maximal-inequality interfaces in [F3]–[F7] adopt it. The Axiom of Choice

1.1F1F2F4F5F7F8F9F12given

By [F4] and [F7], the exact process has its finite-coordinate Itô representation; [F1] supplies the Euler interpolation and its predictable representative Yˉ− with left-endpoint map ηh−. Use that representative in the Euler integral form: Xt=X0+∫0tb(s,Xs)ds+∫0tσ(s,Xs)dWs, Yth=X0+∫0tb(ηh−(s),Yˉs−)ds+∫0tσ(ηh−(s),Yˉs−)dWs. The grid-valued coefficients are predictable on (tk,tk+1]; the grid coefficient energy is a finite sum bounded by [F2], while Tonelli [F12] and the stated Esup⁡∣X∣2 bound give finite expected energy for the exact coefficients. Thus these are the required integral representations. In subsequent estimates, Yˉ and ηh may replace their predictable versions because they differ only at finitely many grid times, which do not affect the integrals. For R>0 define τR=inf⁡{t≤T:∣et∣≥R}∧T, with inf⁡∅=∞. For t<T, {τR≤t}={sup⁡s≤t∣es∣≥R}, which is in Ft by continuity and [F9]; for t≥T the event is all of Ω. Thus [F8] makes τR a stopping time. Subtracting the displays and using [F5] gives the stopped error as the sum of the two stopped coefficient integrals.

1.2F1F2F10F12givenalgebra

Put δbs=b(s,Xs)−b(ηh(s),Yˉs),δσs=σ(s,Xs)−σ(ηh(s),Yˉs). The state Lipschitz bounds, time modulus, and ∣Xs−Yˉs∣≤∣es∣+∣Ysh−Yˉs∣ give ∣δbs∣2+∥δσs∥F2≤C(∣es∣2+∣Ysh−Yˉs∣2+h(1+∣Yˉs∣2)). Consequently, with vR(t)=Esup⁡s≤t∣es∧τR∣2, Tonelli [F12] and [F2] bound the expected drift-integrand error and the expected squared diffusion-integrand error, after stopping, by C∫0tvR(s)ds+Ch.

2.1F2F3F10F12step 1.2algebra

Cauchy–Schwarz for time integrals bounds the squared supremum of the stopped drift integral by T∫0tE[1{s≤τR}∣δbs∣2]ds. For the vector stochastic integral, write each state coordinate as a sum of the m scalar Brownian integrals and use ∣∑j=1mzj∣2≤m∑j∣zj∣2. Applying [F3] to each scalar term yields the bound 4mE∫0t1{s≤τR}∥δσs∥F2ds. Using Tonelli [F12] and step 1.2 in both bounds gives vR(t)≤C∫0tvR(s)ds+Ch, where C is independent of R and h.

3.1A1F6F11step 2.1given∎

The stopped error is bounded by R, so vR is finite and continuous; applying [F6] to step 2.1 gives vR(T)≤CTh uniformly in R. Since e is continuous on the compact interval, τR=T for all sufficiently large R on each sample path. Taking R=n∈N, the stopped suprema increase to sup⁡s≤T∣es∣2; monotone convergence [F11] yields Esup⁡t≤T∣et∣2≤CTh. Taking square roots gives the grid-point root-mean-square rate. AC enters only through [A1], and no arbitrary-index choice is used in the estimates.

Remarks

The proof is the finite-L2 interpolation-defect route. It uses the pointwise-in-time moment and increment estimates of the scheme supplier; its stopping argument does not assume a path-supremum moment bound for the Euler interpolation. This rate is proved separately from the autonomous Higham–Mao–Stuart all-moment theorem.

Depends on

Used by

Dependency tree · two levels

76 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