Universal bound conjecture for Gaussian entropic optimal transport
Let be positive-definite covariance operators on , and let and denote the entropic and unregularized optimal transport couplings, respectively. Universal bound conjecture. There exists a dimension-dependent constant such that
for all . The asymptotic scaling is already guaranteed in the non-degenerate finite-dimensional setting. The identity case gives , while numerical experiments suggest rates near for random full-rank covariances; it remains open whether the identity case is the worst case or whether the smaller observed rates reflect concentration in random matrix ensembles.
References
Primary source
Ho Yun, “Spectral Shrinkage of Gaussian Entropic Optimal Transport”, arXiv:2512.19457 (2026).
Progress summary
A reader-submitted proof claims the conjecture is settled with the sharp constant, but no independent confirmation was found.
Ho Yun (2025) formulated the conjecture for Gaussian entropic transport and left the dimension-only bound open. The question is whether the small-regularization error can be bounded uniformly over all positive-definite covariance pairs.
Known results
- Ho Yun (2025): finite-dimensional nondegenerate pairs satisfy .
- Ho Yun (2025): the identity case gives .
- Ho Yun (2025): random full-rank experiments suggest rates near , leaving the worst case unresolved.
August 26, 2026 community submission (unverified)
A submitted proof argues that the exact limit is , with equality exactly when , and therefore claims the sharp constant without a commutativity assumption. This argument has not been independently verified.
Current status (as of August 2026): The conjecture remains unverified; a community submission claims , while the previously published record still treats the universal bound as open.
Solutions 2
ProofThis solution needs a summarySee full solution
The sharp universal constant is
Let be positive definite. Let be the Gaussian entropic optimal coupling, with precisely the regularization parameter used in the cited paper, and let be the ordinary optimal Gaussian coupling.
Define the unique positive-definite optimal transport map
We prove the exact asymptotic identity
where are the eigenvalues of . Equality holds if and only if . Consequently, the optimal universal constant in Conjecture 3.1 is
No commutativity assumption on and is required.
Properly aligned factors and the exact coupling formula
Choose invertible properly aligned factors of the two covariance matrices:
For example, take and . Then
Introduce the positive-definite matrices
The source's Theorem 3.4 gives the entropic correlation operator
By Theorem 3.10 of the same source,
where
Although has singular covariance on , the matrix being differentiated below is , so its positive square root is smooth.
The cancellation that removes all covariance dependence
Proper alignment implies
In particular,
Since , the scalar formula for , applied through the spectral calculus, gives
Substitution into the exact coupling formula therefore yields
Write
Squaring this expansion, without assuming that and commute, gives the Sylvester equation
Multiplication by followed by cyclicity of the trace shows that
Hence
Sharp bound, equality, and the transport-map formula
The aligned-factor identity gives the exact positive-semidefinite factorization
Thus
and consequently
Equality forces , hence , and then . Since is invertible, , so . Conversely, permits and attains .
Finally, proper alignment implies that
and this is the unique positive-definite solution of . Therefore
Cyclicity of trace now gives the stronger intrinsic identity
The exact deficit from the extremal constant is
This proves the full universal-bound conjecture, determines its sharp constant, characterizes every equality case, and identifies the exact rate for all positive-definite covariance pairs. The spectral-shrinkage and coupling identities used above are Theorems 3.4 and 3.10 of Ho Yun, Spectral Shrinkage of Gaussian Entropic Optimal Transport, arXiv:2512.19457v2, where the universal-bound problem is stated as Conjecture 3.1.
This solution needs a summarySee full solution
The sharp universal Gaussian EOT coupling bound
Statement
Let A,B be positive-definite covariance matrices on R^d. Let
pi_epsilon be their Gaussian entropic optimal-transport coupling and let
pi_0 be the unregularized Gaussian optimal coupling. We prove that the
limit in MathDB #372212 exists and satisfies
The constant is sharp. In fact, equality holds exactly when A=B.
Consequently the optimal universal constant is
Throughout, epsilon has the normalization used by the source and by the
MathDB statement: the entropic objective contains 2 epsilon KL. Rescaling
that objective rescales the parameter and therefore the displayed constant.
Aligned square roots
Choose the canonical properly aligned Green operators G_0,M_0 used by
Theorem 3.10 of the source, and abbreviate them to G,M, so
All three matrices are invertible because A and B are positive
definite. Put
From G^*M=C we have M=G^{-*}C, and therefore
In particular,
Differentiate the exact distance formula
The source defines
Because the spectrum of C is bounded away from zero,
in operator norm. Theorem 3.10 gives
where
Equations (3)--(4) now collapse the first-order perturbation:
For completeness, if Q(t)=S^2+tH+O(t^2) and
sqrt(Q(t))=S+tZ+O(t^2), differentiating the square gives the Sylvester
equation
Multiplication by S^{-1}, followed by cyclicity of trace, yields
Here S^2 is positive definite, so Q_epsilon remains positive definite
near zero and its principal square root is Frechet differentiable there.
Applying (7) to (6), then differentiating (5), proves the exact formula
Thus the conjectured limsup is actually a limit.
The universal bound and equality case
Proper alignment supplies the decisive order relation:
Conjugating (9) by S^{-1/2} gives
Taking traces and using cyclicity in (8),
which proves (1).
If equality holds, the positive-semidefinite matrix
I/2-S^{-1/2}CS^{-1/2} has trace zero, hence is zero. Therefore S=2C,
and (9) forces G=M, so A=B. Conversely, when A=B we may take
G=M; then (8) gives tr((2X)^{-1}X)=d/2. This also proves sharpness.
Verification scope
The proof above is finite-dimensional matrix analysis and does not depend on
computation. The companion script reconstructs aligned roots for deterministic
positive-definite test matrices, checks identities (2)--(3) and (9), and
confirms that the exact finite-epsilon formula converges to (8), including
the equality case.