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

An isotropic Gaussian Wasserstein geodesic

Example

Assume AC. Let d≥1, m0,m1∈Rd, and σ0,σ1>0. Let ξ have density (2π)−d/2e−∣z∣2/2 on Rd, put mt=(1−t)m0+tm1 and σt=(1−t)σ0+tσ1, and set μt=Law⁡(mt+σtξ) for 0≤t≤1. Then μt is a constant-speed W2 geodesic, meaning W2(μs,μt)=∣t−s∣W2(μ0,μ1) for all s,t∈[0,1], from the laws of m0+σ0ξ to the law of m1+σ1ξ, with W2(μ0,μ1)2=∣m1−m0∣2+d(σ1−σ0)2. The Borel field vt(x)=m1−m0+σ1−σ0σt(x−mt) solves the continuity equation and has action equal to this squared distance, hence is minimum-action. The strict positivity of σ0 and σ1 ensures σt>0 throughout; degenerate covariances are excluded.

Example references

Facts & Assumptions

Given: AC, d,m0,m1,σ0,σ1 as stated, and the standard Gaussian law on Rd.

[F1]
[F2]

Each coordinate has mean zero and variance one by the normal moment theorem; finite sums give Eξ=0 and E∣ξ∣2=d. Under any coupling of the scaled laws, the centered marginals therefore have second moments dσ2 and dτ2. Location-scale normal laws have their stated mean and variance Moments, variance, and covariance on a probability space Linearity, monotonicity, and the modulus bound for expectation Change of variables for expectation

[F3]

Holder bounds the centered cross moment by (E∣U∣2E∣V∣2)1/2. Holder's inequality for integrals, including the endpoint cases

[F4]

The minimum-velocity theorem identifies the least action of an AC2 curve with the integral of its squared metric speed. AC2 curves admit a unique minimum-action velocity field

[F5]

Dominated convergence passes bounded continuous test functions through the Gaussian law as its affine parameters vary continuously. Dominated convergence

Proof

1.1A1F1F2F3algebra

Write μm,σ=Law⁡(m+σξ). Let X,Y be any coupling of μm,σ and μn,τ, and set U=X−m, V=Y−n. Since EU=EV=0, expansion gives E∣X−Y∣2=∣m−n∣2+E∣U∣2+E∣V∣2−2E(U⋅V). By [F1] and [F2], this is at least ∣m−n∣2+d(σ2+τ2−2στ)=∣m−n∣2+d(σ−τ)2. Conversely, couple the two laws by X=m+σξ, Y=n+τξ using the same standard Gaussian vector. The moments in [F1] give E∣X−Y∣2=∣m−n∣2+d(σ−τ)2. Taking the infimum proves W2(μm,σ,μn,τ)2=∣m−n∣2+d(σ−τ)2.

2.1step 1.1algebra

Apply step 1.1 to (ms,σs) and (mt,σt). Their differences are (t−s)(m1−m0) and (t−s)(σ1−σ0), so W2(μs,μt)=∣t−s∣∣m1−m0∣2+d(σ1−σ0)2. This proves the constant-speed geodesic claim and identifies its speed.

3.1A1F1F2F3F4F5F6step 1.1step 2.1algebra∎

For each z, define γz(t)=mt+σtz. Direct differentiation gives γ˙z=m1−m0+(σ1−σ0)z=vt(γz(t)). For any bounded continuous test f, dominated convergence [F4] gives ∫fdμt=E[f(mt+σtξ)] continuously in t, so the curve is narrowly continuous. For a compactly supported smooth test φ, the chain rule [F6] gives ddtφ(t,γξ(t))=∂tφ(t,γξ(t))+∇φ(t,γξ(t))⋅vt(γξ(t)). Integrate over t and the Gaussian law. The FTC [F6] and the test vanishing near both time endpoints make the time integral zero; its derivative is integrable since vt(γξ(t)) is affine in ξ with finite first moment by [F2, F3]. The resulting identity is the weak continuity equation for μt. Also ∫∣vt(x)∣2dμt(x)=E∣m1−m0+(σ1−σ0)ξ∣2=∣m1−m0∣2+d(σ1−σ0)2, using the zero coordinate means and unit variances in [F2]. Its time integral is the squared-distance value from step 1.1, so [F4] makes this velocity minimum-action.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

107 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