Notes on Higher-Order Convex Functions (IV)

Abstract

Authors

Keywords

?

Paper coordinates

T. Popoviciu, Notes sur les fonctions convexes d’ordre supérieur (IV), Disquisitiones mathematicae et physicae, 1 (1940) no. 2, pp. 162-171 (in French).

PDF

About this paper

Journal

Disquisitiones mathematicae et physicae

Publisher Name
DOI
Print ISSN
Online ISSN

google scholar link

??

Paper (preprint) in HTML form

NOTES ON HIGHER ORDER CONVEX FUNCTIONS (IV)

BY
TIBERIU POPOVICIU
(Cluj)

NOTES ON HIGHER ORDER CONVEX FUNCTIONS (IV) 1 )

  1. 1.

    Before we deal with the inequalities that we want to establish in this work, it is necessary to summarize some properties of the orthogonal polynomials that we will use later.

A sequence of polynomials inxx

P0P1,,Pm,P_{0}P_{1},\ldots,P_{m},\ldots (1)

Or

Pm=Pm(x)=xm+,m=0.1,,(P0=1)P_{m}=P_{m}(x)=x^{m}+\ldots,m=0,1,\ldots,\left(P_{0}=1\right)

is an orthogonal sequence if:
11^{\circ}. We can find a linear operationU(f)U(f), defined in the field of polynomials, such that
22^{\circ}. We have
a)
U(PiPI)=0,iIU\left(P_{i}P_{j}\right)=0,i\neq j
b)U(Pi2)>0U\left(P_{i}^{2}\right)>0,
whateveri,I=0,1,2,i,j=0,1,2,\ldots
It follows that the orthogonal sequence is completely characterized by the moments

U(xi)=ci,i=0.1,U\left(x^{i}\right)=c_{i},\quad i=0,1,\ldots

and then we have

U(has0xi+has1xi1++hasi)=has0ci+has1ci1++hasic0U\left(a_{0}x^{i}+a_{1}x^{i-1}+\ldots+a_{i}\right)=a_{0}c_{i}+a_{1}c_{i-1}+\ldots+a_{i}c_{0}
0

With the help of22^{\circ}we easily show that the polynomials (1) are completely determined and we can calculate them explicitly. We know, moreover, that the operationU(f)U(f)is necessarily of the form 2 )

U(f)=+f(x)𝑑α(x)U(f)=\int_{-\infty}^{+\infty}f(x)d\alpha(x)

Orα(x)\alpha(x)is a non-decreasing function in (-\infty,++\infty).
It can be assumed that only the2r2rmomentsc0,c1,c2r1c_{0},c_{1},\ldots c_{2r-1}are given (α(x)\alpha(x)then only takes a finite number of distinct values). In this case we take in2has)i,I=0.1,r\left.2^{\circ}a\right)i,j=0,1\ldots,rand in2b)i=0.1\left.2^{\circ}b\right)i=0,1\ldots,r1r-1. We then have a finite orthogonal sequenceP0,P1,,PrP_{0},P_{1},\ldots,P_{r}. But, as we can easily see, such a sequence is always the section of an infinite sequence (1).
2. Let (1) be an orthogonal sequence. We know that the zeros of the polynomialPi(i>0)P_{i}(i>0)are all real and distinct. Two consecutive polynomialsPi1,PiP_{i-1},P_{i}never have common zeros and the zeros ofPiP_{i}separate those ofPi1P_{i-1}.

Letx1<x2<<xmx_{1}<x_{2}<\ldots<x_{m}the zeros of the polynomialPmP_{m}. Consider the system of2m2mequations
(2)ci=λ1x1i+λ2x2i++λmxmi,i=0.1,2m1\quad c_{i}=\lambda_{1}x_{1}^{i}+\lambda_{2}x_{2}^{i}+\ldots+\lambda_{m}x_{m}^{i},\quad i=0.1\ldots,2m-1,
in the unknownsλ1,λ2,,λm,x1,x2,,xm\lambda_{1},\lambda_{2},\ldots,\lambda_{m},x_{1},x_{2},\ldots,x_{m}. We immediately find that thexix_{i}are precisely the zeros of the polynomialPmP_{m}and theλi\lambda_{i}, which are then determined completely by themmfirst equations, are positive numbers. We will say that these numbersλi\lambda_{i}are the weights of the polynomialPmP_{m}. These weights also enjoy the property that the operation

