# A note on Schur-concave functions

- Ionel Rovenţa
^{1}Email author

**2012**:159

https://doi.org/10.1186/1029-242X-2012-159

© Rovenţa; licensee Springer 2012

**Received: **1 April 2012

**Accepted: **6 July 2012

**Published: **19 July 2012

## Abstract

In this paper we consider a class of Schur-concave functions with some *measure properties*. The isoperimetric inequality and Brunn-Minkowsky’s inequality for such kind of functions are presented. Applications in geometric programming and optimization theory are also derived.

**MSC:**26B25, 26B15, 52A40.

## Keywords

## 1 Introduction

About 100 years ago, the properties concerning such notions as length, area, volume as well as the probability of events were abstracted under the banner of the word *measure*. We review the notion of measure using this word in an unusual way. More exactly, we study some measure properties of a special class of Schur-concave functions which will be revealed via some discrete versions of isoperimetric inequality and Brunn-Minkowsky’s inequality.

The notion of Schur-convex function was introduced by I. Schur in 1923 and has had interesting applications in analytic inequalities, elementary quantum mechanics and quantum information theory. See [15]. Let us consider $x=({x}_{1},\dots ,{x}_{n})$$y=({y}_{1},\dots ,{y}_{n})$ to be two vectors from ${\mathbb{R}}^{n}$.

**Definition 1** We say that *x* is majorized by *y*, denote it by $x\prec y$, if the rearrangement of the components of *x* and *y* such that ${x}_{[1]}\ge {x}_{[2]}\ge \cdots \ge {x}_{[n]}$, ${y}_{[1]}\ge {y}_{[2]}\ge \cdots \ge {y}_{[n]}$ satisfies ${\sum}_{i=1}^{k}{x}_{[i]}\le {\sum}_{i=1}^{k}{y}_{[i]}$ ($1\le k\le n-1$) and ${\sum}_{i=1}^{n}{x}_{[i]}={\sum}_{i=1}^{n}{y}_{[i]}$.

**Definition 2** The function $F:A\to \mathbb{R}$, where $A\subset {\mathbb{R}}^{n}$, is called Schur-convex if $x\prec y$ implies $F(x)\le F(y)$. Any such function *F* is called Schur-concave if −*F* is Schur-convex.

An important source of Schur-convex functions can be found in Merkle [16]. Guan [10, 11] proved that all symmetric elementary functions and the symmetric means of order *k* are Schur-concave functions. Other families of Schur-convex functions are studied in [1–7, 20–24, 27].

In [26] a class of analytic inequalities for Schur-convex functions that are made of solutions of a second order nonlinear differential equation was established. These analytic inequalities are used to infer some geometric inequalities such as isoperimetric inequality. Li and Trudinger [14] consider a special class of inequalities for elementary symmetric functions that are relevant to the study of partial differential equations associated with curvature problems.

Recall here a classical result concerning the study of Schur-convexity for the case of smooth functions. See [19].

**Theorem 1**

*Let*$F(x)=F({x}_{1},\dots ,{x}_{n})$

*be a symmetric function with continuous partial derivatives on*${I}^{n}=I\times I\times \cdots \times I$,

*where*

*I*

*is an open interval*.

*Then*$F:{I}^{n}\to \mathbb{R}$

*is Schur*-

*convex if and only if the inequality*

*holds on*${I}^{n}$*for each*$i,j\in \{1,\dots ,n\}$. *It is strictly Schur*-*convex if the inequality* (1.1) *is strict for*${x}_{i}\ne {x}_{j}$, $1\le i,j\le n$. *Any such function* *F* *is Schur*-*concave if the inequality* (1.1) *is reversed*.

*F*, which is an essential property of the

*volume measure*

In other words, by using *F* as an *area measure*, the inequality (1.2) says that from all polygons with *n* edges and the sum of all edges constant, the regular polygon with equal edges has the biggest area.

