🤖 AI Summary
This paper investigates the maximization of the Rényi ∞-entropy difference $h_infty(X+Y) - h_infty(X)$ for i.i.d. log-concave random variables $X, Y$. Methodologically, it establishes the first reverse entropy power inequality specifically for log-concave variables, combining information-theoretic analysis of Rényi entropies, probabilistic characterization of log-concavity, and discrete optimization techniques. The main contribution is a rigorous proof that the maximum is uniquely attained when $X$ and $Y$ follow the exponential distribution; furthermore, the result is extended— for the first time—to integer-valued log-concave distributions, including the geometric distribution. This work reveals the exponential distribution’s unique optimality in entropy-increase extremal problems, thereby introducing a new paradigm in entropy inequality theory and providing a critical counterexample to previously conjectured bounds.
📝 Abstract
Let $X$ and $Y$ be independent identically distributed log-concave random variables. We show that $h_infty(X+Y)-h_infty(X)$ is maximized when $X$ and $Y$ have exponential distributions. Here, $h_infty(cdot)$ is the Rényi entropy of order $infty$. Analogs for integer-valued log-concave random variables are also obtained.