Quantitative stability of the Brunn-Minkowski inequality for sets of equal volume (Q2358529): Difference between revisions
From MaRDI portal
Latest revision as of 23:16, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Quantitative stability of the Brunn-Minkowski inequality for sets of equal volume |
scientific article |
Statements
Quantitative stability of the Brunn-Minkowski inequality for sets of equal volume (English)
0 references
15 June 2017
0 references
For two sets \(A,B\subset\mathbb R^n\), and \(c>0\), the sum and scalar multiple sets are defined by \(A+B=\{a+b;\;a\in A\wedge b\in B\}\) and \(cA=\{ca;\;a\in A\}\). If \(|E|\) is the Lebesgue measure of a set E, the classical Brunn-Minkowski inequality states that for nonempty measurable sets \(A,B\subset\mathbb R^n\), \(|A+B|^{1/n}\geq|A|^{1/n}+|B|^{1/n}\). In addition, if \(|A|,|B|>0\), then equality holds if and only if there exist a convex set \(\mathcal{K}\subset\mathbb R^n\), \(\lambda_1,\lambda_2>0\), and \(D_1,D_2\subset\mathbb R^n\), such that \(|\mathcal{K}\setminus(\lambda_1A+D_1)|=|\mathcal{K}\setminus(\lambda_1B+D_2)|=0\). In [Invent. Math. 182, No. 1, 167--211 (2010; Zbl 1196.49033)], the first author, \textit{F.~Maggi}, and \textit{A.~Pratelli} showed that there is a computable dimensional constant \(C_0(n)\) such that if \(A, B\subset\mathbb R^n\) are convex sets satisfying \(|A|=|B|=1\), \(|tA+(1-t)B|=1+\delta\) for some \(\delta\geq 0\) and some \(t\in[\tau,1-\tau]\), then, up to a translation, \(|(A\setminus B)\cup(B\setminus A)|\leq C_0(n)\tau^{-1/2n}\;delta^{1/2}\). In this paper, the authors generalize this result and show that for measurable sets \(A,B\subset\mathbb R^n\) and \(S=tA+(1-t)B\) for some \(t\in[\tau,1-\tau]\), \(0<\tau\leq1/2\), there are computable dimensional constants \(N_n\) and computable functions \(M_n(\tau)\), \(\varepsilon_n(\tau)\) such that if \(\big||A|-1\big|+\big||B|-1\big|+\big||S|-1\big|\leq\delta\) for some \(\delta\leq\varepsilon^{-M_n(\tau)}\), then there exists a convex set \(\mathcal{K}\subset\mathbb R^n\) such that, up to a translation, \(A,B\subset\mathcal{K}\) and \(\big|\mathcal{K}\setminus A\big|+\big|\mathcal{K}\setminus B\big|\leq\tau^{-N_n}\delta^{\varepsilon_n(\tau)}\).
0 references
quantitative stability
0 references
Brunn-Minkowski inequality
0 references
affine geometry
0 references
convex geometry
0 references
additive combinatorics
0 references