Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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 step process and continuous interpolation

Definition

Use the data and grid of Euler–Maruyama recursion, and let Y0,…,YN be its recursion. The left-endpoint map is ηh(t)=max⁡{tk:tk≤t},0≤t≤T. The right-continuous step process is Yˉt=Yk(tk≤t<tk+1),YˉT=YN. The continuous interpolation is the pathwise process Yt=Yk+b(tk,Yk)(t−tk)+σ(tk,Yk)(Wt−Wtk)(tk≤t≤tk+1). At a shared grid endpoint the formulas agree because the recursion gives Yk+1=Yk+b(tk,Yk)h+σ(tk,Yk)(Wtk+1−Wtk). In particular Ytk=Yk for every k, including YT=YN.

For stochastic integration, define the predictable left-endpoint version by Yˉ0−=Y0 and Yˉs−=Yk on (tk,tk+1], and set ηh−(0)=0 and ηh−(s)=tk on (tk,tk+1]. Its coefficient integrands use the same fixed left endpoints. When the recursion is adapted, each coordinate of Yˉ− and each coefficient composition is a predictable finite-step process: on (tk,tk+1] its value is Ftk-measurable. These coefficients need not be bounded, so the integrands need not be elementary in the bounded-coefficient sense of Elementary predictable Brownian integrands. Values at the finitely many grid points do not change either integral. Once square integrability is established, A square-integrable predictable step Itô integral is its finite sum identifies each finite-coordinate Itô integral of Ito integral for square-integrable predictable processes with its finite-sum version, giving the equivalent formula Yt=X0+∫0tb(ηh−(s),Yˉs−) ds+∑j=1m∫0tσ⋅j(ηh−(s),Yˉs−) dWsj. where ηh−(s)=tk on (tk,tk+1] and σ⋅j denotes column j of the matrix.

The justified-by theorem Euler–Maruyama uniform moments and interpolation increments ↗ establishes the required integrability and well-definedness under the stated coefficient and initial-moment conditions.

Remarks

For well-definedness on any allowed grid, including h>1, put u=t/T, F~u=FTu, W~u=T−1/2WTu, b~(u,x)=Tb(Tu,x), and σ~(u,x)=T σ(Tu,x) on [0,1]. The rescaled Brownian increments have covariance (v−u)Im and are independent of F~u for u<v. The rescaled coefficients inherit the Borel, state-Lipschitz, linear-growth and half-Hölder time-modulus assumptions with finite constants depending on T. The normalized mesh is 1/N≤1, and substitution in the recursion and interpolation gives exactly Yk and YTu, respectively. Thus Euler–Maruyama uniform moments and interpolation increments ↗, applied to these rescaled data with p=2, gives adapted square-integrable grid values and an adapted continuous interpolation for every original h>0.

In particular, the original coefficient integrands satisfy E∫0T(∣b(ηh−(s),Yˉs−)∣2+∥σ(ηh−(s),Yˉs−)∥F2) ds≤K2∑k=0N−1h(1+E∣Yk∣2)<∞. Their predictability follows from left-endpoint measurability as above. The drift integral is its finite sum, and A square-integrable predictable step Itô integral is its finite sum identifies every coordinate Itô integral with its finite sum on one common measurable probability-one event. This gives the displayed integral representation without any mesh restriction. The quantitative estimates in the justified-by theorem retain their stated 0<h≤1 restriction when applied directly to the original data.

The distinction between Yˉ and Yˉ− is only at deterministic grid times. The first records the value used at each time by the left-endpoint convention; the second is the predictable representative used by the stochastic integral.

Depends on

Used by

Dependency tree · two levels

38 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