Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 uniform moments and interpolation increments

Statement

Assume the coefficient, filtered Brownian-motion, and initial-value hypotheses of Euler–Maruyama recursion on a uniform grid with 0<h≤1 and N=T/h∈N, with E∣X0∣p<∞ for a fixed finite p≥2. Let Yk, Yˉ, and Yt be the recursion, step process, and continuous interpolation of Euler–Maruyama step process and continuous interpolation. Then the step process has a predictable representative, the interpolation formula is well-defined, and Y is adapted and continuous. There is a constant Cp,T,L,K,d,m independent of h such that max⁡0≤k≤NE∣Yk∣p+sup⁡0≤t≤TE∣Yˉt∣p+sup⁡0≤t≤TE∣Yt∣p≤Cp,T,L,K,d,m(1+E∣X0∣p). For every t∈[0,T], E∣Yt−Yˉt∣2≤CT,K,d,mh(1+E∣X0∣2). These are pointwise-in-time moment bounds; no claim is made about Esup⁡t≤T∣Yt∣p. The estimates hold under the shared half-Hölder time-modulus contract, although this proof uses only the uniform linear-growth bound and the Brownian increment assumptions.

Facts & Assumptions

Given: The Axiom of Choice; finite d,m; T>0; 0<h≤1 with N=T/h a positive integer; the coefficient assumptions of Euler–Maruyama recursion; an adapted standard m-dimensional Brownian motion whose increments are independent of the current filtration; and an F0-measurable X0 with E∣X0∣p<∞.

[F1]

The recursion step is Yk+1=Yk+b(tk,Yk)h+σ(tk,Yk)(Wtk+1−Wtk). Euler–Maruyama recursion

[L2]

A single step satisfies the conditional p-moment and interpolation increment estimates under the stated linear-growth bound. Euler–Maruyama one-step moment and increment estimates

[L1]

The step process and continuous interpolation use the left endpoint Yk on each interval, with the continuous formula Yt=Yk+b(tk,Yk)(t−tk)+σ(tk,Yk)(Wt−Wtk). Euler–Maruyama step process and continuous interpolation

[F3]

A finite-step predictable integrand with square-integrable coefficients has an Itô integral version equal to its finite sum, even when those coefficients are unbounded. A square-integrable predictable step Itô integral is its finite sum

[F4]

Brownian increments of length r have law Nm(0,rIm). d-dimensional Brownian motion

[F5]

Predictable square-integrable coefficient processes have well-defined finite-coordinate Itô integrals; predictable step processes use the left-endpoint filtration convention. Progressively measurable and predictable processes Ito integral for square-integrable predictable processes

[A1]

The Axiom of Choice is included only because the Brownian-motion and Itô-integral interfaces in [F3] and [F4] adopt it. No arbitrary-index choice is used in the moment or increment estimates. The Axiom of Choice

Proof

1.1F1F4L2givenalgebra

The recursion starts from X0∈Lp. If Yk is Ftk-measurable and in Lp, the one-step estimate [L2] applies with U=Yk and δ=h, so Yk+1 is in Lp. Since Wtk+1−Wtk is measurable at tk+1 and independent of Ftk, the recursion also makes Yk+1 Ftk+1-measurable. Induction gives adapted grid values with finite pth moments.

2.1F3F5L1L2step 1.1givenalgebra

In particular the grid values are square-integrable. On each interval, Yˉs−=Yk and the coefficient vectors b(tk,Yk) and σ⋅j(tk,Yk) are Ftk-measurable. The growth bound gives E∫0T(∣b(ηh−(s),Yˉs−)∣2+∥σ(ηh−(s),Yˉs−)∥F2)ds≤K2∑k=0N−1h(1+E∣Yk∣2)<∞. Each scalar coordinate integrand is therefore predictable and square-integrable, although its coefficients need not be bounded. By [F3], its Itô integral has the finite-sum version; the ordinary drift integral is the corresponding finite sum as well. These are exactly the recursion and interpolation formulas in [L1]. For each t∈[tk,tk+1], Yk is Ft-measurable and Wt−Wtk is Ft-measurable, so the interpolation is adapted. Brownian path continuity and the endpoint recursion make it continuous.

2.2F1F2L2step 1.1algebra

Put uk=E∣Yk∣p. The one-step estimate [L2] gives uk+1≤(1+Cph)uk+Cph, hence 1+uk+1≤(1+Cph)(1+uk). Iteration and [F2] yield 1+uk≤(1+Cph)k(1+u0)≤exp⁡(Cpkh)(1+E∣X0∣p)≤exp⁡(CpT)(1+E∣X0∣p). This bound is uniform in k and h.

3.1L1L2step 2.2algebra

For t∈[tk,tk+1), apply [L2]'s first one-step estimate with U=Yk and δ=t−tk≤h to obtain E∣Yt∣p≤(1+Cpδ)E∣Yk∣p+Cpδ. The step process equals Yk there. The grid estimate from step 2.2 therefore gives the two asserted uniform pointwise moment bounds; at T, YT=YˉT=YN is covered by the grid bound.

3.2L1L2step 2.2algebra

With p=2, [L2]'s second one-step estimate gives E(∣Yt−Yˉt∣2∣Ftk)≤C2,m,K(t−tk)(1+∣Yk∣2) on each grid interval. Taking expectations, using step 2.2, and using t−tk≤h proves E∣Yt−Yˉt∣2≤CT,K,d,mh(1+E∣X0∣2). At grid endpoints the difference is zero by [L1].

4.1A1givenstep 2.2step 3.1step 3.2∎

The induction and estimates use only finite Brownian increments and the explicitly given hypotheses; [A1] is inherited from the interfaces, not spent as a choice principle. A conclusion for a larger p requires X0∈Lp; it does not follow from X0∈L2 alone.

Remarks

The half-Hölder time modulus is retained because this pair shares its coefficient contract with later Euler error results. The present moment and increment estimates do not use that modulus, and they do not imply a strong or weak convergence rate.

Depends on

Used by

Cited to discharge well-definedness by Euler–Maruyama step process and continuous interpolation.

Dependency tree · two levels

48 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