Alphabeta Math
Pipeline-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.

Euler–Maruyama Strong and Weak Convergence

1 · Prerequisites

2 · Summary

This page separates three Euler–Maruyama error contracts. Under global state Lipschitz, linear growth, a half-Hölder time modulus and only a finite second moment at the start, the continuous interpolation has mean-square supremum error O(h), hence root-mean-square error O(h1/2). A separate autonomous Higham–Mao–Stuart theorem gives the same rate under its one-sided-Lipschitz, polynomial-local-Lipschitz and all-moment premises. Weak order one is proved conditionally on explicit backward Kolmogorov regularity, mixed derivatives and the p≥2q+8 moment bound. Nested fine/coarse Brownian increments then give correction variance O(h) and cost O(h−1); the bias exponent is 1/2 from the strong contract and improves to 1 only under the weak contract. No theorem here bounds learned-drift or learned-score bias.

3 · Logical flowchart

4 · Definitions, theorems and proofs

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Autonomous Euler–Maruyama scheme and interpolation

Definition

Assume AC. Fix finite integers d,m≥1, T>0, and N≥1 such that h=T/N≤1. Work on a filtered probability space whose filtration is right-continuous and contains every P-null subset of F in F0. Let W be an adapted standard m-dimensional Brownian motion whose increments after time s are independent of Fs. Let X0 be finite, F0-measurable, and independent of σ(Wt−W0:0≤t≤T). Let f:Rd→Rd and g:Rd→Rd×m be C1. Assume finite 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, ∣f(x)−f(y)∣2≤D(1+∣x∣q+∣y∣q)∣x−y∣2. Here ∣⋅∣ is the Euclidean norm and ∥⋅∥F is the Frobenius norm.

Set tk=kh and construct the grid approximation recursively by Y0=X0,Yk+1=Yk+f(Yk)h+g(Yk)(Wtk+1−Wtk),0≤k<N. The output also includes the left-endpoint step process Yˉt=Yk(tk≤t<tk+1),YˉT=YN, and the continuous interpolation Yt=Yk+f(Yk)(t−tk)+g(Yk)(Wt−Wtk)(tk≤t≤tk+1). The recursion makes the two interpolation formulas agree at every shared endpoint. The finite recursion is defined pathwise: C1 coefficients are finite-valued, each Yk is finite almost surely by induction, and Brownian paths are continuous. This algorithm defines no moment or convergence claim.

LemmaStatement: AI-adaptedProof: AI-generatedOpen item page →

An L1 maximal bound for finite-energy Brownian Itô integrals

Statement

Assume AC. Work on a complete filtered probability space (Ω,F,(Ft)0≤t≤T,P) whose filtration is right-continuous and contains every P-null subset of F in F0. Let m≥1 be finite, let W=(W1,…,Wm) be an adapted standard m-dimensional Brownian motion d-dimensional Brownian motion whose increments after time s are independent of Fs, and let H=(H1,…,Hm) be a predictable row-vector process Progressively measurable and predictable processes with E∫0T∥Hs∥22ds<∞. For Mt=∑j=1m∫0tHsj dWsj, the continuous version satisfies Esup⁡0≤t≤T∣Mt∣≤16m E(∫0T∥Hs∥22ds)1/2.

Facts & Assumptions

Given: AC; the complete usual filtered probability space, adapted Brownian motion and increment-independence hypotheses above; and the predictable finite-energy integrand.

[F1]

For a real Brownian Itô integral Nt=∫0tKs dBs with finite energy and Brownian increments independent of the current filtration, Esup⁡t≤T∣Nt∣2≤4E∫0TKs2ds. Doob maximal bound for the Ito integral

[F2]

Stopping a finite-energy Itô integral at a stopping time agrees, up to indistinguishability, with integrating the predictable stopped integrand. Stopping an Ito integral

[F3]

The coordinates of a standard finite-dimensional Brownian motion are independent standard one-dimensional Brownian motions. d-dimensional Brownian motion

[F4]

The predictable sigma-algebra is generated by rectangles (s,u]×C with C∈Fs and by the time-zero sets; for any stopping time ρ, the indicator process 1[0,ρ] is predictable. Progressively measurable and predictable processes Continuous-time stopping times and stopped sigma-algebras Progressively measurable and predictable processes

[F5]

