Alphabeta Math
DefinitionDefinition: AI-adaptedProof: AI-generatedPipeline-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.

Gaussian-smoothed data law and transition density

Definition

Assume the Axiom of Choice. Let d≥1, T>0, and let μ be a Borel probability measure on Rd supported in the closed ball B‾(0,R) for some finite R≥0. Let g:[0,T]→(0,∞) be continuously differentiable with 0<gmin⁡≤g(t)≤gmax⁡<∞, and set v(t)=∫0tg(r)2 dr. On a complete filtered probability space with the usual conditions, take X0 with law μ, measurable at time zero and independent of the future Brownian increments. Let W be a standard d-dimensional Brownian motion adapted to the filtration, with Wt−Ws independent of Fs and distributed as Nd(0,(t−s)Id) for every 0≤s<t≤T. Let X be the strong solution of dXt=g(t) dWt with initial value X0. For a>0 define the product Gaussian density ϕa(z)=∏j=1d(2πa)−1/2exp⁡(−zj2/(2a)). For t>0 and 0≤s<t≤T, define

pt(x)=∫Rdϕv(t)(x−z) μ(dz),q(s,x;t,y)=ϕv(t)−v(s)(y−x).

Then pt is a finite, strictly positive, normalized Lebesgue density of the law of Xt. For each x, q(s,x;t,⋅) is a finite, strictly positive, normalized Lebesgue density, and for all Borel sets A,B⊆Rd,

P(Xs∈A, Xt∈B)=∫A∫Bq(s,x;t,y) dy μs(dx),μs:=Law⁡(Xs).

For 0≤s<r<t≤T, these transition densities satisfy

∫Rdq(s,x;r,z)q(r,z;t,y) dz=q(s,x;t,y)(x,y∈Rd).

No Lebesgue density for the initial law μ is assumed.

Facts & Assumptions

Given: The objects and hypotheses in the definition, including full AC and the filtered Brownian increment condition.

[A1]

The full Axiom of Choice is an assumption of the Itô, Brownian, and strong-solution interfaces used here. The Axiom of Choice

[F1]

A probability measure has total mass one, and a random element has law given by the probability of its measurable inverse images. Probability measures and probability spaces

[F2]

The SDE data require a complete usual filtered probability space, an adapted Brownian motion with increments independent of the past, an initial value measurable at time zero and independent of future Brownian increments, and jointly Borel coefficients satisfying uniform Lipschitz and linear-growth bounds. Itô SDE data and strong solution

[F3]

Under those SDE hypotheses there is a unique strong solution, up to indistinguishability, with finite path-sup second moment. Global strong well-posedness for Lipschitz Itô SDEs

[F4]

The deterministic Itô increment over an interval of length t−s has law Nd(0,(v(t)−v(s))Id) and is independent of the past. A deterministic Itô integral has independent Gaussian increments

[F5]

The law of a random element is its probability pushforward. Law or distribution of a random element

[F6]

Independent random elements have the product of their marginal laws as their joint law. Independent random elements have product joint law

[F7]

The Borel sigma-algebra of a Euclidean product is the product of the Euclidean Borel sigma-algebras. The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}

[F8]

The scalar normal law is the pushforward of the standard normal density under the corresponding affine map. Standard normal and normal laws

[F9]

The standard normal density is positive and has Lebesgue integral one. The standard normal density has total mass one

[F10]

A C1 diffeomorphism changes Lebesgue integrals by its absolute Jacobian determinant, including for nonnegative measurable functions. A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions

[F11]

Tonelli gives measurability of parameter integrals of nonnegative product-measurable functions and permits the order of integration to be interchanged. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product

[F12]

The law Nd(m,Σ) exists for positive semidefinite covariance matrices and is the law of a finite-dimensional affine transform of independent standard normals. Multivariate normal law, including singular covariance

Proof

Given: The objects and hypotheses in the definition.

1.1A1F2F3given

For b(t,x)=0 and σ(t,x)=g(t)Id, the state-Lipschitz constant is zero and ∥σ(t,x)∥F=d g(t)≤d gmax⁡, so the linear-growth bound in [F2] holds with K=d gmax⁡. Since ∣X0∣≤R almost surely, E∣X0∣2≤R2. The complete usual filtration, Brownian independence, and initial-value hypotheses are exactly those of [F2]; [F3] therefore gives the unique strong solution used in the definition.

1.2F8F9F10F11given

Since g(r)≥gmin⁡>0, v(t)>0 for t>0 and v(t)−v(s)≥gmin⁡2(t−s)>0 for s<t. The one-dimensional density (2πa)−1/2e−u2/(2a) is obtained from the standard normal density in [F8] by the C1 scaling u↦a u in [F10], so it is positive and has integral one by [F9]. The product formula for ϕa is therefore positive; Tonelli [F11] gives ∫Rdϕa(z) dz=∏j=1d1=1.

1.3F1F9F10F11given

The bound ϕv(t)(x−z)≤(2πv(t))−d/2 and μ(Rd)=1 show pt(x)<∞. Since ϕv(t)(x−z)>0 for every z and μ has mass one, pt(x)>0. Tonelli and translation change of variables give ∫Rdpt(x) dx=∫Rd(∫Rdϕv(t)(x−z) dx)μ(dz)=∫Rd1 μ(dz)=1. The same argument proves that q(s,x;t,⋅) is positive, finite, and normalized for every s<t and x.

2.1A1F4F5F6F7F8F9F10F11F12step 1.1step 1.2step 1.3

Write Zt=Xt−X0=∫0tg(r) dWr. By [F4], Zt is independent of X0, which is measurable at time zero, and has law Nd(0,v(t)Id). By [F12] this law is the product of d scalar normal laws of variance v(t); [F8]–[F11] show that this product law has density ϕv(t). The independent-random-elements product law [F6] and the continuous addition map give, for every Borel A, P(Xt∈A)=∫Rd∫Rd1A(z+w)ϕv(t)(w) dw μ(dz)=∫A(∫Rdϕv(t)(x−z) μ(dz))dx, where Tonelli and translation were used in the last equality. Thus pt is the law density.

3.1F3F4F5F6F7F8F9F10F11F12step 1.1step 1.2step 1.3step 2.1

Fix 0≤s<t≤T. The vector Zs,t=Xt−Xs is independent of Fs by [F4], and Xs is Fs-measurable by the strong-solution conclusion of [F3]. Thus Xs and Zs,t are independent random elements. The same product-law calculation as in step 2.1, now with Zs,t of law Nd(0,(v(t)−v(s))Id), gives for Borel A,B P(Xs∈A, Xt∈B)=∫A(∫Bϕv(t)−v(s)(y−x) dy)μs(dx). This is the asserted transition-density identity.

4.1F9F10F11step 1.2algebra∎

For 0≤s<r<t≤T, put a=v(r)−v(s)>0 and b=v(t)−v(r)>0. In one coordinate, completing the square gives (z−x)2a+(y−z)2b=a+bab(z−bx+aya+b)2+(y−x)2a+b. Applying this identity in each of the d coordinates and integrating the centered Gaussian factor using [F9]–[F11] yields ∫ϕa(z−x)ϕb(y−z) dz=ϕa+b(y−x). Since a+b=v(t)−v(s), this is exactly the claimed Chapman–Kolmogorov identity.

Depends on

Used by

Dependency tree · two levels

77 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