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.

Milstein stochastic taylor and iterated integrals

1 · Prerequisites

2 · Summary

This page develops the scalar Milstein method from its iterated It^o integral and proves strong order one using conditional local-defect bounds and a stochastic local-to-global recurrence. It also proves the commutative-noise reduction to Brownian increments, states where noncommuting noise needs separately sampled areas, and establishes weak order two for stochastic Heun under additive noise and bounded backward-solution derivatives. The new Milstein MLMC variance proof supplies the rate assumptions for the existing complexity theorem.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Milstein updates, iterated Brownian integrals, and commutative noise

Definition

Assume AC and the Brownian filtered-space conventions in Continuous Brownian Ito processes. Let d,m≥1 be finite integers, let W=(W1,…,Wm) be the driving standard Brownian motion, and consider the autonomous It^o SDE dXt=b(Xt) dt+∑j=1mσj(Xt) dWtj, where b:Rd→Rd and each σj:Rd→Rd is differentiable. For a differentiable vector-valued function f, Df(x) is its Jacobian and Lif(x):=Df(x)σi(x); this definition is applied componentwise when f is matrix-valued.

On a deterministic grid tn=nh, define ΔWnj=Wtn+1j−Wtnj and the iterated It^o integral Iij,n:=∫tntn+1(Wsi−Wtni) dWsj,1≤i,j≤m. The integrand is predictable and square-integrable, so this is the L2 It^o integral of Ito integral for square-integrable predictable processes; its finite energy is E∫tntn+1(Wsi−Wtni)2ds=h2/2 by Ito isometry and linearity in predictable L2.

The general Milstein Taylor update is Yn+1=Yn+b(Yn)h+∑j=1mσj(Yn)ΔWnj+∑i,j=1mLiσj(Yn)Iij,n. The diffusion fields have commutative noise when Liσj(x)=Ljσi(x) for every x and every i,j. Under that condition, the equivalent update using only Brownian increments is Yn+1=Yn+b(Yn)h+∑j=1mσj(Yn)ΔWnj+12∑i,j=1mLiσj(Yn)(ΔWniΔWnj−δijh). For scalar noise (d=m=1), this reads Yn+1=Yn+b(Yn)h+σ(Yn)ΔWn+12σ(Yn)σ′(Yn)((ΔWn)2−h).

For every 1≤i,j≤m, define the Brownian area component Aij,n:=(Iij,n−Iji,n)/2 and the symmetric part Sij,n:=(Iij,n+Iji,n)/2. In particular, Aii,n=0 and Sii,n=Iii,n. Then Aji,n=−Aij,n, Sji,n=Sij,n, and reindexing the sums gives ∑i,jLiσjIij,n=12∑i,j(Liσj+Ljσi)Sij,n+12∑i,j(Liσj−Ljσi)Aij,n. The second sum vanishes under commutative noise; otherwise the general update includes the area components. A noncommuting Milstein implementation must sample or approximate the needed areas and account for their approximation error and computational cost; this definition makes no claim that an exact area sample is free or that a particular area sampler has a specified error rate.

For this pair, Cbk(Rd;Rq) means that every component and every partial derivative of orders at most k exists, is continuous, and is bounded. This notation is componentwise for vector and matrix valued functions.

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

Product identity and conditional moments for iterated Brownian integrals

Statement

Let the finite-dimensional Brownian It^o setting and the integrals Iij,n be as in Milstein updates, iterated Brownian integrals, and commutative noise. For every grid interval of length h>0, Iij,n+Iji,n=ΔWniΔWnj−δijh. In the scalar case, writing In=I11,n and ΔWn=ΔWn1, this gives In=12((ΔWn)2−h),E[In∣Ftn]=0,E[In2∣Ftn]=h22,E[ΔWnIn∣Ftn]=0. Consequently, under the commutativity condition in the Definition, the double-integral term in the general Milstein Taylor increment equals ∑i,jLiσj(Yn)Iij,n=12∑i,jLiσj(Yn)(ΔWniΔWnj−δijh).

Facts & Assumptions

Given: AC, a filtered probability space with an adapted standard m-dimensional Brownian motion whose increments after tn are independent of Ftn, and the grid interval [tn,tn+h].

[L1]

Milstein updates, iterated Brownian integrals, and commutative noise: Iij,n=∫tntn+h(Wsi−Wtni) dWsj, and the commutative condition is Liσj=Ljσi.

[F1]

Multidimensional Ito formula for Brownian-driven processes: for a Brownian It^o process, the second-order term in It^o's formula is one half of the Hessian paired with the instantaneous covariance matrix; the theorem assumes AC and the usual-filtration/integrability conventions stated in its body.

[F2]

Continuous Brownian Ito processes: Brownian increments are independent of the current sigma algebra and have their stated centered normal laws.

[F3]

Standard normal and normal laws: a standard normal has density (2π)−1/2e−x2/2; its odd moments vanish and its even moments follow by integration by parts.

[F4]

Conditional expectation given a sigma algebra: conditional expectation is the measurable integrable version characterized by its integrals on events in the conditioning sigma algebra.

[A1]

The Axiom of Choice: AC is assumed by the cited Brownian and It^o interfaces; no further choice is used here.

Proof

Given: The assumptions above.

1.1F1L1A1

Apply [F1] to f(x)=xixj on [tn,tn+h]. It gives Wtn+hiWtn+hj−WtniWtnj=∫tntn+hWsi dWsj+∫tntn+hWsj dWsi+δijh. Expand each integrand as its value at tn plus its Brownian increment; the two constant terms cancel from the two sides, leaving ΔWniΔWnj=Iij,n+Iji,n+δijh.