The main result of the paper concerning the discrete isoperimetric inequality will be presented in Section 2. Generalized geometric programming refers to optimization problems that involve signomial functions which have applications in process synthesis, process design, molecular conformation, chemical equilibrium. See [9]. In Section 3 we introduce a class of Schur-convex functions where we emphasize the relevance of such type of functions in convexification transformations for geometric programming. In addition, we consider a family of symmetric functions which have applications in fully nonlinear elliptic equations such as Monge-Ampère equation. See Theorem 6.4, Corollary 6.5 in [13].

## 2 A discrete isoperimetric inequality

In this section we define some *volume measures* by using a family of Schur-concave functions. Some discrete versions of isoperimetric inequality and Brunn-Minkowsky’s inequality will confirm that our approach is correct. Recall here a well-known result concerning Brunn-Minkowski’s inequality for *convex bodies*, which are nonempty compact, convex subsets of ${\mathbb{R}}^{n}$.

**Theorem 2**

*Let*$\lambda \in (0,1)$

*and let*

*K*,

*L*

*be two convex bodies*.

*Then we have*

*with equality when* *K* *and* *L* *are identically up to a translation*.

We replace the volume measure ${Vol}_{n}(K)$ by a Schur-concave function of the form ${F}_{n}({x}_{1},\dots ,{x}_{n})=f({x}_{1})+\cdots +f({x}_{n})$, where *f* is a nonnegative concave function. In the rest of the paper, ${F}_{n}$*will be called the* *n-dimensional volume function.*

**Theorem 3**

*Let*$\lambda \in [0,1]$.

*Then*,

*for each nonnegative concave function*

*f*,

*we have*

*where*${F}_{n}({x}_{1},\dots ,{x}_{n})=f({x}_{1})+\cdots +f({x}_{n})$.

*Proof* Let $g({x}_{1},\dots ,{x}_{n})={({x}_{1}+\cdots +{x}_{n})}^{1/n}$ defined on ${\mathbb{R}}_{+}^{n}$, which is globally concave and nondecreasing in each variable. What we need to prove is the concavity of the function $g(f({x}_{1}),\dots ,f({x}_{n}))$, which holds since we have a composing between a nondecreasing globally concave function and another concave function. □

Let us consider a more difficult problem concerning the classical isoperimetric inequality for convex bodies from ${\mathbb{R}}^{N}$.

**Theorem 4** (See [18])

*Let*

*K*

*be a convex subset from*${\mathbb{R}}^{n}$

*and*

*B*

*a closed ball from*${\mathbb{R}}^{n}$.

*Then we have*

*with equality if and only if* *K* *is a ball*. *Here*, ${S}_{n-1}(K)$*means the area of the surface of a convex body* *K*.

We replace the volume measure ${Vol}_{n}$ with ${F}_{n}$, the *n*-dimensional volume function from above. Notice that the well-known measures - perimeter, area, volume - are Schur-concave functions. For example, in ${\mathbb{R}}^{3}$ the functions $F({x}_{1},{x}_{2},{x}_{3})={x}_{1}{x}_{2}{x}_{3}$, $F({x}_{1},{x}_{2},{x}_{3})=2({x}_{1}{x}_{2}+{x}_{1}{x}_{3}+{x}_{2}{x}_{3})$ and $F({x}_{1},{x}_{2},{x}_{3})=4({x}_{1}+{x}_{2}+{x}_{3})$ are Schur-concave. In fact, ${F}_{n}({x}_{1},\dots ,{x}_{n})$ could mean the *n*-dimensional volume of a body with *edges*${x}_{1},\dots ,{x}_{n}$.

*n*-dimensional volume functions ${F}_{n}$. We define the connection between the

*n*dimensional volume function ${F}_{n}$ and the $n-1$ dimensional volume function ${F}_{n-1}$ in the following way:

**Remark 1** It is easy to check that if ${F}_{n}$ is a Schur-concave function, then ${F}_{n-1}$ is also a Schur-concave function. Hence, our relation between ${F}_{n}$ and ${F}_{n-1}$ is well defined.

Now, we are able to present the discrete form of the isoperimetric inequality in the context of this type of *n*-dimensional volume functions.

