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

Gaussian smoothing density and forward equation

Statement

Assume the Axiom of Choice. Fix d≥1, T>0, a finite R≥0, and a Borel probability measure μ on Rd supported in B‾(0,R). 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, let X0 be measurable at time zero with law μ and independent of future Brownian increments. Let W be a standard d-dimensional Brownian motion adapted to the filtration, with Wt−Ws independent of Fs for every s<t, and let X be the unique strong solution of Xt=X0+∫0tg(r) dWr. For a>0 define ϕa(z)=∏j=1d(2πa)−1/2exp⁡(−zj2/(2a)). For t>0 set

pt(x)=∫Rdϕv(t)(x−z) μ(dz),

and set μ0=μ. Let Cc∞(Rd) denote the real infinitely differentiable functions with compact support. For every t>0, pt is positive and infinitely differentiable in x. On each interval [ϵ,T] with 0<ϵ<T, it is continuously differentiable in time and satisfies

∂tpt(x)=g(t)22Δxpt(x),Δx=∑j=1d∂xj2.

A family (νt)0≤t≤T of Borel probability measures is narrowly continuous when t↦∫f dνt is continuous for every bounded continuous real function f. It is a weak forward solution with initial law μ when it is narrowly continuous, ν0=μ, and, for every t∈[0,T] and every real-valued function ψ:[0,T]×Rd→R with continuous first time derivative and continuous spatial derivatives through order two, whose spatial support lies in one compact set for all s, it satisfies

∫Rdψ(t,x) νt(dx)−∫Rdψ(0,x) μ(dx)=∫0t∫Rd(∂sψ(s,x)+g(s)22Δxψ(s,x))νs(dx) ds.

Then (μt)0≤t≤T, where μt(dx)=pt(x) dx for t>0 and μ0=μ, is the unique narrowly continuous weak forward solution with initial law μ. No density for μ at t=0 is asserted.

Facts & Assumptions

Given: Full AC, the compactly supported initial probability measure, the scalar noise coefficient, and the density and transition formulas from the preceding definition.

[A1]

The full Axiom of Choice is assumed by the inherited Brownian and Itô interfaces. The Axiom of Choice

[F1]

For t>0, pt is the positive normalized density of the strong solution's law, and the initial law is μ. Gaussian-smoothed data law and transition density

[F2]

The SDE data include a complete usual filtered probability space, adapted Brownian motion with increments independent of the past, and an initial value independent of future increments. Itô SDE data and strong solution

[F3]

Under these Lipschitz and linear-growth hypotheses there is a unique strong solution with continuous paths. Global strong well-posedness for Lipschitz Itô SDEs

[F4]

Dominated convergence passes almost-everywhere limits through an integral under one integrable majorant. Dominated convergence

[F5]

Fubini interchanges absolutely integrable iterated Lebesgue integrals on sigma-finite product spaces. Fubini's theorem for L^1 functions on a sigma-finite product

[F6]

Narrow continuity and weak convergence of Borel probability measures are tested by bounded continuous real functions. Weak convergence of borel probability measures

[F7]

Two Borel probability laws on R with the same characteristic function are equal under AC. Uniqueness of a law from its characteristic function

[F8]

Borel probability laws on Rd are determined by the laws of all one-dimensional linear projections under AC. Cramer wold device

[F9]

The law of a random element is the probability of its measurable inverse images. Law or distribution of a random element

[F10]

A centered normal law with covariance aId has characteristic function θ↦exp⁡(−a∣θ∣2/2). Characteristic function of a multivariate normal law

Proof

Given: The statement's hypotheses and definitions.

1.1F1F4given

For a>0, direct differentiation gives ∂aϕa(z)=12Δzϕa(z). Every finite spatial derivative of ϕa(z) is a polynomial in z and a−1 times ϕa(z). Fix ϵ>0 and compact sets K⊂Rd and J⊂[ϵ,T]. Since a=v(t) is bounded above and away from zero on J, and z lies in the compact support of μ, each such derivative is uniformly bounded for x∈K, t∈J, and z∈supp⁡μ. Difference quotients are bounded by the same type of constant on a slightly larger compact set, by the one-variable fundamental theorem of calculus. Dominated convergence [F4] therefore permits differentiation under the finite measure μ to every spatial order and once in time. The chain rule and v′(t)=g(t)2 give ∂tpt(x)=∫g(t)22Δxϕv(t)(x−z) μ(dz)=g(t)22Δxpt(x). Positivity follows from the positive kernel and the nonzero probability measure.

1.2F2F3F4F6F9given

The SDE setup in [F2] and well-posedness theorem [F3] give a common continuous-path event. For bounded continuous f, Xt→Xs almost surely as t→s on that event, and [F4] applied to the bounded variables f(Xt) gives Ef(Xt)→Ef(Xs). By [F9], these expectations are ∫f dμt; also μ0=μ.

1.3F1F4given

