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 under Higham–Mao–Stuart hypotheses

Statement

Assume AC. Let d,m≥1 be finite, fix T>0, and work on a complete filtered probability space whose filtration is right-continuous and contains every P-null subset of F in F0. Let W=(Wt)0≤t≤T be an adapted standard m-dimensional Brownian motion whose increments are independent of the current filtration. Let X0 be finite and F0-measurable, independent of σ(Wt−W0:0≤t≤T). Use Euclidean state norms and the Frobenius matrix norm. Consider the autonomous SDE Xt=X0+∫0tf(Xs) ds+∫0tg(Xs) dWs,Xt∈Rd, where f:Rd→Rd and g:Rd→Rd×m are C1. Assume that constants μ,c,D≥0 and an integer q≥1 satisfy, for all x,y∈Rd, ⟨x−y,f(x)−f(y)⟩≤μ∣x−y∣2,∥g(x)−g(y)∥F2≤c∣x−y∣2, and ∣f(x)−f(y)∣2≤D(1+∣x∣q+∣y∣q)∣x−y∣2. For each 0<h≤1 with N=T/h∈N, let Yh be the continuous Euler–Maruyama interpolation and Yˉh its left-endpoint step process from Autonomous Euler–Maruyama scheme and interpolation. Assume that an exact strong solution X and these exact, step and continuous Euler processes have uniformly bounded moments of every finite order on [0,T]: for every p≥1, Esup⁡t≤T∣Xt∣p+sup⁡0<h≤1, T/h∈N(Esup⁡t≤T∣Yth∣p+Esup⁡t≤T∣Yˉth∣p)<∞. Then a constant C, independent of h, satisfies Esup⁡0≤t≤T∣Xt−Yth∣2≤Ch. In particular the grid-point root-mean-square error is O(h1/2). The all-moment premise is part of this source contract; X0∈L2 alone does not imply it.

Facts & Assumptions

Given: AC; finite d,m; T>0; the stated Brownian and coefficient hypotheses; an exact strong solution X; and the uniform all-moment bounds in the Statement.

[F1]

The autonomous Euler algorithm returns the grid recursion, left-endpoint step process, and continuous interpolation using Yt=Yk+f(Yk)(t−tk)+g(Yk)(Wt−Wtk); endpoint values agree with the recursion. Autonomous Euler–Maruyama scheme and interpolation

[F2]

For every even integer r≥2, the autonomous Euler interpolation increment satisfies sup⁡t≤TE∣Yt−Yˉt∣r≤Crhr/2 under the all-moment and coefficient premises stated in that lemma. All-moment Euler interpolation increment bound under autonomous hypotheses

[F3]

For a finite-dimensional continuous Brownian Itô process and F∈C1,2, Itô's formula has drift ∂tF+b⋅∇F+12(σσT):D2F and stochastic term ∇F σ dW. Multidimensional Ito formula for Brownian-driven processes

[F4]

For a finite-energy m-dimensional Brownian Itô integral Nt=∑j∫0tKsj dWsj, Esup⁡t≤T∣Nt∣≤16m E(∫0T∑j∣Ksj∣2ds)1/2. An L1 maximal bound for finite-energy Brownian Itô integrals

[F5]

If U,V∈L2, then E∣UV∣≤(EU2)1/2(EV2)1/2. Cauchy-Schwarz for random variables

[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]

A finite-dimensional continuous Brownian Itô process is an adapted continuous solution of its coordinatewise drift-plus-Itô-integral equation on the given usual filtered space. Continuous Brownian Ito processes

[F8]

Tonelli's theorem interchanges expectation and time integration for the nonnegative measurable drift and diffusion-error terms used below. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[A1]

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

Proof

1.1F1F3F7given