**Theorem 5**

*Let*$({x}_{1},\dots ,{x}_{n})\in {\mathbb{R}}_{+}^{n}$

*and*${F}_{n}({x}_{1},\dots ,{x}_{n})=f({x}_{1})+\cdots +f({x}_{n})$,

*where*$f:{\mathbb{R}}_{+}\to {\mathbb{R}}_{+}$

*is a concave function*.

*Then we have the following isoperimetric inequality*:

*Proof*If we denote by $M=f(\frac{{x}_{1}+\cdots +{x}_{n}}{n})$, the inequality (2.3) becomes

If we consider the function $f(x)=\frac{1}{n}(lnx-lnM)-\frac{1}{n-1}(ln((n-1)x+M)-ln(nM))$, we need to prove that *f* is nonpositive for every $0<x\le M$.

If we compute ${f}^{\mathrm{\prime}}(x)=\frac{M-x}{nx((n-1)x+M)}$, we have that *f* is nondecreasing on $(0,M]$. Since $f(M)=0$, it follows that $f(x)\le 0$ for every $0<x\le M$. □

*n*variables given by

**Proposition 1** *Each elementary symmetric function*${\mathcal{F}}_{n}^{k}$*satisfies the isoperimetric inequality* (2.3).

*Proof*For $k=1$, the inequality (2.3) is obvious. If ${F}_{n}={\mathcal{F}}_{n}^{n}$ the inequality (2.3) becomes the classical

*means inequality*,

*i.e.*, the geometric mean is greater than the harmonic mean. For simplicity, we present the proof only in the case $k=2$. In this case, the inequality (2.3) is reduced to

We consider the function $g(x)={(2x+(n-2)a)}^{n}-{n}^{n}x{a}^{n-1}$, where $a={\mathcal{E}}_{n}^{2}$. By *Newton’s inequalities* we have ${({\mathcal{E}}_{n}^{1})}^{2}\ge {\mathcal{E}}_{n}^{2}$, and now the inequality (2.5) is equivalent to $f(x)\ge 0$, which holds for all $x\ge a$. □

then the inequality (2.3) holds. We have the equality in (2.6) if ${F}_{n}=f({x}_{1})+\cdots +f({x}_{n})$, but (2.6) is not necessary. For example, the symmetric fundamental polynomial of degree *n* satisfies (2.3) but not (2.6).

Finally, it remains an open question if all Schur-concave functions satisfy the isoperimetric inequality (2.3).

## 3 Schur-convexity of a family of symmetric functions and applications

where *f* is a positive function.

In this section, we apply the Schur-convexity of such a family of symmetric functions to infer some applications in generalized geometric programming.

For the case $k=1$, if *f* is a convex function, then the Schur-convexity of ${\mathcal{F}}_{n}^{1}$ is obvious. See Hardy-Littlewood-Polya’s inequality [12]. In [20] an extensive study concerning the Schur convexity of the above class of symmetric functions was given. For the convenience of the reader, we recall here the proof of the Schur-convexity of ${\mathcal{F}}_{n}^{k}$ only in the cases $k=2$ and $k=n-1$.

We say that a function $f:\mathrm{\Omega}\to {\mathbb{R}}_{+}$ is log-convex if the function log*f* is convex. If *f* is a log-convex function then *f* is also a convex function. See [18].

**Theorem 6** *Let*$I\subset \mathbb{R}$*be a convex set with a nonempty interior*. *If*$f:I\to {\mathbb{R}}_{+}$*is a differentiable function in the interior of* *I*, *continuous on* *I*, *positive and log*-*convex*, *then*${\mathcal{F}}_{n}^{2}(x)={\sum}_{1\le i<j\le n}f({x}_{i})f({x}_{j})$, ${x}_{i},{x}_{j}\in \mathrm{\Omega}$, *is Schur*-*convex on*${I}^{n}$.

*Proof*We can write ${\mathcal{F}}_{n}^{2}$ in the following form:

