Alphabeta Math
Pipeline-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 densities, scores, and endpoint limits — Examples

1 · Prerequisites

2 · Logical flowchart

3 · Definitions, theorems and proofs

None yet.

4 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-generatedOpen item page →

Smoothing a two-point data law

Example

For z∈Rd, δz denotes the probability concentrated at z. Let d≥1, T>0, a,b∈Rd, α∈[0,1], and μ=αδa+(1−α)δb. Let g:[0,T]→(0,∞) be continuously differentiable with 0<gmin⁡≤g(t)≤gmax⁡<∞, set v(t)=∫0tg(r)2 dr, and define ϕc(z)=(2πc)−d/2exp⁡(−∣z∣2/(2c)) for c>0. For every 0<t≤T, the smoothed law has density

pt(x)=αϕv(t)(x−a)+(1−α)ϕv(t)(x−b).

At time zero its law remains μ. If a=b, or if α is 0 or 1, the displayed density reduces to the single Gaussian centered at the atom carrying all mass.

Facts & Assumptions

Given: d,T,a,b,α, the finite probability measure μ, and the scalar-noise smoothing convention.

[A1]

The full Axiom of Choice is inherited from the Gaussian smoothing interfaces. The Axiom of Choice

[F1]

For a compactly supported initial law, positive-time smoothing has density pt(x)=∫ϕv(t)(x−z) μ(dz) and initial law μ. Gaussian-smoothed data law and transition density

Proof

Given: The example's parameters and the Gaussian smoothing density in [F1].

1.1A1F1givenalgebra

The measure μ is a Borel probability supported in the closed ball of radius max⁡(∣a∣,∣b∣), so [F1] applies. For 0<t≤T, substitute μ=αδa+(1−α)δb in the defining integral. By the defining property of point masses, integration of any nonnegative Borel function h gives ∫h(z) μ(dz)=αh(a)+(1−α)h(b). Taking h(z)=ϕv(t)(x−z) yields the displayed formula, using ϕc(z)=ϕc(−z). The initial law is μ by [F1].

2.1F1step 1.1algebra∎

If a=b, the two weights sum to one and both Gaussian terms have the same center. If α=1, only the first term remains; if α=0, only the second remains. In each case the stated single Gaussian is normalized and positive by [F1].

ExampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

A singular line law has a smooth positive-time density

Example

Let λ1 be one-dimensional Lebesgue measure and define μ(A)=λ1({u∈[0,1]:(u,0)∈A}) for every Borel A⊆R2. The box measure formula gives λ1([0,1])=1, so μ is a Borel probability supported on L=[0,1]×{0}. Let g:[0,T]→(0,∞) be continuously differentiable with 0<gmin⁡≤g(t)≤gmax⁡<∞ and set v(t)=∫0tg(r)2 dr. For every t>0, the Gaussian convolution of μ has the density

pt(x1,x2)=12πv(t)∫01exp⁡ ⁣(−(x1−u)2+x222v(t))du.

The initial law μ is singular with respect to two-dimensional Lebesgue measure, meaning it assigns mass one to a Borel set of planar Lebesgue measure zero, while pt is strictly positive and infinitely differentiable in (x1,x2) for each t>0.

Facts & Assumptions

Given: A uniform random variable on [0,1], the embedded line-supported law, and the compactly supported scalar-noise Gaussian smoothing setup.

[A1]

The full Axiom of Choice is inherited from the Gaussian smoothing and probability interfaces. The Axiom of Choice

[A2]

Countable Choice is assumed by the box-measure theorem used below; the item's SDE and smoothing interfaces also carry the stronger Full AC assumption. The Axiom of Countable Choice (ACω)

[F1]

For any compactly supported probability law in R2, the positive-time law has the explicit Gaussian-convolution density and is strictly positive. Gaussian-smoothed data law and transition density

[F2]

The convolution density is infinitely differentiable in space for each positive time. Gaussian smoothing density and forward equation

[F4]

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

Proof

Given: The example's random vector and the Gaussian smoothing setup.

1.1A2F3F4givenalgebra

The map u↦(u,0) is continuous and hence Borel measurable; [F4] makes the formula in the statement its pushforward measure, and [A2, F3] give its total mass λ1([0,1])=1. It assigns mass one to the Borel segment L. For each integer n≥1, the segment lies in the rectangle [0,1]×[−1/n,1/n], whose Lebesgue area is 2/n by [F3]. Therefore its outer measure is at most 2/n for every n, hence its Lebesgue measure is zero. Since μ(L)=1 and Lebesgue measure of L is zero, μ is singular with respect to two-dimensional Lebesgue measure.

2.1A1F1F2step 1.1given∎

Applying the convolution formula [F1] to μ gives pt(x)=∫01ϕv(t)(x−(u,0)) du. In dimension two, ϕv(t)(x−(u,0))=(2πv(t))−1exp⁡(−((x1−u)2+x22)/(2v(t))), which is the displayed expression. The integrand is strictly positive for every u, so its integral over a unit interval is strictly positive; [F2] gives infinite spatial differentiability for every t>0. Thus the initial singularity does not prevent positive-time smoothing.

ExampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

The Gaussian coupling bound is exact for a point mass

Example

For a∈Rd, δa denotes the probability measure concentrated at a. For q>0, write ϕq(z)=(2πq)−d/2exp⁡(−∣z∣2/(2q)).

Fix an integer d≥1, a horizon T>0, 0<ϵ<T, a∈Rd, and c>0. Take μ=δa and constant scalar noise g(t)=c, so v(ϵ)=c2ϵ. Let μϵ be the Gaussian-smoothed law with density ϕc2ϵ(x−a). For Borel probability laws with finite second moments, define W2 as the square root of the infimum of the quadratic cost over all Borel couplings. Then

W2(μϵ,δa)=d cϵ.

The coupling bound from the endpoint theorem is therefore an equality in this case.

Facts & Assumptions

Given: The point-mass initial law, constant positive noise, and quadratic Wasserstein distance.

[A1]

The full Axiom of Choice is inherited from the smoothing and coupling interfaces. The Axiom of Choice

[F1]

For constant g=c, the positive-time smoothed law of δa has Gaussian density ϕc2ϵ(x−a). Gaussian-smoothed data law and transition density

[F2]

The endpoint coupling estimate is W2(μϵ,μ)≤d v(ϵ). Gaussian smoothing converges weakly at the endpoint

[F3]

W22 is the infimum of quadratic costs among Borel couplings, and its arguments must have finite second moments. The Euclidean quadratic Wasserstein space

[F4]

A random element's law is its probability pushforward, and the Euclidean product Borel sigma-algebra is the product sigma-algebra. Law or distribution of a random element The Borel product of R^m and R^n is the Borel sigma-algebra of R^{m+n}

Proof

Given: The example's parameters and the coupling definition in [F3].

1.1A1F1F3given

The density in [F1] is the product of d one-dimensional normal densities translated by a. Each coordinate has mean aj and variance c2ϵ, so its second moment about a is dc2ϵ; both laws therefore have finite second moments.

2.1F2F3F4step 1.1given∎

If π is any coupling of μϵ and δa, its second marginal assigns mass one to {a}, hence π(Rd×{a})=1. Its quadratic cost is therefore ∫∣x−y∣2 π(dx,dy)=∫∣x−a∣2 μϵ(dx)=dc2ϵ. There is at least one coupling: the continuous map x↦(x,a) pushes μϵ forward to a Borel probability on Rd×Rd with marginals μϵ and δa by [F4]. Thus the infimum over all couplings equals this common cost. Taking the square root gives the stated equality. The endpoint bound [F2] has the same value because v(ϵ)=c2ϵ.

ExampleConstruction: AI-adaptedVerification: AI-generatedjudge pass (gpt-6-luna)Open item page →

The score Lipschitz bound blows up for a point mass

Example

For a∈Rd, δa denotes the probability measure concentrated at a. For q>0, write ϕq(z)=(2πq)−d/2exp⁡(−∣z∣2/(2q)).

Let d≥1, T>0, and a∈Rd; take μ=δa. Let g:[0,T]→(0,∞) be continuously differentiable with 0<gmin⁡≤g(t)≤gmax⁡, and set v(t)=∫0tg(r)2 dr. Then pt(x)=ϕv(t)(x−a) and

st(x)=∇log⁡pt(x)=−x−av(t),Dxst(x)=−Idv(t).

The exact global Lipschitz constant of st is 1/v(t). For every 0<ϵ<T, its best uniform Lipschitz constant on [ϵ,T] is 1/v(ϵ), which diverges as ϵ↓0.

Facts & Assumptions

Given: The point-mass initial law, Gaussian convolution, and score convention from the example.

[A1]

The full Axiom of Choice is inherited from the smoothing and score interfaces. The Axiom of Choice

[F1]

The Gaussian-smoothed density of a compact initial law is the mixture pt(x)=∫ϕv(t)(x−z) μ(dz). Gaussian-smoothed data law and transition density

[F2]

The score and posterior mean satisfy st(x)=−(x−mt,x)/v(t) and its derivative is −Id/v(t)+Ct,x/v(t)2. Gaussian-mixture score identities and a global Lipschitz bound

Proof

Given: The example's point mass and the score identities in [F2].

1.1A1F1F2given

Substituting μ=δa into [F1] gives pt(x)=ϕv(t)(x−a). The posterior measure νt,x is then δa, so its mean is a and its covariance matrix is zero.

2.1F2step 1.1givenalgebra∎

Applying [F2] yields st(x)=−(x−a)/v(t) and Dxst=−Id/v(t). For any x≠y, ∣st(x)−st(y)∣=∣x−y∣/v(t), so the global Lipschitz constant is exactly 1/v(t). On [ϵ,T], v is increasing, making the largest such constant 1/v(ϵ). Since v(ϵ)≤gmax⁡2ϵ→0 and v(ϵ)>0, this bound tends to infinity.

Sources