Fix t∈(0,T] and f∈Cc∞(Rd). For 0≤s<t set h(s,x)=∫Rdf(x+z)ϕv(t)−v(s)(z) dz,h(t,x)=f(x). For a=v(t)−v(s)>0, write Paf(x)=∫f(x+z)ϕa(z) dz. Differentiating the explicit Gaussian and integrating by parts twice, with boundary terms zero because f is compactly supported, gives ∂aPaf=12PaΔf. Thus ∂sh+12g(s)2Δxh=0 for s<t. Spatial derivatives may be moved onto f, so h, ∇h, and Δh are bounded by the corresponding sup norms of f, ∇f, and Δf. For any such derivative q and η>0, sup⁡x∣Paq(x)−q(x)∣≤∥∇q∥∞η+2∥q∥∞∫∣z∣>ηϕa(z) dz. The tail equals ∫∣u∣>η/aϕ1(u) du and tends to zero as a↓0 because ϕ1 is integrable. Letting first a↓0 and then η↓0 proves uniform convergence of Paq to q, including q=Δf; hence the backward equation and bounds extend continuously to s=t.

2.1F1F4F5F6step 1.1step 1.2given

At t=0 the weak identity has equal endpoint terms and a zero right-hand integral. For t>0, fix an admissible test ψ and 0<δ<t. On the common compact spatial support, ps and ∂sps are continuous and bounded for s∈[δ,t] by step 1.1. Differentiation under the space integral is therefore justified by [F4]. Using step 1.1 and integrating by parts twice in each coordinate, with no boundary terms because ψ has compact spatial support, gives dds∫ψ(s,x)ps(x) dx=∫(∂sψ(s,x)+g(s)22Δxψ(s,x))ps(x) dx. Integrating from δ to t gives the weak identity with lower endpoint ∫ψ(δ,x) μδ(dx). Its difference from ∫ψ(0,x) μ(dx) tends to zero: the term sup⁡x∣ψ(δ,x)−ψ(0,x)∣ tends to zero by the bounded continuous time derivative on the common compact support, and ∫ψ(0,⋅) dμδ→∫ψ(0,⋅) dμ by step 1.2. The omitted right-hand integral over [0,δ] tends to zero because each μs has mass one and the derivatives of ψ and g are bounded on the common compact support. Letting δ↓0 proves the weak identity, so μt is a weak forward solution.

3.1step 2.1step 1.3given

Let (νs)0≤s≤T be any weak forward solution with initial law μ. Choose a smooth cutoff χL equal to one on ∣x∣≤L and zero on ∣x∣≥2L, with ∣∇χL∣≤C/L and ∣ΔχL∣≤C/L2. For completeness, take χL(x)=η(∣x∣2/L2), where ρ(u)=0 for u≤0, ρ(u)=e−1/u for u>0, and η(u)=ρ(4−u)/(ρ(4−u)+ρ(u−1)). When t<T, extend h to t<s≤T by h(s,x)=f(x)−12(s−t)g(t)2Δf(x). Its value and spatial derivatives through order two match at t, and both one-sided time derivatives equal −12g(t)2Δf by step 1.3. Thus ψL(s,x)=χL(x)h(s,x) is an admissible test on all of [0,T]. On [0,t], step 1.3 gives ∂sψL+g(s)22ΔψL=g(s)22(2∇χL⋅∇h+hΔχL), whose absolute value is at most Ct(L−1∥∇f∥∞+L−2∥f∥∞). Since each νs is a probability, the time-integrated error tends to zero as L→∞. For all sufficiently large L, χL=1 on the support of f and on the support of μ. Letting L→∞ in the weak identity therefore gives ∫f dνt=∫h(0,x) μ(dx). The same cutoff argument applied to the weak solution μt from step 2.1 gives ∫f dμt=∫h(0,x) μ(dx). Thus νt and μt agree on every compactly supported smooth real function.

4.1A1F1F4F5F7F8F10step 3.1given∎

For any fixed t>0, any θ∈Rd, and integer n≥1, apply step 3.1 to χn(x)cos⁡(θ⋅x) and χn(x)sin⁡(θ⋅x) and combine the resulting identities into one complex identity. Let n→∞. The left side converges to the characteristic function of νt by dominated convergence [F4]. For each fixed x, the backward averages on the right converge by [F4] and [F10] to eiθ⋅xe−v(t)∣θ∣2/2; they are bounded by one, so another application of [F4] gives the limit e−v(t)∣θ∣2/2∫eiθ⋅x μ(dx). By [F1], μt is the convolution of μ with the centered Gaussian of covariance v(t)Id; Fubini [F5] and [F10] show that its characteristic function is exactly this product. Hence the vector characteristic functions of νt and μt agree for every θ. For each u∈Rd, take θ=ru for arbitrary r∈R; scalar uniqueness [F7] gives equality of the laws of u⋅x under the two measures, and [F8] then gives νt=μt. This holds for every t>0; at t=0 both laws equal μ by the initial condition, proving uniqueness. AC is used only through the inherited Brownian/Itô interfaces and the cited Fourier-uniqueness results.

Depends on

Used by

Dependency tree · two levels

61 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