AI & ML
Four Function Theorems Through Optimal Transport and Entropic Analogs
arXiv math.IT0 views
arXiv:2512.19003v2 Announce Type: replace-cross Abstract: We study entropic versions of four-function inequalities and give transport proofs of the Euclidean Ahlswede-Daykin theorem and a four-function version of the Prekopa-Leindler inequality due to Cordero-Erausquin and Maurey. One of our main results shows that the sharp range for the four-function inequality for equally weighted power means of finite orders \(\alpha,\beta\) is \(0\leq\alpha+\beta\leq2\), with the Ahlswede-Daykin min-max inequality obtained as a limit. En route, we prove corresponding entropy inequalities under the quadratic optimal transport coupling, including an entropy power inequality for the minimum and maximum in Euclidean space. We also study the stability of four-function inequalities under convolution with log-concave product densities, recovering the preservation of log-supermodularity established by Karlin and Rinott, and explain its application to a conditional entropy power inequality for log-supermodular random variables.
Source:https://arxiv.org/abs/2512.19003PreviousOn the hardness of approximating minimum distances of quantum codesNextCommanding at the Speed of Sound: Audio-Centric Referring Expression Segmentation for Aerial Scenes
Related posts
C64 Basic Dungeon Crawler: Stairs, Levels and Levelling Up (Part 11)
0Hacker News
Anthropic's internal AI use, at retail prices, now exceeds its employee pay
0Hacker News
Launch HN: Momentic (YC W24) – Agents that catch bugs by using your app
0Hacker News

Behavioral Design Unpacked: Nudges, Funnels & Persuasion | UX Unpacked #3
0dev.to UX
National Grid buys Teesside land for UK largest substation to power AI data center
0dev.to News

Leonardo AI Alternative in 2026
0dev.to Discuss