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.

Global strong well-posedness for Lipschitz Itô SDEs

Statement

Assume the data and hypotheses of Itô SDE data and strong solution on [0,T], with T≥0, finite dimensions d,m≥1, Lipschitz constant L, and linear-growth constant K. There is a strong solution X on the given filtered probability space. It is unique up to indistinguishability among strong solutions with the same initial value and Brownian driver, and it satisfies Esup⁡0≤t≤T∣Xt∣2≤(1+3E∣X0∣2)eCTT,CT:=6K2T+24mK2. The bound is independent of any later numerical mesh.

Facts & Assumptions

Given: the complete usual filtered Brownian space, T≥0, finite d,m≥1, jointly Borel coefficients with the stated uniform global Lipschitz and linear-growth constants, an F0-measurable X0∈L2 independent of future Brownian increments, and the Axiom of Choice as required by the Itô-integral interfaces.

[F1]

The Picard map Φ is well-defined on adapted continuous inputs with finite L2 path supremum; it has the path-sup difference estimate with Cd=2TL2+8mL2, the growth estimate with CT=6K2T+24mK2, and the first-iterate bound (4K2T2+16mK2T)(1+E∣X0∣2). Well-definedness and estimates for the Lipschitz SDE map

[F2]

A strong solution is an adapted continuous process on the given space with the locally defined finite-coordinate Itô integral equation satisfied indistinguishably. The complete filtration contains all null sets at time zero. Itô SDE data and strong solution

[F3]

The declared Itô-integral and martingale interfaces use the Axiom of Choice; the Picard recursion, integer bounds, and stopping conventions below make no further selections. The Axiom of Choice

[F4]

Cauchy–Schwarz bounds expectations by second moments; monotone convergence passes to expectations of nonnegative partial sums, and Fatou passes the finite-tail L2 bounds to their pointwise limit. Cauchy-Schwarz for random variables Monotone convergence for the integral Fatou's lemma

[F5]

For a continuous path, its supremum on [0,T] equals the supremum over rational times in [0,T] and the endpoint T. The rationals embed densely in the reals

[F6]

Every adapted continuous solution of the same SDE with the stated initial-value and coefficient hypotheses has finite Esup⁡t≤T∣Yt∣2. A Lipschitz SDE solution has a finite path-sup second moment

[F7]

Every Cauchy sequence of real numbers converges. Hence, on each path where the Picard iterates are uniformly Cauchy, their finitely many coordinate sequences have real limits; these limits form the pointwise Rd limit, and the uniform Cauchy bound passes to that limit. The reals are complete

Proof

1.1F1F2given

If T=0, set X0 as the sole value of the process; both integrals vanish, the path-sup bound follows from (1+3E∣X0∣2)≥E∣X0∣2, and any two solutions with that initial value agree. For T>0, let Φ be the map of [F1], set Xt0=X0, and recursively set Xn+1=Φ(Xn).

2.1F1step 1.1algebra

Put an(t)=Esup⁡u≤t∣Xun−Xun−1∣2 for n≥1. By [F1], a1(T)≤AT:=(4K2T2+16mK2T)(1+E∣X0∣2) and an+1(t)≤Cd∫0tan(s)ds. Induction on n gives an(t)≤ATCdn−1tn−1/(n−1)!.

3.1F4F7step 2.1algebraconstruct

The majorant series ∑n≥1ATCdn−1Tn−1/(n−1)! converges. If AT=0, it is identically zero; if CdT=0, every term after the first is zero; otherwise the ratio of consecutive terms is CdT/n→0. By [F4], Esup⁡∣Xn−Xn−1∣≤an(T) and monotone convergence gives E∑nsup⁡∣Xn−Xn−1∣=∑nEsup⁡∣Xn−Xn−1∣<∞; hence that nonnegative series is finite almost surely. On this event, for every t the vector sequence (Xtn)n is Cauchy, since sup⁡u≤T∣Xum−Xun∣≤∑j=n+1msup⁡u≤T∣Xuj−Xuj−1∣; [F7] gives the coordinate limits and therefore a vector limit Xt. Letting m→∞ in the same inequality bounds sup⁡t≤T∣Xtn−Xt∣ by the tail of the summable series, which tends to zero. Thus the convergence is almost surely uniform. For finite tails the L2 triangle inequality follows by expanding the square and applying Cauchy–Schwarz, so ∥Xm−Xn∥L2(sup⁡)≤∑j=n+1maj(T). Fatou's lemma [F4] then gives Esup⁡t≤T∣Xtn−Xt∣2≤(∑j=n+1∞aj(T))2→0.

4.1F2F5step 3.1given

Let A be the measurable probability-one event on which that series of path suprema is finite; measurability follows because each supremum is a supremum over the countable dense set in [F5]. Uniform convergence makes X continuous on A; completeness gives Ac∈F0, so set Xt=X0 on Ac. For each fixed t, the limit on A of the Ft-measurable Xtn, together with the F0-measurable value on Ac, is Ft-measurable. Thus X is adapted and continuous, and its L2 path-sup convergence places it in the class of [F2].

5.1F1F2step 3.1step 4.1

For every n, Xn+1=Φ(Xn). The difference estimate of [F1] gives Esup⁡u≤T∣Φ(Xn)u−Φ(X)u∣2≤CdTEsup⁡u≤T∣Xun−Xu∣2→0. Since Xn+1→X in the same norm by step 3.1, uniqueness of an L2 limit implies Φ(X)=X indistinguishably. Hence X satisfies the SDE.

6.1F1step 5.1algebra

Write f(t)=Esup⁡u≤t∣Xu∣2. The growth estimate of [F1] and X=Φ(X) imply f(t)≤3E∣X0∣2+CT∫0t(1+f(s))ds. Put g=1+f and H(t)=1+3E∣X0∣2+CT∫0tg(s)ds. Then g≤H, H(0)=1+3E∣X0∣2, and H′(t)=CTg(t)≤CTH(t) almost everywhere. Consequently (e−CTtH(t))′≤0 almost everywhere, so f(T)≤g(T)≤(1+3E∣X0∣2)eCTT.

7.1F1F2F3F6step 5.1∎

If Y is any other strong solution with the same data, then Y=Φ(Y) by [F2] and Y∈HT by [F6]. The difference estimate in [F1] gives q(t):=Esup⁡u≤t∣Xu−Yu∣2≤Cd∫0tq(s)ds. With Q(t)=Cd∫0tq(s)ds, one has Q(0)=0 and Q′≤CdQ almost everywhere, hence Q=q=0. Thus sup⁡t≤T∣Xt−Yt∣=0 almost surely, which is indistinguishability. AC is exactly the inherited assumption [F3].

Remarks

The proof uses no ellipticity or nondegeneracy of σ. The result gives strong existence, uniqueness, and moment control only; it implies no transition-density regularity, forward Kolmogorov uniqueness, or reversal theorem.

Sources

Van Handel, Chapter 5.1, Theorems 5.1.3 and 5.1.5 with proofs, and van der Vaart, Section 7.1, Theorem 7.8 with proof, independently develop Picard iteration and Gronwall uniqueness. The proof here supplies the vector coordinate estimates, complete path-space limit argument, and exact finite-horizon supremum bound under the displayed hypotheses.

Depends on

Used by

Dependency tree · two levels

54 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