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.

Locally Lipschitz Itô SDE on an open state domain

Definition

Assume AC. Fix a finite horizon T>0, finite dimensions d,m≥1, and an open set U⊆Rd. Use a complete usual filtered probability space and an adapted standard m-dimensional Brownian motion whose increments after time s are independent of Fs, as in d-dimensional Brownian motion and Continuous Brownian Ito processes. Let b:[0,T]×U→Rd and σ:[0,T]×U→Rd×m be Borel maps. Require that they are bounded on every compact subset of [0,T]×U and locally Lipschitz in the state uniformly in time: for every compact K⊂U there is LK<∞ such that, for every t∈[0,T] and x,y∈K, ∣b(t,x)−b(t,y)∣+∥σ(t,x)−σ(t,y)∥F≤LK∣x−y∣. Let ξ be F0-measurable, take values in U almost surely, be independent of the future Brownian increments, and satisfy E∣ξ∣2<∞.

For n≥1, set Kn={x∈U:∣x∣≤n, dist⁡(x,Uc)≥n−1}. When U=Rd, interpret dist⁡(x,Uc)=+∞. If Uc≠∅, the distance function is 1-Lipschitz, so each Kn is closed; it is bounded, hence compact by Heine--Borel. For U=Rd, each Kn is a closed ball and is compact as well. As n increases, the radius bound increases and the distance threshold decreases, so the sets are nested. Every x∈U belongs to int⁡Kn for all sufficiently large n: choose n>∣x∣ and, when Uc≠∅, n−1<dist⁡(x,Uc). Thus their interiors exhaust U. ∣d(x,A)−d(y,A)∣≤d(x,y), so the distance to a fixed nonempty set is 1-Lipschitz Heine-Borel in Rn: with the Euclidean metric a subset of Rn is compact if and only if it is closed and bounded, and the proof by bisection uses no choice principle; the same holds on the real line

A local strong solution up to exit is the compatible family of stopped adapted continuous processes X(n) and stopping times τn Continuous-time stopping times and stopped sigma-algebras such that τn=inf⁡{t∈[0,T]:Xt(n)∉int⁡Kn}∧T,Xt∧τn(n)=ξ+∫0t∧τnb(s,Xs(n)) ds+∫0t∧τnσ(s,Xs(n)) dWs, with the equation holding indistinguishably and with X(n) constant after τn. Empty early Kn simply give τn=0. Compatibility means that for m≥n, X(m) stopped at τn equals X(n) up to indistinguishability. The maximal lifetime is ζ=lim⁡nτn; for t<ζ, the common value of Xt(n) for sufficiently large n defines the maximal local solution Xt.

This definition records a local integral equation; it does not assert that a solution exists or that ζ=T. Those are separate theorem obligations. The local coefficient conditions allow superlinear growth; global Lipschitz hypotheses will be imposed only on the coefficient truncations used in the existence proof.

Depends on

Used by

Dependency tree · two levels

64 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