Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-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.

Uniform second moment for Euler–Maruyama on predictable grids

Statement

Work on a filtered probability space satisfying the usual conditions for the It^o integral. Assume the coefficient and Brownian hypotheses of Euler–Maruyama recursion on [0,T]: finite state/noise dimensions, a square integrable F0-measurable initial value, globally Lipschitz state dependence, linear growth, and the stated half-Hölder time modulus. Let a finite predictable grid as in Predictable stopping-time grid have N<∞ almost surely and maximum step at most hmax⁡≤T. Form the complete continuous Euler interpolation by applying the predictable-grid updates in Euler–Maruyama on a predictable grid with bridge-refinement status on every interval. A finite-budget execution returns this interpolation as complete when its budget B satisfies N≤B. Then a finite constant C=C(T,K,m,E∣X0∣2) satisfies Esup⁡0≤t≤T∣Yt∣2≤C. The bound is uniform over the controller and the number and placement of its predictable steps; no deterministic bound on N is needed for this moment estimate.

Facts & Assumptions

Given: AC; the usual filtered-space hypotheses for the It^o integral; the global Lipschitz, linear-growth and time-modulus hypotheses of Euler–Maruyama recursion; X0∈L2; a finite predictable grid with N<∞ almost surely and maximum step at most hmax⁡≤T; and its complete continuous Euler interpolation Y.

[F1]

The update on each interval is Yt=Yn+b(τn,Yn)(t−τn)+σ(τn,Yn)(Wt−Wτn), with coefficients measurable at Fτn. Euler–Maruyama on a predictable grid with bridge-refinement status Predictable stopping-time grid

[F2]

Stopping a locally square-integrable predictable It^o integral at a stopping time is the same as integrating the predictable integrand multiplied by 1[0,ρ]. Stopping an Ito integral

[F3]

A square-integrable coefficient measurable at Fτ on a stopping-time interval (τ,σ] gives a predictable step whose It^o integral is the stopped Brownian increment times that coefficient. Itô integral of a step on a stopping-time interval

[F4]

For a scalar Brownian It^o integral Mt=∫0tHs dWs, Esup⁡t≤T∣Mt∣2≤4E∫0THs2ds. Doob maximal bound for the Ito integral

[F5]

The coefficient growth condition gives ∣b(t,x)∣2+∥σ(t,x)∥F2≤K2(1+∣x∣2). Euler–Maruyama recursion

[F6]

If a continuous nonnegative u satisfies u(t)≤A+C∫0tu(s)ds, then u(t)≤AeCt. Gronwall's integral inequality with variable and constant coefficients

[F7]

If Zk→Z almost surely and Zk≥0, then EZ≤lim inf⁡kEZk. Fatou's lemma

[F8]

For a continuous adapted path, the running supremum is measurable from its values on a dense countable time set; this makes the first hitting time of a closed level a stopping time. Continuous-time stopping times and stopped sigma-algebras The rationals embed densely in the reals

[F9]

If measurable random variables converge almost surely and are dominated in absolute value by an integrable random variable, their expectations converge. Dominated convergence

[A1]

AC is inherited through the Brownian and It^o-integral interfaces [F1]–[F4]. The stopping and localization argument uses no further choice. The Axiom of Choice

Proof

1.1F1F2F3F5F8F9given

For R>0 define ρR=inf⁡{t≤T:∣Yt∣≥R}∧T, taking ρR=T if the set is empty. For an integer k≥1, set θR,k=ρR∧τk and YtR,k=Yt∧θR,k. Continuity, adaptedness and [F8] make ρR a stopping time, so θR,k is a stopping time. For the first k intervals, multiply each left-endpoint coefficient by 1{∣Yn∣≤∣X0∣∨R}. These factors are measurable at Fτn, the truncated coefficients are in L2 by [F5], and they agree with the original coefficients before θR,k, except at time endpoints which do not affect the integrals. Thus [F3] gives their finite-step integral representation, to which [F2] applies. Before θR,k, every active left-endpoint value is bounded by ∣X0∣∨R; [F5] and X0∈L2 therefore give finite expected coefficient energy. Applying [F2] at θR,k to the finite-step integral representation yields YtR,k=X0+∫0t1[0,θR,k](s)bˉs ds+∫0t1[0,θR,k](s)σˉs dWs, where Yˉs=Yn, bˉs=b(τn,Yn) and σˉs=σ(τn,Yn) on active intervals, with arbitrary values at s=0. Also sup⁡u≤t∣YuR,k∣≤∣X0∣∨R, so UR,k(t):=Esup⁡u≤t∣YuR,k∣2 is finite and continuous by [F9], since the path suprema converge pointwise with t and are bounded by the integrable variable (∣X0∣∨R)2.

2.1F4F5step 1.1algebra

Write each coordinate of the stopped martingale as Mi=∑j=1mMij, with Mtij=∫0t1[0,θR,k](s)σˉsij dWsj. For every i,j, [F4] applies to the scalar Brownian coordinate Wj. The inequalities sup⁡t∣∑jMtij∣2≤m∑jsup⁡t∣Mtij∣2 and ∣a+b+c∣2≤3(∣a∣2+∣b∣2+∣c∣2) give the martingale bound 4mE∫0t1[0,θR,k]∥σˉs∥F2ds. Cauchy–Schwarz bounds the squared drift supremum by T∫0t1[0,θR,k]∣bˉs∣2ds. On an active interval with s≤θR,k, its left endpoint satisfies τn<s≤θR,k, so Yˉs=Yn=YτnR,k and ∣Yˉs∣2≤sup⁡u≤s∣YuR,k∣2. Outside this range the stopped-integral indicator is zero; using [F5] in the representation of step 1.1 yields UR,k(t)≤3E∣X0∣2+(3T+12m)K2∫0t(1+UR,k(s))ds.

3.1F6step 2.1algebra

Apply [F6] to 1+UR,k with A=1+3E∣X0∣2 and C=(3T+12m)K2. Then UR,k(T)≤(1+3E∣X0∣2)e(3T+12m)K2T−1, uniformly in R,k.

4.1A1F7step 3.1given∎

Since N<∞ almost surely, for almost every path τk=T for all sufficiently large k. Thus YR,k eventually equals YρR uniformly on [0,T]; [F7] passes the bound of step 3.1 to Esup⁡t≤T∣Yt∧ρR∣2. Each continuous path Y is bounded on [0,T], so YρR→Y uniformly almost surely as R→∞, and [F7] gives the stated bound. The cases X0=0 or K=0 are covered by the same inequality, and no lower mesh bound or deterministic bound on N is used. AC is inherited only through [A1].

Depends on

Used by

Dependency tree · two levels

66 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