No label defined (Q4337877)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1013843
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1013843

      Statements

      0 references
      0 references
      10 December 1998
      0 references
      convex function
      0 references
      concave function
      0 references
      \(\varphi\)-function
      0 references
      function with increasing increments
      0 references
      inequality
      0 references
      Let \(f: [0,b)\to [0,\infty)\) and \(f(0)= 0\). Let \(a_k\in[0, b)\), \(k= 0,\dots,n\), with \(a_0= 0\) and \(\sum^n_{k= 1}| a_k- a_{k-1}|< b\). The main results are the following (Theorem 1 [2]): If \(f\) is convex [concave], then \[ \sum^n_{k= 1}| f(a_k)- f(a_{k- 1})|\leq [\geq] f\Biggl(\sum^n_{k= 1}| a_k- a_{k- 1}|\Biggr). \] For \(f\) a \(\varphi\)-function, the convex variant of the above inequality goes back to \textit{L. Maligranda} and \textit{W. Orlicz} [Monatsh. Math. 104, No. 1, 53-65 (1987; Zbl 0623.26009)]. The convex variant of the inequality is also shown to hold true for real-valued functions of \(r\)-dimensional rectangles which have increasing increments (as defined by \textit{A. M. Russell} [Am. Math. Mon. 87, 39-40 (1980; Zbl 0426.46033)]).
      0 references

      Identifiers