Metraipolis › archive › dc_e36c8f2bd082
A one-sided constrained martingale transport between two uniform laws — arXiv:2609.29997
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.29997
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-08T06:07:51.722Z
- SHA-256 of the archived text
62f98e01810cc06b51ac9baf6407ef7c7e6828f6aa3c1f02ab7c7f2797c87f06- Stable URL of this page
https://metraipolis.com/documento/dc_e36c8f2bd082
How to cite
A one-sided constrained martingale transport between two uniform laws — arXiv:2609.29997 — arXiv (en), https://arxiv.org/abs/2609.29997 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e36c8f2bd082 (Metraipolis archive dc_e36c8f2bd082, sha256 62f98e01810cc06b51ac9baf6407ef7c7e6828f6aa3c1f02ab7c7f2797c87f06)
BibTeX
@misc{dce36c8f2bd082,
title = {A one-sided constrained martingale transport between two uniform laws — arXiv:2609.29997},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.29997},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e36c8f2bd082; sha256 62f98e01810cc06b51ac9baf6407ef7c7e6828f6aa3c1f02ab7c7f2797c87f06},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.29997. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We minimize $\mathbb E[h(Y-X)]$ over martingale couplings of $\text{Unif}[-1,1]$ and $\text{Unif}[-2,2]$ satisfying $Y\geq X-k$, where $h\in C^1([-3,3])$ has convex derivative. Feasibility holds exactly for $k\geq1$. For each such $k$, we construct a coupling that minimizes all costs in this class. For $1<k<3$, its support consists of two graphs, with $D(x)=x-k$ on $[k-2,1]$. The maps admit an explicit parametrization for $2\leq k<3$ and are determined by scalar equations with unique admissible roots for $1<k<2$. We prove optimality by a dual inequality, using an analytic estimate in the latter range. At $k=1$ the optimizer is $Y=X\pm1$ with equal probabilities; for $k\geq3$ it is the ordinary left-curtain coupling. In the unconstrained problem, left-monotonicity identifies the left-curtain coupling, which is optimal for this cost class. Under the constraint, a discrete example shows that the corresponding support condition, even together with every two-source comparison, does not imply optimality.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-25 in math.PR).
Categorie arXiv: Probability (math.PR).
Pagina del lavoro: https://arxiv.org/abs/2609.29997 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T05:35:05.152Z dalla pagina https://arxiv.org/catchup/math.PR/2026-09-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).