On a conjectural symmetric version of Ehrhard's inequality

preprint2022arXivOpen access

Abstract

We formulate a plausible conjecture for the optimal Ehrhard-type inequality for convex symmetric sets with respect to the Gaussian measure. Namely, letting Jk−1(s)=∫0stk−1e−t22dtJ_{k-1}(s)=\int^s_0 t^{k-1} e^{-\frac{t^2}{2}}dt and ck−1=Jk−1(+∞)c_{k-1}=J_{k-1}(+\infty), we conjecture that the function F:[0,1]→R,F:[0,1]\rightarrow\mathbb{R}, given by F(a)=∑k=1n1a∈Ek⋅(βkJk−1−1(ck−1a)+αk)F(a)= \sum_{k=1}^n 1_{a\in E_k}\cdot(β_k J_{k-1}^{-1}(c_{k-1} a)+α_k) (with an appropriate choice of a decomposition [0,1]=∪iEi[0,1]=\cup_{i} E_i and coefficients αi,βiα_i, β_i) satisfies, for all symmetric convex sets KK and L,L, and any λ∈[0,1]λ\in[0,1], F(γ(λK+(1−λ)L))≥λF(γ(K))+(1−λ)F(γ(L)). F\left(γ(λK+(1-λ)L)\right)\geq λF\left(γ(K)\right)+(1-λ) F\left(γ(L)\right). We explain that this conjecture is "the most optimistic possible", and is equivalent to the fact that for any symmetric convex set K,K, its \emph{Gaussian concavity power} ps(K,γ)p^s(K,γ) is greater than or equal to ps(RB2k×Rn−k,γ),p_s(RB^k_2\times \mathbb{R}^{n-k},γ), for some k∈{1,...,n}k\in \{1,...,n\}. We call the sets RB2k×Rn−kRB^k_2\times \mathbb{R}^{n-k} round kk-cylinders; they also appear as the conjectured Gaussian isoperimetric minimizers for symmetric sets, see Heilman \cite{Heilman}. In this manuscript, we make progress towards this question, and prove certain inequality for which the round k-cylinders are the only equality cases. As an auxiliary result on the way to the equality case characterization, we characterize the equality cases in the "convex set version" of the Brascamp-Lieb inequality, and moreover, obtain a quantitative stability version in the case of the standard Gaussian measure; this may be of independent interest.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.