The finite-energy Itô integral is an isometry from predictable L2 into mean-zero L2 random variables. Ito isometry and linearity in predictable L2

[F6]

An elementary predictable integrand has integral equal to its defining finite sum over Brownian increments. Ito integral of an elementary predictable process

[F7]

Bounded elementary predictable integrands are dense in predictable L2([0,T]×Ω). Density of elementary predictable processes in predictable L2

[F8]

For a nonnegative measurable function, the integral over a product space equals either iterated integral; applied to 1{(λ,ω):λ<Z(ω)}, this gives EZ=∫0∞P(Z>λ) dλ. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F9]

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

[F10]

For a continuous adapted real process, its supremum on a compact interval equals its supremum over rational times in the interval together with the right endpoint, and is measurable in the terminal sigma-algebra. The rationals embed densely in the reals

[F11]

Dominated convergence applies to the product-measure limit below: the squared difference of the stopped-interval indicators times H2 tends to zero almost everywhere and is bounded by the integrable function H2. Dominated convergence

[A1]

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

Proof

1.1F1F4given

If T=0, both sides vanish. Henceforth T>0. For stopping-time notation only, extend the filtration by Ft=FT for t>T; it remains complete and right-continuous, and the predictable sigma-algebra on [0,T] is unchanged by [F4]. All Brownian integrals and estimates below are on [0,T]; no Brownian property for this extension after T is asserted or used. First take m=1 and write B=W1. On the common null exceptional set, set M and Q to zero; completeness keeps them adapted and makes their paths continuous everywhere. This changes no integral class. Put Qt=∫0tHs2ds and M∗=sup⁡t≤T∣Mt∣. The continuous version makes M∗ measurable, and [F1] gives E(M∗)2≤4EQT<∞, so EM∗<∞.

1.2givenF4F9F10

Fix λ>0. Let τ be the first time ∣Mt∣≥λ, capped at T, and put Aλ={M∗≥λ}. Continuity and adaptation make τ a stopping time by [F9]–[F10], and Aλ∈Fτ: for each t<T, Aλ∩{τ≤t}={sup⁡s≤t∣Ms∣≥λ}, whose supremum is measurable by [F10]; for t≥T, the intersection is Aλ∈FT⊆Ft by the same terminal supremum fact. Let Rt=Qt−Qt∧τ; this is continuous and adapted. Let σ be its first hitting time of δ2λ2, capped at T; it is a stopping time by [F9]–[F10], where 0<δ≤1/4. The set Aλ∩{τ<s} is the countable union, over rational u>0, of (u,∞)×(Aλ∩{τ≤u}). Each second factor belongs to Fu by Aλ∈Fτ. Thus it is predictable; intersecting with {s≤σ} preserves predictability by [F4].

2.1F1F2F5F6F7F8F11step 1.2algebra

Define Nt=∫0t1Aλ1(τ,σ](s)Hs dBs. For each n, let Gn={jT2−n:0≤j≤2n} and round τ,σ upward to their least grid points τn,σn∈Gn. They are stopping times because {τn≤t}=⋃q∈Gn, q≤t{τ≤q}∈Ft, and likewise for σn; monotonicity of the ceiling map gives τn≤σn and τn↓τ, σn↓σ. Since Aλ∈Fτ and τ≤τn, one has Aλ∈Fτn: for every t, Aλ∩{τn≤t}=(Aλ∩{τ≤t})∩{τn≤t}∈Ft. For an elementary predictable integrand on a refinement of this grid, the coefficient on (tk,tk+1] after multiplying by 1Aλ1(τn,σn] is measurable at tk: the active event {τn≤tk<σn} is in Ftk, and Aλ∩{τn≤tk} is in Ftk. Thus the finite-sum definition [F6] gives ∫0t1Aλ1(τn,σn]Hs dBs=1Aλ(Mt∧σn−Mt∧τn) for elementary H. For general predictable H, approximate in predictable L2 by elementary Hk using [F7]. The isometry [F5] passes the left side to its limit in L2(P), and [F1] applied to Hk−H gives Esup⁡t≤T∣Mtk−Mt∣2→0, passing the stopped evaluations on the right to their limits for this fixed grid. As n→∞, the interval indicators converge outside the graphs of τ and σ, which are dt⊗P-null by Tonelli [F8]. Dominated convergence [F11] with majorant H2 and the isometry [F5] pass the identity to (τ,σ]. Continuity gives convergence of the right side to 1Aλ(Mt∧σ−Mt∧τ) almost surely for each fixed t, proving the required stopped-integral identity entirely on [0,T]. Both sides have continuous versions, so their equality at the countable rational times and continuity give equality up to indistinguishability. The accumulated energy of the integrand is at most δ2λ21Aλ on every path. Thus [F1] gives Esup⁡t≤T∣Nt∣2≤4δ2λ2P(Aλ). On {M∗>2λ, QT1/2<δλ} the threshold defining σ is not reached before T, and after the first hit of λ the continuous path moves by more than λ. Hence sup⁡t≤T∣Nt∣>λ on that event. Markov's inequality and the preceding display yield P(M∗>2λ, QT1/2<δλ)≤4δ2P(M∗≥λ).