Um(f)=i=1mλif(xi)U_{m}(f)=\sum_{i=1}^{m}\lambda_{i}f\left(x_{i}\right)

is an operationU(f)U(f)corresponding to the finite orthogonal sequenceP0P_{0},P1,,PmP_{1},\ldots,P_{m}. These results are easily obtained by noting that the orthogonality condition22^{\circ}a) gives usU(xiPm)=0,i=0.1,U\left(x^{i}P_{m}\right)=0,i=0,1,\ldots,m1m-1, which precisely express that thexix_{i}are the zeros ofPmP_{m}and that system (2) is then compatible inλ1,λ2,,λm\lambda_{1},\lambda_{2},\ldots,\lambda_{m}. The positivity of the weights easily results from the fact that these numbers are inversely proportional to the numbersPm1(xi)Pm(xi)P_{m-1}\left(x_{i}\right)P_{m}^{\prime}\left(x_{i}\right). We can also notice that
done

c2r=\displaystyle c_{2r}= U(x2r)=U((i=1mxirPm(x)(xxi)Pm(xi))2)=\displaystyle U\left(x^{2r}\right)=U\left(\left(\sum_{i=1}^{m}\frac{x_{i}^{r}P_{m}(x)}{\left(x-x_{i}\right)P_{m}^{\prime}\left(x_{i}\right)}\right)^{2}\right)= (3)
=i=1mxi2rU((Pm(x)(xxi)Pm(xi))2),r=0.1,,m1\displaystyle=\sum_{i=1}^{m}x_{i}^{2r}U\left(\left(\frac{P_{m}(x)}{\left(x-x_{i}\right)P_{m}^{\prime}\left(x_{i}\right)}\right)^{2}\right),\quad r=0,1,\ldots,m-1
λi=U((Pm(x)(xxi)Pm(xi))2)>0,i=1.2,,m\displaystyle\quad\lambda_{i}=U\left(\left(\frac{P_{m}(x)}{\left(x-x_{i}\right)P_{m}^{\prime}\left(x_{i}\right)}\right)^{2}\right)>0,\quad i=1,2,\ldots,m

because the operationU(f)U(f)is positive.

00footnotetext:2 ) See H. Hamburger. “Over and over again the discussion of current moment problems”. Math. Ann., 81, 235-319 (1920).

Let us also note that in an orthogonal sequence (1) we can arbitrarily take the polynomialsPm1,PmP_{m-1},\mathrm{P}_{m}with the only conditions of reality and separation of their zeros. We can also arbitrarily take the polynomialPmP_{m}with real and distinct zeros and the positive weights of this polynomial. By these data the polynomialsP0,P1,,PmP_{0},P_{1},\ldots,P_{m}of the sequence (1) are completely determined.

Now consider the polynomialPm+ϱPm1P_{m}+\varrho P_{m-1}Orϱ\varrhois a constant0\not\subset 0. We can easily see that the zerosy1<y2<<yny_{1}<y_{2}<\ldots<y_{n}of this polynomial are all real and distinct. We have the separation properties

y1<x1<y2<x2<<ym<xm if ϱ>0\displaystyle y_{1}<x_{1}<y_{2}<x_{2}<\ldots<y_{m}<x_{m}\quad\text{ si }\varrho>0
x1<y1<x2<y2<<xm<ym if ϱ<0\displaystyle x_{1}<y_{1}<x_{2}<y_{2}<\ldots<x_{m}<y_{m}\quad\text{ si }\varrho<0

The numberϱ\varrhois completely determined by the fact thaty1y_{1}has any given value<x1<x_{1}Orymy_{m}any given value>xm>x_{m}. We can also notice that the zeros ofPm1P_{m-1}always separate those ofPm+ϱPm1P_{m}+\varrho P_{m-1}.

The system
(4)ci=v1y1i+v2y2i++vmymi,i=0.1,,2m2\quad c_{i}=v_{1}y_{1}^{i}+v_{2}y_{2}^{i}+\ldots+v_{m}y_{m}^{i}\quad,\quad i=0,1,\ldots,2m-2
is still compatible inνi\nu_{i}We still have dinner that numbersν1,ν2,,νm\nu_{1},\nu_{2},\ldots,\nu_{m}. determined by this system, are the weights of the polynomialPm+ϱPm1P_{m}+\varrho P_{m-1}, These weights are positive regardless of o. Indeed, formula (3) is still applicable. We have

