A Maclaurin type inequality

TL;DR

This paper extends the classical Maclaurin inequality to allow negative variables, establishing a sharp inequality with a new factor that improves previous bounds, applicable in broader contexts.

Contribution

The authors derive a new variant of the Maclaurin inequality that permits negative variables and includes a sharp constant factor, improving upon prior results.

Findings

Established a Maclaurin-type inequality for negative variables.

Proved the inequality is sharp up to constants.

Improved the bound by introducing a rac{}k^{1/2} factor.

Abstract

The classical Maclaurin inequality asserts that the elementary symmetric means $$ s_k(y) = \frac{1}{\binom{n}{k}} \sum_{1 \leq i_1 < \dots < i_k \leq n} y_{i_1} \dots y_{i_k}$$ obey the inequality $s_\ell(y)^{1/\ell} \leq s_k(y)^{1/k}$ whenever $1 \leq k \leq \ell \leq n$ and $y = (y_1,\dots,y_n)$ consists of non-negative reals. We establish a variant $$ |s_\ell(y)|^{\frac{1}{\ell}} \ll \frac{\ell^{1/2}}{k^{1/2}} \max (|s_k(y)|^{\frac{1}{k}}, |s_{k+1}(y)|^{\frac{1}{k+1}})$$ of this inequality in which the $y_i$ are permitted to be negative. In this regime the inequality is sharp up to constants. Such an inequality was previously known without the $k^{1/2}$ factor in the denominator.