Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

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.

Depends on

Used by

Dependency tree · two levels

25 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