c2r=U(x2r)=\displaystyle c_{2r}=U\left(x^{2r}\right)= i=1myi2rU((Q(x)(xyi)Q(yi))2)\displaystyle\sum_{i=1}^{m}y_{i}^{2r}U\left(\left(\frac{Q(x)}{\left(x-y_{i}\right)Q^{\prime}\left(y_{i}\right)}\right)^{2}\right)
r=0.1,,m1\displaystyle r=1,\ldots,m-1

done

vi=U((Q(x)(xyi)Q(yi))2)>0,i=1.2,,mv_{i}=U\left(\left(\frac{Q(x)}{\left(x-y_{i}\right)Q^{\prime}\left(y_{i}\right)}\right)^{2}\right)>0,\quad i=1,2,\ldots,m

where we posedQ(x)=Pm(x)ϱPm1(x)Q(x)=P_{m}(x)\not-\varrho P_{m-1}(x).
It can also be easily shown that we thus obtain all the solutions of the system (4).
3. Let us now return to the convex functions. We will first give an interpretation of the divided difference[x1,x2,,xn+2;f]\left[x_{1},x_{2},\ldots,x_{n+2};f\right]of ordern+1n+1. We can write

[x1,x2,,xn+2;f]=p1f(x1)+p2f(x2)++pn+2f(xn+2)\left[x_{1},x_{2},\ldots,x_{n+2};f\right]=p_{1}f\left(x_{1}\right)+p_{2}f\left(x_{2}\right)+\ldots+p_{n+2}f\left(x_{n+2}\right)

where thepip_{i}do not depend on the functionf(x)f(x). If we supposex1<x2<<xn+2x_{1}<x_{2}<\ldots<x_{n+2}, the well-known expression, by the quotient of two
determinants, of the divided difference, shows us that the coefficientsp1,p2,,pn+2p_{1},p_{2},\ldots,p_{n+2}are alternately positive and negative, the latter always being positivef,pn+2>0\mathrm{f},p_{n+2}>0. On the other hand, these coefficients are, up to a constant factor, determined by the relations

p1x1i+p2x2i++pn+2xn+2i=0,i=0.1,,np_{1}x_{1}^{i}+p_{2}x_{2}^{i}+\ldots+p_{n+2}x_{n+2}^{i}=0,\quad i=0,1,\ldots,n

We can therefore state the following properties:
Ifn=2m3n=2m-3is odd andx1<x2<<xn+2x_{1}<x_{2}<\ldots<x_{n+2}, we can write

[x1,x2,,xn+2;f]=i=1mλif(x2i1)i=1m1μIf(x2I)\left[x_{1},x_{2},\ldots,x_{n+2};f\right]=\sum_{i=1}^{m}\lambda_{i}f\left(x_{2i-1}\right)-\sum_{i=1}^{m-1}\mu_{j}f\left(x_{2j}\right)

and thenx2,x4,,x2m2x_{2},x_{4},\ldots,x_{2m-2}are the zeros andμ1,μ2,,μm1\mu_{1},\mu_{2},\ldots,\mu_{m-1}the weights of the polynomialPm1P_{m-1}of the orthogonal sequenceP0,P1,,PmP_{0},P_{1},\ldots,P_{m}, Orx1,x3,,x2m1x_{1},x_{3},\ldots,x_{2m-1}are the zeros andλ1,λ2,,λm\lambda_{1},\lambda_{2},\ldots,\lambda_{m}the weights of the polynomialPmP_{m}.

Ifn=2m2n=2m-2esi pair andx1<x2<<x2mx_{1}<x_{2}<\ldots<x_{2m}, we can write

[x1,x2,,xn+2;f]=i=1mλif(x2i)I=1mvif(x2I1)\left[x_{1},x_{2},\ldots,x_{n+2};f\right]=\sum_{i=1}^{m}\lambda_{i}f\left(x_{2}i\right)-\sum_{j=1}^{m}v_{i}f\left(x_{2j-1}\right)