*f*is a log-convex function ($\frac{{f}^{\prime}}{f}$ is monotone increasing), we deduce that

*f*is convex and we have

and it follows that ${\mathcal{F}}_{n}^{2}$ is a Schur-convex function. □

**Theorem 7** *Let*$I\subset \mathbb{R}$*be a convex set with a nonempty interior*. *If*$f:I\to {\mathbb{R}}_{+}$*is a differentiable function in the interior of* *I*, *continuous on* *I*, *positive and log*-*convex*, *then*${\mathcal{F}}_{n}^{n-1}(x)={\sum}_{1\le {i}_{1}\cdots <{i}_{n-1}\le n}{\prod}_{j=1}^{n-1}f({x}_{{i}_{j}})$*is Schur*-*convex on*${I}^{n}$.

*Proof*We can write ${\mathcal{F}}_{n}^{n-1}$ in the following form:

by the same arguments as in the proof from above. □

From many other applications of Schur-convex functions we recall here some results in optimization problems. Generalized geometric programming refers to optimization problems that involve signomial functions which have applications in process synthesis, process design, molecular conformation, chemical equilibrium. See [9]. A signomial function is the sum of products of independent variables, each of them exponentiated to some nonzero rational number. A posynomial is a signomial function with positive coefficients.

In geometric programming, the properties of the function $f:\mathbb{R}\to \mathbb{R}$, such that the transformation $x\mapsto f(y)$ convexifies a posynomial, are investigated.

The main idea to solve such optimization problems is to convexificate the function which needs to be optimized. It will be easy to find the supremum of a convex function because we are looking only to the boundary of the definition domain. Moreover, in the case of Schur-convex functions, the minimum is attained when all the independent variables are equal.

This is the reason why we investigate the transformation which convexifies a particular function. In fact, in geometric programming, the particular case is reduced to the study of convexity of the transformation.

Consider a family of strict positive and monotone functions ${f}_{i}:\mathbb{R}\to \mathbb{R}$$i=1,\dots ,n$ and define ${P}_{n}({y}_{1},\dots ,{y}_{n})={\prod}_{i=1}^{n}{f}_{i}({y}_{i})$. Recall here a recent result from [9].

**Theorem 8** *If*${f}_{i}(y){f}_{i}^{\u2033}(y)-{({f}_{i}^{\prime}(y))}^{2}\ge 0$*for every*$i=1,\dots ,n$, *and*$y\in \mathbb{R}$, *then the transformation function*${P}_{n}({y}_{1},\dots ,{y}_{n})$*is convex in*${\mathbb{R}}^{n}$.

We are now in position to use the Schur-convexity of our family of symmetric functions.

**Theorem 9** *Let*${f}_{i}:\mathbb{R}\to \mathbb{R}$, $i=1,\dots ,n$, *be a family of strict positive and monotone functions*. *If each function*${f}_{i}$*is a log*-*convex function*, *then the function*${P}_{n}^{k}$*is convex*. *Moreover*, *the function*${P}_{n}^{k}$*is Schur*-*convex provided that*${f}_{1}=\cdots ={f}_{n}$.

*Proof* Taking into account Theorems 6, 7 and 8 because the constant function is log-convex, summing term by term, we obtain that all functions ${\mathcal{P}}_{n}^{k}$ are convex. □

Finally, we refer to some inequalities for elementary symmetric functions which are related to the study of partial differential equations associated with curvature problems and have applications to fully nonlinear elliptic equations [8, 14]. Other results on min-max inequalities and optimization theory can be found in [17, 25].

**Proposition 2** *Consider the symmetric function*${F}_{kl}({x}_{1},{x}_{2},\dots ,{x}_{n})=\frac{{\mathcal{F}}_{n}^{1}{\mathcal{F}}_{n}^{l}}{{\mathcal{F}}_{n}^{k}}$, *where*${x}_{i}>0$, $i=1,\dots ,n$. *Then*${F}_{kl}$*is Schur*-*convex*, *for each*$1\le l\le k\le n$.

