AM-GM-HM Triplets

I want to understand what values can be simultaneously attained as the arithmetic (AM), geometric (GM), and harmonic (HM) means of finite sequences of positive real numbers. Precisely, for what points $(G, H) \in \mathbb R^2_{\geqslant 0}$, do there exist a $n$-tuple $a = (a_1, a_2, \ldots, a_n) \in \mathbb R^n_{\geqslant 0}$ such that

Here the constraint on AM provides an implicit normalisation on the $n$-tuple. Note that the AM-GM-HM inequality implies that such an $(G, H)$ must lie in the lower right half of the unit square given by

I think that the problem is quite hard for a general $n$, so I will be content with $n = 4$. In fact, I will also be happy to see any bounds improving on $(\ast)$, either for general $n$ or for specific small values of $n$. Below I sketch the solution for $n= 2$ and $n=3$.

Case $n=2$. It turns out that, for any pair of numbers $(a_1, a_2)$, the three means satisfy a tight relation: $\operatorname{AM} \cdot \operatorname{HM} = \operatorname{GM}^2$. That is, all our points must lie on the parabola $H = G^2$.

Case $n=3$. Now the tight relationship between the means disappears; however, the situation is still rigid enough to permit an algebraic solution. It is easy to check that the three numbers are roots of the cubic equation

which rearranges to

We want this equation to have three real, nonnegative roots. It is well-known† that this is equivalent to the condition that the discriminant of the cubic is nonnegative:

Here is a plot of this region for $n=3$ (with $G$ along the $x$-axis and $H$ along the $y$-axis):

Question. To restate my question:

Can you give any bounds on the AM-GM-HM region for any $n \geqslant 4$ that beats $(\ast)$?

In fact, the following conjecture looks plausible:

Conjecture. For any $n$, there exists $c = c_n > 0$ such that the following holds for any $n$-tuple of positive reals:

That is, the region lies entirely to the left of the line $G = \frac{1}{1+c} + \frac{c}{1+c} H$.

This conjecture is inspired by an earlier post that essentially claims that $c = \frac{33}{50}$ works for $n=5$.‡ The proposed answer in that thread suggests using Lagrange multipliers. But unfortunately, it seems to me that it is rather too sparse on the details; I am not entirely sure how fruitful this approach would be.*

‡The equivalence between the stated problem and my question is explained clearly in Zarrax’s answer in that thread.

*The answer is now deleted.

[Thanks to QED for the plot.]

One way to look at this problem is to look for the extremes of the geometric mean given fixed arithmetic and harmonic means.

The following inequalities can be verified by taking $\log$s and using Jensen:

That is, $HM\le GM\le AM$.

Scaling the data scales all three means by the same factor, so let us assume that

and

and attempt to find the critical values for the $\log$ of the geometric mean:

Taking variances of $(2)$, $(3)$, and $(4)$, we get that for all variations so that the $AM$ is stationary

and the reciprocal of the $HM$ is stationary,

we should also have that the $\log$ of the geometric mean is stationary:

Linearity considerations say that $(5)$, $(6)$, and $(7)$ imply that there are constants $a$ and $b$ so that

Multiplying $(8)$ by x and combining with $(2)$ and $(3)$ yields

Solving $(8)$ for $x$ and $(9)$ for $b$, we get

To maintain $(2)$, we need a combination of the two values of $x$:

Solving $(11)$ for $\lambda$, we get

Note that $(12)$ shows that $\lim\limits_{a\to0}\frac{\lambda}{a}=\lim\limits_{a\to1}\frac{1-\lambda}{1-a}=1$.

For a given harmonic mean, $h$, and split between values of $x$, $\lambda$, $(10)$ and $(12)$ yield that the stationary geometric mean is

For each $h\in[0,1]$, $g(h,\lambda)$ is monotonic in $\lambda$ (verified below) and

With a countinuous selection of $\lambda$, we can attain any value of $g(h,\lambda)$ between $h$ and $1$. However, When dealing with $n$ numbers, $\lambda$ can only take the values $\frac{1}{n}\dots \frac{n-1}{n}$. Thus, with a harmonic mean of $h$, the geometric mean can only vary between $g(h,\frac{1}{n})$ and $g(h,\frac{n-1}{n})$.

$\mathbf{n}$ objects with arithmetic mean $\mathbf{=1}$:

Proof that for any $\mathbf{h}$, $\mathbf{g(h,\lambda)}$ is monotonic in $\mathbf{\lambda}$:

Fix $h$. Define

Using $(13)$ and $(15)$, we get that

Equation $(15)$ also implies that

In consideration of $(17)$, define $\eta$ and $\theta$ by

and

where $0\le\lambda\le1$ and thus $-\eta\le\theta\le\eta$. Then using the identities

we get that

The logarithmic derivative of $(21)$ is

Dividing $(22)$ by $\cos(\theta)$ and setting $t=\dfrac{\cos(\eta)}{\cos(\theta)}$, yields that $(22)$ vanishes precisely when

However, $(23)$ vanishes only at $t=0$, but because $-\eta\le\theta\le\eta$, we have $t\ge\cos(\eta)=\sqrt{1-h}$. Therefore, $(22)$ doesn’t vanish, and thus, $(21)$ is monotonic.