Indexed metadata

Sharp conditioning and quantitative stability of optimal transport

Yuanlong Ruan

Source record

Source: arXiv

Published: Oct 6, 2026

arXiv: 2610.07577

Open original source ↗

Source abstract

When a feasible plan is obtained whose quadratic transport cost is known to be close to the optimal cost, we try to determine how close the feasible plan is to the true optimal map under mild density and moment conditions. The source and target may be unbounded or have non-compact supports. We show that for a source with density in LpL^p and an nn-th moment, let s=1−1/ps=1-1/p and η=sn/[n+(d−1)s]η=sn/[n+(d-1)s]. Under the target constraint ∫∣y∣m[log⁡(e+∣y∣)]β dν⩽1\int |y|^m[\log(e+|y|)]^β\,dν\leqslant1, the worst-case class-uniform conditioning has a sharp modulus comparable to tη(m−2)/[m(1+η)−η][log⁡(e/t)]−β(2+η)/[m(1+η)−η], t^{η(m-2)/[m(1+η)-η]} [\log(e/t)]^{-β(2+η)/[m(1+η)-η]}, whenever t>0t>0 is small. This holds for m⩾2m\geqslant2 and β⩾0β\geqslant0. When m=2m=2, every β>0β>0 gives a sharp logarithmic modulus, whereas the m=2, β=0m=2,\,β=0 extreme has no vanishing modulus. The matching lower bound is verified for both the squared map error and barycentric projection error. The sharp map error bounds allow us to directly derive quantitative stabilities of common source Brenier maps without passing through potential estimates, thereby avoiding loss of information. These stabilities strictly improve the corresponding results of Delalande-Merigot \cite{delalande2023quantitative} and Letrouit-Mérigot \cite{letrouit2026gluing} under identical or weaker settings, particularly no convexity of the source support or bounds of the source density are assumed.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.