In this paper, we propose two general theorems concerning inequalities in several variables, subject to flexible parametric constraints: the first presents a new sum-type inequality, while the second introduces its product-type counterpart. These results find natural applications in the study of cyclic inequalities. A wide range of examples is provided to illustrate the applicability of our approach, complemented by four additional theorems that further expand the analytical framework.
Cyclic inequalities constitute a class of mathematical expressions characterized by invariance under cyclic permutations of their variables. These structures naturally arise in algebraic and functional analysis, where determining precise bounds requires convexity, majorization, and classical inequalities.
A famous example within this domain is the Nesbitt inequality. Its classical three-variable formulation is stated below. Let \(x,y,z>0\). Then we have
Equality holds if and only if \(x=y=z\). This result generalizes to an arbitrary number of variables, as stated below. Let \(n\in \mathbb{N}\setminus \{0,1\}\) and \(x_1, x_2, \dots, x_n>0\). Then we have
Equality holds if and only if \(x_1 = x_2 = \dots = x_n\).
For background on the Nesbitt inequality and its subsequent developments, see the classical formulation attributed to A. M. Nesbitt [1], the general methodology presented by M. O. Drîmbe [2], and treatments of cyclic systems by V. Cîrtoaje [3]. Specific refinements and generalizations are developed by M. Bencze and C. Zhao [4], M. Bencze and O. T. Pop [5], and Fuhua Wei and Shanhe Wu [6], while related parametric families of cyclic inequalities are explored by C. Chesneau [7]. Despite their significance, results on multiple-variable cyclic inequalities incorporating several adjustable parameters and functions remain relatively scarce.
In this paper, we establish two general theorems concerning sum-type and product-type inequalities involving multiple variables.
The first provides a sum-type inequality, governed by two adjustable parameters and quantities that satisfy a global sum constraint involving the variables. The proof relies on refined algebraic decompositions and two specific applications of the Young (multiplicative) inequality (see [8]). Applications are presented, primarily within the context of cyclic inequalities.
The second serves as its natural product-type counterpart; it is derived using an integration technique.
To illustrate the versatility of these general inequalities, we deduce several propositions concerning well-defined structural configurations, including arithmetic, geometric, and harmonic means, as well as cyclic neighborhoods of elements.
Finally, we prove and discuss four complementary theorems that extend the parameter ranges, incorporate convex functions, determine a precise upper bound, and generalize this bound using concave functions.
The remainder of this paper is organized as follows: §2 details our two core theorems. §3 presents some applications. §4 investigates the four complementary theorems. Finally, §5 provides concluding remarks.
The result below presents a multiple-variable sum-type inequality, governed by specific parameter constraints and conditions for equality.
Theorem 1. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\), and \(R_1,R_2, \ldots, R_n>0\) such that
Let \(\lambda\ge 0\) and \(p\) such that
Then the following \(n\)-variable sum inequality holds:
Equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\).
Proof. For \(\lambda=0\), we have
Similarly, for \(p=1\), we obtain
Thus, equality holds in both cases.
In what follows, we restrict our attention to the case \(\lambda > 0\) and \(1 < p < 2 + \lambda\).
A suitable decomposition of the ratio gives
We now estimate the denominator by applying the multiplicative form of the Young inequality.
For any \(A, B, \alpha,\beta>0\) with \(\alpha+\beta=1\), the Young inequality states that
Setting \(A = x_i^{p-1}\), \(B = R_i^{p-1}\), \(\alpha=1/(1+\lambda)\), and \(\beta=\lambda/ (1+\lambda)\), we get
so that
Therefore, we have
where
and
Since \(1 < p < 2 + \lambda\), we have \(\gamma, \tau>0\) with
Another application of the Young inequality in Eq. (2) with \(A=x_i\), \(B=R_i\), \(\alpha=\gamma\) and \(\beta=\tau\) yields
Combining the inequalities above, we obtain
Summing both sides and using Eq. (1) and \(\gamma+\tau=1\), we get
The desired inequality is proved.
Furthermore, equality holds if and only if equality is attained in Eq. (1) (that is, \(\sum\limits_{i=1}^n R_i = \sum\limits_{i=1}^n x_i\)) and in each application of the Young inequality (i.e., when \(A = B\) in the framework of Eq. (2)). Consequently, this forces \(R_i = x_i\) for every \(i = 1, 2, \dots, n\). This completes the proof. \(\square\)
Remark 1. The parameter restriction \(1 \le p < 2 + \lambda\) comes from theoretical considerations. When \(p = 1\) or \(\lambda = 0\), the inequality reduces to an equality, showing that the nontrivial content of the theorem concerns the parameter range \(1 < p < 2 + \lambda\). The strict upper bound \(2 + \lambda\) guarantees that the exponent \(\gamma = (2+\lambda-p)/(1+\lambda)\) remains strictly positive. This is critical for the validity of the second application of the Young inequality.
Remark 2. The global constraint in Eq. (1) acts as a mild condition rather than a strict term-by-term restriction. Thanks to this flexibility, Theorem 1 provides a unifying multiple-variable inequality for cyclic sums. To support this claim, Table 1 presents diverse examples satisfying this condition, including cyclic shifts, global and local means, geometric-harmonic means, and hybrid configurations. Each row specifies a possible choice of the auxiliary quantities and states the corresponding relation between their total and the sum of the original variables. In the logarithmic-mean row, the value at \(x_{i+1}=x_i\) is defined by continuity as \(R_i=x_i\). Thus, this entry remains well defined when adjacent variables coincide.
Remark 3. Note that the lower bound in Theorem 1 does not depend on \(p\), which is a consequence of the condition \(1 \le p < 2 + \lambda\). In future work, it would be of interest to examine the regime \(p \ge 2 + \lambda\) to determine how \(p\) affects the lower bound.
Remark 4. For the special case \(p=2\), Theorem 1 can be derived more directly using the Titu lemma. Indeed, for \(\lambda \ge 0\), applying this lemma and Eq. (1) yields
This approach differs from the proof based on the Young inequality presented above. However, extending this technique to the case of a general exponent \(p\), as it appears in Theorem 1, does not appear to be straightforward. Nevertheless, we do not rule out the possibility that this method, or others related to it, could serve as alternative proof strategies.
Remark 5. The parameter \(\lambda\) can be specialized in various ways. For instance, applying Theorem 1 with \(\lambda = k\) for \(k \in \mathbb{N}\), and \(1 \le p < 2\), squaring both sides of the resulting inequality, and summing with respect to \(k\) over \(\mathbb{N}\) gives
To the best of our knowledge, this general inequality has not previously been recorded in this form, and it contains the explicit constant factor \(\pi^2/6\).
Similarly, an integration technique with respect to \(\lambda\) is developed in §2.2.
Remark 6. We highlight a generalized Nesbitt-type inequality derived from Theorem 1. Choosing \(R_1, R_2, \dots, R_n\) as the Nesbitt-type means given in the fourth entry of Table 1 and setting \(\lambda = (n-1)^{p-1}\) with \(1 \le p < 2 + (n-1)^{p-1}\), we obtain
Further illustrative examples are detailed in §3 along with precise equality conditions.
| Classification | \(R_i\) | Property |
|---|---|---|
| Forward cyclic shift | \(R_i = x_{i+1}\) | \(\displaystyle\sum\limits_{i=1}^n R_i = \sum\limits_{i=1}^n x_i\) |
| Global arithmetic mean | \(R_i = \dfrac{1}{n}\displaystyle\sum\limits_{j=1}^n x_j\) | \(\displaystyle\sum\limits_{i=1}^n R_i = \sum\limits_{i=1}^n x_i\) |
| Symmetric adjacent mean | \(R_i = \dfrac{x_{i-1} + x_{i+1}}{2}\) | \(\displaystyle\sum\limits_{i=1}^n R_i = \sum\limits_{i=1}^n x_i\) |
| Nesbitt-type mean | \(R_i = \dfrac{1}{n-1}\left(\displaystyle \left(\sum\limits_{j=1}^n x_j\right)-x_i \right)\) | \(\displaystyle\sum\limits_{i=1}^n R_i = \sum\limits_{i=1}^n x_i\) |
| Adjacent geometric mean | \(R_i = \sqrt{x_i x_{i+1}}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Second-order geometric mean | \(R_i = \sqrt{x_{i-1} x_{i+1}}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Three-term cyclic product | \(R_i = (x_{i-1}x_i x_{i+1})^{1/3}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Global geometric mean | \(R_i = \left(\displaystyle\prod_{j=1}^n x_j\right)^{1/n}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Global harmonic mean | \(R_i = n \left(\displaystyle\sum\limits_{j=1}^n \frac{1}{x_j}\right)^{-1}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Adjacent harmonic mean | \(R_i = \dfrac{2x_i x_{i+1}}{x_i + x_{i+1}}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Harmonic-arithmetic hybrid | \(R_i = \dfrac{x_i x_{i+1}}{x_{i-1} + x_{i+1}}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Minimum-bound coupling | \(R_i = \min(x_i, x_{i+1})\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Logarithmic mean coupling | \(R_i = \dfrac{x_{i+1} – x_i}{\ln x_{i+1} – \ln x_i}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Weighted power-mean hybrid | \(R_i = x_{i+1}^{1/2} \left(\dfrac{1}{n}\displaystyle\sum\limits_{j=1}^n x_j\right)^{1/2}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Heronian mean coupling | \(R_i = \dfrac{x_i + \sqrt{x_i x_{i+1}} + x_{i+1}}{3}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
| Normalized power sum (\(0<r<1\)) | \(R_i = \dfrac{x_{i+1}^r}{\left( (1/n) \sum\limits_{j=1}^n x_j^r\right)^{(r-1)/r}}\) | \(\displaystyle\sum\limits_{i=1}^n R_i \le \sum\limits_{i=1}^n x_i\) |
Building on Theorem 1 and an integration technique, the result below presents a multiple-variable product-type inequality.
Theorem 2. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\), and \(R_1,R_2, \ldots, R_n>0\) such that
Let \(\theta>\eta\ge 0\) and \(p\) such that
Then the following \(n\)-variable product inequality holds:
Equality holds if and only if \(p=1\) or \(R_i =x_i\) for every \(i=1,2, \dots, n\).
Proof. Under the indicated conditions, it follows from Theorem 1 that
Equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\). Considering \(\lambda\) as a continuous variable and integrating both sides with respect to \(\lambda\) over the interval \((\eta, \theta)\), we get
Using standard integration techniques and the elementary properties of natural logarithms, the left-hand side becomes
The right-hand side evaluates to
Combining these expressions into the main inequality yields
Exponentiating both sides gives
The desired inequality is proved.
Furthermore, equality holds if and only if equality is achieved in Theorem 1 for every \(\lambda \in (\eta, \theta)\). The condition \(\lambda = 0\) is excluded, leaving \(p=1\) or \(R_i = x_i\) for every \(i = 1, 2, \dots, n\). This completes the proof. \(\square\)
Remark 7. Setting \(\eta = 0\) in Theorem 2 yields the following one-parameter product inequality:
This special case isolates the interaction between the variables, \(R_1, R_2, \dots, R_n\), and the parameter \(\theta\). It provides a direct multiplicative counterpart to Theorem 1.
Remark 8. In the context of Theorem 2, taking the reciprocal of both sides of the resulting inequality yields the following upper bound:
Numerous inequalities, including generalized cyclic variants, can be established via Theorems 1 and 2. This is illustrated in the subsequent section through a series of propositions.
The result below presents an application of Theorem 1, emphasizing the presence of an arithmetic mean in the denominator of each summand.
Proposition 1. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\), \(\lambda\ge 0\), and \(p\) such that
Then the following \(n\)-variable sum inequality holds:
Equality holds if and only if \(p=1\), \(\lambda=0\), or \(x_1=x_2=\ldots=x_n\).
Proof. The proof follows from Theorem 1 applied with
for every \(i=1,2,\ldots, n\). To support this claim, we must verify the inequality in Eq. (1). It is sufficient to observe that
Furthermore, Theorem 1 ensures that equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\). The latter condition is equivalent to \(x_1=x_2=\dots=x_n\), representing the configuration where the variables coincide with their arithmetic mean. This concludes the proof. \(\square\)
The result below features powers of cyclically adjacent variables in the denominator.
Proposition 2. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\) with the cyclic convention \(x_{n+1} = x_1\), \(\lambda\ge 0\), and \(p\) such that
Then the following \(n\)-variable cyclic sum inequality holds:
Equality holds if and only if \(\lambda=0\), \(p=1\), or if \(x_1=x_2=\ldots=x_n\).
Proof. The proof follows from Theorem 1 applied with
for every \(i=1,2,\ldots, n\). To validate this application, we must verify the inequality in Eq. (1). It is sufficient to notice that, by the cyclic convention,
Furthermore, Theorem 1 ensures that equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\). The latter condition is equivalent to \(x_i=x_{i+1}\) for every \(i=1,2, \dots, n\), so \(x_1 =x_2=\dots =x_n\) by the cyclic convention. This concludes the proof. \(\square\)
The result below is another application of Theorem 1. It features adjacent variable products in the denominator.
Proposition 3. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\) with the cyclic conventions \(x_{0}=x_n\) and \(x_{n+1} = x_1\), \(\lambda\ge 0\), and \(p\) such that
Then the following \(n\)-variable cyclic sum inequality holds:
Equality holds if and only if \(p=1\), \(\lambda=0\), or \(x_1=x_2=\ldots=x_n\).
Proof. The proof follows from Theorem 1 applied with
for every \(i=1,2,\ldots, n\). To support this claim, we must verify the inequality in Eq. (1). Using the classical arithmetic mean-geometric mean inequality with two terms, and \(\sum\limits_{i=1}^n x_{i-1}=\sum\limits_{i=1}^n x_{i+1}=\sum\limits_{i=1}^n x_{i}\) by the cyclic conventions, we get
The desired inequality is proved.
Furthermore, Theorem 1 ensures that equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\). The latter condition is equivalent to
for every \(i=1,2, \dots, n\). Squaring both sides and taking natural logarithms yields \(2\ln x_i = \ln x_{i-1} + \ln x_{i+1}\). Setting \(y_i = \ln x_i\), we get
for any \(i = 1, 2, \dots, n\). Let \(M = \max (y_1, y_2, \dots, y_n)\) and define the non-empty set \(K = \{k \in \{1, \dots, n\} \mid y_k = M\}\). For any \(k \in K\), we have
Equality forces \(y_{k-1} = y_{k+1} = M\), which implies that both \(k-1\) and \(k+1\) belong to \(K\). By cyclic propagation, \(K\) contains all indices \(\{1, 2, \dots, n\}\). Thus, we have \(y_1 = y_2 = \dots = y_n = M\), and exponentiating gives \(x_1 = x_2 = \dots = x_n\). This concludes the proof. \(\square\)
Using the notion of \(m\)-element cyclic neighborhood of an index, the result below applies Theorem 1 to incorporate a product-based term within the denominator.
Proposition 4. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(m\in \{1,2, \ldots, n\}\), \(x_1,x_2, \ldots, x_n>0\) with indices taken modulo \(n\), \(\lambda\ge 0\), and \(p\) such that
For any \(i=1,2,\ldots, n\), we define the \(m\)-element cyclic neighborhood of \(i\) by
with indices taken modulo \(n\).
Then the following \(n\)-variable cyclic sum inequality holds:
Equality holds if and only if \(p=1\), \(\lambda=0\), or \(x_1=x_2=\ldots=x_n\).
Proof. The proof follows from Theorem 1 applied with
for every \(i=1,2,\ldots, n\). To validate this application, we must verify the inequality in Eq. (1). By the arithmetic mean-geometric mean inequality with \(m\) terms,
The desired inequality is proved.
Theorem 1 ensures that equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\). The latter condition is equivalent to
for every \(i=1,2, \dots, n\). Taking the natural logarithm of both sides, setting \(y_i = \ln x_i\), and using the definition of \(\Omega_i\), we get
for every \(i=1,2, \dots, n\). Let \(M = \max (y_1,y_2, \dots, y_n)\) and \(K = \{i \in \{1, 2,\dots, n\} \mid y_i = M\}\), which is non-empty by definition.
For any \(k \in K\), we have
Since the arithmetic mean equals the upper bound \(M\), every term in the sum must achieve this maximum. Thus, we have \(y_{k+1} = y_{k+2} = \dots = y_{k+m} = M\), which guarantees that \(k+1 \in K\). By cyclic propagation, \(K\) contains all indices \(\{1, 2, \dots, n\}\). Consequently, \(y_1 = y_2 = \dots = y_n = M\), which is equivalent to \(x_1 = x_2 = \dots = x_n\). This concludes the proof. \(\square\)
The following two choices of the neighborhood size are particularly useful:
for \(m=n-1\), we have \(\Omega_i=\{1,2, \ldots, n\}\setminus \{i\}\),
for \(m=n\), we have \(\Omega_i=\{1,2,\ldots, n\}\).
In this last case, we have \(\left(\prod_{j \in \Omega_i} x_j\right)^{1/m}=\left(\prod_{j=1}^n x_j\right)^{1/n}\), corresponding to the standard geometric mean.
Finally, the result below incorporates a product-sum structural term within the denominator.
Proposition 5. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(m\in \{1,2, \ldots, n\}\), \(x_1,x_2, \ldots, x_n>0\) with indices taken modulo \(n\), \(\lambda\ge 0\), and \(p\) such that
Let \(\kappa_1,\kappa_2, \ldots, \kappa_n\ge 0\) and \(\sigma_1,\sigma_2, \ldots, \sigma_n\ge 0\) such that, for every \(i=1,2, \dots, n\),
For any \(i=1,2,\ldots, n\), we define the \(m\)-element cyclic neighborhood of \(i\) by
with indices taken modulo \(n\).
Then the following \(n\)-variable cyclic sum inequality holds:
Equality holds if and only if \(p=1\), \(\lambda=0\), or \(x_1=x_2=\ldots=x_n\).
Proof. The proof follows from Theorem 1 applied with
for every \(i=1,2,\ldots, n\). To support this claim, we must verify the inequality in Eq. (1). By the arithmetic mean-geometric mean inequality with \(m\) terms and \(\kappa_i+\sigma_i=1\), we have
The desired inequality is proved.
Furthermore, Theorem 1 ensures that equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\). The latter condition is equivalent to
for every \(i=1,2,\ldots, n\). Taking the natural logarithm of both sides, setting \(y_i = \ln x_i\) and using the definition of \(\Omega_i\), we get
for every \(i = 1, 2, \dots, n\). Let \(M = \max (y_1, y_2, \dots, y_n)\) and define the non-empty index set \(K = \{k \in \{1, 2, \dots, n\} \mid y_k = M\}\). For any \(k \in K\), using \(\kappa_k+\sigma_k=1\), we have
Because the left- and right-hand sides are equal to \(M\), equality must hold throughout. This forces every term in the sums to achieve the maximum, yielding \(y_{k+1} = y_{k+2} = \dots = y_{k+m} = M\). Thus, we have \(k+1 \in K\). By cyclic propagation, \(K\) contains all indices \(\{1, 2, \dots, n\}\), which implies \(y_1 = y_2 = \dots = y_n = M\), and consequently \(x_1 = x_2 = \dots = x_n\). This completes the proof. \(\square\)
As a product counterpart to Proposition 1, the result below examines an arithmetic-mean-based product inequality.
Proposition 6. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\), \(\theta>\eta\ge 0\), and \(p\) such that
Then the following \(n\)-variable product inequality holds:
Equality holds if and only if \(p=1\) or \(x_1=x_2=\ldots=x_n\).
Proof. The result follows from Theorem 2 by setting
for every \(i = 1, 2, \dots, n\), combined with the main lines of the proof of Proposition 1. \(\square\)
The result below provides a cyclic product variant involving adjacent variables.
Proposition 7. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\) with the cyclic convention \(x_{n+1} = x_1\), \(\theta>\eta\ge 0\), and \(p\) such that
Then the following \(n\)-variable cyclic product inequality holds:
Equality holds if and only if \(p=1\) or \(x_1=x_2=\ldots=x_n\).
Proof. The proof is a consequence of Theorem 2 by setting
for every \(i = 1, 2, \dots, n\), and mirroring the steps in the proof of Proposition 2. \(\square\)
Extending this structure to adjacent variable products, the result below presents a product variant of Proposition 3.
Proposition 8. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\) with the cyclic conventions \(x_0=x_n\) and \(x_{n+1} = x_1\), \(\theta>\eta\ge 0\), and \(p\) such that
Then the following \(n\)-variable cyclic product inequality holds:
Equality holds if and only if \(p=1\) or \(x_1=x_2=\ldots=x_n\).
Proof. The result follows from Theorem 2 by setting
for every \(i=1,2,\dots,n\), and adapting the argument used in the proof of Proposition 3. \(\square\)
Finally, by using a product-based term, the result below gives a product inequality generalizing Proposition 4.
Proposition 9. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(m\in \{1,2,\ldots,n\}\), \(x_1,x_2, \ldots, x_n>0\) with indices taken modulo \(n\), \(\theta>\eta\ge 0\), and \(p\) such that
For any \(i=1,2,\ldots, n\), we define the \(m\)-element cyclic neighborhood of \(i\) by
with indices taken modulo \(n\).
Then the following \(n\)-variable cyclic product inequality holds:
Equality holds if and only if \(p=1\) or \(x_1=x_2=\ldots=x_n\).
Proof. The proof is established by applying Theorem 2 with
for every \(i=1,2,\ldots, n\), in conjunction with the steps in the proof of Proposition 4. \(\square\)
Remark 9. A similar result also emerges by combining the frameworks of Theorem 2 and Proposition 5.
In this section, we present four complementary results that complement Theorem 1.
The result below generalizes Theorem 1 by incorporating an additional parameter.
Theorem 3. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\), and \(R_1,R_2, \ldots, R_n>0\) such that
Let \(\lambda, \mu \ge 0\) with \(\lambda + \mu > 0\), and \(p\) satisfy one of the following conditions:
(i) \(\mu > 0\) and
(ii) \(\mu = 0\) and \(p \ge 1\).
Then the following \(n\)-variable sum inequality holds:
Equality holds if and only if \(p=1\), \(R_i =x_i\) for every \(i=1,2, \dots, n\), or (\(\lambda=0\) only under condition (i)).
Proof. Under condition (i), applying Theorem 1 with \(\lambda/\mu\) in place of \(\lambda\) yields
Furthermore, equality holds if and only if \(p=1\), \(\lambda/\mu=0\) so \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\). The desired result is obtained.
Under condition (ii), the Radon inequality and Eq. (3) give
Furthermore, equality holds if and only if equality is attained in Eq. (3) (that is, \(\sum\limits_{i=1}^n R_i=\sum\limits_{i=1}^n x_i\)) and in the application of the Radon inequality, that is, \(p=1\) or \(x_1/ R_1= x_2/R_2=\dots = x_n/R_n\). This latter condition combined with \(\sum\limits_{i=1}^n R_i=\sum\limits_{i=1}^n x_i\) uniquely implies \(R_i =x_i\) for every \(i=1,2, \dots, n\). This concludes the proof. \(\square\)
Setting \(\mu=1\), which satisfies condition (i), Theorem 3 reduces to Theorem 1.
Remark 10. In Theorem 3, choosing \(\mu=0\), \(p=2\), \(R_1, R_2, \dots, R_n\) as the Nesbitt-type means given in the fourth entry of Table 1 and setting \(\lambda = n-1\), we obtain
Notice that, for every \(i=1,2, \dots, n\),
From this identity, we derive
Combining this identity with the preceding inequality yields, after suitable algebraic manipulations,
This corresponds to the \(n\)-variable Nesbitt inequality.
The result below provides a functional generalization of Theorem 1 by incorporating a convex and increasing function.
Theorem 4. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\), and \(R_1,R_2, \ldots, R_n>0\) such that
Let \(\lambda\ge 0\) and \(p\) such that
Let \(f:[0,1]\to \mathbb{R}\) be a convex and increasing function. Then the following \(n\)-variable sum inequality holds:
where
If \(f\) is strictly convex and strictly increasing, equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\).
Proof. The Jensen inequality applied to the convex function \(f\) gives
Under the indicated conditions, using Theorem 1 and the fact that \(f\) is increasing, we obtain
Combining the inequalities above, we get
The desired inequality is proved.
If \(f\) is strictly convex and strictly increasing, equality holds if and only if equality holds in both the application of the Jensen inequality and Theorem 1. Equality in the Jensen inequality requires
for some constant \(c\) and every \(i = 1, 2, \dots, n\). Combining this with the equality conditions from Theorem 1 fixes \(c = 1/ (1+\lambda)\). Substituting this back gives \((1+\lambda)x_i^{p-1} = x_i^{p-1} + \lambda R_i^{p-1}\), so \(\lambda x_i^{p-1} = \lambda R_i^{p-1}\). This identity is satisfied if and only if \(p=1\), \(\lambda=0\), or \(R_i = x_i\) for every \(i = 1, 2, \dots, n\). This matches the equality conditions of Theorem 1. This concludes the proof. \(\square\)
Remark 11. Examples of convex and increasing functions \(f: [0,1] \to \mathbb{R}\) include \(f(x) = x^q\) for \(q \ge 1\), \(f(x) = r^x\) for \(r > 1\), \(f(x)=1/(2-x)\), \(f(x)=x/(2-x)\), \(f(x)=x\ln(1+x)\), \(f(x)=\tan(x)\), and \(f(x) = x \arctan(x)\). For instance, Theorem 4 applied with \(f(x)=x\ln(1+x)\) yields
which is equivalent to the following product inequality:
The result below complements Theorem 1 by providing a precise upper bound for a modified sum.
Theorem 5. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\), and \(R_1,R_2, \ldots, R_n>0\) such that
Let \(\lambda\ge 0\), and \(p\) such that
Then the following \(n\)-variable sum inequality holds:
Equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\).
Proof. Notice that, for every \(i=1,2, \dots, n\),
Summing both sides, we get
Rearranging this identity, we derive
Under the indicated conditions, applying Theorem 1, we obtain
For \(\lambda>0\), dividing both sides by \(\lambda\) yields
The desired inequality is obtained.
Furthermore, equality holds if and only if equality is achieved in Theorem 1, that is, \(p = 1\), \(\lambda = 0\), or \(R_i = x_i\) for every \(i = 1, 2, \dots, n\). This completes the proof. \(\square\)
Derived from the approach in Theorem 4, the result below provides a functional generalization of Theorem 5 by incorporating a concave and increasing function.
Theorem 6. Let \(n\in \mathbb{N}\setminus \{0,1\}\), \(x_1,x_2, \ldots, x_n>0\), and \(R_1,R_2, \ldots, R_n>0\) such that
Let \(\lambda\ge 0\) and \(p\) such that
Let \(f:[0,1]\to \mathbb{R}\) be a concave and increasing function. Then the following \(n\)-variable sum inequality holds:
where
If \(f\) is strictly concave and strictly increasing, equality holds if and only if \(p=1\), \(\lambda=0\), or \(R_i =x_i\) for every \(i=1,2, \dots, n\).
Proof. The Jensen inequality applied to the concave function \(f\) gives
Under the indicated conditions, using Theorem 5 and the fact that \(f\) is increasing, we obtain
Combining the inequalities above, we get
The desired inequality is proved.
If \(f\) is strictly concave and strictly increasing, equality holds if and only if equality is attained in both the application of the Jensen inequality and Theorem 5. Equality in the Jensen inequality requires
for some constant \(c\) and every \(i = 1, 2, \dots, n\). Combining this with the equality conditions from Theorem 5 fixes \(c = 1/ (1+\lambda)\). Substituting this back gives \((1+\lambda)R_i^{p-1} = x_i^{p-1} + \lambda R_i^{p-1}\), so \(\lambda R_i^{p-1} = \lambda x_i^{p-1}\). This identity is satisfied if and only if \(p=1\), \(\lambda=0\), or \(R_i = x_i\) for every \(i = 1, 2, \dots, n\). This matches the equality conditions of Theorem 5. This ends the proof. \(\square\)
Remark 12. Examples of concave and increasing functions \(f: [0,1] \to \mathbb{R}\) include \(f(x) = x^q\) for \(0 < q \le 1\), \(f(x) = 1 – r^{-x}\) for \(r > 1\), \(f(x) = x/ (1+x)\), \(f(x) = \ln(1+x)\), \(f(x) = \arctan(x)\), and \(f(x) = \sin(x)\). For instance, Theorem 6 applied with \(f(x)=\ln(1+x)\) yields
which is equivalent to the following product inequality:
Further new inequalities, including broader cyclic variants, can be stated via these theorems.
In this paper, we have developed a comprehensive analytical framework for multiple-variable inequalities. Two general theorems, one governing sum-type and the other product-type inequalities, are proved. By combining refined algebraic decompositions, applications of the Young inequality, and integral techniques, our approach enables the treatment of a wide range of parameters and global sum conditions. These results translate into propositions concerning arithmetic, geometric, and harmonic means, both local and global, as well as cyclic structures involving multiple elements and advanced hybrid configurations. Furthermore, additional extensions, incorporating auxiliary parameters, generalizations to convex functions via the Jensen inequality, and the derivation of a precise upper bound, demonstrate the versatility of the developed methodology. Future research will explore similar sum-type and product-type inequalities under the regime \(p \ge 2 + \lambda\), weighted versions, and broader applications in mathematical analysis.
Conflicts of Interest: The author declares no conflicts of interest.
Data Availability: No datasets were used in this study.
Funding Information: This research received no external funding.