2.1F2F3step 1.1

Setting i=j=1 in step 1.1 yields In=((ΔWn)2−h)/2. By [F2], ΔWn is independent of Ftn and has law N(0,h). Scaling the density in [F3] and integrating by parts give E[ΔWn∣Ftn]=0, E[(ΔWn)2∣Ftn]=h, E[(ΔWn)3∣Ftn]=0, and E[(ΔWn)4∣Ftn]=3h2.

3.1F2F3F4step 2.1

Substituting the four conditional moments from step 2.1 into In=((ΔWn)2−h)/2 gives E[In∣Ftn]=(h−h)/2=0, E[In2∣Ftn]=(3h2−2h2+h2)/4=h2/2, and E[ΔWnIn∣Ftn]=(0−h⋅0)/2=0. Each equality is an equality of conditional-expectation versions by the event-integral definition [F4].

4.1L1step 1.1∎

Under commutativity, pair the summand with indices (i,j) with the summand (j,i). The coefficients agree by [L1], so the sum equals 12∑i,jLiσj(Yn)(Iij,n+Iji,n). Substituting step 1.1 gives the displayed Brownian-increment formula. The argument includes i=j, where the summand is one half of Liσi(Yn)((ΔWni)2−h).

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

Event-weighted Ito isometry after a conditioning time

Statement

Assume AC and the Brownian filtration conventions in Continuous Brownian Ito processes. Let t≥0, h>0, let A∈Ft, and let H be a real predictable process with finite energy on [t,t+h] and Hs=0 for s∉(t,t+h]. For any coordinate Wj of the driving finite-dimensional Brownian motion, E ⁣[1A∣∫tt+hHs dWsj∣2]=E ⁣[1A∫tt+h∣Hs∣2 ds].

Facts & Assumptions

Given: AC, the Brownian filtered probability space, deterministic t,h, A∈Ft, and the predictable square-integrable integrand H supported on (t,t+h].

[F1]

Continuous Brownian Ito processes: each Brownian coordinate has increments independent of the current filtration, and finite-energy Ito integrals are defined on predictable integrands.

[F2]

Elementary predictable Brownian integrands: an elementary predictable integrand is constant on finitely many intervals (sk,sk+1] with bounded coefficient measurable at sk.

[F3]

Ito integral of an elementary predictable process: on a common partition the elementary integral is the finite sum of coefficient times Brownian increment, and it is linear in the integrand.

[F4]

Ito integral for square-integrable predictable processes: a finite-energy predictable integrand is approximated in L2(ds dP) by elementary predictable integrands, and its Ito integral is their L2(P) limit.

[F5]

Ito isometry and linearity in predictable L2: for every finite-energy predictable integrand G, E∣∫G dWj∣2=E∫∣G∣2ds, and the extension is linear in L2.

[F6]

Continuous-time filtrations and all-pairs martingales: a continuous-time filtration satisfies Fs⊆Fr whenever 0≤s≤r.

[A1]

The Axiom of Choice: AC is part of the Brownian and Ito-integral interfaces [F1], [F4], and [F5].

Proof

Given: The assumptions above.

1.1F2F4given

Choose elementary predictable Hn→H in L2(ds dP) using [F4], and replace each Hn by H~n=1(t,t+h]Hn. Refining its finite partition at t and t+h makes H~n elementary; because H vanishes off this interval, H~n→H in L2(ds dP).

2.1F1F2F3F5F6step 1.1

Refine the partition of H~n so that every nonzero cell (sk,sk+1] has sk≥t. Its coefficient ξk is Fsk-measurable, and [F6] with A∈Ft makes 1Aξk also Fsk-measurable. Thus 1AH~n is elementary predictable for the Brownian coordinate in [F1], and the finite-sum definition [F3] gives ∫1AH~ndWj=1A∫H~ndWj. Applying [F5] to 1AH~n yields E ⁣[1A∣∫H~ndWj∣2]=E ⁣[1A∫∣H~n∣2ds].

3.1F4F5step 2.1

Multiplication by 1A is a contraction in both L2(P) and L2(ds dP). Hence [F4] and [F5] give ∫H~ndWj→∫HdWj and ∫1AH~ndWj→∫1AHdWj in L2(P), while 1AH~n→1AH in L2(ds dP). Passing the finite-sum identity of step 2.1 to these limits gives ∫1AHdWj=1A∫HdWj in L2(P).

4.1F5step 3.1algebra

By [F5] and step 3.1, E ⁣[1A∣∫HdWj∣2]=E∣∫1AHdWj∣2=E∫∣1AH∣2ds=E ⁣[1A∫∣H∣2ds]. All terms are finite because H has finite energy, so the asserted identity follows.

5.1A1step 4.1∎

The argument applies to each coordinate separately and uses only finite partitions, L2 limits, and the supplied Ito isometry. Its only inherited choice assumption is [A1].

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

Second and fourth moments of bounded-coefficient SDE increments

Statement

Let X solve the autonomous SDE in Milstein updates, iterated Brownian integrals, and commutative noise on a filtered probability space with an m-dimensional Brownian motion relative to the filtration. Assume b,σ1,…,σm∈Cb3(Rd), with the Cb3 convention of the Definition. There is a constant C depending only on the coefficient bounds and d,m such that for every t≥0, 0≤r≤1, and A∈Ft, E ⁣[1A∣Xt+r−Xt∣2]≤Cr P(A),E ⁣[1A∣Xt+r−Xt∣4]≤Cr2 P(A). These event-weighted inequalities are the conditional second- and fourth-moment bounds for the increment.

