Convex functions, partial orderings, and statistical applications (Q1189560)

From MaRDI portal
Revision as of 06:28, 21 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Convex functions, partial orderings, and statistical applications
scientific article

    Statements

    Convex functions, partial orderings, and statistical applications (English)
    0 references
    0 references
    0 references
    0 references
    18 September 1992
    0 references
    There are many books on inequalities and on convex functions but then there are so many inequalities around --- more or less connected to convex functions --- that no book of reasonable size can contain all. The present book takes a pretty good stab at it --- as long as the inequalities are satisfied by convex functions in general and, except in Chapters 13-17, not by particular ones (thus showing a similar trait to some complex function theory courses where the only complex function a student sees is ``\(f\)''). So, for instance, when following the subject index the reader looks up ``Minkowski's inequality'' he or she may find something different from what could be expected. Speaking about subject indices, this reviewer having stood on both sides of the fence, can appreciate that the typical author finds it tiresome to put them together. But the typical reader, in particular of such encyclopedical works (not meant, we hope, to be read cover to cover in linear order) relies heavily on them. So, for example, ``monotonic \(n\)- tuple'', ``isotonic functional'' might be sorely missed (only ``inequalities'' are under I) as well as properties \(A1,A2,\dots,L1,L2,K_ 1,K_ 2\) in the index or in the list of notations. The book is not self-contained: Not only are results mentioned only by reference, but so are even definitions, for instance in Theorem 8.3: ``\dots If \(F_ n\) is a quasi-arithmetic mean (for definition see Bullen,\dots) then \dots''. Since there is no proof, the reader can understand this theorem only if she or he looks it up elsewhere. This is quite strange because either a direct definition or specialization from the ``generalized mean'' defined on p. 107 would take only a couple of lines. --- Also, not all definitions are marked as such. --- In Remark 15.22, counterexamples would be appreciated which show why the two conjectures there formulated are false. Chapters 1-10 are solidly filled wall to wall with inequalities; even the word ``application'' refers there to other inequalities. Chapter 11 contains ``geometric'' inequalities, Chapter 12 majorization and Schur convexity, while Chapters 13-17 give applications to probability and statistics (random variables, their moments, density functions, distributions, arrangement ordering). All over there are many interesting historical remarks, including corrections to conventional wisdom about who has priority to what definition or result. \{L. Fejér is on the receiving end of one of these remarks. Another quotation from Fejér may be of interest in this context: ``The history of mathematics serves to prove that nobody discovered anything: there was always somebody who knew it before.''\} Some of these remarks also correct published statements and point out simpler proofs (usually by the authors). All in all, a very useful book, but there is room for improvement.
    0 references
    0 references
    means
    0 references
    partial orderings
    0 references
    convex functions
    0 references
    inequalities
    0 references
    majorization
    0 references
    random variables
    0 references
    moments
    0 references
    density functions
    0 references
    distributions
    0 references
    arrangement ordering
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references