Alphabeta Math
ExampleConstruction: AI-adaptedVerification: 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.

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ϵ.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

33 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