3.1F8step 1.1step 2.1algebra

Split the event {M∗>2λ} according to whether QT1/2≥δλ. The bound in step 2.1 gives P(M∗>2λ)≤P(QT1/2≥δλ)+4δ2P(M∗≥λ). For any nonnegative Z, the integrals of 1{λ<Z} and 1{λ≤Z} over λ>0 agree pathwise, since they differ at at most one point. Integrating this inequality over λ>0 and applying Tonelli [F8] to 1{(λ,ω):λ<M∗(ω)} and 1{(λ,ω):λ<QT(ω)1/2} gives EM∗≤2δEQT1/2+8δ2EM∗. With δ=1/4, the last coefficient is 1/2, so EM∗≤16EQT1/2.

4.1A1F3step 3.1algebra∎

For general finite m, write M=∑j=1mMj with Mtj=∫0tHsj dWsj. Apply the scalar result of step 3.1 to each coordinate and then the finite-sum Cauchy–Schwarz inequality pathwise: Esup⁡t≤T∣Mt∣≤16∑j=1mE(∫0T∣Hsj∣2ds)1/2≤16m E(∫0T∑j=1m∣Hsj∣2ds)1/2. This is the claimed estimate. AC enters only through [A1] and the cited Brownian and Itô interfaces.

Source notes

The proof is a local good-lambda derivation from the published L2 Doob maximal bound and a finite-grid proof of the stopped-integral identity on [0,T]. It supplies the L1 maximal estimate used in the H-M-S energy proof; no general BDG theorem is imported without proof.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

All-moment Euler interpolation increment bound under autonomous hypotheses

Statement

Assume the Axiom of Choice, let d,m≥1 be finite, and fix T>0. Work on a complete filtered probability space whose filtration is right-continuous and contains every P-null subset of F in F0. Let W be an adapted standard m-dimensional Brownian motion whose increments after time s are independent of Fs. Let X0 be finite and F0-measurable, and independent of σ(Wt−W0:0≤t≤T). Use the Euclidean state norm and Frobenius matrix norm. Let f:Rd→Rd and g:Rd→Rd×m be autonomous C1 coefficients. Assume finite 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, ∣f(x)−f(y)∣2≤D(1+∣x∣q+∣y∣q)∣x−y∣2. For each 0<h≤1 with N=T/h a positive integer, let Yh be the continuous Euler–Maruyama interpolation and Yˉh its left-endpoint step process from Autonomous Euler–Maruyama scheme and interpolation, using this same W and X0. Assume that for every finite p≥1, sup⁡0<h≤1, T/h∈N(Esup⁡t≤T∣Yth∣p+Esup⁡t≤T∣Yˉth∣p)<∞. Then for every even integer r≥2 there is a finite constant Cr, independent of h, such that sup⁡0≤t≤TE∣Yth−Yˉth∣r≤Crhr/2. The premise is an all-moment premise for this autonomous coefficient class; it does not follow from the finite-L2 moment bound alone.

Facts & Assumptions

Given: AC; finite dimensions d,m; T>0; the stated complete right-continuous filtered space, adapted Brownian motion and initial value; the C1, one-sided-Lipschitz, diffusion-Lipschitz and polynomial drift inequalities in the Statement; 0<h≤1 with T/h∈N; and the uniform all-moment bounds stated there.

[F1]

On [tk,tk+1], the continuous Euler interpolation is Yt=Yk+f(Yk)(t−tk)+g(Yk)(Wt−Wtk), while Yˉt=Yk on [tk,tk+1) and YT=YˉT=YN. Autonomous Euler–Maruyama scheme and interpolation

