The Maclaurin inequality through the probabilistic lens

Abstract

In this paper we take a probabilistic look at Maclaurin's inequality, which is a refinement of the classical AM-GM inequality. In a natural randomized setting, we obtain limit theorems and show that a reverse inequality holds with high probability. The form of Maclaurin's inequality naturally relates it to U-statistics. More precisely, given x1, …, xn, p ∈ (0,∞) and k ∈ N with k ≤ n, let us define the quantity \[ Sk, p(n) = ( nk-1 Σ1 ≤ i1 < … < ik ≤ n xi1p ·s xikp )1/(k p).\] Then as a consequence of the classical Maclaurin inequalities, we know that Sk1(n) ≥ Sk2(n) for k1 < k2. In the present article we consider the ratio \[ Rk1, k2, p(n) := Sk2, p(n)Sk1, p(n), \] evaluated at a random vector (X1, …, Xn) sampled either from the normalized surface measure on the pn-sphere or from a distribution generalizing both the uniform distribution on the pn-ball and the cone measure on the pn-sphere; by the Maclaurin inequality, we always have Rk1, k2, p(n) ≤ 1. We derive central limit theorems for Rk1, k2, p(n) and Rk1, n, p(n) as well as Berry--Esseen bounds and a moderate deviations principle for Rk1, n, p(n), keeping k1, k2 fixed, in order to quantify the set of points where Rk1, k2, p(n) > c for c ∈ (0, 1), i.e., where the Maclaurin inequality is reversed up to a factor. The present aricle partly generalizes results concerning the AM-GM inequality obtained by Kabluchko, Prochno, and Vysotsky (2020), Th\"ale (2021), and Kaufmann and Th\"ale (2023+).

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…