**Remark 2** The convexity of such functions is an open problem and has applications in fully nonlinear elliptic equations such as Monge-Ampère equation. See Theorem 6.4, Corollary 6.5 from [13], where the above functions are defined on a particular convex cone.

*Proof* For simplicity, we denote by ${\sigma}_{k}$ the elementary symmetric function ${\mathcal{F}}_{n}^{k}$, by ${\sigma}_{i}(-{x}_{1})$ the elementary symmetric function of order *i* which contains only the variables ${x}_{2},{x}_{3},\dots ,{x}_{n}$, by ${\sigma}_{i}(-{x}_{2})$ the elementary symmetric function of order *i* which contains only the variables ${x}_{1},{x}_{3},\dots ,{x}_{n}$ and by ${\sigma}_{i}(-{x}_{1},-{x}_{2})$ the elementary symmetric function of order *i* which contains only the variables ${x}_{3},{x}_{4},\dots ,{x}_{n}$.

*F*, we need to evaluate the two partial derivatives

We need to prove that ${\sigma}_{l-1}{\sigma}_{k-2}\ge {\sigma}_{k-1}{\sigma}_{l-2}$. If we denote by ${E}_{i}$ the arithmetic mean of the elementary symmetric function of order *i*, we have ${E}_{i}^{2}\ge {E}_{i-1}{E}_{i+1}$, the so called Newton’s inequalities. Hence, Newton’s inequalities imply the fact that ${E}_{l-1}{E}_{k-2}\ge {E}_{k-1}{E}_{l-2}$, for $k\ge l$.

it is obvious that ${\sigma}_{l-1}{\sigma}_{k-2}\ge {\sigma}_{k-1}{\sigma}_{l-2}$.

Hence, the Schur convexity of the function ${F}_{kl}$ follows. □

**Remark 3** By a similar argument, it follows that the function ${F}^{\alpha}$ is Schur convex for each $\alpha >0$.

## Declarations

### Acknowledgement

This work was supported by a grant of the Romanian National Authority for Scientific Research, CNCS-UEFISCDI, project number PN-II-RU-TE-2011-3-0223.

## Authors’ Affiliations

## References