[F2]

If a Brownian coordinate has increment law N(0,∣t−s∣), then for every integer n≥1 its 2nth absolute moment is (2n−1)!!∣t−s∣n<∞. Gaussian even moments for Brownian increments

[F3]

A standard finite-dimensional Brownian motion has independent coordinates, each a standard one-dimensional Brownian motion; its vector increments have law Nm(0,(t−s)Im). d-dimensional Brownian motion

[A1]

AC is declared because the deterministic Brownian-increment and Gaussian-moment interfaces used in [F2] and [F3] assume it. The Axiom of Choice

Proof

1.1F1algebra

Fix t∈[tk,tk+1) and put rt=Yth−Yˉth and δ=t−tk. By [F1], rt=δf(Ykh)+g(Ykh)(Wt−Wtk). For even r≥2, the finite-dimensional power inequality gives ∣rt∣r≤2r−1(δr∣f(Ykh)∣r+∥g(Ykh)∥Fr∣Wt−Wtk∣r).

2.1givenalgebra

Taking y=0 in the coefficient bounds gives ∣f(x)∣2≤2∣f(0)∣2+2D(1+∣x∣q)∣x∣2,∥g(x)∥F2≤2∥g(0)∥F2+2c∣x∣2. Thus ∣f(x)∣r≤Cr(1+∣x∣(q+2)r/2) and ∥g(x)∥Fr≤Cr(1+∣x∣r). The uniform all-moment premise therefore bounds both coefficient moments in step 1.1 uniformly over h and t.

2.2F2F3given

Each coordinate of Wt−Wtk has the Gaussian law in [F3], so [F2] and the finite-dimensional inequality ∣z∣r≤Cr,m∑j=1m∣zj∣r give E∣Wt−Wtk∣r≤Cr,mδr/2. Since Ykh is Ftk-measurable and Brownian increments are independent of Ftk, conditioning in step 1.1 separates the coefficient factor from this Gaussian moment.

3.1A1F1step 1.1step 2.1step 2.2∎

Using 0≤δ≤h≤1, so δr≤δr/2, steps 1.1, 2.1 and 2.2 yield E∣Yth−Yˉth∣r≤Crhr/2 uniformly for t<T. At grid points the increment is zero by [F1], including t=T. The constants depend on r,T,d,m,c,D,q,f(0),g(0) and the stated moment bounds, but not on h. AC is inherited only through [A1] and the declared Gaussian interfaces; no arbitrary-index choice is used in the estimate.

Source notes

Higham–Mao–Stuart, Lemma 4.3 (printed p. 1055), proves this interpolation increment estimate under its autonomous coefficient and all-moment hypotheses. Särkkä–Solin §8.2, Algorithm 8.1 (printed p. 132), specifies the Euler–Maruyama recursion; the estimate above is proved here under the stated all-moment premise.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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.

TheoremStatement: AI-adaptedProof: AI-generatedjudge pass (gpt-6-luna)Open item page →

Euler–Maruyama weak order one under backward regularity

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. Take 0<h≤1 with N=T/h∈N. Let W be an adapted standard m-dimensional Brownian motion with increments independent of the current filtration. Use Euclidean state norms and the Frobenius matrix norm, and write A:B=tr⁡(ATB). Let b:[0,T]×Rd→Rd and σ:[0,T]×Rd→Rd×m be jointly Borel, globally Lipschitz in state, of uniform linear growth, and satisfy the half-Hölder time modulus in Euler–Maruyama recursion. Let X0 be F0-measurable, independent of σ(Wt−W0:0≤t≤T), with E∣X0∣p<∞ for some p≥2q+8, where q≥0 is finite; when q=0, use the convention ∣x∣q=1. Let X be the exact strong solution and Yh,Yˉh the continuous Euler interpolation and step process of Euler–Maruyama step process and continuous interpolation.