Facts & Assumptions

Given: AC, the Brownian It^o process and SDE coefficient assumptions in the Statement, t≥0, 0≤r≤1, and an event A∈Ft.

[L1]

Milstein updates, iterated Brownian integrals, and commutative noise: the state space is finite-dimensional, the drift and diffusion vector fields are componentwise Cb3, and their sup norms and derivative sup norms are finite.

[F1]

Continuous Brownian Ito processes: the usual filtration and Brownian hypotheses give a continuous adapted representative with a drift-plus-It^o-integral representation; Brownian increments after t are independent of Ft, and the process class is closed under stopping with drift and diffusion multiplied by the stopped indicator.

[F2]

Event-weighted Ito isometry after a conditioning time: for A∈Ft, each scalar It^o integral over (t,t+r] satisfies E[1A∣∫H,dWj∣2]=E[1A∫∣H∣2ds].

[F3]

Multidimensional Ito formula for Brownian-driven processes: for f∈C1,2, It^o's drift is Df b+12∑jD2f[σj,σj] and the martingale term is ∑jDf σj dWj.

[F4]

The Ito integral process has a continuous martingale version: finite-energy It^o integral processes are square-integrable martingales, so their stopped increments have mean zero after multiplication by an event known at the start time.

[F5]

Fatou's lemma: for nonnegative random variables converging almost surely, the expectation of the limit is at most the lower limit of the expectations.

[A1]

The Axiom of Choice: AC is inherited from [F1]--[F3]; the moment estimates introduce no further choice.

Proof

Given: The assumptions above.

1.1L1F1F2A1

Put Ys=Xs−Xt, and let B bound ∣b∣ and S2 bound ∑j∣σj∣2. The integral equation, ∣∫tt+rb(Xs)ds∣2≤B2r2, the finite-sum inequality ∣∑jvj∣2≤m∑j∣vj∣2, and [F2] give E[1A∣Yt+r∣2]≤2B2r2P(A)+2S2rP(A)≤CrP(A), since r≤1. The event-weighted identity applies to each integrand σj(Xs)1(t,t+r](s), whose squared norm is bounded by ∥σj∥∞2.

2.1F1F2F3F4step 1.1

For R>0, use the continuous adapted version from [F1], modifying it on its exceptional null set if necessary; usual completeness makes this an adapted null modification and leaves all moment and SDE assertions unchanged. Let θR=inf⁡{u≥0:∣Yt+u∣≥R}. This is a stopping time: for fixed u, {θR≤u}={sup⁡0≤v≤u∣Yt+v∣≥R}, and continuity makes the supremum equal to the supremum over rational v∈[0,u] together with u, hence Ft+u-measurable. Put YuR=Xt+(u∧θR)−Xt=Yt+(u∧θR), qR(u)=E[1A∣YuR∣4], and pR(u)=E[1A∣YuR∣2]. By the stopped representation in [F1], the drift and diffusion integrands are multiplied by 1s−t≤θR. Its drift square is at most B2u2, and applying [F2] coordinatewise with the finite-sum bound gives pR(u)≤2B2u2P(A)+2S2uP(A)≤CuP(A), by the same bound as step 1.1. Apply [F3] to f(y)=∣y∣4 and the stopped process. The Hessian formula gives drift 4∣YR∣2⟨YR,b(X)⟩+2∣YR∣2∑j∣σj(X)∣2+4∑j⟨YR,σj(X)⟩2 before the stopping time. Bounded coefficients and 4B∣YR∣3≤C(∣YR∣4+∣YR∣2) bound its absolute value by C(∣YR∣4+∣YR∣2). The stopped stochastic integrand is bounded, so [F4] makes its expectation after multiplication by 1A zero. Consequently qR(u)≤C∫0uqR(v) dv+Cu2P(A),0≤u≤r. The second term follows from pR(v)≤CvP(A); all constants are independent of R.

3.1F5step 2.1algebra

Define QR(u)=∫0uqR(v) dv. The inequality in step 2.1 implies QR′(u)≤CQR(u)+Cu2P(A) for almost every u, with QR(0)=0. Multiplying by e−Cu and integrating gives QR(u)≤C′u3P(A) for u≤1. Returning to step 2.1 gives qR(u)≤C′′u2P(A). As R→∞, path continuity implies YuR→Yt+u almost surely; [F5] therefore yields the asserted fourth-moment bound.

4.1A1step 1.1step 3.1∎

Steps 1.1 and 3.1 are exactly the asserted event-weighted second- and fourth-moment estimates, with constants independent of t,r,A. The stopped argument and finite-dimensional It^o calculation add no axiom beyond [A1].

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

Conditional local defect bounds for the Milstein Taylor increment

Statement

Let X solve the finite-dimensional autonomous SDE in Milstein updates, iterated Brownian integrals, and commutative noise with b,σ1,…,σm∈Cb3(Rd), using the Cb3 convention in that Definition. Let 0<h≤1 and let [t,t+h] be a deterministic interval. Define L0f:=Df b+12∑k=1mD2f[σk,σk] and Lif:=Df σi for i≥1. Then there is a remainder Rt,h∈L2(Rd) such that Xt+h=Xt+b(Xt)h+∑j=1mσj(Xt)ΔWj+∑i,j=1mLiσj(Xt)Iij+Rt,h, where ΔWj=Wt+hj−Wtj and Iij=∫tt+h(Wsi−Wti)dWsj. Moreover, for the conditioning sigma algebra Ft there is a conditional-expectation version rt,h=E[Rt,h∣Ft] with ∣rt,h∣≤Ch2,E[∣Rt,h∣2∣Ft]≤Ch3almost surely, where C depends only on d,m and the coefficient bounds, not on t,h or Xt.

