On a conjectural symmetric version of Ehrhard's inequality
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)=∫s0 tk-1 e-t22dt and ck-1=Jk-1(+∞), we conjecture that the function F:[0,1]→R, given by F(a)= Σk=1n 1a∈ Ek·(βk Jk-1-1(ck-1 a)+αk) (with an appropriate choice of a decomposition [0,1]=i Ei and coefficients αi, βi) satisfies, for all symmetric convex sets K and L, and any λ∈[0,1], F(γ(λ K+(1-λ)L))≥ λ F(γ(K))+(1-λ) F(γ(L)). We explain that this conjecture is "the most optimistic possible", and is equivalent to the fact that for any symmetric convex set K, its Gaussian concavity power ps(K,γ) is greater than or equal to ps(RBk2× Rn-k,γ), for some k∈ \1,...,n\. We call the sets RBk2× Rn-k round k-cylinders; they also appear as the conjectured Gaussian isoperimetric minimizers for symmetric sets, see Heilman 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.