For a bounded Borel payoff φ:Rd→R, define u(t,x)=E[φ(XTt,x)], where Xt,x is the unique shifted strong solution started from x at time t, supplied by Global strong well-posedness for Lipschitz Itô SDEs. Set Ltv(x)=b(t,x)⋅∇v(x)+12(σ(t,x)σ(t,x)T):Dx2v(x). Assume u(T,x)=φ(x) and (∂t+Lt)u=0 on [0,T)×Rd. A multi-index is α=(α1,…,αd) with nonnegative integer entries and ∣α∣=∑iαi. Assume every mixed derivative ∂tjDxαu with 0≤j≤2 and ∣α∣≤4 exists, is continuous, and satisfies ∣∂tjDxαu(t,x)∣≤Cu(1+∣x∣q) for a common constant Cu. Finally, assume the exact and Euler processes have uniform pointwise moments of order p on [0,T]; the Euler bounds are provided by Euler–Maruyama uniform moments and interpolation increments and the exact bound by the P-SDE-01 moment contract. Then ∣Eφ(XT)−Eφ(YNh)∣≤Ch, where C is independent of h. The theorem is conditional on the stated backward regularity; it does not derive that regularity from coefficient or payoff smoothness.

Facts & Assumptions

Given: AC; finite d,m; the fixed horizon and grid; the Brownian, coefficient, initial-value, exact-solution, backward-equation, mixed-derivative and moment hypotheses in the Statement.

[F1]

The Euler recursion uses Yk+1=Yk+b(tk,Yk)h+σ(tk,Yk)(Wtk+1−Wtk), and its continuous interpolation uses those same left-endpoint coefficients. Euler–Maruyama recursion Euler–Maruyama step process and continuous interpolation

[F2]

For every finite p≥2 allowed by the initial moment, the Euler step, continuous interpolation and left-endpoint process have pointwise moments bounded uniformly over h; their interpolation increment satisfies E∣Yt−Yˉt∣2≤Ch. Euler–Maruyama uniform moments and interpolation increments

[F3]

Brownian increments have law Nm(0,(t−s)Im) and are independent of the current filtration. d-dimensional Brownian motion

[F4]

For each even integer r≥2, a scalar Brownian increment has rth absolute moment (r−1)!!∣t−s∣r/2<∞. Gaussian even moments for Brownian increments

[F5]

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

[F6]

A continuous Brownian Itô process has the coordinatewise drift-plus-Itô-integral representation used to interpret the exact SDE solution; every finite-energy piece of its localized Brownian integral is a square-integrable mean-zero martingale. Continuous Brownian Ito processes

[F7]

Under the global Lipschitz and linear-growth assumptions and X0∈L2, the exact strong solution exists uniquely and has a finite path-supremum second moment. For each deterministic t<T and x∈Rd, the same theorem applies on the shifted interval [0,T−t] with coefficients b(t+s,⋅),σ(t+s,⋅), shifted filtration Ft+s, Brownian motion Wt+s−Wt, and deterministic initial value x; these data retain the theorem's hypotheses, so Xt,x is well-defined. Global strong well-posedness for Lipschitz Itô SDEs

[F8]

For every real p≥2 with E∣X0∣p<∞, the exact solution has sup⁡t≤TE∣Xt∣p<∞. Finite-horizon moments for Lipschitz Itô SDEs

[F9]

A standard normal has density e−z2/2/2π and the centered Gaussian law of a Brownian increment of length h is symmetric with covariance hIm. Its real nonnegative absolute-moment bounds are derived in step 1.3 from [F4]. Standard normal and normal laws d-dimensional Brownian motion

[F10]

Tonelli's theorem allows the expected energy of the exact stochastic-integral coefficient to be bounded by the time integral of its pointwise moments. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[A1]

AC is declared because the SDE, Brownian, normal-law, Gaussian-moment and multidimensional Itô interfaces in [F3]–[F9] adopt it. The Axiom of Choice

Proof

Given: The hypotheses in the Statement or Example and the facts above.

1.1A1F5F6F7F8F10given

By [F6], the exact solution has the continuous Itô decomposition; apply [F5] to u(t,Xt). The backward equation cancels its drift. Moreover, ∣∇u(t,x)∣≤C(1+∣x∣q) and linear growth of σ give E∫0T∥∇u(s,Xs)σ(s,Xs)∥F2ds<∞ by Tonelli [F10], because p≥2q+8 and [F8] supplies the exact process moments. Thus the stochastic integral is a square-integrable mean-zero martingale by [F6]. With u(T,⋅)=φ, this proves Eφ(XT)=Eu(0,X0).

1.2givenalgebra