and thenx1,x3,,x2m1x_{1},x_{3},\ldots,x_{2m-1}are the zeros andν1,ν2,,νm\nu_{1},\nu_{2},\ldots,\nu_{m}the weights of a polynomialPm+ϱPm1P_{m}+\varrho P_{m-1}, Orϱ>0\varrho>0AndPm1,PmP_{m-1},P_{m}belong to the orthogonal sequenceP0,P1,,Pm1,Pm,P_{0},P_{1},\ldots,P_{m-1},P_{m},\ldots, determined by the zerosx2,x4,x_{2},x_{4},\ldots,x2mx_{2m}and the weightsλ1,λ2,,λmdu\lambda_{1},\lambda_{2},\ldots,\lambda_{m}dupolynomialPmP_{m}.
4. Supposen=2m1n=2m-1odd and write the inequality

i=1rλif(xi)I=1mμIf(yI)\sum_{i=1}^{r}\lambda_{i}f\left(x_{i}\right)\geqq\sum_{j=1}^{m}\mu_{j}f\left(y_{j}\right) (5)

Orr>m,λ1,λ2,,λrr>m,\lambda_{1},\lambda_{2},\ldots,\lambda_{r}are positive andx1<x2<<xrx_{1}<x_{2}<\ldots<x_{r},y1<y2<<ymy_{1}<y_{2}<\ldots<y_{m}.

Let us look for the necessary and sufficient conditions for inequality (5) to be verified for any functionf(x)f(x), non-concave of ordernn, defined on the pointsxi,yI,i=1.2,,r,I=1.2,,mx_{i},y_{j},i=1,2,\ldots,r,j=1,2,\ldots,m.

Referring to the previous Note 3 ), we see that conditions
(6)i=1rλixis=I=1mμIyis,s=0.1,,n(n=2m1)\quad\sum_{i=1}^{r}\lambda_{i}x_{i}^{s}=\sum_{j=1}^{m}\mu_{j}y_{i}^{s}\quad,s=0,1,\ldots,n(n=2m-1)
are necessary. It is therefore necessary that theyiy_{i}let the zeros and theμI\mu_{j}the weights of the polynomialPmP_{m}of the orthogonal sequenceP0,P1,,Pm,,PrP_{0},P_{1},\ldots,P_{m},\ldots,P_{r}, determined by the zerosxix_{i}and the weightsλi\lambda_{i}of the polynomialPrP_{r}.

00footnotetext: 3 ) See note III in Mathematica, 16, 74-86 (1940).

We propose to demonstrate that equalities (6) are also sufficient. We will do this demonstration by induction. The property is true forr=m+1r=m+1, because then inequality (5) is an inequality of definition of non-concavity of ordernn. Indeed, the difference between the first and second members is, up to a constant positive factor, a divided difference of ordern+1n+1. Let us now show that assuming the property if in the first member of (5) is true there isr1r-1terms (r>m+1r>m+1), it will result true forrrterms. By hypothesis, if we determine theyIy_{j}^{\prime}and theμI>0\mu_{j}^{\prime}>0by equalities

i=1r1λixis=I=1mμIyIs,s=0.1,,n\sum_{i=1}^{r-1}\lambda_{i}x_{i}^{s}=\sum_{j=1}^{m}\mu_{j}^{\prime}y_{j}^{\prime}s\quad,\quad s=0,1,\ldots,n (7)

We have

i=1r1λif(xi)I=1mμIf(yI)\sum_{i=1}^{r-1}\lambda_{i}f\left(x_{i}\right)\geqq\sum_{j=1}^{m}\mu_{j}^{\prime}f\left(y_{j}^{\prime}\right)

SO

I=1rλif(xi)I=1mμIf(ys)+λrf(xr)\sum_{j=1}^{r}\lambda_{i}f\left(x_{i}\right)\geq\sum_{j=1}^{m}\mu_{j}^{\prime}f\left(y_{s}^{\prime}\right)+\lambda_{r}f\left(x_{r}\right) (8)

But, we know that theyIy_{j}^{\prime}are distinct and all included betweenx1x_{1}Andxr1x_{r-1}. We can therefore determine theyI"y_{j}^{\prime\prime}and theμI">0\mu_{j}^{\prime\prime}>0by equalities

I=1mμIyIs+λrxrs=I=1mμI"yI"s,s=0.1,,n\sum_{j=1}^{m}\mu_{j}^{\prime}y_{j}^{s}+\lambda_{r}x_{r}^{s}=\sum_{j=1}^{m}\mu_{j}^{\prime\prime}y_{j}^{\prime\prime s}\quad,\quad s=0,1,\ldots,n (9)

We then have

