paper

Entropic analogues of Grünbaum's inequality

arXiv:2607.23269

Abstract

The classical Grünbaum inequality asserts that the proportion of the volume of a convex body cut off by a halfspace containing its barycenter is at least . From its functional counterpart, for any log-concave random variable , one has , with equality if and only if is exponential. Motivated by Grünbaum's inequality for convex bodies and its functional generalizations, we prove analogous inequalities for entropy, with characterizations of the equality cases. We show that if is a log-concave random variable on , then where is the differential entropy, is the binary entropy function and stands for the distribution of conditional on . We generalize the upper bound for all Rényi entropies and the lower bound for min-entropy. Our inequalities are sharp and we characterize all equality cases. We discuss potential generalizations in high dimensions and give counterexamples in some directions. As an intermediate step for the proof of the lower bound, we establish a new inequality that we prove using a technique known as degrees of freedom, combined with a standard KKT-type optimization lemma. Along the way, we characterize the equality case in a known comparison inequality between differential and min-entropy, which may be of independent interest.

24 pages, no figures