English

Sharp L1 Inequalities for Sup-Convolution

Functional Analysis 2023-07-20 v2 Combinatorics

Abstract

Given a compact convex domain CRkC\subset \mathbb{R}^k and bounded measurable functions f1,,fn:CRf_1,\ldots,f_n:C\to \mathbb{R}, define the sup-convolution (f1fn)(z)(f_1\ast \ldots \ast f_n)(z) to be the supremum average value of f1(x1),,fn(xn)f_1(x_1),\ldots,f_n(x_n) over all x1,,xnCx_1,\ldots,x_n\in C which average to zz. Continuing the study by Figalli and Jerison and the present authors of linear stability for the Brunn-Minkowski inequality with equal sets, for k3k\le 3 we find the optimal constants ck,nc_{k,n} such that Cfn(x)f(x)dxck,nCco(f)(x)f(x)dx\int_C f^{\ast n}(x)-f(x) dx \ge c_{k,n}\int_C\text{co}(f)(x)-f(x) dx where co(f)\text{co}(f) is the upper convex hull of ff. Additionally, we show ck,n=1O(1n)c_{k,n}=1-O(\frac{1}{n}) for fixed kk and prove an analogous optimal inequality for two distinct functions. The key geometric insight is a decomposition of polytopal approximations of CC into hypersimplices according to the geometry of the set of points where co(f)\text{co}(f) is close to ff.

Keywords

Cite

@article{arxiv.2008.04606,
  title  = {Sharp L1 Inequalities for Sup-Convolution},
  author = {Peter van Hintum and Hunter Spink and Marius Tiba},
  journal= {arXiv preprint arXiv:2008.04606},
  year   = {2023}
}

Comments

16 pages

R2 v1 2026-06-23T17:46:24.426Z