I=1mμIf(y)+λrf(xr)I=1mμI"f(yI")\sum_{j=1}^{m}\mu_{j}^{\prime}f\left(y^{\prime}\right)+\lambda_{r}f\left(x_{r}\right)\geq\sum_{j=1}^{m}\mu_{j}^{\prime\prime}f\left(y_{j}^{\prime\prime}\right) (10)

But, (7) and (9) compared with (6) show us thatμi"=μi\mu_{i}^{\prime\prime}=\mu_{i},yI"=yIy_{j}^{\prime\prime}=y_{j}and then, from (8) and (10), inequality (5) results.

We can therefore state the following property:
Ify1,y2,,ymy_{1},y_{2},\ldots,y_{m}are the zeros andμ1,μ2,,μm\mu_{1},\mu_{2},\ldots,\mu_{m}the weights of the polynomialPmP_{m}of the orthogonal sequenceP0,P1,,Pm,,PrP_{0},P_{1},\ldots,P_{m},\ldots,P_{r}determined by zerosx1,x2,,xrx_{1},x_{2},\ldots,x_{r}and the weightsλ1,λ2,,λr(r>m)\lambda_{1},\lambda_{2},\ldots,\lambda_{r}(r>m)of the polynomialPrP_{r}, inequality (5) is verified for any non-concape function of odd ordern=2m1n=2m-1, defined on the pointsxi,yIx_{i},y_{j}.

If, moreover, the function is convex of ordern=2m1n=2m-1on the pointsxi,yIx_{i},y_{j}we have in (5) the sign>>.

The last part of the statement is immediately justified.
5. Ifm=1,n=1m=1,n=1 ; inequality (5) becomes

i=1rλif(xi)i=1rλif(i=1rλixii=1rλi)\frac{\sum_{i=1}^{r}\lambda_{i}f\left(x_{i}\right)}{\sum_{i=1}^{r}\lambda_{i}}\geq f\left(\frac{\sum_{i=1}^{r}\lambda_{i}x_{i}}{\sum_{i=1}^{r}\lambda_{i}}\right)

which is the classical Jensen inequality for ordinary non-concave functions (of order 1) 4 ).

Consider a finite and closed interval(has,b)(a,b)and eitherf(x)f(x)a continuous non-concave function of order1,3,5,1,3,5,\ldots, therefore of any odd order.

Let then (1) be an orthogonal sequence chosen so that the zeros of all the polynomialsPmP_{m}be in(has,b)(a,b). For example, we can take the orthogonal sequence corresponding to the operation

U(f)=hasbp(x)f(x)𝑑xU(f)=\int_{a}^{b}p(x)f(x)dx (11)

Orp(x)p(x)is a positive summable function in the interval (has,ba,b). Let us designate byxm1,xm2,,xmmx_{m1},x_{m2},\ldots,x_{mm}zeros and byλm1,λm2,,λmm\lambda_{m1},\lambda_{m2},\ldots,\lambda_{mm}the weights of the polynomialPm,m=1.2,P_{m},m=1,2,\ldots, If we pose

Mm(f)=i=1mλmif(xmi)M_{m}(f)=\sum_{i=1}^{m}\lambda_{mi}f\left(x_{mi}\right)

we have inequalities

M1(f)M2(f)Mm(f)M_{1}(f)\leqq M_{2}(f)\leqq\ldots\leqq M_{m}(f)\leqq\ldots

The sequel

M1(f),M2(f),,Mm(f),M_{1}(f),M_{2}(f),\ldots,M_{m}(f),\ldots (12)

is therefore non-decreasing. It is, moreover, bounded since

|Mm(f)|(i=1mλmi)max(has,b)|f(x)|=c0max(has,b)|f(x)|\left|M_{m}(f)\right|\leqq\left(\sum_{i=1}^{m}\lambda_{mi}\right)\max_{(a,b)}|f(x)|=c_{0}\max_{(a,b)}|f(x)|

It follows that the sequence (12) is convergent. It is easy to see that in this caseU(f)U(f)has a perfectly definite meaning and we have

limmMm(f)=U(f)\lim_{m\rightarrow\infty}M_{m}(f)=U(f)

Indeed, it is enough to note that the formula is true for a polynomial and that the operationU(f)U(f), defining the sequence (1), extends immediately to the set of continuous functions in (has,ba,b).

For example, if we have (11) we can write