Induction in the recursion shows that Ykh is Ftk-measurable: this holds for Y0=X0, and each update uses Ftk-measurable coefficients and a Brownian increment measurable at tk+1. The interpolation is therefore adapted and continuous. For integration use the predictable step representative Y^0h=Y0 and Y^sh=Ykh on (tk,tk+1]; its coefficient processes f(Y^h) and g(Y^h) are predictable because each Ykh is Ftk-measurable and f,g are continuous. It agrees with Yˉh outside the finite set of grid times. The recursion and interpolation give the same integral equation with these predictable coefficients. Setting y=0 in the coefficient inequalities yields ∣f(x)∣2≤2∣f(0)∣2+2D(1+∣x∣q)∣x∣2 and ∥g(x)∥F2≤2∥g(0)∥F2+2c∣x∣2. The all-moment premise thus gives finite expected time-integral energy for these Euler coefficients; it gives the same for f(X) and g(X). The definition [F7] then makes the Euler interpolation and exact solution continuous Brownian Itô processes, and its linear-combination clause makes their difference e one as well. In Itô's formula for ∣et∣2, the drift is 2⟨et,f(Xt)−f(Y^th)⟩+∥Gt∥F2 and the martingale term is Mt=2∑j=1m∫0t⟨es,Gs,⋅j⟩ dWsj, where Gs=g(Xs)−g(Y^sh). Since e is continuous adapted and G is predictable, each martingale integrand is predictable. Its finite expected energy follows from ∑j∣2⟨es,Gs,⋅j⟩∣2≤4∣es∣2∥Gs∥F2 and E∫0T∣es∣2∥Gs∥F2ds≤T(Esup⁡s≤T∣es∣4)1/2(Esup⁡s≤T∥Gs∥F4)1/2<∞ by the all-moment and coefficient-growth premises.

1.2F2F5F8givenalgebra

Split the drift difference at Yth. The one-sided Lipschitz bound and 2ab≤a2+b2 give 2⟨e,f(X)−f(Y^)⟩≤(2μ+1)∣e∣2+∣f(Y)−f(Y^)∣2 almost everywhere in time. The polynomial local-Lipschitz condition bounds the final term by D(1+∣Y∣q+∣Y^∣q)∣Y−Y^∣2. Also, splitting g(X)−g(Y^) at g(Y) and using its global Lipschitz bound gives ∥G∥F2≤2c∣e∣2+2c∣Y−Y^∣2. By [F2] with r=2,4, the all-moment premise, and [F5], E∣Ys−Y^s∣2≤Ch and E[(1+∣Ys∣q+∣Y^s∣q)∣Ys−Y^s∣2]≤Ch for almost every s, uniformly in h. Tonelli [F8] then bounds the expected integrated drift by C∫0tE∣es∣2 ds+Ch.

1.3F2F4F5F8givenalgebra

Apply [F4] to the vector integrand Ksj=2⟨es,Gs,⋅j⟩. Since ∑j∣Ksj∣2≤4∣es∣2∥Gs∥F2, Esup⁡s≤t∣Ms∣≤32m E[sup⁡s≤t∣es∣(∫0t∥Gs∥F2ds)1/2]≤32m(v(t) E∫0t∥Gs∥F2ds)1/2, where v(t)=Esup⁡s≤t∣es∣2. From [F2], Tonelli [F8], and the Lipschitz estimate for g, E∫0t∥Gs∥F2 ds≤C∫0tE∣es∣2 ds+Ch. Young's inequality therefore bounds the martingale term by 12v(t)+C∫0tv(s) ds+Ch.

2.1F6step 1.1step 1.2step 1.3algebra

Take the supremum over times up to t in Itô's identity from step 1.1, take expectations, and insert the drift estimate from step 1.2 and martingale estimate from step 1.3. Moving 12v(t) to the left gives v(t)≤C∫0tv(s) ds+Ch. The all-moment assumption makes v finite; pathwise continuity of e and dominated convergence make v continuous. Applying [F6] with the nondecreasing constant term Ch yields v(T)≤C′h. The constants depend on T,d,m,μ,c,D,q and the all-moment bounds, but not on h.

3.1A1step 2.1∎

Since YTh=YNh, the grid endpoint is included in the supremum bound. Taking square roots gives the stated root-mean-square order. AC is inherited exactly through [A1]; no choice principle is used in the numerical estimates.

Remarks

This is the autonomous all-moment Higham–Mao–Stuart route. It does not replace the separate finite-L2 theorem, does not extend to nonautonomous coefficients, and does not derive its all-moment premise from X0∈L2. The local proof uses [F4], whose L1 maximal estimate is proved from the published L2 Doob inequality and stopping identity; no unproved Burkholder–Davis–Gundy supplier is imported.

Depends on

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