Fix t<T, x∈Rd, and 0<h≤min⁡(1,T−t); set ΔW∼Nm(0,hIm) and δ=b(t,x)h+σ(t,x)ΔW. Taylor's formula along the spatial segment gives u(t,x+δ)=∑k=031k!Dxku(t,x)[δ⊗k]+R4, ut(t,x+δ)=∑k=021k!Dxkut(t,x)[δ⊗k]+R3t, where Dxku[z⊗k] means the kth spatial derivative applied to z in all k slots. The integral remainders are R4=13!∫01(1−r)3Dx4u(t,x+rδ)[δ⊗4] dr, R3t=12!∫01(1−r)2Dx3ut(t,x+rδ)[δ⊗3] dr. Time Taylor expansion gives u(t+h,x+δ)=u(t,x+δ)+hut(t,x+δ)+Rtt,Rtt=h2∫01(1−r)utt(t+rh,x+δ) dr. The derivative bounds in the Statement and ∣x+rδ∣q≤Cq(∣x∣q+∣δ∣q) imply ∣R4∣≤C(1+∣x∣q+∣δ∣q)∣δ∣4,∣R3t∣≤C(1+∣x∣q+∣δ∣q)∣δ∣3,∣Rtt∣≤Ch2(1+∣x+δ∣q). If q=0, interpret 1+∣x∣q as the constant 2.

1.3F3F4F9choosealgebra

For each finite real s>0, choose an integer n≥1 with 2n≥s. If Z is scalar standard normal, ∣Z∣s≤1+∣Z∣2n, so [F4] gives E∣Z∣s≤1+(2n−1)!!<∞. For a standard m-dimensional Gaussian vector G, ∣G∣≤mmax⁡j∣Gj∣ gives ∣G∣s≤ms/2∑j=1m∣Gj∣s, and hence E∣G∣s≤m1+s/2{1+(2n−1)!!}. By the Gaussian scaling convention in [F3] and [F9], ΔW has law hG, so E∣ΔW∣s≤Cs,mhs/2. This also covers h=0 when s>0; for s=0 adopt ∣x∣0=1, and its expectation is one. No initial-state moment stronger than the Statement is used in this Gaussian calculation.

2.1F3F4F9step 1.2step 1.3algebra

Put a(t,x)=σ(t,x)σ(t,x)T. The coefficient growth bounds and [F3]–[F4], [F9] give Eδ=b(t,x)h,E(δδT)=a(t,x)h+h2b(t,x)b(t,x)T, ∥E(δ⊗3)∥≤Ch2(1+∣x∣3),E∣δ∣s≤Cshs/2(1+∣x∣s) for each finite exponent s>0 used in the Taylor remainders. Indeed, ∣b(t,x)∣+∥σ(t,x)∥F≤C(1+∣x∣) and ∣δ∣≤h∣b(t,x)∣+∥σ(t,x)∥F∣ΔW∣; [F9] and h≤1 give the stated bound. When q=0, its ∣δ∣q factor is the constant 1. For the third tensor moment, write δ=hb+Z with Z=σ(t,x)ΔW. The centered Gaussian Z has covariance ha(t,x) and zero third moment, so expanding the tensor cube leaves three terms with one hb and two Z factors, plus (hb)⊗3; each has expectation O(h2(1+∣x∣3)). Substituting these moments in step 1.2, the first-order terms combine to h(∂tu+b⋅∇u+12a:Dx2u)(t,x)=0. Every other Taylor term is bounded by Ch2(1+∣x∣q+4): the fourth spatial remainder uses E∣δ∣4(1+∣x∣q+∣δ∣q), the time-space terms use Eδ and EδδT, and the ut third-order remainder is O(h5/2)(1+∣x∣q+3)≤Ch2(1+∣x∣q+4). Therefore ∣Eu(t+h,x+δ)−u(t,x)∣≤Ch2(1+∣x∣q+4).

3.1F1F2F3step 2.1

Condition on Ftk. By [F1], Yk+1h is the one-step update in step 2.1 with t=tk and x=Ykh; [F3] makes the Brownian increment independent of Ftk. Thus ∣E[u(tk+1,Yk+1h)−u(tk,Ykh)∣Ftk]∣≤Ch2(1+∣Ykh∣q+4). Since p≥2q+8≥q+4, [F2] and the exact pointwise moment premise make the expectation of the right side at most C′h2, uniformly in k,h.

4.1A1step 1.1step 3.1algebra∎