limmMm(f)=hasbp(x)f(x)𝑑x\lim_{m\rightarrow\infty}M_{m}(f)=\int_{a}^{b}p(x)f(x)dx
00footnotetext: 4 ) JLWV Jensen. “On complex functions and inequalities between average salts”. Acta Math., 30, 175-193 (1906).

By choosing the function properlyf(x)5f(x)^{5}), we arrive at various inequalities between the zeros of orthogonal polynomials.
6. Let us now examine the analogous problem for even-order functionsn=2m2n=2m-2. Consider again inequality (5), whereλi,μi\lambda_{i},\mu_{i}are positive andx1<x2<<xr,y1<y2<<ymx_{1}<x_{2}<\ldots<x_{r},y_{1}<y_{2}<\ldots<y_{m}. For this inequality to be verified for any non-concave function of ordern=2m2n=2m-2, defined on the pointsxi,yIx_{i},y_{j}the conditions

i=1rλixis=I=1mμIyIs,s=0.1,,n(n=2m2)\sum_{i=1}^{r}\lambda_{i}x_{i}^{s}=\sum_{j=1}^{m}\mu_{j}y_{j}^{s},s=0,1,\ldots,n\quad(n=2m-2) (12)

are necessary. So, ifP0,P1,,Pm1,Pm,,PrP_{0},P_{1},\ldots,P_{m-1},P_{m},\ldots,P_{r}is the orthogonal sequence determined by the zerosxix_{i}and the weightsλi\lambda_{i}of polynomialPrP_{r}, it is necessary that theyiy_{i}let the zeros andμi\mu_{i}the weights of a polynomial of the formPm+ϱPm1P_{m}+\varrho P_{m-1},ϱ\varrhobeing a constant. But, apart from (12), there is still a necessary condition. It is necessary, in fact, that we have
(12')
a)y1<x1y_{1}<x_{1}
or
b)y1=x1,μ1>λ1y_{1}=x_{1},\quad\mu_{1}>\lambda_{1}.

Let us first show that these two possibilities can be written in the unique form

y1x1y_{1}\leqq x_{1} (13)

We see, in fact, from (12), that ify1=x1y_{1}=x_{1}, we must haveμ1>λ1\mu_{1}>\lambda_{1}. Otherwise we could write

(λ1μ1)x1s+i=2rλixis=I=2mμIyIs,s=0.1,,n(n=2m2)\left(\lambda_{1}-\mu_{1}\right)x_{1}^{s}+\sum_{i=2}^{r}\lambda_{i}x_{i}^{s}=\sum_{j=2}^{m}\mu_{j}y_{j}^{s},s=0,1,\ldots,n(n=2m-2)

which, according to the remark in No. 2, is impossible.
We now propose to demonstrate that equalities (12) and inequality (13) are also sufficient. We can still proceed by induction. Ifr=mr=mthe property is evident from the results of No. 3. Let us now show that assuming the property to be true if in the first member of (5) there isr1r-1terms(r>m)(r>m), it will also be true forrrterms. By hypothesis, if we determine theyiy_{i}^{\prime}and theμi>0\mu_{i}^{\prime}>0by equalities

i=2rλixis=I=1mμIyIs,s=0.1,,n\sum_{i=2}^{r}\lambda_{i}x_{i}^{s}=\sum_{j=1}^{m}\mu_{j}^{\prime}y_{j}^{\prime s},\quad s=0,1,\ldots,n

Andy1=x1y_{1}^{\prime}=x_{1}, We have

i=1rλif(xi)I=1mμIf(yI)+λ1f(x1)\sum_{i=1}^{r}\lambda_{i}f\left(x_{i}\right)\geq\sum_{j=1}^{m}\mu_{j}^{\prime}f\left(y_{j}^{\prime}\right)+\lambda_{1}f\left(x_{1}\right)

5 ) For example log1x\frac{1}{x}is such a function in an interval(has,b),0<has<b(a,b),0<a<b.

We can then determine theyI"y_{j}^{\prime\prime}and theμI">0\mu_{j}^{\prime\prime}>0so that we have

I=1mμIyIs+λ1x1s=I=1mμI"yI"s,s=0.1,,n\sum_{j=1}^{m}\mu_{j}^{\prime}y_{j}^{\prime s}+\lambda_{1}x_{1}^{s}=\sum_{j=1}^{m}\mu_{j}^{\prime\prime}y_{j}^{\prime\prime s}\quad,\quad s=0,1,\ldots,n

