Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-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.

The Gaussian conditional affine map is quadratic-cost optimal

Statement

Assume the Axiom of Choice. Let d≥1, fix x1∈Rd, and choose σmin⁡>0. Let Z have the standard multivariate normal law Nd(0,Id). For t∈[0,1], define μt(x1):=tx1,σt:=1−(1−σmin⁡)t,ψt(z∣x1):=σtz+μt(x1), and let Pt(⋅∣x1) be the law of ψt(Z∣x1). Then Pt(⋅∣x1) is the Gaussian probability path with mean μt(x1) and covariance σt2Id, and its Lebesgue density is ρt(x∣x1)=(2πσt2)−d/2exp⁡ ⁣(−∥x−μt(x1)∥222σt2). A conditional velocity field for this path is ut(x∣x1)=σmin⁡−1σt(x−tx1)+x1. For each endpoint x1, these densities and fields form a conditional path in the probability-path definition; hence they can be mixed against any Borel endpoint law. At t=0 the law is Nd(0,Id), and at t=1 it is the law of x1+σmin⁡Z, a Gaussian with mean x1 and covariance σmin⁡2Id. The affine endpoint map T(z)=x1+σmin⁡z is optimal for squared Euclidean cost between these two laws: every coupling has cost at least ∥x1∥22+d(1−σmin⁡)2, and the law of (Z,T(Z)) attains this value.

Facts & Assumptions

Given: AC, d≥1, x1∈Rd, σmin⁡>0, and Z∼Nd(0,Id).

[A1]

AC supplies the axiom required by the standard and multivariate Gaussian-law definitions and the Gaussian density theorem. The Axiom of Choice

[F1]

Standard normal and normal laws and Multivariate normal law, including singular covariance: scalar normal laws are affine images of the standard normal; Nd(m,Σ) has scalar projections N(uTm,uTΣu), mean m, and covariance Σ.

[F2]

A positive-definite multivariate normal law has its Gaussian density: if Σ is positive definite, Nd(m,Σ) has Lebesgue density (2π)−d/2det⁡(Σ)−1/2exp⁡(−12(x−m)TΣ−1(x−m)).

[F3]

An affine conditional path has the stated velocity field: for a differentiable affine flow ψt(z)=σtz+μt with σt>0, its unique Eulerian field is μ˙t+(σ˙t/σt)(x−μt).

[F4]

A centered law and its affine dilation have an optimal affine coupling: for any centered probability law with second moment m2, the map z↦a+sz, s>0, is optimal for squared Euclidean cost to its affine image and has cost ∥a∥22+(1−s)2m2.

[F7]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): derivatives of compositions of differentiable Euclidean maps obey the chain rule.

Proof

Given: The hypotheses in the Statement.

1.1givenA1F1F5algebra

Since σt=(1−t)+tσmin⁡>0, every affine map ψt is invertible. For each v∈Rd, the projection of ψt(Z∣x1) is vTμt(x1)+σtvTZ. By [F1], this is normal with mean vTμt(x1) and variance σt2∥v∥22. Thus Pt(⋅∣x1) is multivariate normal with mean μt(x1) and covariance σt2Id, which is positive definite.

1.2givenF2

By [F2], the Lebesgue density of Pt(⋅∣x1) is ρt(x∣x1)=(2πσt2)−d/2exp⁡ ⁣(−∥x−μt(x1)∥222σt2). It integrates to one for every x1 and is continuous in (t,x,x1) because σt>0. Therefore for any endpoint probability law π it is product-measurable and satisfies the conditional-density requirement in Probability paths and velocity fields.

2.1givenstep 1.2F3F6F7F8algebra

We have μ˙t(x1)=x1 and σ˙t=σmin⁡−1. Applying [F3] gives ut(x∣x1)=x1+σmin⁡−1σt(x−tx1). The density formula in step 1.2 and this affine field are continuously differentiable in (t,x) by the algebra, chain, and exponential derivative rules [F6, F7, F8]. Thus ρt and each component of ρtut meet the regularity clauses of the conditional probability-path definition.

2.2givenstep 1.1algebra

At t=0 the parameters are μ0=0,σ0=1; at t=1 they are μ1=x1,σ1=σmin⁡. Thus the endpoints are the standard Gaussian law and the law of x1+σmin⁡Z.

3.1step 1.1step 1.2step 2.1F5F6F7F8algebra

Put r=x−tx1 and write σ˙=σmin⁡−1. We have ∂tr=−x1 and ∂t(σt−d)=−dσ˙σt−d−1 by the product and quotient rules [F6]. Applying the chain rule [F7] to −∥r∥22/(2σt2) and then the exponential derivative [F8] gives ∂tρt=ρt(−dσ˙σt+⟨r,x1⟩σt2+σ˙∥r∥22σt3),∇xρt=−ρtrσt2. The field in step 2.1 has div⁡xut=dσ˙/σt.

4.1step 3.1F5F6F7algebra

The product rule gives div⁡x(ρtut)=⟨∇xρt,ut⟩+ρtdiv⁡xut=ρt(−⟨r,x1⟩σt2−σ˙∥r∥22σt3+dσ˙σt). Adding this to ∂tρt in step 3.1 cancels each term, so the conditional continuity equation holds.

5.1givenA1F1F4F5step 2.2algebra∎

The standard Gaussian vector has mean 0 and covariance Id by [F1]. Summing its d coordinate second moments gives ∫∥z∥22 Nd(0,Id)(dz)=d. The endpoint law is the affine image under T(z)=x1+σmin⁡z. Applying [F4] with a=x1, s=σmin⁡, and m2=d shows that every coupling has cost at least ∥x1∥22+d(1−σmin⁡)2, and that the law of (Z,T(Z)) attains equality.

Source notes

The paper and book give Gaussian optimal-transport context; the complete proof of optimality used here is the local choice-free coupling argument in [lem-affine-dilation-is-quadratic-cost-optimal].

Depends on

Used by

Dependency tree · two levels

78 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