Sum the conditional one-step errors over k=0,…,N−1. The sum telescopes to ∣Eu(T,YNh)−Eu(0,Y0h)∣≤NC′h2=C′Th. Here u(T,YNh)=φ(YNh) and Y0h=X0; step 1.1 gives Eu(0,X0)=Eφ(XT). Combining the equalities proves the desired weak error bound. AC enters only through [A1].

Remarks

The explicit mixed derivative premise includes ∂tDx3u, which is used in the Taylor remainder for ut. The moment exponent p≥2q+8 is a conservative bound for the q+4 polynomial remainder and the martingale integrability in step 1.1. The proof assumes the backward regularity and does not prove it from b,σ or φ smoothness.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Shared-Brownian Euler level correction rates

Statement

Assume AC and the finite-L2 coefficient and initial-value hypotheses of Euler–Maruyama strong rate for square-integrable initial data. Fix an integer refinement factor M≥2 and a fine step h with 0<h≤1/M, T/h∈N, and T/(Mh)∈N. Construct the fine and coarse Euler paths with the same initial value and Brownian motion. The coarse Brownian increment over each coarse interval is, by definition, the sum of the M fine Brownian increments in that interval. Let XT be the common exact solution, and let φ:Rd→R be globally Lipschitz with constant Lφ. Then constants independent of h satisfy E∣YTh−YTMh∣2≤CMh, Var⁡(φ(YTh)−φ(YTMh))≤CMLφ2h,∣Eφ(XT)−Eφ(YTh)∣≤CLφh1/2. Thus the Lipschitz-payoff Euler level pair has correction variance exponent β=1 and strong-error bias exponent α=1/2. If, in addition, φ is bounded and its backward value function satisfies the hypotheses of Euler–Maruyama weak order one under backward regularity, then the bias bound improves to ∣Eφ(XT)−Eφ(YTh)∣≤Ch, so α=1 while β=1 remains. With fixed dimension, fixed M, and unit-cost coefficient and payoff evaluations, one coupled fine/coarse sample has work O(h−1).

Facts & Assumptions

Given: AC; the stated finite-L2 SDE assumptions; the fixed refinement factor and nested grids; a common exact solution and Brownian path; and the Lipschitz payoff (plus, for the weak branch, the bounded-payoff backward contract).

[F1]

Under the finite-L2 coefficient, time-modulus, Brownian and initial-value hypotheses, the continuous Euler path satisfies Esup⁡t≤T∣Xt−Yth∣2≤Ch, uniformly in 0<h≤1 with T/h∈N. Euler–Maruyama strong rate for square-integrable initial data

[F2]

For the weak-bias branch, retain finite d,m, the Euclidean/Frobenius norm convention and A:B=tr⁡(ATB), and the same finite-horizon, complete usual filtered Brownian and grid setup as in the Statement. Assume jointly Borel coefficients that are globally Lipschitz in state, have uniform linear growth, and satisfy the half-Hölder time modulus. Require an F0-measurable initial value independent of future Brownian increments with E∣X0∣p<∞ for finite real q≥0 and finite p≥2q+8 (using ∣x∣0=1), and uniform pointwise order-p moments of the exact solution, Euler interpolation, and Euler step process on [0,T]. The payoff is bounded Borel, and its backward value function u(t,x)=E[φ(XTt,x)], using the unique shifted strong solutions supplied by the global well-posedness theorem, satisfies u(T,x)=φ(x), (∂t+Lt)u=0 for Ltv=b(t,⋅)⋅∇v+12(σσT)(t,⋅):Dx2v, and continuous mixed derivatives ∂tjDxαu for 0≤j≤2, ∣α∣≤4, bounded by Cu(1+∣x∣q). Under this full contract of Euler–Maruyama weak order one under backward regularity, ∣Eφ(XT)−Eφ(YTh)∣≤Ch.

[A1]

The refinement factor M is fixed as h→0; both mesh sizes obey 0<h≤1 and have T/h and T/(Mh) integral. The coarse path uses the sum of each corresponding block of M fine Brownian increments, so both Euler paths use the same Brownian path and initial value.

[A2]

∣φ(x)−φ(y)∣≤Lφ∣x−y∣ for all states. In the weak branch, the same φ is bounded and satisfies the additional backward regularity contract [F2].

[A3]