Facts & Assumptions

Given: AC, a Brownian It^o solution on a usual filtered probability space, the coefficient bounds in the Statement, and 0<h≤1.

[L1]

Milstein updates, iterated Brownian integrals, and commutative noise: Iij=∫tt+h(Wsi−Wti)dWsj, Lif=Df σi, and Cb3 means all derivatives through order three, including the function itself, are bounded and continuous.

[L2]

Second and fourth moments of bounded-coefficient SDE increments: for s∈[t,t+h] and every A∈Ft, E[1A∣Xs−Xt∣2]≤C(s−t)P(A).

[F1]

Continuous Brownian Ito processes: X has the drift-plus-It^o-integral decomposition, Brownian increments after t are independent of Ft, and finite-energy It^o integrals are martingales.

[F2]

Multidimensional Ito formula for Brownian-driven processes: for f∈C1,2, df(X)=L0f(X)dt+∑iLif(X)dWi.

[F3]

Event-weighted Ito isometry after a conditioning time: for A∈Ft, each scalar It^o integral over (t,t+h] satisfies E[1A∣∫H,dWj∣2]=E[1A∫∣H∣2ds].

[F4]

The Ito integral process has a continuous martingale version: a finite-energy It^o integral increment has conditional mean zero at its start time.

[F5]

Conditional expectation given a sigma algebra: a conditional expectation version has the same integrals as the original variable on every event in the conditioning sigma algebra.

[F6]

Conditional expectation exists by radon nikodym and Basic algebra and order properties of conditional expectation: under AC the conditional expectation versions used below exist, are linear, and preserve expectation and order.

[A1]

The Axiom of Choice: AC is used only through the declared Brownian, It^o, and conditional-expectation interfaces [F1]--[F6].

Proof

Given: The assumptions above.

1.1L1F1F2A1

Apply [F2] to f=σj on [t,s]. With the operators in [L1], σj(Xs)=σj(Xt)+∫ts(L0σj)(Xr)dr+∑i∫ts(Liσj)(Xr)dWri. Integrating this identity against dWsj, summing over j, and substituting the SDE decomposition of Xt+h−Xt isolates the constant coefficient terms. Thus the remainder is exactly Rt,h=Rb+R0+R1, where Rb=∫tt+h(b(Xs)−b(Xt))ds, R0=∑j∫tt+h(∫ts(L0σj)(Xr)dr)dWsj, and R1=∑i,j∫tt+h(∫ts((Liσj)(Xr)−(Liσj)(Xt))dWri)dWsj. The subtraction in R1 leaves precisely ∑i,j(Liσj)(Xt)Iij.

1.2L2F2F4F5F6A1

Since L0b is bounded, apply [F2] to b(Xs) and take event integrals over A∈Ft. The stochastic increments have zero event integral by [F4]; componentwise this gives ∣E[1ARb]∣≤∥L0b∥∞h2P(A)/2. By [F5]--[F6], the vector conditional expectation rb=E[Rb∣Ft], formed coordinatewise, exists. If any coordinate exceeded its bound on an Ft event, the defining event-integral identity [F5] would contradict the bound just proved, so ∣rb∣≤Ch2 after increasing C by a dimension factor. Also, the pathwise inequality ∣∫tt+hg(s)ds∣2≤h∫tt+h∣g(s)∣2ds follows by applying 0≤∫tt+h(∣g∣−a)2ds with a=h−1∫tt+h∣g∣ds; [L2] therefore gives E[1A∣Rb∣2]≤h∥Db∥∞2∫tt+hC(s−t)P(A)ds≤Ch3P(A).

1.3F3F4A1

Each L0σj is bounded. Therefore the inner integral in R0 has magnitude at most C(s−t). Its outer It^o integrals have zero conditional mean by [F4]. Apply the scalar event-weighted identity [F3] to each component of each outer vector integral and use ∣∑jvj∣2≤m∑j∣vj∣2; this gives E[1A∣R0∣2]≤C∫tt+h(s−t)2ds P(A)≤Ch3P(A).

1.4L1L2F3F4A1

Each Liσj is globally Lipschitz: its derivative is a sum of products of first and second derivatives of the σk, bounded by [L1]. The inner integral Jij(s)=∫ts((Liσj)(Xr)−(Liσj)(Xt))dWri has zero conditional mean and, by [F3] coordinatewise and [L2], satisfies E[1A∣Jij(s)∣2]≤C∫tsE[1A∣Xr−Xt∣2]dr≤C(s−t)2P(A). Each outer integral has zero conditional mean by [F4]; applying the scalar identity [F3] componentwise and ∣∑ijvij∣2≤m2∑ij∣vij∣2 gives E[1A∣R1∣2]≤Ch3P(A).

2.1F5F6step 1.2step 1.3step 1.4

The sum R0+R1 has conditional mean zero, while Rb has conditional mean rb from step 1.2; set rt,h=rb. The inequality ∣x+y+z∣2≤3(∣x∣2+∣y∣2+∣z∣2) and steps 1.2--1.4 show E[1A∣Rt,h∣2]≤Ch3P(A) for every A∈Ft. By the defining event-integral property [F5] and order property [F6], this is exactly E[∣Rt,h∣2∣Ft]≤Ch3 almost surely.

3.1A1step 1.1step 1.2step 2.1∎

