Logarithmic inequalities under a symmetric polynomial dominance order
Lists
Only you see this
Abstract
We consider a dominance order on positive vectors induced by the elementary symmetric polynomials. Under this dominance order we provide conditions that yield simple proofs of several monotonicity questions. Notably, our approach yields a quick (4 line) proof of the so-called âsum-of-squared-logarithmsâ inequality conjectured in (Bîrsan, Neff, and Lankeit, J. Inequalities and Applications (2013); P. Neff, Y. Nakatsukasa, and A. Fischle; SIMAX, 35, 2014). This inequality has been the subject of several recent articles, and only recently it received a full proof, albeit via a more elaborate complex-analytic approach. We provide an elementary proof, which, moreover, extends to yield simple proofs of both old and new inequalities for Rényi entropy, subentropy, and quantum Rényi entropy.
BibTeX
@inproceedings{sra2017logarithmic,
author = {Suvrit Sra},
title = {{Logarithmic inequalities under a symmetric polynomial dominance order}},
booktitle = {Proceedings of the American Mathematical Society},
year = {2017},
doi = {10.1090/proc/14023},
}Loading related content...