Remarks on the conjectured log-Brunn-Minkowski inequality (Q2516434): Difference between revisions

Let \(0<\lambda<1\), \(K, L\) be convex bodies in \(\mathbb{R}^{n}\) and \(\lambda K+(1-\lambda)L\) be the Minkowski combination of \(K\) and \(L\). The classical Brunn-Minkowski inequality states that \[ V(\lambda K+(1-\lambda)L)^{\frac{1}{n}}\geq\lambda V(K)^{\frac{1}{n}}+(1-\lambda)V(L)^{\frac{1}{n}}. \] Let \(0<\lambda<1\), \(K, L\) be origin-symmetric convex bodies then the log-Minkowski combination of \(K\) and \(L\) is defined by \[ \lambda\cdot K+_{0}(1-\lambda)\cdot L=\{x\in\mathbb{R}^{n}: x\cdot u\leq h_{K}(u)^{\lambda}h_{L}(u)^{1-\lambda}, u\in S^{n-1}\}. \] The log-Minkowski combination of convex bodies was introduced by \textit{K. Böröczky jun.} et al. [Adv. Math. 231, No. 3--4, 1974--1997 (2012; Zbl 1258.52005)]. They also conjectured the following inequality (now known as the conjectured log-Brunn-Minkowski inequality) for origin-symmetric bodies: \[ V(\lambda\cdot K+_{0}(1-\lambda)\cdot L)\geq V(K)^{\lambda}V(L)^{1-\lambda}. \] The log-Brunn-Minkowski inequality is stronger than the classical Brunn-Minkowski inequality. For two dimensional case, Böröczky, Lutwak, Yang and Zhang confirmed the log-Brunn-Minkowski inequality and found the equality condition. For the case where \(K\) and \(L\) are unconditional convex bodies, the author of this paper confirmed the log-Brunn-Minkowski inequality. The author also pointed out the connection between the log-Brunn-Minkowski inequality and the B-conjecture.