Steps 1.2 and 2.1 give the conditional mean and second-moment bounds in the Statement, and step 1.1 gives the exact Taylor expansion. Every constant is uniform in the starting state because the coefficients and derivatives are bounded. AC enters only through [A1].

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

Discrete stochastic local-to-global RMS stability bound

Statement

Let N≥1, 0<h≤1, and Nh≤T. Let (Fn)n=0N be a filtration as in Filtration and filtered probability space. For every n, let en,un,rn be square-integrable Rd-valued, Fn-measurable random vectors; let Mn+1,Qn+1 be square-integrable and Fn+1-measurable. Say Z is orthogonal to Fn if E⟨H,Z⟩=0 for every square-integrable Fn-measurable vector H. Suppose e0=0,en+1=en+hun+rn+Mn+1+Qn+1, ∣un∣≤L∣en∣,∣rn∣≤C0h2, and Mn+1,Qn+1 are orthogonal to Fn, with E∣Mn+1∣2≤C1h E∣en∣2,E∣Qn+1∣2≤C1h3. Then E∣eN∣2≤CTh2, where CT depends only on T,L,C0,C1 and not on h or N. This is a local-to-global estimate for an order-one grid RMS error when the drift error is Lipschitz and the centered one-step defect has second moment O(h3).

Facts & Assumptions

Given: The filtered probability space, the square-integrable vectors, the recurrence, orthogonality, and numerical bounds in the Statement.

[F1]

Filtration and filtered probability space: Fn⊆Fn+1 and each Fn is a sigma algebra on the underlying probability space.

Proof

Given: The assumptions above.

1.1givenF1algebra

Since ∣en+hun∣≤(1+Lh)∣en∣ and ∣rn∣≤C0h2, the elementary inequality 2ab≤ha2+h−1b2 and h≤1 give E∣en+hun+rn∣2≤(1+Ch)E∣en∣2+Ch3. Indeed, the square of en+hun contributes at most (1+Lh)2∣en∣2≤(1+Ch)∣en∣2, its cross term with rn is bounded by Ch2∣en∣≤Ch∣en∣2+Ch3, and ∣rn∣2≤Ch4≤Ch3.

2.1givenstep 1.1algebra

Orthogonality makes the cross expectation between en+hun+rn and Mn+1+Qn+1 zero. To bound the remaining cross term, put a=∣Mn+1∣ and b=∣Qn+1∣; nonnegativity of E(a−λb)2 for every real λ implies E[ab]≤(Ea2)1/2(Eb2)1/2. Hence 2∣E⟨Mn+1,Qn+1⟩∣≤2(E∣Mn+1∣2)1/2(E∣Qn+1∣2)1/2≤Ch2(E∣en∣2)1/2≤ChE∣en∣2+Ch3. The final inequality is 2ab≤a2+b2 with factors proportional to h1/2(E∣en∣2)1/2 and h3/2. Therefore the recurrence and step 1.1 imply E∣en+1∣2≤(1+Ch)E∣en∣2+Ch3.

3.1givenstep 2.1algebra∎

Iterating the inequality in step 2.1 from e0=0 gives E∣eN∣2≤Ch3∑j=0N−1(1+Ch)j≤Ch3NeCNh≤CTh2, because (1+Ch)j≤eCjh≤eCT and Nh≤T. Taking square roots proves the stated RMS estimate. This recurrence argument uses only finite algebraic estimates and the given orthogonality conditions.

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

Strong order one for scalar and commutative-noise Milstein schemes

Statement

Assume AC. Let d,m≥1 be finite, let W be an m-dimensional Brownian motion relative to a filtration satisfying Continuous Brownian Ito processes, and let X solve dXt=b(Xt)dt+∑j=1mσj(Xt)dWtj,X0∈L2(Rd). Assume b,σ1,…,σm∈Cb3(Rd) as defined in Milstein updates, iterated Brownian integrals, and commutative noise. Put Lif=Df σi and assume commutative noise Liσj=Ljσi for all i,j. On the uniform grid tn=nh, h=T/N≤1, initialize Y0=X0 and use the product-increment Milstein update in the Definition. Then there is a constant CT, independent of N, such that max⁡0≤n≤NE∣Yn−Xtn∣2≤CTh2. Thus the grid root-mean-square error is O(h) on [0,T]. For m=1 the commutativity condition is automatic and the scheme is the scalar Milstein update. No claim is made for a noncommuting-noise scheme without an area sampler satisfying a separately proved approximation bound.

Facts & Assumptions

Given: AC, the SDE and coefficient hypotheses, a finite horizon T>0, an integer N≥1 with h=T/N≤1, the exact solution X, and the Milstein grid process Y.

[L1]

Milstein updates, iterated Brownian integrals, and commutative noise: the commutative update is Yn+1=Yn+b(Yn)h+∑jσj(Yn)ΔWnj+12∑i,jLiσj(Yn)(ΔWniΔWnj−δijh).

[L2]

Product identity and conditional moments for iterated Brownian integrals: Iij,n+Iji,n=ΔWniΔWnj−δijh, so the commutative double-integral term equals the product-increment term.

[L3]

Conditional local defect bounds for the Milstein Taylor increment: on each step, Xtn+1=Xtn+b(Xtn)h+∑jσj(Xtn)ΔWnj+∑i,jLiσj(Xtn)Iij,n+Rn+1, with ∣E[Rn+1∣Ftn]∣≤Ch2 and E[∣Rn+1∣2∣Ftn]≤Ch3.

[L4]

Discrete stochastic local-to-global RMS stability bound: if a grid error has an adapted Lipschitz drift increment, martingale-difference terms with variance O(h∣en∣2), a bounded local mean O(h2), and a centered local remainder with second moment O(h3), then its terminal and grid root-mean-square error is O(h).