AC is included because [F1] carries that assumption from the Doob and Brownian Itô interfaces. The Axiom of Choice

Proof

Given: AC; the stated finite-L2 SDE assumptions; the fixed refinement factor and nested grids; a common exact solution and Brownian path; and the Lipschitz payoff (plus, for the weak branch, the bounded-payoff backward contract).

[F1] Under the finite-L2 coefficient, time-modulus, Brownian and initial-value hypotheses, the continuous Euler path satisfies Esup⁡t≤T∣Xt−Yth∣2≤Ch, uniformly in 0<h≤1 with T/h∈N. Euler–Maruyama strong rate for square-integrable initial data

[F2] For the weak-bias branch, retain finite d,m, the Euclidean/Frobenius norm convention and A:B=tr⁡(ATB), and the same finite-horizon, complete usual filtered Brownian and grid setup as in the Statement. Assume jointly Borel coefficients that are globally Lipschitz in state, have uniform linear growth, and satisfy the half-Hölder time modulus. Require an F0-measurable initial value independent of future Brownian increments with E∣X0∣p<∞ for finite real q≥0 and finite p≥2q+8 (using ∣x∣0=1), and uniform pointwise order-p moments of the exact solution, Euler interpolation, and Euler step process on [0,T]. The payoff is bounded Borel, and its backward value function u(t,x)=E[φ(XTt,x)], using the unique shifted strong solutions supplied by the global well-posedness theorem, satisfies u(T,x)=φ(x), (∂t+Lt)u=0 for Ltv=b(t,⋅)⋅∇v+12(σσT)(t,⋅):Dx2v, and continuous mixed derivatives ∂tjDxαu for 0≤j≤2, ∣α∣≤4, bounded by Cu(1+∣x∣q). Under this full contract of Euler–Maruyama weak order one under backward regularity, ∣Eφ(XT)−Eφ(YTh)∣≤Ch.

[A1] The refinement factor M is fixed as h→0; both mesh sizes obey 0<h≤1 and have T/h and T/(Mh) integral. The coarse path uses the sum of each corresponding block of M fine Brownian increments, so both Euler paths use the same Brownian path and initial value.

[A2] ∣φ(x)−φ(y)∣≤Lφ∣x−y∣ for all states. In the weak branch, the same φ is bounded and satisfies the additional backward regularity contract [F2].

[A3] AC is included because [F1] carries that assumption from the Doob and Brownian Itô interfaces. The Axiom of Choice

1.1F1A1algebra

By [A1], the fine and coarse paths are driven by nested increments of this common Brownian path. Since h≤1/M, both meshes lie in the range of [F1]. Therefore ∣YTh−YTMh∣2≤2∣YTh−XT∣2+2∣YTMh−XT∣2. Taking expectations and applying [F1] at step sizes h and Mh gives E∣YTh−YTMh∣2≤2Ch+2CMh=2C(1+M)h. This is the correction second-moment bound.

1.2A2F1algebra

The same Lipschitz bound and Cauchy–Schwarz give ∣Eφ(XT)−Eφ(YTh)∣≤LφE∣XT−YTh∣≤Lφ(E∣XT−YTh∣2)1/2≤C1/2Lφh1/2. Thus β=1 and the strong route gives α=1/2.

2.1A2step 1.1algebra

Let D=φ(YTh)−φ(YTMh). Since variance is at most second moment and [A2] gives ∣D∣≤Lφ∣YTh−YTMh∣, step 1.1 yields Var⁡(D)≤ED2≤2C(1+M)Lφ2h.

3.1F2step 2.1

If the additional bounded-payoff backward contract holds, [F2] applied to the same fine Euler scheme gives bias at most Ch. It changes only the bias exponent to α=1; the correction-variance bound of step 2.1 is unchanged.

4.1A1A3step 3.1∎

A fine path takes T/h Euler steps and the coarse path takes T/(Mh) steps. The coarse increments are sums of already generated fine increments, so they add no Brownian draws; for fixed M,d and unit-cost coefficient/payoff evaluations, total path work is proportional to T/h+T/(Mh)=O(h−1). AC is inherited only through [A3].

Remarks

This is the solver-rate interface for multilevel examples; it makes no claim about learned-drift or learned-score bias. The variance-rate and work statements do not import the abstract MLMC complexity theorem.

5 · Examples, counterexamples and false statements

None yet.

Sources