Notes on higher order convex functions (V)

Abstract

Authors

Keywords

?

Paper coordinates

T. Popoviciu, Notes sur les fonctions convexes d’ordre supérieur (V), Bull. de la Sect. Sci. de l’Acad. Roum., 22 (1940), pp. 351-356 (in French).

PDF

About this paper

Journal

Bulletin de la Section Scientifique de l’Académie Roumaine

Publisher Name
DOI
Print ISSN
Online ISSN

[MR0002561, JFM 66.0242.02]

google scholar link

??

Paper (preprint) in HTML form

1940 f -Popoviciu- Bull. Sect. Sci. Acad. Roum. - Notes sur les fonctions convexes d_ordre superieur html,body { width: 100%; height: 100%; } *, *::before,*::after { box-sizing: border-box; } body { margin: 0; color: #1E2029; font-size: 14px; line-height: normal; } hr { box-sizing: content-box; height: 0; overflow: visible; } h1, h2, h3, h4, h5, h6 { margin-top: 0; margin-bottom: 0.5em; color: rgba(0, 0, 0, 0.85); font-weight: 500; } p { margin-top: 0; margin-bottom: 1em; } ol, ul, dl { margin-top: 0; margin-bottom: 1em; } ol ol, ul ul, ol ul, ul ol { margin-bottom: 0; } dt { font-weight: 500; } dd { margin-bottom: 0.5em; margin-left: 0; } blockquote { margin: 0 0 1em; } dfn { font-style: italic; } b, strong { font-weight: bolder; } small { font-size: 80%; } sub, sup { position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } sub { bottom: -0.25em; } sup { top: -0.5em; } a { color: #0B93ff; text-decoration: none; background-color: transparent; outline: none; cursor: pointer; transition: color 0.3s; } a:hover { color: #33aaff; } a:active { color: #0070d9; } a:active, a:hover { text-decoration: none; outline: 0; } a[disabled] { color: rgba(0, 0, 0, 0.25); cursor: not-allowed; pointer-events: none; } pre, code, kbd, samp { font-size: 1em; } pre { margin-top: 0; margin-bottom: 1em; overflow: auto; } figure { margin: 0 0 1em; } img { vertical-align: middle; border-style: none; } svg:not(:root) { overflow: hidden; } table { border-collapse: collapse; } caption { padding-top: 0.75em; padding-bottom: 0.3em; color: rgba(0, 0, 0, 0.45); text-align: left; caption-side: bottom; } th { text-align: inherit; } mjx-container[jax="SVG"] { direction: ltr; } mjx-container[jax="SVG"] > svg { overflow: visible; min-height: 1px; min-width: 1px; } mjx-container[jax="SVG"] > svg a { fill: blue; stroke: blue; } mjx-assistive-mml { position: absolute !important; top: 0px; left: 0px; clip: rect(1px, 1px, 1px, 1px); padding: 1px 0px 0px 0px !important; border: 0px !important; display: block !important; width: auto !important; overflow: hidden !important; -webkit-touch-callout: none; -webkit-user-select: none; -khtml-user-select: none; -moz-user-select: none; -ms-user-select: none; user-select: none; } mjx-assistive-mml[display="block"] { width: 100% !important; } mjx-container[jax="SVG"][display="true"] { display: block; text-align: center; margin: 1em 0; } mjx-container[jax="SVG"][display="true"][width="full"] { display: flex; } mjx-container[jax="SVG"][justify="left"] { text-align: left; } mjx-container[jax="SVG"][justify="right"] { text-align: right; } g[data-mml-node="merror"] > g { fill: red; stroke: red; } g[data-mml-node="merror"] > rect[data-background] { fill: yellow; stroke: none; } g[data-mml-node="mtable"] > line[data-line], svg[data-table] > g > line[data-line] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > rect[data-frame], svg[data-table] > g > rect[data-frame] { stroke-width: 70px; fill: none; } g[data-mml-node="mtable"] > .mjx-dashed, svg[data-table] > g > .mjx-dashed { stroke-dasharray: 140; } g[data-mml-node="mtable"] > .mjx-dotted, svg[data-table] > g > .mjx-dotted { stroke-linecap: round; stroke-dasharray: 0,140; } g[data-mml-node="mtable"] > g > svg { overflow: visible; } [jax="SVG"] mjx-tool { display: inline-block; position: relative; width: 0; height: 0; } [jax="SVG"] mjx-tool > mjx-tip { position: absolute; top: 0; left: 0; } mjx-tool > mjx-tip { display: inline-block; padding: .2em; border: 1px solid #888; font-size: 70%; background-color: #F8F8F8; color: black; box-shadow: 2px 2px 5px #AAAAAA; } g[data-mml-node="maction"][data-toggle] { cursor: pointer; } mjx-status { display: block; position: fixed; left: 1em; bottom: 1em; min-width: 25%; padding: .2em .4em; border: 1px solid #888; font-size: 90%; background-color: #F8F8F8; color: black; } foreignObject[data-mjx-xml] { font-family: initial; line-height: normal; overflow: visible; } mjx-container[jax="SVG"] path[data-c], mjx-container[jax="SVG"] use[data-c] { stroke-width: 3; } #setText > div { justify-content: inherit; margin-top: 0; margin-bottom: 1em; } #setText div:last-child { margin-bottom: 0 !important; } #setText > br, #preview-content br { line-height: 1.2; } #preview-content > div { margin-top: 0; margin-bottom: 1em; } .proof > div, .theorem > div { margin-top: 1rem; } #preview-content table { margin-bottom: 1em; } #setText table { margin-bottom: 1em; } #preview-content .sub-table table, #setText .sub-table table { margin-bottom: 0; } mjx-container { text-indent: 0; overflow-y: hidden; overflow-x: auto; padding-top: 1px; padding-bottom: 1px; } .math-inline mjx-container { display: inline-block !important; page-break-inside: avoid; max-width: 100%; padding: 0; line-height: 0; } .math-inline[data-overflow="visible"] mjx-container { overflow: visible; } .math-inline mjx-container mjx-assistive-mml { max-width: 100%; } .math-block { align-items: center; page-break-after: auto; page-break-inside: avoid; margin: 0; display: block; /* mjx-container has block */ } .math-inline { display: inline-flex; /* mjx-container has inline-block. To prevent displacement during use overflow-x: auto;*/ max-width: 100%; } .math-block[data-width="full"] { overflow-x: auto; display: flex; /* mjx-container has flex */ } svg .math-inline { display: initial; max-width: initial; } svg .math-inline mjx-container { max-width: initial; } svg mjx-container { overflow: visible; padding: 0; } svg math-block[data-width="full"] { overflow: visible; } .math-block,.math-inline { --mmd-highlight-color: rgba(0, 147, 255, 0.25); --mmd-highlight-text-color: #1e2029; } .math-block[data-highlight-color] mjx-container[jax="SVG"] > svg { background-color: var(--mmd-highlight-color); } .math-block[data-highlight-text-color] mjx-container[jax="SVG"] > svg { color: var(--mmd-highlight-text-color); } .math-inline[data-highlight-color] mjx-container[jax="SVG"] { background-color: var(--mmd-highlight-color); } .math-inline[data-highlight-text-color] mjx-container[jax="SVG"] { color: var(--mmd-highlight-text-color); } .math-block p { flex-shrink: 1; } .math-block mjx-container { margin: 0 !important; } .math-error { background-color: yellow; color: red; } #preview-content img, #setText img { max-width: 100%; } #preview-content blockquote, #setText blockquote { page-break-inside: avoid; color: #666; margin: 0 0 1em 0; padding-left: 3em; border-left: .5em solid #eee; } #preview-content pre, #setText pre { border: none; padding: 0; overflow: auto; font-size: 85%; line-height: 1.45; border-radius: 6px; box-sizing: border-box; background: #f8f8fa; } #preview-content pre code, #setText pre code{ padding: 1rem; display: block; overflow-x: auto; line-height: 24px; } .empty { text-align: center; font-size: 18px; padding: 50px 0 !important; } #setText table, #preview-content table { display: table; overflow: auto; max-width: 100%; border-collapse: collapse; page-break-inside: avoid; } #setText table th, #preview-content table th { text-align: center; font-weight: bold; } #setText table td, #preview-content table td, #setText table th, #preview-content table th { border: 1px solid #dfe2e5; padding: 6px 13px; } #setText table tr, #preview-content table tr { background-color: #fff; border-top: 1px solid #c6cbd1; } #setText table tr:nth-child(2n), #preview-content table tr:nth-child(2n) { background-color: #f6f8fa; } #preview-content .main-title, #setText .main-title { text-align: center; line-height: 1.2; margin: 0 auto 1em auto; } #preview-content .author, #setText .author { text-align: center; margin: 0 auto; display: flex; justify-content: center; flex-wrap: wrap; } #preview-content .author p, #setText .author p { min-width: 30%; max-width: 50%; padding: 0 7px; } #preview-content .author > p > span, #setText .author > p > span { display: block; text-align: center; } #preview-content .section-title, #setText .section-title { margin-top: 1.5em; } #preview-content .abstract, #setText .abstract { text-align: justify; margin-bottom: 1em; } #preview-content .abstract p, #setText .abstract p { margin-bottom: 0; } @media print { #preview { font-size: 10pt!important; } svg { shape-rendering: crispEdges; } .math-block svg, math-inline svg { margin-top: 1px; } #preview-content img, #setText img { display: block; } #preview-content .figure_img img, #setText .figure_img img { display: inline; } .preview-right { word-break: break-word; } #preview-content h1, #setText h1 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h1::after, #setText h1::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h2, #setText h2 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h2::after, #setText h2::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h3, #setText h3 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h3::after, #setText h3::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h4, #setText h4 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h4::after, #setText h4::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h5, #setText h5 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h5::after, #setText h5::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } #preview-content h6, #setText h6 { page-break-inside: avoid; position: relative; border: 2px solid transparent; } #preview-content h6::after, #setText h6::after { content: ""; display: block; height: 100px; margin-bottom: -100px; position: relative; } } #preview-content sup, #setText sup { top: -.5em; position: relative; font-size: 75%; line-height: 0; vertical-align: baseline; } #preview-content .text-url, #setText .text-url { color: #0B93ff; cursor: text; pointer-events: none; } #preview-content .text-url a:hover, #setText .text-url a:hover { color: #0B93ff; } mark { background-color: #feffe6; } span[data-underline-type] mark { background: inherit; background-color: #feffe6; padding-top: 0; padding-bottom: 0; } *[data-has-dotfill] { position: relative; overflow: hidden; } *[data-has-dotfill] .dotfill::after { position: absolute; padding-left: .25ch; content: " . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . " ". . . . . . . . . . . . . . . . . . . . . . . "; text-align: right; } .smiles { text-align: center; } div.svg-container, #setText > div.svg-container { display: flex; justify-content: center; } #preview-content code, #setText code { font-family: Inconsolata; font-size: inherit; display: initial; background: #f8f8fa; } #preview-content .mmd-highlight code, #setText .mmd-highlight code, #preview-content pre.mmd-highlight code, #setText pre.mmd-highlight code { background-color: transparent; } #preview-content pre code, #setText pre code { font-family: 'DM Mono', Inconsolata, monospace; color: #333; font-size: 15px; } .hljs-comment, .hljs-quote { color: #998; font-style: italic; } .hljs-command { color: #005cc5; } .hljs-keyword, .hljs-selector-tag, .hljs-subst { color: #d73a49; font-weight: bold; } .hljs-number, .hljs-literal, .hljs-variable, .hljs-template-variable, .hljs-tag .hljs-attr { color: #005cc5; } .hljs-string, .hljs-doctag { color: #24292e; } .hljs-title, .hljs-section, .hljs-selector-id { color: #6f42c1; font-weight: bold; } .hljs-subst { font-weight: normal; } .hljs-type, .hljs-class .hljs-title { color: #458; font-weight: bold; } .hljs-tag, .hljs-name, .hljs-attribute { color: #000080; font-weight: normal; } .hljs-regexp, .hljs-link { color: #009926; } .hljs-symbol, .hljs-bullet { color: #990073; } .hljs-built_in, .hljs-builtin-name { color: #24292e; } .hljs-meta { color: #999; font-weight: bold; } .hljs-meta-keyword { color: #d73a49; } .hljs-meta-string { color: #032f62; } .hljs-deletion { background: #fdd; } .hljs-addition { background: #dfd; } .hljs-emphasis { font-style: italic; } .hljs-strong { font-weight: bold; } .table_tabular table th, .table_tabular table th { border: none !important; padding: 6px 13px; } .tabular tr, .tabular tr { border-top: none !important; border-bottom: none !important; } .tabular td, .tabular td { border-style: none !important; background-color: #fff; border-color: #000 !important; word-break: keep-all; padding: 0.1em 0.5em !important; } .tabular { display: inline-table !important; height: fit-content; } .tabular td > p { margin-bottom: 0; margin-top: 0; } .tabular td._empty { height: 1.3em; } .tabular td .f { opacity: 0; } html[data-theme="dark"] .tabular tr, html[data-theme="dark"] .tabular td { background-color: #202226; border-color: #fff !important; } .table_tabular { overflow-x: auto; padding: 0 2px 0.5em 2px; } .figure_img { margin-bottom: 0.5em; overflow-x: auto; } ol.enumerate, ul.itemize { padding-inline-start: 40px; } /* It's commented because counter not supporting to change value ol.enumerate.lower-alpha { counter-reset: item ; list-style-type: none !important; } .enumerate.lower-alpha > li { position: relative; } .enumerate.lower-alpha > li:before { content: "("counter(item, lower-alpha)")"; counter-increment: item; position: absolute; left: -47px; width: 47px; display: flex; justify-content: flex-end; padding-right: 7px; flex-wrap: nowrap; word-break: keep-all; } */ .itemize > li { position: relative; } .itemize > li > span.li_level, .li_enumerate.not_number > span.li_level { position: absolute; right: 100%; white-space: nowrap; width: max-content;; display: flex; justify-content: flex-end; padding-right: 10px; box-sizing: border-box; } .li_enumerate.not_number { position: relative; display: inline-block; list-style-type: none; } #preview { font-family: 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; font-size: 17px; visibility: visible; word-break: break-word; padding: 2.5em; max-width: 800px; margin: auto; box-sizing: content-box; } #preview h1, #preview h2, #preview h3, #preview h4, #preview h5, #preview strong { font-family: 'CMU Serif Bold', 'Georgia', Helvetica, Arial, sans-serif; } #preview i, #preview em { font-family: 'CMU Serif Italic', 'Georgia', Helvetica, Arial, sans-serif; } .mmd-menu { max-width: 320px; position: absolute; background-color: white; color: black; width: auto; padding: 5px 0px; border: 1px solid #E5E6EB; margin: 0; cursor: default; font: menu; text-align: left; text-indent: 0; text-transform: none; line-height: normal; letter-spacing: normal; word-spacing: normal; word-wrap: normal; white-space: nowrap; float: none; z-index: 201; border-radius: 5px; -webkit-border-radius: 5px; -moz-border-radius: 5px; -khtml-border-radius: 5px; box-shadow: 0px 10px 20px #808080; -webkit-box-shadow: 0px 10px 20px #808080; -moz-box-shadow: 0px 10px 20px #808080; -khtml-box-shadow: 0px 10px 20px #808080; } .mmd-menu:focus { outline: none; } .mmd-menu.mmd-menu-sm { max-width: 100vw; padding-bottom: 34px; border-radius: 0; -webkit-border-radius: 0; -moz-border-radius: 0; -khtml-border-radius: 0; } .mmd-menu-item-icon { color: #1e2029; margin-left: auto; align-items: center; display: flex; flex-shrink: 0; display: none; } .mmd-menu-item { padding-bottom: 8px; padding-top: 8px; padding-left: 1.25rem; padding-right: 1.25rem; display: flex; background: transparent; height: 52px; max-height: 52px; } .mmd-menu-item:focus { outline: none; } .mmd-menu-item.active { background-color: #e1e0e5; } .mmd-menu-item.active .mmd-menu-item-icon { display: flex; } .mmd-menu-item-container { overflow: hidden; } .mmd-menu-item-title { color: #1e2029; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 14px; line-height: 20px; } .mmd-menu-item-value { color: #7d829c; white-space: nowrap; text-overflow: ellipsis; overflow: hidden; font-size: 12px; line-height: 16px; } html[data-theme="dark"] .mmd-menu-item-title { color: #ebefe7; } html[data-theme="dark"] .mmd-menu-item.active .mmd-menu-item-title { color: #1e2029; } html[data-theme="dark"] .mmd-menu { background-color: #33363a; } .mmd-context-menu-overlay{ background: rgba(0, 0, 0, 0.56); } .ClipboardButton { padding: 0; margin: 0.5rem; display: inline-block; cursor: pointer; color: rgb(36, 41, 47); background: rgb(246, 248, 250); border-radius: 6px; border: 1px solid rgba(31, 35, 40, 0.15); box-shadow: rgba(31, 35, 40, 0.04) 0 1px 0 0, rgba(255, 255, 255, 0.25) 0 1px 0 0 inset; position: relative; } .ClipboardButton:hover { background-color: rgb(243, 244, 246); border-color: rgba(31, 35, 40, 0.15); transition-duration: .1s; } .mmd-clipboard-icon { fill: currentColor; vertical-align: text-bottom; } .mmd-clipboard-copy-icon { color: rgb(101, 109, 118); } .mmd-clipboard-check-icon { color: rgb(26, 127, 55); } .mmd-tooltipped-no-delay:hover::before, .mmd-tooltipped-no-delay:hover::after { animation-delay: 0s; } .mmd-tooltipped:hover::before, .mmd-tooltipped:hover::after { display: inline-block; text-decoration: none; animation-name: tooltip-appear; animation-duration: .1s; animation-fill-mode: forwards; animation-timing-function: ease-in; animation-delay: .4s; } .mmd-tooltipped-w::before { top: 50%; bottom: 50%; left: -7px; margin-top: -6px; border-left-color: rgb(36, 41, 47); } .mmd-tooltipped::before { position: absolute; z-index: 1000001; display: none; width: 0; height: 0; color: rgb(36, 41, 47); pointer-events: none; content: ""; border: 6px solid transparent; opacity: 0; } .mmd-tooltipped-w::after { right: 100%; bottom: 50%; margin-right: 6px; transform: translateY(50%); } .mmd-tooltipped::after { position: absolute; z-index: 1000000; display: none; padding: 0.5em 0.75em; font: normal normal 11px/1.5 'CMU Serif', 'Georgia', Helvetica, Arial, sans-serif; -webkit-font-smoothing: subpixel-antialiased; color: rgb(255, 255, 255); text-align: center; text-decoration: none; text-shadow: none; text-transform: none; letter-spacing: normal; word-wrap: break-word; white-space: pre; pointer-events: none; content: attr(aria-label); background: rgb(36, 41, 47); border-radius: 6px; opacity: 0; }
Original text
Rate this translation
Your feedback will be used to help improve Google Translate
ACADEMIE ROUMAINE BULLETIN DE LA SECTION SCIENTIFIQUE TOMEXXIT-ème  ACADEMIE ROUMAINE   BULLETIN DE LA SECTION SCIENTIFIQUE   TOMEXXIT-ème  {:[" ACADEMIE ROUMAINE "],[" BULLETIN DE LA SECTION SCIENTIFIQUE "],[" TOMEXXIT-ème "]:}\begin{aligned} & \text { ACADEMIE ROUMAINE } \\ & \text { BULLETIN DE LA SECTION SCIENTIFIQUE } \\ & \text { TOMEXXIT-ème } \end{aligned} ROMANIAN ACADEMY  BULLETIN OF THE SCIENTIFIC SECTION  TOMEXXIT-th 

NOTES ON HIGHER ORDER CONVEX FUNCTIONS (V)
BY

TIBERIU POPOVICIU

Note presented by Mr. S. Stoilow, Mc. AR, in the session of February 23, 1940 INEQUALITIES VERIFIED BY AN ORDER FUNCTION n n nnnE'T BY ITS DERIVATIVES
  1. In the two previous notes (III and IV 1 1 ^(1){ }^{1}1) we studied the inequalities of the form
(I) ∑ i = 1 m p i f ( x i ) ≧ 0 , (I) ∑ i = 1 m   p i f x i ≧ 0 , {:(I)sum_(i=1)^(m)p_(i)f(x_(i)) >= 0",":}\begin{equation*} \sum_{i=1}^{m} p_{i} f\left(x_{i}\right) \geqq 0, \tag{I} \end{equation*}(I)∑i=1mpif(xi)≧0,
verified by any non-concave function of order n n nnn, points
(2)
x 1 < x 2 < … < x m , x 1 < x 2 < … < x m , x_(1) < x_(2) < dots < x_(m),x_{1}<x_{2}<\ldots<x_{m},x1<x2<…<xm,
given and the coefficients p i p i p_(i)p_{i}pibeing independent of the function f f fff.
The necessary and sufficient conditions that the coefficients must satisfy p i p i p_(i)p_{i}pi, for this to be so, are easily obtained, for example, using the formula that we can call the fundamental formula for transforming divided differences. This formula is written 2 2 ^(2){ }^{2}2)
∑ i = 1 m p i f ( x i ) = ∑ i = 1 n + 1 A i [ x 1 , x 2 , … , x i ; f ] + ∑ i = 1 n − n − 1 C i [ x i , x i + 1 , … , x i + n + 1 ; f ] , ∑ i = 1 m &hairsp; p i f x i = ∑ i = 1 n + 1 &hairsp; A i x 1 , x 2 , … , x i ; f + ∑ i = 1 n − n − 1 &hairsp; C i x i , x i + 1 , … , x i + n + 1 ; f , sum_(i=1)^(m)p_(i)f(x_(i))=sum_(i=1)^(n+1)A_(i)[x_(1),x_(2),dots,x_(i);f]+sum_(i=1)^(n-n-1)C_(i)[x_(i),x_(i+1),dots,x_(i+n+1);f],\sum_{i=1}^{m} p_{i} f\left(x_{i}\right)=\sum_{i=1}^{n+1} A_{i}\left[x_{1}, x_{2}, \ldots, x_{i} ; f\right]+\sum_{i=1}^{n-n-1} C_{i}\left[x_{i}, x_{i+1}, \ldots, x_{i+n+1} ; f\right],∑i=1mpif(xi)=∑i=1n+1HASi[x1,x2,…,xi;f]+∑i=1n−n−1Ci[xi,xi+1,…,xi+n+1;f],
Or A i , C i A i , C i A_(i),C_(i)A_{i}, C_{i}HASi,Ciare independent of the function f f fff.
We then obtain sufficient conditions for the inequality (r) err writing
(3) A 1 = A 2 = … = A n + I = 0 , C i ≥ 0 , i = I , 2 , … , m − n − I . (3) A 1 = A 2 = … = A n + I = 0 , C i ≥ 0 , i = I , 2 , … , m − n − I . {:(3)A_(1)=A_(2)=dots=A_(n+I)=0","quadC_(i) >= 0","quad i=I","2","dots","m-n-I.:}\begin{equation*} \mathrm{A}_{1}=\mathrm{A}_{2}=\ldots=\mathrm{A}_{n+\mathrm{I}}=0, \quad \mathrm{C}_{i} \geq 0, \quad i=\mathrm{I}, 2, \ldots, m-n-\mathbf{I} . \tag{3} \end{equation*}(3)HAS1=HAS2=…=HASn+I=0,Ci≥0,i=I,2,…,m−n−I.
These conditions are also necessary if the function is defined only on points (2):
We can, moreover, easily obtain the coefficients A i , C i A i , C i A_(i),C_(i)A_{i}, C_{i}HASi,Ciby suitably particularizing the function f f fff. By first taking
f = ( x − x 1 ) ( x − x 2 ) … ( x − x j − 1 ) , j = 1 , 2 , … , n + 1 , ( pour j = 1 , f = 1 ) f = x − x 1 x − x 2 … x − x j − 1 , j = 1 , 2 , … , n + 1 , (  pour  j = 1 , f = 1 ) f=(x-x_(1))(x-x_(2))dots(x-x_(j-1)),j=1,2,dots,n+1,(" pour "j=1,f=1)f=\left(x-x_{1}\right)\left(x-x_{2}\right) \ldots\left(x-x_{j-1}\right), j=1,2, \ldots, n+1,(\text { pour } j=1, f=1)f=(x−x1)(x−x2)…(x−xI−1),I=1,2,…,n+1,( For I=1,f=1)
we get
A j = ∑ i = 1 m p i ( x i − x j ) … ( x i − x j − 1 ) = ∑ i = j m p i ( x i − x 1 ) … ( x i ⋯ x j − 1 ) A j = ∑ i = 1 m &hairsp; p i x i − x j … x i − x j − 1 = ∑ i = j m &hairsp; p i x i − x 1 … x i ⋯ x j − 1 A_(j)=sum_(i=1)^(m)p_(i)(x_(i)-x_(j))dots(x_(i)-x_(j-1))=sum_(i=j)^(m)p_(i)(x_(i)-x_(1))dots(x_(i)cdotsx_(j-1))A_{j}=\sum_{i=1}^{m} p_{i}\left(x_{i}-x_{j}\right) \ldots\left(x_{i}-x_{j-1}\right)=\sum_{i=j}^{m} p_{i}\left(x_{i}-x_{1}\right) \ldots\left(x_{i} \cdots x_{j-1}\right)HASI=∑i=1mpi(xi−xI)…(xi−xI−1)=∑i=Impi(xi−x1)…(xi⋯xI−1)
j = I , 2 , … , n + I . j = I , 2 , … , n + I . j=I,2,dots,n+I.j=I, 2, \ldots, n+I .I=I,2,…,n+I.
If we then take
f = { 0 , pour x = x 1 , x 2 , … , x j + n ( x − x j + 1 ) ( x − x j + 2 ) … ( x − x j + n ) , pour x = x j + n + 1 , x j + n + 2 , … , x m j = 1 ; 2 , … , m − n − I f = 0 ,  pour  x = x 1 , x 2 , … , x j + n x − x j + 1 x − x j + 2 … x − x j + n ,  pour  x = x j + n + 1 , x j + n + 2 , … , x m j = 1 ; 2 , … , m − n − I f={[0","quad" pour "x=x_(1)","x_(2)","dots","x_(j+n)],[(x-x_(j+1))(x-x_(j+2))dots(x-x_(j+n))","" pour "x=x_(j+n+1)","x_(j+n+2)","dots","x_(m)],[quad j=1;2","dots","m-n-I]:}f=\left\{\begin{array}{l} 0, \quad \text { pour } x=x_{1}, x_{2}, \ldots, x_{j+n} \\ \left(x-x_{j+1}\right)\left(x-x_{j+2}\right) \ldots\left(x-x_{j+n}\right), \text { pour } x=x_{j+n+1}, x_{j+n+2}, \ldots, x_{m} \\ \quad j=1 ; 2, \ldots, m-n-\mathbf{I} \end{array}\right.f={0, For x=x1,x2,…,xI+n(x−xI+1)(x−xI+2)…(x−xI+n), For x=xI+n+1,xI+n+2,…,xmI=1;2,…,m−n−I
we get
When the function f f fffis defined in an interval containing the points (2) the conditions (3) are no longer necessary for n > 1 n > 1 n > 1n>1n>1. For inequality (I) to hold, whatever the function f f fffdefined in an interval containing within it the points (2), it is necessary and sufficient that this inequality is true for any polynomial of degree n n nnnand for any function of the form ( | x − λ | + x − λ ) n , λ ( | x − λ | + x − λ ) n , λ (|x-lambda|+x-lambda)^(n),lambda(|x-\lambda|+x-\lambda)^{n}, \lambda(|x−λ|+x−λ)n,λbeing a constant. Indeed, any non-concave function of order n n nnnis the limit of a sequence of functions which are, at an additive polynomial of degree n n nnnnear, sums of such functions ( | x − λ | + x − λ ) n ( | x − λ | + x − λ ) n (|x-lambda|+x-lambda)^(n)(|x-\lambda|+x-\lambda)^{n}(|x−λ|+x−λ)nwith positive coefficients 3 3 ^(3){ }^{3}3).
We thus find the necessary and sufficient equalities.
∑ i = 1 m p i = ∑ i = 1 m p i x i = … = ∑ i = 1 m p i x i n = 0 , ∑ i = 1 m &hairsp; p i = ∑ i = 1 m &hairsp; p i x i = … = ∑ i = 1 m &hairsp; p i x i n = 0 , sum_(i=1)^(m)p_(i)=sum_(i=1)^(m)p_(i)x_(i)=dots=sum_(i=1)^(m)p_(i)x_(i)^(n)=0,\sum_{i=1}^{m} p_{i}=\sum_{i=1}^{m} p_{i} x_{i}=\ldots=\sum_{i=1}^{m} p_{i} x_{i}^{n}=0,∑i=1mpi=∑i=1mpixi=…=∑i=1mpixin=0,
which are none other than A 1 = A 2 = … = A n + 1 = 0 A 1 = A 2 = … = A n + 1 = 0 A_(1)=A_(2)=dots=A_(n+1)=0A_{1}=A_{2}=\ldots=A_{n+1}=0HAS1=HAS2=…=HASn+1=0, expressing that the first member of (I) is identically zero for any polynomial of degree η η eta\etaη.
We then find the necessary and sufficient inequalities
∑ i = r + 1 m p i ( x i ∑ i = r + 1 m &hairsp; p i x i sum_(i=r+1)^(m)p_(i)(x_(i):}\sum_{i=r+1}^{m} p_{i}\left(x_{i}\right.∑i=r+1mpi(xi
3 3 ^(3){ }^{3}3) Tiberiu Popoviciu, On the extension of convex functions of higher order, Bull. Math. Soc. Roumaine des Sci., 36, 75-108 (1934).
2. We can generalize the inequality ( x ) by also introducing the values &ZeroWidthSpace;&ZeroWidthSpace;of the derivatives of f f fffto the points x i x i x_(i)x_{i}xi. For simplicity, let us assume f f fffdefined in an interval containing the points (2). If n > 1 n > 1 n > 1n>1n>1the function f f fff, non-concave of order n n nnn, has continuous derivatives t ′ , t ′ ′ , … , t ( n − 1 ) t ′ , t ′ ′ , … , t ( n − 1 ) t^('),t^(''),dots,t^((n-1))t^{\prime}, t^{\prime \prime}, \ldots, t^{(n-1)}t′,t′′,…,t(n−1)and derivatives to the left of the d and to the right of order n , f g ( n ) , f d ( n ) ⋅ [ f g ( n ) = ( f ( n − 1 ) ) g ′ , f d ( n ) = ( f ( n − 1 ) ) d ′ ] n , f g ( n ) , f d ( n ) ⋅ f g ( n ) = f ( n − 1 ) g ′ , f d ( n ) = f ( n − 1 ) d ′ n,f_(g)^((n)),f_(d)^((n))*[f_(g)^((n))=(f^((n-1)))_(g)^('),f_(d)^((n))=(f^((n-1)))_(d)^(')]n, f_{g}^{(n)}, f_{d}^{(n)} \cdot\left[f_{g}^{(n)}=\left(f^{(n-1)}\right)_{g}^{\prime}, f_{d}^{(n)}=\left(f^{(n-1)}\right)_{d}^{\prime}\right]n,fg(n),fd(n)⋅[fg(n)=(f(n−1))g′,fd(n)=(f(n−1))d′]in every interior point.
We can then look for the necessary and sufficient conditions so that we have
(4) ∑ i = 1 m ∑ j = 0 k i p i j f ( j ) ( x i ) ≥ 0 (4) ∑ i = 1 m &hairsp; ∑ j = 0 k i &hairsp; p i j f ( j ) x i ≥ 0 {:(4)sum_(i=1)^(m)sum_(j=0)^(k_(i))p_(ij)f^((j))(x_(i)) >= 0:}\begin{equation*} \sum_{i=1}^{m} \sum_{j=0}^{k_{i}} p_{i j} f^{(j)}\left(x_{i}\right) \geq 0 \tag{4} \end{equation*}(4)∑i=1m∑I=0kipiIf(I)(xi)≥0
Or 0 ≦ k i ≦ n 0 ≦ k i ≦ n 0 <= k_(i) <= n0 \leqq k_{i} \leqq n0≦ki≦nAnd f ( n ) f ( n ) f^((n))f^{(n)}f(n)denotes one of the derivatives f g ( n ) , f d ( n ) f g ( n ) , f d ( n ) f_(g)^((n)),f_(d)^((n))f_{g}^{(n)}, f_{d}^{(n)}fg(n),fd(n)(not necessarily the same for all x i x i x_(i)x_{i}xi), whatever the function f f fff, non-concave of order n n nnnin an interval containing within it the points x ¯ i x ¯ i bar(x)_(i)\bar{x}_{i}x¯i. We can easily see that the necessary and sufficient conditions are still that the inequality holds for any polynomial of degree n n nnnand for any function of the form ( | x − λ | + x − λ ) n ( | x − λ | + x − λ ) n (|x-lambda|+x-lambda)^(n)(|x-\lambda|+x-\lambda)^{n}(|x−λ|+x−λ)n. These conditions can therefore be written
∑ i = 1 m ∑ j = 0 k i p i j r ( r − 1 ) … ( r − j + 1 ) x i γ − j = 0 , r = 0 , 1 , … , n ∑ i = 1 m ∑ j = 0 k i p i j n ( n − 1 ) … ( n − j + 1 ) ( x i − x ) n − j ≥ 0 , x ∈ ( x i , x r + 1 ) , ∑ i = 1 m &hairsp; ∑ j = 0 k i &hairsp; p i j r ( r − 1 ) … ( r − j + 1 ) x i γ − j = 0 , r = 0 , 1 , … , n ∑ i = 1 m &hairsp; ∑ j = 0 k i &hairsp; p i j n ( n − 1 ) … ( n − j + 1 ) x i − x n − j ≥ 0 , x ∈ x i , x r + 1 , {:[sum_(i=1)^(m)sum_(j=0)^(k_(i))p_(ij)r(r-1)dots(r-j+1)x_(i)^(gamma-j)=0","quad r=0","1","dots","n],[sum_(i=1)^(m)sum_(j=0)^(k_(i))p_(ij)n(n-1)dots(n-j+1)(x_(i)-x)^(n-j) >= 0","quad x in(x_(i),x_(r+1))","]:}\begin{aligned} & \sum_{i=1}^{m} \sum_{j=0}^{k_{i}} p_{i j} r(r-1) \ldots(r-j+1) x_{i}^{\gamma-j}=0, \quad r=0,1, \ldots, n \\ & \sum_{i=1}^{m} \sum_{j=0}^{k_{i}} p_{i j} n(n-1) \ldots(n-j+1)\left(x_{i}-x\right)^{n-j} \geq 0, \quad x \in\left(x_{i}, x_{r+1}\right), \end{aligned}∑i=1m∑I=0kipiIr(r−1)…(r−I+1)xiγ−I=0,r=0,1,…,n∑i=1m∑I=0kipiIn(n−1)…(n−I+1)(xi−x)n−I≥0,x∈(xi,xr+1),
r = I ; 2 , … , m − I . r = I ; 2 , … , m − I . r=I;2,dots,m-I.r=\mathrm{I} ; 2, \ldots, m-\mathbf{I} .r=I;2,…,m−I.
If, moreover,
∑ j = 0 k i | p i j | ≠ 0 , i = 1 , 2 , … , m , ∑ j = 0 k i &hairsp; p i j ≠ 0 , i = 1 , 2 , … , m , sum_(j=0)^(k_(i))|p_(ij)|!=0,quad i=1,2,dots,m,\sum_{j=0}^{k_{i}}\left|p_{i j}\right| \neq 0, \quad i=1,2, \ldots, m,∑I=0ki|piI|≠0,i=1,2,…,m,
we can say that for a convex function of order n n nnnthe sign > > >>>takes place in (4).
In the case ∑ i = 1 m ( k i + 1 ) = n + 2 ∑ i = 1 m &hairsp; k i + 1 = n + 2 sum_(i=1)^(m)(k_(i)+1)=n+2\sum_{i=1}^{m}\left(k_{i}+1\right)=n+2∑i=1m(ki+1)=n+2, the inequality can be written
(5) [ x 1 , x 1 , … , x 1 ⏟ k 1 + I , x 2 , x 2 , … , x 2 ⏟ k 2 + I , … , x m , x m , … , x m ⏟ k m + I ; f ] ≥ 0 . (5) [ x 1 , x 1 , … , x 1 ⏟ k 1 + I , x 2 , x 2 , … , x 2 ⏟ k 2 + I , … , x m , x m , … , x m ⏟ k m + I ; f ] ≥ 0 . {:(5)[ubrace(x_(1),x_(1),dots,x_(1)ubrace)_(k_(1)+I)","ubrace(x_(2),x_(2),dots,x_(2)ubrace)_(k_(2)+I)","dots","ubrace(x_(m),x_(m),dots,x_(m)ubrace)_(k_(m)+I);f] >= 0.:}\begin{equation*} [\underbrace{x_{1}, x_{1}, \ldots, x_{1}}_{k_{1}+\mathrm{I}}, \underbrace{x_{2}, x_{2}, \ldots, x_{2}}_{k_{2}+\mathrm{I}}, \ldots, \underbrace{x_{m}, x_{m}, \ldots, x_{m}}_{k_{m}+\mathrm{I}} ; f] \geq 0 . \tag{5} \end{equation*}(5)[x1,x1,…,x1⏟k1+I,x2,x2,…,x2⏟k2+I,…,xm,xm,…,xm⏟km+I;f]≥0.
The first member is the limit of a divided difference of order n + I n + I n+In+In+I, when k i + I k i + I k_(i)+Ik_{i}+Iki+Iof his n + 2 n + 2 n+2n+2n+2points tend towards x i , i = I , 2 , … , m x i , i = I , 2 , … , m x_(i),i=I,2,dots,mx_{i}, i=I, 2, \ldots, mxi,i=I,2,…,m. It is easy to obtain the explicit form of this generalized divided difference.
3. We can also establish, sometimes, the exactness of inequality (4) by expressing the first member in the form of a sum of
divided differences of order n + 1 n + 1 n+1n+1n+1(of the generalized form (5)) chosen appropriately. We will establish in this way an interesting particular inequality. Let x 1 < x 2 < … < x n n x 1 < x 2 < … < x n n x_(1) < x_(2) < dots < x_(n)nx_{1}<x_{2}<\ldots<x_{n} nx1<x2<…<xnndistinct points of the real axis and let
φ ( x ) = ( x − x 1 ) ( x − x 2 ) … ( x − x n ) . φ ( x ) = x − x 1 x − x 2 … x − x n . varphi(x)=(x-x_(1))(x-x_(2))dots(x-x_(n)).\varphi(x)=\left(x-x_{1}\right)\left(x-x_{2}\right) \ldots\left(x-x_{n}\right) .φ(x)=(x−x1)(x−x2)…(x−xn).
Let ξ 1 < ξ 2 < … < ξ n − I ξ 1 < ξ 2 < … < ξ n − I xi_(1) < xi_(2) < dots < xi_(n-I)\xi_{1}<\xi_{2}<\ldots<\xi_{n-\mathrm{I}}ξ1<ξ2<…<ξn−Ithe zeros, all real, of the derivative φ ′ ( x ) φ ′ ( x ) varphi^(')(x)\varphi^{\prime}(x)φ′(x)of the polynomial φ ( x ) φ ( x ) varphi(x)\varphi(x)φ(x). We have
x 1 < ξ 1 < x 2 < ξ 2 < … < ξ n − 1 < x n . x 1 < ξ 1 < x 2 < ξ 2 < … < ξ n − 1 < x n . x_(1) < xi_(1) < x_(2) < xi_(2) < dots < xi_(n-1) < x_(n).x_{1}<\xi_{1}<x_{2}<\xi_{2}<\ldots<\xi_{n-1}<x_{n} .x1<ξ1<x2<ξ2<…<ξn−1<xn.
We have the following formulas
[ x 1 , x 2 , … , x n ; f ] = ∑ i = 1 n f ( x i ) φ ′ ( x i ) , [ ξ 1 , ξ 2 , … , ξ n − 1 ; ′ ′ ] = n ∑ i = 1 n − 1 f ′ ( ξ i ) φ ′ ′ ( ξ i ) x 1 , x 2 , … , x n ; f = ∑ i = 1 n &hairsp; f x i φ ′ x i , ξ 1 , ξ 2 , … , ξ n − 1 ; ′ ′ = n ∑ i = 1 n − 1 &hairsp; f ′ ξ i φ ′ ′ ξ i [x_(1),x_(2),dots,x_(n);f]=sum_(i=1)^(n)(f(x_(i)))/(varphi^(')(x_(i))),[xi_(1),xi_(2),dots,xi_(n-1);'^(')]=nsum_(i=1)^(n-1)(f^(')(xi_(i)))/(varphi^('')(xi_(i)))\left[x_{1}, x_{2}, \ldots, x_{n} ; f\right]=\sum_{i=1}^{n} \frac{f\left(x_{i}\right)}{\varphi^{\prime}\left(x_{i}\right)},\left[\xi_{1}, \xi_{2}, \ldots, \xi_{n-1} ; \prime^{\prime}\right]=n \sum_{i=1}^{n-1} \frac{f^{\prime}\left(\xi_{i}\right)}{\varphi^{\prime \prime}\left(\xi_{i}\right)}[x1,x2,…,xn;f]=∑i=1nf(xi)φ′(xi),[ξ1,ξ2,…,ξn−1;′′]=n∑i=1n−1f′(ξi)φ′′(ξi), [ x 1 , x 2 , … , x n , ξ j , ξ j ; f ] = ∑ i = 1 n f ( x i ) ( x i − ξ j ) 2 φ ′ ( x i ) + f ′ ( ξ j ) φ ( ξ j ) x 1 , x 2 , … , x n , ξ j , ξ j ; f = ∑ i = 1 n &hairsp; f x i x i − ξ j 2 φ ′ x i + f ′ ξ j φ ξ j [x_(1),x_(2),dots,x_(n),xi_(j),xi_(j);f]=sum_(i=1)^(n)(f(x_(i)))/((x_(i)-xi_(j))^(2)varphi^(')(x_(i)))+(f^(')(xi_(j)))/(varphi(xi_(j)))\left[x_{1}, x_{2}, \ldots, x_{n}, \xi_{j}, \xi_{j} ; f\right]=\sum_{i=1}^{n} \frac{f\left(x_{i}\right)}{\left(x_{i}-\xi_{j}\right)^{2} \varphi^{\prime}\left(x_{i}\right)}+\frac{f^{\prime}\left(\xi_{j}\right)}{\varphi\left(\xi_{j}\right)}[x1,x2,…,xn,ξI,ξI;f]=∑i=1nf(xi)(xi−ξI)2φ′(xi)+f′(ξI)φ(ξI),
j = 1 , 2 , … , n − 1 j = 1 , 2 , … , n − 1 j=1,2,dots,n-1j=1,2, \ldots, n-1I=1,2,…,n−1
We deduce from this
(6) − ∑ j = 1 n φ ( ξ j ) φ ′ ′ ( ξ j ) [ x 1 , x 2 , … , x n , ξ j , ξ j ; f ] = − ∑ j = 1 n &hairsp; φ ξ j φ ′ ′ ξ j x 1 , x 2 , … , x n , ξ j , ξ j ; f = -sum_(j=1)^(n)(varphi(xi_(j)))/(varphi^('')(xi_(j)))[x_(1),x_(2),dots,x_(n),xi_(j),xi_(j);f]=-\sum_{j=1}^{n} \frac{\varphi\left(\xi_{j}\right)}{\varphi^{\prime \prime}\left(\xi_{j}\right)}\left[x_{1}, x_{2}, \ldots, x_{n}, \xi_{j}, \xi_{j} ; f\right]=−∑I=1nφ(ξI)φ′′(ξI)[x1,x2,…,xn,ξI,ξI;f]=
= ∑ i = 1 n f ( x i ) φ ′ ( x i ) ( − ∑ j = 1 n − 1 φ ( ξ j ) ( x i − ξ j ) 2 φ ′ ′ ( ξ j ) ) − ∑ j = 1 n − 1 f ′ ( ξ j ) φ ′ ′ ( ξ j ) . = ∑ i = 1 n &hairsp; f x i φ ′ x i − ∑ j = 1 n − 1 &hairsp; φ ξ j x i − ξ j 2 φ ′ ′ ξ j − ∑ j = 1 n − 1 &hairsp; f ′ ξ j φ ′ ′ ξ j . =sum_(i=1)^(n)(f(x_(i)))/(varphi^(')(x_(i)))(-sum_(j=1)^(n-1)(varphi(xi_(j)))/((x_(i)-xi_(j))^(2)varphi^('')(xi_(j))))-sum_(j=1)^(n-1)(f^(')(xi_(j)))/(varphi^('')(xi_(j))).=\sum_{i=1}^{n} \frac{f\left(x_{i}\right)}{\varphi^{\prime}\left(x_{i}\right)}\left(-\sum_{j=1}^{n-1} \frac{\varphi\left(\xi_{j}\right)}{\left(x_{i}-\xi_{j}\right)^{2} \varphi^{\prime \prime}\left(\xi_{j}\right)}\right)-\sum_{j=1}^{n-1} \frac{f^{\prime}\left(\xi_{j}\right)}{\varphi^{\prime \prime}\left(\xi_{j}\right)} .=∑i=1nf(xi)φ′(xi)(−∑I=1n−1φ(ξI)(xi−ξI)2φ′′(ξI))−∑I=1n−1f′(ξI)φ′′(ξI).
The polynomial
ψ ( x ) = φ ( x ) − 1 n ( x − x 2 + x 2 + … + x n n ) φ ′ ( x ) ψ ( x ) = φ ( x ) − 1 n x − x 2 + x 2 + … + x n n φ ′ ( x ) psi(x)=varphi(x)-(1)/(n)(x-(x_(2)+x_(2)+dots+x_(n))/(n))varphi^(')(x)\psi(x)=\varphi(x)-\frac{1}{n}\left(x-\frac{x_{2}+x_{2}+\ldots+x_{n}}{n}\right) \varphi^{\prime}(x)ψ(x)=φ(x)−1n(x−x2+x2+…+xnn)φ′(x)
being of degree n − 2 n − 2 n-2n-2n−2We have
ψ ( x ) φ ′ ( x ) = ∑ j = 1 n − 1 ψ ( ξ j ) ( x − ξ j ) φ ′ ′ ( ξ j ) = ∑ j = 1 n − 1 φ ( ξ j ) ( x − ξ j ) φ ′ ′ ( ξ j ) ψ ( x ) φ ′ ( x ) = ∑ j = 1 n − 1 &hairsp; ψ ξ j x − ξ j φ ′ ′ ξ j = ∑ j = 1 n − 1 &hairsp; φ ξ j x − ξ j φ ′ ′ ξ j (psi(x))/(varphi^(')(x))=sum_(j=1)^(n-1)(psi(xi_(j)))/((x-xi_(j))varphi^('')(xi_(j)))=sum_(j=1)^(n-1)(varphi(xi_(j)))/((x-xi_(j))varphi^('')(xi_(j)))\frac{\psi(x)}{\varphi^{\prime}(x)}=\sum_{j=1}^{n-1} \frac{\psi\left(\xi_{j}\right)}{\left(x-\xi_{j}\right) \varphi^{\prime \prime}\left(\xi_{j}\right)}=\sum_{j=1}^{n-1} \frac{\varphi\left(\xi_{j}\right)}{\left(x-\xi_{j}\right) \varphi^{\prime \prime}\left(\xi_{j}\right)}ψ(x)φ′(x)=∑I=1n−1ψ(ξI)(x−ξI)φ′′(ξI)=∑I=1n−1φ(ξI)(x−ξI)φ′′(ξI)
And
− ∑ i = 1 n − 1 p ( ξ i ) ( x i − ξ i ) 2 φ ′ ′ ( ξ i ) = [ ψ ( x ) φ ′ ( x ) ] x = x i ′ = = [ φ ( x ) φ ′ ( x ) − 1 n ( x − x 1 + x 2 + … + x n n ) ] x = x i ′ = n − 1 n . − ∑ i = 1 n − 1 &hairsp; p ξ i x i − ξ i 2 φ ′ ′ ξ i = ψ ( x ) φ ′ ( x ) x = x i ′ = = φ ( x ) φ ′ ( x ) − 1 n x − x 1 + x 2 + … + x n n x = x i ′ = n − 1 n . {:[-sum_(i=1)^(n-1)(p(xi_(i)))/((x_(i)-xi_(i))^(2)varphi^('')(xi_(i)))=[(psi(x))/(varphi^(')(x))]_(x=x_(i))^(')=],[quad=[(varphi(x))/(varphi^(')(x))-(1)/(n)(x-(x_(1)+x_(2)+dots+x_(n))/(n))]_(x=x_(i))^(')=(n-1)/(n).]:}\begin{aligned} -\sum_{i=1}^{n-1} \frac{p\left(\xi_{i}\right)}{\left(x_{i}-\xi_{i}\right)^{2} \varphi^{\prime \prime}\left(\xi_{i}\right)} & =\left[\frac{\psi(x)}{\varphi^{\prime}(x)}\right]_{x=x_{i}}^{\prime}= \\ \quad= & {\left[\frac{\varphi(x)}{\varphi^{\prime}(x)}-\frac{1}{n}\left(x-\frac{x_{1}+x_{2}+\ldots+x_{n}}{n}\right)\right]_{x=x_{i}}^{\prime}=\frac{n-1}{n} . } \end{aligned}−∑i=1n−1p(ξi)(xi−ξi)2φ′′(ξi)=[ψ(x)φ′(x)]x=xi′==[φ(x)φ′(x)−1n(x−x1+x2+…+xnn)]x=xi′=n−1n.
Formula (6) can therefore be written
n − I n [ x 1 , x 2 , … , x n ; f ] − I n [ ξ 1 , ξ 2 , … , ξ n − 1 ; f ′ ] = n − I n x 1 , x 2 , … , x n ; f − I n ξ 1 , ξ 2 , … , ξ n − 1 ; f ′ = (n-I)/(n)[x_(1),x_(2),dots,x_(n);f]-(I)/(n)[xi_(1),xi_(2),dots,xi_(n-1);f^(')]=\frac{n-\mathrm{I}}{n}\left[x_{1}, x_{2}, \ldots, x_{n} ; f\right]-\frac{\mathrm{I}}{n}\left[\xi_{1}, \xi_{2}, \ldots, \xi_{n-1} ; f^{\prime}\right]=n−In[x1,x2,…,xn;f]−In[ξ1,ξ2,…,ξn−1;f′]=
= − ∑ j = 1 n − 1 φ ( ξ j ) φ ′ ′ ( ξ j ) [ x 1 , x 2 , … , x n , ξ j , ξ j ; f ] = − ∑ j = 1 n − 1 &hairsp; φ ξ j φ ′ ′ ξ j x 1 , x 2 , … , x n , ξ j , ξ j ; f =-sum_(j=1)^(n-1)(varphi(xi_(j)))/(varphi^('')(xi_(j)))[x_(1),x_(2),dots,x_(n),xi_(j),xi_(j);f]=-\sum_{j=1}^{n-1} \frac{\varphi\left(\xi_{j}\right)}{\varphi^{\prime \prime}\left(\xi_{j}\right)}\left[x_{1}, x_{2}, \ldots, x_{n}, \xi_{j}, \xi_{j} ; f\right]=−∑I=1n−1φ(ξI)φ′′(ξI)[x1,x2,…,xn,ξI,ξI;f]
We have
− φ ( ξ i ) φ ′ ′ ( ξ j ) > 0 , j = I , 2 , … , n − I − φ ξ i φ ′ ′ ξ j > 0 , j = I , 2 , … , n − I -(varphi(xi_(i)))/(varphi^('')(xi_(j))) > 0,quad j=I,2,dots,n-I-\frac{\varphi\left(\xi_{i}\right)}{\varphi^{\prime \prime}\left(\xi_{j}\right)}>0, \quad j=I, 2, \ldots, n-I−φ(ξi)φ′′(ξI)>0,I=I,2,…,n−I
and we can state the following theorem
If x 1 , x 2 , … , x n x 1 , x 2 , … , x n x_(1),x_(2),dots,x_(n)x_{1}, x_{2}, \ldots, x_{n}x1,x2,…,xnare n n nnnreal axis points and ξ 1 , ξ 2 , … , ξ n − 1 ξ 1 , ξ 2 , … , ξ n − 1 xi_(1),xi_(2),dots,xi_(n-1)\xi_{1}, \xi_{2}, \ldots, \xi_{n-1}ξ1,ξ2,…,ξn−1are the zeros of the derivative of the polynomial φ ( x ) = ( x − x 1 ) ( x − x 2 ) … ( x − x n ) φ ( x ) = x − x 1 x − x 2 … x − x n varphi(x)=(x-x_(1))(x-x_(2))dots(x-x_(n))\varphi(x)=\left(x-x_{1}\right)\left(x-x_{2}\right) \ldots\left(x-x_{n}\right)φ(x)=(x−x1)(x−x2)…(x−xn), any function f f fff, non-concave of order n n nnnin an interval containing within it the points x x xxx, verifies inequality
(7) ( n − 1 ) [ x 1 , x 2 , … , x n ; f ] ≥ [ ξ 1 , ξ 2 , … , ξ n − 1 ; t ′ ] ( n − 1 ) x 1 , x 2 , … , x n ; f ≥ ξ 1 , ξ 2 , … , ξ n − 1 ; t ′ quad(n-1)[x_(1),x_(2),dots,x_(n);f] >= [xi_(1),xi_(2),dots,xi_(n-1);t^(')]\quad(n-1)\left[x_{1}, x_{2}, \ldots, x_{n} ; f\right] \geq\left[\xi_{1}, \xi_{2}, \ldots, \xi_{n-1} ; t^{\prime}\right](n−1)[x1,x2,…,xn;f]≥[ξ1,ξ2,…,ξn−1;t′].
We have demonstrated the property in the case where the points x i x i x_(i)x_{i}xiare distinct. It also remains true, as a result of continuity, when these points are not distinct [the divided differences then being of the generalized form (5)].
Remarks I. We can easily see that if in addition the function f f fffis convex of order n n nnn, the equality in (7) can only hold if x 1 = x 2 = … = x n x 1 = x 2 = … = x n x_(1)=x_(2)=dots=x_(n)x_{1}=x_{2}=\ldots=x_{n}x1=x2=…=xn.
II. The restriction that the x i x i x_(i)x_{i}xiare within the definition interval of f f fffis not essential. The result remains the same if one or both ends of this interval coincide with a simple zero of φ ( x ) φ ( x ) varphi(x)\varphi(x)φ(x). The result is true even without restriction if the function is differentiable a sufficient number of times at the ends of the interval.
4. From the previous theorem we can draw some simple conclusions. Let us denote by ξ I ( i ) , ξ 2 ( j ) , … , ξ n − i ( i ) ξ I ( i ) , ξ 2 ( j ) , … , ξ n − i ( i ) xi_(I)^((i)),xi_(2)^((j)),dots,xi_(n-i)^((i))\xi_{\mathrm{I}}^{(i)}, \xi_{2}^{(j)}, \ldots, \xi_{n-i}^{(i)}ξI(i),ξ2(I),…,ξn−i(i)the zeros of the order derivative i i iiiof φ ( x ) φ ( x ) varphi(x)\varphi(x)φ(x). We then have, under the same conditions,
( n − 1 ) ! [ x 1 , x 2 , … , x n ; f ] ≧ ( n − 2 ) ! [ ξ 1 , ξ 2 , … , ξ n − 1 ; f ′ ] ≧ … ( n − 1 ) ! x 1 , x 2 , … , x n ; f ≧ ( n − 2 ) ! ξ 1 , ξ 2 , … , ξ n − 1 ; f ′ ≧ … (n-1)![x_(1),x_(2),dots,x_(n);f] >= (n-2)![xi_(1),xi_(2),dots,xi_(n-1);f^(')] >= dots(n-1)!\left[x_{1}, x_{2}, \ldots, x_{n} ; f\right] \geqq(n-2)!\left[\xi_{1}, \xi_{2}, \ldots, \xi_{n-1} ; f^{\prime}\right] \geqq \ldots(n−1)![x1,x2,…,xn;f]≧(n−2)![ξ1,ξ2,…,ξn−1;f′]≧…
… ≥ ( n − i − I ) ! [ ξ I ( i ) , ξ 2 ( i ) , … , ξ n − i ( i ) ; f ( i ) ] ≥ … ≥ [ ξ I ( n − I ) ; f ( n − I ) ] … ≥ ( n − i − I ) ! ξ I ( i ) , ξ 2 ( i ) , … , ξ n − i ( i ) ; f ( i ) ≥ … ≥ ξ I ( n − I ) ; f ( n − I ) dots >= (n-i-I)![xi_(I)^((i)),xi_(2)^((i)),dots,xi_(n-i)^((i));f^((i))] >= dots >= [xi_(I)^((n-I));f^((n-I))]\ldots \geq(n-i-\mathrm{I})!\left[\xi_{\mathrm{I}}^{(i)}, \xi_{2}^{(i)}, \ldots, \xi_{n-i}^{(i)} ; f^{(i)}\right] \geq \ldots \geq\left[\xi_{\mathrm{I}}^{(n-\mathrm{I})} ; f^{(n-\mathrm{I})}\right]…≥(n−i−I)![ξI(i),ξ2(i),…,ξn−i(i);f(i)]≥…≥[ξI(n−I);f(n−I)].
But,
[ ξ I ( n − 1 ) ; f ( n − 1 ) ] = f ( n − 1 ) ( x 1 + x 2 + … + x n n ) ξ I ( n − 1 ) ; f ( n − 1 ) = f ( n − 1 ) x 1 + x 2 + … + x n n [xi_(I)^((n-1));f^((n-1))]=f^((n-1))((x_(1)+x_(2)+dots+x_(n))/(n))\left[\xi_{\mathrm{I}}^{(n-1)} ; f^{(n-1)}\right]=f^{(n-1)}\left(\frac{x_{1}+x_{2}+\ldots+x_{n}}{n}\right)[ξI(n−1);f(n−1)]=f(n−1)(x1+x2+…+xnn)
so:
If the function f f fffis non-concave of order n n nnnin an interval containing the points x 1 , x 2 , … , x n x 1 , x 2 , … , x n x_(1),x_(2),dots,x_(n)x_{1}, x_{2}, \ldots, x_{n}x1,x2,…,xn, we have the inequality
( n − 1 ) ! [ x 1 , x 2 , … , x n ; f ] ≥ f ( n − 1 ) ( x 1 + x 2 + … + x n n ) ( n − 1 ) ! x 1 , x 2 , … , x n ; f ≥ f ( n − 1 ) x 1 + x 2 + … + x n n (n-1)![x_(1),x_(2),dots,x_(n);f] >= f^((n-1))((x_(1)+x_(2)+dots+x_(n))/(n))(n-1)!\left[x_{1}, x_{2}, \ldots, x_{n} ; f\right] \geq f^{(n-1)}\left(\frac{x_{1}+x_{2}+\ldots+x_{n}}{n}\right)(n−1)![x1,x2,…,xn;f]≥f(n−1)(x1+x2+…+xnn)
If f is convex of order n n nnn, equality is only possible for x 1 = x 2 = … = x n x 1 = x 2 = … = x n x_(1)=x_(2)=dots=x_(n)x_{1}=x_{2}=\ldots=x_{n}x1=x2=…=xn. Let us take, in particular, the function f = x n + r − 1 f = x n + r − 1 f=x^(n+r-1)f=x^{n+r-1}f=xn+r−1. So if r r rrris a natural number
, the difference divided [ x 1 , x 2 , … , x n ; / ] x 1 , x 2 , … , x n ; / [x_(1),x_(2),dots,x_(n);//]\left[x_{1}, x_{2}, \ldots, x_{n} ; /\right][x1,x2,…,xn;/]is equal to the well-known symmetric function
W r = ∑ α 1 + α 2 + … + α i l = r . x 1 α 1 x 2 i α 2 … x n α n W r = ∑ α 1 + α 2 + … + α i l = r . &hairsp; x 1 α 1 x 2 i α 2 … x n α n W_(r)=sum_(alpha_(1)+alpha_(2)+dots+alpha_(il)=r.)x_(1)^(alpha_(1))x_(2i)^(alpha_(2))dotsx_(n)^(alpha_(n))\mathrm{W}_{r}=\sum_{\alpha_{1}+\alpha_{2}+\ldots+\alpha_{i l}=r .} x_{1}^{\alpha_{1}} x_{2 i}^{\alpha_{2}} \ldots x_{n}^{\alpha_{n}}Wr=∑α1+α2+…+αiL=r.x1α1x2iα2…xnαn
Let us denote by Wr' the same symmetric functions of ξ 1 , ξ 2 , … , ξ n − 1 ξ 1 , ξ 2 , … , ξ n − 1 xi_(1),xi_(2),dots,xi_(n-1)\xi_{1}, \xi_{2}, \ldots, \xi_{n-1}ξ1,ξ2,…,ξn−1and, in general, by W r ( i ) W r ( i ) W_(r)^((i))W_{r}^{(i)}Wr(i) les fonctions symétriques correspondantes de ξ 1 ( i ) ξ 1 ( i ) xi_(1)^((i))\xi_{1}^{(i)}ξ1(i), ξ 2 ( i ) , … , ξ n − i ( i ) ξ 2 ( i ) , … , ξ n − i ( i ) xi_(2)^((i)),dots,xi_(n-i)^((i))\xi_{2}^{(i)}, \ldots, \xi_{n-i}^{(i)}ξ2(i),…,ξn−i(i). Remarquons que la fonction x n + r − 1 x n + r − 1 x^(n+r-1)x^{n+r-1}xn+r−1 est convexe d'ordre n n nnn dans l'intervalle ( − ∞ , + ∞ ) ( − ∞ , + ∞ ) (-oo,+oo)(-\infty,+\infty)(−∞,+∞) si r r rrr est tun nombre naturel pair et est convexe d'ordre n n nnn dans ( 0 , + ∞ 0 , + ∞ 0,+oo0,+\infty0,+∞ ) si r r rrr est un nombre naturel impair. Nous pouvons donc énoncer la propriété suivante:
Si x 1 , x 2 , … , x n x 1 , x 2 , … , x n x_(1),x_(2),dots,x_(n)x_{1}, x_{2}, \ldots, x_{n}x1,x2,…,xn sont les zéros, tous réels, d'un polynome de degré n n nnn et ξ r ( i ) , ξ 2 ( i ) , … , ξ n − i ( i ) ξ r ( i ) , ξ 2 ( i ) , … , ξ n − i ( i ) xi_(r)^((i)),xi_(2)^((i)),dots,xi_(n-i)^((i))\xi_{\mathrm{r}}^{(i)}, \xi_{2}^{(i)}, \ldots, \xi_{n-i}^{(i)}ξr(i),ξ2(i),…,ξn−i(i) sont les zéros de la iema dérivée de ce polynome ( ξ r ( n − 1 ) = x 1 + x 2 + … + x n n ) ξ r ( n − 1 ) = x 1 + x 2 + … + x n n (xi_(r)^((n-1))=:}{:(x_(1)+x_(2)+dots+x_(n))/(n))\left(\xi_{\mathrm{r}}^{(n-1)}=\right. \left.\frac{x_{1}+x_{2}+\ldots+x_{n}}{n}\right)(ξr(n−1)=x1+x2+…+xnn), nous avons les inégalités
(8) W r ( n + r − I r ) ≥ W r ′ ( n + r − 2 r ) ≥ ⋯ ≥ W r ( i ) ( n + r − i − I r ) ≥ ⋯ ≥ ( x 1 + x + … + x n n ) ′ (8) W r ( n + r − I r ) ≥ W r ′ ( n + r − 2 r ) ≥ ⋯ ≥ W r ( i ) ( n + r − i − I r ) ≥ ⋯ ≥ x 1 + x + … + x n n ′ {:(8)(W_(r))/(((n+r-I)/(r))) >= (W_(r)^('))/(((n+r-2)/(r))) >= cdots >= (W_(r)^((i)))/(((n+r-i-I)/(r))) >= cdots >= ((x_(1)+x+dots+x_(n))/(n))^('):}\begin{equation*} \frac{\mathrm{W}_{r}}{\binom{n+r-\mathrm{I}}{r}} \geq \frac{\mathrm{W}_{r}^{\prime}}{\binom{n+r-2}{r}} \geq \cdots \geq \frac{\mathrm{W}_{r}^{(i)}}{\binom{n+r-i-\mathrm{I}}{r}} \geq \cdots \geq\left(\frac{x_{1}+x+\ldots+x_{n}}{n}\right)^{\prime} \tag{8} \end{equation*}(8)Wr(n+r−Ir)≥Wr′(n+r−2r)≥⋯≥Wr(i)(n+r−i−Ir)≥⋯≥(x1+x+…+xnn)′
pour tout nombre naturel pair r ≥ 2 r ≥ 2 r >= 2r \geq 2r≥2.
Si, de plus, les zéros x 1 , x 2 , … , x n x 1 , x 2 , … , x n x_(1),x_(2),dots,x_(n)x_{1}, x_{2}, \ldots, x_{n}x1,x2,…,xn sont non-négatifs, ces inégalités sont vraies aussi pour r ≥ 3 r ≥ 3 r >= 3r \geq 3r≥3 impair.
Le signe ≥ ≥ >=\geq≥ ne devient = = === dans ces inégalités que si x 1 = x 2 = … = x n x 1 = x 2 = … = x n x_(1)=x_(2)=dots=x_(n)x_{1}=x_{2}=\ldots=x_{n}x1=x2=…=xn.
L'inégalité (7) est à rapprocher de l'inégalité de M. K. T o d à 4)
f ( x 1 ) + f ( x 2 ) + ⋯ + f ( x n ) n ≥ f ( ξ 1 ) + f ( ξ 2 ) + … + f ( ξ n − 1 ) n − I f x 1 + f x 2 + ⋯ + f x n n ≥ f ξ 1 + f ξ 2 + … + f ξ n − 1 n − I (f(x_(1))+f(x_(2))+cdots+f(x_(n)))/(n) >= (f(xi_(1))+f(xi_(2))+dots+f(xi_(n-1)))/(n-I)\frac{f\left(x_{1}\right)+f\left(x_{2}\right)+\cdots+f\left(x_{n}\right)}{n} \geq \frac{f\left(\xi_{1}\right)+f\left(\xi_{2}\right)+\ldots+f\left(\xi_{n-1}\right)}{n-\mathrm{I}}f(x1)+f(x2)+⋯+f(xn)n≥f(ξ1)+f(ξ2)+…+f(ξn−1)n−I
valable pour toute fonction non-concave d'ordre I 5 I 5 I^(5)I^{5}I5 ). Pour f = x p f = x p f=x^(p)f=x^{p}f=xp où, p ≥ p ≥ p >=p \geqp≥ I ou p < 0 p < 0 p < 0p<0p<0, cette inégalité revient à celle de MM. H. E. B i a y 6 6 ^(6){ }^{6}6 ) ẹt S. Kake y a 7 7 ^(7){ }^{7}7 )
x I p + x 2 p + … + x n p n ≥ ξ ˙ I p + ξ 2 p + … + ξ n − I p n − I , ( x i > 0 ) x I p + x 2 p + … + x n p n ≥ ξ ˙ I p + ξ 2 p + … + ξ n − I p n − I , x i > 0 (x_(I)^(p)+x_(2)^(p)+dots+x_(n)^(p))/(n) >= (xi^(˙)_(I)^(p)+xi_(2)^(p)+dots+xi_(n-I)^(p))/(n-I),quad(x_(i) > 0)\frac{x_{\mathrm{I}}^{p}+x_{2}^{p}+\ldots+x_{n}^{p}}{n} \geq \frac{\dot{\xi}_{\mathrm{I}}^{p}+\xi_{2}^{p}+\ldots+\xi_{n-\mathrm{I}}^{p}}{n-\mathrm{I}}, \quad\left(x_{i}>0\right)xIp+x2p+…+xnpn≥ξ˙Ip+ξ2p+…+ξn−Ipn−I,(xi>0)
qui est à rapprocher de (8).
Cernăufi, le 27 février 1940.

  1. 1 ) 1 ) ^(1)){ }^{1)}1) La note III est sous presse dans Mathematica, 16, 74-86. La note IV doit paraître dans cette même revue.
    2 2 ^(2){ }^{2}2 ) Pour les notations voir mes travaux antérieurs.
  2. 4 4 ^(4){ }^{4}4 ) K. Toda, On certain functional inequalities, Journal of the Hiroshima. Univ., A,, 427-40 (1934).
    5 5 ^(5){ }^{5}5 ) Voir aussi la note III, loc. cil. (1).
    6 6 ^(6){ }^{6}6 ) H. E. B r a y, On the zeros of a polynomial and of its devivatives, Aner. Journal of Math., 53, 864-872 (1931).
    7 7 ^(7){ }^{7}7 ) S.K a ke y a, On an inequality between the roots of an equation and its derivative, Proceedings Phys.-Math. Soc. Japan (3), 15, 149-154 (1933).
1940

Related Posts