[F1]

Continuous Brownian Ito processes: the Brownian increments after tn are independent of Ftn, and the SDE solution has the stated adapted continuous drift-plus-It^o decomposition.

[A1]

The Axiom of Choice: AC is inherited from the exact Brownian and It^o suppliers [F1], [L2], and [L3]; no choice is made in the error recurrence.

Proof

Given: The assumptions above.

1.1F1L1L2L3given

Define en=Yn−Xtn. Apply [L3] to the exact solution on [tn,tn+1]. Using [L2] and commutativity, the exact Taylor increment has the same product form as the update [L1], except that its coefficients are evaluated at Xtn and it includes the remainder Rn+1.

1.2F1L1L3step 1.1

Subtract the exact update from [L1]. With un=b(Yn)−b(Xtn), set Mn+1=∑j(σj(Yn)−σj(Xtn))ΔWnj+12∑i,j(Liσj(Yn)−Liσj(Xtn))(ΔWniΔWnj−δijh). Then en+1=en+hun+Mn+1−Rn+1. The increments after tn are independent of Ftn by [F1]; their first moments vanish, and each centered quadratic factor has mean zero. Hence Mn+1 is orthogonal to every square-integrable Ftn-measurable vector.

2.1F1L1step 1.2algebra

The derivatives of b are bounded, so ∣un∣≤C∣en∣. Also each Liσj is globally Lipschitz: its derivative is a sum of products of first and second derivatives of the diffusion fields, all bounded by [L1]. The linear Gaussian term in Mn+1 has conditional second moment at most Ch∣en∣2. For the quadratic term, E[(ΔWiΔWj−δijh)2∣Ftn]≤2h2 by independent centered normal coordinates; the finite sum and the Lipschitz bound therefore give second moment at most Ch2∣en∣2≤Ch∣en∣2. Thus E∣Mn+1∣2≤Ch E∣en∣2.

2.2L3L4step 1.2algebra

Let rn=E[Rn+1∣Ftn] and Qn+1=−(Rn+1−rn). By [L3], ∣rn∣≤Ch2, E∣Rn+1∣2≤Ch3, and hence E∣Qn+1∣2≤2E∣Rn+1∣2+2E∣rn∣2≤Ch3 because h≤1. The defining event-integral property of conditional expectation makes Qn+1 orthogonal to every square-integrable Ftn-measurable vector. Therefore the recurrence in step 1.2 has the form required by [L4], with local mean −rn and centered terms Mn+1,Qn+1.

3.1A1L4step 2.2given∎

Initially e0=0. For each n≤N, apply [L4] to the recurrence restricted to the first n steps; its constants are the same because nh≤T. Thus max⁡0≤n≤NE∣en∣2≤CTh2, and taking square roots gives the stated grid root-mean-square order one. When m=1, the only commutativity equation is L1σ1=L1σ1; if all diffusion fields vanish, the stochastic terms and their bounds vanish and the same proof reduces to the deterministic recurrence. The argument uses AC only through [A1].

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

Explicit stochastic Heun update for additive noise

Definition

Assume AC and the Brownian filtered-space conventions in Continuous Brownian Ito processes. Consider the scalar additive-noise It^o SDE dXt=b(Xt) dt+σ dWt, where σ∈R is constant. Given a step size h>0, a grid value Yn, and the Brownian increment ΔWn=Wtn+1−Wtn, the explicit stochastic Heun update is the two-stage rule Zn=Yn+b(Yn)h+σΔWn,Yn+1=Yn+h2(b(Yn)+b(Zn))+σΔWn. The predictor Zn uses the same increment as the corrector. One step evaluates b at Yn and Zn and uses one Gaussian increment. The weak order-two guarantee authored in this pair is only for this constant-diffusion scheme; the displayed update omits terms required for the corresponding multiplicative-noise guarantee.

In this definition and its consumers, Cbk(R;R) means that the function and all its derivatives through order k are continuous and bounded.

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

One-step moment matching for additive-noise stochastic Heun

Statement

Let b∈Cb6(R;R), let σ∈R be constant, and define the generator Lf=bf′+12σ2f′′. Let u:[0,T]×R→R satisfy ut+Lu=0. Assume all mixed derivatives ∂tr∂xju for 0≤r≤3 and 0≤j≤6 are continuous and bounded. For 0<h≤1, t+h≤T, fixed x∈R, and w∼N(0,h), take one Heun step from Explicit stochastic Heun update for additive noise and let D=Yn+1−x. Then a constant C, uniform in t,x,h, satisfies ∣E[u(t+h,x+D)]−u(t,x)∣≤Ch3.

Facts & Assumptions

Given: The additive-noise Heun update, b∈Cb6, the constant σ, the backward equation ut+Lu=0, its bounded derivative assumptions, w∼N(0,h), and 0<h≤1.

[L1]

Explicit stochastic Heun update for additive noise: for increment w, Z=x+b(x)h+σw and D=σw+h2(b(x)+b(Z)); Cb6 means bounded continuous derivatives through order six.

[F1]

Standard normal and normal laws: w=h Z0 with Z0 standard normal of density (2π)−1/2e−z2/2; its odd moments vanish and its even moments are obtained by integration by parts.

[A1]

The Axiom of Choice: AC is inherited through the Brownian/normal-law interface in [L1] and [F1]; the one-step Taylor calculation itself uses no further choice.

Proof

Given: The assumptions above.

1.1L1F1A1