- Chu Y-M, Wang G-D, Zhang X-M: The Schur multiplicative and harmonic convexities of the complete symmetric function.
*Math. Nachr.*2011, 284(5–6):653–663. 10.1002/mana.200810197MathSciNetView ArticleMATHGoogle Scholar - Chu Y-M, Xia W-F, Zhao TH: Schur convexity for a class of symmetric functions.
*Sci. China Math.*2010, 53(2):465–474. 10.1007/s11425-009-0188-2MathSciNetView ArticleMATHGoogle Scholar - Chu Y-M, Zhang X-M, Wang G-D: The Schur geometrical convexity of the extended mean values.
*J. Convex Anal.*2008, 15(4):707–718.MathSciNetMATHGoogle Scholar - Chu Y-M, Wang G-D, Zhang X-H: Schur convexity and Hadamard’s inequality.
*Math. Inequal. Appl.*2010, 13(4):725–731.MathSciNetMATHGoogle Scholar - Chu Y-M, Xia W-F: Solution of an open problem for Schur convexity or concavity of the Gini mean values.
*Sci. China Ser. A*2009, 52(10):2099–2106. 10.1007/s11425-009-0116-5MathSciNetView ArticleMATHGoogle Scholar - Chu Y-M, Sun T-C: The Schur harmonic convexity for a class of symmetric functions.
*Acta Math. Sci., Ser. B*2010, 30(5):1501–1506.MathSciNetView ArticleMATHGoogle Scholar - Chu Y-M, Lv Y-P: The Schur harmonic convexity of the Hamy symmetric function and its applications.
*J. Inequal. Appl.*2009., 2009:Google Scholar - Gilbarg D, Trudinger NS:
*Elliptic Partial Differential Equations of Second Order*. Springer, Berlin; 1983.View ArticleMATHGoogle Scholar - Gounaris CE, Floudas CA: Convexity of products of univariate functions and convexification transformations for geometric programming.
*J. Optim. Theory Appl.*2008, 138: 407–427. 10.1007/s10957-008-9402-6MathSciNetView ArticleMATHGoogle Scholar - Guan K: Schur-convexity of complete elementary symmetric function.
*J. Inequal. Appl.*2006., 2006:Google Scholar - Guan K: Some properties of a class of symmetric functions.
*J. Math. Anal. Appl.*2007, 336: 70–80. 10.1016/j.jmaa.2007.02.064MathSciNetView ArticleMATHGoogle Scholar - Hardy GH, Littlewood JE, Pólya G:
*Inequalities*. Cambridge Mathematical Library, Cambridge; 1952. Reprinted (1988)MATHGoogle Scholar - Krylov NV: On the general notion of fully nonlinear second-order elliptic equations.
*Trans. Am. Math. Soc.*1995, 347: 857–895. 10.1090/S0002-9947-1995-1284912-8View ArticleMathSciNetMATHGoogle Scholar - Li M, Trudinger NS: On some inequalities for elementary symmetric functions.
*Bull. Aust. Math. Soc.*1994, 50: 317–326. 10.1017/S0004972700013770View ArticleMathSciNetMATHGoogle Scholar - Marshal AW, Olkin I:
*Inequalities: Theory of Majorization and Its Application*. Academic Press, New York; 1979.Google Scholar - Merkle M: Conditions for convexity of a derivative and applications to the gamma and digammma function.
*Facta Univ., Math. Inform.*2001, 16: 13–20.MathSciNetMATHGoogle Scholar - Niculescu CP, Rovenţa I: Fan’s inequality in geodesic spaces.
*Appl. Math. Lett.*2009, 22: 1529–1533. 10.1016/j.aml.2009.03.020MathSciNetView ArticleMATHGoogle Scholar - Niculescu CP, Persson L-E:
*Convex Functions and Their Applications. A Contemporary Approach*. Springer, New York; 2006.View ArticleMATHGoogle Scholar - Roberts AW, Varberg DE:
*Convex Functions*. Academic Press, New York; 1973.MATHGoogle Scholar - Rovenţa I: Schur-convexity of a class of symmetric functions.
*An. Univ. Craiova, Ser. Mat. Inform.*2010, 37(1):12–18.MathSciNetMATHGoogle Scholar - Sun T-C, Lv Y-P, Chu Y-M: Schur multiplicative and harmonic convexities of generalized Heronian mean in
*n*variables and their applications.*Int. J. Pure Appl. Math.*2009, 55(1):25–33.MathSciNetMATHGoogle Scholar - Xia W-F, Chu Y-M: The Schur convexity of Gini mean values in the sense of harmonic mean.
*Acta Math. Sci., Ser. B*2011, 31(3):1103–1112.MathSciNetView ArticleMATHGoogle Scholar - Xia W-F, Chu Y-M: The Schur harmonic convexity of Lehmer means.
*Int. Math. Forum*2009, 4(41–44):2009–2015.MathSciNetMATHGoogle Scholar - Xia W-F, Wang G-D, Chu Y-M: Schur convexity and inequalities for a class of symmetric functions.
*Int. J. Pure Appl. Math.*2010, 58(4):435–452.MathSciNetMATHGoogle Scholar - Zhang X-M: Optimization of Schur-convex functions.
*Math. Inequal. Appl.*1998, 1(3):319–330.MathSciNetMATHGoogle Scholar - Zhang X-M: Schur-convex functions and isoperimetric inequalities.
*Proc. Am. Math. Soc.*1998, 126(2):461–470. 10.1090/S0002-9939-98-04151-3View ArticleMathSciNetMATHGoogle Scholar - Zhang X-M, Chu Y-M: Convexity of the integral arithmetic mean of a convex function.
*Rocky Mt. J. Math.*2010, 40(3):1061–1068. 10.1216/RMJ-2010-40-3-1061MathSciNetView ArticleMATHGoogle Scholar

## Copyright

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.