2000 character limit reached
Entropic versions of Bergström's and Bonnesen's inequalities
Published 17 Jan 2025 in cs.IT, math.FA, and math.IT | (2501.10309v1)
Abstract: We establish analogues of the Bergstr\"om and Bonnesen inequalities, related to determinants and volumes respectively, for the entropy power and for the Fisher information. The obtained inequalities strengthen the well-known convolution inequality for the Fisher information as well as the entropy power inequality in dimensions $d>1$, while they reduce to the former in $d=1$. Our results recover the original Bergstr\"om inequality and generalize a proof of Bergstr\"om's inequality given by Dembo, Cover and Thomas. We characterize the equality case in our entropic Bonnesen inequality.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.