Put B=b(x), Bj=b(j)(x), δ=Bh+σw, and D=σw+Bh+h2(b(x+δ)−B). Taylor's formula through degree three gives b(x+δ)=B+B1δ+12B2δ2+16B3δ3+ρ4, with ∣ρ4∣≤∥b(4)∥∞∣δ∣4/24. From [F1], Ew=0, Ew2=h, Ew3=0, Ew4=3h2, Ew5=0, and E∣w∣6=15h3. Substituting δ=Bh+σw and collecting terms of order at most h2 gives ED=Bh+(12BB1+14σ2B2)h2+O(h3),ED2=σ2h+(B2+σ2B1)h2+O(h3),ED3=3Bσ2h2+O(h3),ED4=3σ4h2+O(h3),ED5=O(h3). For the second moment, the h2 terms are (Bh)2 and 2(σw)(12B1σhw); for the third they are 3(σw)2(Bh); for the fourth it is E(σw)4. All other terms either contain an odd Gaussian moment or have expected magnitude O(h3) by E∣δ∣4=O(h2) and the displayed remainder bound. Since b is bounded, ∣D∣≤∣σ∣∣w∣+h∥b∥∞, so E∣D∣6≤Ch3.

2.1L1F1step 1.1

Taylor-expand u(t+h,x+D) in its spatial argument through degree five. The sixth-derivative bound and step 1.1 yield Eu(t+h,x+D)=u+uxED+12uxxED2+16uxxxED3+124uxxxxED4+1120uxxxxxED5+O(h3), where the displayed derivatives are evaluated at (t+h,x). Substituting the moment formulas, the coefficients through order h2 are hLu and 12h2L2u, because L2u=(BB1+12σ2B2)ux+(B2+σ2B1)uxx+Bσ2uxxx+14σ4uxxxx. Thus Eu(t+h,x+D)=u(t+h,x)+hLu(t+h,x)+12h2L2u(t+h,x)+O(h3).

3.1givenstep 2.1algebra

Since ut=−Lu and L is independent of t, differentiating the backward equation gives utt=L2u. Taylor's formula in time at fixed x, with bounded uttt, therefore gives u(t,x)=u(t+h,x)+hLu(t+h,x)+12h2L2u(t+h,x)+O(h3). The coefficient and derivative bounds in the Statement make the constants in the preceding expansions uniform in t,x,h.

4.1step 2.1step 3.1∎

The expansions in steps 2.1 and 3.1 have identical terms through order h2; subtracting them leaves a remainder bounded by Ch3, which is the asserted one-step weak defect.

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

Weak order two for additive-noise stochastic Heun

Statement

Assume AC and the Brownian filtration conventions in Continuous Brownian Ito processes. Consider dXt=b(Xt)dt+σdWt on [0,T], where b∈Cb6(R;R), σ∈R is constant, and X0=x0∈R is deterministic. For t≤T and x∈R, let Xt,x denote the solution of the same SDE started from x at time t. Let ϕ:R→R have a bounded classical backward solution u(t,x)=E[ϕ(XTt,x)] with u(T,x)=ϕ(x), ut+Lu=0, L=b∂x+12σ2∂xx, and all mixed derivatives ∂tr∂xju for 0≤r≤3 and 0≤j≤6 continuous and bounded. On a uniform grid h=T/N≤1, initialize Y0=x0 and apply the additive-noise stochastic Heun update in Explicit stochastic Heun update for additive noise. There is a constant CT, independent of h, such that ∣Eϕ(YN)−Eϕ(XT)∣≤CTh2. This is weak order two, meaning the expectation error is bounded by a constant times h2 for the stated payoff class. The claim is specific to constant additive diffusion; no multiplicative-noise order-two result is asserted.

Facts & Assumptions

Given: AC; the scalar additive-noise SDE, deterministic initial value x0, drift and constant diffusion assumptions; the backward solution and derivative bounds; and the uniform grid of the Statement.

[L1]

Explicit stochastic Heun update for additive noise: Z=Y+b(Y)h+σΔW and Y+=Y+h2(b(Y)+b(Z))+σΔW.

[L2]

One-step moment matching for additive-noise stochastic Heun: for every starting time/state, the expectation of u(t+h,Y+)−u(t,Y) over one Brownian increment has absolute value at most Ch3, uniformly in the starting state.

[F1]

Continuous Brownian Ito processes: each next Brownian increment is independent of the current filtration and has its stated normal law.

[A1]

The Axiom of Choice: AC is inherited through the Brownian interface [F1]; the telescoping argument uses no further choice.

Proof

Given: The assumptions above.

1.1F1L1L2given

For each n, the numerical value Yn is Ftn-measurable by induction from the update [L1]. The next increment ΔWn is independent of Ftn by [F1]. Therefore the joint law of (Yn,ΔWn) is the product of the law of Yn and N(0,h); integrating the uniform one-step bound [L2] against the law of Yn gives ∣Eu(tn+1,Yn+1)−Eu(tn,Yn)∣≤Ch3.

2.1step 1.1algebra

Sum the inequalities in step 1.1 over n=0,…,N−1. The intermediate expectations telescope, so ∣Eu(T,YN)−Eu(0,Y0)∣≤NCh3=CTh2, because Nh=T.

3.1A1step 2.1given∎

The terminal condition gives u(T,YN)=ϕ(YN). Since Y0=x0 and u(0,x0) is the expectation of ϕ for the exact SDE started at (0,x0), Eu(0,Y0)=u(0,x0)=Eϕ(XT). Substituting these identities into step 2.1 yields the claimed weak error. The argument uses only the admitted additive-noise backward solution and makes no inference for state-dependent diffusion.