Andy1"x1y_{1}^{\prime\prime}\leqq x_{1}.
We immediately see thatyI"=yI,μI"=μIy_{j}^{\prime\prime}=y_{j},\mu_{j}^{\prime\prime}=\mu_{j}and inequality (5) results.

We can therefore state the following property:
Ify1<y2<<ymy_{1}<y_{2}<\ldots<y_{m}are the zeros andμ1,μ2,,μm\mu_{1},\mu_{2},\ldots,\mu_{m}the weights of a polynomialPm+ϱPm1P_{m}+\varrho P_{m-1}OrPm1,PmP_{m-1},P_{m}belong to the orthogonal sequenceP0,P1,,Pm1,Pm,,PrP_{0},P_{1},\ldots,P_{m-1},P_{m},\ldots,P_{r}determined by zerosx1<x2<<xmx_{1}<x_{2}<\ldots<x_{m}and the weightsλ1,λ2,,λr\lambda_{1},\lambda_{2},\ldots,\lambda_{r}of the polynomialPrP_{r}and whereϱ\varrhois a (positive) constant determined so that we havey1x1y_{1}\leqq x_{1}, inequality (5) is verified for any non-concase function of even ordern=2m2n=2m-2, defined on the pointsxi,yIx_{i},y_{j}.

If, moreover, the function is consex of ordern=2m2n=2m-2on the pointsxi,yIx_{i},y_{j}and ifr>mr>mOrr=m,y1<x1r=m,y_{1}<x_{1}the sign>>is valid in (5).
7. We can deduce from inequality (5) integral inequalities by passages to the limit.

Let's supposen=2m1n=2m-1odd. Eitherp(x)p(x)a summable and positive function in the finite interval(has,b)6),φ(x)\left.(a,b)^{6}\right),\varphi(x)a summable and bounded function in(has;b)(a;b)and eitherHASφ(x)BA\leqq\varphi(x)\leqq B. We then have the following property:

Iff(x)f(x)is a continuous, non-concased function of ordern=2m1n=2m-1in the interroom (HAS,BA,B), we have the inequality

hasbp(x)f(φ(x))𝑑xhasbp(x)𝑑xI=1mμIf(yI)\frac{\int_{a}^{b}p(x)f(\varphi(x))dx}{\int_{a}^{b}p(x)dx}\geqq\sum_{j=1}^{m}\mu_{j}f\left(y_{j}\right) (14)

OryIy_{j}are the zeros andμI\mu_{j}the weights of the polynomialPmP_{m}of the orthogonal sequenceP0,P1,P2,P_{0},P_{1},P_{2},\ldots, determined by the moments

ci=hasbp(x)φi(x)𝑑xhasbp(x)𝑑x,i=0.1,c_{i}=\frac{\int_{a}^{b}p(x)\varphi^{i}(x)dx}{\int_{a}^{b}p(x)dx},i=0,1,\ldots (15)
00footnotetext: {}^{\text{6 }}) More generally it is sufficient thatp(x)0p(x)\geqq 0In(has,b)(a,b)Andhasbp(x)𝑑x>0\int_{a}^{b}p(x)dx>0.

In the casem=1,n=1m=1,n=1, we find inequality

hasbp(x)f(φ(x))𝑑xhasbp(x)𝑑xf(hasbp(x)φ(x)𝑑xhasbp(x)𝑑x)\frac{\int_{a}^{b}p(x)f(\varphi(x))dx}{\int_{a}^{b}p(x)dx}\geq f\left(\frac{\int_{a}^{b}p(x)\varphi(x)dx}{\int_{a}^{b}p(x)dx}\right)

well known for non-concave functions of order 1.
Forn=2m2n=2m-2pair we have an analogous property:
Iff(x)f(x)is a continuous, non-concased function of ordern=2m2n=2m-2in the meantime (HAS,BA,B), we have inequality (14), wherey1<y2<<ymy_{1}<y_{2}<\ldots<y_{m}are the zeros andμI\mu_{j}the weights of a polynomialPm+ϱPm1P_{m}+\varrho P_{m-1}in whichPm1P_{m-1},PmP_{m}are the orthogonal polynomials of degreem1,mm-1,mof the sequence determined by the moments (15) and o a constant chosen so thaty1HASy_{1}\leqq A.

1940

Related Posts