TheoremStatement: Literature-sourcedProof: AI-generatedOpen item page →

Milstein MLMC correction variance and inverse-epsilon-squared cost

Statement

Assume AC and the scalar or commutative-noise SDE hypotheses of Strong order one for scalar and commutative-noise Milstein schemes. Let T>0, use dyadic step sizes hℓ=T2−ℓ, and let ψ:Rd→R be Lipschitz. At each level form the Milstein approximation Yℓ(T); couple adjacent levels by using the same Brownian path, so each coarse increment is the sum of its two fine increments. Put Pℓ=ψ(Yℓ(T)) and let Δℓ=Pℓf−Pℓ−1c for ℓ≥1, as in Geometric MLMC hierarchy and coupled corrections. For fixed finite d,m and bounded-cost coefficient and derivative evaluations, constants independent of ℓ satisfy ∣EPℓ−Eψ(XT)∣≤Cbhℓ,Var⁡(Δℓ)≤Cvhℓ2,Cℓ≤Cchℓ−1. The exact statement and proof of MLMC cost complexity under bias, variance, and work rates then give an MLMC estimator with root-mean-square error at most ϵ and total work O(ϵ−2) for all sufficiently small ϵ>0. The variance statement is for Lipschitz terminal payoffs and the stated nested coupling; no Euler correction-rate theorem or area-sampling cost is substituted.

Facts & Assumptions

Given: The SDE and Milstein hypotheses, a fixed finite horizon T, a Lipschitz payoff ψ, the dyadic hierarchy, nested Brownian coupling, and bounded work per Milstein step.

[L1]

Milstein updates, iterated Brownian integrals, and commutative noise: under commutative noise the Milstein update uses Brownian increments and coefficient derivatives, with no iterated-area samples.

[L2]

Strong order one for scalar and commutative-noise Milstein schemes: on a shared Brownian path, E∣Yh(T)−XT∣2≤Ch2 for all sufficiently small grid steps h.

[F1]

Geometric MLMC hierarchy and coupled corrections: dyadic levels use hℓ=T2−ℓ, a fine/coarse coupling, and correction Δℓ=Pℓf−Pℓ−1c.

[F2]

MLMC cost complexity under bias, variance, and work rates: if bias is O(hα) with α≥1/2, correction variance is O(hβ) with β>0, and one correction sample costs O(h−1), then the MLMC work is O(ϵ−2) when β>1.

[F3]

Cauchy-Schwarz for random variables: E∣UV∣≤(E∣U∣2)1/2(E∣V∣2)1/2 for square-integrable real variables; applied to norms it gives the L2 triangle bound and E∣U∣≤∥U∥2.

[A1]

The Axiom of Choice: AC is inherited through the Brownian and strong Milstein interfaces; no additional choice is used in the coupling or rate argument.

Proof

Given: The hypotheses above.

1.1L1L2given

For all sufficiently fine levels, [L2] gives ∥Yℓ(T)−XT∥2≤Chℓ, where ∥Z∥2=(E∣Z∣2)1/2. There are only finitely many coarser dyadic levels; each has finitely many steps and finite second moments because the coefficients and derivatives are bounded. Enlarging C therefore makes the same error bound valid for every level. The same argument gives E∣ψ(Yℓ(T))∣2<∞, since ∣ψ(x)∣≤∣ψ(0)∣+Lip⁡(ψ)∣x∣.

1.2L1F1givenalgebra

A level-ℓ fine path has T/hℓ=2ℓ steps and its coarse companion has 2ℓ−1 steps. Each commutative Milstein step uses a fixed finite number of coefficient/derivative evaluations and Gaussian vector samples for fixed d,m; [L1] requires no Lévy-area sampler. Thus one correction sample has work at most C(2ℓ+2ℓ−1)≤Cchℓ−1, including the finitely many coarse initial levels after increasing Cc.

2.1givenL2F1F3step 1.1algebra

The fine and coarse approximations in Δℓ use the same Brownian path and hence the same exact terminal value XT. By [F3], ∥U+V∥2≤∥U∥2+∥V∥2; with hℓ−1=2hℓ this gives ∥Yℓf(T)−Yℓ−1c(T)∥2≤∥Yℓf(T)−XT∥2+∥Yℓ−1c(T)−XT∥2≤C(hℓ+hℓ−1)≤C′hℓ. For each ℓ≥1, the Lipschitz property yields Var⁡(Δℓ)≤E∣Δℓ∣2≤Lip⁡(ψ)2E∣Yℓf(T)−Yℓ−1c(T)∣2≤Cvhℓ2. At level zero, Δ0=P0 by [F1] and has finite variance by step 1.1; increasing Cv to also dominate Var⁡(P0)/h02 makes the same envelope hold there.

2.2L2F1F3step 1.1algebra

Again by the Lipschitz property and [F3], ∣EPℓ−Eψ(XT)∣≤E∣ψ(Yℓ(T))−ψ(XT)∣≤Lip⁡(ψ)∥Yℓ(T)−XT∥2≤Cbhℓ. The finite-level second-moment statement in step 1.1 verifies the square-integrability premise of [F1].

3.1F2L2A1step 2.1step 2.2step 1.2∎

The estimates in steps 2.1, 2.2, and 1.2 verify [F2] with α=1 and β=2. Since 2>1 and 1≥1/2, applying [F2] proves the stated O(ϵ−2) MLMC work bound. The local variance argument uses only the strong order-one result [L2] for nested commutative-Milstein paths; AC is inherited as stated in [A1].

5 · Examples, counterexamples and false statements

None yet.

Sources