Mathematical Inequalities

This page intentionally left blank

Mathematical Inequalities

North-Holland Mathematical Library Board of Honorary Editors: M. Artin, H.Bass, J. Eells, W. Feit, P.J. Freyd, F.W. Gehring, H. Halberstam, L.V. Hörmander, J.H.B. Kemperman, W.A.J. Luxemburg, F. Peterson, I.M. Singer and A.C. Zaanen

Board of Advisory Editors: A. Björner, R.H. Dijkgraaf, A. Dimca, A.S. Dow, J.J. Duistermaat, E. Looijenga, J.P. May, I. Moerdijk, S.M. Mori, J.P. Palis, A. Schrijver, J. Sjöstrand, J.H.M. Steenbrink, F. Takens and J. van Mill

VOLUME 67

Amsterdam – Boston – Heidelberg – London – New York – Oxford – Paris – San Diego – San Francisco – Singapore – Sydney – Tokyo

Mathematical Inequalities

B.G. Pachpatte 57 Shri Niketan Colony Near Abhinay Talkies Aurangabad 431 001 Maharashtra India

2005 Amsterdam – Boston – Heidelberg – London – New York – Oxford – Paris – San Diego – San Francisco – Singapore – Sydney – Tokyo

ELSEVIER B.V. Radarweg 29 P.O. Box 211 1000 AE Amsterdam The Netherlands

ELSEVIER Inc. 525 B Street, Suite 1900 San Diego, CA 92101-4495 USA

ELSEVIER Ltd The Boulevard, Langford Lane Kidlington, Oxford OX5 1GB UK

ELSEVIER Ltd 84 Theobalds Road London WC1X 8RR UK

© 2005 Elsevier B.V. All rights reserved. This work is protected under copyright by Elsevier B.V., and the following terms and conditions apply to its use: Photocopying Single photocopies of single chapters may be made for personal use as allowed by national copyright laws. Permission of the Publisher and payment of a fee is required for all other photocopying, including multiple or systematic copying, copying for advertising or promotional purposes, resale, and all forms of document delivery. Special rates are available for educational institutions that wish to make photocopies for non-profit educational classroom use. Permissions may be sought directly from Elsevier’s Rights Department in Oxford, UK; phone: (+44) 1865 843830, fax: (+44) 1865 853333, e-mail: [email protected]. Requests may also be completed on-line via the Elsevier homepage (http://www.elsevier.com/locate/permissions). In the USA, users may clear permissions and make payments through the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, USA; phone: (+1) (978) 7508400, fax: (+1) (978) 7504744, and in the UK through the Copyright Licensing Agency Rapid Clearance Service (CLARCS), 90 Tottenham Court Road, London W1P 0LP, UK; phone: (+44) 20 7631 5555; fax: (+44) 20 7631 5500. Other countries may have a local reprographic rights agency for payments. Derivative Works Tables of contents may be reproduced for internal circulation, but permission of the Publisher is required for external resale or distribution of such material. Permission of the Publisher is required for all other derivative works, including compilations and translations. Electronic Storage or Usage Permission of the Publisher is required to store or use electronically any material contained in this work, including any chapter or part of a chapter. Except as outlined above, no part of this work may be reproduced, stored in a retrieval system or transmitted in any form or by any means, electronic, mechanical, photocopying, recording or otherwise, without prior written permission of the Publisher. Address permissions requests to: Elsevier’s Rights Department, at the fax and e-mail addresses noted above. Notice No responsibility is assumed by the Publisher for any injury and/or damage to persons or property as a matter of products liability, negligence or otherwise, or from any use or operation of any methods, products, instructions or ideas contained in the material herein. Because of rapid advances in the medical sciences, in particular, independent verification of diagnoses and drug dosages should be made. First edition 2005 Library of Congress Cataloging in Publication Data A catalog record is available from the Library of Congress. British Library Cataloguing in Publication Data A catalogue record is available from the British Library. ISBN: 0-444-51795-2 Series ISSN: 0924-6509

The paper used in this publication meets the requirements of ANSI/NISO Z39.48-1992 (Permanence of Paper). Printed in The Netherlands.

To the Memory of My Parents

This page intentionally left blank

Preface

Inequalities play an important role in almost all branches of mathematics as well as in other areas of science. The basic work “Inequalities” by Hardy, Littlewood and Pólya appeared in 1934 and the books “Inequalities” by Beckenbach and Bellman published in 1961 and “Analytic Inequalities” by Mitrinovi´c published in 1970 made considerable contributions to this field and supplied motivations, ideas, techniques and applications. Since 1934 an enormous amount of effort has been devoted to the discovery of new types of inequalities and to the application of inequalities in many parts of analysis. The usefulness of mathematical inequalities is felt from the very beginning and is now widely acknowledged as one of the major driving forces behind the development of modern real analysis. The theory of inequalities is in a process of continuous development state and inequalities have become very effective and powerful tools for studying a wide range of problems in various branches of mathematics. This theory in recent years has attracted the attention of a large number of researchers, stimulated new research directions and influenced various aspects of mathematical analysis and applications. Among the many types of inequalities, those associated with the names of Jensen, Hadamard, Hilbert, Hardy, Opial, Poincaré, Sobolev, Levin and Lyapunov have deep roots and made a great impact on various branches of mathematics. The last few decades have witnessed important advances related to these inequalities that remain active areas of research and have grown into substantial fields of research with many important applications. The development of the theory related to these inequalities resulted in a renewal of interest in the field and has attracted interest from many researchers. A host of new results have appeared in the literature. The present monograph provides a systematic study of some of the most famous and fundamental inequalities originated by the above mentioned mathematicians and brings together the latest, interesting developments in this important research area under a unified framework. Most of the results contained here are only recently discovered and are still scattered over a large number of nonspecialist periodicals. The choice of material covers some of the most important results vii

viii

Preface

in the field which have had a great impact on many branches of mathematics. This work will be of interest to mathematical analysts, pure and applied mathematicians, physicists, engineers, computer scientists and other areas of science. For researchers working in these areas, it will be a valuable source of reference and inspiration. It could also be used as a text for an advanced graduate course. The author acknowledges with great pleasure his gratitude for the fine cooperation and assistance provided by the staff of the book production department of Elsevier Science. I also express deep appreciation to my family members for their encouragement, understanding and patience during the writing of this book. B.G. Pachpatte

Contents

Preface

vii

Introduction

1

1 Inequalities Involving Convex Functions 1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . 1.2 Jensen’s and Related Inequalities . . . . . . . . . . . . . 1.3 Jessen’s and Related Inequalities . . . . . . . . . . . . . 1.4 Some General Inequalities Involving Convex Functions 1.5 Hadamard’s Inequalities . . . . . . . . . . . . . . . . . . 1.6 Inequalities of Hadamard Type I . . . . . . . . . . . . . 1.7 Inequalities of Hadamard Type II . . . . . . . . . . . . . 1.8 Some Inequalities Involving Concave Functions . . . . 1.9 Miscellaneous Inequalities . . . . . . . . . . . . . . . . 1.10 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 Inequalities Related to Hardy’s Inequality 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . 2.2 Hardy’s Series Inequality and Its Generalizations . . . 2.3 Series Inequalities Related to Those of Hardy, Copson and Littlewood . . . . . . . . . . . . . . . . . . . . . . 2.4 Hardy’s Integral Inequality and Its Generalizations . . 2.5 Further Generalizations of Hardy’s Integral Inequality 2.6 Hardy-Type Integral Inequalities . . . . . . . . . . . . 2.7 Multidimensional Hardy-Type Inequalities . . . . . . 2.8 Inequalities Similar to Hilbert’s Inequality . . . . . . ix

. . . . . . . . . .

11 11 11 33 46 53 64 73 84 100 111

. . . . . . . . . . . .

113 113 113

. . . . . .

128 144 155 169 184 209

. . . . . . . . . .

. . . . . .

. . . . . . . . . .

. . . . . .

. . . . . . . . . .

. . . . . .

. . . . . . . . . .

. . . . . .

. . . . . .

x

Contents

2.9 Miscellaneous Inequalities . . . . . . . . . . . . . . . . . . . . . 2.10 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 Opial-Type Inequalities 3.1 Introduction . . . . . . . . . . . . . . . . . 3.2 Opial-Type Integral Inequalities . . . . . . 3.3 Wirtinger–Opial-Type Integral Inequalities 3.4 Inequalities Related to Opial’s Inequality . 3.5 General Opial-Type Integral Inequalities . . 3.6 Opial-Type Inequalities Involving Higher-Order Derivatives . . . . . . . . . . 3.7 Opial-Type Inequalities in Two and Many Independent Variables . . . . . . . . . . . . 3.8 Discrete Opial-Type Inequalities . . . . . . 3.9 Miscellaneous Inequalities . . . . . . . . . 3.10 Notes . . . . . . . . . . . . . . . . . . . . .

239 260

. . . . .

263 263 263 275 290 298

. . . . . . . . . . . .

308

. . . .

. . . . .

. . . . .

. . . .

. . . . .

. . . . .

. . . . .

. . . . .

. . . . .

. . . . .

. . . . .

. . . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

. . . .

328 349 363 379

4 Poincaré- and Sobolev-Type Inequalities 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . 4.2 Inequalities of Poincaré, Sobolev and Others . . . 4.3 Poincaré- and Sobolev-Type Inequalities I . . . . . 4.4 Poincaré- and Sobolev-Type Inequalities II . . . . 4.5 Inequalities of Dubinskii and Others . . . . . . . . 4.6 Poincaré- and Sobolev-Like Inequalities . . . . . . 4.7 Some Extensions of Rellich’s Inequality . . . . . . 4.8 Poincaré- and Sobolev-Type Discrete Inequalities 4.9 Miscellaneous Inequalities . . . . . . . . . . . . . 4.10 Notes . . . . . . . . . . . . . . . . . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

. . . . . . . . . .

381 381 382 391 402 419 430 445 457 468 482

5 Levin- and Lyapunov-Type Inequalities 5.1 Introduction . . . . . . . . . . . . . . . . . . 5.2 Inequalities of Levin and Others . . . . . . . 5.3 Levin-Type Inequalities . . . . . . . . . . . . 5.4 Inequalities Related to Lyapunov’s Inequality 5.5 Extensions of Lyapunov’s Inequality . . . . . 5.6 Lyapunov-Type Inequalities I . . . . . . . . . 5.7 Lyapunov-Type Inequalities II . . . . . . . . 5.8 Lyapunov-Type Inequalities III . . . . . . . .

. . . . . . . .

. . . . . . . .

. . . . . . . .

. . . . . . . .

. . . . . . . .

. . . . . . . .

. . . . . . . .

. . . . . . . .

485 485 485 495 505 516 525 534 542

. . . . . . . .

. . . .

. . . . .

. . . . . . . .

. . . . . . . .

Contents

5.9 Miscellaneous Inequalities . . . . . . . . . . . . . . . . . . . . . 5.10 Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

xi 553 562

References

565

Index

589

This page intentionally left blank

Introduction

The usefulness of mathematical inequalities in the development of various branches of mathematics as well as in other areas of science is well established in the past several years. The major achievements of mathematical analysis from Newton and Euler to modern applications of mathematics in physical sciences, engineering, and other areas have exerted a profound influence on mathematical inequalities. The development of mathematical analysis is crucially dependent on the unimpeded flow of information between theoretical mathematicians looking for applications and mathematicians working in applications who need theory, mathematical models and methods. Twentieth century mathematics has recognized the power of mathematical inequalities which has given rise to a large number of new results and problems and has led to new areas of mathematics. In the wake of these developments has come not only a new mathematics but a fresh outlook, and along with this, simple new proofs of difficult results. The classic work “Inequalities” by Hardy, Littlewood and Pólya appeared in 1934 and earned its place as a basic reference for mathematicians. This book is the first devoted solely to the subject of inequalities and is a useful guide to this exciting field. The reader can find therein a large variety of classical and new inequalities, problems, results, methods of proof and applications. The work is one of the classics of the century and has had much influence on research in several branches of analysis. It has been an essential source book for those interested in mathematical problems in analysis. The work has been supplemented with “Inequalities” by Beckenbach and Bellman written in 1965 and “Analytic Inequalities” by Mitrinovi´c published in 1970, which made considerable contributions to this field. These books provide handy references for the reader wishing to explore the topic in depth and show that the theory of inequalities has been established as a viable field of research. The last century bears witness to a tremendous flow of outstanding results in the field of inequalities, which are partly inspired by the aforementioned monographs, and probably even more so by the challenge of research in various 1

2

Introduction

branches of mathematics. The subject has received tremendous impetus from outside of mathematics from such diverse fields as mathematical economics, game theory, mathematical programming, control theory, variational methods, operation research, probability and statistics. The theory of inequalities has been recognized as one of the central areas of mathematical analysis throughout the last century and it is a fast growing discipline, with ever-increasing applications in many scientific fields. This growth resulted in the appearance of the theory of inequalities as an independent domain of mathematical analysis. The Hölder inequality, the Minkowski inequality, and the arithmetic mean and geometric mean inequality have played dominant roles in the theory of inequalities. These and many other fundamental inequalities are now in common use and, therefore, it is not surprising that numerous studies related to these areas have been made in order to achieve a diversity of desired goals. Over the past decades, the theory of inequalities has developed rapidly and unexpected results were found, along with simpler new proofs for existing results, and, consequently, new vistas for research opened up. In recent years the subject has evoked considerable interest from many mathematicians, and a large number of new results has been investigated in the literature. It is recognized that in general some specific inequalities provide a useful and important device in the development of different branches of mathematics. We shall begin our consideration of results with some important inequalities which find applications in many parts of analysis. The history of convex functions is very long. The beginning can be traced back to the end of the nineteenth century. Its roots can be found in the fundamental contributions of O. Hölder (1889), O. Stolz (1893) and J. Hadamard (1893). At the beginning of the last century J.L.W.V. Jensen (1905, 1906) first realized the importance and undertook a systematic study of convex functions. In the years thereafter this research resulted in the appearance of the theory of convex functions as an independent domain of mathematical analysis. In 1889, Hölder [151] proved that if f

(x)
0, then f satisfied what later came to be known as Jensen’s inequality. In 1893, Stolz [412] (see [390,391]) proved that if f is continuous on [a, b] and satisfies
f

x+y 2

 

 1 f (x) + f (y) , 2

(1)

then f has left and right derivatives at each point of (a, b). In 1893, Hadamard [134] obtained a basic integral inequality for convex functions that have an increasing derivative on [a, b]. In his pioneering work, Jensen [164,165] used (1) to define convex functions and discovered the great importance and perspective of these functions. Since then such functions have been studied more extensively,

3

Introduction

and a good exposition of the results has been given in the book “Convex Functions” by A.W. Roberts and D.E. Varberg [397]. Among many important results discovered in his basic work [164,165] Jensen proved one of the fundamental inequalities of analysis which reads as follows. Let f be a convex function in the Jensen sense on [a, b]. For any points x1 , . . . , xn in [a, b] and any rational nonnegative numbers r1 , . . . , rn such that r1 + · · · + rn = 1, we have  n  n   f ri xi  ri f (xi ). (2) i=1

i=1

Inequality (2) is now known in the literature as Jensen’s inequality. It is one of the most important inequalities for convex functions and has been extended and refined in several different directions using different principles or devices. The fundamental work of Jensen was the starting point for the foundation work in convex functions and can be cited as anticipation what was to come. The general theory of convex functions is the origin of powerful tools for the study of problems in analysis. Inequalities involving convex functions are the most efficient tools in the development of several branches of mathematics and has been given considerable attention in the literature. One of the most celebrated results about convex functions is the following fundamental inequality. Let f : [a, b] → R be a convex function, where R denotes the set of real numbers. Then the following inequality holds
f

a+b 2

 

1 b−a

 a

b

f (x) dx 

f (a) + f (b) . 2

(3)

Inequality (3) is now known in the literature as Hadamard’s inequality. The left-hand side of (3), proved in 1893 by Hadamard [134] before convex functions had been formally introduced, for functions f with f
increasing on [a, b], is sometimes called the Hadamard inequality and the right-hand side is known as the “Jensen inequality” or vice versa. There are also papers which attribute inequality (3) completely to Hadamard. In view of the repeated mentioning of the inequality given in (3), it will be referred to it as to the “Hadamard inequality”. In 1985, Mitrinovi´c and Lackovi´c [212] pointed out that the inequalities in (3) are due to C. Hermite who obtained them in 1883, ten years before Hadamard. Inequalities of the form (3) not only are of interest in their own right but also have important applications in various branches of mathematics. The last few decades have witnessed important

4

Introduction

advances related to inequalities (2) and (3) and numerous variants, generalizations and extensions of these inequalities have appeared in the literature. One of the many fundamental and remarkable mathematical discoveries of D. Hilbert is the following inequality (see [141, p. 226]). p p If p > 1, p
= p/(p − 1) and an  A, bn  B, the summations running from 1 to ∞, then   am bn π  A1/p B 1/p , m + n sin(π/p)

(4)

unless the sequence {am } or {bn } is null. The above result is known in the literature as Hilbert’s inequality or Hilbert’s double series theorem. The integral analogue of Hilbert’s inequality can be stated as follows (see [141, p. 226]).

∞
∞ If p > 1, p
= p/(p − 1) and 0 f p (x) dx  F , 0 g p (y) dy  G, then ∞ ∞

 0

0

π f (x)g(y)
dx dy  F 1/p G1/p , x +y sin(π/p)

(5)

unless f ≡ 0 or g ≡ 0. The inequalities in (4) and (5) marked the beginning of a new era in the development of the theory of inequalities, which, within a few decades, was very successful and produced numerous variants, generalizations and applications. This work was inspired by the great mathematician D. Hilbert (see [141, p. 226]) whose fundamental contributions to many areas of mathematics are well known. In the course of attempts to simplify the proofs of inequalities (4) and (5) Hardy [136] (see also [141, pp. 239–240]) discovered the following famous inequality. If p > 1, an
0, An = a1 + · · · + an , then  ∞
 An p n=1

n


<

p p−1

p  ∞

p

an ,

(6)

n=1

unless all the an ’s are zeros. The constant (p/(p − 1))p is the best possible. The most celebrated result corresponding to the series inequality (6) for integrals due to Hardy [136] is embodied

x in the following inequality. If p > 1, f (x)
0 and F (x) = 0 f (t) dt, then  0

∞
F

x




p dx <

p p−1

p 

unless f ≡ 0. The constant is the best possible.

0

∞

f p dx,

(7)

5

Introduction

Inequality (6) or its integral analogue given in (7) is now known in the literature as Hardy’s inequality. Inequalities (6) and (7) are the most inspiring and fundamental inequalities in mathematical analysis. A detailed account on earlier developments related to inequalities (4)–(7) can be found in [141, Chapter IX]. Hardy’s inequalities given in (6) and (7) were the major influences in the further development of the theory and applications of such inequalities. Since the appearance of inequalities (6) and (7), a large number of papers has appeared in the literature which deals with alternative proofs, various generalizations, extensions, and applications of these inequalities. In the past several years there has been considerable interest in the study of integral inequalities involving functions and their derivatives. In 1960, Z. Opial [231] published a remarkable paper which contains the following integral inequality. Let y(x) be of class C 1 on 0  x  h and satisfy y(0) = y(h) = 0 and y(x) > 0 in (0, h). Then the following inequality holds  0

 y(x)y
(x) dx  h 4

h



 y
(x)2 dx.

h

(8)

0

The constant h4 is the best possible. In the same year, C. Olech [230] published a note which deals with a simple proof of Opial’s inequality. Moreover, Olech showed that (8) is valid for any function y(x) which is absolutely continuous on [0, h] and satisfies the boundary conditions y(0) = y(h) = 0. From Olech’s proof, it is clear that in order to prove (8), it is sufficient to prove the following inequality. Let y(t) be absolutely continuous on [0, h] and y(0) = 0. Then the following inequality holds  h  h   
2 y(x)y
(x) dx  h y (x) dx. (9) 2 0 0 The constant h2 is the best possible. Inequality (8) is known in the literature as Opial’s inequality and it is one of the most important and fundamental integral inequalities in the analysis of qualitative properties of solutions of ordinary differential equations. Since the discovery of Opial’s inequality in 1960 an enormous amount of work has been done, and many papers which deal with new proofs, various generalizations, extensions and discrete analogues have appeared in the literature; see [4] and the references cited therein. Motivated by a paper of H.A. Schwarz [404] published in 1885, in the year 1894, H. Poincaré established [389] (see also [211, p. 142]) the following

6

Introduction

fundamental inequality   
2
2 ∂f 7σ 2 ∂f dx dy, (10) f 2 (x, y) dx dy  + 24 ∂x ∂y T T

where T is a convex region and f is a function such that T f (x, y) dx dy = 0 and σ is the chord of that region. In the same paper Poincaré gave an inequality analogues to (10) for a threedimensional region. In view of the importance of the inequalities of the form (10) many authors have investigated different versions of the above inequality from different view points. The most useful inequality analogous to (10) which is now known in the literature as Poincaré inequality can be stated as follows. If E is a bounded region in two or three dimensions and u is a sufficiently smooth function which vanishes on the boundary ∂E of E, then   λ u2 dA  |∇u|2 dA, (11) E

E

where λ denotes the smallest eigenvalue of the problem ∇ 2 v + λv = 0 in E,

v = 0 on ∂E,

(12)

where ∇ = ( ∂x∂ 1 , . . . , ∂x∂ n ). It is recognized that Poincaré-type inequalities provide, in general, a useful and important device in the study of qualitative as well as quantitative properties of solutions of partial differential equations. Because of their usefulness and importance, Poincaré-type inequalities have attracted much attention and generalizations to various aspects have been established in the literature. The discrete analogues of Poincaré-type inequalities have gained increasing significance in the last decades as is apparent from the large number of applications in the study of finite difference equations. Especially, in view of wider applications, the inequalities of the forms (10) and (11) have been generalized and sharpened from the very day of their discovery. One of the most celebrated results discovered by S.L. Sobolev [410] is the following integral inequality (see [157, p. 101])  ∞ ∞ u4 dx dy −∞ −∞



α 2




∞



∞

−∞ −∞


 u2 dx dy

∞



∞

−∞ −∞

 | grad u|2 dx dy ,

(13)

where u(x, y) is any smooth function of compact support in two-dimensional ∂u 2 2 Euclidean space E2 , | grad u|2 = | ∂x | + | ∂u ∂y | and α is a dimensionless constant.

7

Introduction

Inequality (13) is known as Sobolev’s inequality, although the same name is used also for the above inequality in n-dimensional Euclidean space. Inequalities of the forms (10), (11) and (13) or their variants have been applied with considerable success to the study of problems in the theory of partial differential equations and have established the foundations of the finite element analysis. There is vast literature which deals with various generalizations, extensions, and variants of these inequalities and their applications; see [3,120,121] and references therein. It is well known that one of the important and effective techniques in the theory of differential equations is the comparison method (see [416]). Inequalities involving comparison of solutions of second-order differential equations provide a major tool in the study of second-order differential equations. In particular, the basic comparison results due to C. Sturm [414] (see also [145, pp. 334–336]) and that of A.J. Levin [187] have played an important role in the study of several qualitative properties of the solutions of certain second-order differential equations. These comparison results can be found in several classical books, see [145,416]. A useful tool for the study of the qualitative nature of solutions of ordinary linear differential equations of the second order is the fact that if y(t) is a realvalued, absolutely continuous function on [a, b] with y
(t) of integrable square and y(a) = 0 = y(b), then for s in (a, b) we have 

b

2 y
(t) dt


a

4 y 2 (s). b−a

(14)

Moreover, if y(t) ≡ / 0 on [a, b] the equality holds only if s = (a + b)/2 and y(t) ≡ y(s){1 − |(2t − a − b)/(b − a)|}. In particular, with the aid of this inequality one may show that if p(t) is a real-valued continuous function such that the differential equation y

(t) + p(t)y(t) = 0

(15)

has a nonidentically vanishing real-valued solution possessing two distinct zeros on [a, b], then  b 4 , (16) p + (t) dt > b − a a where p + (t) = max{p(t), 0}, see [393–395]. Inequality (16) is due originally to Lyapunov [201] and it is known that the constant equal to 4 in (16) cannot, in general, be replaced by a larger one. One of the nice purposes of (16) is that a researcher may obtain a lower bound for the distance between two consecutive zeros of a solution of (15) by means of an integral measurement of p. The importance of this famous result of Lyapunov for

8

Introduction

the study of differential equations has been recognized since its discovery and has received extensive attention over the years, and a number of new Lyapunov-type inequalities which are quite useful in the study of various classes of second-order differential equations investigated in the literature. The aforementioned inequalities play a fundamental role in different branches of mathematics, and in recent years has attracted the attention of a large number of researchers who are interested both in theory and in applications. The abundance of applications is stimulating a rapid development of the theory of these inequalities and, at present, this theory is one of the most rapidly developing areas of mathematical analysis. Over the years, generalizations, extensions, refinements, improvements, discretizations and new applications of these inequalities are constantly being found by researchers in various branches of mathematics. Although much progress in this field has been made in recent years, these results have not been readily accessible to a wider audience until now. These new developments has motivated the author to write a monograph devoted to the recent developments related to these most important inequalities in mathematics. A major problem for anyone attempting an exposition related to the above inequalities is the vast extent of the literature. It would be neither easy nor particularly desirable to include everything that is known about these inequalities between the covers of one book, so in this monograph an attempt has been made to present a detailed account of the most inspiring and fundamental results related to the above inequalities which are mostly discovered over the most recent years. A list of applications related to these inequalities is nearly endless, and we are convinced that many new and beautiful applications are still waiting to be revealed. A detailed and comprehensive account of typical applications, together with a full bibliography, may be found in the various references given at the end. This monograph consists of five chapters and an extensive list of references. Chapter 1 deals with important inequalities involving convex functions which find important applications in various branches of mathematics. It contains a detailed study of a wide variety of inequalities related to the well-known Jensen and Hadamard inequalities, that have recently entered the literature. Chapter 2 is devoted to a great variety of new and fundamental inequalities related to the well-known Hardy and Hilbert inequalities recently investigated in the literature and which will open up new vistas for further research in this field. Chapter 3 considers many new inequalities of the Opial type recently investigated in the literature and which involve functions of one or many independent variables and which has proven to be important in the theory of ordinary and partial differential equations. Chapter 4 presents a number of new inequalities related to the wellknown inequalities of Poincaré and Sobolev which finds important applications in the study of partial differential equations and finite element analysis. Chapter 5 is concerned with basic inequalities developed in the literature related to the most

Introduction

9

important inequalities of Levin and Lyapunov which are useful in the study of differential equations. It deals with a number of new generalizations, extensions, and variants of the original Levin and Lyapunov inequalities. Each chapter ends with miscellaneous inequalities for further study and notes on bibliographies.

This page intentionally left blank

Chapter 1 Inequalities Involving Convex Functions

1.1 Introduction The fundamental work of Jensen [164,165] in the years 1905, 1906 is the starting point of the systematic study of convex functions. Even before Jensen, the literature shows results which refer to convex functions. In fact the roots of such functions can be found in the work of Hölder [151] in 1889 and Hadamard [134] in 1893, although these roots were not explicitly specified in their works. As noted by Popoviciu [390, p. 48], Stolz [412] is the first to introduce convex functions in the year 1893. Starting from the pioneer papers of Jensen [164,165] there is remarkable interest in the theory of convex functions and these ideas are at the core of many problems in different branches of mathematics. Over the years several new inequalities involving convex functions which have important applications in various branches of mathematics have been developed. This chapter presents some basic inequalities involving convex functions which find significant applications in mathematical analysis, applied mathematics, probability theory, and various other branches of mathematics.

1.2 Jensen’s and Related Inequalities Let I denote a suitable interval of the real line R. A function f : I → R is called convex in the Jensen sense or J-convex or midconvex if 
f (x) + f (y) x +y  (1.2.1) f 2 2 for all x, y ∈ I . Jensen [164,165] is first to define a convex function by using inequality (1.2.1) and to draw attention to their importance. A function f : I → R 11

12

Chapter 1. Inequalities Involving Convex Functions

is called convex if   f λx + (1 − λ)y  λf (x) + (1 − λ)f (y)

(1.2.2)

for all x, y ∈ I and λ ∈ (0, 1). It is called strictly convex provided that inequality (1.2.2) is strict for x = y. If −f : I → R is convex, then we say that f : I → R is concave. Taking λ = 1/2 it shows that all functions satisfying (1.2.2) also satisfy (1.2.1), but the definitions are not equivalent since there are functions discontinuous on an open interval that satisfy (1.2.1), while all functions that satisfy (1.2.2) are continuous on open intervals. The definition of convex function has very natural generalization to real-valued functions defined on an arbitrary normed linear space L. We merely require that the domain U of f be convex. This response assures that for x1 , x2 ∈ U , α ∈ (0, 1), f will always be defined at αx1 + (1 − α)x2 . We then define f to be convex on U ⊆ L if   f αx1 + (1 − α)x2  αf (x1 ) + (1 − α)f (x2 ). A detailed account on the various properties of convex functions can be found in [211,384,397]. In this section we shall deal with Jensen’s and related inequalities involving convex functions investigated by various authors over the years, which find significant applications in various branches of mathematics. We begin with Jensen’s inequality, which is one of the basic and most important inequalities in mathematics. T HEOREM 1.2.1. Suppose that f is J-convex and I = [a, b]. For any points x1 , . . . , xn ∈ I and any rational nonnegative numbers, r1 , . . . , rn such that r1 + · · · + rn = 1, we have  f

n 

 ri xi 

i=1

n 

ri f (xi ).

(1.2.3)

i=1

P ROOF. Case 1. For n = 2 and r1 = r2 = 1/2, we have (1.2.1). For ri = 1/n, i = 1, . . . , n, inequality (1.2.3) becomes  n n 1 1 xi  f (xi ). f n n 

i=1

i=1

(1.2.4)

13

1.2. Jensen’s and Related Inequalities

First we prove (1.2.4) by using an idea of a proof from Peˇ cari´c [370]. Suppose 1 n+1 that (1.2.4) is valid for all k, 2  k  n. Denoting x = n+1 i=1 xi , we have 

 n+1 1  f (x) = f xi n+1 i=1   n  1 1 1 n−1 x + xn+1 =f xi + 2 n n n i=1     n  1 1 n−1 1 x + xn+1  xi + f f 2 n n n i=1   n  1 1 1  f (xi ) + (n − 1)f (x) + f (xn+1 ) , 2 n n i=1

which is 1  f (xi ), n+1 n+1

f (x) 

i=1

and the proof of (1.2.2) is complete by induction. Case 2. Since r1 , . . . , rn are nonnegative rational numbers there is a natural number m and nonnegative integers p1 , . . . , pn such that m = p1 + · · · + pn and ri = pmi , i = 1, . . . , n. Now, by Case 1, we have
f

(x1 + · · · + x1 ) + · · · + (xn + · · · + xn ) m





(f (x1 ) + · · · + f (x1 )) + · · · + (f (xn ) + · · · + f (xn )) , m

(1.2.5)

where in the first bracket there are p1 terms, and so on, in the nth bracket pn terms. Thus (1.2.5) reads as   n n  1 pi f (xi ), f pi x i  (1.2.6) m m i=1

i=1

and by taking pi /m = ri in (1.2.6) we get (1.2.3). The proof is complete.



R EMARK 1.2.1. Following Jensen, there came a series of papers giving conditions under which (1.2.3) is valid. If we remove some of the restrictions on the ri ,

14

Chapter 1. Inequalities Involving Convex Functions

thereby increasing the kinds of combinations of points x1 , . . . , xn under consideration, it is to be expected that the class of functions still satisfying Jensen’s inequality will be smaller. As an immediate consequence of Theorem 1.2.1 we have the following useful version of Jensen’s inequality. C OROLLARY 1.2.1. Let f : U ⊆ L → R is a convex mapping on convex set U of real linear space L, xi are in C, i = 1, . . . , n, and pi
0 with Pn = ni=1 pi > 0, then   n n 1  1  pi x i  pi f (xi ). (1.2.7) f Pn Pn i=1

i=1

In [367] Peˇcari´c has given a simple proof of the following form of the Jensen– Steffensen inequality. T HEOREM 1.2.2. Let x and p be two n-tuples of real numbers such that x is nonincreasing, xi ∈ [a, b], 1  i  n, and 0  Pk  Pn , k = 1, . . . , n − 1, Pn > 0, where Pk = ki=1 pi , k = 1, . . . , n. Then for every real-valued convex function f defined on [a, b],   n n 1  1  f pi x i  pi f (xi ). (1.2.8) Pn Pn i=1

i=1

P ROOF. Note that if each pi is positive, inequality (1.2.8) follows easily from the definition of a convex function. A convex function f is characterized by having a supporting line at each point, that is, f (z) − f (c)
M(z − c)

(1.2.9)

for all z and c, where M depends on c. (In fact M = f
(c) where f
(c) exists, and M is any number between f−
(c) and f+
(c) at the countable set where these are different.) Using (1.2.9) we can easily obtain the following known inequalities: f (z) − f (y)
M(z − y),

z
y
c,

f (z) − f (y)  M(z − y),

y  z  c,

where M is defined as above.

and (1.2.10)

15

1.2. Jensen’s and Related Inequalities

Let x and p satisfy the conditions of the Jensen–Steffensen inequality. Let x¯ = P1n ni=1 pi xi and let P k = Pn − Pk−1 . Then Pn (x1 − x¯n ) =

n 

pi (x1 − xi ) =

n 

i=2

j =2

n−1 

n−1 

(xj −1 − xj )P j
0,

so x¯  x1 . Similarly, Pn (x¯ − xn ) =

i=1

pi (xi − xn ) =

(xj − xj +1 )Pj
0,

j =1

so xn  x¯  x1 . Let m be such that x¯ ∈ [xm+1 , xm ]. Hereafter, M is to be given its value at c = x. ¯ We can easily show that the following identity is valid  n 1  1  pi f (xi ) pi x i − f Pn Pn 

i=1

=

m−1  i=1

  Pi M(xi − xi+1 ) − f (xi ) + f (xi+1 ) Pn

  Pm + M(xm − x) ¯ − f (xm ) + f (x) ¯ Pn   P m+1 + f (x) ¯ − f (xm+1 ) − M(x¯ − xm+1 ) Pn +

n−1    P i+1 f (xi ) − f (xi+1 ) − M(xi − xi+1 ) . Pn

(1.2.11)

i=m+1

Now, using (1.2.10) and (1.2.11) we get (1.2.8). The proof is complete.



Let f : I → R be a real-valued function and x = (x1 , . . . , xn ) ∈ I n , the expression
  1 1 (xi1 + · · · + xik ) f fk,n = fk,n (x) = n k k 1
i1 <···
is used by Gabler [123] to define “sequentially convex functions”. These functions

16

Chapter 1. Inequalities Involving Convex Functions

are a special case of convex functions. Gabler also gives the inequality fk,n (x)
fk+1,n (x),

k = 1, . . . , n − 1,

(1.2.12)

for sequentially convex functions. In the following theorem we present the result given by Peˇcari´c in [375] which gives a sequence of interpolating inequalities for the well-known Jensen inequality for convex functions. T HEOREM 1.2.3. Let f : I → R be a convex function and x = (x1 , . . . , xn ) ∈ I n . Let fk,n = fk,n (x, p) 1 = n−1 k−1

 Pn

 p i 1 x i 1 + · · · + pi k x i k , (pi1 + · · · + pik )f p i 1 + · · · + pi k


1
i1 <···
where pi are positive numbers and Pn =

n

fk,n (x, p)
fk+1,n (x, p),

i=1 pi .

Then

k = 1, . . . , n − 1,

(1.2.13)

is valid. P ROOF. Indeed, we have 
pi1 xi1 + · · · + pik+1 xik+1 (pi1 + · · · + pik+1 )f pi1 + · · · + pik+1 = (pi1 + · · · + pik+1 ) pi1 xi1 +···+pik+1 xik+1 −pij xij   k+1 j =1 (pi1 + · · · + pik+1 − pij ) pi1 +···+pik+1 −pij ×f k+1 j =1 (pi1 + · · · + pik+1 − pij )  (pi1 + · · · + pik+1 )  pi1 xi1 +···+pik+1 xik+1 −pij xij  k+1 j =1 (pi1 + · · · + pik+1 − pij )f pi1 +···+pik+1 −pij × k+1 j =1 (pi1 + · · · + pik+1 − pij ) =


k+1 pi1 xi1 + · · · + pik+1 xik+1 − pij xij 1 . (pi1 + · · · + pik+1 − pij )f k pi1 + · · · + pik+1 − pij j =1

17

1.2. Jensen’s and Related Inequalities

Therefore, we have 1 fk+1,n = n−1 k Pn



(pi1 + · · · + pik+1 )

1
i1 <···



pi1 xi1 + · · · + pik+1 xik+1 ×f pi1 + · · · + pik+1 1  n−1 k k Pn



k+1  (pi1 + · · · + pik+1 − pij )

1
i1 <···

×f

1 = n−1 k−1 Pn



pi1 xi1 + · · · + pik+1 xik+1 − pij xij



pi1 + · · · + pik+1 − pij 
p i 1 x i 1 + · · · + pi k x i k (pi1 + · · · + pik )f pi 1 + · · · + pi k



1
i1 <···
= fk,n . 

The proof is complete.

R EMARK 1.2.2. We note that inequality (1.2.12) is an interpolating inequality for Jensen’s inequality for convex functions. Indeed, we have 

n 1  f pi x i Pn

 = fn,n  · · ·  fk+1,n  fk,n  · · ·  f1,n

i=1

=

n 1  pi f (xi ). Pn

(1.2.14)

i=1

The above results are also valid for convex functions defined on arbitrary real linear space, and if pi , i = 1, . . . , n, are rational numbers, they are also valid for midconvex functions defined on an arbitrary real linear space. Let f : C ⊂ X → R be a convex function on convex set C of real linear space X, xi ∈ C and pi
0, i = 1, . . . , n, with Pn = ni=1 pi > 0. Let T be a nonempty set and let m be a natural number with m
2. Suppose that α1 , . . . , αm : T → R are m functions with the property that αi (t)
0 and α1 (t) + · · · + αm (t) = 1 for all t in T and i = 1, . . . , m.

18

Chapter 1. Inequalities Involving Convex Functions

Consider the sequence of functions defined by (see [90])   n n   1  1  [m] pi1 f α1 (t)xi1 + α2 (t) + · · · + αm (t) pi x i , F1 (t) = Pn Pn i1 =1

F2[m] (t) =

1 Pn2

n 

i=1

 pi1 pi2 f α1 (t)xi1 + α2 (t)xi2

i1 ,i2 =1

 n   1  + α3 (t) + · · · + αm (t) pi x i , Pn i=1

.. . [m] Fm−1 (t)

=

1

n 

Pnm−1

i1 ,...,im−1 =1

 pi1 · · · pim−1 f α1 (t)xi1 + · · · + αm−1 (t)xim−1 n 1  + αm (t) pi x i Pn



i=1

and F [m] (t) =

1 Pnm

n 

  pi1 · · · pim f α1 (t)xi1 + · · · + αm (t)xim ,

i1 ,...,im =1

where t is in T , n
1. It is clear that the above mappings are well defined for all t in T . The following theorem is proved in [90]. T HEOREM 1.2.4. Let f , pi , xi , i = 1, . . . , n, and m be as above. Then (i) we have the inequalities   n n 1  1  [m] [m] [m] f pi xi  F1 (t)  · · ·  Fm−1 (t)  F (t)  pi f (xi ) Pn Pn i=1 i=1 (1.2.15) for all t in T ; (ii) if there exists a t0 ∈ T so that α1 (t0 ) = · · · = αp (t0 ) = 0, 1  p  m − 1, then   n 1  [m] [m] inf F (t) = Fj (t0 ) = f pi x i (1.2.16) t∈T j Pn i=1

19

1.2. Jensen’s and Related Inequalities

for all 1  j  p; (iii) if there exists a t1 ∈ T so that αp (t1 ) = 1, then sup Fj[m] (t) = sup F [m] (t) = Fj[m] (t1 ) = t∈T

t∈T

 inf

(1.2.17)

i=1

and

t∈T

n 1  pi f (xi ) Pn

Fq[m] (t) = Fq[m] (t1 ) = f

 n 1  pi x i , Pn

(1.2.18)

i=1

for all p  j  m − 1 and 1  q  p − 1; (iv) if T is a convex subset of a linear space Y and αi , i = 1, . . . , n, satisfies the condition αi (γ t1 + βt2 ) = γ αi (t1 ) + βαi (t2 ) for all t1 , t2 ∈ T and γ , β
0 with γ + β are convex mappings in T .

= 1, then Fj[m] , 1  j

(AF)  m − 1, and F [m]

P ROOF. (i) By Jensen’s inequality, we have  F1[m] (t)


f  =f

  n n   1  1  pi1 xi1 α1 (t) + α2 (t) + · · · + αm (t) pi x i Pn Pn i1 =1

n 1  pi x i Pn

i=1



i=1

for all t in T , which shows the first inequality in (1.2.15). Now, suppose that 1  j  m − 2 and t ∈ T . Then, by Jensen’s inequality, we have Fj[m] +1 (t) =

1 j +1

Pn



 pi1 · · · pij +1 f α1 (t)xi1 + · · · + αj +1 (t)xj +1

i1 ,...,ij +1 =1 n   1  + αj +2 (t) + · · · + αm (t) pi x i Pn i=1



20

Chapter 1. Inequalities Involving Convex Functions






n 

1 j

Pn

pi1 · · · pij f α1 (t)xi1 + · · · + αj (t)xij

i1 ,...,ij =1

 +

 n 1  pij +1 xij +1 αj +1 (t) Pn ij +1 =1

n  1   pi x i + αj +2 (t) + · · · + αm (t) Pn



i=1

= Fj[m] (t)

which shows that the sequence {Fj[m] (t)}m−1 j =1 is monotonous nondecreasing for all t in T . On the other hand, by Jensen’s inequality, we also have  n  1 F [m] (t)
m−1 pi1 · · · pim−1 f α1 (t)xi1 + · · · + αm−1 (t)xim−1 Pn i1 ,...,im−1 =1    n 1  + pim xim αim (t) Pn =

im =1

[m] Fm−1 (t)

for all t in T . Finally, by the convexity of f on C, one has   f α1 (t)xi1 + · · · + αm (t)xim  α1 (t)f (xi1 ) + · · · + αm (t)f (xim ) for all t in T and xi ∈ C, i = 1, . . . , m. Multiplying by pi1 , . . . , pim and summing in i1 , . . . , im from 1 to n, we get n    pi1 · · · pim f α1 (t)xi1 + · · · + αm (t)xim i1 ,...,im =1



n 

  pi1 · · · pim α1 (t)f (xi1 ) + · · · + αm (t)f (xim )

i1 ,...,im =1

= α1 (t)Pnm−1

n 

pi1 f (xi1 ) + · · · + αm (t)Pnm−1

i1 =1

= Pnm−1

n  i=1

pi f (xi )

n  im =1

pim f (xim )

21

1.2. Jensen’s and Related Inequalities

for all t ∈ T , which is equivalent with the last part of inequality (1.2.15). The proof of statement (i) is finished. (ii) If α1 (t0 ) = · · · = αp (t0 ) = 0, 1  p  m − 1, then 1 Fp[m] (t0 ) = p Pn =

1 p Pn 

=f



n  i1 ,...,ip =1 n 

n   1  pi1 · · · pip f αp+1 (t0 ) + · · · + αm (t0 ) pi x i Pn

 pi 1 · · · pi p f

i1 ,...,ip =1

n 1  pi x i Pn



i=1



i=1



n 1  pi x i . Pn i=1

Since



 n 1  pi xi  F1[m] (t0 )  · · ·  Fp[m] (t0 ), f Pn i=1

statement (ii) is proved. (iii) If αp (t1 ) = 1, then αs (t1 ) = 0 for all s = p, 1  s  m. Thus, for p  j  m − 1, one has Fj[m] (t1 ) =

=

n 

1 j

Pn

pi1 · · · pij f (xij )

i1 ,...,ij =1

n 1  pi f (xi ) Pn i=1

= F [m] (t1 ). If 1  q  p − 1, we have Fq[m] (t1 )

1 = q Pn  =f



n  i1 ,...,iq =1

1 Pn

n 

n 1  pi1 . . . piq f pi x i Pn



pi x i ,

i=1

which shows the statements (1.2.17) and (1.2.18).

i=1



22

Chapter 1. Inequalities Involving Convex Functions

(iv) Let γ , β
0 with γ + β = 1 and t1 , t2 ∈ T . Then, by the convexity of f , we have Fj[m] (γ t1 + βt2 ) =

=

1 j

Pn

1 j

Pn

n 

 pi1 · · · pij f α1 (γ t1 + βt2 )xi1 + · · · + αj (γ t1 + βt2 )xij

i1 ,...,ij =1

n 

 + αj +1 (γ t1 + βt2 ) + · · · n  1  pi x i + αm (γ t1 + βt2 ) Pn i=1  



pi1 · · · pij f γ α1 (t1 )xi1 + · · · + αj (t1 )xij

i1 ,...,ij =1 n   1  + αj +1 (t1 ) + · · · + αm (t1 ) pi x i Pn i=1 



+ β α1 (t2 )xi1 + · · · + αj (t2 )xij n   1  + αj +1 (t2 ) + · · · + αm (t2 ) pi x i Pn



i=1

 γ Fj[m] (t1 ) + βFj[m] (t2 ) for all 1  j  m − 1, which shows that Fj[m] is convex on T .

The fact that F [m] is convex on T goes likewise, we omit the details. The proof of the theorem is finished.  The classical inequality between the weighted arithmetic and geometric means states: If x1 , . . . , xn and p1 , . . . , pn are positive real numbers, then 

n  i=1

where Pn =

n

i=1 pi .

1/Pn p xi i



n 1  pi x i , Pn

(1.2.19)

i=1

Equality holds in (1.2.19) if and only if x1 = · · · = xn .

23

1.2. Jensen’s and Related Inequalities

The following corollary given in [90] improves inequality (1.2.19). C OROLLARY 1.2.2. Let f : C ⊂ X → (0, ∞) be a convex function on a convex subset C of a linear space X which is also logarithmically concave on C. Then for all xi , pi , αj and m as above, we have the following refinement of the arithmetic mean–geometric mean inequality: n 1  [m] pi f (xi )
F [m] (t)
Fm−1 (t)
· · ·
F2[m] (t) Pn i=1   n 1  [m]
F1 (t)f pi x i Pn i=1

[m] [m] [m]
G[m] (t) 1 (t)
G2 (t)
· · ·
Gm−1 (t)
G 1/Pn  n  p f (xi ) i (1.2.20)
i=1

for all t in T , where  G[m] 1 (t)

= 

G[m] 2 (t)

=



n 

f

pi1

i1 =1 n 

n   1  pi x i α1 (t)xi1 + α2 (t) + · · · + αm (t) Pn

f

,

i=1

 pi1 pi2

1/Pn

α1 (t)xi1 + α2 (t)xi2

i1 ,i2 =1 n   1  + α3 (t) + · · · + αm (t) pi x i Pn

1/Pn2

i=1

.. . G[m] m−1 (t)

=



n 

 f pi1 ···pim−1 α1 (t)xi1 + · · · + αm−1 (t)xim−1

i1 ,...,im−1 =1 n 1  + αm (t) pi x i Pn i=1

1/Pnm−1

,

24

Chapter 1. Inequalities Involving Convex Functions

and  [m]

G

n 

(t) =

f

pi1 ···pim

1/Pnm   α1 (t)xi1 + · · · + αm (t)xim ,

i1 ,...,im =1

where t is in T . P ROOF. The argument of the second part of (1.2.20) follows by (1.2.15) for the convex mapping–log f and we omit the details.  R EMARK 1.2.3. If in the above corollary we choose f : (0, ∞) → (0, ∞), f (x) = x, we obtain the following improvement of the arithmetic mean and geometric mean inequality n 1  pi x i Pn i=1









n  i1 =1

pi 1/Pn

n   1  pi x i αi (t)xi1 + α2 (t) + · · · + αm (t) Pn

n 

1

i=1

 α1 (t)xi1 + α2 (t)xi2

i1 ,i2 =1 n   1  + α3 (t) + · · · + αm (t) pi x i Pn

pi

p 1 i2

1/Pn2

pi

···pim−1 1/Pnm−1

i=1


···





n 

i1 ,...,im−1 =1



n 





i=1

for all t in T .

1/Pn

p xi i

1

i=1

 p ···p α1 (t)xi1 + · · · + αm (t)xim i1 im

i1 ,...,im =1 n 

n 1  pi x i α1 (t)xi1 + · · · + αm (t) Pn

1/Pnm

25

1.2. Jensen’s and Related Inequalities

In view of the important role played by Jensen’s inequality in analysis, many mathematicians have tried not only to establish (1.2.3) or (1.2.7) in a variety of ways but also to find different extensions, refinements and counterparts, see [90, 92,207,218,219,370,373] where further references are given. The corresponding integral analogues of the well-known Jensen’s inequality are also widely used in the mathematical analysis and applications. The following integral analogue of Jensen’s inequality is adapted from [174, p. 133]. T HEOREM 1.2.5. Let f : I = [a, b] → R be a convex function. Let h : I → (0, ∞) and u : I → R+ = [0, ∞) are integrable functions. Then
b f

b



h(t)u(t) dt

b a h(t) dt

a



a

h(t)f (u(t)) dt

b a h(t) dt

(1.2.21)

provided that all the integrals in (1.2.21) are meaningful. P ROOF. Let γ > 0 be fixed. From the convexity of f it follows that there exists a k ∈ R such that f (t) − f (γ )
k(t − γ ) for all t
0. Putting t = u(t) and multiplying the resulting inequality by h(t) we obtain after integration over [a, b] that 

b

  h(t)f u(t) dt − f (γ )

a



b

h(t) dt a



b


k

 h(t)u(t) dt − γ

a

b

 h(t) dt .

(1.2.22)

a

Inequality (1.2.21) now follows by putting

b γ= The proof is complete.

h(t)u(t) dt .

b a h(t) dt

a



In [411] Steffensen uses his inequality which is now known in the literature as Steffensen’s inequality (see [211, p. 107]) to derive a generalization of Jensen’s inequality for convex functions. A corresponding inequality for integrals is also given in [411], see [211, p. 109]. For another generalization of Jensen’s inequality

26

Chapter 1. Inequalities Involving Convex Functions

and its integral analogue we refer the interested readers to Ciesieski [63] where analogous results are given for functions of two variables. In [31] Boas has also obtained some interesting results concerning Jensen’s inequality and its integral analogues. Let f : I → R be a continuous convex function, where I is the range of the continuous function g : [a, b] → R. The following results are valid. Jensen inequality. The inequality
b f

a

g(x) dλ(x)

b a dλ(x)

b

 

a

f (g(x)) dλ(x)

b a dλ(x)

(1.2.23)

holds if f is continuous, provided that λ is nondecreasing, bounded, and λ(a) = λ(b). Jensen–Steffensen inequality. Inequality (1.2.23) holds if f is continuous and monotonic (in either sense) provided that λ is either continuous or of bounded variation, and it satisfies λ(a)  λ(x)  λ(b),

x ∈ [a, b];

λ(b) > λ(a).

Jensen–Boas inequality. Inequality (1.2.23) holds if λ is continuous or of bounded variation and satisfies λ(a)  λ(x1 )  λ(y1 )  λ(x2 )  · · ·  λ(yn−1 )  λ(xn )  λ(b) for all xk in (yk−1 , yk ), y0 = a, yn = b, and λ(b) > λ(a), provided that f is continuous and monotonic (in either sense) in each of the n − 1 intervals (yk−1 , yk ). For n = 1, we obtain the Jensen–Steffensen inequality from the Jensen–Boas inequality, and in the limit as n → ∞, λ would increase and f would be required to be continuous, thus Jensen’s inequality is a limiting case of the Jensen–Boas inequality. In 1982, Peˇcari´c [367] (see also [369]) has given an interesting and short proof of the Jensen–Boas inequality. In his proof he used only Jensen’s inequality for sums, that is,   n n 1  1  f pi x i  pi f (xi ), (1.2.24) Pn Pn i=1 i=1 where pi
0 with Pn = ni=1 pi > 0, xi ∈ I for i = 1, . . . , n, and the Jensen– Steffensen inequality. Inequality (1.2.24) can easily be obtained from (1.2.23).

27

1.2. Jensen’s and Related Inequalities

If λ(a) < λ(y1 ) < λ(y2 ) < · · · < λ(yn−1 ) < λ(b), then from the Jensen– Steffensen inequality we have the inequalities
yk g(x) dλ(x)  yk f (g(x)) dλ(x) yk−1 y

yk , k = 1, . . . , n, f  k−1 yk dλ(x) yk−1 yk−1 dλ(x) that is, f (tk ) 

1 pk



yk

  f g(x) dλ(x),

k = 1, . . . , n,

yk−1

with the notation 

yk

yk

pk =

tk =

dλ(x), yk−1

yk−1 g(x) dλ(x)

yk , yk−1 dλ(x)

k = 1, . . . , n.

Since pk > 0 and tk ∈ I , k = 1, . . . , n, from Jensen’s inequality (1.2.24) we have
b a

f

g(x) dλ(x)

b a dλ(x)



 n
n pk t k pk f (tk ) k=1 n  k=1 n k=1 pk k=1 pk

yk n k=1 pk (1/pk ) yk−1 f (g(x)) dλ(x) n  k=1 pk

b f (g(x)) dλ(x) . = a b a dλ(x)

=f

If λ(yj −1 ) = λ(yj ) for some j , then dλ(x) = 0 on [yj −1 , yj ] and  a

b

g(x) dλ(x) =

n  k=1,k=j

 pk t k , a

b

dλ(x) =

n 

pk ,

k=1,k=j

so, using (1.2.24), we can also easily prove that the Jensen–Boas inequality is valid. For some interesting variants and generalizations of Jensen’s integral inequality, see [211] and the references cited therein. In 1975, Mitrinovi´c and Vasi´c [214] use the so-called “centroid method” to obtain two new inequalities which are complementary to (the discrete version of ) Jensen’s inequality for convex functions. In [19] Beesack presents a general version of such inequalities using the same geometric ideas used in [214] but not using the centroid method itself. The results given in [19] extend the domain of

28

Chapter 1. Inequalities Involving Convex Functions

the inequalities (even in the discrete case) and clarify the value of the constant appearing in the inequality. The main results in [19] are given in the following theorems. T HEOREM 1.2.6. Let ν be a nonnegative measure on σ -algebra of subsets of a set D and let q, f be real ν-measurable functions on D such that q(x) > 0,

−∞ < x1  f (x)  x2 < ∞ for all x ∈ D and D q dν = 1. Let φ be a convex function on I = [x1 , x2 ] such that φ

(x)
0 with equality for most isolated points of I (so φ is strictly convex on I ). If either (i) φ(x) > 0 for all x ∈ I or (i
) φ(x) > 0 for x1 < x < x2 , with either φ(x1 ) = 0, φ
(x1 ) = 0 or φ(x2 ) = 0, φ
(x2 ) = 0, or (ii) φ(x) < 0 for all x ∈ I or (ii
) φ(x) < 0 for x1 < x < x2 , with precisely one of φ(x1 ) = 0, φ(x2 ) = 0, then
   qφ(f ) dν  λφ qf dν (1.2.25) D

D

holds for some λ > 1 in cases (i) and (i
) or λ ∈ (0, 1) in cases (ii) and (ii
). More precisely, a value of λ (depending on x1 , x2 , φ) for (1.2.25) may be determined as follows. Set µ = [φ(x2 ) − φ(x1 )]/(x2 − x1 ). If µ = 0, let x = x¯ be the unique ¯ suffices solution of the equation φ
(x) = 0, x1 < x¯ < x2 , then λ = φ(x1 )/φ(x) for (1.2.25). In case µ = 0, let x = x¯ be the unique solution in [x1 , x2 ] of the equation   (1.2.26) g(x) = µφ(x) − φ
(x) φ(x1 ) + µ(x − x1 ) = 0, ¯ suffices for (1.2.25). Moreover, we have x1 < x¯ < x2 in the then λ = µ/φ
(x) cases (i) and (ii). Moreover, equality holds in (1.2.25) if and only if f (x) = xi for x ∈ Di where D1 , D2 are ν-measurable subsets of D such that D = D1 ∪ D2 and x¯ = x1 D1 q dν + x2 D2 q dν. P ROOF. We note that both integrals in (1.2.25) exist since both f and φ(f ) are bounded measurable functions. In all cases, φ
(x) is continuous and strictly increasing on I so that, by the mean value theorem applied to µ, we have φ
(x1 ) < µ < φ
(x2 ).

(1.2.27)

Consider the pairs A(x1 , φ(x1 )), B(x2 , φ(x2 )) on the convex curve y = φ(x). The equation of the chord AB is y = φ(x1 ) + µ(x − x1 ) ≡ m(x).

29

1.2. Jensen’s and Related Inequalities

We also consider the family of convex curves with equations y = λφ(x), λ > 0, and we show there is a unique λ > 0 such that the curve will be tangent to the line AB at a point P(x, ¯ λφ(x)) ¯ with x¯ ∈ I . (In fact, x1 < x¯ < x2 in cases (i), (ii).) This case holds if and only if the pair of equations, λφ
(x) = µ,

(1.2.28)

λφ(x) = m(x),

(1.2.29)

have a unique solution (x, ¯ λ) with x¯ ∈ I , λ > 0. In case µ = 0, equations (1.2.28) and (1.2.29) reduce to λφ
(x) = 0, λφ(x) = φ(x1 ). If φ(x1 ) = 0, these equations have the unique solution (x, ¯ λ) determined by φ
(x) = 0, λ = φ(x1 )/φ(x) ¯ where we observe that x1 < x¯ < x2 , by the mean value theorem applied to µ. The case φ(x1 ) = 0 is impossible when µ = 0 since then φ(x2 ) = 0 also, which is not the case. Note that λ > 0, when φ(x1 ) = 0. When µ = 0 we shall first consider only the cases (i) and (ii). By (1.2.28), λ = 0 and eliminating λ from the pair of equations (1.2.28), (1.2.29), we see that x = x¯ must be a solution of equation (1.2.26). We now show that this equation has a unique solution on (x1 , x2 ). First note that   g(x1 ) = φ(x1 ) µ − φ
(x1 ) ,

  g(x2 ) = φ(x2 ) µ − φ
(x2 ) .

Since φ(x1 ), φ(x2 ) have the same sign, it follows from (1.2.27) that g(x1 ), g(x2 ) have opposite sign. Thus g has at least one zero on (x1 , x2 ). Moreover, g
(x) = −m(x)φ

(x) does not change sign on [x1 , x2 ]. For, the linear function m(x) has m(xi ) = φ(xi ) for i = 1, 2 and hence is either always positive in case (i) or always negative in case (ii), on [x1 , x2 ]. It follows that g is strictly a monotonic function on [x1 , x2 ], and thus equation (1.2.26) has a unique solution x = x¯ ∈ (x1 , x2 ). Moreover, φ
(x) ¯ = 0 since if it were then setting x = x¯ in (1.2.26) it would imply 0 = µφ(x), ¯ which is impossible when µ = 0 because φ(x) = 0 on (x1 , x2 ). If we now take λ = µ/φ
(x) ¯ then it is easy to see that the pair (x, ¯ λ) satisfies equations (1.2.28), (1.2.29) and is the only such pair, with x1 < x¯ < x2 , 
x¯ − x1 x¯ − x1 λφ(x) ¯ = φ(x1 ) + µ(x¯ − x1 ) = 1 − φ(x1 ) + φ(x2 ) x2 − x1 x2 − x1 or λφ(x) ¯ > φ(x). ¯

(1.2.30)

30

Chapter 1. Inequalities Involving Convex Functions

From this idea, it follows that λ > 1 in case (i) and λ < 1 in case (ii). It remains to show that λ > 0 in case (ii) when µ = 0. This result follows from (1.2.29) since λφ(x) ¯ = m(x) ¯ and, as noted above, φ and m have the same sign on I . As for the cases (i
) and (ii
), which are relaxed versions of (i) and (ii), respectively, we omit details but note that in case (i
), if φ(x1 ) = 0, φ
(x1 ) = 0 then we necessarily have φ
(x1 ) > 0 and µ > 0, while if φ(x2 ) = 0, φ
(x2 ) = 0 we must have µ < φ
(x2 ) < 0. For the first of these conditions, we have g(x) = µφ(x) − µ(x − x1 )φ
(x) = µ(x − x1 )[φ
(X) − φ
(x)] for x1 < X < x  x2 , where g(x) < 0 for x1 < x  x2 , so x¯ = x1 is the unique solution of (1.2.26) on [x1 , x2 ], and equations (1.2.28), (1.2.29) clearly have the unique solution x = x1 on [x1 , x2 ] with λ = µ/φ
(x1 ) > 1. A similar analysis applies to the second case of (i
), where we now find x¯ = x2 and λ = µ/φ
(x2 ) > 1. For the two cases of (ii
), we observe in the first that φ
(x1 ) < 0 must hold, that x¯ = x1 , 0 < λ = µ/φ
(x1 ) < 1, and in the second that φ
(x2 ) > 0 must hold and x¯ = x2 , 0 < λ = µ/φ
(x2 ) < 1. It only remains to prove inequality (1.2.25) with the value of λ determined above. To prove this point we note that since the line AB is tangent to the graph of the strictly convex (since λ > 0) function λφ(x) at the point P, we have for all x ∈ I , φ(x2 ) − φ(x1 ) (x − x1 ), λφ(x)
m(x) = φ(x1 ) + x2 − x1

with equality only for x = x. ¯ We may take x = D qf dν since this x ∈ I . This gives
  
 φ(x2 ) − φ(x1 ) qf dν
φ(x1 ) + qf dν − x1 λφ x2 − x1 D D    φ(x2 ) − φ(x1 ) φ(x1 ) + = (f − x1 ) dν x2 − x1 D 
qφ(f ) dν, D

precisely as at (1.2.30). Equality holds for the last step if and only if f (x) = x1 or x2 on ν-measurable subsets D1 or D2 of D. Hence equality holds in (1.2.25) precisely for such f where, in addition,    qf dν = x1 q dν + x2 q dν. x¯ = D



D1

D2

In case the measure Q(A) ≡ A q dν is atomless, we observe that given any  x¯ ∈ [x1 , x2 ] such sets D1 , D2 exist but are not in general unique.

31

1.2. Jensen’s and Related Inequalities

C OROLLARY 1.2.3. Let all the hypotheses of Theorem 1.2.6 hold except that now φ is concave on I with φ

(x)  0 with equality for at most isolated points of I . Then
   qφ(f ) dν
λφ qf dν , (1.2.31) D

D

where λ is determined precisely as before. Now, λ > 1 holds if φ(x) < 0 on (x1 , x2 ) and 0 < λ < 1 if φ(x) > 0 on (x1 , x2 ). Equality holds in (i
) for precisely the same f (if any) as in Theorem 1.2.6. This point follows from the Theorem 1.2.6 applied to the convex function φ1 = −φ. T HEOREM 1.2.7. Let ν, D, q, f , x1 , x2 be as in Theorem 1.2.6 and let φ(x) be any differentiable function on I = [x1 , x2 ] such that φ
(x) exists and is strictly increasing on I . Then we have


 qφ(f ) dν  λ + φ D

 qf dν

(1.2.32)

D

for some λ, satisfying 0 < λ < (x2 − x1 )[µ − φ
(x1 )], where µ=

[φ(x2 ) − φ(x1 )] . x2 − x1

More precisely, λ may be determined for (1.2.32) as follows. Let x = x¯ be the unique solution of the equation φ
(x) = µ, x1 < x¯ < x2 , then ¯ + µ(x¯ − x1 ) λ = φ(x1 ) − φ(x) suffices in (1.2.32). Equality holds in (1.2.32) only for f (x) = xi , x ∈ Di , where D1 , D2 are ν-measurable subsets of D such that D = D1 ∪ D2 and   q dν + x2 q dν, x¯ = x1 D1

D2

when such sets exist. P ROOF. The proof is similar to that given for Theorem 1.2.6 but is much easier. Using the same notation as before, we again have (1.2.27) and now look for the convex curve with the equation y = λ + φ(x) which is tangent to the chord AB

32

Chapter 1. Inequalities Involving Convex Functions

at a point (x, ¯ y) ¯ with x1 < x¯ < x2 . This result will occur if and only if x, ¯ λ now satisfy the pair of equations, φ
(x) = µ,

(1.2.33)

λ + φ(x) = m(x).

(1.2.34)

Since φ
is strictly increasing on I it follows from the mean value theorem that equation (1.2.33) has a unique solution x¯ ∈ (x1 , x2 ), and then λ is uniquely determined from (1.2.34) as λ = m(x) ¯ − φ(x) ¯ = φ(x1 ) − φ(x) ¯ + µ(x¯ − x1 )   = (x¯ − x1 ) µ − φ
(X) , where x1 < X < x. ¯ From this we also obtain   0 < λ < (x2 − x1 ) µ − φ
(x1 ) . The proof of inequality (1.2.32) is just as before since we now have, with this value of λ, λ + φ(x)
m(x) = φ(x1 ) +

φ(x2 ) − φ(x1 ) (x − x1 ) x2 − x1

for all x ∈ I . Again, we set x = D q dν and use the strict convexity of φ on I to obtain (1.2.32). The equality conditions follow precisely as in Theorem 1.2.6.  C OROLLARY 1.2.4. Let all the hypotheses of Theorem 1.2.7 be satisfied except that φ
(x) is strictly decreasing on I . Then 
  qf dν  λ + qφ(f ) dν, (1.2.35) φ D

where

D

  0 < λ < (x2 − x1 ) φ
(x1 ) − µ

with [φ(x2 ) − φ(x1 )] . x2 − x1 In fact, we may take λ = φ(x) ¯ − φ(x1 ) − µ(x¯ − x1 ), where x = x¯ is the unique solution of the equation φ
(x) = µ, x1 < x¯ < x2 . Equality holds in (1.2.35) under precisely the same condition as in (1.2.32). µ=

33

1.3. Jessen’s and Related Inequalities

To prove this result we need to apply Theorem 1.2.7 to the function φ1 = −φ for which µ1 = −µ, etc. For interesting remarks and applications of Theorems 1.2.6 and 1.2.7 and their comparisons with other inequalities, we refer the reader to Beesack [19] and some of the references cited therein.

1.3 Jessen’s and Related Inequalities This section deals with a generalization of Jensen’s inequality for convex functions due to Jessen [166] involving isotonic linear functionals. Some general inequalities complementary to Jessen’s inequality given by Beesack and Peˇcari´c [20] and Peˇcari´c and Beesack [376] for convex functions involving isotonic linear functionals are also given. Let E be a nonempty set and L be a linear class of real-valued functions g : E → R having the following properties: (L1 ) f, g ∈ L → (af + bg) ∈ L for all a, b ∈ R and (L2 ) 1 ∈ L, that is, if f (t) = 1, t ∈ E, then f ∈ L. We also consider isotonic linear functionals A : L → R. That is, we suppose (A1 ) A(af + bg) = aA(f ) + bA(g) for f , g ∈ L, a, b ∈ R and (A2 ) f ∈ L, f (t)
0 on E → A(f )
0 (A is isotonic). We note that common examples of such isotonic linear functionals A are given by:   A(g) = g dµ or A(g) = pk g k , E

k∈E

where µ is a positive measure on E in the first case and E is a subset of natural numbers with pk > 0 in the second case. In 1931, Jessen [166] gives the following generalization of the Jensen inequality for convex functions (see [20, p. 537], also [390, p. 33]). T HEOREM 1.3.1. Let L satisfy properties (L1 ), (L2 ) on a nonempty set E, and suppose φ is a convex function on an interval I ⊂ R. If A is any isotonic linear functional with A(1) = 1 then, for all g ∈ L such that φ(g) ∈ L, we have A(g) ∈ I and     φ A(g)  A φ(g) . (1.3.1) P ROOF. First observe that if I = [α, β] and g ∈ L with φ(g) ∈ L, then we must have α  g(t)  β, t ∈ E, where α = A(α − 1)  A(g)  β, so A(g) ∈ I . Since

34

Chapter 1. Inequalities Involving Convex Functions

φ is convex on I , for any x0 ∈ I there is a constant m = m(x0 ) such that φ(x)
φ(x0 ) + m(x − x0 ),

α ∈ I.

In this inequality, set x = g(t), x0 = A(g), and apply the functional A to obtain       A φ(g)
φ A(g) + m A(g) − A(g) , 

proving (1.3.1).

We now give three basic lemmas established in [20] which are complements of Jessen’s inequality (1.3.1), in that they are inequalities of the form A(φ(g))  χ(A(g)) for appropriate χ . L EMMA 1.3.1. Let φ be convex on I = [m, M], −∞ < m < M < ∞, let L satisfy conditions (L1 ), (L2 ) and let A be any isotonic linear functional on L with A(1) = 1. Then, for all g ∈ L such that φ(g) ∈ L (so m  g(t)  M for all t ∈ E), we have   (M − A(g))φ(m) + (A(g) − m)φ(M) A φ(g)  . (1.3.2) M −m P ROOF. From the definition of convex function, φ(v) 

v−u w−v φ(u) + φ(w), w−u w−u

u  v  w, u < w.

Now, let u = m, v = g(t), w = M to obtain   M − g(t) g(t) − m φ g(t)  φ(m) + φ(M), M −m M −m

t ∈ E.

Since A satisfies (A1 ), (A2 ) and A(k) = k holds for all constants k, (1.3.2) follows.  L EMMA 1.3.2. (a) Let L satisfy conditions (L1 ), (L2 ) and A satisfy conditions (A1 ), (A2 ), and A(t) = 1. Suppose φ is convex on [m, M], −∞ < m < M < ∞, such that φ

(x)
0 with equality for at most isolated points of I (so that φ is strictly convex on I ). Suppose that either (i) φ(x) > 0 for all x ∈ I or (i
) φ(x) > 0 for m < x < M with either φ(m) = 0, φ
(m) = 0 or φ(M) = 0, φ
(M) = 0; or (ii) φ(x) < 0 for all x ∈ I or (ii
) φ(x) < 0 for m < x < M with precisely one of φ(m) = 0, φ(M) = 0. Then, for all g ∈ L such that φ(g) ∈ L (so m  g(t)  M for all t ∈ E),     A φ(g)  λφ A(g) (1.3.3)

1.3. Jessen’s and Related Inequalities

35

holds for some λ > 1 in cases (i) and (i
) or λ ∈ (0, 1) in cases (ii) and (ii
). More precisely, a value of λ (depending only on m, M, φ) for (1.3.3) may be determined as follows. Set µ = (φ(M) − φ(m))/(M − m). If µ = 0, let x = x¯ be the unique solution of the equation φ
(x) = 0, m < x¯ < M, then λ = φ(m)/φ(x) ¯ suffices for (1.3.3). If µ = 0, let x = x¯ be the unique solution in [m, M] of the equation   µφ(x) − φ
(x) φ(m) + µ(x − m) = 0, then λ = µ/φ
(x) ¯ suffices for (1.3.3). Moreover, we have m < x¯ < M in the cases (i) and (ii). (b) Let all the hypotheses of (a) hold except that now φ is concave on I with φ

(x)  0, with equality for at most isolated points of I . Then the reverse inequality to (1.3.3) holds, where λ is determined precisely as before. Now λ > 1 holds if φ(x) < 0 on (m, M) and 0 < λ < 1 if φ(x) > 0 on (m, M). P ROOF. (a) As in [212] (see also [19]) we consider the points B(m, φ(m)) and C(M, φ(M)) on the convex curve y = φ(x). The equation of the chord BC is y = φ(m) + µ(x − m) ≡ h(x). By Lemma 1.3.1, we obtain A(φ(g))  h(A(g)). If we consider the family of convex curves with equations y = λφ(x), λ > 0, we can show as in [214] (or [19]) that there is a unique λ > 0 which satisfies the conditions stated in the lemma such that the curve will be tangent to the chord BC. Hence h(y)  λφ(y) for all y ∈ I . Taking y = A(g) it gives       A φ(g)  h A(g)  λφ A(g) , proving (1.3.3). (b) follows when (a) is applied to the convex function φ1 = −φ.



R EMARK 1.3.1. It is clear that the last inequality in the above proof constitutes a refinement of (1.3.3). L EMMA 1.3.3. (a) Let L, A and g be as in Lemma 1.3.2, and let φ(x) be any differentiable function on I = [m, M] such that φ
(x) exists and is strictly increasing on I . Then we have     A φ(g)  λ + φ A(g) (1.3.4) for some λ satisfying 0 < λ < (M − m){µ − φ
(m)}, where µ = (φ(M) − φ(m))/ (M − m). More precisely, λ may be determined for (1.3.4) as follows. Let x = x¯

36

Chapter 1. Inequalities Involving Convex Functions

be the unique solution of the equation φ
(x) = µ, m < x¯ < M. Then λ = φ(m) − φ(x) ¯ + µ(x¯ − m) suffices in (1.3.4). (b) Let all the hypotheses of (a) be satisfied except that φ
(x) is strictly decreasing on I . Then     φ A(g)  λ + A φ(g) , where 0 < λ < (M − m){φ
(m) − µ} with µ as in (a). In fact we may take λ = φ(x) ¯ − φ(m) − µ(x¯ − m) with x¯ as in (a). P ROOF. (a) The proof is similar to that of Lemma 1.3.2. Using Lemma 1.3.1 we also have A(φ(g))  h(A(g)), where y = h(x) is the equation of the chord joining B(m, φ(m)) to C(M, φ(M)). Now we consider the family of curves with equations y = λ + φ(x). We can show precisely as in [214] or [19], that there is a unique λ > 0 satisfying the stated conditions such that the curve will be tangent to the line BC. Therefore h(A(g))  λ + φ(A(g)), so       A φ(g)  h A(g)  λ + φ A(g) , proving (1.3.4). (b) follows when (a) is applied to convex function φ1 = −φ.



R EMARK 1.3.2. The last inequalities of the proof again constitute a refinement of (1.3.4). R EMARK 1.3.3. Lemmas 1.3.2 and 1.3.3 are generalizations of results from [214] and [19]. In [214] the special case, n pi g i , A(g) = i=1 n i=1 pi

pi > 0,

was considered and conditions for equality to hold in (1.3.3) were given. The paper [19] deals with special case 

 A(g) =

pg dν, D

p dν = 1,

with D

and equality conditions were given for both (1.3.3) and (1.3.4) in this case.

37

1.3. Jessen’s and Related Inequalities

The following results established by Beesack and Peˇcari´c [20] deal with some theorems as applications or examples to the basic inequalities given in Theorem 1.3.1 and Lemmas 1.3.1–1.3.3, and include applications to generalized mean values with respect to the functional A. T HEOREM 1.3.2. Let L satisfy conditions (L1 ), (L2 ) on E, and let A satisfy conditions (A1 ), (A2 ) with A(1) = 1. Suppose φ is convex on I = [0, ∞), and f : I → R satisfies the condition φ(x)  f (x)  Cφ(Bx),

x ∈ I,

(1.3.5)

where B, C > 0 are constants. Then, for all g ∈ L such that g
0 on E and f (Bg), φ(Bg) ∈ L, we have     f A(g)  CA f (Bg) .

(1.3.6)

P ROOF. Using both parts (1.3.5) and (1.3.1) we obtain           f A(g)  Cφ BA(g) = Cφ A(Bg)  CA φ(Bg)  CA f (Bg) . The proof is complete.



R EMARK 1.3.4. Inequality (1.3.6) is a generalization of the sufficiency of a half of Theorem 1 of Mulholland [223]. When f satisfies (1.3.5) for some convex φ, Mulholland calls f quasiconvex on I . T HEOREM 1.3.3. Let L, A be as in Theorem 1.3.1. Suppose φ is concave on an interval I ⊂ R and that ψ(x) ≡ xφ(x) is convex on I . Then, for all g ∈ L such that g 2 , φ(g), ψ(g) ∈ L and A(g) > 0, we have
     A(gφ(g)) A(g 2 ) φ . A φ(g)  φ A(g)  A(g) A(g)

(1.3.7)

P ROOF. The first and second inequalities of (1.3.7) are consequences of (1.3.1) applied to the convex functions −φ and xφ. Since the operator A1 (f ) = A(gf )/A(g) is a linear, isotonic functional with A1 (1) = 1 and the last inequality of (1.3.7) also follows from (1.3.1).  Let I = (a, b), −∞  a < b  ∞, and let ψ, χ : I → R be continuous and strictly monotonic. Suppose L and A satisfy the conditions (L1 ), (L2 ) and (A1 ),

38

Chapter 1. Inequalities Involving Convex Functions

(A2 ) with A(1) = 1 on a base set E, and that ψ(g), χ(g) ∈ L for some g ∈ L. We define the generalized mean with respect, to the operators A and ψ by    Mψ (g; A) = ψ −1 A ψ(g) , g ∈ L. (1.3.8) Observe that if α  ψ(g(x))  β for x ∈ E, then by the isotonic character of A, we have α  A(ψ(g))  β so that Mψ is well defined by (1.3.8). We note also that the above assumptions imply that g(x) ∈ I for x ∈ E. In the following theorems given by Beesack and Peˇcari´c [20] we assume that g ∈ L satisfies the above conditions so that the theorems hold for such g. T HEOREM 1.3.4. Under the above hypotheses we have Mψ (g; A)  Mχ (g; A),

(1.3.9)

provided either χ is increasing and φ = χ ◦ ψ −1 is convex, or χ is decreasing and φ is convex. P ROOF. For g ∈ L, we have both ψ(g) ∈ L and χ(g) ∈ L by assumption. Hence φ(ψ(g)) = χ(g) ∈ L for g ∈ L, so if φ is convex it follows from Jessen’s inequality (1.3.1) that      φ A ψ(g)  A χ(g) . Hence, if χ is increasing, so χ −1 is also increasing, we obtain        χ −1 φ A ψ(g)  χ −1 A χ(g) which is (1.3.9). In case φ is concave, so −φ is convex, we obtain the first inequality above with the direction reversed. Since now χ −1 is decreasing with χ , we again obtain (1.3.9).  R EMARK 1.3.5. Theorem 1.3.4 is a generalization to functionals of the general mean value inequality given in [141, Theorem 92, p. 75]. T HEOREM 1.3.5. Let L, A, ψ and χ be as in Theorem 1.3.4, but with I = [m, M] and −∞ < m < M < ∞. Then, for all g ∈ L such that m  g(t)  M for t ∈ E, we have         ψ(M) − ψ(m) A χ(g) − χ(M) − χ(m) A ψ(g)  ψ(M)χ(m) − χ(M)ψ(m),

(1.3.10)

provided φ = χ ◦ ψ −1 is convex. The opposite inequality to (1.3.10) holds when φ is concave.

39

1.3. Jessen’s and Related Inequalities

P ROOF. In case ψ is increasing on I we have m1 = ψ(m)  ψ(g(t))  ψ(M) = M1 for all t ∈ E. So, by Lemma 1.3.1 with m, M replaced by m1 , M1 , we have             A φ ψ(g)  ψ(M) − A ψ(g) χ(m) + A ψ(g) − ψ(m) χ(M)  −1 × ψ(M) − ψ(m) which reduces to (1.3.10). If ψ is decreasing on I , we have M1  ψ(g(t))  m1 for t ∈ E and, with an obvious modification of proof, the result follows as before.  The following lemma given in [20] includes the corresponding versions of Jessen’s inequality (1.3.1) and Lemmas 1.3.1–1.3.3. L EMMA 1.3.4. Let L satisfy conditions (L1 ), (L2 ) and A satisfy conditions (A1 ), (A2 ) on a base set E. Suppose k ∈ L with k
0 on E and A(k) > 0, and that φ is a convex function on an interval I ⊂ R. For any function g1 : E → R such that kg1 ∈ L and kφ(g1 ) ∈ L, we have 
A(kφ(g1 )) A(kg1 )  . (1.3.11) φ A(k) A(k) If in addition, I = [m, M] where −∞ < m < M < ∞, then   [MA(k) − A(kg1 )]φ(m) + [A(kg1 ) − mA(k)]φ(M) A kφ(g1 )  . M −m

(1.3.12)

Moreover, when φ satisfies the strict convexity conditions of Lemmas 1.3.2 or 1.3.3, then
   A(kg1 ) A kφ(g1 )  λA(k)φ (1.3.13) A(k) or  
  A(kg1 ) , (1.3.14) A kφ(g1 )  A(k) λ + φ A(k) where λ is determined as in Lemmas 1.3.2 or 1.3.3, respectively. P ROOF. In case g1 ∈ L and φ(g1 ) ∈ L, and k is such that kh ∈ L for all h ∈ L, the functional F : L → R defined by F (h) =

A(kh) , A(k)

h ∈ L,

40

Chapter 1. Inequalities Involving Convex Functions

is an isotonic linear functional satisfying F (1) = 1. In this case, (1.3.11)–(1.3.14) follow from (1.3.1)–(1.3.4). Under the weaker hypotheses stated above on k, g1 , we must proceed somewhat differently, essentially by giving a direct proof of (1.3.11)–(1.3.14) along the same lines used proving (1.3.1)–(1.3.4). It suffices to deal with (1.3.11) since similar modifications handle the other proofs. As before, if I = [α, β] then kφ(g1 ) ∈ L implies α  g1 (t)  β for t ∈ E, whence αk(t)  k(t)g1 (t)  βk(t), so it follows that x0 = A(kg1 )/A(k) ∈ I . The convexity of φ on I again yields     φ g1 (t)
φ(x0 ) + m g1 (t) − x0 , so

t ∈ E,

    k(t)φ g1 (t)
φ(x0 )k(t) + m k(t)g1 (t) − x0 k(t) ,

t ∈ E,

for an appropriate constant m. Application of the linear isotonic functional A now gives (1.3.11).  The following theorems given in [20] deal with Hölder’s and Minkowski’s inequalities respectively for isotonic functionals. T HEOREM 1.3.6. Let L satisfy conditions (L1 ), (L2 ) and A satisfy conditions (A1 ), (A2 ) on a base set E. If p > 1 and q = p/(p − 1) so that p −1 + q −1 = 1, then if w, f , g
0 on E and wf p , wg q , wf g ∈ L, we have     A(wf g)  A1/p wf p A1/q wg q .

(1.3.15)

In case 0 < p < 1 (or p < 0) and A(wg q ) > 0 (or A(wf p ) > 0), the opposite inequality to (1.3.15) holds. P ROOF. Suppose first that A(wg q ) > 0 and p > 1. Then (1.3.15) follows from (1.3.11) by the substitutions φ(x) = x p ,

g1 = f g −q/p ,

k = wg q ,

(1.3.16)

since then k ∈ L, kg1 = wf g ∈ L and kφ(g1 ) = wf p ∈ L. Thus (1.3.15) holds in this case. In case A(wf p ) > 0, we may apply (1.3.15) with p, q, f , g replaced by q, p, g, f to obtain (1.3.15) again. Finally, suppose both A(wg q ) = 0 and A(wf p ) = 0. Since 0  wf g 

1 1 wf p + wg q p q

on E,

1.3. Jessen’s and Related Inequalities

41

it follows that A(wf g) = 0 also, so again (1.3.15) holds. This proof completes the case p > 1. For the case 0 < p < 1, we have P = 1/p > 1 and so may apply (1.3.15) with p, q, f , g replaced by P , Q = (1 − p)−1 , f1 = (f g)p , g1 = g −p for which p wf1 = wf g, wg1Q = wg q and wf1 g1 = wf p which all belong to L. We obtain     A wf p  Ap (wf g)A1−p wg q , which reduces to the opposite of (1.3.15) provided A(wg q ) > 0. Finally, if p < 0 then 0 < q < 1, and we may apply the case just considered with p, q, f , g re placed by q, p, g, f , provided A(wf p ) > 0. T HEOREM 1.3.7. Let L and A be as in Theorem 1.3.6. If p > 1 and if w, f , g
0 on E with wf p , wg p , w(f + g)p ∈ L, then       A1/p w(f + g)p  A1/p wf p + A1/p wg p . (1.3.17) The opposite inequality to (1.3.17) holds if 0 < p < 1, and also if p < 0 provided A(wf p ) > 0, A(wg p ) > 0 in this case. P ROOF. As in the proof of the ordinary Minkowski inequality, we write w(f + g)p = wf (f + g)p−1 + wg(f + g)p−1 . Applying A to this, (1.3.15) then yields, in case p > 1,          A w(f + g)p  A1/p wf p + A1/p wg p A1/q w(f + g)p , where q = p/(p − 1). Hence (1.3.17) follows if A(w(f + g)p ) > 0. However, if A(w(f + g)p ) = 0, then since 0  wf p , wg p  w(f + g)p , we see that A(wf p ) = A(wg p ) = 0, and (1.3.17) still holds. If 0 < p < 1, the opposite of (1.3.15) yields the opposite of the last displayed inequality provided A(w(f + g)p ) > 0, and hence also the opposite of (1.3.17) if A(w(f + g)p ) > 0. As above, if A(w(f + g)p ) = 0 then A(wf p ) = A(wg p ) = 0, so the opposite of (1.3.17) still holds. Finally, if p < 0, we again obtain the opposite of the last displayed inequality provided both A(wf p ) > 0 and A(wg p ) > 0. If A(w(f + g)p ) > 0, the opposite of (1.3.17) follows. If A(w(f + g)p ) = 0, then  the opposite of (1.3.17) clearly holds since then A1/p (w(f + g)p ) = +∞. We also observe that in the case p < 0, we have 0  w(f + g)p  wf p , wg p , so that A(w(f + g)p ) = 0 if either A(wf p ) = 0 or A(wg p ) = 0. Thus, the opposite inequality to (1.3.17) holds (∞
∞) even in this degenerate case.

42

Chapter 1. Inequalities Involving Convex Functions

The following lemma given in [376] shows that the requirement φ be convex in (1.3.1) can be relaxed. L EMMA 1.3.5. Let L satisfy properties (L1 ), (L2 ) on a nonempty set E, and suppose φ : I → R is a function such that there exists a constant k for which φ(y) − φ(y0 )
k(y − y0 )

for all y ∈ I,

(1.3.18)

where y0 is a fixed point in I . If A : L → R is any isotonic linear functional with A(1) = 1 then, for all g ∈ L such that φ(g) ∈ L and A(g) = y0 , inequality (1.3.1) holds. The proof is similar to the proof of Jessen’s inequality given in Theorem 1.3.1. If φ is convex on I then, for each y0 ∈ I , a constant k = k(y0 ) exists such that (1.3.18) holds. Clearly not all φ satisfying (1.3.18) for some y0 ∈ I , k ∈ R are convex. For the next refinement of Jessen’s inequality, we shall assume that Ω is an algebra of subsets of E, and that the linear class of functions g : E → R satisfies not only (L1 ), (L2 ) but also (L3 ) g ∈ L, E1 ∈ Ω ⇒ gCE1 ∈ L, where CE1 is the characteristic function of E1 . That is, CE1 (t) = 1 for t ∈ E1 and CE1 (t) = 0 for t ∈ E − E1 . It follows from (L2 ), (L3 ) that CE1 ∈ L for all E1 ∈ Ω. Also, L contains constant functions by (L1 ), (L2 ). Observe that A(CE1 ) + A(CE−E1 ) = 1,

A(g) = A(gCE1 ) + A(gCE−E1 ).

(1.3.19)

L EMMA 1.3.6. Let L satisfy properties (L1 ), (L2 ) and (L3 ) on a nonempty set E, and suppose φ is a convex function on an interval I ⊂ R. If A is any isotonic functional on L with A(1) = 1 then, for all g ∈ L such that φ(g) ∈ L, we have Fg (E)
Fg (E1 ) + Fg (E − E1 )
Fg (E1 )
0 for all E1 ∈ Ω such that 0 < A(CE1 ) < 1, where 
  A(gCE1 ) . Fg (E1 ) = A φ(g)CE1 − A(CE1 )φ A(CE1 )

(1.3.20)

(1.3.21)

Equality holds in the first part of (1.3.20) for strictly convex φ if and only if A(gCE1 ) A(gCE−E1 ) = . A(CE1 ) A(CE−E1 )

43

1.3. Jessen’s and Related Inequalities

P ROOF. To prove the first inequality of (1.3.20), set p = A(CE1 ), q = A(CE−E1 ) (so p + q = 1 by the first equation of (1.3.19)), x = A(gCE1 )/A(CE1 ), y = A(gCE−E1 )/A(CE−E1 ) in the convexity condition pφ(x) + qφ(y)
φ(px + qy),

p + q = 1,

(1.3.22)

and use the fact that px + qy = A(g) by the second equation of (1.3.19) and similarly use       A φ(g) = A φ(g)CE1 + A φ(g)CE−E1 . To prove the last inequality of (1.3.20), and hence also the second one, observe that inequality (1.3.1) applies to the isotonic linear functional A1 : L → R as defined by A1 (g) =

A(gCE1 ) , A(CE1 )

g ∈ L,

and having A1 (1) = 1. Equality holds in the first part of (1.3.20), and for strictly convex φ, this equality is the case if and only if x = y, since 0 < p, q < 1.  R EMARK 1.3.6. The inequalities in (1.3.20) are a substantial refinement of the Jessen inequality (1.3.1) since (1.3.20) gives a lower bound (
0) on the difference A(φ(g)) − φ(A(g)) = Fg (E). Next we give a generalization of Lemma 1.3.6, followed by a related generalization of an inequality of Knopp as established by Peˇcari´c and Beesack in [376]. C OROLLARY 1.3.1. Let L satisfy properties (L1 ), (L2 ) and (L3 ) on a nonempty set E, and set ψ, χ be strictly monotonic functions on an interval I such that φ = χ ◦ ψ −1 is convex on I . If A is any isotonic linear functional on L with A(1) = 1 then, for all g ∈ L such that χ(g), ψ(g) ∈ L, we have Hg (E)
Hg (E1 ) + Hg (E − E1 )
Hg (E1 )
0 for all E1 ∈ Ω such that 0 < A(CE1 ) < 1, where 
  A(ψ(g)CE1 ) Hg (E1 ) = A χ(g)CE1 − A(CE1 )φ . A(CE1 )

(1.3.23)

(1.3.24)

Equality holds in the first part of (1.3.23) for strictly convex φ if and only if A(ψ(g)CE1 ) A(ψ(g)CE−E1 ) = . A(CE1 ) A(CE−E1 )

44

Chapter 1. Inequalities Involving Convex Functions

P ROOF. Let g ∈ L with χ(g) ∈ L, ψ(g) ∈ L, and set g1 = ψ(g) so g1 ∈ L and φ(g1 ) = χ(g) ∈ L. Since Fg1 (E1 ) ≡ Hg (E1 )

for E1 ∈ Ω,

inequality (1.3.23) follows from (1.3.20). The above equality condition for g likewise follows from that of Lemma 1.3.6 for g1 = ψ(g). Lemma 1.3.6 is, of course, just a special case (ψ(x) ≡ x, φ = χ ) of Corollary 1.3.1, but only in the case φ is strictly monotonic.  T HEOREM 1.3.8. Let L satisfy conditions (L1 ), (L2 ) on a nonempty set E and let A be an isotonic linear functional on L with A(1) = 1. Let ψ, χ be strictly monotonic functions on I = [m, M], −∞ < m < M < ∞, such that φ = χ ◦ ψ −1 is convex on I . For all g ∈ L such that χ(g) ∈ L, ψ(g) ∈ L (so m  g(t)  M for all t ∈ E), we have      0  A χ(g) − φ A ψ(g)     max θχ (m) + (1 − θ)χ(M) − φ θ ψ(m) + (1 − θ )ψ(M) . 0
θ
1

(1.3.25)

P ROOF. As in the proof of Corollary 1.3.1, set g1 = ψ(g). Then g1 ∈ L, φ(g1 ) ∈ L and m1  g1 (t)  M1 , where m1 = ψ(m), M1 = ψ(M) if ψ is increasing or m1 = ψ(M), M1 = ψ(m) if ψ is decreasing. By Lemma 1.3.1,      A χ(g) − φ A ψ(g)     = A φ(g1 ) − φ A(g1 )   (M1 − A(g1 ))φ(m1 ) + (A(g1 ) − m1 )φ(M1 ) − φ A(g1 ) M1 − m1     max θ φ(m1 ) + (1 − θ )φ(M1 ) − φ θ m1 + (1 − θ )M1 .



0
θ
1

(1.3.26)

If [m1 , M1 ] = [ψ(m), ψ(M)] the right-hand inequality of (1.3.25) is reduced. If [m1 , M1 ] = [ψ(M), ψ(m)] the same result follows by making the substitution θ → 1 − θ in (1.3.25). The left-hand inequality is equivalent to  φ(A(g1 ))  A(φ(g1 )) and so follows by (1.3.1). The following theorem given by Peˇcari´c and Beesack in [376] deals with reformulation of inequalities (1.3.1) and (1.3.2) and presents an application which will illustrate the power of this reformulation.

45

1.3. Jessen’s and Related Inequalities

T HEOREM 1.3.9. Let φ be a convex on an interval I ⊃ [m, M], where −∞ < m < M < ∞. Suppose g : E → R satisfies m  g(t)  M for all t ∈ E, that g ∈ L and φ(g) ∈ L. Let A : L → R be an isotonic linear functional with A(1) = 1 and let p = pg , q = qg be nonnegative numbers (with p + q > 0) for which pm + qM . p+q

(1.3.27)

  pφ(m) + qφ(M)  A φ(g)  . p+q

(1.3.28)

A(g) = Then




pm + qM φ p+q



P ROOF. Observe first that since m  A(g)  M, there always exist p
0, q
0, p + q > 0 satisfying (1.3.27). The first inequality in (1.3.28) is (1.3.1), while the second of (1.3.28) is (1.3.2).  R EMARK 1.3.7. Observe that for the given p, q (determined by g) in (1.3.27), this inequality can be regarded as a refinement of the inequality obtained from the definition of convexity for the function φ. In case A(g) = m, it follows that pg > 0, qg = 0 and (1.3.28) reduces to φ(m)  A(φ(g))  φ(m) so that no refinement is possible. Similarly, if A(g) = M no genuine refinement of (1.3.28) is possible. We now show that whenever m < A(g) < M, a refinement of 
pφ(m) + qφ(M) pm + qM  φ p+q p+q is possible for arbitrary p > 0, q > 0, one of the form of (1.3.28) but for an appropriately chosen function g1 ∈ L, g1 = g1,p,q , namely 
  pφ(m) + qφ(M) pm + qM  A φ(g1 )  , φ p+q p+q provided only φ(g1 ) ∈ L. Hence, of course, as in (1.3.27), we have m  g1 (t)  M for t ∈ E and A(g1 ) = (pm + qM)/(p + q). To prove this idea we consider two cases: (a) q/(p + q)  [A(g) − m]/(M − m) and (b) q/(p + q) > [A(g) − m]/(M − m). If (a) holds, it suffices to take g1 (t) = αg(t) + m(1 + α) for t ∈ E, with α = q(M − m)/{(p + q)[A(g) − m]}, so that 0 < α  1. If (b) holds, one can likewise verify that it suffices to take g1 (t) = βg(t) + M(1 − β) for t ∈ E, with β = p(M − m)/{(p + q)[M − A(g)]} while (b) implies 0 < β < 1. For various other applications and remarks on classical inequalities and means we refer the reader to [20,376] and the references cited therein.

46

Chapter 1. Inequalities Involving Convex Functions

1.4 Some General Inequalities Involving Convex Functions In this section we shall give some inequalities involving convex functions established by various investigators in the past few years related to the well-know Jensen–Steffensen inequality   n n 1  1  f pi x i  pi f (xi ), (1.4.1) Pn Pn i=1

i=1

where x and p are two n-tuples of real numbers such that xi ∈ I , 1  i  n, and I is an interval from R, Pn = ni=1 pi > 0, f : I → R is convex, and for every monotonic n-tuple x if and only if 0  Pk  Pn ,

k = 1, 2, . . . , n − 1.

(M)

In a 1981 paper, Peˇcari´c [366] has obtained necessary and sufficient conditions for the validity of reverse inequality, that is,   n n 1  1  f pi x i
pi f (xi ). (1.4.2) Pn Pn i=1

i=1

In [366], the following Fuch’s generalization of the majorization theorem (see [122]) is used to establish the main results. L EMMA 1.4.1. Let a1
· · ·
as , b1
· · ·
bs and q1 , . . . , qs be real numbers such that k 

qi ai 

i=1

k 

qi bi ,

1  k  s − 1,

i=1

and s 

qi ai =

i=1

s 

qi bi .

i=1

Then for every convex function f , s  i=1

qi f (ai ) 

s 

qi f (bi ).

i=1

In [366] Peˇcari´c has given the following two theorems.

(1.4.3)

47

1.4. Some General Inequalities Involving Convex Functions

T HEOREM 1.4.1. Let x be a nonincreasing tuple of real numbers, xi ∈ I , 1  i  n, p real n-tuple, and there exists xj , j ∈ (1, . . . , n), such that k 

pi (xi − xj )  0

i=1 n 

n 1  for every k such that xk
x¯ = pi x i , Pn i=1

pi (xi − xj )
0

(1.4.4)

for every k such that xk  x. ¯

i=k

(If x1  x¯ the first condition in (1.4.4) is taken to be vacuous and if xn
x¯ the second condition in (1.4.4) is taken to be vacuous.) If x¯ ∈ I then, for every convex function f : I → R, (1.4.2) holds. If the reverse inequalities hold in (1.4.4), then (1.4.1) holds. P ROOF. Let x¯ ∈ [xr+1 , xr ]. By substitutions of (i) s = n + 1; qi = pi , ai = xi , 1  i  r; qr+1 = −Pn , ar+1 = x; ¯ qi = pi−1 , ai = xi−1 , r + 2  i  n + 1; bi = xj , 1  i  n + 1, and (ii) s = n + 1; ai = xj , 1  i  n + 1; qi = pi , bi = xi , 1  i  r; qr+1 = −Pn , br+1 = x; ¯ qi = pi−1 , bi = xi−1 , r + 2  i  n + 1, from Lemma 1.4.1, we get Theorem 1.4.1. It can easily be shown that the case x1  x¯ and xn
x¯ can exist only for inequality (1.4.2).  T HEOREM 1.4.2. Let x and p be two n-tuples of real numbers such that xi ∈ I , 1  i  n, x¯ ∈ I and Pn > 0. Inequality (1.4.2) holds for every convex function f : I → R and for every monotonic n-tuple x if and only if there exists m ∈ (1, . . . , n) such that Pk  0,

k < m,

and P k  0,

k > m,

(1.4.5)

where P k = Pn − Pk−1 . P ROOF. Suppose that (1.4.5) holds. Using the identities k 

pi (xi − xm ) = (xk − xm )Pk +

i=1 n  i=k

k−1 

Pi (xi − xi+1 )

and

i=1

pi (xi − xm ) = (xk − xm )P k +

n  i=k+1

(1.4.6) P i (xi − xi−1 ),

48

Chapter 1. Inequalities Involving Convex Functions

we get, in the case x1
· · ·
xn , k 

pi (xi − xm )  0,

1  k  m,

i=1 n 

and (1.4.7)

pi (xi − xm )
0,

m  k  n.

i=k

Let x¯ ∈ [xr+1 , xr ] and let m  r. Then the conditions (1.4.4), for j = m are obviously satisfied if 1  k  m and r  k  n. Suppose that for k1 and m < k1 < r, k1 the condition (1.4.4) is invalid, that is, i=1 pi (xi − xm )
0. Since, from (1.4.7), we have ni=k1 +1 pi (xi − xm )
0, we get ni=1 pi (xi − xm )
0, that is, x¯
xm , what is evidently a contradiction. Analogously, in the case m > r or x1 < x, ¯ x¯ < xn , we get that (1.4.2) holds. If x1  · · ·  xn , we can also prove that (1.4.2) is valid. Next, suppose that (1.4.2) holds. Let f (x) = x 2 , xi = 0, i = 1, . . . , k − 1, and xi = 1, i = k, . . . , n. Then (1.4.2) becomes (P k /Pn )2
P k /Pn . Hence, P k  0 or Pk−1  0, k = 2, . . . , n. Now let k < m and suppose that P k  0. Let xi = 0, 1  i  k − 1, xi = 1, k  i  m − 1, and xi = 1 + ε, m  i  n. Then x¯ = (P k + P m )/Pn . Since P k  0, we can choose ε sufficiently small that x¯ < 1. Let f (z) = z − 1 if z
1 and f (z) = 0 for z < 1. Then (1.4.2) becomes (1/Pn ) ni=m εpi  0, that is, P m  0. Similarly we can conclude that Pm  0 implies Pk  0. So (1.4.5) for some m ∈ (1, . . . , n) must be satisfied.  R EMARK 1.4.1. Analogously we can prove (1.4.1). Indeed suppose that condition (M) holds. Using the identities (1.4.6) we get, in the case x1
· · ·
xn , that for every m = 1, . . . , n, (1.4.7) holds with the reverse inequalities. Since x¯ ∈ [xr+1 , xr ], we can suppose that x¯ ∈ [xr+1 , xr ]. Then (1.4.4) with the reverse inequalities holds for j = r and for j = r + 1, that is, (1.4.1) is valid. Next suppose that (1.4.1) holds. Let f (x) = x 2 , xi = 1, 1  i  k, and xi = 0, k + 1  i  n. Then (1.4.1) becomes (Pk /Pn )2  Pk /Pn , that is, 0  Pk  Pn , 1  k  n. Now we shall give the following corollaries from [366]. C OROLLARY 1.4.1. Let x1  · · ·  xm  0  xm+1  · · ·  xn , m ∈ (0, 1, . . . , n), xi ∈ I , 1  i  n, 0 ∈ I , and p is real n-tuple.

49

1.4. Some General Inequalities Involving Convex Functions

(i) Inequality n 

 pi f (xi )
f

i=1

n 

 pi x i

i=1

n  (pi − 1)f (0) +

(1.4.8)

i=1

holds for every convex function f : I → R if and only if 0  Pk  1, 1  k  m, m + 1  k  n. 0  P k  1, (ii) Let ni=1 pi xi ∈ I . The reverse inequality holds in (1.4.8) if and only if there exists j  m such that Pi  0,

Pi
1,

i < j,

j  i  m,

P i  0,

i  m + 1,

or there exists j
m such that Pi  0,

i  m,

P i
1,

m + 1  i  j,

and P i  0,

i > j.

P ROOF. Let Theorems 1.4.1 and 1.4.2 hold for n + 1 with xi = xˆi and pi = pˆ i , 1  i  n + 1. By substitution, xˆi = xi , pˆ i = pi , 1  i  m, xˆm+1 = 0, pˆ m+1 = 1 − Pn , xˆi = xi , pˆ i = pi−1 , m + 2  i  n + 1, we get Corollary 1.4.1.  As a simple consequence of Theorem 1.4.2 we have the following corollary. C OROLLARY 1.4.2. Let x and p be two n-tuples of real numbers such that xi ∈ I , 1  i  n, x¯ ∈ I and pm > 0,

pi  0,

i = m,

Pn > 0.

Then (1.4.2) holds for every convex function f : I → R. Next we shall give some inequalities for convex-dominated functions given by Dragomir and Ionescu in [88]. We shall introduce the following class of functions (see [88]). D EFINITION 1.4.1. Let g : I → R be a given convex function on interval I from R. The real function f : I → R is called g-convex dominated on I if the following condition is satisfied    λf (x) + (1 − λ)f (y) − f λx + (1 − λ)y     λg(x) + (1 − λ)g(y) − g λx + (1 − λ)y (1.4.9) for all x, y in I and λ ∈ [0, 1].

50

Chapter 1. Inequalities Involving Convex Functions

The following simple characterization of convex-dominated functions is valid. L EMMA 1.4.2. Let g be a convex function on I and f : I → R. Then the following statements are equivalent: (i) f is g-convex dominated on I ; (ii) g − f and g + f are convex on I ; and (iii) there exist two convex mappings h, l on I such that f = (h − l)/2 and g = (h + l)/2. P ROOF. (i) ⇔ (ii). Condition (1.4.9) is equivalent to     λ g(x) − f (x) + (1 − λ) g(y) − f (y)    
g λx + (1 − λ)y − f λx + (1 − λ)y ,     λ g(x) + f (x) + (1 − λ) g(y) + f (y)    
g λx + (1 − λ)y + f λx + (1 − λ)y for all x, y ∈ I and λ ∈ [0, 1], that is, g − f and g + f are convex on I if and only if (1.4.9) holds. (ii) ⇔ (iii). It is obvious.  Let F (I ) be the linear space of all real-valued functions defined on I and J : F (I ) → R be a functional satisfying the properties: (J1 ) J (αf + βg) = αJ (f ) + βJ (g) for all α, β ∈ R and f , g ∈ F (I ), and (J2 ) J (f )
0 for all convex functions f on I . The following lemma plays an important role in the sequel. L EMMA 1.4.3. Let J be a functional satisfying conditions (J1 ), (J2 ). Then, for every convex function g and for every g-convex dominated function f on I , the following inequality holds:   g(f )  J (g). (1.4.10) P ROOF. Let g be a convex function and f be g-convex dominated on I . By Lemma 1.4.2, it follows that g − f and g + f are convex on I . Then 0  J (g − f ) = J (g) − J (f )

and 0  J (g + f ) = J (g) + J (f )

which gives −J (g)  J (f )  J (g).

1.4. Some General Inequalities Involving Convex Functions

51

Since J (g)
0, inequality (1.4.10) is proven.



In [88] Dragomir and Ionescu have obtained the following improvement of the Jensen inequality. T HEOREM 1.4.3. Let g be a given convex function on I and f : J → R be g-convex dominated. Then, for every xi ∈ I , pi
0, 1  i  n, such that Pn = ni=1 pi > 0, we have the inequality    n n   1  1    pi f (xi ) − f pi x i     Pn Pn i=1 i=1   n n 1  1   pi g(xi ) − g pi x i . Pn Pn i=1

(1.4.11)

i=1

P ROOF. Consider the functional   n n 1  1  pi f (xi ) − f pi x i , J (f ) = Pn Pn i=1

f ∈ F (I ).

i=1

Then J satisfies conditions (J1 ) and (J2 ) (by Jensen’s inequality). Applying Lemma 1.4.3, we obtain inequality (1.4.11). The proof is finished.  In [88] the following improvement of Fuch’s generalization of the majorization theorem (see [122]) is given. T HEOREM 1.4.4. Let a1
· · ·
as , b1
· · ·
bs and q1 , . . . , qs be real numbers such that k  i=1

qi ai 

k 

qi bi ,

1  k  s − 1,

i=1

s  i=1

qi ai =

s 

qi bi .

i=1

If g is convex on I and f is g-convex dominated on I , then the following inequality holds:  s  s        g(bi ) − g(ai ) . qi f (bi ) − f (ai )   (1.4.12)    i=1

i=1

52

Chapter 1. Inequalities Involving Convex Functions

P ROOF. Consider the functional J (f ) =

s    qi f (bi ) − f (ai ) ,

f ∈ F (I ).

i=1

Then J satisfies conditions (J1 ) and (J2 ), by Fuchs’ inequality, see also Lemma 1.4.1. Applying Lemma 1.4.3, we deduce inequality (1.4.12).  The following theorem given in [88] deals with an improvement of the Jensen– Steffensen inequality. T HEOREM 1.4.5. Let x and p be two n-tuples of real numbers such that xi ∈ I , 1  i  n, and I is an interval from R and Pn > 0. Then the following statements are equivalent: (i) For every convex function g : I → R, for every g-convex dominated function f and for all monotonic n-tuple x, inequality (1.4.11) hold. (ii) 0  Pk  Pn for all k = 1, 2, . . . , n − 1. P ROOF. (i) ⇒ (ii) is obviously the Jensen–Steffensen inequality. (ii) ⇒(i) considers the functional   n n 1  1  J (f ) = pi f (xi ) − f pi xi , f ∈ F (I ). Pn Pn i=1

i=1

Then J verifies conditions (J1 ) and (J2 ), by the Jensen–Steffensen inequality, see Theorem 1.2.2. Applying Lemma 1.4.3, we obtain (1.4.11).  The next theorem given in [88] improves Peˇcari´c’s theorem given above in Theorem 1.4.1. T HEOREM 1.4.6. Let x be a nonincreasing n-tuple of real numbers, xi ∈ I , 1  i  n, p real n-tuple, and there exists xj , j ∈ (1, 2, . . . , n), such that k 

pi (xi − xj )  0

for every k such that xk
x¯ =

i=1 n 

n 1  pi x i , Pn i=1

pi (xi − xj )
0

(1.4.13)

for every k such that xk  x. ¯

i=1

(If x1 < x¯ then the first condition in (1.4.13) is taken to be vacuous, if xn
x¯ the second condition in (1.4.13) is taken to be vacuous.) If x¯ ∈ I , then for every

53

1.5. Hadamard’s Inequalities

convex function g : I → R and for every g-convex dominated function f : I → R, we have   n n 1  1  pi x i − pi g(xi ) g Pn Pn i=1 i=1     n n   1  1    (1.4.14) pi x i − pi f (xi ).
f   Pn Pn i=1

i=1

If the reverse inequalities in (1.4.13) hold, then (1.4.11) holds. The proof follows by a similar argument by using Theorem 1.4.1 given above.

1.5 Hadamard’s Inequalities In 1893, J. Hadamard [134] investigates one of the fundamental inequalities in analysis, which is now known in the literature as Hadamard’s inequality. Over the years many authors have developed various extensions, variants and refinements of Hadamard’s inequality. In this section we shall deal with Hadamard’s and related inequalities as established by various investigators during the past few years. The following theorem deals with Hadamard’s inequality involving convex functions. T HEOREM 1.5.1. If f : I → R is a convex function, where I = [a, b] and R are a set of real numbers, then the inequalities
f

a+b 2

 

1 b−a



b

f (x) dx 

a

f (a) + f (b) 2

(1.5.1)

are valid. P ROOF. Since f is convex on I , then for t ∈ [0, 1], we have   f ta + (1 − t)b  tf (a) + (1 − t)f (b).

(1.5.2)

Integrating (1.5.2) with respect to t on [0, 1] we get  0

1

  f (a) + f (b) . f ta + (1 − t)b dt  2

(1.5.3)

54

Chapter 1. Inequalities Involving Convex Functions

On the other hand, since f is convex on I , then for t ∈ [0, 1] we have

 a+b ta + (1 − t)b (1 − t)a + tb f =f + 2 2 2 

   1  f ta + (1 − t)b + f (1 − t)a + tb . 2

(1.5.4)

Integrating inequality (1.5.4) with respect to t on [0, 1] we get


a+b f 2

 

1 2

1 = 2



1

    f ta + (1 − t)b + f (1 − t)a + tb dt

0



1

  f ta + (1 − t)b dt +

0



1

  f (1 − t)a + tb dt .

(1.5.5)

0

By putting 1 − t = s in the second integral on the right-hand side of (1.5.5), we have
  1

 1     a+b 1 f  f ta + (1 − t)b dt + f sa + (1 − s)b ds 2 2 0 0  1   f ta + (1 − t)b dt. (1.5.6) = 0

From (1.5.3) and (1.5.6), we get


a+b f 2





1

 0

  f (a) + f (b) . f ta + (1 − t)b dt  2

(1.5.7)

By putting ta +(1−t)b = x in the integral involved in (1.5.7), it is easy to observe that  1  b   1 f ta + (1 − t)b dt = f (x) dx. (1.5.8) b−a a 0 Using (1.5.8) in (1.5.7) we get the required inequalities in (1.5.1) and the proof is complete.  In 1976, A. Lupas [200] proves that if p, q > 0, f is convex on I ⊃ [a, b] and ν = (pa + qb)/(p + q), then
f

pa + qb p+q

 

1 2y



ν+y

ν−y

f (t) dt 

pf (a) + qf (b) , p+q

(1.5.9)

55

1.5. Hadamard’s Inequalities

provided 0 < y  [(b − a)/(p + q)] min(p, q). The case p = q = 1, y = (b − a)/2 of (1.5.9) is Hadamard’s inequality. In [376] it is shown that under the same hypotheses Hadamard’s inequality yields the following refinement of (1.5.9). T HEOREM 1.5.2. If p, q > 0, f is convex on I ⊃ [a, b] and ν = (pa + qb)/ (p + q), then 
 ν+y 1 pa + qb  f f (t) dt p+q 2y ν−y  1 f (ν − y) + f (ν + y) 2 pf (a) + qf (b) .  p+q



(1.5.10)

P ROOF. First observe that if 0 < y  [(b − a)/(p + q)] min(p, q) then, by considering two cases (0 < p  q, 0 < q < p), one easily verifies that a  ν − y < ν + y  b, so f is defined on [ν − y, ν + y]. By Hadamard’s inequality (1.5.1) with a, b replaced by ν − y, ν + y, we obtain  ν+y  1 1 (1.5.11) f (t) dt  f (ν − y) + f (ν + y) . f (ν)  2y ν−y 2 By the definition of convexity, we have, for a  x1 < x2 < x3  b, f (x2 ) 

x3 − x2 x2 − x1 f (x1 ) + f (x3 ). x3 − x1 x3 − x1

Hence, taking x1 = a, x3 = b we obtain ν −y −a b − (ν − y) f (a) + f (b), b−a b−a ν +y −a b − (ν + y) f (a) + f (b). f (ν + y)  b−a b−a

f (ν − y) 

From (1.5.11)–(1.5.13), we now have  ν+y 1 f (ν)  f (t) dt 2y ν−y 

 1 f (ν − y) + f (ν + y) 2

(1.5.12) (1.5.13)

56

Chapter 1. Inequalities Involving Convex Functions





ν −a 1 b−ν f (a) + f (b) 2 b−a b−a

=

pf (a) + qf (b) , p+q 

proving (1.5.10).

In 1990, S.S. Dragomir [82] has given the following refinements of Hadamard’s inequalities. T HEOREM 1.5.3. Let f : [a, b] → R be a convex mapping. Then, for all t ∈ [a, b], we have the following inequalities
  b b   a+b 1 f  f tx + (1 − t)y dx dy 2 2 (b − a) a a  b 1 f (x) dx  b−a a 

f (a) + f (b) . 2

(1.5.14)

P ROOF. Since f is convex on [a, b], then for all x, y ∈ [a, b] and t ∈ [0, 1], we have   f tx + (1 − t)y  tf (x) + (1 − t)f (y). Integrating this inequality on [a, b] × [a, b] we get  b a

b

  f tx + (1 − t)y dx dy 

a

 b a

b a

 tf (x) + (1 − t)f (y) dx dy 

= (b − a)

b

f (x) dx, a

which proves the second part of (1.5.14) by using the right half of Hadamard’s inequality. On the other hand, by Jensen’s inequality for double integrals, we have


1 f (b − a)2

 b

1  (b − a)2

a

b





tx + (1 − t)y dx dy

a

 b a

a

b

  f tx + (1 − t)y dx dy,

57

1.5. Hadamard’s Inequalities

and since 1 (b − a)2 the proof is complete.

 b a

b

 a+b tx + (1 − t)y dx dy = , 2

a



C OROLLARY 1.5.1. Let f be as in Theorem 1.5.3. Then
   b b
x+y a+b 1 f f  dx dy 2 2 (b − a)2 a a  b 1 f (x) dx  b−a a 

f (a) + f (b) . 2

(1.5.15)

T HEOREM 1.5.4. Let f : [a, b] → R be a convex mapping on [a, b]. Then   b b
1 x +y dx dy f 2 (b − a)2 a a  b b 1   1  f tx + (1 − t)y dx dy dt (b − a)2 a a 0  b 1  f (x) dx. (1.5.16) b−a a P ROOF. Consider the mapping g : [a, b] → R given by g(t) =

 b

1 (b − a)2

a

b

  f tx + (1 − t)y dx dy.

a

For all t1 , t2 ∈ [0, 1] and α, β
0 with α + β = 1, we have g(αt1 + βt2 ) = 

1 (b − a)2 α (b − a)2 +

 b a

β (b − a)2

  f (αt1 + βt2 )x + (1 − αt1 − βt2 )y dx dy

b

  f t1 x + (1 − t1 )y dx dy

a

 b a

b

a

 b a

= αg(t1 ) + βg(t2 ),

a

b

  f t2 x + (1 − t2 )y dx dy

58

Chapter 1. Inequalities Involving Convex Functions

which proves that g is convex on [0, 1]. By means of Hadamard’s inequalities for the convex mapping g and using Fubini’s theorem for multiple integrals, we have   b b
1 x +y dx dy f 2 (b − a)2 a a
  1 1  =g g(t) dt 2 0  b b 1   1 f tx + (1 − t)y dx dy dt = (b − a)2 a a 0  b 1 g(0) + g(1) =  f (x) dx. 2 b−a a 

The proof is complete.

The next theorem given by Dragomir [86], in one sense, is an improvement of the “right” inequality in (1.5.1). T HEOREM 1.5.5. Let f : [a, b] → R be a differentiable convex function. Then the following inequalities  b b  b   1 1 0 f (x) dx − f tx + (1 − t)y dx dy 2 b−a a (b − a) a a
  b 1 f (a) + f (b) − t f (x) dx (1.5.17) 2 b−a a are valid for all t in [0, 1]. P ROOF. Since f is convex on [a, b], we have   f tx + (1 − t)y  tf (x) + (1 − t)f (y) for all x, y in [a, b] and t in [0, 1]. Integrating the above inequality on [a, b]2 we obtain  b b  b b     tf (x) + (1 − t)f (y) dx dy f tx + (1 − t)y dx dy  a

a

a

a



= (b − a)

b

f (x) dx, a

59

1.5. Hadamard’s Inequalities

from which the first part of the proof of the inequalities in (1.5.17) follows. On the other hand, since f is convex and derivable on [a, b], we have   f tx + (1 − t)y − f (y)
t (x − y)f
(y) for all x, y in [a, b] and t in [0, 1]. Integrating both sides of the above inequality on [a, b]2 we get  b a

b

a

a

b

f (x) dx a

 b


t



  f tx + (1 − t)y dx dy − (b − a) b

(x − y)f
(y) dx dy.

(1.5.18)

a

Since a simple calculation yields that  b a

b

(x − y)f
(y) dx dy

a



b

= (b − a)

f (x) dx − (b − a)2

a

f (a) + f (b) , 2

by using this formula in (1.5.18), we obtain 

b

(b − a)

f (x) dx −

a

 t (b − a)2

 b a

b

  f tx + (1 − t)y dx dy

a

f (a) + f (b) − (b − a) 2



b

f (x) dx a

for all t in [0, 1], which is the second inequality in (1.5.17). C OROLLARY 1.5.2. Let f be as in Theorem 1.5.5. Then we have   b b
 b 1 1 x +y dx dy f (x) dx − f b−a a 2 (b − a)2 a a

 b 1 1 f (a) + f (b) −  f (x) dx . 2 2 b−a a

0

The following theorem also is given in [86].



60

Chapter 1. Inequalities Involving Convex Functions

T HEOREM 1.5.6. Let f be as in Theorem 1.5.5. Then for all t in [0, 1], we have the inequality 0

1 b−a



b

f (x) dx −

a

1 b−a

 a


a+b dx f tx + (1 − t) 2

 b f (x) dx . (1.5.19)

b

1 f (a) + f (b) −  (1 − t) 2 b−a

a

P ROOF. First, we observe that 

a+b a+b  tf (x) + (1 − t)f f tx + (1 − t) 2 2 for all x in [a, b] and t in [0, 1]. Integrating the above inequality with respect to x over [a, b] and using the left half of inequality (1.5.1) we have 
a+b dx f tx + (1 − t) 2 a 
 b t a+b  f (x) dx + (1 − t)f b−a a 2  b  b t 1−t  f (x) dx + f (x) dx b−a a b−a a  b 1 = f (x) dx. b−a a

1 b−a



b

On the other hand, the function f being differentiate convex on [a, b], we get

 a+b a+b f tx + (1 − t) − f (x)
(1 − t) − x f
(x) 2 2 for all t in [0, 1] and x in [a, b]. Integrating the above inequality with respect to x on [a, b] we get 
 b 1 a+b dx − f tx + (1 − t) f (x) dx 2 b−a a a   b
a+b
(1 − t) − x f
(x) dx 2 a

1 b−a



b

(1.5.20)

61

1.5. Hadamard’s Inequalities

for all t in [0, 1]. A simple computation shows that  b
a

  b a+b f (a) + f (b) − x f
(x) dx = . f (x) dx − (b − a) 2 2 a

Using this equality in (1.5.20) we get the required inequality in (1.5.19).



C OROLLARY 1.5.3. Let f be as in Theorem 1.5.6. Then we have  b  (a+3b)/4 1 2 0 f (x) dx − f (x) dx b−a a b − a (3a+b)/4

 b 1 f (a) + f (b) 1  − f (x) dx . 2 2 b−a a In [381] Peˇcari´c and Dragomir and in [87] Dragomir obtain a generalization and refinement of Hadamard’s inequality for isotonic linear functional. In the following theorems we give the results of [87,381]. We need the following lemmas given in [87,381]. L EMMA 1.5.1. Let X be a linear space and C be its convex subset. Then the following statements are equivalent for a mapping f : X → R (i) f is convex on C and (ii) for all x, y ∈ C, the mapping gx,y : [0, 1] → R, gx,y = f (tx + (1 − t)y) is convex on [0, 1]. P ROOF. (i) ⇒ (ii). Suppose x, y ∈ C and let t1 , t2 ∈ [0, 1], λ1 , λ2
0 with λ1 + λ2 = 1. Then   gx,y (λ1 t1 + λ2 t2 ) = f (λ1 t1 + λ2 t2 )x + (1 − λ1 t1 − λ2 t2 )y     = f (λ1 t1 + λ2 t2 )x + λ1 (1 − t1 ) + λ2 (1 − t2 ) y      λ1 f t1 x + (1 − t1 )y + λ2 f t2 x + (1 − t2 )y = λ1 gx,y (t1 ) + λ2 gx,y (t2 ), that is, gx,y is convex on [0, 1]. (ii) ⇒ (i). Let x, y ∈ C and λ1 , λ2
0 with λ1 + λ2 = 1. Then   f (λ1 x + λ2 y) = f λ1 x + (1 − λ1 )y = gx,y (λ2 · 1 + λ2 · 0)

62

Chapter 1. Inequalities Involving Convex Functions

 λ1 gx,y (1) + λ2 gx,y (0) = λ1 f (x) + λ2 f (y), that is, f is convex on C and the lemma is proved.



L EMMA 1.5.2. Let X be a real linear space and C be a convex subset. If f : C → R is convex on C, then for all x, y in C, the mapping gx,y : [0, 1] → R given by    1  gx,y (t) = f tx + (1 − t)y + f (1 − t)x + ty 2 is also convex on [0, 1]. In addition, we have the inequality
 x +y f (a) + f (b) f  gx,y (t)  2 2 for all x, y in C and t ∈ [0, 1]. P ROOF. Suppose x, y ∈ C and let t1 , t2 ∈ [0, 1] and α, β
0 with α + β = 1. Then gx,y (αt1 + βt2 ) =

=



 1  f (αt1 + βt2 )x + (1 − αt1 − βt2 )y 2   + f (1 − αt1 − βt2 )x + (αt1 + βt2 )y    1   f α t1 x + (1 − t1 )y + β t2 x + (1 − t2 )y 2      + f α (1 − t1 )x + t1 y + β (1 − t2 )x + t2 y    1  αf t1 x + (1 − t1 )y + βf t2 x + (1 − t2 )y 2     + αf (1 − t1 )x + t1 y + βf (1 − t2 )x + t2 y

= αgx,y (t1 ) + βgx,y (t2 ), which shows that gx,y is convex on [0, 1]. By the convexity of f we can state 

 x+y 1 tx + (1 − t)y + (1 − t)x + ty = f gx,y (t)
f 2 2 and also gx,y (t) 

 f (x) + f (y) 1 tf (x) + (1 − t)f (y) + (1 − t)f (x) + tf (y) = , 2 2

1.5. Hadamard’s Inequalities

63

for all t in [0, 1], which completes the proof.



In [381] Peˇcari´c and Dragomir have given the following generalization of Hadamard’s inequality for isotonic linear functionals. T HEOREM 1.5.7. Let f : C ⊆ X → R be a convex function on C, L and A satisfy conditions (L1 ), (L2 ) and (A1 ), (A2 ) in Section 1.3, and h : E → R, 0  h(t)  1, h ∈ L is such that gx,y ◦ h ∈ L for x, y given in C, where E be a nonempty set. If A(1) = 1, then we have the inequality        f A(h)x + 1 − A(h) y  A f hx + (1 − h)y    A(h)f (x) + 1 − A(h) f (y). (1.5.21) P ROOF. Consider the mapping gx,y : [0, 1] → R, gx,y (s) = f (sx + (1 − s)y). Then, by the Lemma 1.5.1, we have gx,y is convex on [0, 1]. For all t ∈ E, we have       gx,y h(t) · 1 + 1 − h(t) · 0  h(t)gx,y (1) + 1 − h(t) gx,y (0) which implies     A gx,y (h)  A(h)gx,y (1) + 1 − A(h) gx,y (0), that is,

     A f hx + (1 − h)y  A(h)f (x) + 1 − A(h) f (y).

On the other hand, by using Jessen’s inequality in Theorem 1.3.1 to gx,y , we have     gx,y A(h)  A gx,y (h) , which gives        f A(h)x + 1 − A(h) y  A f hx + (1 − h)y , and the proof is complete.



In [87] Dragomir has given the following refinement of Hadamard’s inequality for isotonic linear functionals. T HEOREM 1.5.8. Let f : C ⊆ X → R be a convex function on convex set C, L and A satisfy conditions (L1 ), (L2 ) and (A1 ), (A2 ) in Section 1.3, and h : E → R, 0  h(t)  1, t ∈ E, h ∈ L is such that f (hx + (1 − h)y) and

64

Chapter 1. Inequalities Involving Convex Functions

f ((1 − h)x + hy) belong to L for x, y fixed in C. If A(1) = 1, then we have the inequality 
      1  x+y  f A(h)x + 1 − A(h) y + f 1 − A(h) x + A(h)y f 2 2     1   A f hx + (1 − h)y + A f (1 − h)x + hy 2 f (x) + f (y) .  2



(1.5.22)

P ROOF. Consider the mapping gx,y : [0, 1] → R given in Lemma 1.5.2. Then gx,y is convex on [0, 1]. Applying Jessen’s inequality in Theorem 1.3.1 for the mapping gx,y , we get     gx,y A(h)  A gx,y (h) . But         1  gx,y A(h) = f A(h)x + 1 − A(h) y + f 1 − A(h) x + A(h)y 2 and       1   A gx,y (h) = A f hx + (1 − h)y + A f (1 − h)x + hy , 2 and the second inequality in (1.5.22) is proved. To prove the first inequality in (1.5.22), we observe that by Lemma 1.5.2
   x+y f  gx,y A(h) 2 which is the desired statement. Finally, we observe that by the convexity of f , we get    f (x) + f (y) 1  f hx + (1 − h)y + f (1 − h)x + hy  2 2

on E.

Applying to this inequality the functional A and since A(1) = 1, we obtain the last part of (1.5.22). 

1.6 Inequalities of Hadamard Type I During the past few years several papers have appeared which deals with Hadamard-type inequalities involving various classes of functions. In this sec-

65

1.6. Inequalities of Hadamard Type I

tion, we offer some basic inequalities of Hadamard type that have recently been published. In 1985, Godunova and Levin [130] introduce the following class of functions. A mapping f : I → R is said to belong to the class Q(I ) if it is nonnegative and, for all x, y ∈ I and λ ∈ (0, 1), satisfies the inequality   f (x) f (y) f λx + (1 − λ)y  + , λ 1−λ

(1.6.1)

where I is an interval from R. In [130] it is noted that all nonnegative monotone and nonnegative convex functions belong to this class and also proves the following result: If f ∈ Q(I ) and x, y, z ∈ I , then f (x)(x − y)(x − z) + f (y)(y − x)(y − z) + f (z)(z − x)(z − y)
0.

(1.6.1
)

In fact, (1.6.1
) is equivalent to (1.6.1) so it can be used alternatively in the definition of the class Q(I ). For the case f (x) = x r , r ∈ R, inequality (1.6.1
) obviously coincides with the well-known Schur inequality. The following result deals with an inequality of Hadamard type recently established in [93] for a class of functions Q(I ). T HEOREM 1.6.1. Let f ∈ Q(I ), a, b ∈ I , with a < b and f ∈ L1 [a, b]. Then


a+b f 2 and 1 b−a



b



4  b−a



p(x)f (x) dx 

a

b

f (x) dx

(1.6.2)

a

f (a) + f (b) , 2

(1.6.3)

where p(x) =

(b − x)(x − a) , (b − a)2

x ∈ I.

The constant equal to 4 in (1.6.2) is the best possible. P ROOF. Since f ∈ Q(I ), we have for all x, y ∈ I (with λ = 1/2 in (1.6.1)), 
  x +y , 2 f (x) + f (y)
f 2

66

Chapter 1. Inequalities Involving Convex Functions

that is, with x = ta + (1 − t)b, y = (1 − t)a + tb, t ∈ [0, 1], 
     a+b . 2 f ta + (1 − t)b + f (1 − t)a + tb
f 2 Integrating the above inequality over [0, 1] we have


1

2

  f ta + (1 − t)b dt +



0

Since 

1

1

0

  f ta + (1 − t)b dt =



0

1

 
  a+b . (1.6.4) f (1 − t)a + tb dt
f 2

  f (1 − t)a + tb dt =

0

1 b−a



b

f (x) dx, a

we get inequality (1.6.2) from (1.6.4). For the proof of (1.6.3), we first note that if f ∈ Q(I ) then, for all a, b ∈ I and λ ∈ [0, 1], it yields   λ(1 − λ)f λa + (1 − λ)b  (1 − λ)f (a) + λf (b) and

  λ(1 − λ)f (1 − λ)a + λb  λf (a) + (1 − λ)f (b).

By adding these inequalities and integrating the resulting inequality on [0, 1], we find that  1      λ(1 − λ) f λa + (1 − λ)b + f (1 − λ)a + λb dλ 0

 f (a) + f (b).

(1.6.5)

Moreover, 

1

  λ(1 − λ)f λa + (1 − λ)b dλ

0

 =

1

  λ(1 − λ)f (1 − λ)a + λb dλ

0

=

1 b−a

 a

b

(b − x)(x − a) f (x) dx. (b − a)2

We get (1.6.3) by combining (1.6.5) with (1.6.6).

(1.6.6)

67

1.6. Inequalities of Hadamard Type I

The constant equal to 4 in (1.6.2) is the best possible because this inequality reduces to an equality for the function  a+b   1, a  x < 2 , f (x) = 4, x = a+b 2 ,   a+b 1, 2 < x  b. Moreover, this function is of the class Q(I ) because f (x) f (y) 1 1 +
+ λ 1−λ λ 1−λ = g(λ)
min g(λ) 0<λ<1


   1 = 4
f λx + (1 − λ)y . =g 2 The proof is complete.



In [93] the following class of functions is introduced. A mapping f : I → R, belongs to the class P (I ) (I is an interval from R) if it is nonnegative and, for all x, y ∈ I and λ ∈ [0, 1], satisfies the inequality   f λx + (1 − λ)y  f (x) + f (y). (1.6.7) Obviously, Q(I ) ⊃ P (I ) and for applications it is important to note also that P (I ) contains all monotone, convex and quasi-convex functions, that is, functions satisfying f (λx + (1 − λ)y)  max(f (x), f (y)). In [93] the following version of Hadamard’s inequality in the restricted class of functions is given. T HEOREM 1.6.2. Let f ∈ P (I ), a, b ∈ I , with a < b and f ∈ L1 [a, b]. Then
  b   a+b 2 f  f (x) dx  2 f (a) + f (b) . (1.6.8) 2 b−a a Both inequalities are the best possible. P ROOF. According to (1.6.7) with x = ta + (1 − t)b, y = (1 − t)a + tb, t ∈ [0, 1], and λ = 1/2 we find that 
    a+b  f ta + (1 − t)b + f (1 − t)a + tb . f 2

68

Chapter 1. Inequalities Involving Convex Functions

Integrating the above inequality with respect to t over [0, 1], we obtain   1
     a+b  f ta + (1 − t)b + f (1 − t)a + tb dt f 2 0  b 2 f (x) dx, = b−a a and the first inequality is proved. The proof of the second inequality follows by using (1.6.7) with x = a, y = b and integrating with respect to λ over [0, 1]. The first inequality in (1.6.8) reduces to an equality for the (nondecreasing) function  0, a  x < a+b 2 , f (x) = a+b 1, 2  x  b, and the second inequality reduces to an equality for the (nondecreasing) function  0, x = a, f (x) = 1, a < x  b. The proof is complete.



In [128] versions of the upper Hadamard inequality are developed for r-convex and r-concave functions. Recall that a positive function f is log-convex on a real interval [a, b] if, for all x, y ∈ [a, b] and λ ∈ [0, 1], we have   f λx + (1 − λ)y  f (x)λ f (y)1−λ . (1.6.9) If the reverse inequality holds, f is termed log-concave. Also the power mean Mr (x, y; λ) of order r of positive numbers x, y is denoted by  1/r λx r + (1 − λ)y r if r = 0, Mr (x, y; λ) = if r = 0. x λ y 1−λ In the special case λ = 1/2, we contract this notation to Mr (x, y). In view of the above, a natural generalizing concept is that of r-convexity. A positive function f is r-convex on [a, b] if, for all x, y ∈ [a, b] and λ ∈ [0, 1],     f λx + (1 − λ)y  Mr f (x), f (y); λ . (1.6.10) The definition of r-convexity naturally complements the concept of r-concavity, in which the inequality is reversed. We have that 0-convex functions are simply

69

1.6. Inequalities of Hadamard Type I

log-convex functions and 1-convex functions are ordinary convex functions. For the latter the requirement that r-convex function be positive can clearly be relaxed. Again, in all the above, we may take a real linear space X in place of the real line. The condition x, y ∈ [a, b] then becomes x, y ∈ U for U a convex set in X. In [128] the authors have developed Hadamard-type inequalities for log-convex functions and more generally for r-convex functions. It is convenient to separate the proof of the former special case as the functional representations differ in detail from those of the general case. It will be convenient to invoke the logarithmic mean L(x, y) of two positive numbers x, y, which is given by  x−y , x = y, L(x, y) = ln x−ln y x, x = y, and the generalized logarithmic means of order r of positive numbers x, y, defined by  r x r+1 −y r+1   r+1 x r −y r , r = 0, −1, x = y,    x−y r = 0, x = y, Fr (x, y) = ln x−ln y ,   ln x−ln y  r = −1, x = y,   xy x−y , x, x=y (see [194]). The following theorem proved in [128] deals with a version of the upper Hadamard inequality for log-convex functions. T HEOREM 1.6.3. Let f be a positive, log-convex function on [a, b]. Then  b   1 f (t) dt  L f (a), f (b) . b−a a For f a positive log-concave function, the inequality is reversed. P ROOF. First suppose that f (a) = f (b). By (1.6.9) we have  1  b   f (t) dt = (b − a) f sb + (1 − s)a ds a

0

  (b − a)

1

f (b)s f (a)1−s ds

0

= (b − a)f (a)

 1 0

f (b) f (a)

s ds

70

Chapter 1. Inequalities Involving Convex Functions



f (b) 1 f (b) s ln = (b − a)f (a) f (a) f (a) 0 f (b) − f (a) ln f (b) − ln f (a)   = (b − a)L f (a), f (b) .

= (b − a)

For f (a) = f (b), we have with the same development 

b

 f (t) dt = (b − a)

a

1

  f sb + (1 − s)a ds

0

  (b − a)

1

f (b)s f (a)1−s ds

0

 = (b − a)

1

f (a) ds 0

= (b − a)f (a)   = (b − a)L f (a), f (b) . 

The proof is complete. A similar proof gives the following generalization established in [128].

T HEOREM 1.6.4. Let f be a positive, log-convex function on a convex set U ⊂ X, where X is a linear vector space. Then for a, b ∈ U , 

1

    f sa + (1 − s)b ds  L f (a), f (b) .

0

The following inequalities may be derived by way of corollaries to Theorems 1.6.3 and 1.6.4. C OROLLARY 1.6.1. Let f be a positive log-convex function on [a, b]. Then 1 b−a



b

f (t) dt a

 min

x∈[a,b]

(x − a)L(f (a), f (x)) + (b − x)L(f (x), f (b)) . b−a

(1.6.11)

71

1.6. Inequalities of Hadamard Type I

If f is a positive log-concave function, then 1 b−a



b

f (t) dt a

(x − a)L(f (a), f (x)) + (b − x)L(f (x), f (b)) . x∈[a,b] b−a


max

(1.6.12)

P ROOF. Let f be a positive log-convex function. Then by Theorem 1.6.3, we have that  b  x  b f (t) dt = f (t) dt + f (t) dt a

a

x

     (x − a)L f (a), f (x) + (b − x)L f (x), f (b)

for all x ∈ [a, b], whence (1.6.11). Similarly we can prove (1.6.12).



C OROLLARY 1.6.2. Let f be a positive log-convex function on [a, b]. Then 1 b−a

 a

b




n i 1 i−1 (b − a) , f a + (b − a) . f (t) dt  L f a+ n n n i=1

If f is a positive log-concave function, then inequality is reversed. P ROOF. The result follows by applying Theorem 1.6.3 to the integrals on the right-hand side in 

b

f (t) dt =

n  

a

a+i(b−a)/n

f (t) dt.

i=1 a+(i−1)(b−a)/n



C OROLLARY 1.6.3. (a) Let f be a positive log-convex function on [a, b]. Then 1 b−a



b

  f (t) dt  M1/3 f (a), f (b) ,

a

while if f is log-concave, then 1 b−a

 a

b

f (t) dt


 f (a)f (b).

(1.6.13)

72

Chapter 1. Inequalities Involving Convex Functions

(b) Let f be a positive, log-convex function on a convex set U ⊂ X, where X is a linear vector space. Then for a, b ∈ U ,  1     f sa + (1 − s)b ds  M1/3 f (a), f (b) , 0

while if f is log-concave, then  1    f sa + (1 − s)b ds
f (a)f (b). 0

P ROOF. Part (a) follows from Theorem 1.6.3 and the inequalities G(a, b)  L(a, b)  M1/3 (a, b), where L(a, b), Mr (a, b) are as defined above and G(a, b) is the geometric mean (see also [194]). Part (b) follows similarly from Theorem 1.6.4.  In [128] the following Hadamard-type inequality for r-convex functions is proved. T HEOREM 1.6.5. Suppose f is a positive r-convex function on [a, b]. Then  b   1 f (t) dt  Fr f (a), f (b) . b−a a If f is a positive r-concave function, then the inequality is reversed. P ROOF. The case r = 0 has been dealt with Theorem 1.6.3. Suppose that r = 0, −1. First assume that f (a) = f (b). By (1.6.10) we have  1  b   f (t) dt = (b − a) f sb + (1 − s)a ds a

0

  (b − a)

1

1/r sf r (b) + (1 − s)f r (a) ds

0

 = (b − a)

f r (b)

f r (a)

t 1/r dt f r (b) − f r (a)

r f r+1 (b) − f r+1 (a) r + 1 f r (b) − f r (a)   = (b − a)Fr f (a), f (b) .

= (b − a)

73

1.7. Inequalities of Hadamard Type II

For f (a) = f (b), we have similarly 

b

 f (t) dt  (b − a)

a

1

1/r sf r (a) + (1 − s)f r (a) ds

0

= (b − a)f (a)   = (b − a)Fr f (a), f (a) . Finally, let r = −1. For f (a) = f (b), we have again 

b

 f (t) dt  (b − a)

a

1

−1 sf −1 (b) + (1 − s)f −1 (a) ds

0

= =

b−a 1/f (b) − 1/f (a)



1/f (b)

t −1 dt

1/f (a)


 1 1 b−a ln − ln 1/f (b) − 1/f (a) f (b) f (a)

ln f (a) − ln f (b) f (a) − f (b)   = (b − a)F−1 f (a), f (b) .

= (b − a)f (a)f (b)

When f (a) = f (b) the proof is similar.



In concluding this section, we note that in [365] the authors have obtained some generalizations of the extensions of Hadamard’s inequality to r-convex functions involving Stolarsky means. For inequalities of Hadamard’s type, see also [118, 220].

1.7 Inequalities of Hadamard Type II The classical inequality of the Hadamard type has been generalized and extended in several directions. In this section we shall give some results on refinements and variants of Hadamard’s inequality given by various investigators. In 1992, Dragomir [84] has obtained some refinements of Hadamard’s inequalities (1.5.1) by considering the following two mappings involving convex functions   b
1 a+b H (t) = dx (1.7.1) f tx + (1 − t) b−a a 2

74

Chapter 1. Inequalities Involving Convex Functions

and 1 F (t) = (b − a)2

 b a

b

  f tx + (1 − t)y dx dy,

(1.7.2)

a

where f : [a, b] → R is a convex function and H and F are real-valued functions defined on [a, b]. The main results given in [84] are given in the following two theorems. T HEOREM 1.7.1. Let f : [a, b] → R be a convex function. Then (i) H is convex on [0, 1]. (ii) We have


a+b inf H (t) = H (0) = f t∈[0,1] 2 and 1 sup H (t) = H (1) = b − a t∈[0,1]





b

f (x) dx. a

(iii) H increases monotonically on [0, 1]. P ROOF. (i) Let α, β
0 with α + β = 1 and t1 , t2 ∈ [0, 1]. Then H (αt1 + βt2 ) 
  b

1 a+b a+b = + β t2 x + (1 − t2 ) dx f α t1 x + (1 − t1 ) b−a a 2 2   b
1 a+b dx α f t1 x + (1 − t1 ) b−a a 2   b
1 a+b dx +β f t2 x + (1 − t2 ) b−a a 2 = αH (t1 ) + βH (t2 ) which shows that H is convex in [0, 1]. (ii) We shall prove the following inequalities
 a+b f  H (t) 2 
 b 1 a+b t f (x) dx + (1 − t)f b−a a 2

75

1.7. Inequalities of Hadamard Type II

1  b−a



b

f (x) dx

(1.7.3)

a

for all t in [0, 1]. By Jensen’s integral inequality, we have
H (t)
f
=f

1 b−a

 b

tx + (1 − t)

a



 a+b dx 2

a+b . 2

Now, using the convexity of f , we get  b




 a+b dx 2 a 
 b 1 a+b , =t f (x) dx + (1 − t)f b−a a 2

H (t) 

1 b−a

tf (x) + (1 − t)f

and the second inequality in (1.7.3) is proven. The last inequality is obvious because the mapping 1 g(t) = t b−a

 a

b




a+b f (x) dx + (1 − t)f 2



is increasing monotonically on [0, 1]. (iii) Let t1 , t2 ∈ (0, 1) with t2 > t1 . Then, H being convex on (0, 1), H (t2 ) − H (t1 )
H+
(t1 ) t2 − t1 
  b
a+b 1 a+b
x− dx. = f t1 x + (1 − t1 ) b−a a + 2 2 Since f is convex on [a, b], we deduce that


 a+b − f t1 x + (1 − t1 ) 2

 a+b a+b

t1 f+ t1 x + (1 − t1 ) −x 2 2

a+b f 2






76

Chapter 1. Inequalities Involving Convex Functions

for every x in [a, b]. Thus



 a+b a+b t1 x + (1 − t1 ) x− dx 2 2 a 
  b
1 a+b 1 a+b dx − f
f t1 x + (1 − t1 ) t1 b − a a 2 2 
1 a+b H (t1 ) − f
0. = t1 2

1 b−a



b

f+


Consequently H (t2 ) − H (t1 )
0 for 1
t2 > t1
0 which shows that H increases monotonically on [0, 1]. The proof is complete.  T HEOREM 1.7.2. Let f : [a, b] → R be a convex function. Then (i) F (σ + 12 ) = F ( 12 − σ ) for all σ ∈ [0, 12 ]. (ii) F is convex on [0, 1]. (iii) We have sup F (t) = F (0) = F (1) = t∈[0,1]

and inf F (t) = F

t∈[0,1]

1 b−a



b

f (x) dx a


  b b
1 1 x +y = dx dy. f 2 2 (b − a)2 a a

(iv) The following inequality is valid

 a+b 1 f F . 2 2 (v) F decreases monotonically on [0, 12 ] and increases monotonically on [ 12 , 1]. (vi) We have the inequality H (t)  F (t)

for all t ∈ [0, 1].

P ROOF. (i) Let σ ∈ [0, 12 ]. We have


1 F σ+ 2



1 = (b − a)2

 b a

b a




  1 1 x+ f σ+ − σ y dx dy 2 2

77

1.7. Inequalities of Hadamard Type II


   b b

1 1 1 −σ x + σ + y dx dy = f 2 2 (b − a)2 a a 
1 −σ . =F 2 (ii) The argument is similar to that in the proof of Theorem 1.7.1(i). (iii) For all x, y in [a, b] and t in (0, 1], we have   f tx + (1 − t)y  tf (x) + (1 − t)f (y). Integrating this inequality in [a, b] × [a, b] we get  b b  b b     tf (x) + (1 − t)f (y) dx dy f tx + (1 − t)y dx dy  a

a

a

a



= (b − a)

b

f (x) dx a

which shows that F (t)  F (0) = F (1) for all t in [0, 1]. Since f is convex on [a, b] for all t ∈ [0, 1] and x, y in [a, b], we have
    x +y 1  f tx + (1 − t)y + f ty + (1 − t)x
f . 2 2 Integrating this inequality in [a, b] × [a, b] we deduce   b b
x+y dx dy f 2 a a      1 b b   f tx + (1 − t)y + f ty + (1 − t)x dx dy 2 a a  b b   = f tx + (1 − t)y dx dy a

a

which implies that F (1/2)  F (t) for all t in [0, 1], and the statement is proven. (iv) Using Jensen’s inequality for double integrals we have 
   b b
 b b
x +y 1 1 x +y dx dy
f dx dy . f 2 2 (b − a)2 a a (b − a)2 a a Since a simple computation shows that   b b
1 x+y a+b dx dy = , 2 2 (b − a)2 a a

78

Chapter 1. Inequalities Involving Convex Functions

the proof is complete. (v) Since f is convex on (0, 1), we have for t2 > t1 , t1 , t2 ∈ ( 12 , 1), F (t2 ) − F (t1 ) 1
F+
(t1 ) = t2 − t1 (b − a)2

 b a

a

b

  f+
t1 x + (1 − t1 )y (x − y) dx dy.

By the convexity of f on [a, b], we deduce
     (x − y)(1 − 2t1 ) x +y f − f t1 x + (1 − t1 )y
f+
t1 x + (1 − t1 )y 2 2 for all x, y in [a, b] and t1 ∈ ( 12 , 1), which is equivalent to 
    2 x +y
(x − y)f+ t1 x + (1 − t1 )y
f t1 x + (1 − t1 )y − f . 2t1 − 1 2 Integrating on [a, b] × [a, b] we obtain

1 2 F+
(t1 )
F (t1 ) − F
0, 2t1 − 1 2


t1 ∈

 1 ,1 , 2

which shows that F increases monotonically on [ 12 , 1]. The fact that F increases monotonically on [0, 12 ] follows from the above conclusion using statement (i). (vi) A simple computation shows that   b
 b   1 1 tx + (1 − t)y dy dx. f H (t) = b−a a b−a a Using Jensen’s integral inequality we derive   b
 b   1 H (t)  tx + (1 − t)y dy dx f (b − a)2 a a for all t in [0, 1], and the proof is complete.



In [89] Dragomir and Ionescu have given the following theorem. T HEOREM 1.7.3. Let f : C ⊆ X → R be a convex mapping on a convex subset C of a linear space X. For a, b two given elements in C, define the mapping F (a, b) : [0, 1] → R by F (a, b)(t) =

   1  f ta + (1 − t)b + f (1 − t)a + tb 2

79

1.7. Inequalities of Hadamard Type II

for all t in [0, 1]. Then (i) (ii) (iii) (iv) (v)

F (a, b)(σ + 12 ) = F (a, b)( 12 − σ ) for all σ in [0, 12 ]. supt∈[0,1] F (a, b)(t) = F (a, b)(0) = F (a, b)(1) = (f (a) + f (b))/2. inft∈[0,1] F (a, b)(t) = F (a, b)( 12 ) = f ( a+b 2 ). F (a, b) is convex on [0, 1]. We have the generalized Hadamard inequalities






  f (a) + f (b) . (1.7.4) f ta + (1 − t)b dt  2 0 (vi) Let pi
0 with Pn = ni=1 pi > 0 and ti are in [0, 1] for all i = 1, . . . , n. Then we have the following inequalities   
n 1  a+b  F (a, b) f pi t i 2 Pn a+b f 2



1

i=1

 

1 Pn

n 

pi F (a, b)(ti )

i=1

f (a) + f (b) , 2

(1.7.5)

which is the discrete variant of Hadamard’s result. Moreover, if we assume that X = R and a, b in C, a < b, here C is an interval of real numbers, we also have (vii) F (a, b) is monotone decreasing on [0, 12 ] and monotone increasing on [ 12 , 1]. (viii) We have the identity 

b a

1 F (a, b)(t) dt = b−a



b

f (x) dx. a

(ix) Hadamard’s inequalities hold, that is,


a+b f 2



1  b−a

 a

b

f (x) dx 

f (a) + f (b) . 2

(x) If f is differentiable on [a, b], then
  a+b f (a) + f (b) b − a 
f
− f (b) − f
(a) . 2 2 2

80

Chapter 1. Inequalities Involving Convex Functions

P ROOF. (i) A simple computation shows that 
1 F (a, b) σ + 2


 


  1 1 1 1 1 σ+ a+ −σ b +f −σ a+ σ + b = f 2 2 2 2 2 
1 −σ = F (a, b) 2 for all σ in [0, 12 ], which proves the statement. (ii) Using the convexity of f we get F (a, b)(t) 

 f (a) + f (b) 1 tf (a) + (1 − t)f (b) + (1 − t)f (a) + tf (b) = 2 2

for all t in [0, 1] and F (a, b)(0) = F (a, b)(1) =

f (a) + f (b) , 2

which proves the assertion. (iii) By the convexity of f , we also have


 ta + (1 − t)b + (1 − t)a + tb a+b F (a, b)(t)
f =f 2 2 for all t in [0, 1] and



 1 a+b F (a, b) =f , 2 2

which shows the statement. (iv) Let α, β
0 with α + β = 1 and t1 , t2 ∈ [0, 1]. Then F (a, b)(αt1 + βt2 ) =



   1   f α t1 a + (1 − t1 )b + β t2 a + (1 − t2 )b 2      +f α (1 − t1 )a + t1 b + β (1 − t2 )a + t2 b    1  αf t1 a + (1 − t1 )b + βf t2 a + (1 − t2 )b 2     + αf (1 − t1 )a + t1 b + βf (1 − t2 )a + t2 b

= αF (a, b)(t1 ) + βF (a, b)(t2 ), which shows that F (a, b) is convex on [0, 1].

81

1.7. Inequalities of Hadamard Type II

(v) F (a, b) being convex on [0, 1], it is integrable on [0, 1] and by (ii) and (iii), we get   1
f (a) + f (b) a+b  . F (a, b)(t) dt  f 2 2 0 Since a simple calculation shows that  1  F (a, b)(t) dt = 0

1

  f ta + (1 − t)b dt,

0

the proof of inequality (1.7.4) is complete. (vi) The first inequality in (1.7.5) is obvious from (iii). The second inequality follows by Jensen’s inequality applied for the convex mapping F (a, b). To prove the last inequality in (1.7.5), by (ii) we observe that F (a, b)(ti ) 

f (a) + f (b) 2

for all i = 1, . . . , n. By multiplying with pi
0 and summing these inequalities over i from 1 to n, we obtain the desired inequality. (vii) F (a, b) being convex on (0, 1) for all t2 > t1 , with t1 , t2 ∈ [ 12 , 1), we have F (a, b)(t2 ) − F (a, b)(t1 ) t2 − t1
F
(a, b)(t1 )    b−a
 f+ (1 − t1 )a + t1 b − f+
t1 a + (1 − t1 )b . = 2 Since t1 ∈ [ 12 , 1), we have (1 − t1 )a + t1 b
t1 a + (1 − t1 )b and because f+
is monotone increasing on (a, b), we deduce that     f+
(1 − t1 )a + t1 b
f+
t1 a + (1 − t1 )b , that is, F (a, b) is monotone increasing on [ 12 , 1) and by (ii) also in [ 12 , 1]. The fact that F (a, b) is monotone decreasing on [0, 12 ] goes likewise. (viii) It is easy to observe that  b  1   1 f ta + (1 − t)b dt = f (x) dx. b−a a 0 (ix) Follows by (v) and (viii).

82

Chapter 1. Inequalities Involving Convex Functions

(x) Since f is differentiable on [a, b], we have   f ta + (1 − t)b
f (a) + (1 − t)(b − a)f
(a),   f (1 − t)a + tb
f (a) + t (b − a)f
(a), for all t in [0, 1]. Summing these inequalities we get F (a, b)(t)
f (a) +

b−a
f (a). 2

F (a, b)(t)
f (b) −

b−a
f (b) 2

The fact that

for t ∈ [0, 1], goes likewise.



The next theorem deals with the inequalities of Hadamard’s type for Lipschitzian mappings given in [92]. T HEOREM 1.7.4. Let f : I ⊆ R → R be an M-Lipschitzian mapping on I and a, b ∈ I with a < b. Then we have the inequalities 
   b  a+b  M 1 f − (1.7.6) f (x) dx   (b − a)  2 b−a a 4 and

   b  f (a) + f (b)  M 1  − f (x) dx   (b − a),  2 b−a a 3

(1.7.7)

where M > 0 is a Lipschitzian constant. P ROOF. Let t ∈ [0, 1]. Then we have for all a, b ∈ I ,    tf (a) + (1 − t)f (b) − f ta + (1 − t)b        = t f (a) − f ta + (1 − t)b + (1 − t) f (b) − f ta + (1 − t)b         t f (a) − f ta + (1 − t)b  + (1 − t)f (b) − f ta + (1 − t)b         tM a − ta + (1 − t)b  + (1 − t)M b − ta + (1 − t)b  = 2t (1 − t)M|b − a|. If we choose t = 1/2, we have also  
 f (a) + f (b) a + b  M  −f    2 |b − a|. 2 2

(1.7.8)

(1.7.9)

83

1.7. Inequalities of Hadamard Type II

If we put ta + (1 − t)b instead of a and (1 − t)a + tb instead of b in (1.7.9), respectively, then we have  
 f (ta + (1 − t)b) + f ((1 − t)a + tb) a + b   −f   2 2 

M|2t − 1| |b − a| 2

(1.7.10)

for all t ∈ [0, 1]. If we integrate inequality (1.7.10) on [0, 1], we have   1


  1 1     a + b   f ta + (1 − t)b dt + f (1 − t)a + tb dt − f  2 2 0 0  M|b − a| 1  |2t − 1| dt. 2 0 Thus, from 

1

  f ta + (1 − t)b dt =

0



1

  f (1 − t)a + tb dt

0

1 = b−a and



1

0



b

f (x) dx a

1 |2t − 1| dt = , 2

we obtain inequality (1.7.6). Note that, by inequality (1.7.8), we have    tf (a) + (1 − t)f (b) − f ta + (1 − t)b   2t (1 − t)M(b − a) for all t ∈ [0, 1] and a, b ∈ I with a < b. Integrating on [0, 1], we have    1  1  1     f (a) t dt + f (b) (1 − t) dt − f ta + (1 − t)b dt   0



 2M(b − a)

0

1

0

t (1 − t) dt.

0

Hence from  0

1

 t dt = 0

1

1 (1 − t) dt = 2

 and 0

1

1 t (1 − t) dt = , 6

84

Chapter 1. Inequalities Involving Convex Functions

we have

   b  M  f (a) + f (b) 1  f (x) dx   (b − a) −  2 b−a a 3

and so we have inequality (1.7.7). The proof is complete.



For various other inequalities of Hadamard’s type, see [47,135,349,356,357] and the references cited therein.

1.8 Some Inequalities Involving Concave Functions There exists a vast literature on inequalities involving concave functions. In [203, 204] Maligranda, Peˇcari´c and Persson and in [364] Pearce and Peˇcari´c have given generalizations of well-known inequalities of Grüss [133], Barnes [15], Borell [37–39], Favard [111] and Berwald [28] which involve concave functions. This section deals with inequalities given in the above mentioned papers. The following inequalities are well known. Let f and g denote nonnegative concave functions on [0, 1]. (i) If p, q
1, then 

1

f (x)g(x) dx


0

(p + 1)1/p (q + 1)1/q f p gq . 6

(1.8.1)

(p + 1)1/p (q + 1)1/q f p gq . 3

(1.8.2)

(ii) If 0 < p, q  1, then 

1

f (x)g(x) dx 

0

1 For p > 0 and f
0, we use the usual notation f p = ( 0 |f |p dx)1/p . Inequalities (1.8.1) and (1.8.2) in general were proved by Barnes [15]. In the case p = q = 1, inequalities (1.8.1) and (1.8.2) were proved by Grüss [133]. We note that from inequality (1.8.1) it follows, in the special case q = 1, g(x) = 1, the Favard inequality [111]  0

1

f (x) dx


(p + 1)1/p f p , 2

p
1,

(1.8.3)

and similarly with (1.8.2). Therefore we quote (1.8.1) and (1.8.2) as Grüss–Barnes inequalities. In [37] Borell observes the following inequality.

85

1.8. Some Inequalities Involving Concave Functions

Let f and g be nonnegative concave functions on [a, b]. If p, q
1, then  1 f (x)g(x) dx 0




(p + 1)1/p (q + 1)1/q f (0)g(0) + f (1)g(1) f p gq + . 6 6

(1.8.4)

Inequality (1.8.4) is here referred to as a Borell inequality. Favard [111] proves the following result. Let f be nonnegative and not identically zero, continuous and a concave function on [a, b], and let φ be a convex function on [0, 2f¯], where f¯ =

b 1 b−a a f (t) dt. Then 1 b−a

 a

b

  1 φ f (t) dt  2f¯



2f¯

 φ(y) dy =

0

1

  φ 2s f¯ ds.

(1.8.5)

0

In [28] Berwald proves the following generalization of Favard’s inequality. Let f be nonnegative and not identically zero, continuous and a concave function on [a, b], and let ψ be a strictly increasing function on [0, ∞). Assume that φ is a convex function with respect to ψ, that is, φ ◦ ψ −1 is convex function on [0, ∞). If z¯ is a positive (i.e., nonnegative and not identically zero) root of the equation    1 z¯ 1 ψ f (t) dt, (1.8.6) ψ(y) dy = z¯ 0 b−a then  1  b    1 1 z¯ φ f (t) dt  φ(y) dy = φ(s z¯ ) ds. (1.8.7) b−a a z¯ 0 0 The rearrangement function is important and useful in inequalities of different type in the theory of symmetric spaces and in the theory of interpolation of operators. Therefore many properties of rearrangement are known. In [202] Maligranda has given an important property concerning the concavity and convexity of rearrangement. For a measurable function f on an interval [0, a], 0 < a < ∞, the distribution function df is defined on [0, ∞) by     df (λ) = m s ∈ I : f (s) > λ , λ
0, and the decreasing rearrangement f ∗ on [0, ∞) by   f ∗ (t) = inf λ
0: df (λ)  t ,

t
0.

86

Chapter 1. Inequalities Involving Convex Functions

The functions df and f ∗ are decreasing and right continuous. The function df is bounded by mI = a and so f ∗ (t) = 0 for t
a. Moreover, if af = ess infx∈I |f (x)| > 0 then df (λ) = a for 0  λ < af , and if bf = ess supx∈I |f (x)| < ∞ then df (λ) = 0 for λ
bf . Furthermore, f ∗ (df (λ))  λ, df (f ∗ (t))  t and f ∗ (df (λ) − δ) > λ provides that df (λ)
δ > 0, df (f ∗ (t) − ε) > t provides that f ∗ (t)
ε > 0, and if df happens to be continuous and strictly decreasing, then f ∗ is simply the inverse function of df on the appropriate interval. A function f defined on an interval J ⊂ [0, ∞) is said to be concave on J if for all x, y ∈ J and 0  α  1, we have   f αx + (1 − α)y
αf (x) + (1 − α)f (y). In [202] the following theorem is given. T HEOREM 1.8.1. Let f be a positive measurable function on I = [0, a]. (a) If f is concave on I , then df is concave on [0, bf ) and f ∗ is concave on I . (b) If f is convex on I , then df is convex on [af , ∞) and f ∗ is convex on [0, ∞). P ROOF. (a) Suppose that f is a positive concave function on I . Set Af (λ) = {x ∈ I : f (x) > λ}, λ
0. Then df (λ) = m(Af (λ)) and for 0  λ1 , λ2 < bf , 0 < α < 1,   Af αλ1 + (1 − α)λ2 ⊃ αAf (λ1 ) + (1 − α)Af (λ2 ). The sets Af (λ1 ) and Af (λ2 ) are convex. Therefore there are intervals I1 and I2 where the following equality is true (for measurable subsets I the well-known Brunn–Minkowski theorem gives only inequality
): m(I1 + I2 ) = m(I1 ) + m(I2 ). Thus      df αλ1 + (1 − α)λ2 = m Af αλ1 + (1 − α)λ2  
m αAf (λ1 ) + (1 − α)Af (λ2 )     = αm Af (λ1 ) + (1 − α)m Af (λ2 ) = αdf (λ1 ) + (1 − α)df (λ2 ), that is, df is a concave function on [0, bf ).

1.8. Some Inequalities Involving Concave Functions

87

Now, let for any fixed 0  t1 , t2 < a and sufficiently small ε1 > 0, ε2 > 0, be λ1 = f ∗ (t1 ) − ε1 , λ2 = f ∗ (t2 ) − ε2 . Then   df αλ1 + (1 − α)λ2
αdf (λ1 ) + (1 − α)df (λ2 )     = αdf f ∗ (t1 ) − ε1 + (1 − α)df f ∗ (t2 ) − ε2 > αt1 + (1 − α)t2 , that is,   f ∗ αt1 + (1 − α)t2 > αλ1 + (1 − α)λ2 = αf ∗ (t1 ) + (1 − α)f ∗ (t2 ) − αε1 − (1 − α)ε2 . Also, from the concavity of f we have df (0) = a and so df (αλ1 )
αdf (λ1 ) + (1 − α)df (0) = αdf (λ1 ) + (1 − α)a   = αdf f ∗ (t1 ) − ε1 + (1 − α)a > αt1 + (1 − α)a, which means that   f ∗ αt1 + (1 − α)a > aλ1 = αf ∗ (t1 ) − αε1 = αf ∗ (t1 ) + (1 − α)f ∗ (a) − αε1 . But ε1 , ε2 were arbitrary chosen, therefore f ∗ is concave on I . (b) Suppose that f is a positive convex function on I . Set Bf (λ) = I − Af (λ), λ
0. Then for af  λ1 , λ2 < ∞, 0 < α < 1,   αBf (λ1 ) + (1 − α)Bf (λ2 ) ⊂ Bf αλ1 + (1 − α)λ2 and so   Af αλ1 + (1 − α)λ2     = I − Bf αλ1 + (1 − α)λ2 ⊂ I − αBf (λ1 ) + (1 − α)Bf (λ2 ) . The sets Bf (λ1 ) and Bf (λ2 ) are convex subsets of I , that is, intervals in I .

88

Chapter 1. Inequalities Involving Convex Functions

Therefore      df αλ1 + (1 − α)λ2 = m Af αλ1 + (1 − α)λ2    a − m αBf (λ1 ) + (1 − α)Bf (λ2 )     = a − α a − df (λ1 ) − (1 − α) a − df (λ2 ) = αdf (λ1 ) + (1 − α)df (λ2 ). Thus df is a convex function on [af , ∞). Now, let t1 , t2 ∈ [0, ∞), 0  α  1 and λ1 = f ∗ (t1 ), λ2 = f ∗ (t2 ). Then   df αλ1 + (1 − α)λ2  αdf (λ1 ) + (1 − α)df (λ2 )  αt1 + (1 − α)t2 and so   f ∗ αt1 + (1 − α)t2  αλ1 + (1 − α)λ2 = αf ∗ (t1 ) + (1 − α)f ∗ (t2 ); that is, f ∗ is convex on [0, ∞).



The following inequality given in [203] deals with a generalization of inequality (1.8.3). T HEOREM 1.8.2. Let f and g be nonnegative and concave functions on [0, 1] and let p, q
1. Then  1 (p + 1)1/p (q + 1)1/q f (0)g(0) f p gq + (1 − x)f (x)g(x) dx
12 6 0 (1.8.8) and  0

1

xf (x)g(x) dx


(p + 1)1/p (q + 1)1/q f (1)g(1) f p gq + . 12 6

(1.8.9)

Equality in (1.8.8) and (1.8.9) occurs if either (1) f (x) = 1 − x, g(x) = x (or f (x) = x, g(x) = 1 − x) or (2) f (x) = g(x) = x or (3) f (x) = g(x) = 1 − x. P ROOF. The assumptions that f and g are nonnegative and concave imply that we may assume f, g ∈ C 1 and that we have the following estimates: f (x) − f (y)  (x − y)f
(y)

and g(x) − g(y)  (x − y)g
(y),

89

1.8. Some Inequalities Involving Concave Functions

for all x, y ∈ (0, 1). Therefore, by multiplying the first inequality by g(y) and the second by f (y), and then adding, we obtain   f (x)g(y) + f (y)g(x)  2f (y)g(y) + (x − y) f
(y)g(y) + f (y)g
(y) . Moreover,   (x − y) f
(y)g(y) + f (y)g
(y) = (x − y)(f g)
(y) = f (x)g(y) −

 d (y − x)f (y)g(y) , dy

and we conclude that f (x)g(y) + f (y)g(x) +

 d (y − x)f (y)g(y)  3f (y)g(y). dy

By integrating over y from 0 to x, we obtain 

x

f (x)

 g(y) dy + g(x)

0



x

f (y) dy + xf (0)g(0)  3

0

x

f (y)g(y) dy, 0

that is, d dx






x

f (y) dy 0

x





g(y) dy + xf (0)g(0)  3

0

x

f (y)g(y) dy. 0

Now, an integration with respect to x from 0 to 1 gives 



1

1

f (y) dy 0

g(y) dy +

0

f (0)g(0) 3 2

 1  0

x

f (y)g(y) dy dx,

0

that is, 1 3





1

1

f (x) dx 0

g(x) dx +

0

f (0)g(0)  6



1

(1 − x)f (x)g(x) dx.

(1.8.10)

0

Then using twice the Favard inequality (1.8.3) we obtain (1.8.8). Similarly, by first integrating over y from x to 1 and after that over x from 0 to 1, we obtain 1 3





1

1

f (x) dx 0

0

f (1)g(1)  g(x) dx + 6



1

xf (x)g(x) dx. 0

(1.8.11)

90

Chapter 1. Inequalities Involving Convex Functions

Again using twice the Favard inequality (1.8.3) we obtain (1.8.9). Moreover, it is straightforward to check that we have equality both in (1.8.8) and (1.8.9) for all the cases (1)–(3), and the proof is complete.  As an application of Theorem 1.8.1, Maligranda [202] has obtained the following well-known Favard inequality. T HEOREM 1.8.3. Let f be a positive concave function on I = [0, a]

a not identically zero and let φ be a convex function on [0, 2f¯], where f¯ = a1 0 f (x) dx. Then  2f¯   1 a  1 φ f (x) dx  φ(u) du. (1.8.12) a 0 2f¯ 0 P ROOF. First, we will prove as in [147] that 

a 0


 a x x 2− f (t) dt  f ∗ (t) dt a a 0 ∗

for all x ∈ I.

(1.8.13)

In fact,
 a  x a2 x ∗ x a− f ∗ (t) dt − f (t) dt 2 0 2 0  x  a  a  = (a − t) dt f ∗ (t) dt − (a − t) dt 0

 =

0

x

 (a − t) dt



x

 (a − t) dt

x

0

=

 x 0

a

∗

a

0



x

f (t) dt +

x

0

=

0

f ∗ (t) dt −



0 a

f ∗ (t) dt 

(a − t) dt − 

(a − t) dt

x

x

a



0 x

x

(a − t) dt

f ∗ (t) dt

0

f ∗ (t) dt

0

a

 (a − t)f ∗ (s) − (a − s)f ∗ (t) ds dt,

x

and for 0  t  x < a, we have s = (a − s)/(a − t)t + (1 + (a − s)/(a − t))a. Then, from the concavity of f ∗ , 
a−s ∗ a−s a−s ∗ f ∗ (a) = f (s)
f (t) + 1 − f (t), a−t a−t a−t ∗

91

1.8. Some Inequalities Involving Concave Functions

that is, expression in the last integral is positive and inequality (1.8.13) holds. Let for t ∈ I ,  a −2 g(t) = 2a t f (x) dx. Then

g ∗ (t) = 2a −2 (a 

x

− t)

a 0

0

f (x) dx and (1.8.13) means that

f ∗ (t) dt 



0

x

g ∗ (t) dt

for all x ∈ I.

(1.8.14)

0

Second, we shall need the well-known majorization theorem proved by Hardy, Littlewood and Pólya [141, Theorem 250]. If (1.8.14) holds and φ is a convex function on an interval which contains f ∗ (I ) ∪ g ∗ (I ), then  a  a     φ f ∗ (t) dt  φ g ∗ (t) dt. (1.8.15) 0

0

In fact, for any u, v
0, we have
φ(u) − φ(v)  φ+ (u)(u − v),

x and, using the Stieltjes integral with F (x) = 0 [f ∗ (t) − g ∗ (t)] dt, we get

 0

a

 ∗  ∗ 
f (t) f (t) − g ∗ (t) dt = φ+ =



a

0
φ+

 ∗ 
f (t) dF (t) φ+

 ∗  f (a) F (a) −

 0

a

 ∗ 
f (t) F (t) dφ+

 0, so (1.8.15) holds. Now, since the function f and its rearrangement are equimeasurable, it follows that  a  a  a       φ f (t) dt = φ f ∗ (t) dt  φ g ∗ (t) dt 0

0

 =

a

  φ g(t) dt =



0

=

a 2f¯

2f¯

φ(u) du. 0


φ

0



0 a

 2 ¯ t f dt a

92

Chapter 1. Inequalities Involving Convex Functions



The proof is complete.

The following weighted versions of the majorization lemmas given in [204] will be needed in the proofs of further results. L EMMA 1.8.1. Let v be a weight function. If h is an increasing function on (a, b), then 



x

b

h(t)v(t) dt a

 v(t) dt 

a



b

x

h(t)v(t) dt a

for all x ∈ [a, b].

v(t) dt a

If h is a decreasing function on (a, b), then the reverse inequality holds.

x P ROOF. If a v(t) dt = 0 then v(t) = 0 a.e. on [a, x], and we obtain the equality.

x Now assume that a v(t) dt > 0. If h is increasing, then 



x

b

h(t)v(t) dt a

v(t) dt a



x

=



x

h(t)v(t) dt a

a



b

= =

x

h(t)v(t) dt a



+

a x

 



x

=

v(t) dt x

x

h(t)v(t) dt

v(t) dt a





b

v(t) dt − h(x)

v(t) dt x

x

v(t) dt a

b

v(t) dt x



x

h(t)v(t) dt a

b

b

v(t) dt

b

h(t)v(t) dt a



x



x a

v(t) dt +

b



x

v(t) dt

a

+ h(x) 

v(t) dt −



h(t)v(t) dt a





a

x



b

x

h(t)v(t) dt

h(t)v(t) dt a



b

x



b

v(t) dt x



b

v(t) dt +

h(t)v(t) dt −

a





v(t) dt. a

The proof of the case with decreasing function h is similar.



93

1.8. Some Inequalities Involving Concave Functions

L EMMA 1.8.2. Let w be a weight function and let f and g be positive integrable functions on [a, b]. Suppose that φ : [0, ∞) → R is a convex function and that  x  x f (t)w(t) dt  g(t)w(t) dt for all x ∈ [a, b] a

a

and



b



b

f (t)w(t) dt =

g(t)w(t) dt.

a

a

(i) If f is decreasing on [a, b], then 

b

  φ f (t) w(t) dt 



a

b

  φ g(t) w(t) dt.

b

  φ f (t) w(t) dt.

a

(ii) If g is increasing on [a, b], then 

b

  φ g(t) w(t) dt 

a

 a

P ROOF. If we prove the inequalities for φ ∈ C 1 (0, ∞), then the general case follows from the pointwise approximation of φ by smooth functions. Since φ is a convex function on [0, ∞), it follows that φ(u1 ) − φ(u2 )  φ
(u1 )(u1 − u2 )

for u1 , u2
0.

x If we set F (x) = a [f (t) − g(t)]w(t) dt, then F (x)  0 for all x ∈ [a, b], and F (a) = F (b) = 0. If f is decreasing on [a, b], then 

b

a

    φ f (t) − φ g(t) w(t) dt 



b

   φ
f (t) f (t) − g(t) w(t) dt

b

     b φ f (t) dF (t) = φ
f (t) F (t) a −

a

 =

a



=− a




b

   F (t) d φ
f (t)  0.

 a

b

   F (t) d φ
f (t)

94

Chapter 1. Inequalities Involving Convex Functions

Similarly, if g is increasing, then 

b

    φ g(t) − φ f (t) w(t) dt

a

 

b

   φ
g(t) g(t) − f (t) w(t) dt

b

       b φ
g(t) d −F (t) = − φ
g(t) F (t) a +

b

   F (t) d φ
g(t)  0.

a

 =

a

 =



b

   F (t) d φ
g(t)

a

a



The proof is complete.

Our next theorem deals with a weighted version of the Favard inequality established in [204]. In order to obtain the classical Favard result we need to define a number f¯ connected with a positive concave function f . In the weighted situation the numbers f¯i for an increasing function f , and f¯d of a decreasing function f will in general be different. Of course, in the case when w ≡ 1 these numbers coincide and they are equal to the number f¯ in the Favard result. T HEOREM 1.8.4. (i) Let f be a positive increasing concave function on [a, b]. Assume that φ is a convex function on [0, 2f¯i ], where f¯i =

b (b − a) a f (t)w(t) dt .

b [2 a (t − a)w(t) dt]

(1.8.16)

Then 1 b−a



b

  φ f (t) w(t) dt 

a



1

    φ 2s f¯i w a(1 − s) + bs ds.

(1.8.17)

0

If f is increasing convex function on [a, b] and f (a) = 0, then the reverse inequality in (1.8.17) holds. (ii) Let f be a positive decreasing concave function on [a, b]. Assume that φ is a convex function on [0, 2f¯d ], where f¯d =

b (b − a) a f (t)w(t) dt .

b [2 a (b − t)w(t) dt]

(1.8.18)

95

1.8. Some Inequalities Involving Concave Functions

Then 1 b−a



b

  φ f (t) w(t) dt 

a



1

    φ 2s f¯d w as + b(1 − s) ds.

(1.8.19)

0

If f is a decreasing convex function on [a, b] and f (b) = 0, then the reverse inequality in (1.8.19) holds. P ROOF. (i) For the positive concave function f , the function h, defined by h(t) = f (t)/(t − a), is decreasing on (a, b]. In fact, for a < t1  t2  b, we have 
t1 − a t2 − a − (t1 − a) t2 + a f (t1 ) = f t2 − a t2 − a 
t1 − a t1 − a f (t2 ) + 1 − f (a)
t2 − a t2 − a


t1 − a f (t2 ). t2 − a

Using Lemma 1.8.1 with the weight v(t) = (t −a)w(t) and with the decreasing function h(t) = f (t)/(t − a) we obtain  x  b  x  b (t − a)w(t) dt f (t)w(t) dt  f (t)w(t) dt (t − a)w(t) dt (1.8.20) a

a

a

a

for all x ∈ [a, b]. According to (1.8.16), inequality (1.8.20) can be written in the form  x  x t −a ¯ 2fi w(t) dt  f (t)w(t) dt for all x ∈ [a, b]. a b−a a Then using the majorization lemma (Lemma 1.8.2(ii)) we have (only here we are using the assumption that f is increasing)   b
 b   t −a ¯ 2fi w(t) dt. φ f (t) w(t) dt  φ b−a a a But 1 b−a






b

φ a

 
 2f¯i 1 t −a ¯ b−a dy 2fi w(t) dt = φ(y)w a + y b−a 2f¯i 0 2f¯i  1     = φ 2s f¯i w a(1 − s) + bs ds, 0

and inequality (1.8.17) is proved.

96

Chapter 1. Inequalities Involving Convex Functions

(ii) For the positive concave function f , the function h, defined by h(t) = f (t)/(b − t), is increasing on [a, b]. In fact, for a  t1  t2 < b, we have
 b − t2 b − t1 − (b − t2 ) f (t2 ) = f t1 + b b − t1 b − t1 
b − t2 b − t2 f (b) f (t1 ) + 1 −
b − t1 b − t1


b − t2 f (t1 ). b − t1

Using Lemma 1.8.1 with weight v(t) = (b − t)w(t) and with the increasing function h(t) = f (t)/(b − t) we obtain 



x

b

f (t)w(t) dt a

(b − t)w(t) dt

a



x





(b − t)w(t) dt

a

b

f (t)w(t) dt

(1.8.21)

a

for all x ∈ [a, b]. In view of (1.8.18), inequality (1.8.21) can be written in the form  x  x b−t ¯ 2fd w(t) dt for all x ∈ [a, b]. f (t)w(t) dt  a a b−a Then using the majorization lemma (Lemma 1.8.2(i)) we have (assuming that f is increasing) 

b a

  φ f (t) w(t) dt 






b

φ a

 b−t ¯ 2fd w(t) dt. b−a

But 1 b−a






b

φ a

 
 2f¯d 1 b−t ¯ b−a dy 2fd w(t) dt = φ(y)w b − y b−a 2f¯d 0 2f¯d  1     = φ 2s f¯d w as + b(1 − s) ds, 0

and inequality (1.8.19) follows. The proof of the convex case is similar.



In the following theorem we present a generalization of the Berwald inequality to the weighted case given in [204].

97

1.8. Some Inequalities Involving Concave Functions

T HEOREM 1.8.5. Let φ be a convex function with respect to the strictly increasing function ψ , that is, φ ◦ ψ −1 is convex. (i) If f is a positive increasing concave function on [a, b] and z¯ i is a positive root of the equation
   b   b−a 1 1 z¯ i ψ(y)w a + y dy = ψ f (t) w(t) dt, (1.8.22) z¯ i 0 z¯ i b−a a then 1 b−a



b

  φ f (t) w(t) dt 



a

1

  φ(s z¯ i )w a(1 − s) + bs ds.

(1.8.23)

0

If f is an increasing convex function on [a, b] with f (a) = 0, then the reverse inequality in (1.8.23) holds. (ii) If f is a positive decreasing concave function on [a, b] and if z¯ d is a positive root of the equation
   b   b−a 1 1 z¯ d ψ(y)w b − y dy = ψ f (t) w(t) dt, (1.8.24) z¯ d 0 z¯ d b−a a then 1 b−a



b

  φ f (t) w(t) dt 



a

1

  φ(s z¯ d )w as + b(1 − s) ds.

(1.8.25)

0

If f is a decreasing convex function on [a, b] with f (b) = 0, then the reverse inequality in (1.8.25) holds. P ROOF. (i) If f is a positive increasing concave function on [a, b], then there exists t0 ∈ [a, b] such that [(t0 − a)/(b − a)]¯zi = f (t0 ) and t −a z¯ i  f (t) b−a

for all t ∈ [a, t0 ]

and

t −a z¯ i
f (t) b−a

for all t ∈ [t0 , b]. (1.8.26)

Equality (1.8.22) can be written in the form   b  b
  t −a z¯ i w(t) dt = ψ ψ f (t) w(t) dt. b−a a a We prove that   x  x
  t −a ψ ψ f (t) w(t) dt z¯ i w(t) dt  b − a a a

for all x ∈ (a, b).

(1.8.27)

98

Chapter 1. Inequalities Involving Convex Functions

If a < x  t0 , then inequality (1.8.27) follows immediately from (1.8.26). If t0  x < b, then, by using equality (1.8.22) and the second inequality in (1.8.26), we obtain  t −a z¯ i w(t) dt b−a a    b
 b
t −a t −a z¯ i w(t) dt − z¯ i w(t) dt = ψ ψ b−a b−a a x   b  b
  t −a z¯ i w(t) dt = ψ f (t) w(t) dt − ψ b−a a x  b  b      ψ f (t) w(t) dt − ψ f (t) w(t) dt






x

ψ

a



x x

=

  ψ f (t) w(t) dt.

(1.8.28)

a

According to inequalities (1.8.27) and (1.8.28), the assumption that φ ◦ ψ −1 is convex and Lemma 1.8.2(ii), we find that 

b

  φ f (t) w(t) dt 

a






b

φ a

 t −a z¯ i w(t) dt. b−a

Moreover, 1 b−a

 a

b


  1 z¯ i t −a b−a z¯ i w(t) dt = φ φ(y)w a + y dy b−a z¯ i 0 z¯ i  1   φ(s z¯ i )w a(1 − s) + bs ds, =


0

and inequality (1.8.23) is proved. (ii) If f is a positive decreasing concave function on [a, b], then there exists t1 ∈ [a, b] such that [(b − t1 )/(b − a)]¯zd = f (t1 ) and b−t z¯ d b−a b−t z¯ d f (t)
b−a f (t) 

for all t ∈ [a, t1 ]

and (1.8.29)

for all t ∈ [t1 , b].

99

1.8. Some Inequalities Involving Concave Functions

Equality (1.8.24) can be written in the following form 

b a

  b   b−t z¯ d w(t) dt = ψ ψ f (t) w(t) dt. b−a a


We prove that   x   ψ f (t) w(t) dt  a

x a

 b−t z¯ d w(t) dt ψ b−a


for all x ∈ (a, b).

(1.8.30)

If a < x  t1 , then inequality (1.8.30) follows immediately from (1.8.29). If t1  x < b, then, by using equality (1.8.24) and the second inequality in (1.8.29), we obtain  x   ψ f (t) w(t) dt a



b

= a

  ψ f (t) w(t) dt −




b

  ψ f (t) w(t) dt

x



 b   b−t z¯ d w(t) dt − = ψ ψ f (t) w(t) dt b−a a x    b
 b
b−t b−t ψ ψ  z¯ d w(t) dt − z¯ d w(t) dt b−a b−a a x   x
b−t z¯ d w(t) dt. ψ = b−a a 

b

By using inequality (1.8.30), equality (1.8.24), the assumption that φ ◦ ψ −1 is convex and Lemma 1.8.2(i), we obtain 

b

  φ f (t) w(t) dt 

a






b

φ a

 b−t z¯ d w(t) dt. b−a

Furthermore, 1 b−a






b

φ a


  1 z¯ d b−t b−a z¯ d w(t) dt = φ(y)w b − y dy b−a z¯ d a z¯ d  1   φ(s z¯ d )w as + b(1 − s) ds, = 0

and inequality (1.8.25) is proved.



100

Chapter 1. Inequalities Involving Convex Functions

1.9 Miscellaneous Inequalities 1.9.1 Peˇcari´c and Dragomir [379] Let f : C → R be a convex (concave) function on C, pi
0, i = 1, . . . , n, and Pn = ni=1 pi > 0. Then the following inequality holds 

n 1  f pi x i Pn

  (
)

i=1

 (
)



1

n 

Pnk+1

i1 ,...,ik+1 =1

1 Pnk

n 

1  pi1 · · · pik+1 f xi j k+1 

pi 1 · · · pi k f

i1 ,...,ik =1

k+1

1 xi j k n





j =1

j =1


 n xi 1 + xi 2 1   (
) · · ·  (
) 2 pi 1 pi 2 f 2 Pn i1 ,i2 =1

 (
)

1 Pn

n 

pi f (xi ),

i=1

where k is a positive integer such that 1  k  n − 1. 1.9.2 Dragomir [85] Let f : C → R be a convex mapping, xi ∈ C, pi
0 and Pn = ni=1 pi > 0, where C is a convex subset of real linear space X. Then the following inequality holds   n n 1  1  pi f (xi ) − f pi x i Pn Pn i=1

i=1

n 1  1
pi f (xi ) − k Pn Pn i=1

  1 
 k  kPn

n  i1 ,...,ik =1

1 − k Pn

n  i1 ,...,ik =1



1 pi 1 · · · pi k f xi j k

 k      pi 1 · · · pi k  f (xij )  

n  i1 ,...,ik =1

j =1

k

j =1

  k    1   pi 1 · · · pi k  f xij 
0   k j =1



101

1.9. Miscellaneous Inequalities

for every positive integer k such that 1  k  n. 1.9.3 Dragomir [83] Let f : [0, A] → R be a function such that the mapping g(x) = f (x) − f (A − x) A  A. If xi ∈ [0, A], pi
0, i = 1, . . . , n, is (convex) concave on [0, A], n xij ∈ {xi }i=1,...,n , pij ∈ {pi }i=1,...,n and Pn = i=1 pi > 0, then     n n 1  1  pi x i − f (A − xi )pi f Pn Pn i=1


()

i=1

1

n 

Pnk+1

i1 ,...,ik−1 =1

−


()

1  pi1 · · · pik−1 f xi j k+1

1

n 

Pnk+1

i1 ,...,ik−1 =1

1 Pnk

n 

n  i1 ,...,ik =1

k+1





j =1

 k+1 1  pi1 · · · pik−1 f (A − xij ) k+1 

pi 1 · · · pi k f

i1 ,...,ik =1

1 − k Pn



1 xi j k k



j =1

j =1



 k 1 pi 1 · · · pi k f (A − xij ) k j =1

.. .
()

n n 1  1  pi f (xi ) − pi (A − xi ). Pn Pn i=1

i=1

1.9.4 Peˇcari´c [373] Let the linear spaces X and Y be endowed with partial orders which are compatible with the linear structures of X and Y , respectively. Let D ⊂ X be a convex set. A function f : D → Y is called 1-convex (convex of first order) if and only if the relation
 x +y f (x) + f (y) f  (A) 2 2 holds for all comparable x, y ∈ D (i.e., such that either x  y or y  x). Usually a partial order in X is generated by a cone C ⊂ X and the functions fulfilling (A)

102

Chapter 1. Inequalities Involving Convex Functions

are called (C–J )-convex. Let f : D → Y be a (C–J )-convex function. If either x1  · · ·  xn or x1
· · ·
xn hold for n points x1 , . . . , xn from D, then  n  n 1 1 xi  f (xi ). f n n i=1

i=1

1.9.5 Peˇcari´c [373] Let f : D → Y be a (C–J )-convex function and let xi , i = 1, . . . , n, be points in D chosen so that x1  · · ·  xn . Define
fm,n =

n m

−1




 1
i1 <···
 1 (xi + · · · + xim ) f m 1

for 1  m  n. Then fn,n  · · ·  fm,n  · · ·  f1,n ,

1  m  n,

where D and Y are as in Section 1.9.4. 1.9.6 Mond and Peˇcari´c [219] A mapping f defined on the set T of rectangular matrices with values in the set of (rectangular) matrices is said to be increasing if A  B implies f (A)  f (B). It is decreasing, by definition, if the mapping A → −f (A) is increasing. A mapping f is said to be semi-convex on T if X, Y ∈ T ; X  Y implies that, for any 0 < λ < 1, the convex combination λX + (1 − λ)Y is in T , that is, T is a convex set, and   f λX + (1 − λ)Y  λf (X) + (1 − λ)f (Y ). It is semi-concave, by definition, if the mapping X → −F (X) is semi-convex. Let f be semi-convex on T , let pi , i = 1, . . . , n, be nonnegative numbers with Pn = ni=1 pi > 0 and let Xi ∈ T , i = 1, . . . , n, satisfy X1  X2  · · ·  Xn Then

or

X1
X2
· · ·
Xn .

 n n 1  1  pi X i  pi f (Xi ). f Pn Pn 

i=1

i=1

103

1.9. Miscellaneous Inequalities

1.9.7 Dragomir and Sándor [91] Let f : C ⊆ X → R be a uniformly-convex function defined on a convex subset C of a linear space X, pi
0, Pn = ni=1 pi > 0 and xi ∈ C, i = 1, . . . , n. Then 2    n n n n   1  1  1  1    2 pi f (xi ) − f pi x i
pi xi  −  pi xi 
0.   Pn Pn Pn Pn i=1

i=1

i=1

i=1

1.9.8 Dragomir and Sándor [91] Let a1
· · ·
as , b1
· · ·
bs and q1 , . . . , qs be real numbers such that k 

qi ai 

k 

i=1

qi bi ,

1  k  s − 1,

i=1

s 

qi ai =

i=1

s 

qi bi .

i=1

If f is uniformly-convex on the interval I (I contains ai , bi for i = 1, . . . , n), then s s       qi f (bi ) − f (ai )
qi bi2 − ai2
0. i=1

i=1

1.9.9 Dragomir and Sándor [91] Let x and p be two n-tuples of real numbers such that Pn = ni=1 pi > 0 and 0  Pk  Pn , k = 1, . . . , n − 1, and x is a monotonic n-tuple. Then, for all uniformly-convex functions f : I → R, xi ∈ I , i = 1, . . . , n, we have    2 n n n n  1  1 1  1  pi f (xi ) − f pi x i
pi xi2 − pi xi2
0. Pn Pn Pn Pn i=1

i=1

i=1

i=1

1.9.10 Fejér [114] Let f : [a, b] → R and g : [a, b] → R+ be integrable and symmetric with respect to the line x = (a + b)/2, that is, g((a + b)/2 + t) = g((a + b)/2 − t). Then f (a) + f (b) 2



b a



b

g(t) dt  a


f (t)g(t) dt  f

a+b 2



b

g(t) dt. a

104

Chapter 1. Inequalities Involving Convex Functions

1.9.11 Peˇcari´c [371] If f : [a, b] → R is a convex function and if t ∈ [0, 1], then 0

1 b−a



b

f (x) dx −

a

1 (b − a)2

 b a

b

  f tx + (1 − t)y dx dy

a


  b 1 f (a) + f (b) −  min(t, 1 − t) f (x) dx . 2 b−a a 1.9.12 Peˇcari´c [371] Let p, q > 0, f be convex on I ⊃ [a, b], A = (pa + qb)/(p + q) and c be a real number such that b−a 0
1 0 2c



A+c

1.9.13 Brenner and Alzer [41] Suppose p, q ∈ R+ , let f : [a, b] → R be concave and let g : [a, b] → R+ 0 (where + + R and R0 denote the positive and nonnegative real numbers) be integrable and symmetric with respect to the line x = A = (pa + qb)/(p + q), that is, g(A + t) = g(A − t). If 0y

b−a min(p, q), p+q

then pf (a) + qf (b) p+q



A+y

A−y

 g(t) dt 

A+y

f (t)g(t) dt A−y




f

pa + qb p+q



A+y

g(t) dt. A−y

105

1.9. Miscellaneous Inequalities

1.9.14 Dragomir, Peˇcari´c and Sándor [94] Let f : I → R (I ⊂ R is interval) be a continuous convex function and let a, b ∈ I , n ∈ N = {1, 2, . . . }. Then
f

a+b 2

 


  n

i 1 i f (a) + f (b) a+ 1− b  . n n+1 n+1 2 i=1

1.9.15 Dragomir, Peˇcari´c and Sándor [94] Let f : I → R be a continuous convex function and a, b ∈ I , a < b, n ∈ N (N is the set of natural numbers). Then 
  b  b  n+1 a+b 1 xi f  ··· f dx1 · · · dxn+1 2 n+1 (b − a)n+1 a a i=1   b  b  n xi 1  ··· f dx1 · · · dxn (b − a)n a n a i=1

 .. .

  b b
1 x1 + x2 dx1 dx2 f 2 (b − a)2 a a  b 1 f (a) + f (b) .  f (x) dx  b−a a 2 

1.9.16 Bu¸se, Dragomir and Barbu [49] Let I be an interval with a, b ∈ I 0 (I 0 is an interior of I ) and a < b. If f : I → R is a convex function on I and qi (m)
0 for all i, m ∈ N (N is the set of natural numbers) then  
 b  b
1 a+b q1 (m)x1 + · · · + qm (m)xm dx1 · · · dxm  f · · · f 2 (b − a)m a Qm a  b 1  f (x) dx, b−a a where Qm = q1 (m) + · · · + qm (m) > 0, m ∈ N.

106

Chapter 1. Inequalities Involving Convex Functions

1.9.17 Bu¸se, Dragomir and Barbu [49] Let f : I ⊂ R → R be a convex function on I , a, b ∈ I 0 = (a, b) with a < b and qi (m)
0 for all i, m ∈ N (N is the set of natural numbers). If Qm = q1 (m) + · · · + qm (m) > 0 and 2 (m) q12 (m) + · · · + qm = 0, m→∞ Q2m

lim

then   b  b
1 q1 (m)x1 + · · · + qm (m)xm dx1 · · · dxm lim ··· f m→∞ (b − a)m a Qm a 
a+b . =f 2 1.9.18 Pearce and Peˇcari´c [364] If f : [a, b] → [0, ∞) is continuous and concave, then α+β max f β (x) α + 2β a
x
b



b

 f α (t) dt 

a

b

f α+β (t) dt,

a

holds for all real numbers α and β with α + β > 0 and 0 < β  1. 1.9.19 Brenner and Alzer [41] If f : [a, b] → (0, ∞) is continuous and concave, then


 b  b 1 a + b  dt 1  1 + log f f (t) dt f (a)f (b) . 2 (b − a)2 a a f (t) 1.9.20 Maligranda, Peˇcari´c and Persson [203] Assume that f and g are nonnegative functions on [0, 1] such that the functions f 1/a and g 1/b are concave on [0, 1] for some a, b > 0. (i) If p, q
1, then  0

1

f (x)g(x) dx
B(a + 1, b + 1)(pa + 1)1/p (qb + 1)1/q f p gq .

107

1.9. Miscellaneous Inequalities

Equality occurs if f (x) = cx a and g(x) = d(1 − x)b with c, d positive constants.

1 Here B denotes the usual beta function B(p, q) = 0 x p−1 (1 − x)q−1 dx. (ii) If 0 < p, q  1, then  1 (pa + 1)1/p (qb + 1)1/q f (x)g(x) dx  f p gq . a+b+1 0 Equality occurs if either f (x) = cx a and g(x) = dx b or f (x) = c(1 − x)a and g(x) = d(1 − x)b with c, d positive constants. 1.9.21 Brenner and Alzer [41] For a continuous and concave function f : [a, b] → R,

 b 1 (x − a)f (a) + (b − x)f (b) 1 max f (x) +  f (t) dt. 2 a
x
b b−a b−a a Further, if f is strictly concave on a nondegenerate interval, then the inequality is strict. 1.9.22 Brenner and Alzer [41] If f : [a, b] → R is continuous and concave, then

  b 1 x−a a+x b−x x +b f + f . f (t) dt  min a
x
b b − a b−a a 2 b−a 2 Strict inequality holds if and only if there is a nondegenerate subinterval on which f is strictly concave. 1.9.23 Peˇcari´c, Peri´c and Persson [383] Let f , g be real-valued functions defined on the interval (a, b), −∞  a < b < ∞. We say that f is C-decreasing (C-increasing), C
1, if f (t)  Cf (s) (f (s)  Cf (t)) whenever s  t, t, s ∈ (a, b). Let φ : [0, ∞) → R be a concave, nonnegative and differentiable function such that φ(0) = 0 and let −∞  a < b < ∞. (a) If f is C-decreasing and g is increasing, differentiable and such that g(a + 0) = 0, then
 b   b   φ C f (x) dg(x)  C φ
f (x)g(x) f (x) dg(x). a

a

108

Chapter 1. Inequalities Involving Convex Functions

(b) If f is C-increasing and g is increasing, differentiable and such that g(a + 0) = 0, then 
 b   1 b
 1 f (x) dg(x)
φ f (x)g(x) f (x) dg(x). φ C a C a (c) If f is C-increasing and g is decreasing, differentiable and such that g(b − 0) = 0, then 
 b  b       f (x) d −g(x)  C φ
f (x)g(x) f (x) d −g(x) . φ C a

a

(d) If f is C-decreasing and g is decreasing, differentiable and such that g(b − 0) = 0, then 
 b       1 b
 1 f (x) d −g(x)
φ f (x)g(x) f (x) d −g(x) . φ C a C a (e) If the condition “φ is concave” is replaced by “φ is convex”, then all the above inequalities in (a)–(d) hold in the reversed direction. 1.9.24 Farwing and Zwick [110] Let x0 , . . . , xn be given real numbers, where a  x0  · · ·  xn  b. Let f be a real-valued function defined on [a, b] and let [x0 , . . . , xn ]f denote the nth divided difference of f at the points x0 , . . . , xn . Let f (n) be a convex function on (a, b). Then   n n 1  1  (n) (n) xi  n![x0 , . . . , xn ]f  f (xi ). f n+1 n+1 i=0

i=0

If x0 = xn , then strict inequalities hold if and only if f ∈ / Pn+1 (the space of all polynomials of degree  n + 1). 1.9.25 Abramovich, Mond and Peˇcari´c [1] Let F (x1 , . . . , xn ) be a complex function in n complex variables and let      F (x1 , . . . , xn )  F |x1 |, . . . , |xn | . Let also |F (x1 , . . . , xn )| be a concave function for x = (x1 , . . . , xn ) ∈ Rn . If fi (t), i = 1, . . . , n, w(t) are complex functions of real variables and fi (t)w(t), w(t) are

109

1.9. Miscellaneous Inequalities

integrable on [a, b], then   c      w(t)F f1 (t), . . . , fn (t) dt  A(c) =  a



b 
b     |w(t)f1 (t)| dt c |w(t)fn (t)| dt  w(t) dt F c

, . . . ,

  b b c |w(t)| dt c |w(t)| dt

b

+ c

is a decreasing function in c, a  c  b. 1.9.26 Grüss [133] Let f , g be positive concave integrable functions on I = [0, a]. Then  a  a  a 3 f (s) ds g(s) ds  a f (s)g(s) ds. 2 0 0 0 1.9.27 Bergh [26] Let f be a positive and quasi-concave function on R+ , that is, f (s)  max(1, s t )f (t). Assume that 0 < p  q  ∞ and 0 < α < 1. Then


∞

t

−α

0

q dt f (t) t

1/q

 1/p−1/q  p 1/p q −1/q α(1 − α)




∞

p dt t −α f (t) t

0

1/p ,

where equality holds for f (t) = min(1, t). 1.9.28 Maligranda, Peˇcari´c and Persson [204] Let 1  p < ∞ and let v and w be weight functions. Then the inequality 

b

1/p f p (t)w(t) dt

a



b

C

f (t)v(t) dt a

holds for all positive concave functions f on [a, b] if and only if 1/p K(t, s)p w(t) dt  C < ∞,

b a K(t, s)v(t) dt

 b sup s∈(a,b)

a

(∗)

110

Chapter 1. Inequalities Involving Convex Functions

where K is the kernel given by  K(t, s) =

(s − a)(b − t) if a  s  t  b, (t − a)(b − s) if a  t  s  b.

If 0 < p  1, then the reverse inequality in (∗) is valid if and only if  b a

inf

s∈(a,b)

1/p K(t, s)p w(t) dt
C > 0.

b a K(t, s)v(t) dt

1.9.29 Borell [38] Let f1 , f2 , . . . , fn be nonnegative concave functions on [0, 1] and let pk
1, k = 1, . . . , n. Then  Cn

n 1

fk (x) dx


0 k=1

n 

(pk + 1)1/pk fk pk ,

k=1

1 where for p > 0 and f
0 the usual notation f p = ( 0 f (x)p dx)1/p , Cn = (n + 1)!/([ n2 ]![ n+1 2 ]!). Equality occurs if fk (x) = x, k ∈ I , and fk (x) = 1 − x, k ∈ I
, for the sets of indices such that I ∪ I
= {1, 2, . . . , n} and one of them contains [ n2 ] elements. 1.9.30 Brenner and Alzer [41] Let f1 , f2 , . . . , fn be nonnegative concave functions on [0, 1] and let pk
1, k = 1, 2, . . . , n. Then 

n 1

fk (x) dx

0 k=1


Kn

n  k=1

(1 + pk )

1/pk

fk pk

  n n   1 + fk (0) + fk (1) , 2(n + 1) k=1

k=1

1 where for p > 0 and f
0 the usual notation f p = ( 0 f p (x) dx)1/p and n Kn = [ n−1 2 ]![ 2 ]!/(2(n + 1)(n − 1)!).

1.10. Notes

111

1.10 Notes One of the most fundamental inequalities for convex functions is that associated with the name of Jensen. Theorem 1.2.1 deals with a well-known Jensen inequality [164,165] which finds important applications in various branches of mathematics. Theorem 1.2.2 deals with a Jensen–Steffensen inequality, and its proof is due to Peˇcari´c [367]. Theorem 1.2.3 is due to Peˇcari´c [375] and Theorem 1.2.4 is due to Dragomir and Miloševi´c [90]. Theorem 1.2.5 is taken from Beesack [19]. Theorem 1.3.1 is a generalization of Jensen’s inequality established by Jessen [166] in 1931. The remaining results in Section 1.3 are taken from Beesack and Peˇcari´c [20,376]. The results in Theorems 1.4.1 and 1.4.2 are due to Peˇcari´c [366] and the results in Theorems 1.4.3–1.4.6 are taken from Dragomir and Ionescu [88]. Theorem 1.5.1 deals with the famous Hadamard inequality discovered in [134]. Theorem 1.5.2 is taken from Beesack and Peˇcari´c [20]. Theorems 1.5.3–1.5.6 are due to Dragomir [82,86]. Theorems 1.6.1 and 1.6.2 are taken from Dragomir, Peˇcari´c and Persson [93]. Theorems 1.6.3–1.6.5 are due to Gill, Pearce and Peˇcari´c [128]. Theorems 1.7.1 and 1.7.2 are due to Dragomir [84] and Theorem 1.7.3 is taken from Dragomir and Ionescu [89] while Theorem 1.7.4 is taken from Dragomir, Cho and Kim [92]. Theorem 1.8.1 is taken from Maligranda [202] which deals with an important property concerning the concavity and convexity of rearrangement. Theorem 1.8.2 is taken from Maligranda, Peˇcari´c and Persson [203] and Theorem 1.8.3 is due to Maligranda [202]. Theorems 1.8.4 and 1.8.5 are taken from Maligranda, Peˇcari´c and Persson [204].

This page intentionally left blank

Chapter 2 Inequalities Related to Hardy’s Inequality

2.1 Introduction In the course of attempts to simplify the proof of Hilbert’s double series theorem, G.H. Hardy [136] first proved in 1920 the most famous inequality which is now known in the literature as Hardy’s inequality. Hardy’s inequality is remarkable in terms of its simplicity, the large number of results to which it deals, and the variety of applications which can be related to it. Since from its discovery Hardy’s inequality has evoked the interest of many mathematicians, and large number of papers have appeared which deal with new proofs, various extensions, refinements, generalizations and series analogues. In the past few years, various investigators have discovered many useful and new inequalities related to well-known Hardy’s inequality. This chapter presents a number of new and basic inequalities related to Hardy’s inequality recently investigated in order to achieve a diversity of desired goals.

2.2 Hardy’s Series Inequality and Its Generalizations There is a vast and growing literature related to the series inequalities. In this section we will give some basic inequalities involving series of terms, which find important applications in analysis. In an attempt to give a simple proof of Hilbert’s inequality, Hardy [136] (see also [141, Theorem 315]) establishes the following most fundamental inequality. T HEOREM 2.2.1. If p > 1, an
0 and An = a1 + a2 + · · · + an , then  p 
∞ ∞
 An p p p < an , n p−1 n=1

n=1

113

(2.2.1)

114

Chapter 2. Inequalities Related to Hardy’s Inequality

unless all the a are zero. The constant is the best possible. P ROOF. The proof given here is due to Elliott [105] and is also given in [141]. By relabeling, if necessary, we may assume that a1 > 0 and hence that each An > 0. We write αn for An /n and agree that any number with suffix 0 is equal to 0. Now, by making use of the elementary inequality x n+1 + ny n+1
(n + 1)xy n ,

(2.2.2)

x, y
0 reals, we observe that p

αn −

 p−1 p p  p−1 p αn an = αn − nαn − (n − 1)αn−1 αn p−1 p−1
 np (n − 1)p p−1 p + αn αn−1 = αn 1 − p−1 p−1
 np n−1 p p p  + (p − 1)αn + αn−1  αn 1 − p−1 p−1 =

1  p p (n − 1)αn−1 − nαn . p−1

(2.2.3)

By substituting n = 1, 2, . . . , N in (2.2.3) and adding the inequalities we have N  n=1

N αN p  p−1  0. αn an  − p−1 p−1 p

N

p

αn −

(2.2.4)

n=1

From (2.2.4) we observe that N 

p  p−1 αn an . p−1 N

p

αn 

n=1

(2.2.5)

n=1

Using Hölder’s inequality with indices p, p/(p − 1) on the right-hand side of (2.2.5) we have 1/p  N (p−1)/p  N N   p  p p p αn  an αn . (2.2.6) p−1 n=1

n=1

n=1

Dividing by the last factor on the right-hand side (which is certainly positive) and raising the result to the pth power, we get N  n=1


p αn



p p−1

p  N n=1

p

an .

(2.2.7)

115

2.2. Hardy’s Series Inequality and Its Generalizations

When we make N tend to infinity we obtain (2.2.1), except that we have “less p than or equal to” in place of “less than”. In particular, we see that ∞ n=1 αn is finite. Returning to (2.2.5), and replacing N by ∞, we obtain ∞ 

∞

p

αn 

n=1

p  p−1 αn an p−1 n=1



∞  p p  an p−1

1/p 

n=1

∞ 

(p−1)/p p αn

.

(2.2.8)

n=1 p

p

There is an inequality in the second place unless (an ) and (αn ) are proportion, that is, unless an = Cαn , where C is independent of n. If this is so then (a1 = α1 > 0) C must be 1, and thenpAn = nan for all n. This idea is inconsistent with the convergence of ∞ n=1 an . Hence ∞ 

p αn

n=1

1/p  ∞ (p−1)/p  ∞  p  p p < an αn , p−1 n=1

(2.2.9)

n=1

and (2.2.1) follows from (2.2.9) as (2.2.7) followed from (2.2.6). To prove the constant factor the best possible, we take an = n−1/p ,

n  N,

an = 0,

n > N.

Then ∞ 

p

an =

n=1

An =

n 



N  1 n=1

n

,

 p  (p−1)/p n −1 , p−1 1 1
p
p
 An 1 − εn p , n  N, > n p−1 n v −1/p >

n

x −1/p dx =

n  N,

where εn → 0 when n → ∞. It follows that  ∞
 An p n=1

n

>

 N
 An p n=1

n


>

p p−1

p (1 − ηN )

∞  n=1

p

an ,

116

Chapter 2. Inequalities Related to Hardy’s Inequality

where ηN → 0 when N → ∞. Hence, any inequality of the type  ∞
 An p n=1

n


<

p p−1

p (1 − ε)

∞ 

p

an

n=1



is false if an is chosen as above and N is sufficiently large.

The above theorem states the relationship between the arithmetic means of a sequence and the sequence itself. This theorem along with its integral analogue was first proved by Hardy, which later went by the name “Hardy’s inequality”. The constant at the right-hand side of (2.2.1) is determined by Landu in [182], who showed that it is the best possible for each p. There are many generalizations and extensions of Theorem 2.2.1, which have been proved by different writers in different ways; and we give some of these results here in the following theorems. In 1926, Copson [69] generalizes Theorem 2.2.1 by replacing the arithmetic mean of a sequence by a weighted arithmetic mean. We shall first consider the following version of Copson’s generalization of Hardy’s inequality. T HEOREM 2.2.2. Let p > 1, λn > 0, an > 0, n = 1, 2, . . . , and further let Λn = ni=1 λi , An = ni=1 λi ai . Then ∞  n=1


λn

An Λn

p




p p−1

p  ∞

∞

p n=1 λn an

p

λn an .

converge,

(2.2.10)

n=1

P ROOF. We write αn = An Λ−1 n and agree that any number with suffix 0 is equal to 0. Now, by making use of the elementary inequality (2.2.2), we observe that p p−1 λn an αn p−1 p p p−1 αn [Λn αn − Λn−1 αn−1 ] = λn αn − p−1
 p p p p−1 = λn − Λ n αn + Λn−1 αn−1 αn p−1 p−1 
p Λn−1  p p p αn + αn−1 + (p − 1)αn  λn − Λ n p−1 p−1 p

λn αn −

=

1  p p  (pλn − λn − pΛn + pΛn−1 − Λn−1 )αn + Λn−1 αn−1 p−1

117

2.2. Hardy’s Series Inequality and Its Generalizations

 p 1  p  pλn − λn − p(Λn − Λn−1 ) − Λn−1 αn + Λn−1 αn−1 p−1 1  p p  (pλn − λn − pλn − Λn−1 )αn + Λn−1 αn−1 = p−1 1  p p  −Λn αn + Λn−1 αn−1 = p−1 1  p p Λn−1 αn−1 − Λn αn . (2.2.11) = p−1 =

By substituting n = 1, . . . , N in (2.2.11) and adding the inequalities, we have N 

p  1 p−1 p Λn αN  0. λn an αn  − p−1 p−1 N

p

λn αn −

n=1

(2.2.12)

n=1

From (2.2.12) we observe that N 

p  p−1 λn an αn . p−1 N

p

λn αn 

n=1

(2.2.13)

n=1

Using Hölder’s inequality with indices p, p/(p − 1) on the right-hand side of (2.2.13) we have N  n=1

p λn αn

1/p  N (p−1)/p  N   p p p  λn an λn αn . p−1 n=1

n=1

Dividing the above inequality by the last factor on the right-hand side and raising the result to the pth power, we obtain N  n=1


p

λn αn 

p p−1

p  N

p

λn an .

(2.2.14)

n=1

When we make N tend to infinity we obtain (2.2.10).



A version of the companion inequality proved by Copson [69] can be stated as follows.

118

Chapter 2. Inequalities Related to Hardy’s Inequality

T HEOREM 2.2.3. Let p > 1, λn > 0, an > 0 for n = 1, 2, . . . , verge, and further let Λn =

n 

An =

λi ,

∞  λi ai

Λi

i=n

i=1

∞

p n=1 λn an

con-

.

Then ∞ 

p

λn An  p p

n=1

∞ 

p

λn an .

(2.2.15)

n=1

As in the proof of Theorem 2.2.1, see also Copson [69, p. 12], the constants involved in (2.2.10) and (2.2.15) are best possible. In 1928, Hardy in his paper [137] notes that the inequality given in Theorem 2.2.3 does not require a separate proof but can be derived from Copson’s first inequality given in Theorem 2.2.2. In view of this remark, here we omit the proof of Theorem 2.2.3. For an independent proof of Theorem 2.2.3, see Copson [69]. In [139] Hardy and Littlewood generalizes Hardy’s inequality in Theorem 2.2.1 as follows. T HEOREM 2.2.4. Suppose p > 0, c is a real (but not necessarily positive) constant and ∞ n=1 an is a series of positive terms. Set A1n =

n 

ak

and An∞ =

∞ 

ak .

k=n

k=1

If p > 1 we have ∞ 

n−c A1n  K p

n=1 ∞ 

∞ 

n−c (nan )p

with c > 1,

(2.2.16)

n−c (nan )p

with c < 1,

(2.2.17)

n−c (nan )p

with c > 1,

(2.2.18)

n−c (nan )p

with c < 1,

(2.2.19)

n=1

n−c An∞  K p

n=1

∞  n=1

and if p < 1 we have ∞ 

n−c A1n
K p

n=1 ∞  n=1

n

∞  n=1

−c

p An∞


K

∞  n=1

119

2.2. Hardy’s Series Inequality and Its Generalizations

where K denotes a positive constant, not necessarily the same at each occurrence. Theorem 2.2.4 was generalized by Leindler in [186], who replaced in (2.2.16)–(2.2.19) the sequence {n−c } by an arbitrary sequence {λn }: for instance, he proved the inequality  ∞ p ∞ ∞    p 1−p p λn A1n  p p λn λm an (2.2.20) n=1

n=1

m=n

with p
1 and λn > 0. In [226] Nemeth gives further generalizations by combing Hardy’s inequality in Theorem 2.2.1 and the Hardy and Littlewood inequality in Theorem 2.2.4. In the following theorem we present the results given in [226]. We use the following definitions given in [226]. (i) C ∈ M1 denotes that the matrix C = (cm,v ) satisfies the conditions: cm,v > 0,

v  m, 0<

cm,v = 0, cm,v  N1 , cn,v

v > m, m, v = 1, 2, . . . , 0  v  n  m.

and (2.2.21)

(ii) C ∈ M2 denotes that cm,v > 0 (v
m) and cm,v = 0 (v < m, m, v = 1, 2, . . . ), cm,v
N2 , 0  n  m  v. (2.2.22) cn,v (iii) C ∈ M3 denotes that cv,m > 0 (v
m) and cv,m = 0 (v < m, v, m = 1, 2, . . . ), cv,m 0<  N3 , v
n
m
0. (2.2.23) cv,n (iv) C ∈ M4 denotes that cv,m > 0 (v  m) and cv,m = 0 (v > m, v, m = 1, 2, . . . ), cv,m
N4 , 0  v  m  n, (2.2.24) cv,n where Ni denote positive absolute constants for i = 1, 2, 3, 4. The main result given by Nemeth in [226] follows. T HEOREM 2.2.5. Let an
0 and λn > 0, n = 1, 2, . . . , be given, and let C = (cm,k ) be a triangular matrix.

120

Chapter 2. Inequalities Related to Hardy’s Inequality

(a) If C ∈ M1 and p
1, then  n p  ∞ p ∞ ∞     p(p−1) p 1−p p λn cn,m am  N1 p λn λm cm,n an . n=1

m=1

(b) If C ∈ M3 and p
1, then  ∞ p  m p ∞ ∞     p(p−1) p 1−p p λm cn,m an  N3 p λm λn cm,n am . m=1

n=m

m=1

v=n

n=1

n=1

(2.2.27)

k=1

(d) If C ∈ M4 and 0 < p  1, then  m p  ∞ p ∞ ∞     (1−p)p p 1−p p λm cn,m an
N4 p λm λn cm,n am . m=1

(2.2.26)

n=1

(c) If C ∈ M2 and 0 < p  1, then  ∞ p  n p ∞ ∞     (1−p)p p 1−p p λn cn,v av
N2 p λn ck,n λk an . n=1

(2.2.25)

m=n

n=1

(2.2.28)

n=m

m=1

We note that Theorem 2.2.5 implies Leindler’s theorem in [186], further if 1−p λm = cm,m f(m) and we write cm,n f(m) instead of elements of the matrix C, then assertion (a) includes Theorem 3 of Izumi, Izumi and Petersen [163], and in the −p case λn = f(n) and ck,n = f (k)ak,n , assertion (d) reduces to Theorem 5 of Davis and Petersen [78]. In the proof of the above theorem, we require the following lemmas. L EMMA 2.2.1 [78, Lemma 1]. If p > 1 and zn
0, n = 1, 2, . . . , then 

n 

p p

zk

k=1

n 

 zk

k=1

k 

p−1 zv

v=1

P ROOF. Let λr = z1 + · · · + zr , r = 1, 2, . . . , n. Then  (λn )p = p

λn

x p−1 dx

0


 =p 0

λ1

 +

λ2

λ1

 +··· +

λn λn−1

 x p−1 dx

.

121

2.2. Hardy’s Series Inequality and Its Generalizations

 p−1 p−1 p−1   p λ1 λ1 + (λ2 − λ1 )λ2 + · · · + (λn − λn−1 )λn   p = p z1 + z2 (z1 + z2 )p−1 + · · · + zn (z1 + · · · + zn )p−1 . 

The proof is complete.

The proofs of the following lemmas are similar to that of Lemma 2.2.1 (see [226]). L EMMA 2.2.2. If 0 < p < 1 and z1 > 0, zn
0, n = 2, 3, . . . , then  n p  k p−1 n    zk
p zk zv . k=1

k=1

v=1

L EMMA 2.2.3. If 0 < p < 1 and zn
0, n = 1, 2, . . . , then for every natural number N , for which zN > 0,  N p−1  N p N    zk
p zk zv . k=n

k=n

v=k

L EMMA 2.2.4. If p > 1 and zn
0, n = 1, 2, . . . , then for every natural number N ,  N p  N p−1 N    zk p zk zv . k=n

k=n

v=k

P ROOF OF T HEOREM 2.2.5. For p = 1 the assertions are obvious; we have only to interchange the order of summations. Further we may assume that not all an vanish (otherwise the theorem is evident). (a) By Lemma 2.2.1 we obtain, for C = (cm,k ) ∈ M1 , N  n=1

 λn

n 

p cn,m am

p

m=1

N 

λn

n=1



p−1 N1 p

n 

=

cn,m am

m=1 N 

n 

cn,m am

m=1

 m N  

m=1

m  k=1

λn

n=1 p−1 N1 p



k=1

cm,k ak

p−1 cn,k ak 

m 

p−1 cm,k ak

k=1

p−1

am

N  n=m

λn cn,m .

122

Chapter 2. Inequalities Related to Hardy’s Inequality

Hence, using Hölder’s inequality, we have N 

 λn

n=1

p

n  m=1

cn,m am 

p−1  N1 p

N 

 λm

m 

m=1

p

1/q  N 

cm,k ak

k=1

 1−p λm

N 

p

1/p p am

λn cn,m

n=m

m=1

with q = p/(p − 1), which by standard computation gives assertion (a). (b) By Lemma 2.2.4 we have, for C = (cm,k ) ∈ M3 , N 

 λm

N 

p p

cn,m an

n=m

m=1

N 

λm



cn,m an

n=m

m=1 p−1 N3 p



N 

N 

=

p−1 cv,m av

v=n

λm

N 

 cn,m an

n=m

m=1 p−1 N3 p

N 

 N N  

N 

cv,n av

v=n

p−1 cv,n av

an

v=n

n=1

p−1

n 

cn,m λm .

m=1

Hence, using Hölder’s inequality, we have N 

 λm

N 

p cn,m an

n=m

m=1

p−1  N3 p

N 

 λn

n=1

N 

p

1/q  N 

cv,n av

v=n

 1−p λn

n=1

n 

p cn,m λm

1/p p am

m=1

where q = p/(p − 1) which by standard computation gives assertion (b). (c) Using Lemma 2.2.3 with an index n for which aN > 0, we obtain N  n=1

 λn

N 

p cn,v av


p

v=n

N 

λn

n=1




1−p N2 p

N 

 cn,v av

v=n N  n=1

λn

N  k=v

N  v=n

cn,v av

p−1 cn,k ak 

N  k=v

p−1 cv,k ak

,

123

2.2. Hardy’s Series Inequality and Its Generalizations

=

1−p N2 p

 N N   v=1

p−1 cv,k ak

av

k=v

v 

λn cn,v .

n=1

Hence, using Hölder’s inequality [16, p. 19], we have  N p N   λn cn,v av n=1

v=n



1−p
N2 p

N 

 λv

N 

p

1/q  N 

cv,k ak

k=v

v=1

 λv1−p

v=1

v 

p λn cn,v

1/p

avp

.

n=1

This result gives assertion (c) by standard computation. (d) We may assume that a1 = 0. Using Lemma 2.2.2, Hölder’s inequality with indices p, q = p/(p − 1), we have  m p N   λm cn,m an m=1


p

n=1 N 

λm

m=1 1−p
N4 p

m 

N 

m 

N  n=1

p−1 ck,m ak 

cn,m an

n=1

 n N  



n  k=1

λm

n=1

1−p
N4 p

cn,m an

n=1

m=1 1−p = N4 p



p−1

ck,n ak

an

N 

λm cn,m

m=n

k=1

λn

p−1

k=1

ck,n ak



n 

n  k=1

p ck,n ak

1/q  N  n=1

 1−p λn

N 

p λm cn,m

1/p p an

.

m=n

By standard computation this result gives assertion (d), and the proof is complete.  In [196] Love has established generalizations of Hardy’s and Copson’s series inequalities by replacing means by more general linear transforms. The results in [196] are based on the following lemma. L EMMA 2.2.5. If g is a decreasing (equimeasurable) rearrangement of a nonnegative measurable function f on (0, c), h is nonnegative and decreasing

124

Chapter 2. Inequalities Related to Hardy’s Inequality

on (0, b), 0 < b < c and p > 0, then 

b





b

f (u)h(u) du 

c

g(u)h(u) du,

0

0



c

f (u)p du =

0

g(u)p du.

0

P ROOF. The second result is immediate. For the first, let k be a decreasing rearrangement of f on (0, b) and let k(u) = f (u) for b  u < c. Also, let h(u) = 0 for b  u < c, so that h is decreasing on (0, c). Observing that g is a decreasing rearrangement of k on (0, c), two applications of Theorem 378 in [141], one on (0, b) and the other on (0, c), give 

b

 f h du 

0

b



c

kh du =

0

0

 kh du 

c

 gh du =

0

b

gh du. 0



The following theorems given in [196] generalize Copson’s inequalities in Theorems 2.2.2 and 2.2.3 (see also [70]), restated perhaps more neatly. T HEOREM 2.2.6. If p > 1, α(t) is nonnegative and decreasing in (0, 1],  A=

1

α(t)t −1/p dt < ∞,

λn > 0,

Λm =

0

and

Then

m 

λn

n=1


λn Λn for 0 < n  m. α |amn |  Λm Λm 

∞  m=1

 m p 1/p  ∞ 1/p      λm  amn xn  A λm |xm |p ,   n=1

m=1

where (xn ) is a fixed sequence. P ROOF. It will be enough to prove the inequality with upper terminal ∞ of the outer summations replaced by any positive integer M. Fix such M and a sequence (xn ). Let f (u) = |xn | for Λn−1 < u  Λn and 0 < n  M, where Λ0 = 0. Let g(u) be a decreasing rearrangement of f (u) on (0, ΛM ]. For m such that 0 < m  M, let m  1/p |amn xn | and Λm−1 < s  Λm . zm = λm n=1

125

2.2. Hardy’s Series Inequality and Its Generalizations

Then zm 1/p

λm




m  λn Λn |xn | α Λm Λm n=1


m  1  Λn Λn f (u) du = α Λm Λm Λn−1 n=1




 m  1  Λn u α f (u) du Λm Λm Λn−1 n=1

 u f (u) du Λm 0   Λm
1 u  g(u) du α Λm 0 Λm  1 = α(t)g(Λm t) dt =



1 Λm




Λm

α

(2.2.29)

α(t)g(st) dt.

(2.2.30)

0



1

 0

Lemma 2.2.5 has been used after (2.2.29). From (2.2.30), 

M 



1/p p zm

=

m=1

 

1/p  Λm M  1 p zm ds λm Λm−1

m=1

M  




Λm

α(t)g(st) dt

m=1 Λm−1

= 

p α(t)g(st) dt

0

 1
 

0



α(t)t −1/p

0 1

=

α(t)t 0

−1/p

1/p ds

1/p

α(t)p g(st)p ds

0 1

=

0 ΛM

ds

0

ΛM
 1




1/p

p

1





ΛM

(2.2.31)

1/p g(st)p t ds

0 ΛM t 0

dt dt

1/p g(u) du dt p

126

Chapter 2. Inequalities Related to Hardy’s Inequality


 A

ΛM

0


 =A

(2.2.32)

ΛM

1/p f (u)p du

(2.2.33)

0



M  

=A 

1/p g(u) du p

1/p

Λm

p

f (u) du

m=1 Λm−1 M 

=A

1/p

λm |xm |

p

.

m=1

The “double integral” version of Minkowski’s inequality [141, Theorem 202] has been used at (2.2.31), and Lemma 2.2.5 at (2.2.33). Making M → ∞ the inequality follows.  C OROLLARY 2.2.1 (Copson’s inequality, Theorem 2.2.2). If p
c > 1, (xn ), λn and Λn are as in Theorem 2.2.6, and xn
0, then 

∞ 

 λm Λ−c m

m=1

m 

p 1/p λn xn

n=1

p  c−1



∞ 

1/p p−c p λm Λ m xm

.

m=1

P ROOF. For 0 < t  1 and 0 < n  m, let c/p−1

α(t) = t

c/p−1

and amn =

λn Λ n

c/p

Λm


λn Λn . = α Λm Λm

(2.2.34)

Theorem 2.2.6 now applies with A = p/(c − 1) which after replacing xn by 1−c/p xn gives Copson’s inequality.  Λn T HEOREM 2.2.7. If p > 1, tα(t) is nonnegative and increasing in [1, ∞),  B=

∞

α(t)t

−1/p

dt < ∞,

λn > 0,

Λm =

1

and

m  n=1


λn Λn for 0 < m  n, |amn |  α Λm Λm

λn

127

2.2. Hardy’s Series Inequality and Its Generalizations

then



∞  m=1

 ∞ p 1/p  ∞ 1/p      p λm  amn xn  B λm |xn | , n=m  m=1

where (xn ) is a fixed sequence. P ROOF. Let q = p
, β(t) = t −1 α(t −1 ) and bmn = λn amn λ−1 m . Then q > 1, β(t) is nonnegative and decreasing in (0, 1], 

1

β(u)u−1/q du = B < ∞


λn Λn , β Λm Λm

and |bmn | 

0

for 0 < n  m. So Theorem 2.2.6 applies with p, α(t) and amn replaced by q, −1/q β(t) and bmn . Replacing xn by λn yn , and defining bmn = 0 for 0 < m < n, the strong form of that theorem gives 

 ∞ q 1/q  ∞ 1/q ∞   1/q   −1/q q λm bmn λn yn  B |ym | m=1

n=1

m=1

for all yn . The converse of Hölder’s inequality [141, Theorems 15 and 167] leads to the conjugate inequality 

 ∞ p 1/p  ∞ 1/p ∞   1/q   −1/q λn bmn λm yn  B |ym |p m=1

n=1

m=1 1/p

for all yn . Noting the definitions of bmn , and putting yn = λn xn , this result reduces to (the strong form of ) the stated conclusion.  C OROLLARY 2.2.2 (Copson’s inequality, Theorem 2.2.3). If p > 1 > c
0, λn and Λn are as in Theorem 2.2.7, xn
0 and ∞ n=1 λn xn is convergent, then 

∞  m=1

 λm Λ−c m

∞  n=m

p 1/p λn xn

p  1−c



∞ 

1/p p−c p λm Λ m xm

.

m=1

P ROOF. This proof follows from Corollary 2.2.1, but with t
1 and 0 < m  n in (2.2.34) and Theorem 2.2.7 used instead of Theorem 2.2.6. 

128

Chapter 2. Inequalities Related to Hardy’s Inequality

2.3 Series Inequalities Related to Those of Hardy, Copson and Littlewood Hardy’s inequality concerning the series of terms given in Theorem 2.2.1 has received wide attention from the book “Inequalities” written in 1934 by Hardy, Littlewood and Pólya. In this section we present some basic inequalities due to Copson and related to those of Hardy, Copson and Littlewood. In what follows, we assume that all the sums exist on the respective domains of definitions and agree that the value of any function u(m, n) or u(n) for m = 0 or n = 0 is zero. In 1979, Copson [71] proves two series inequalities which in fact are the discrete analogues of the integral inequalities established earlier in 1932 by Hardy and Littlewood [140]. The first result established by Copson in [71] is given in the following theorem. T HEOREM 2.3.1. Let {an } be a sequence of real numbers such that ∞ 2 2 −∞ ( an ) are convergent. Then ∞ ∞ ∞     2 2  an . (an )2  an2 −∞

−∞

∞

2 −∞ an ,

−∞

Equality occurs if and only if an = 0 for all n, where an = an+1 − an and 2 an = (an ). P ROOF. Since (an an ) = an+1 2 an + (an )2 , we have N 

N  an+1  an + (an )2 = aN +1 2 aN +1 − a−M 2 a−M . 2

−M

But since Therefore

−M

∞

2 −∞ an

convergent, an tends to zero as n → ∞ and as n → −∞.  lim

N 

M→∞ N →∞ −M

an+1 2 an +

N  (an )2 = 0. −M

By Cauchy’s inequality, ∞  −∞

an+1 2 an

129

2.3. Series Inequalities Related to Those of Hardy, Copson and Littlewood

is absolutely convergent. Hence

∞

2 −∞ (an )

is also convergent, and

∞ ∞   (an )2 = − an+1 2 an . −∞

Therefore



−∞

∞  (an )2

2



−∞

∞ 

2 an+1

−∞

∞   2 2  an .

(2.3.1)

−∞

Equality occurs if and only if there exists a real constant λ such that 2 an = λan+1 for all values of n. The solution of this difference equation is an = Ak1n + Bk2n , where k1 and k2 are the roots of the equation (k − 1)2 = λk if λ = 0, but it is an = A + Bn

2 if λ = 0. The latter case is impossible since the series ∞ −∞ an would diverge. If λ = 0, k1 and k2 are unequal and k1 k2 = 1. If k1 and k2 are real, one is nua 2 diverges. If k1 and k2 merically greater than unity, the other less, and ∞ ∞ 2 −∞ n are complex, an = C cos(nα + β), and −∞ an diverges again. Hence equality  occurs in (2.3.1) if and only if an = 0 for all values of n. The second result established by Copson in [71] is embodied in the following theorem. T HEOREM 2.3.2. Let {an } be a sequence of real numbers such that ∞ 2 2 0 ( an ) are convergent. Then 

∞  (an )2 0

2

4

∞ 

an2

0

Equality occurs if and only if an = 0 for all n.

∞   2 2  an . 0

∞ 0

an2 ,

130

Chapter 2. Inequalities Related to Hardy’s Inequality

P ROOF. The proof depends on a generalization of Cauchy’s inequality, that  2  an an bn an cn     D =  an bn bn2 bn cn 
0, 2   an cn bn cn cn a result stated in [141, p. 16]. Equality occurs if and only if the sequences {an }, {bn }, {cn } are linearly independent. If we put bn = an , cn = 2 an , we obtain    A H G   D =  H B F 
0,   G F C where A= F=

∞ 

B=

an2 ,

∞  (an )2 ,

C=

∞   2 2  an ,

0

0

0

∞ 

∞ 

∞ 

0

an 2 an ,

G=

a n 2 a n ,

H=

0

an an .

0

The series A and C are, by hypotheses, convergent. The series G is absolutely convergent by Cauchy’s inequality. If we put an = 0 for all n < 0, we see that the series B is convergent; see the proof of Theorem 2.3.1. Then, again by Cauchy’s inequality, the series F and H are absolutely convergent. The determinant D vanishes if and only if there exist real constants α, β, γ , not all zero, such that αan + βan + γ 2 an = 0 for all n. This implies, either that an = 0 for all n or that an = r n cos(pr + q), where p, q, r are real and 0 < r < 1 since an2 convergent. Now an2 = 2an an + (an )2 . Summing from n = 0 to n = ∞, we find that 2H + B = −a02 , using the fact that an → 0 as n → ∞. Similarly 2F + C = −b02 ,

2.3. Series Inequalities Related to Those of Hardy, Copson and Littlewood

131

where b0 = a0 . Lastly, from (an an ) = an 2 an + an 2 an + (an )2 , we obtain G + B + F = −a0 b0 . Hence   A   1 2 D =  − 2 (a0 + B)   G

− 12 (a02 + B) B

    − 12 (b02 + C)    C G

+ C)   2 2 1 1  1  = ABC + a02 + B b02 + C G − A b02 + C − BG2 − C a02 + B . 2 4 4 − 12 (b02

Therefore    2 1  2 1  2ABC + a02 + B b02 + C G − 2BG2
A b02 + C + C a02 + B 2 2  2  2 
a0 + B b0 + C (AC), by the arithmetic mean–geometric mean inequality. Equality at the last step occurs only when A(b02 + C)2 = C(a02 + B)2 . Hence 2ABC − 2BG2




(AC) − G

 2   a0 + B b02 + C .

By Cauchy’s inequality, G2  AC. If G2 < AC, we can divide through by √ (AC) − G, to obtain      2B (AC) + G
a02 + B b02 + C . Therefore     2B (AC)
a02 + B b02 + C − 2BG    = a02 + B b02 + C − 2B(B + G) + 2B 2 . But 1 1 B + G = −a0 b0 − F = −a0 b0 + b02 + C. 2 2

132

Chapter 2. Inequalities Related to Hardy’s Inequality

Therefore 
 2  2  1 2 1 2B (AC)
a0 + B b0 + C − 2B b0 − a0 b0 + C + 2B 2 2 2 

= a02 b02 + 2a0 b0 B + 2B 2 + a02 C = (a0 b0 + B)2 + B 2 + a02 C. This result gives  2B (AC) − B 2
(a0 b0 + B)2 + a02 C. Therefore, if G2 < AC,

 B  2 (AC),

the required inequality. The relation G2 = AC, that is, ∞  0

2

a n 2 a n

=

∞ 

an2

0

∞   2 2  an 0

holds if and only if there exists a constant λ such that 2 an = λan . If λ = 0, an is a constant and so is zero by the convergence condition which again implies that an is constant and so is zero. If λ = 0, {an } is the null sequence. If λ = 0, an = αk1n + βk2n , where k1 and k2 are the roots of (k − 1)2 = λ. The roots are different. If λ = −µ2 < 0, an = α(1 + iµ)n + β(1 − iµ)n which is impossible by the convergence condition for |1 ± iµ| > 1, and an does not then tend to zero as n → ∞. If λ = v 2 > 0, where v > 0, an = α(1 + v)n + β(1 − v)n which tends to zero as n → ∞ if and only if α = 0 and 0 < v < 2. Dropping the factor β, the only case when G2 = AC is an = r n , where −1 < r < 1. This gives A=

1 , 1 − r2

B = (r − 1)2 A,

C = (r − 1)4 A,

2.3. Series Inequalities Related to Those of Hardy, Copson and Littlewood

and so b=

133

 √ (AC) < 2 AC.

The inequality also holds when G2 = AC. √ It remains to consider the conditions under which B = 2 (AC). Going over the proof, we see that they are following: (i) {an }, {an }, {2 an } are linearly dependent sequences, (ii) A(b02 + C)2 = C(a02 + B)2 , (iii) a0 b0 + B = 0, a02 C = 0. In fact, (iii) implies that {an } is the null-sequence, and (i) and (ii) follow. If a0 = 0 then B = 0, hence an = 0 and an is zero for all n. If C = 0 then 2 an = 0, hence an is a constant and so is zero by the convergence condition. This result implies that an is zero for all n. We have thus covered all the cases. We have proved that ∞ 

2

(an )2

4

0

∞ 

an2

0

∞   2 2  an , 0

with equality if and only if an is zero for all values of n.



R EMARK 2.3.1. As observed by Copson in [71] the constants in inequalities in Theorems 2.3.1 and 2.3.2 are best possible. For detailed discussion, see [71, pp. 110 and 114]. In [277] Pachpatte establishes some generalizations of Copson’s inequality given in Theorem 2.2.2. The main result established in [277] is given in the following theorem. T HEOREM 2.3.3. Let f (u) be a real-valued positive convexpfunction defined for u > 0. Let p > 1 be a constant, λn > 0, an > 0, ∞ n=1 λn f (an ) converge, and further let Λn = ni=1 λi , An = ni=1 λi ai . Then ∞  n=1


λn f p

An Λn






p p−1

p  ∞

λn f p (an ).

(2.3.2)

n=1

P ROOF. Since f is convex, by Jensen’s inequality (see [174, p. 133]), we have 
Fn An  , (2.3.3) f Λn Λn

134

Chapter 2. Inequalities Related to Hardy’s Inequality

where Fn = ni=1 λi f (ai ). We write αn = Fn Λ−1 n and agree that any number with suffix 0 is equal to 0. Now, by making use of the elementary inequality uk+1 + kv k+1
(k + 1)uv k ,

u, v
0, k
1,

(2.3.4)

we observe that p p−1 λn f (an )αn p−1 p p p−1 αn [αn Λn − αn−1 Λn−1 ] = λn αn − p−1
 p p p p−1 = λn − Λn αn + Λn−1 αn−1 αn p−1 p−1 
p Λn−1  p p p Λn αn + αn−1 + (p − 1)αn  λn − p−1 p−1 p

λn αn −

=

1  p p Λn−1 αn−1 − Λn αn . p−1

(2.3.5)

By substituting n = 1, . . . , m in (2.3.5) and adding the inequalities, we see that m  p λn αn − n=1

p 1 p−1 p λn f (an )αn Λm αm  0. − p−1 p−1

(2.3.6)

From (2.3.6) we observe that m 

p

λn αn 

n=1

m  (p−1)/p p−1  p  1/p λn f (an ) λn . αn p−1

(2.3.7)

n=1

Using Hölder’s inequality with indices p, p/(p − 1) on the right-hand side of (2.3.7) we have m  n=1

p λn αn

 m  p  λn f p (an ) p−1

1/p  m 

n=1

(p−1)/p p λn αn

.

n=1

Dividing the above inequality by the last factor on the right-hand side and raising the result to the pth power, we obtain m  n=1


λn

Fn Λn

p




p p−1

p  m n=1

λn f p (an ).

(2.3.8)

2.3. Series Inequalities Related to Those of Hardy, Copson and Littlewood

135

Now, from (2.3.3) and (2.3.8), we have m  n=1


λn f

p

An Λn

 

m 


λn

n=1

Fn Λn

p




p p−1

p  m

λn f p (an ).

(2.3.9)

n=1

By letting m tend to infinity in (2.3.9), we obtain the desired inequality in (2.3.2). The proof is complete.  The next result established by Pachpatte in [307] deals with the Hardy-type series inequality in two independent variables. T HEOREM 2.3.4. If p > 1 is a constant, b(m, n)
0 for m, n ∈ N (the set of natural numbers) and B(m, n) =

m n s t 1  1  b(x, y) mn st s=1 t=1

(2.3.10)

x=1 y=1

for m, n ∈ N , then ∞  ∞ 


B p (m, n) 

m=1 n=1

p p−1

4p  ∞  ∞

bp (m, n).

(2.3.11)

m=1 n=1

The equality holds in (2.3.11) if b(m, n) = 0 for m, n ∈ N . P ROOF. If b(m, n) is null, then (2.3.11) is trivially true. Let us suppose that b(m, n) > 0 for all m, n ∈ N . Let M
1, L
1 be any integers, and define SML =

M  L 

B p (m, n).

(2.3.12)

m=1 n=1

From (2.3.12) we observe that SML =

M 

m−p

m=1

L 

p

α1 (m, n),

(2.3.13)

n=1

where α1 (m, n) =

1  1  1  b(x, y). n t s n

m

t=1

s=1

s

t

x=1 y=1

(2.3.14)

136

Chapter 2. Inequalities Related to Hardy’s Inequality

From (2.3.14) and using inequality (2.3.4), we observe that
p α1 (m, n) −

  m s t 1 1  p p b(x, y) α1 (m, n) p−1 n s s=1

x=1 y=1

   p−1 p p nα1 (m, n) − (n − 1)α1 (m, n − 1) α1 (m, n) = α1 (m, n) − p−1

   p p p p−1 = 1− n α1 (m, n) + (n − 1)α1 (m, n − 1)α1 (m, n) p−1 p−1 
  p p  1− n α1 (m, n) p−1 
 1 p p p (n − 1) α1 (m, n − 1) + (p − 1)α1 (m, n) + p−1 p 
  1 p p (n − 1)α1 (m, n − 1) − nα1 (m, n) . (2.3.15) = p−1


Now, keeping m fixed in (2.3.15) and letting n = 1, . . . , L, and adding the inequalities, we have L 


p α1 (m, n) −

n=1

 m  L s n 1  1  p p b(x, y) α1 (m, n) p−1 n s n=1

s=1

x=1 y=1

 L   1 p p (n − 1)α1 (m, n − 1) − nα1 (m, n) p−1 n=1
 1 p =− Lα1 (m, L) p−1




 0.

(2.3.16)

From (2.3.16) and using Hölder’s inequality with indices p, p/(p − 1), we observe that L  n=1


p α1 (m, n)



 m  L s n p 1  1  p−1 b(x, y) α1 (m, n) p−1 n s n=1

s=1

x=1 y=1

2.3. Series Inequalities Related to Those of Hardy, Copson and Littlewood




p p−1 

×

  m  L s n 1  1  b(x, y) n s

L 

n=1

s=1

p

137

1/p

x=1 y=1

(p−1)/p p

α1 (m, n)

.

(2.3.17)

n=1

Dividing both sides of (2.3.17) by the last factor on the right-hand side and raising the result to the pth power we get   m p p 
L L s n  1  1  p p α1 (m, n)  b(x, y) . (2.3.18) p−1 n s n=1

n=1

s=1

x=1 y=1

From (2.3.13) and (2.3.18), we observe that
SML 

p p−1

p  L

n−p

n=1

M 

p

α2 (m, n),

(2.3.19)

s=1

where 1  1  b(x, y). m s m

α2 (m, n) =

s

s=1

n

(2.3.20)

x=1 y=1

From (2.3.20) and using inequality (2.3.4), it is easy to observe that  
m  n 1 p p p−1 α2 (m, n) − b(x, y) α2 (m, n) p−1 m


x=1 y=1



  1 p p (m − 1)α2 (m − 1, n) − mα2 (m, n) . p−1

(2.3.21)

Keeping n fixed in (2.3.21) and letting m = 1, . . . , M, and adding the inequalities, we have  m n 
M M  1  p p p−1 α2 (m, n) − b(x, y) α2 (m, n) p−1 m m=1

m=1




x=1 y=1

 M

  1 p p (m − 1)α2 (m − 1, n) − mα2 (m, n) p−1 m=1
 1 p =− Mα2 (M, n)  0. p−1 

(2.3.22)

138

Chapter 2. Inequalities Related to Hardy’s Inequality

From (2.3.22) and by following the same procedure below (2.3.16) up to (2.3.18), we get  p p 
M m n M  p 1  p α2 (m, n)  b(x, y) . (2.3.23) p−1 m m=1

m=1

x=1 y=1

From (2.3.19) and (2.3.23), we observe that
SML 

p p−1

2p  M

m−p

m=1

L 

p

α3 (m, n),

(2.3.24)

n=1

where 1  b(x, y). n n

α3 (m, n) =

m

(2.3.25)

y=1 x=1

From (2.3.25) and using (2.3.4), we observe that  
m p p p−1 α3 (m, n) − b(x, n) α3 (m, n) p−1 x=1
   1 p p (n − 1)α3 (m, n − 1) − nα3 (m, n) .  p−1

(2.3.26)

Now, by following the same procedure below (2.3.15) up to (2.3.18), we get  m p p 
L  L  p p α3 (m, n)  b(x, y) . (2.3.27) p−1 n=1

n=1 x=1

From (2.3.24) and (2.3.27), we observe that
SML 

p p−1

3p  L  M

p

α4 (m, n),

(2.3.28)

n=1 m=1

where 1 b(x, n). m m

α4 (m, n) =

x=1

From (2.3.29) and using inequality (2.3.4), we observe that 
p p p−1 b(m, n)α4 (m, n) α4 (m, n) − p−1

(2.3.29)

2.3. Series Inequalities Related to Those of Hardy, Copson and Littlewood




   1 p p (m − 1)α4 (m − 1, n) − mα4 (m, n) . p−1

139

(2.3.30)

Now, following the same procedure below (2.3.21) up to (2.3.23), we get M 


p

α4 (m, n) 

m=1

p p−1

p  M

b(m, n).

(2.3.31)

m=1

From (2.3.28) and (2.3.31), we observe that
SML 

p p−1

4p  M  L

b(m, n).

(2.3.32)

m=1 n=1

By letting M and L tend to infinity in (2.3.32), we get the desired inequality in (2.3.11). The proof is complete.  R EMARK 2.3.2. If we define B(m, n) in (2.3.10) by sr−2 t1 s1  m n  1  1  B(m, n) = ··· mn s1 t1 s1 =1 t1 =1

s2 =1 t2 =1

tr−2 

sr−1 =1 tr−1 =1

sr−1 tr−1   1 b(sr , tr ) sr−1 tr−1 sr =1 tr =1

(2.3.33) for m, n ∈ N , then in place of inequality (2.3.11) we get ∞  ∞ 


B p (m, n) 

m=1 n=1

p p−1

2rp  ∞  ∞

bp (m, n).

(2.3.34)

m=1 n=1

The proof of inequality (2.3.34) is a natural extension of the proof of Theorem 2.3.4 given above. Further, we note that the inequality obtained in (2.3.34) can be extended to the functions of several independent variables. In 1967, J.E. Littlewood [195] presents several open problems concerning elementary inequalities for infinite series which have their roots in the theory of orthogonal series. One of his simplest problem is to decide whether a constant k exists for which n    2 an3 am Am  k an4 A2n , (2.3.35) n

m=1

n

where An = a1 + · · · + an , and the inequality is to hold for all nonnegative numbers a1 , a2 , . . . , and k is an absolute constant. An answer to Littlewood’s question

140

Chapter 2. Inequalities Related to Hardy’s Inequality

was published in 1987 by G. Bennett [22–24] who shows that (2.3.35) is valid with k = 4. Actually, Bennett proves the following more general result. T HEOREM 2.3.5. Let p, q
1. Then  q

 p q  1+p/q 2p − 1 q  p q 2 q an An , an An am  p n n

(2.3.36)

mn

where a’s are arbitrary nonnegative numbers with partial sum An = a1 + · · · + an . P ROOF. The proof involves just two applications of Hölder’s inequality. We may assume that only finitely many of the an ’s are positive, say an = 0 whenq/p ever n > N . To keep the notation manageable, we set bn = an An and cn = 1+p/q . Elementary estimates give mn am 1+q/p

An


b1 + · · · + bn

(= Bn , say)

(2.3.37)

1+p/q

(2.3.38)

and r cnr − cn+1  rcnr−1 an

,

where r (
1) is to be chosen later. Letting θ = (2p − 1)−1 so that 0 < θ  1, the left-hand side of (2.3.36) may be rewritten as  p(1−θ) pθ q L= bn bn cn . n

Applying Hölder’s inequality with indices 2/(1 − θ ) and 2/(1 + θ ), we have L



2p bn

n

=



(1−θ)/2 

2pθ/(1+θ) 2q/(1+θ) bn cn

n

2p

bn

(1−θ)/2 

n

(1+θ)/2

(1+θ)/2 bn cnr

,

n

where we have set (2p − 1)q 2q =
1. 1+θ p Thus, to prove (2.3.36), it suffices to show that  2p  bn cnr  r r bn . r=

n

n

(2.3.39)

(2.3.40)

2.3. Series Inequalities Related to Those of Hardy, Copson and Littlewood

141

Summing by parts, and then applying (2.3.37) and (2.3.38), we see that N 

bn cnr =

n=1

N −1 

  r + BN cNr Bn cnr − cn+1

n=1

r

N 

1+p/q

an

1+q/p r−1 cn

An

n=1

=r

N 

1/r ∗ r−1 2p/r cn bn ,

bn

n=1

where r ∗ = r/(r − 1) is the conjugate of r (see (2.3.39)). Applying Hölder’s inequality once more gives 

bn cnr  r

n



bn cnr

1/r ∗ 

n

2p

1/r

bn

,

n

which is equivalent to (2.3.40). The proof is complete.



R EMARK 2.3.3. Setting p = 2 and q = 1 in the theorem above, and interchanging the order of summation on the left-hand side of (2.3.36), it shows that (2.3.35) holds with k = 3/2. Furthermore, setting p = 1 and q = 2 leads to 

an A2n



n

3/2

2

am

4



an2 A4n .

(2.3.41)

n

mn

For further results related to Littlewood’s problem, see [195]. In [326] Pachpatte has established the inequalities in the following theorem which are similar to that of Littlewood’s inequality given in (2.3.35). T HEOREM 2.3.6. Let p
1, q
1, r
1 be real constants. If an
0, n = 1, 2, . . . , and An = nm=1 am , then N  n=1 N  n=1

N +1  2 an , 2 N

an An 

(2.3.42)

n=1

p+q An

N  q  p q  (p + q)(N + 1) An an n=1

(2.3.43)

142

Chapter 2. Inequalities Related to Hardy’s Inequality

and N 

N  q  p q+r  (p + q + r)(N + 1) An an .

p+q r an

An

n=1

(2.3.44)

n=1

P ROOF. Rewriting the left-hand side of (2.3.42), and using the Schwarz inequality, interchanging the order of summations, and using the elementary inequality a 1/2 b1/2  (a + b)/2, a
0, b
0 reals, we observe that   N N n   √  1  an An = nan √ am n n=1

n=1

 

   =  =  =

N 

1/2  nan2

n=1 N 

1/2  nan2

n=1 N 

1/2  nan2

n=1 N 

1/2  nan2

n=1 N 

1/2  nan2

n=1

1  2



m=1

N  1

n

n=1

N  1 n=1





n

n 

n 

N n  

 1



2 am

2 am N 

1/2 1

n=m

m=1

nan2

+

n=1

N 

1/2

(N

(N

1/2 2 am

m=1

2 − m + 1)am

m=1

N 

n 

1/2

m=1

N 

N 

am

m=1

m=1



n=1

2 1/2

 − n + 1)an2

n=1

N +1  2 an . 2 N

=

n=1

This proves the required inequality in (2.3.42). By taking zm = am and α = p + q in the following inequality (see [226]) α  m α−1  n n    zm  α zm zk , m=1

m=1

k=1

2.3. Series Inequalities Related to Those of Hardy, Copson and Littlewood

143

where α > 1 is a constant and zm
0, m = 1, 2, . . . , we have p+q

An

 (p + q)

n 

p+q−1

am Am

.

(2.3.45)

m=1

By taking the sum on both sides of (2.3.45) from 1 to N and interchanging the order of the summation, we observe that N 

p+q An

 n N  

 (p + q)

n=1

n=1 N 

= (p + q)

 p+q−1 am Am

m=1 p+q−1

am Am

(N − m + 1)

m=1

 (p + q)(N + 1)

N   p+q−1  an An n=1

= (p + q)(N + 1)

N   p/q  p+q−1−p/q  An an An .

(2.3.46)

n=1

By using Hölder’s inequality with indices q, q/(q − 1) on the right-hand side of (2.3.46), we have N 

 p+q An

 (p + q)(N + 1)

n=1

N 

1/q  p q An an

n=1

N 

(q−1)/q p+q An

.

(2.3.47)

n=1

Dividing by the last factor on the right-hand side of (2.3.47) and raising to the qth power of the resulting inequality, we get the desired inequality in (2.3.43). By rewriting the left-hand side of (2.3.44) and using Hölder’s inequality with indices (q + r)/r, (q + r)/q and the inequality (2.3.43), we observe that N 

p+q An anr

N   pr/(q+r) p  p+q−pr/(q+r)  An = an An

n=1

n=1

 

N  n=1

r/(q+r)  p q+r An an

N  n=1

q/(q+r) p+q+r An

144

Chapter 2. Inequalities Related to Hardy’s Inequality

 

N 

r/(q+r) p q+r An an

n=1

 q/(q+r) N  q+r  p q+r × (p + q + r)(N + 1) An an n=1

 q = (p + q + r)(N + 1)

N 

p q+r

An an

.

n=1

This result is the required inequality in (2.3.44), and the proof is complete.



R EMARK 2.3.4. By taking p = 1, q = 1 in (2.3.43), we get the lower bound on the left-hand side of the inequality given in (2.3.42).

2.4 Hardy’s Integral Inequality and Its Generalizations One of the many fundamental mathematical discoveries of G.H. Hardy is the following integral inequality [141, Theorem 327] discovered in 1920 in the course of attempts to simplify the proof of Hilbert’s double series theorem.

x

T HEOREM 2.4.1. If p > 1, f (x)
0 and F (x) =  0

∞
F

x

p


dx <

p p−1

0

p 

∞

f (t) dt, then f p dx,

(2.4.1)

0

unless f ≡ 0. The constant is the best possible. P ROOF. The proof given here is due to Hardy [136] and is also given in [141, pp. 242–243]. We may suppose f is not null. x Let n > 0, fn = min(f, n), Fn = 0 fn dx and let X0 be so large that f , and so fn , Fn are not null in (0, X) when X > X0 . We have  X
p  X Fn 1 p d  1−p  x dx dx = − Fn x p−1 0 dx 0 1−p p X  X
p−1 Fn x Fn (x) p = − + fn dx p−1 p−1 0 x 0  X
p−1 Fn p  fn dx p−1 0 x

145

2.4. Hardy’s Integral Inequality and Its Generalizations

since the integral term vanishes at x = 0 in virtue of Fn = o(x). Using Hölder’s inequality with indices p, p/(p − 1) we have X
F

 0

n

p dx 

x

p p−1

X
F




n

x

0

1/p



p

X

p

1/p

fn

dx

,

(2.4.2)

0

where p
= p/(p − 1). The left-hand side being positive (and finite), this inequality gives p  X
 X
p Fn p p dx  fn dx. x p−1 0 0 We make n → ∞ in this inequality, the result being to suppress the two suffixes n. Making X → ∞ we have 

∞
F

0

p

x


dx 

p p−1

p 

∞

f p dx,

0

the desired result with “” for “<”. Making n → ∞ and then X → ∞ in (2.4.2) we have  0

∞
F

x

p dx 

p p−1


 0

∞
F

x

p 1/p


∞

1/p f p dx

.

(2.4.3)

0

The integrals in this inequality being now known to be all finite and positive, (2.4.3) gives p  ∞
 ∞
p F p dx < f p dx, x p−1 0 0 unless x −p F p and f p are effectively proportional, which is impossible since it

∞ would make f a power of x, and 0 f p is divergent.  The proof that the constant is the best possible follows the same lines as before in Theorem 2.2.1: take f (x) = 0 for x < 1, f (x) = x −1/p−ε for x
1, where ε > 0 is a constant. The above inequality is now known in the literature as Hardy’s integral inequality. In the past few years, a number of generalizations, variants and extensions of the above inequality have been given by several investigators. Here we give some of these results in the following theorems. In a paper [137] published in 1928, Hardy himself proved the following generalization of the inequality given in Theorem 2.4.1.

146

Chapter 2. Inequalities Related to Hardy’s Inequality

T HEOREM 2.4.2. If p > 1, m = 1, f (x)
0 and R(x) is defined by  x f (t) dt, m > 1, R(x) = 0∞ x f (t) dt, m < 1,

(2.4.4)

then 

∞

x 0

−m



p R (x) dx < |m − 1|

p 

p

∞

 p x −m xf (x) dx,

(2.4.5)

0

unless f ≡ 0. The constant is the best possible. The proof of this theorem follows by the same arguments as in the proof of Theorem 2.4.1 with suitable modifications. Here we leave the details to the reader. In the following two theorems we present the main results given by Copson in [70] whose proofs are based on the ideas of the proofs of similar results given by Levinson in [190] and by Pachpatte in [254]. T HEOREM 2.4.3. Let p
1, m > 1 be constants. Let f (x) be a nonnegative function on (0, ∞) and let r(t) be a positive function on (0, ∞) and let  x  x r(t) dt, F (x) = r(t)f (t) dt. (2.4.6) R(x) = 0

Then



∞

0

R −m (x)r(x)F p (x) dx




0

p m−1

p 

∞

R p−m (x)r(x)f p (x) dx.

(2.4.7)

0

P ROOF. Let 0 < a < b < ∞ and define, for m > 1,  x r(t)f (t) dt Fa (x) = a

for x ∈ (a, b) with F0 (x) = F (x). Integrating by parts gives  b p R −m (x)r(x)Fa (x) dx a

=

b  b −m+1 R −m+1 (x) p R (x) p−1 Fa (x) − pFa (x)r(x)f (x) dx. −m + 1 −m + 1 a a

(2.4.8)

147

2.4. Hardy’s Integral Inequality and Its Generalizations

Since m > 1, from (2.4.8) we observe that  b p R −m (x)r(x)Fa (x) dx a

 =

p m−1 p m−1



b

R −m+1 (x)r(x)f (x)Fa

p−1

(x) dx

a



a

b

 R (p−m)/p (x)r 1/p (x)f (x)

  p−1 × R −m(p−1)/p (x)r (p−1)/p (x)Fa (x) dx.

(2.4.9)

Using Hölder’s inequality with indices p, p/(p − 1) on the right-hand side of (2.4.9) we obtain  b p R −m (x)r(x)Fa (x) dx a

 b 1/p p p−m p R (x)r(x)f (x) dx  m−1 a  b (p−1)/p p × R −m (x)r(x)Fa (x) dx .


(2.4.10)

a

Dividing both sides of (2.4.10) by the second integral factor on the right-hand side of (2.4.10), and raising both sides to the pth power, we obtain
p  b  b p p −m R (x)r(x)Fa (x) dx  R p−m (x)r(x)f p (x) dx. (2.4.11) m−1 a a From (2.4.11) we have
 b p R −m (x)r(x)Fa (x) dx  a

p m−1

p 

∞

R p−m (x)r(x)f p (x) dx.

Let a < c < b. Then from (2.4.12) we have p  ∞
 b p p −m R (x)r(x)Fa (x) dx  R p−m (x)r(x)f p (x) dx. m−1 c 0 Letting a → 0 in (2.4.13) we have
 b −m p R (x)r(x)F (x) dx  c

p m−1

(2.4.12)

0

p  0

∞

(2.4.13)

R p−m (x)r(x)f p (x) dx.

148

Chapter 2. Inequalities Related to Hardy’s Inequality

Since this inequality holds for arbitrary 0 < c < b, it follows that p  ∞
 ∞ p −m p R (x)r(x)F (x) dx  R p−m (x)r(x)f p (x) dx. m−1 0 0 

The proof is complete.

T HEOREM 2.4.4. Let p
1, m < 1 be constants. Let f (x), r(x) and R(x) be as defined in Theorem 2.4.3. If F (x) is defined by  ∞ F (x) = r(t)f (t) dt (2.4.14) x

for x ∈ (0, ∞), then 

∞

0

R −m (x)r(x)F p (x) dx




p 1−m

p 

∞

R p−m (x)r(x)f p (x) dx.

(2.4.15)

0

P ROOF. Let 0 < a < b < ∞ and define for m < 1,  b r(t)f (t) dt Fb (x) = x

for x ∈ (a, b) with F∞ (x) = F (x). Integrating by parts gives  b p R −m (x)r(x)Fb (x) dx a

=

b  b −m+1   R −m+1 p R (x) p−1 Fb (x) − pFb (x) −r(x)f (x) dx. −m + 1 −m + 1 a a

(2.4.16)

Since m < 1, from (2.4.16) we observe that  b p R −m (x)r(x)Fb (x) dx a

 =

p 1−m p 1−m



b a



a

R −m+1 (x)r(x)f (x)Fb

p−1

(x) dx

b

 R (p−m)/p (x)r 1/p (x)f (x)

  p−1 × R −m(p−1)/p (x)r (p−1)/p (x)Fb (x) dx. (2.4.17)

149

2.4. Hardy’s Integral Inequality and Its Generalizations

Using Hölder’s inequality with indices p, p/(p − 1) on the right-hand side of (2.4.17) we obtain  b p R −m (x)r(x)Fb (x) dx a



 b 1/p p R p−m (x)r(x)f p (x) dx 1−m a  b (p−1)/p p −m × R (x)r(x)Fb (x) dx .

(2.4.18)

a

Dividing both sides of (2.4.18) by the second integral factor on the right-hand side of (2.4.18), and raising both sides to the pth power, we obtain p  b
 b p p R −m (x)r(x)Fb (x) dx  R p−m (x)r(x)f p (x) dx. (2.4.19) 1 − m a a From (2.4.19) we have
 b p R −m (x)r(x)Fb (x) dx  a

p 1−m

p 

∞

R p−m (x)r(x)f p (x) dx.

Let a < c < b. Then from (2.4.20) we have
p  ∞  c p p −m R (x)r(x)Fb (x) dx  R p−m (x)r(x)f p (x) dx. 1−m a 0 Letting b → ∞ in (2.4.21) gives
 c R −m (x)r(x)F p (x) dx  a

p 1−m

(2.4.20)

0

p 

∞

(2.4.21)

R p−m (x)r(x)f p (x) dx.

0

Since this holds for any a, c, 0 < a < c, it follows that p  ∞
 ∞ p R −m (x)r(x)F p (x) dx  R p−m (x)r(x)f p (x) dx. 1−m 0 0 The proof is complete.



R EMARK 2.4.1. In [70] Copson has given the two companion results corresponding to Theorems 2.4.3 and 2.4.4 when 0 < p  1 and he also has given two more companion results corresponding to Theorems 2.4.3 and 2.4.4 when m = 1. For more details, we refer the interested readers to [70].

150

Chapter 2. Inequalities Related to Hardy’s Inequality

In the next two theorems we give the generalizations of Hardy’s inequality established by Love in [199]. In what follows, the functions involved have domains in (0, ∞) or (0, ∞)2 and ranges in [0, ∞]. The word “increasing” is used for “nondecreasing” and similarly for “decreasing”. A function σ (x) is called submultiplicative if its values are positive and satisfy σ (xy)  σ (x)σ (y) for all x and y in (0, ∞). The integrals are Lebesgue integrals, and they are said to exist even if their values are infinite since their integrals are measurable and nonnegative. The words “measurable” and “Measurable” are used to denote linear and plane measurability respectively. The qth power of the number f (x) is denoted by f (x)q , not by f q (x). T HEOREM 2.4.5. Let 1  q < ∞, 0 < b  ∞ and b1 = max{b, 1}. Let σ (x) be submultiplicative and measurable on (0, ∞), τ (x) be decreasing and positive on (0, b), H (x, y) be Measurable, nonnegative and homogeneous of degree h − 1 on 0 < y  x  b1 , and  1   1/q A= H (1, t) t −1 σ t −1 dt < ∞. 0

If f (x) is measurable and nonnegative on (0, b) and
 b 1/q q f  = f (x) σ (x)τ (x) dx < ∞, 0

then



x

Hf (x) = x 1/ h

H (x, y)f (y) dy 0

exists finitely for almost all x in (0, b), and Hf   Af . P ROOF. By Fubini’s theorem, there is ξ ∈ (0, b) such that H (ξ, y) is measurable on 0 < y < ξ . Therefore H (ξ, ξ t) is measurable on 0 < t < 1, hence so is
h−1 x H (x, xt) = H (ξ, ξ t) ξ for each x ∈ (0, b1 ). This result with (2.4.22) below ensures the existence, finite or infinite, of Hf (x) for each x ∈ (0, b] and also of A. For 0 < x < b,  1  1 1 Hf (x) = h H (x, xt)f (xt)x dt = H (1, t)f (xt) dt. (2.4.22) x 0 0

151

2.4. Hardy’s Integral Inequality and Its Generalizations

Using the form [141, Theorem 202] of Minkowski’s inequality at (2.4.23), q 1/q
 b
 1 H (1, t)f (xt) dt σ (x)τ (x) dx Hf  = 0



 1
 

0



0

1/q

H (1, t)q f (xt)q σ (x)τ (x) dx

dt


 H (1, t)

bt

(2.4.23)

    f (y) σ yt −1 τ yt −1 t −1 dy


 H (1, t)

0

b

1/q

q

0

1



b

0

1

=

0

  f (y)q σ (y)σ t −1 τ (y)t −1 dy

dt

1/q dt

0

= Af . In particular, Hf  < ∞ and since σ and τ are positive in (0, b), it follows that Hf (x), which exists for all x in (0, b) as already shown, and also is finite for almost all x in (0, b).  R EMARK 2.4.2. The first half of Hardy’s inequality in the form of Theorem 330 in [141] is the case of Theorem 2.4.5 in which b = ∞, r > 1, σ (x) = x q−r , τ (x) = 1, H (x, y) = x h−1 and A = q/(r − 1). Hardy’s inequality in its original form of Theorem 327 in [141] is the case r = q and thus σ (x) = 1. T HEOREM 2.4.6. Let 1  q < ∞, 0  a < ∞ and a1 = min{a, 1}. Let σ (x) be submultiplicative and measurable on (0, ∞), τ (x) be increasing and positive on (a, ∞), H (x, y) be Measurable, nonnegative and homogeneous of degree h − 1 on a1  x  y < ∞, and  ∞   1/q B= H (1, t) t −1 σ t −1 dt < ∞. 1

If f (x) is measurable and nonnegative on (0, ∞) and 1/q
 ∞ f (x)q σ (x)τ (x) dx < ∞, f  = a

then

 ∞ 1 Hf (x) = h H (x, y)f (y) dy x x exists finitely for almost all x in (a, ∞), and Hf   Bf .

152

Chapter 2. Inequalities Related to Hardy’s Inequality

The proof of this theorem is formally the same as the proof of Theorem 2.4.5 with suitable changes and thus we omit the details. R EMARK 2.4.3. Theorems 2.4.5 and 2.4.6 are generalizations of Theorems 1.1 and 1.3 in [198]. In [199] there are theorems about the best possible constants and discrete analogues of Theorems 2.4.5 and 2.4.6. In [221] Muckenhoupt has given the following more general versions of Hardy’s inequality with weights. In which 0 · ∞ is taken to be 0 and the usual convention is used for the integrals if p or p
is ∞. T HEOREM 2.4.7. Let 1  p  ∞, there is a finite C for which 

  U (x) 

∞

0

x 0

p 1/p   f (t) dt  dx C

 V (x)f (x)p dx

∞

1/p (2.4.24)

0

is true for real f if and only if  B = sup

 U (x)p dx

∞

1/p 

r

r>0


V (x)−p dx

r

1/p
< ∞,

(2.4.25)

0

where 1/p + 1/p
= 1 and U (x), V (x) are weight functions. Furthermore, if
C is the least constant for which (2.4.24) holds, then B  C  p 1/p (p
)1/p B for 1 < p < ∞ and B = C if p = 1 or ∞. T HEOREM 2.4.8. If 1  p  ∞, there is a finite C such that  0

  U (x) 

∞

∞ x

p 1/p    f (t) dt  dx C

 V (x)f (x)p dx

∞

1/p (2.4.26)

0

is true for real f if and only if  B = sup r>0

0

 U (x)p dx

r

1/p 


V (x)−p dx

∞

1/p
< ∞,

r

where 1/p + 1/p
= 1 and U (x), V (x) are weight functions. Furthermore, if C is
the least constant for which (2.4.26) is true, then B  C  p 1/p (p
)1/p B. P ROOFS OF T HEOREMS 2.4.7 AND 2.4.8. For Theorem 2.4.7 it is sufficient to prove the asserted inequalities between B and C. The new proof is the proof that
C  Bp 1/p (p
)1/p . The proof given here that B  C is standard.

153

2.4. Hardy’s Integral Inequality and Its Generalizations


To prove that C  Bp 1/p (p
)1/p for 1 < p < ∞, it will be shown that p 1/p  ∞  x   U (x)  dx f (t) dt   0

0

 Bp

1/p


1/p
p



 V (x)f (x)p dx

∞

1/p .

(2.4.27)

0

x

To do this, let h(x) = [ 0 |V (t)|−p dt]1/(pp ) . By Hölder’s inequality, the pth power of the left-hand side of (2.4.27) is bounded by 

 U (x)p

∞



0

 f (t)V (t)h(t)p dt

x



0

p/p

V (u)h(u)−p du dx.

x 0

Simple special arguments justify this expression even if V (t)h(t) is 0 or ∞ on a set of positive measure provided the right-hand side of (2.4.27) is finite. Fubini’s theorem shows that this expression equals to

p−1 
 ∞  x  ∞       f (t)V (t)h(t)p U (x)p V (u)h(u)−p
 dt du dt. t

0

0

Now, by performing the inner integration, it is apparent that  x

p−1  ∞  
  U (x)p V (u)h(u)−p du du t

(2.4.28)

(2.4.29)

0

equals to 
p−1 p



 U (x)p

∞



t

(p−1)/p

V (u)−p du dx.

x

0

By the definition of B, this expression is bounded above by 
p−1 Bp

 t

 U (x)p

∞



−1/p
 U (u)p du dx.

∞

(2.4.30)

x

Performing the outer integration shows that this expression equals to  ∞

1/p p  
p−1   U (x) dx . p Bp

(2.4.31)

t

By the definition of B, this expression is bounded by   p−1  h(t)−p . pB p p


(2.4.32)

154

Chapter 2. Inequalities Related to Hardy’s Inequality

Now in (2.4.28) we use the fact that (2.4.29) is bounded above by (2.4.32). This shows that (2.4.28) is bounded above by the pth power of the right-hand side of (2.4.27) and completes the proof of (2.4.27) for 1 < p < ∞. For p = 1 and p = ∞, the fact that C  B is proved by showing that  0

  U (x) 

∞

0

x

p 1/p    f (t) dt  dx B

 V (x)f (x)p dx

∞

1/p .

(2.4.33)

0

For p = 1, inequality (2.4.33) follows just by interchanging the order of integration on the left-hand side of the inequality. If p = ∞,  !    x  x "       ess supf (t)V (t) U (x) V (t)−1 dt, U (x) f (t) dt   0

0

0
t
x

and (2.4.33) follows immediately. To prove that B  C, observe that for a nonnegative f , a reduction of the intervals of integration in (2.4.24) shows that for r > 0, 

 U (x)p dx

∞

r

1/p    

0

r

  r

1/p    V (x)f (x)p dx f (t) dt   C .

It is sufficient to show that  ∞

1/p  r

1/p
 
  U (x)p dx V (x)−p dx  C. r

(2.4.34)

0

(2.4.35)

0

r
If p = 1 and 0 < 0 |V (x)|−p dx < ∞, inequality (2.4.35) follows immediately
from (2.4.34) by taking f (x) = |V (x)|−p . If p = 1 and 0 < ess sup0<x
r

and then letting n → ∞. If [ 0 |V (x)|−p dx]1/p = 0, (2.4.35) is immediate.

r

r

If [ 0 |1/V (x)|p dx]1/p = ∞, there exists an f (x) such that [ 0 |f (x) ×

r V (x)|p dx]1/p < ∞ and 0 f (x) dx = ∞. Then if C < ∞, (2.4.34) with this

∞ f shows that [ r |U (x)|p dx]1/p = 0 so (2.4.35) holds. If C = ∞, (2.4.35) is obviously true. To prove Theorem 2.4.8, assume first that 0 < U (x) < ∞ and 0 < V (x) < ∞
almost everywhere on [0, ∞). Let g be a function in Lp . By Fubini’s theorem,

 ∞  ∞ U (x) f (t) dt g(x) dx (2.4.36) 0

x

155

2.5. Further Generalizations of Hardy’s Integral Inequality

equals to

 0

∞



 t 1 V (t)f (t) g(x)U (x) dx dt. V (t) 0

By Hölder’s inequality, this expression is bounded above by 

 f (t)V (t)p dt

∞

1/p 

0

0

 p
1/p
 t   1  dt g(x)U (x) dx .  V (t) 

∞

0

By Theorem 2.4.7, this expression is bounded by p

1/p


1/p
p B

 0

 f (t)V (t)p dt

∞

1/p 


g(x)p

∞

1/p
,

0


and the converse of Hölder’s inequality shows that C  p 1/p (p
)1/p B. Simple limiting arguments take care of the cases where U and V are 0 or ∞ on a set of positive measure. The proof that B  C is most easily done by imitating the corresponding proof of Theorem 2.4.7.  In [221] another necessary and sufficient condition is given for (2.4.24) to hold with a finite C and also the question of general measures is also considered. For various other inequalities related to Hardy’s integral inequality, see [17,18,40,65, 146,148,167,168,199,217,221].

2.5 Further Generalizations of Hardy’s Integral Inequality In the past few years a large number of papers has appeared in the literature which deal with various generalizations of the Hardy’s integral inequality. In this section we shall deal with some generalizations of Hardy’s integral inequality established by Levinson in [190] and Pachpatte in [295,344]. In 1964, Levinson [190] proved the following generalizations of Hardy’s integral inequality. T HEOREM 2.5.1. On an open interval, finite or infinite, let φ(u)
0 be defined and have a second derivative φ


0. For some p > 1, let 
1 
2

φ . φφ
1 − (2.5.1) p At the ends of the interval, let φ take its limiting values, finite or infinite. Then, if for 0 < x < ∞, the range of values of f (x) lie in the closed interval of definition

156

Chapter 2. Inequalities Related to Hardy’s Inequality

of φ and if G is defined by 1 G(x) = x for 0 < x < ∞, then  ∞

  φ G(x) dx <

0






x

f (t) dt

(2.5.2)

0

p p−1

p 

∞

  φ f (x) dx,

(2.5.3)

0

unless φ ≡ 0. P ROOF. Let

 1/p ψ(u) = φ(u)
0.

Then by (2.5.1), ψ

(u)
0 where ψ(u) > 0. Hence ψ(u) is convex. Then by Jensen’s inequality, 
 x   1 1 x  f (t) dt  ψ f (t) dt. (2.5.4) ψ x 0 x 0 Hardy’s inequality in Theorem 2.4.1 applied to ψ(f (x)) gives p  ∞ p
 ∞
 x   p   1 p ψ f (x) dx. ψ f (t) dt dx < x 0 p−1 0 0 Using (2.5.4) and ψ p = φ the proof of the theorem is complete.



R EMARK 2.5.1. We note that in the special case when φ(u) = up , u
0, it shows the constant is the best possible. Theorem 2.5.1 is essentially a special case of the following theorem given by Levinson in [190, Theorem 2]. T HEOREM 2.5.2. Let φ and f be as in Theorem 2.5.1. For x > 0 let r(x) > 0, be continuous and monotone nondecreasing and set  x r(t) dt. (2.5.5) R(x) = 0

Then 




∞

φ 0

1 R(x)



x 0

p  ∞ 
  p r(t)f (t) dt dx  φ f (x) dx. p−1 0

(2.5.6)

157

2.5. Further Generalizations of Hardy’s Integral Inequality

P ROOF. First we prove the special case corresponding to φ(u) = up , p > 1. The general form then follows by using Jensen’s inequality and the special case. Let φ = up , u
0, and in this part of the proof let f
0 and f ∈ Lp (0, ∞). Let  x 1 r(t)f (t) dt Fa (x) = R(x) a and let ga (x) = r

−1/p



x

(x)

r(t)f (t) dt. a

For 0 < a < b < ∞, integrating by parts gives 

b



p

Fa (x) dx =

a

b

r(x)R −p (x)ga (x) dx p

a

= −

b  b 1 p p p−1 R −p+1 (x)ga (x) + Fa (x)f (x) dx p−1 p − 1 a a  b 1 p − R −p+1 (x)r −1 (x)ga (x)r
(x) dx. (2.5.7) p−1 a

From (2.5.7) it is easy to observe that 

b

(p − 1)



p

b

Fa (x) dx +

a

a

R(x)
p r (x)Fa (x) dx  p r 2 (x)



b

p−1

Fa

(x)f (x) dx.

a

(2.5.8)

Since r(x) is nondecreasing, 

b

(p − 1)

p Fa (x) dx



b

p

a

p−1

Fa

(x)f (x) dx.

a

Applying Hölder’s inequality with indices p, p/(p − 1) to the right member and dividing through gives
 (p − 1)

b

1/p

p

Fa (x) dx


 p

a

Or letting

b

1/p f p (x) dx

.

a




p p−1

p =k

(2.5.9)

158 gives

Chapter 2. Inequalities Related to Hardy’s Inequality



b

p



a

Let c > a. Then

 c

b

b

Fa (x) dx  k

f p (x) dx.

a

p



∞

Fa (x) dx  k

f p (x) dx.

0

Now let a → 0 on the left. Then p  ∞  b
 x 1 r(t)f (t) dt dx  k f p (x) dx. R(x) 0 c 0 Since this inequality holds for arbitrary b > c > 0, it follows that p  ∞  x  ∞
1 r(t)f (t) dt dx  k f p (x) dx. R(x) 0 0 0 Next, let ψ = φ 1/p as in the proof of Theorem 2.5.1. By Jensen’s inequality,
  x  x   1 1 ψ r(t)f (t) dt  r(t)ψ f (t) dt. (2.5.10) R(x) 0 R(x) 0 Using (2.5.9) and (2.5.8) we get p  ∞ p
 ∞
 x    p 1 p r(t)ψ f (t) dt dx  ψ f (x) dx. R(x) p − 1 0 0 0 Combining the above inequality with (2.5.10) and using ψ p = φ proves (2.5.6) and the proof is complete.  R EMARK 2.5.2. In the case r ≡ 1, Theorem 2.5.2 is a slightly weaker version of Theorem 2.5.1. If φ(u) = eu and f (x) is replaced by log f (x), where now f
0, then (2.5.6) becomes, on letting p → ∞,
  ∞  ∞  x 1 exp r(t) log f (t) dt dx  e f (x) dx, R(x) 0 0 0 which for r ≡ 1 is a consequence of a result of Knopp [141, p. 250]. For any φ for which φφ


φ
2 , one can let p → ∞ in (2.5.6) to get for such a case 
 x  ∞  ∞   1 r(t)f (t) dt dx  e φ f (x) dx. φ R(x) 0 0 0

2.5. Further Generalizations of Hardy’s Integral Inequality

159

If φ is monotone and hence has an inverse, the analogue of introducing the logarithm can be used here. The following theorem also given by Levinson in [190] is valid and does not require r to be monotone. T HEOREM 2.5.3. Let φ and f be as in Theorem 2.5.1. Let r(x) > 0, x > 0, be absolutely continuous and let R(x) as in (2.5.5) exist. Let there exist λ > 0 such that for almost all x > 0, r
R p +p−1
. λ r2

(2.5.11)

Then  0

∞

1 φ R(x)




x





r(t)f (t) dt dx  λp

0

∞

  φ f (x) dx.

(2.5.12)

0

P ROOF. The proof proceeds as for Theorem 2.5.2 up to (2.5.8). Using (2.5.11) in (2.5.8) gives  b  b p p−1 Fa (x) dx  λ Fa (x)f (x) dx. a

a

Proceeding now much as in the proof of Theorem 2.5.2 gives
 x p  ∞  ∞ 1 r(t)f (t) dt dx  λp f p (x) dx. R(x) 0 0 0

(2.5.13)

Applying (2.5.13) to ψ(f ) instead of f and using (2.5.10) completes the proof.  R EMARK 2.5.3. The case r ≡ 1, φ = up with λ = p/(p − 1) shows the constant in (2.5.12) to be the best possible. In 1992, Pachpatte [295] has established the following generalizations of the certain extensions of well-known Hardy’s inequality given by Chan in [52]. T HEOREM 2.5.4. Let p > 1 be a constant and r be a positive and absolutely continuous function on (1, b) where 1 < b  ∞. Let f be a nonnegative function on (1, b) and r(t)f (t)/t is integrable on (1, b). Let 1 − px(log x)

r
(x) 1
r(x) α

(2.5.14)

160

Chapter 2. Inequalities Related to Hardy’s Inequality

for almost all x ∈ (1, b) and for some constant α > 0. If F (x) is defined by F (x) =



1 r(x)

b

x

r(t)f (t) dt t

for x ∈ (1, b), then 

b

x −1 F p (x) dx  (αp)p



1

 p x −1 (log x)f (x) dx.

b

(2.5.15)

1

T HEOREM 2.5.5. Let p > 1 be a constant and r be a positive and absolutely continuous function on (0, 1). Let f be a nonnegative function on (0, 1) and r(t)f (t)/t is integrable on (0, 1). Let 1 − px(log x)

r
(x) 1
r(x) β

(2.5.16)

for almost all x ∈ (0, 1) and for some constant β > 0. If F (x) is defined by  x 1 r(t)f (t) dt F (x) = r(x) 0 t for x ∈ (0, 1), then 

1

x −1 F p (x) dx  ( βp)p



0

1

 p x −1 | log x|f (x) dx.

(2.5.17)

0

R EMARK 2.5.4. We note that in the special cases when r(x) = 1 and α = β = 1, and setting f (t) = th(t), the inequalities established in Theorems 2.5.4 and 2.5.5 reduces respectively to inequalities (1a) and (2a) given in Theorems 1 and 2 by Chan in [52]. If we replace the function r(x) by 1/r(x) in Theorems 2.5.4 and 2.5.5, then we get the corresponding variants of the inequalities in Theorems 2.5.4 and 2.5.5 which may be of interest in certain situations. P ROOFS OF T HEOREMS 2.5.4 AND 2.5.5. If f is null, then inequality (2.5.15) is trivially true. We assume that f is not null. Integrating the left-hand side in (2.5.15) by parts we have 

b

x 1

−1



b

F (x) dx = p p

1

x −1 (log x)f (x)F p−1 (x) dx



b

+p

(log x) 1

r
(x) p F (x) dx. r(x)

(2.5.18)

161

2.5. Further Generalizations of Hardy’s Integral Inequality

From (2.5.18) we observe that  b

1 − px(log x)

1



b

=p

r
(x) −1 p x F (x) dx r(x)

x −1 (log x)f (x)F p−1 (x) dx.

(2.5.19)

1

By using (2.5.14) in (2.5.19) and then using Hölder’s inequality with indices p, p/(p − 1) on the right-hand side, we obtain 

b

x −1 F p (x) dx

1



b 

 αp

x −1

−(p−1)/p

(p−1)/p p−1   x −1 (log x)f (x) x −1 F (x) dx

1



b 

 αp

x

    −1 −(p−1) −1 p x

1



b

×

p  (log x)f (x) dx

x −1 F p (x) dx

1/p

(p−1)/p .

(2.5.20)

1

Dividing both sides of (2.5.20) by the second integral factor on the right-hand side of (2.5.20), and then taking the pth power of both sides of the resulting inequality, we get the desired inequality (2.5.15). This proof completes Theorem 2.5.4. In order to prove Theorem 2.5.5, we may suppose f is not null. Integrating the left-hand side in (2.5.17) by parts we have 

1

x −1 F p (x) dx = −p



0

1

x −1 (log x)f (x)F p−1 (x) dx

0



1

+p

(log x) 0

r
(x) p F (x) dx. r(x)

(2.5.21)

From (2.5.21) we observe that  1

r
(x) −1 p 1 − px(log x) x F (x) dx r(x) 0  1 x −1 | log x|f (x)F p−1 (x) dx. p 0

(2.5.22)

162

Chapter 2. Inequalities Related to Hardy’s Inequality

Now, by using (2.5.16) in (2.5.22) and by following the arguments as in the proof of Theorem 2.5.4 given below inequality (2.5.19), we get the required inequality in (2.5.17) and the proof of Theorem 2.5.5 is complete.  In the following theorems, we present the results established by Pachpatte in [344] by using a uniform treatment based on the idea used first by Levinson [190] and then by Pachpatte in [252–255,268,295], Pachpatte and Love [278] and Peˇcari´c and Love [382]. These results yield in special cases some of the earlier as well as recent generalizations of Hardy’s inequality given in [70,162,198,382]. T HEOREM 2.5.6. Let p > 1, m = 1 be constants. Let f (x) be a nonnegative and integrable function on (0,

x∞) and let h(x) be a positive continuous function on (0, ∞), and let H (x) = 0 h(t) dt. Let w(x) and r(x) be positive and absolutely continuous functions on (0, ∞). Let 1−

1 H (x) w
(x) p H (x) r
(x) 1 +
m − 1 h(x) w(x) m − 1 h(x) r(x) α1

for m > 1,

(2.5.23)

1−

p H (x) r
(x) 1 1 H (x) w
(x) −
1 − m h(x) w(x) 1 − m h(x) r(x) α2

for m < 1,

(2.5.24)

for almost all x ∈ (0, ∞) and for some positive constants α1 , α2 . If F (x) is defined by  1 x for m > 1, r(x) 0 r(t)h(t)f (t) dt (2.5.25) F (x) =

∞ 1 r(x) x r(t)h(t)f (t) dt for m < 1, for x ∈ (0, ∞), then  ∞ w(x)H (x)−m h(x)F p (x) dx 0


 α

p |m − 1|

 p 

∞

w(x)H (x)p−m h(x)f p (x) dx,

(2.5.26)

0

where α = max{α1 , α2 }. Equality holds in (2.5.26) if f (x) ≡ 0. T HEOREM 2.5.7. Let 0  a < b < ∞, p > 0 and q > 0, α > 0 be constants. Let w(x), r(x) be positive and locally absolutely continuous on (a, b) and f (x) be almost everywhere nonnegative and measurable on (a, b). Let  x r(t)f (t) 1 dt (2.5.27) F (x) = r(x) 0 t log(b/t)

2.5. Further Generalizations of Hardy’s Integral Inequality

163

for all x in [a, b), and

  F (x) = o (b − x)−q/p as x → b− .

(2.5.28)

If p > 1 and 1 w
(x) b p r
(x) b 1 x log + x log
(2.5.29) q w(x) x q r(x) x α for almost all x in (a, b), then


p  b  b b q−1 p b q−1 p 1 αp 1 w(x) log F (x) dx  w(x) log f (x) dx. x x q x x a a (2.5.30) 1−

If 0 < p < 1 and the reverse inequality in (2.5.29) holds, then the reverse inequality in (2.5.30) also holds. T HEOREM 2.5.8. Let a < b < R, p > 1, q < 1, α > 0 be constants. Let w(x), r(x) be positive and locally absolutely continuous in (a, b). Let h(x) be x a positive continuous function and let H (x) = a h(t) dt, for x ∈ (a, b). Let f (x) be nonnegative and measurable on (a, b). Let

 H (R) p H (x) r
(x) H (R) 1 1 H (x) w
(x) log + log
1− 1 − q h(x) w(x) H (x) 1 − q h(x) r(x) H (x) α (2.5.31) for almost all x in (a, b). If F (x) is defined by  x 1 F (x) = r(t)h(t)f (t) dt r(x) a

(2.5.32)

for all x ∈ (a, b), then 

 b H (R) −q p w(x)H −1 (x)h(x) log F (x) dx H (x) a
  

 p−1 αp p b H (R) p−q p  w(x) H (x) h(x) log f (x) dx. 1−q H (x) a (2.5.33) P ROOFS OF T HEOREMS 2.5.6–2.5.8. For the proof of Theorem 2.5.6, let 0 < a < b < ∞ and define, for m > 1,  x 1 Fa (x) = r(t)h(t)f (t) dt, r(x) a

164

Chapter 2. Inequalities Related to Hardy’s Inequality

with F0 (x) = F (x). Integrating by parts gives  a

b

w(x)H (x)−m h(x)Fa (x) dx p



H (x)−m+1 b p = w(x)Fa (x) −m + 1 a  b H (x)−m+1
p p−1 w (x)Fa (x) + w(x)pFa (x) − −m + 1 a

x   r(x)(r(x)h(x)f (x)) − r
(x) a r(t)h(t)f (t) dt × dx. r 2 (t) (2.5.34)

Since m > 1, from (2.5.34) we observe that  b

1 H (x) w
(x) p H (x) r
(x) p 1− + w(x)H (x)−m h(x)Fa (x) dx m − 1 h(x) w(x) m − 1 h(x) r(x) a  b p p−1 w(x)H (x)−m+1 h(x)f (x)Fa (x) dx  m−1 a  b   p = w(x)1/p H (x)(p−m)/p h(x)1/p f (x) m−1 a   p−1 × w(x)(p−1)/p H (x)−m(p−1)/p h(x)(p−1)/p Fa (x) dx. (2.5.35)

Using (2.5.23) and applying Hölder’s inequality with indices p, p/(p − 1) on the right-hand side of (2.5.35), we obtain  a

b

w(x)H (x)−m h(x)Fa (x) dx p

1/p  b p w(x)H (x)p−m h(x)f p (x) dx m−1 a  b (p−1)/p p −m × w(x)H (x)h(x)Fa (x) dx .


 α1

a

(2.5.36)

2.5. Further Generalizations of Hardy’s Integral Inequality

165

Dividing both sides of (2.5.36) by the second integral factor on the right-hand side of (2.5.36), and raising both sides to the pth power, we obtain 

b a

w(x)H −m (x)h(x)Fa (x) dx p


 α1

p m−1

 p 

b

w(x)H p−m (x)h(x)f p (x) dx.

(2.5.37)

a

From (2.5.37) we have  b p w(x)H −m (x)h(x)Fa (x) dx a


 α1

p m−1

 p 

∞

w(x)H p−m (x)h(x)f p (x) dx.

(2.5.38)

0

Let a < c < b. Then, from (2.5.38), we have  b p w(x)H −m (x)h(x)Fa (x) dx c






 α1

p m−1

 p 

∞

w(x)H p−m (x)h(x)f p (x) dx.

(2.5.39)

0

Letting a → 0 in (2.5.39) we have  c

b

w(x)H −m (x)h(x)F p (x) dx


 α1

p m−1

 p 

∞

w(x)H p−m (x)h(x)f p (x) dx.

(2.5.40)

0

Since this inequality holds for arbitrary 0 < c < b, it follows that  ∞ w(x)H −m (x)h(x)F p (x) dx 0

 α1




p m−1

 p 

∞

w(x)H p−m (x)h(x)f p (x) dx.

0

Let 0 < a < b < ∞ and define, for m < 1,  b 1 Fb (x) = r(t)h(t)f (t) dt, r(x) x

(2.5.41)

166

Chapter 2. Inequalities Related to Hardy’s Inequality

with F∞ (x) = F (x). Now, by following the same steps as in the proof of inequality (2.5.41) with suitable modifications, we obtain 

∞

0

w(x)H −m (x)h(x)F p (x) dx


 α2

p 1−m

 p 

∞

w(x)H p−m (x)h(x)f p (x) dx.

(2.5.42)

0

From (2.5.41) and (2.5.42), we obtain  0

∞

w(x)H −m (x)h(x)F p (x) dx


 α

p |m − 1|

 p 

∞

w(x)H p−m (x)h(x)f p (x) dx.

0

The proof of Theorem 2.5.6 is complete. To prove Theorem 2.5.7, let p > 1 and suppose that a > 0. Integrating by parts we have

q−1 b 1 log F p (x) dx x x a

q b b 1 = −w(x)F p (x) log q x a  b

q  b 1 w
(x)F p (x) + w(x)pF p−1 (x) log + q x a

  x 1 r(t)f (t) r(x)f (x) − r
(x) dt 2 dx. × r(x) x log(1/x) r (x) a t log(b/t) (2.5.43)



b

w(x)

From (2.5.43) we observe that  b a



 1 w
(x) b p r
(x) b 1− x log + x log q w(x) x q r(x) x

q−1 b 1 F p (x) dx × w(x) log x x

2.5. Further Generalizations of Hardy’s Integral Inequality

p = q

 b

167

x (p−1)/p (log(b/x))q−(q−1)(p−1)/p w (x) f (x) x log(b/x)

(q−1)(p−1)/p

b F p−1 (x) dx. × w (p−1)/p x −(p−1)/p log x (2.5.44)

a

1/p

Using (2.5.29) and applying Hölder’s inequality with indices p, p/(p − 1) we obtain

q−1 b 1 w(x) log F p (x) dx x x a  b 1/p p w(x)x p−1 (log(b/x))q+p−1 p α f (x) dx q a x p (log(b/x))p

q−1  b (p−1)/p b × w(x)x −1 log F p (x) dx . x a



b

(2.5.45)

Dividing both sides of (2.5.45) by the second integral factor on the right-hand side of (2.5.45) and taking the pth power on both sides of the resulting inequality we get the desired inequality in (2.5.30). Similarly, if 0 < p < 1 and (2.5.29) is reversed, the reverse inequality in (2.5.30) is obtained. Suppose instead that a = 0. If 0 < a
< b, all the hypotheses hold with a replaced by a
, under their respective conditions on p and in (2.5.29). Call these inequalities (2.5.30
). As a
↓ a + , the modified F (x) increases toward the value given in (2.5.27), and both sides of (2.5.30
) tend to the corresponding sides of (2.5.30), using the monotonic convergence theorem for the left-hand sides. This fact limits processes thus produces inequality (2.5.30) as required. This result completes the proof of Theorem 2.5.7. We next establish the inequality (2.5.33) in Theorem 2.5.8. Integrating by parts we obtain 

H (R) −q p w(x)H (x)−1 h(x) log F (x) dx H (x) a

 w(x)F p (x)(log(H (R)/H (x)))−q+1 b =− −q + 1 a  b −q+1 (log(H (R)/H (x))) − −q + 1 a



b

168

Chapter 2. Inequalities Related to Hardy’s Inequality

 × w
(x)F p (x) + w(x)pF p−1 (x) ×



   x   1
r(x) r(x)h(x)f (x) − r (x) r(t)h(t)f (t) dt dx . r 2 (x) a (2.5.46)

From (2.5.46) we observe that  b 1−



 H (R) H (R) 1 H (x) w
(x) p H (x) r
(x) log + log 1 − q h(x) w(x) H (x) 1 − q h(x) r(x) H (x) a −q

H (R) F p (x) dx × w(x)H (x)−1 h(x) log H (x) 

 b p H (R) −q+1 p−1  w(x)h(x)f (x) log F (x) dx 1−q a H (x)   
 b 

H (R) −q 1/p p H (R) log = log 1−q a H (x) H (x)    1/p −(p−1)/p × w(x)1/p H (x)−1 h(x) f (x) −q (p−1)/p 

H (R) × log H (x)  (p−1)/p × w(x)(p−1)/p F p−1 (x) H (x)−1 h(x) dx. (2.5.47)

Using (2.5.31) and applying Hölder’s inequality with indices p, p/(p − 1) we obtain 

H (R) −q p w(x)H (x) h(x) log F (x) dx H (x) a  b



 H (R) −q H (R) p p log log  1−q a H (x) H (x)



b

−1

−(p−1)  × w(x) H (x)−1 h(x)f p (x) dx  ×

b

−1

w(x)H (x) a

1/p



(p−1)/p H (R) −q p h(x) log F (x) dx . H (x)

(2.5.48)

169

2.6. Hardy-Type Integral Inequalities

Dividing both sides of (2.5.48) by the second integral factor on the right-hand side of (2.5.48) and taking the pth power on both sides of the resulting inequality we get the required inequality in (2.5.33). The proof of Theorem 2.5.8 is complete. 

2.6 Hardy-Type Integral Inequalities There are many extensions and variants of Hardy’s integral inequality (2.4.1) established by different writers in different ways. In this section we give some of these results established in the literature during the past few years. In 1968, Izurai and Izumi [162] obtained the following variant of Hardy’s inequality in Theorem 2.4.1. T HEOREM 2.6.1. Let p > 1 and s < −1 and let f be nonnegative and integrable on (0, b). If x s f (x)p is integrable, then 




b

x s G(x)p dx 

0

p −s − 1

p 

b

0

where



x

G(x) =

p 
   x − f (x) dx, x s f 2

t −1 f (t) dt.

(2.6.1)

(2.6.2)

x/2

P ROOF. The proof is based on the idea used in [434, p. 20]. First of all we have  G(x) =

x

t −1 f (t) dt =

x/2




x

t −s/(p−1) t s/p f (t) dt

x/2 x





1/p
 s

p

x

t f (t) dt

t

x/2

−(p+s)q/p

1/q dt

x/2

  = O x −(s+1)/p as x → 0, where 

1 p b

+

1 q

= 1, and then, if s = −1,

x s G(x)p dx

0

=

x s+1 G(x)p s+1

b − 0

p s +1

 0

b


x s+1 G(x)p−1

 f (x) 1 f (x/2) − dx. x 2 x/2

170

Chapter 2. Inequalities Related to Hardy’s Inequality

If s < −1, then the first term on the right-hand side is negative and hence the second term is positive, and  b x s G(x)p dx 0


 x f (x) − f dx x G(x) 2 0 
  b  x  p s(p−1)/p p−1 s−s(p−1)/p  dx f (x) − f  x G(x) x  −s − 1 0 2 
p 1/p
 b 1/q
 b   p x   x s G(x)p dx x s f (x) − f dx . −s − 1 0 2  0

p  −s − 1






b

s

p−1

Dividing both sides of the above inequality by the first integral factor on the righthand side and taking the pth power of both sides we get inequality (2.6.1).  R EMARK 2.6.1. We note that in [162] Izumi and Izumi also have given some other similar variants of Hardy’s inequality so as to use the same in order to establish some inequalities for Fourier series. For other results, we refer the interested readers to [162]. In [255] and [337] Pachpatte has established the following variants of Hardy’s inequality in Theorem 2.4.1. T HEOREM 2.6.2. Let p > 1, m > 1 be constants. Let f be a nonnegative and integrable function on (0, b), b > 0 is a constant. Let r be a positive and absolutely continuous function on (0, b). Let 1+

p r
(x) 1 x
m − 1 r(x) α

(2.6.3)

for almost all x ∈ (0, b) and for some constant α > 0. Then  b x −m F p (x) dx 0


 α

p m−1

p 

b

x 0

−m





p x 1  x  r(x)f (x) − r dx, f  r(x) 2 2 

where F (x) =

1 r(x)



x

x/2

r(t)f (t) dt. t

(2.6.4)

2.6. Hardy-Type Integral Inequalities

171

P ROOF. Integrating by parts the left-hand side in (2.6.4) we obtain  b x −m F p (x) dx 0

=

b x −m+1 p F (x) −m + 1 0 

  b x x 1 p r(x)f (x) − r f F p−1 (x) dx + x −m+1 m−1 0 xr(x) 2 2  b r
(x) p p F (x) dx. x −m+1 (2.6.5) − m−1 0 r(x)

From (2.6.5) we observe that

 b p r
(x) −m p 1+ x x F (x) dx m − 1 r(x) 0
 b  −m (p−1)/p p−1  p x F (x)  m−1 0 

  −m −(p−1)/p −m 1  x x   dx. r(x)f (x) − r f x × x  r(x) 2 2  (2.6.6) From (2.6.3) and using Hölder’s inequality with indices p, p/(p − 1) on the righthand side of (2.6.6), we obtain  b x −m F p (x) dx 0

 b (p−1)/p p −m p x F (x) dx α m−1 0 

 p 1/p  b x 1  x  −m r(x)f (x) − r × x dx . f  r(x) 2 2  0


(2.6.7)

Dividing both sides of (2.6.7) by the first integral factor on the right-hand side in (2.6.7) and taking the pth power on both sides we get the desired inequality in (2.6.4). The proof is complete.  R EMARK 2.6.2. If we take in Theorem 2.6.2, r(x) = 1, α = 1 and −m = s where s < −1 is a constant, then we get the inequality in Theorem 2.6.1 given in [162, Theorem 2].

172

Chapter 2. Inequalities Related to Hardy’s Inequality

T HEOREM 2.6.3. Let p > 1, m > 1 be constants. Let f be a nonnegative and integrable function on (0, b), 0 < b < ∞. If F (x) is defined by 

x

F (x) =

x/2

1 t




t

t/2

 f (s) ds dt s

(2.6.8)

for x ∈ (0, b), then 

b

x −m F p (x) dx 




0

p m−1

2p  0

b


p  x  x −m f (x) − f dx. 4 

(2.6.9)

P ROOF. Integrating the left-hand side in (2.6.9) by parts we have 

b

0

x −m F p (x) dx 
b−m+1 p p F (b) + m−1 m−1

 x  b  x/2 1 1 f (s) f (s) 1 ds − ds dx. × x −m+1 F p−1 (x) x x/2 s 2 x/2 x/4 s 0

=−

(2.6.10) From (2.6.10) and using Hölder’s inequality with indices p, p/(p − 1) we observe that  0

b

x −m F p (x) dx

  x/2 f (s) f (s)  ds − ds  dx  x F s 0 x/2 s x/4
 b   x p |f (s)| −m p−1  ds dx x F (x) m−1 0 s x/4 
p = m−1

 b   −m (p−1)/p p−1   −m −(p−1)/p+1 x |f (s)| ds dx x × F (x) x s 0 x/4


p m−1



b

−m

p−1

  (x)

x

173

2.6. Hardy-Type Integral Inequalities

  b

−(p−1)/p p −m p  x F (x) dx m−1 0  x p 1/p  b |f (s)| ds dx × x −m . s 0 x/4


(2.6.11)

Dividing both sides of (2.6.11) by the first integral factor on the right-hand side in (2.6.11) and taking the pth power of both sides we get 

b

x −m F p (x) dx 

0




p m−1

p 

b 0

x −m



x

x/4

|f (s)| ds s

p dx.

(2.6.12)

Now, integrating by parts the integral on the right-hand side in (2.6.12), we have 

p |f (s)| ds dx x s 0 x/4  b 
 b−m+1 p |f (s)| =− ds + m − 1 b/4 s m−1 
  x p−1  b  1 1  x  1  |f (s)| f  dx. × ds f (x) − x −m+1 s x 4 x/4  4  0 x/4



b

−m

x

(2.6.13) From (2.6.13) and using Hölder’s inequality with indices p, p/(p − 1) we observe that 



p |f (s)| ds dx s 0 x/4  x   b p−1
 −m (p−1)/p |f (s)| p x ds  m−1 0 s x/4 
  −m −(p−1)/p+1  x   × x f (x) − f 4  dx
p (p−1)/p  x   b p |f (s)|  ds dx x −m m−1 s 0 x/4 
p 1/p  b  x  × x −m f (x) − f dx . (2.6.14) 4  0 b

x −m

x

174

Chapter 2. Inequalities Related to Hardy’s Inequality

Dividing both sides of (2.6.14) by the first integral factor on the right-hand side in (2.6.14) and taking the pth power of both sides we get 




p |f (s)| ds dx s 0 x/4 
p
p  b  x  p −m   x f (x) − f dx. m−1 4  0 b

x −m

x

(2.6.15)

Using (2.6.15) in (2.6.12) we get the desired inequality in (2.6.9). The proof is complete.  Motivated by Hardy’s inequality, in 1987, Pachpatte [254] establishes the following inequalities. T HEOREM 2.6.4. Let m = 1 and pj > 1, j = 1, 2, 3, be constants. Let fj (x), j = 1, 2, 3, be nonnegative and integrable functions on (0, ∞) and let rj (x), j = 1, 2, 3, be positive and absolutely continuous functions on (0, ∞). Let 
rj (x) 2pj 1 x
m − 1 rj (x) αj 

rj (x) 2pj 1 x
1− 1 − m rj (x) βj


1+

for m > 1,

(2.6.16)

for m < 1,

(2.6.17)

for almost all x > 0 and for some positive constants αj , βj , j = 1, 2, 3. If Fj (x), j = 1, 2, 3, are defined by 

 r 1(x) 0x rj (t)ft j (t) dt for m > 1, j (2.6.18) Fj (x) =  1 ∞ rj (t)fj (t) dt for m < 1, rj (x) x t then  0

∞

 p  p p p p p x −m F1 1 (x)F2 2 (x) + F2 2 (x)F3 3 (x) + F3 3 (x)F1 1 (x) dx

2pj  ∞

3 
 2pj −m 2pj λ x fj (x) dx ,  |m − 1| 0

(2.6.19)

j =1

where λ = max{αj , βj } for j = 1, 2, 3. Equality holds in (2.6.19) if fj (x) ≡ 0, j = 1, 2, 3.

175

2.6. Hardy-Type Integral Inequalities

T HEOREM 2.6.5. Let m, pj , fj , rj be as in Theorem 2.6.4. Let 

rj (x) 4pj 1 x
for m > 1, 1+ m − 1 rj (x) αj· 

rj (x) 4pj 1 x
· for m < 1, 1− 1 − m rj (x) βj

(2.6.20)

(2.6.21)

for almost all x > 0 and for some positive constants αj· , βj· , j = 1, 2, 3. If Fj (x), j = 1, 2, 3, are defined by (2.6.18), then  ∞  p  p p p p p x −m F1 1 (x)F2 2 (x)F3 3 (x) F1 1 (x) + F2 2 (x) + F3 3 (x) dx 0



4pj  ∞ 3 
 4pj 4p x −m fj j (x) dx , λ· |m − 1| 0

(2.6.22)

j =1

where λ· = max{αj· , βj· } for j = 1, 2, 3. Equality holds in (2.6.22) if fj (x) ≡ 0, j = 1, 2, 3. R EMARK 2.6.3. In the special cases when pj = p > 1, fj = f , Fj = F , rj = 1, λ = 1 and λ· = 1, the inequalities established in (2.6.19) and (2.6.22) reduce, respectively, to the following inequalities 2p  ∞
 ∞ 2p −m 2p x F (x) dx  x −m f 2p (x) dx (2.6.23) |m − 1| 0 0 and



∞ 0

x −m F 4p (x) dx 




4p |m − 1|

4p 

∞

x −m f 4p (x) dx.

(2.6.24)

0

We note that the inequalities obtained in (2.6.23) and (2.6.24) are the slight variants of Hardy’s inequality in Theorem 2.4.2. T HEOREM 2.6.6. Let m = 1 and pi > 1, i = 1, . . . , n, be constants. Let gi (x), i = 1, . . . , n, be nonnegative and integrable functions on (0, ∞) and let ki (x), i = 1, . . . , n, be positive and absolutely continuous functions on (0, ∞). Let 

k (x) 1 npi x i
1+ for m > 1, (2.6.25) m − 1 ki (x) γi

k (x) npi 1 1− x i for m < 1, (2.6.26)
1 − m ki (x) δi

176

Chapter 2. Inequalities Related to Hardy’s Inequality

for almost all x > 0 and for some positive constants γi , δi , i = 1, . . . , n. If Gi (x), i = 1, . . . , n, are defined by 

x ki (t)gi (t)  1 dt for m > 1, ki (x) 0 t Gi (x) = (2.6.27)

∞ ki (t)gi (t)  1 dt for m < 1, ki (x) x t then 

∞

x −m

0

n 

p

Gi i (x) dx

i=1

1  n

n   i=1




npi µ |m − 1|

npi  0

∞

np x −m gi i (x) dx

,

(2.6.28)

where µ = max{γi , δi } for i = 1, . . . , n. Equality holds in (2.6.28) if gi (x) ≡ 0, i = 1, . . . , n. R EMARK 2.6.4. In the special case when pi = p > 1, gi = g, Gi = G, ki = 1 and µ = 1, the inequality established in (2.6.28) reduces to the following inequality np  ∞
 ∞ np x −m Gnp (x) dx  x −m g np (x) dx, |m − 1| 0 0 which in turn is a variant of Hardy’s inequality in Theorem 2.4.2. The following inequalities established by Pachpatte in [254] have their origins in the variant of Hardy’s inequality given by Izumi and Izumi in Theorem 2.6.1. T HEOREM 2.6.7. Let m > 1 and pj > 1, j = 1, 2, 3, be constants. Let hj (x), j = 1, 2, 3, be nonnegative and integrable functions on (0, b) and let zj (x), j = 1, 2, 3, be positive and absolutely continuous functions on (0, b). Let
1+


zj (x) 2pj 1 x
m − 1 zj (x) ηj

(2.6.29)

for almost all x ∈ (0, b) and for some positive constants ηj , j = 1, 2, 3. If Hj (x), j = 1, 2, 3, are defined by  x zj (t)hj (t) 1 dt, (2.6.30) Hj (x) = zj (x) x/2 t

177

2.6. Hardy-Type Integral Inequalities

then  b  p  p p p p p x −m H1 1 (x)H2 2 (x) + H2 2 (x)H3 3 (x) + H3 3 (x)H1 1 (x) dx 0

2pj 3 
 2pj ηj m−1



j =1

 ×

b

x

−m



0



2pj 1  x x  zj (x)hj (x) − zj hj dx . (2.6.31)  zj (x) 2 2 

T HEOREM 2.6.8. Let m, pj , hj , zj be as defined in Theorem 2.6.7. Let
1+


zj (x) 4pj 1 x
m − 1 zj (x) ξj

(2.6.32)

for almost all x ∈ (0, b) and for some positive constants ξj , j = 1, 2, 3. If Hj (x), j = 1, 2, 3, defined by (2.6.30), then  b  p  p p p p p x −m H1 1 (x)H2 2 (x)H3 3 (x) H1 1 (x) + H2 2 (x) + H3 3 (x) dx 0

4pj 3 
 4pj ξj  m−1 j =1



b

× 0

x −m





4pj 1  x x  z hj (x)h (x) − z dx . j j j  zj (x) 2 2 

(2.6.33)

R EMARK 2.6.5. In the special cases when pj = p > 1, hj = h, Hj = H, zj = 1, ηj = 1 and ξj = 1, the inequalities established in (2.6.31) and (2.6.33) reduce, respectively, to the inequalities 
2p  
 b x  2p 2p b −m  x −m H 2p (x) dx  x h(x) − h dx, (2.6.34) m−1 2  0 0 and  0

b

x −m H 4p (x) dx 




4p m−1

4p  0

b


4p  x  x −m h(x) − h dx. 2 

(2.6.35)

We note that, by setting −m = s and 2p = p · > 1 in (2.6.34) and 4p = p · > 1 in (2.6.35), the inequalities obtained in (2.6.34) and (2.6.35) reduce to the inequality established by Izumi and Izumi in Theorem 2.6.1.

178

Chapter 2. Inequalities Related to Hardy’s Inequality

T HEOREM 2.6.9. Let m > 1 and pi > 1, i = 1, . . . , n, be constants. Let qi (t), i = 1, . . . , n, be nonnegative and integrable functions on (0, b) and let wi (x), i = 1, . . . , n, be positive and absolutely continuous functions on (0, b). Let
1+


w (x) npi 1 x i
m − 1 wi (x) γi

(2.6.36)

for almost all x ∈ (0, b) and for some positive constants γi , i = 1, . . . , n. If Qi (x), i = 1, . . . , n, are defined by Qi (x) =

1 wi (x)



x

wi (t)qi (t) dt, t

x/2

(2.6.37)

then 

b

x −m

0

n 

p

Qi i (x) dx

i=1

npi n 
npi 1 γi  n m−1 i=1

 ×

b

x 0

−m





npi 1  x x  wi (x)qi (x) − wi qi dx .  wi (x) 2 2  (2.6.38)

R EMARK 2.6.6. We note that in the special case when pi = p > 1, qi = q, Qi = Q, wi = 1 and γi = 1, the inequality established in (2.6.38) reduces to the following inequality 

b

x 0

−m


Q (x) dx  np

np m−1

np 

b

x 0


np  x  q(x) − q 2  dx,

−m 

which in turn, by setting −m = s and np = p · > 1, reduces to the inequality of Izumi and Izumi given in Theorem 2.6.1. P ROOFS OF T HEOREMS 2.6.4–2.6.9. Let 0 < a < b < ∞ and define, for m > 1,  x rj (t)fj (t) 1 dt, (2.6.39) Fj a (x) = rj (x) a t

179

2.6. Hardy-Type Integral Inequalities

with Fj 0 (x) = Fj (x) for j = 1, 2, 3. From (2.6.39) and using the elementary inequalities c1 c2 + c2 c3 + c3 c1  c12 + c22 + c32 (for c1 , c2 , c3 real), we observe that p

p

p

p

p

p

F1a1 (x)F2a2 (x) + F2a2 (x)F3a3 (x) + F3a3 (x)F1a1 (x) 2p

2p

2p

 F1a 1 (x) + F2a 2 (x) + F3a 3 (x).

(2.6.40)

Multiplying both sides of (2.6.40) by x −m and integrating from a to b we have 

b a

 p  p p p p p x −m F1a1 (x)F2a2 (x) + F2a2 (x)F3a3 (x) + F3a3 (x)F1a1 (x) dx 



b

x a

−m

2p F1a 1 (x) dx



b

+

x a

−m

2p F2a 2 (x) dx

 +

b

a

x −m F3a 3 (x) dx. 2p

(2.6.41) Integrating by parts we have 

b a

x −m Fj a j (x) dx 2p

=

b x −m+1 2pj Fj a (x) −m + 1 a  b −m+1 x 2p −1 2pj Fj a j (x) − −m + 1 a    

 x rj (t)fj (t) rj (x)fj (x) 1 × 2 − rj
(x) dt dx rj (x) x t rj (x) a (2.6.42)

for j = 1, 2, 3. Since m > 1, from (2.6.42) we observe that



 b rj (x) −m 2pj 2pj 1+ x x Fj a (x) dx m − 1 rj (x) a  b
 m (2pj −1)/(2pj )  −(2pj −1)/(2pj ) 2pj −1  2pj x  fj (x) x m Fj a (x) dx. m−1 a (2.6.43) From (2.6.16) and applying Hölder’s inequality with indices 2pj , 2pj /(2pj − 1)

180

Chapter 2. Inequalities Related to Hardy’s Inequality

on the right-hand side of (2.6.43), we obtain  a

b

x −m Fj a j (x) dx 2p




 b 1/(2pj ) 2pj 2p x −m fj j (x) dx m−1 a  b (2pj −1)/(2pj ) 2p × x −m Fj a j (x) dx .

 αj

(2.6.44)

a

Dividing both sides of (2.6.44) by the second integral factor on the right-hand side of (2.6.44) and raising both sides to the 2pj th power we obtain  a

b

2pj  b 
2pj 2p 2p x −m Fj a j (x) dx  αj x −m fj j (x) dx m−1 a

(2.6.45)

for j = 1, 2, 3. Using (2.6.45) in (2.6.41) we have 

b

a

 p  p p p p p x −m F1a1 (x)F2a2 (x) + F2a2 (x)F3a3 (x) + F3a3 (x)F1a1 (x) dx

2pj  b

3 
 2pj −m 2pj αj x fj (x) dx .  m−1 a

(2.6.46)

j =1

From (2.6.46) we have 

b

a

 p  p p p p p x −m F1a1 (x)F2a2 (x) + F2a2 (x)F3a3 (x) + F3a3 (x)F1a1 (x) dx



2pj  ∞

3 
 2pj 2p αj x −m fj j (x) dx . m−1 0

(2.6.47)

j =1

Let a < c < b. Then, from (2.6.47), we have  c

b

 p  p p p p p x −m F1a1 (x)F2a2 (x) + F2a2 (x)F3a3 (x) + F3a3 (x)F1a1 (x) dx



2pj  ∞

3 
 2pj 2p αj x −m fj j (x) dx . m−1 0 j =1

(2.6.48)

181

2.6. Hardy-Type Integral Inequalities

Letting a → 0 on the left-hand side of (2.6.48) we have  b  p  p p p p p x −m F1 1 (x)F2 2 (x) + F2 2 (x)F3 3 (x) + F3 3 (x)F1 1 (x) dx c

2pj  ∞

3 
 2pj −m 2pj αj x fj (x) dx .  m−1 0 j =1

Since this inequality holds for arbitrary 0 < c < b, it follows that  ∞  p  p p p p p x −m F1 1 (x)F2 2 (x) + F2 2 (x)F3 3 (x) + F3 3 (x)F1 1 (x) dx 0



2pj  ∞

3 
 2pj 2p αj x −m fj j (x) dx . m−1 0

(2.6.49)

j =1

Let 0 < a < b < ∞ and define, for m < 1,  b rj (t)fj (t) 1 dt, Fj b (x) = rj (x) x t

(2.6.50)

with Fj ∞ (x) = Fj (x) for j = 1, 2, 3. Now, by following the same steps as in the proof of inequality (2.6.49) with suitable modifications, we obtain  ∞  p  p p p p p x −m F1 1 (x)F2 2 (x) + F2 2 (x)F3 3 (x) + F3 3 (x)F1 1 (x) dx 0



2pj  ∞

3 
 2pj 2p βj x −m fj j (x) dx . m−1 0

(2.6.51)

j =1

From (2.6.49) and (2.6.51), we obtain  ∞  p  p p p p p x −m F1 1 (x)F2 2 (x) + F2 2 (x)F3 3 (x) + F3 3 (x)F1 1 (x) dx 0



2pj  ∞

3 
 2pj 2p λ x −m fj j (x) dx . |m − 1| 0 j =1

The proof of Theorem 2.6.4 is complete. In order to establish inequality (2.6.22) in Theorem 2.6.5, let 0 < a < b < ∞ and define Fj a (x) by (2.6.39). From (2.6.39) and using the elementary inequalities c1 c2 c3 (c1 + c2 + c3 )  13 (c1 c2 + c2 c3 + c3 c1 )2 , (c1 c2 + c2 c3 + c3 c1 ) 

182

Chapter 2. Inequalities Related to Hardy’s Inequality

c12 + c22 + c32 and (c1 + c2 + c3 )2  3(c12 + c22 + c32 ) (for c1 , c2 , c3 real) (see [211, pp. 201, 203]), we observe that  p  p p p p p F1a1 (x)F2a2 (x)F3a3 (x) F1a1 (x) + F2a2 (x) + F3a3 (x) 4p

4p

4p

 F1a 1 (x) + F2a 2 (x) + F3a 3 (x).

(2.6.52)

Multiplying both sides of (2.6.52) by x −m and integrating from a to b we have  a

b

 p  p p p p p x −m F1a1 (x)F2a2 (x)F3a3 (x) F1a1 (x) + F2a3 (x) + F3a3 (x) dx 

b



x

−m

a

4p F1a 1 (x) dx

 +

b

x

−m

a

4p F2a 2 (x) dx

 +

b

a

x −m F3a 3 (x) dx. 4p

(2.6.53) The rest of the proof of Theorem 2.6.5 follows exactly the same steps as in the proof of Theorem 2.6.4 below inequality (2.6.41) with suitable changes, and hence we omit the further details. Let 0 < a < b < ∞ and define, for m > 1, Gia (x) =

1 ki (x)



x a

ki (t)gi (t) dt, t

(2.6.54)

with Gi0 (x) = Gi (x), i = 1, . . . , n. From (2.6.54) and using the elementary # inequalities ( ni=1 ci )1/n  n1 ni=1 ci and ( ni=1 ci )n  nn−1 ni=1 cin (for c1 , . . . , cn
0 real for n
1) (see [211]), we observe that n 

 p Giai (x) =

i=1

n 

1/n n p Giai (x)

1  npi Gia (x). n n



i=1

(2.6.55)

i=1

Multiplying both sides of (2.6.55) by x −m and integrating from a to b we have 

b

x a

−m

n  i=1

p Giai (x) dx

1  n





b

x a

−m

n 

np

Gia i (x) dx.

i=1

Now, by following the same steps as in the proof of Theorem 2.6.4 below inequality (2.6.41) with suitable modifications, we obtain the desired inequality in (2.6.28). The proof of Theorem 2.6.6 is complete.

183

2.6. Hardy-Type Integral Inequalities

From (2.6.30) and using the elementary inequality c1 c2 + c2 c3 + c3 c1  c12 + c22 + c32 (for c1 , c2 , c3 real), we observe that p

p

p

p

p

p

H1 1 (x)H2 2 (x) + H2 2 (x)H3 3 (x) + H3 3 (x)H1 1 (x) p

2p

p

 H1 1 (x) + H2 2 (x) + H3 3 (x).

(2.6.56)

Multiplying both sides of (2.6.56) by x −m and integrating from 0 to b we have 

b 0

 p  p p p p p x −m H1 1 (x)H2 2 (x) + H2 2 (x)H3 3 (x) + H3 3 (x)H1 1 (x) dx 

b



x

−m

0

2p H1 1 (x) dx

 +

b

x 0

−m

2p H2 2 (x) dx

 + 0

b

x −m H3 3 (x) dx. 2p

(2.6.57)

Integrating by parts we obtain 

b 0

x −m Hj

2pj

(x) dx

=

b x −m+1 2pj Hj (x) −m + 1 0

  b 
2pj x x 1 2p −1 zj (x)hj (x) − zj hj Hj j (x) dx + x −m m−1 0 zj (x) 2 2  b
zj
(x) 2pj 2pj H (x) dx. − x −m+1 (2.6.58) m−1 0 zj (x) j

From (2.6.58) we observe that  b







zj (x) −m 2pj 2pj 1+ x x Hj (x) dx m − 1 zj (x) 0   b
 −m −(2pj −1)/2pj −m 1 2pj x  x m−1 0 zj (x) 

  x x  hj × zj (x)hj (x) − zj 2 2   (2pj −1)/(2pj ) 2pj −1  × x −m Hj (x) dx.

(2.6.59)

184

Chapter 2. Inequalities Related to Hardy’s Inequality

From (2.6.29) and using Hölder’s inequality with indices 2pj , 2pj /(2pj − 1) we obtain 

b

0

x −m Hj

2pj

(x) dx




 2pj m−1  

2pj 1/(2pj )  b 1  x x  −m zj (x)hj (x) − zj hj x dx ×  zj (x) 2 2  0  b (2pj −1)/(2pj ) 2p × x −m Hj j (x) dx . (2.6.60)

 ηj

0

Dividing both sides of (2.6.60) by the second integral factor on the right-hand side of (2.6.60) and taking the 2pj th power on both sides of the resulting inequality, we obtain 

b 0

x −m Hj

2pj

(x) dx

2pj 
2pj  ηj m−1  

2pj  b 1  x x  −m z hj × x (x)h (x) − z dx j j j  zj (x) 2 2  0

(2.6.61)

for j = 1, 2, 3. Using (2.6.61) in (2.6.57) we obtain the desired inequality in (2.6.31). The proof of Theorem 2.6.7 is complete.  The proofs of Theorems 2.6.8 and 2.6.9 follow from the proof of Theorem 2.6.7 and by similar arguments as in the proofs of Theorems 2.6.5 and 2.6.6 and with suitable modification. Here we omit the details.

2.7 Multidimensional Hardy-Type Inequalities In view of wider applications, Hardy’s integral inequality has been generalized in various directions. The present section is devoted to the multidimensional Hardytype inequalities investigated by Pachpatte in [293,315,333,341]. The analysis

2.7. Multidimensional Hardy-Type Inequalities

185

used in the proofs is based on the applications of well-known Fubini’s theorem and Jensen’s integral inequality. In [315] Pachpatte established the following Hardy-type integral inequalities involving functions of two independent variables. T HEOREM 2.7.1. Let f be a nonnegative integrable function on ∆ = (0, a) × (0, b), where a, b are positive constants, and r1 , r2 be positive and absolutely continuous functions on (0, ∞) such that 1+

r
(x) 1 p x 1
, p − 1 r1 (x) α

(2.7.1)

1+

r
(y) 1 p y 2
, p − 1 r2 (y) β

(2.7.2)

for almost all x, y ∈ (0, ∞) and some constants α > 0, β > 0, p > 1. If F is defined by 1 F (x, y) = r1 (x)r2 (y)



x



y

x/2 y/2

r1 (s)r2 (t)f (s, t) dt ds st

(2.7.3)

for (x, y) ∈ ∆, then  a b 

 F (x, y) p dy dx xy 0 0
2p p p  (αβ) p−1 


 a b   1 r2 (y) r1 (x)f (x, y) − r2 x f x , y × xyr1 (x)r2 (y)  2 2 0 0



 p
 y x x y y  dy dx. r1 (x)f x, − r1 f , − r2  2 2 2 2 2 (2.7.4)

T HEOREM 2.7.2. Let g be a nonnegative integrable function on ∆ and the functions r1 , r2 and the constant p be as defined in Theorem 2.7.1 satisfying the conditions (2.7.1) and (2.7.2). If G is defined by G(x, y) =

1 r1 (x)r2 (y)



x



x/2 0

y

r1 (s)r2 (t)g(s, t) dt ds st

(2.7.5)

186

Chapter 2. Inequalities Related to Hardy’s Inequality

for (x, y) ∈ ∆, then  a b 

 G(x, y) p dy dx xy 0 0
2p p p  (αβ) p−1 

p  a b   1  x x r1 (x)g(x, y) − r1 g , y  dy dx. ×  xyr1 (x) 2 2 0 0

(2.7.6)

T HEOREM 2.7.3. Let h be a nonnegative integrable function on ∆ and the functions r1 , r2 and the constant p be as in Theorem 2.7.1 satisfying (2.7.1) and (2.7.2). If H is defined by  x y r1 (s)r2 (t)h(s, t) 1 dt ds (2.7.7) H (x, y) = r1 (x)r2 (y) 0 y/2 st for (x, y) ∈ ∆, then  a b 

 H (x, y) p dy dx xy 0 0
2p p  (αβ)p p−1 

  a b  1  y y  p r h x, × (y)h(x, y) − r dy dx. 2 2 xyr2 (y)  2 2  0 0

(2.7.8)

R EMARK 2.7.1. The inequalities (2.7.4), (2.7.6) and (2.7.8) extend the result provided in [255, Theorem 1, with p = m therein] to the case of two independent variables. In the special case of r1 (x) = r2 (y) = 1, α = β = 1, inequalities (2.7.4), (2.7.6) and (2.7.8) reduce to  a b 

 F (x, y) p dy dx xy 0 0 2p
p  p−1


  a b   x 1  y x y  p f (x, y) − f , y − f x, + f , × dy dx, xy  2 2 2 2  0 0 (2.7.9)

2.7. Multidimensional Hardy-Type Inequalities

187

 a b 

 G(x, y) p dy dx xy 0 0
2p  a b   p
 x 1  p g(x, y) − g , y  dy dx,   p−1 xy 2 0 0 p  a b  H (x, y) dy dx xy 0 0
2p  a b   
y  p 1  p h(x, y) − h x,  dy dx, p−1 xy  2  0 0

(2.7.10)

(2.7.11)

respectively. Inequalities (2.7.9)–(2.7.11) can be considered as the two independent variables generalizations of the slight variant of Hardy’s inequality given in Theorem 2.6.1. P ROOFS OF T HEOREMS 2.7.1–2.7.3. For f = 0 inequality (2.7.4) is trivially true. We assume that f is positive and denote by I the integral on the left-hand side of (2.7.4). By using Fubini’s theorem (see [3, p. 18]), we observe that  a  −p I= xr1 (x) I1 (x) dx, (2.7.12) 0

where



I1 (x) =

b

y 0

−p



1 r2 (y)



y

y/2

r2 (t) t




x

x/2

 p r1 (s)f (s, t) ds dt dy. s

(2.7.13)

By keeping x fixed in (2.7.13) and integrating by parts, we have the relation   x

p  b 1 r2 (t) r1 (s)f (s, t) b−p+1 ds dt I1 (x) = − p − 1 r2 (b) b/2 t s x/2   x

p−1  b  y 1 r2 (t) r1 (s)f (s, t) p −p+1 ds dt + y p−1 0 r2 (y) y/2 t s x/2
 1 r2 (y) x r1 (s)f (s, y) ds r2 (y) × 2 y s r2 (y) x/2   1 r2 (y/2) x r1 (s)f (s, y/2) − ds 2 y/2 s x/2
 x   y r2 (t) r1 (s)f (s, t)
− r2 (y) ds dt dy, s y/2 t x/2 (2.7.14)

188

Chapter 2. Inequalities Related to Hardy’s Inequality

implying  b


   x

p  y r
(y) −p p 1 r2 (t) r1 (s)f (s, t) y 2 y ds dt dy p − 1 r2 (y) r2 (y) y/2 t s 0 x/2
 x  p−1  b  y 1 r2 (t) r1 (s)f (s, t) p −p+1 y ds dt  p−1 0 r2 (y) y/2 t s x/2   x r1 (s)f (s, y) 1  r2 (y) ds × yr2 (y)  s x/2 
 x y r1 (s)f (s, y/2)  ds  dy. − r2 2 x/2 s (2.7.15) 1+

From (2.7.1), (2.7.15), using Hölder’s integral inequality with indices p, p/(p − 1) we get I1 (x) 

αp (p−1)/p (x) I p−1 1   b  x 1  r1 (s)f (s, y) r ds × (y) 2  yr2 (y) s 0 x/2 
 x y r1 (s)f (s, y/2)  p 1/p − r2 ds  . 2 x/2 s (2.7.16) (p−1)/p

Dividing both sides of (2.7.16) by I1 power we get
I1 (x) 

αp p−1

p 

b

y −p

0



(x) and raising the result to the pth

  x 1  r1 (s)f (s, y) r ds (y) 2  r2 (y) s x/2 
 x y r1 (s)f (s, y/2)  p ds  dy. − r2 2 x/2 s (2.7.17)

Substituting (2.7.17) in (2.7.12) and using Fubini’s theorem, we obtain
I

αp p−1

p  0

b

y −p I2 (y) dy,

(2.7.18)

2.7. Multidimensional Hardy-Type Inequalities

189

where  I2 (y) =

a

x 0

m(x, y) = r2 (y)

−p





x x/2

|m(x, y)| r1 (x)r2 (y)

p dx,

(2.7.19)


 x y r1 (s)f (s, y) r1 (s)f (s, y/2) ds − r2 ds. s 2 x/2 s (2.7.20)

Now, keeping y fixed in (2.7.19), using the relation |m(x, y)| = m(x, y) × sgn m(x, y) and integrating by parts, we have the equality   a −p+1 |m(a, y)| p I2 (y) = −p + 1 r1 (a)r2 (y)    a |m(x, y)| p−1 p + x −p+1 p−1 0 r1 (x)r2 (y)


x x sgn m(x, y) r2 (y) r1 (x)f (x, y) − r1 f ,y × xr1 (x)r2 (y) 2 2



 
y x x y y r1 (x)f x, − r1 f , dx − r2 2 2 2 2 2  p−1
 a r1 (x) m(x, y) sgn m(x, y) p −p+1 |m(x, y)| − dx, x p−1 0 r1 (x)r2 (y) r1 (x) r1 (x)r2 (y) (2.7.21) which implies  a


   r1
(x) −p |m(x, y)| p p 1+ x x dx p − 1 r1 (x) r1 (x)r2 (y) 0 

  a |m(x, y)| p−1 p x −p+1  p−1 0 r1 (x)r2 (y) 


 x x 1  r2 (y) r1 (x)f (x, y) − r1 f ,y × xr1 (x)r2 (y)  2 2



 
 y x x y y  dx. r1 (x)f x, − r1 f , − r2 2 2 2 2 2  (2.7.22)

190

Chapter 2. Inequalities Related to Hardy’s Inequality

From (2.7.2), (2.7.22), using Hölder’s inequality with indices p, p/(p − 1), we get I2 (y) 

βp (p−1)/p I (y) p−1 2   a 


 1 −p r2 (y) r1 (x)f (x, y) − r1 x f x , y × x r1 (x)r2 (y)  2 2 0



 p 1/p
 y x x y y  dx r1 (x)f x, − r1 f , . − r2 2 2 2 2 2  (2.7.23) (p−1)/p

Dividing both sides of (2.7.23) by I2 get  βp p I2 (y)  p−1   a × x −p

(y), and raising to the pth power, we




0




 1 r2 (y) r1 (x)f (x, y) − r1 x f x , y r1 (x)r2 (y)  2 2




 p  y x x y y  dx. − r2 r1 (x)f x, − r1 f , 2 2 2 2 2  (2.7.24)

Substituting (2.7.24) in (2.7.18) and using Fubini’s theorem we get (2.7.4), which completes the proof of Theorem 2.7.1. The proofs of Theorems 2.7.2 and 2.7.3 follow by the similar arguments as in the proof of Theorem 2.7.1 with suitable modifications. Here we omit the details.  In the following theorems we present Hardy-type integral inequalities involving functions of several independent variables. In what follows, let B and H be subsets of the n-dimensional Euclidean space Rn defined by B = {x ∈ Rn : 0 < x < ∞} and H = {x ∈ Rn : a < x < b}, where 0, a, b ∈ Rn and a > 0. For the

u(z) and v(z) defined on B and H , respectively, we denote by

functions u(z) dz, B Bx,y u(z) dz and H v(z) dz, Hx,y v(z) dz the n-fold integrals 

∞



···

0

0

∞

 u(z1 , . . . , zn ) dzn · · · dz1 ,

y1

···

x1



yn xn

u(z1 , . . . , zn ) dzn · · · dz1

191

2.7. Multidimensional Hardy-Type Inequalities

and  b1  ··· a1



bn

v(z1 , . . . , zn ) dzn · · · dz1 ,

an

y1

···

x1



yn

v(z1 , . . . , zn ) dzn · · · dz1 ,

xn

respectively, where xi < yi and ai < bi . Hereafter, in this section without further mention, we assume that all inequalities between vectors are componentwise and all the integrals exists on the respective domains of their definitions. In 1992, Pachpatte [293] has established the following multivariate version of Hardy’s integral inequality given in Theorem 2.4.1. T HEOREM 2.7.4. Let p > 1 be a constant. Let f (x) be a nonnegative and integrable function on B, and define  F (x) = f (y) dy, x ∈ B, (2.7.25) B0,x

then

−p np 
  n p xi F p (x) dx  f p (x) dx. p−1 B B

(2.7.26)

i=1

Equality holds in (2.7.26) if f (x) ≡ 0. P ROOF. Let a = (a1 , . . . , an ) ∈ B, b = (b1 , . . . , bn ) ∈ B, 0 < a < b < ∞, and define  f (y) dy, x ∈ B. (2.7.27) Fa (x) = Ba,x

From (2.7.27) and by Fubini’s theorem [3, p. 18], we have 

 Ba,b

 =

n 

−p p

xi

i=1

Fa (x) dx



b1

bn−1

···

a1



×

an−1 bn

−p

(x1 x2 · · · xn−1 )−p


xn
 x1

···

xn an

···



an

xn−1

a1

 p  f (s1 , . . . , sn−1 , sn ) dsn−1 · · · ds1 dsn dxn dxn−1 · · · dx1 .

an−1

(2.7.28)

192

Chapter 2. Inequalities Related to Hardy’s Inequality

By keeping x1 , . . . , xn−1 fixed and integrating by parts, and using the fact that p > 1 and Hölder’s inequality with indices p, p/(p − 1), we see that 

bn

−p xn



xn
 x1

an −p+1

bn −p + 1

a1

p + p−1

an

−p+1 xn

bn

p p−1



x1

xn−1

an

xn


an



···

bn

−p



···

xn
 x1 a1

f (s1 , . . . , sn−1 , sn )  p−1 × dsn−1 · · · ds1 dsn 

f (s1 , . . . , sn−1 , xn ) dsn−1 · · · ds1 dxn

···

an

xn−1

an−1

an−1

xn an



x1

xn−1

 p−1 × dsn−1 · · · ds1 dsn

 f (s1 , . . . , sn−1 , xn ) dsn−1 · · · ds1 dxn

a1



x1

a1

an−1

an−1



xn

×

xn−1

f (s1 , . . . , sn−1 , sn )

a1

···

−p+1



···

a1





xn−1

f (s1 , . . . , sn−1 , sn ) an−1



p

× dsn−1 · · · ds1 dsn  ×

bn  x1



···

an

dxn

 p−1 f (s1 , . . . , sn−1 , sn ) dsn−1 · · · ds1 dsn

xn
 x1

an





xn−1

an−1



an



p p−1



a1

bn

× 

f (s1 , . . . , sn−1 , sn ) dsn−1 · · · ds1 dsn

···



p

an−1

bn
 x1





xn−1

···

an

=



a1

xn−1

(p−1)/p dxn

p f (s1 , . . . , sn−1 , xn ) dsn−1 · · · ds1

1/p dxn

.

an−1

(2.7.29) Dividing both sides of (2.7.29) by the first integral factor on the right-hand side of (2.7.29), and raising both sides to the pth power, we get 

bn

−p



xn
 x1

···

xn an

an

a1



xn−1

an−1

 p f (s1 , . . . , sn−1 , sn ) dsn−1 · · · ds1 dsn dxn

193

2.7. Multidimensional Hardy-Type Inequalities




bn  x1

p 

p p−1



···

an

a1

xn−1

p f (s1 , . . . , sn−1 , xn ) dsn−1 · · · ds1

dxn .

an−1

(2.7.30) Substituting (2.7.30) in (2.7.28) and using Fubini’s theorem we have 

 Ba,b

n 

−p p

xi

Fa (x) dx

i=1

p  b1  bn−1 p  ··· (x1 x2 · · · xn−1 )−p p−1 a1 an−1 p   bn  x1  xn−1 × ··· f (s1 , . . . , sn−1 , xn ) dsn−1 · · · ds1 dxn


an

a1

p 


=

an−1

b1 p ··· p−1 a1   bn−1 −p × xn−1 an−1



···

× dxn−1 · · · dx1  bn−2 bn (x1 x2 · · · xn−2 )−p



an−2

···

an−1

xn−2

an

xn−1  x1 a1



p

f (s1 , . . . , sn−2 , sn−1 , xn ) dsn−2 · · · ds1 dsn−1

 dxn−1

an−2

× dxn dxn−2 · · · dx1 .

(2.7.31)

Now, by following exactly the same arguments as above, we obtain 

bn−1 an−1

−p



xn−1

xn−1
 x1

···

an−1



···


p p−1

p 

a1 xn−2

 p f (s1 , . . . , sn−2 , sn−1 , xn ) dsn−2 · · · ds1 dsn−1 dxn−1

an−2

xn−1  x1

···

an−1

···

a1



xn−2

p f (s1 , . . . , sn−2 , xn−1 , xn ) dsn−2 · · · ds1

dxn−1 .

an−2

(2.7.32)

194

Chapter 2. Inequalities Related to Hardy’s Inequality

Substituting (2.7.32) in (2.7.31) we have 

 Ba,b

n 

−p p

xi

Fa (x) dx

i=1

2p p  p−1  b1  bn−2  × ···


a1

 ×

an−2

bn

bn−1  x1



···

an−1

(x1 · · · xn−2 )−p

an

a1

xn−2

p f (s1 , . . . , sn−2 , xn−1 , xn ) dsn−2 · · · ds1

 dxn−1

an−2

× dxn dxn−2 · · · dx1 .

(2.7.33)

Continuing in this way we finally get 

 Ba,b

n 

−p


p Fa (x) dx

xi



i=1

p p−1

np  f p (x) dx.

(2.7.34)

Ba,b

Let c = (c1 , . . . , cn ) ∈ B and a < c < b. Then, from (2.7.34), we have 



Bc,b

n 

−p


p

Fa (x) dx 

xi

i=1

p p−1

np  f p (x) dx.

(2.7.35)

B

Letting a → 0, that is, ai → 0 on the left-hand side of (2.7.35) we have  Bc,b



n 

−p xi

i=1


F p (x) dx 

p p−1

np  f p (x) dx.

(2.7.36)

B

Since this inequality holds for arbitrary 0 < c < b, it follows that −p np 
  n p xi F p (x) dx  f p (x) dx. p − 1 B B

(2.7.37)

i=1

The proof is complete.



The following theorem established by Pachpatte [293] is a multivariate version of a slight variant of Levinson’s inequality given in [190, Theorem 1].

195

2.7. Multidimensional Hardy-Type Inequalities

T HEOREM 2.7.5. Let φ(u)
0 be defined on an open interval, finite or infinite, and at the ends of the intervals, let φ take its limiting values, finite or infinite. For some p > 1, let φ 1/p (u) be convex. If, for x ∈ B, the range of values of f (x) lies in the closed interval of definition of φ and φ(f (x)) is integrable on B and if F (x) is as defined in Theorem 2.7.4, then  −1 np 
   n   p φ xi F (x) dx  φ f (x) dx. (2.7.38) p − 1 B B i=1

Equality holds in (2.7.38) if φ(f (x)) ≡ 0. P ROOF. Let ψ(u) = {φ(u)}1/p
0. Then ψ(u) is convex. By Jensen’s inequality (see [174, p. 133]), we have  n −1   n −1      ψ xi F (x)  xi ψ f (y) dy. (2.7.39) i=1

B0,x

i=1

Applying (2.7.26) with f (x) replaced by ψ(f (x)) we have −1  p np 
   n   p   p ψ f (x) xi ψ f (y) dy  dx. p−1 B B0,x B i=1 (2.7.40) Using φ = ψ p and (2.7.39) we have  n −1    n −1     φ xi F (x) = ψ xi i=1

 

−1 

  ψ f (y) dy

xi

From (2.7.41) and (2.7.40), we observe that  −1 −1        n n φ xi F (x) dx  xi B

i=1



=

p

.

(2.7.41)

B0,x

i=1

B

f (y) dy

B0,x

i=1 n 

p

B0,x

i=1

p p−1 p p−1

  ψ f (y) dy

np 

  p ψ f (x) dx

B

np 

B

  φ f (x) dx.

p

dx

196

Chapter 2. Inequalities Related to Hardy’s Inequality



The proof is complete.

R EMARK 2.7.2. We note that in [33, p. 465] Boas and Imoru have obtained a two-dimensional version of Hardy’s inequality in Theorem 2.4.1 by using different analysis. Here the approach to obtain a multivariate version of a slight variant of Hardy’s inequality is more direct and quite elementary. In [341] Pachpatte has established the following multivariate variants of Hardy’s inequality. T HEOREM 2.7.6. Let p > 1 be a constant and f (x) be a nonnegative and integrable function on B1,a . If  F (x) = f (y) dy, x ∈ B1,a , (2.7.42) Bx,a

then 



B1,a

n 

 xi−1



 F (x) dx  p p

np B1,a

i=1

n  i=1

 xi−1

n 



p

xi log xi f (x)

dx.

i=1

(2.7.43) P ROOF. If f is null, inequality (2.7.43) is trivially true. We assume that f is not null. Denote by I the integral on the left-hand side of (2.7.43). By Fubini’s theorem [3, p. 18] we observe that   a1  an−1   n −1 I= ··· xi (2.7.44) In dxn−1 · · · dx1 , 1

1

i=1

where  In = 1

an

xn−1




···

 ···

an
 a1 xn

an−1

x1

 p f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn dxn .

(2.7.45)

xn−1

By keeping x1 , . . . , xn−1 fixed in (2.7.45) and integrating by parts, we have
 an
 a1 ··· In = (log xn ) xn

x1

197

2.7. Multidimensional Hardy-Type Inequalities

  −

 p an f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn

an−1

···

xn−1



an


···

(log xn )p xn

1



···
 × −

1

an
 a1

a1

an−1

xn−1



an−1

···

x1

x1



p−1 f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn   f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1 dyn dxn .

xn−1

(2.7.46) From (2.7.46) we observe that  an (p−1)/p xn In = p (log xn ) 1 
 a1  an−1 × ··· f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1 ×

x1

xn−1

−(p−1)/p xn

 ···



an
 a1

···

xn

an−1

x1



p−1 f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn dxn .

xn−1

(2.7.47)

Now, applying Hölder’s inequality with indices p, p/(p − 1) on the right-hand side of (2.7.47), we obtain  an

 a1 (p−1)/p xn In  p (log xn ) ··· 1

···



x1 an−1

f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1

xn−1

p

1/p dxn

(p−1)/p

In

.

(2.7.48)

Dividing both sides of (2.7.48) by the second factor on the right-hand side of (2.7.48), and then raising both sides to the pth power, we obtain  an p−1 p xn (log xn )p In  p 1 p
 a1  an−1 × ··· f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1 dxn . x1

xn−1

(2.7.49)

198

Chapter 2. Inequalities Related to Hardy’s Inequality

Substituting (2.7.49) in (2.7.44) and using Fubini’s theorem we observe that  I p



a1

an−2

···

p 1

 n−2 

1

xi−1



an

p−1

xn

(log xn )p In−1 dxn dxn−2 · · · dx1 ,

1

i=1

(2.7.50)

where 




an−1

In−1 =

−1 xn−1

1

an−1
 a1

···

xn−1



an−2

···

x1



p

f (y1 , . . . , yn−2 , yn−1 , xn ) dyn−2 · · · dy1 dyn−1

dxn−1 .

xn−2

(2.7.51) Now, by following exactly the same arguments as above with suitable modifications, we obtain 

an−1

In−1  p p 1




p−1

 ···

an−2

a1

···

xn−1 (log xn−1 )p

x1

p

f (y1 , . . . , yn−2 , xn−1 , xn ) dyn−2 · · · dy1

dxn−1 .

xn−2

(2.7.52) Substituting (2.7.52) in (5.7.50) and again using Fubini’s theorem we have 

a1  an−3

I  p 2p 1

 ×

1

an−1

1

 n−3 

 xi−1

i=1 p−1



xn−1 (log xn−1 )p

an

p−1

xn

(log xn )p In−2 dxn dxn−1 dxn−3 · · · dx1 ,

1

where  In−2 =

an−2

1

···



−1 xn−2

an−2
 a1

···

xn−2

x1

 p f (y1 , . . . , yn−3 , yn−2 , xn−1 , xn ) dyn−3 · · · dy1 dyn−2 dxn−2 .

an−3

xn−3




199

2.7. Multidimensional Hardy-Type Inequalities

Continuing in this way we finally get 

 I p

np B1,a



n 

xi−1

i=1

n 



p

xi log xi f (x)

dx.

i=1

This is the required inequality in (2.7.43) and the proof is complete.



T HEOREM 2.7.7. Let p > 1 be a constant and f (x) be a nonnegative and integrable function on B0,1 . If  F (x) =

f (y) dy,

x ∈ B0,1 ,

(2.7.53)

B0,x

then 

 B0,1

n 

 xi−1

i=1

 p

np B0,1

F p (x) dx



n 

 xi−1

i=1

n 



p

xi | log xi | f (x)

dx.

(2.7.54)

i=1

The proof of this theorem follows by the same arguments as in the proof of Theorem 2.7.6 given above with suitable modifications. We omit the details. R EMARK 2.7.3. In the special case when n = 1, the inequalities established in Theorems 2.7.6 and 2.7.7 reduce respectively to inequalities (1a) and (2a) given by Chan in [52] in Theorems 1 and 2, respectively. In [52] the results are obtained by using the method of Banson [25]. Here our proofs are more direct and elementary. In [333] Pachpatte establishes the following Hardy-type inequalities involving functions of several variables. T HEOREM 2.7.8. Let p > 1 be a constant. Let f (x) be a nonnegative and integrable function on B and let ri (xi ), i = 1, . . . , n, be positive and absolutely continuous functions on (0, ∞) and let  Ri (xi ) =

xi

ri (yi ) dyi 0

(2.7.55)

200

Chapter 2. Inequalities Related to Hardy’s Inequality

exist. Let

 Ri (xi )ri
(xi ) 1 1 1+
2 p−1 α ri (xi ) i


(2.7.56)

for all xi > 0 and for some positive constants αi , i = 1, . . . , n. If F (x) is defined by    n 1 F (x) = #n ri (yi )f (y) dy (2.7.57) i=1 Ri (xi ) B0,x i=1

for x ∈ B, then 

  n
 pαi p F (x) dx  f p (x) dx. p − 1 B B p

(2.7.58)

i=1

Equality holds in (2.7.58) if f (x) ≡ 0. T HEOREM 2.7.9. Let p and f be as in Theorem 2.7.8. Let ri (xi ), i = 1, . . . , n, be positive, continuous and monotone nondecreasing functions on (0, ∞). If Ri (xi ) and F (x) be as defined in (2.7.55) and (2.7.57), respectively, where ri (xi ) are as defined above, then np 
 p p F (x) dx  f p (x) dx. (2.7.59) p−1 B B Equality holds in (2.7.59) if f (x) ≡ 0. T HEOREM 2.7.10. Let p, f , ri , i = 1, . . . , n, be as defined in Theorem 2.7.8. Let 

xi ri (xi ) 1 p
1+ (2.7.60) p − 1 ri (xi ) βi for all xi > 0 and for some positive constants βi , i = 1, . . . , n. If G(x) is defined by    n 1 G(x) = #n ri (yi ) f (y) dy (2.7.61) i=1 xi ri (xi ) B0,x i=1

for x ∈ B, then  Gp (x) dx  B

  n
 pβi p f p (x) dx. p−1 B i=1

(2.7.62)

2.7. Multidimensional Hardy-Type Inequalities

201

Equality holds in (2.7.62) if f (x) ≡ 0. T HEOREM 2.7.11. Let p, f , ri , i = 1, . . . , n, be as defined in Theorem 2.7.8. Let 

xi ri (xi ) p 1 1− (2.7.63)
p − 1 ri (xi ) γi for all xi > 0 and for some positive constants γi , i = 1, . . . , n. If H (x) is defined by 
 n
 ri (xi ) 1 #n f (y) dy (2.7.64) H (x) = xi B0,x i=1 ri (yi ) i=1

for x ∈ B, then  H p (x) dx  B

  n
 pγi p f p (x) dx. p−1 B

(2.7.65)

i=1

Equality holds in (2.7.65) if f (x) ≡ 0. R EMARK 2.7.4. We note that (i) in the special cases when ri (xi ) = 1 and αi = 1 in (2.7.56) and n = 1, the inequalities established in Theorems 2.7.8 and 2.7.9 reduce to the slight variant of Hardy’s inequality given in Theorem 2.4.1, (ii) in the special case when n = 1, the inequalities established in Theorems 2.7.10 and 2.7.11 reduce to the inequalities established by Levinson in [190, Theorems 4 and 5]. T HEOREM 2.7.12. Let φ(u)
0 be defined on an open interval, finite or infinite, and at the ends of the interval, let φ take its limiting values, finite or infinite. For some p > 1, let φ 1/p (u) be convex. Let ri (xi ) and Ri (xi ) be as defined in Theorem 2.7.8 satisfying the condition (2.7.56). If, for x ∈ B, the range of values of f (x) lie in the closed interval of definition of φ and φ(f (x)) is integrable on B, and if F (x) is defined by (2.7.57), then   n
     pαi p φ F (x) dx  φ f (x) dx. p − 1 B B



(2.7.66)

i=1

Equality holds in (2.7.66) if φ(f (x)) ≡ 0. T HEOREM 2.7.13. Let φ, p, φ 1/p , f, φ(f ) be as defined in Theorem 2.7.12. Let ri (xi ) and Ri (xi ) be as defined in Theorem 2.7.9. If F (x) is defined as in

202

Chapter 2. Inequalities Related to Hardy’s Inequality

Theorem 2.7.9, then 

  φ F (x) dx 

B




p p−1

np 

  φ f (x) dx.

(2.7.67)

B

Equality holds in (2.7.67) if φ(f (x)) ≡ 0. R EMARK 2.7.5. The inequalities established in Theorems 2.7.12 and 2.7.13 can be considered as the multivariate versions of the inequalities given by Levinson in [190, Theorems 3 and 2]. However, our hypotheses on φ(u) differs slightly from those used by Levinson in [190]. Here the condition φ

(u)
0 used in [190, p. 389] is not needed and the condition 
1 
2 φ , φφ
1 − p



p > 1,

used in [190, p. 389] is replaced by φ 1/p being convex, since this fact is all required for the application of Jensen’s inequality in the proofs. P ROOFS OF T HEOREMS 2.7.8–2.7.13. Let a = (a1 , . . . , an ) ∈ B, b = (b1 , . . . , bn ) ∈ B, 0 = (0, . . . , 0) ∈ Rn be such that 0 < a < b < ∞, and define 1 Fa (x) = #n i=1 Ri (xi )



 Ba,x

n 

 ri (yi ) f (y) dy

(2.7.68)

i=1

for x ∈ B. From (2.7.68) and by Fubini’s theorem (see [3, p. 18]), we have 

p

Fa (x) dx Ba,b

=



b1



···

a1

bn−1

an−1

(

#n−1 i=1



×

1 Ri (xi ))p

bn

an

 ···

xn−1 an−1

 n−1 



−p Rn (xn )

xn

x1

···

rn (yn ) an





a1



p

ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn

 dxn

i=1

× dxn−1 · · · dx1 .

(2.7.69)

203

2.7. Multidimensional Hardy-Type Inequalities

By keeping x1 , . . . , xn−1 fixed and integrating by parts, we have  bn −p Rn (xn ) an





xn

×

an

 ···  =

x1

···

rn (yn )  n−1 

xn−1

an−1 bn

a1



p

ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn

dxn

i=1

−p

Rn (xn )rn (xn ) an



 ×

xn

1 rn (xn )  x1

···

rn (yn ) an

 ···

xn−1

 n−1 

an−1

a1





p

ri (yi ) f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1 dyn

dxn

i=1

  −p+1 bn x1 (bn ) 1 Rn = rn (yn ) ··· −p + 1 rn (bn ) an a1   p  xn−1  n−1  ··· ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn an−1

i=1

  bn xn x1 p −p+1 + Rn (xn ) rn (yn ) ··· p − 1 an an a1   p−1  xn−1  n−1  ··· ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn




an−1

 ×

i=1

x1

···

a1



xn−1 an−1

 n−1 





ri (yi ) f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1 dxn

i=1

    bn −p+1 xn x1 Rn (xn )rn
(xn ) 1 − rn (yn ) ··· 2 p − 1 an rn (xn ) an a1   p  xn−1  n−1  ··· ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn dxn .


an−1

i=1

(2.7.70)

204

Chapter 2. Inequalities Related to Hardy’s Inequality

Since p > 1, from (2.7.70) we observe that   

xn x1 1 Rn (xn )rn
(xn ) −p 1+ R (x ) r (y ) ··· n n n n p−1 rn2 (xn ) an a1   p  xn−1  n−1  ··· ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn dxn

bn



an




an−1




p p−1 

i=1



×



···

a1



p−1

ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn

xn−1

···

a1

x1

rn (yn )



i=1

x1



xn an

 n−1 

an−1





−p+1 Rn (xn )

an

xn−1

···

bn

an−1

 n−1 





ri (yi ) f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1 dxn .

i=1

(2.7.71) From (2.7.56) and applying Hölder’s inequality with indices p, p/(p − 1) on the right-hand side of (2.7.71), we obtain     bn  xn−1  n−1 xn x1  −p Rn (xn ) rn (yn ) ··· ri (yi ) an

an

a1

an−1

i=1



p

× f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn


pαn p−1

 

bn



−p Rn (xn )

an



xn

x1

···

rn (yn ) an

a1



xn−1

dxn

 n−1 

an−1



×

bn

an



x1

···

a1



xn−1

an−1

 n−1 

ri (yi )

i=1

p

× f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn 



(p−1)/p dxn

 ri (yi )

i=1

× f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1

p

1/p dxn

.

(2.7.72)

205

2.7. Multidimensional Hardy-Type Inequalities

Dividing both sides of (2.7.72) by the first integral factor on the right-hand side of (2.7.72) and then raising both sides to the pth power we obtain 

bn





xn

−p Rn (xn )

···

rn (yn )

an



x1

an

a1

xn−1

an−1

 n−1 

 ri (yi )

i=1



p

× f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn


pαn p−1

p 

bn





x1

···

an

a1

xn−1

 n−1 

an−1

dxn

 ri (yi )

i=1

p

× f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1

dxn . (2.7.73)

Substituting (2.7.73) in (2.7.69) and using Fubini’s theorem we have 

p

Fa (x) dx Ba,b




pαn p−1 

···



···

a1

xn−1

=

pαn p−1 

×

an−1

(



#n−1 i=1

1



Ri (xi ))p

bn



x1

···

an

a1

p

ri (yi ) f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1

 dxn

i=1

p 

bn−1

bn−1

an−1

 n−1 

an−1






b1

× dxn−1 · · · dx1  bn 1 ··· #n−2 an−2 an ( i=1 Ri (xi ))p  

b1

a1



bn−2

−p Rn−1 (xn−1 )

xn−1

x1

···

rn−1 (yn−1 ) an−1

a1



xn−2

an−2



 n−2 

ri (yi )

i=1

× f (y1 , . . . , yn−2 , yn−1 , xn ) dyn−2 · · · dy1 dyn−1 × dxn dxn−2 · · · dx1 .



p

 dxn−1 (2.7.74)

206

Chapter 2. Inequalities Related to Hardy’s Inequality

Now, by following exactly the same arguments as above, we obtain 

bn−1

−p

Rn−1 (xn−1 )

an−1

 ×



xn−1

x1



···

rn−1 (yn−1 ) an−1

a1

xn−2 an−2



 n−2 

ri (yi )

i=1



p

× f (y1 , . . . , yn−2 , yn−1 , xn ) dyn−2 · · · dy1 dyn−1


pαn−1 p−1

p 

bn−1

an−1



x1



···

a1

xn−2

 n−2 

an−2

dxn−1

 ri (yi )

i=1

p

× f (y1 , . . . , yn−2 , xn−1 , xn ) dyn−2 · · · dy1

dxn−1 . (2.7.75)

Substituting (2.7.75) in (2.7.74) we have 

p

Fa (x) dx Ba,b




 pαn p pαn−1 p p−1 p−1    b1  bn−2  bn bn−1  x1 1 × ··· ··· #n−2 a1 an−2 an ( i=1 Ri (xi ))p an−1 a1  p   xn−2  n−2  ··· ri (yi ) f (y1 , . . . , yn−2 , xn−1 , xn ) dyn−2 · · · dy1 dxn−1




an−2

i=1

× dxn dxn−2 · · · dx1 .

(2.7.76)

Continuing in this way we finally get 

p Fa (x) dx Ba,b

  n
 pαi p  f p (x) dx. p−1 Ba,b i=1

(2.7.77)

207

2.7. Multidimensional Hardy-Type Inequalities

Let c = (c1 , . . . , cn ) ∈ B and a < c < b. Then, from (2.7.77), we have 

p

Fa (x) dx  Bc,b

  n
 pαi p f p (x) dx. p−1 B

(2.7.78)

i=1

Letting a → 0, that is, ai → 0 on the left-hand side of (2.7.78) we have  F p (x) dx  Bc,b

  n
 pαi p f p (x) dx. p−1 B

(2.7.79)

i=1

Since this holds for arbitrary 0 < c < b, it follows that  F p (x) dx  B

  n
 pαi p f p (x) dx. p−1 B

(2.7.80)

i=1

The proof of Theorem 2.7.8 is complete. The proof of Theorem 2.7.9 proceeds in the same way as the proof of Theorem 2.7.8. By following the same arguments as in Theorem 2.7.8 we obtain (2.7.70).  Since ri (xi ) are monotone nondecreasing, from (2.7.70) we observe that (see [190, p. 391])  bn −p Rn (xn ) an





xn

×

···

an

a1

 ···

xn−1

 n−1 

an−1




p p−1 



x1

···

a1





−p+1 Rn (xn )

xn





dxn

x1

···

rn (yn ) an

a1



p−1

ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn

i=1



p

ri (yi ) f (y1 , . . . , yn−1 , yn ) dyn−1 · · · dy1 dyn

i=1

 n−1 

an−1



bn



an

xn−1

···

×

x1

rn (yn )

xn−1

an−1

 n−1  i=1





ri (yi ) f (y1 , . . . , yn−1 , xn ) dyn−1 · · · dy1 dxn .

208

Chapter 2. Inequalities Related to Hardy’s Inequality

The rest of the proof of Theorem 2.7.9 follows the same steps as in the proof of Theorem 2.7.8 below inequality (2.7.71) with suitable changes and hence we omit the further details. The proofs of Theorems 2.7.10 and 2.7.11 can be completed by following the similar arguments as in the proof of Theorem 2.7.8 (see also [190, p. 393]) with suitable modifications. We leave the details to the reader. Let ψ(u) = (φ(u))1/p
0. Then ψ(u) is convex. By repeated application of Jensen’s inequality (see [174, p. 133]), we have   1 ψ F (x)  #n i=1 Ri (xi )



n 

  ri (yi )ψ f (y) dy

(2.7.81)

B0,x i=1

for x ∈ B. Applying (2.7.58) to ψ(f (x)) instead of f (x) we have  p     n   1 #n ri (yi ) ψ f (y) dy dx B i=1 Ri (xi ) B0,x i=1



n
 i=1

pαi p−1

p 

  p ψ f (x) dx.

(2.7.82)

B

Using φ(u) = ψ p (u) and (2.7.81) we have     p φ F (x) = ψ F (x)   p   n   1  #n ri (yi ) ψ f (y) dy . (2.7.83) i=1 Ri (xi ) B0,x i=1

From (2.7.83) and (2.7.82), we observe that  p      n     1 #n φ F (x) dx  ri (yi ) ψ f (y) dy dx B B i=1 Ri (xi ) B0,x i=1

  n
 p pαi p    ψ f (x) dx p−1 B i=1

=

  n
   pαi p φ f (x) dx. p−1 B i=1

The proof of Theorem 2.7.12 is complete.

209

2.8. Inequalities Similar to Hilbert’s Inequality

The proof of Theorem 2.7.13 proceeds in the same way as in the proof of Theorem 2.7.12 with suitable changes and hence we omit the details.  R EMARK 2.7.6. The multidimensional variants of Hardy’s inequality are recently given by other investigators by using different techniques. Here we note that the above results are established by using elementary analysis and the inequalities obtained in Theorems 2.7.8–2.7.13 are of independent interest.

2.8 Inequalities Similar to Hilbert’s Inequality The well-known inequality due to Hilbert and its integral analogue can be stated as follows (see [141, p. 226]). T HEOREM A. If p > 1, p
= p/(p − 1) and tions running from 1 to ∞, then



p

am  A,



p


bn  B, the summa-

  am bn π
< A1/p B 1/p , m + n sin(π/p) unless the sequence {am } or {bn } is null.

∞

∞
T HEOREM B. If p > 1, p
= p/(p − 1) and 0 f p (x) dx  F , 0 g p (y) × dy  G, then  ∞ ∞ π f (x)g(y)
dx dy < F 1/p G1/p , x + y sin(π/p) 0 0 unless f ≡ 0 or g ≡ 0. The inequalities in Theorems A and B were studied extensively and numerous variants, generalizations and extensions appear in the literature, see [141,210,213, 424] and the references cited therein. Recently in a series of papers [334,335,342, 343,350,352,353] Pachpatte has established a number of new inequalities similar to the inequalities given in Theorems A and B. In this section we present some of these results. In [334] Pachpatte has given the following inequality similar to that of Hilbert’s inequality in Theorem A. T HEOREM 2.8.1. Let p
1, q
1 be constants and {am } and {bn } be two nonnegative sequences of real numbers defined for m = 1, 2, . . . , k and n = 1, 2, . . . , r, where k, r are natural numbers and define Am = m s=1 as and

210 Bn =

Chapter 2. Inequalities Related to Hardy’s Inequality

n

t=1 bt .

Then 

k  r p q  Am Bn m=1 n=1

 C(p, q, k, r)

m+n

 ×

k 

 p−1 2 (k − m + 1) Am am

m=1 r   q−1 2 (r − n + 1) Bn bn

1/2

1/2 ,

(2.8.1)

n=1

unless {am } or {bn } is null, where 1 √ C(p, q, k, r) = pq kr. 2

(2.8.2)

P ROOF. By using the following inequality (see [78,226]) α  m α−1  n n    zm  α zm zk , m=1

m=1

k=1

where α
1 is a constant and zm
0, m = 1, 2, . . . , it is easy to observe that p

Am  p

m 

p−1

,

m = 1, 2, . . . , k,

(2.8.3)

,

n = 1, 2, . . . , r.

(2.8.4)

as As

s=1 q

Bn  q

n 

q−1

bt Bt

t=1

From (2.8.3), (2.8.4) and using the Schwarz inequality and the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals), we observe that  m  n    p q p−1 q−1 Am Bn  pq as As bt Bt s=1

 pq(m)

1/2



t=1 m   p−1 2 as As

1/2

s=1



m   1 p−1 2 as As  pq(m + n) 2 s=1

 1/2

(n)

1/2 

n   q−1 2 bt Bt t=1

n   q−1 2 bt Bt

1/2

1/2 . (2.8.5)

t=1

Dividing both sides of (2.8.5) by m + n and then taking the sum over n from 1 to r, first, and then the sum over n from 1 to k, and using the Schwarz inequality

211

2.8. Inequalities Similar to Hilbert’s Inequality

and then interchanging the order of the summations (see [226,326]) we observe that k  r p q  Am Bn m=1 n=1

m+n

 k  m 1/2  r  n 1/2     1 p−1 2 q−1 2  pq as As bt Bt 2 m=1

s=1





k m    1 p−1 2  pq(k)1/2 as As 2 m=1



s=1



k k   √  p−1 2 as As = pq kr 1



1/2

(r) 1/2 

 n r   n=1

q−1 2 bt Bt



1/2

t=1

 r  r    q−1 2 bt Bt 1

1/2

n=t

t=1

k   p−1 2 as As (k − s − 1) s=1

1/2  q−1 2 bt Bt (r − t + 1) 

k 

= C(p, q, k, r)

×



1/2

r  t=1



t=1

1/2

= C(p, q, k, r)

×



n=1

m=s

s=1





 p−1 2 (k − m + 1) am Am

m=1 r 

 q−1 2 (r − n + 1) bn Bn

1/2

1/2 .

n=1



The proof is complete.

R EMARK 2.8.1. If we take p = q = 1 in Theorem 2.8.1, then inequality (2.8.1) reduces to the following inequality k  r  Am Bn m=1 n=1

m+n 

 C(1, 1, k, r)

k 

1/2  (k − m + 1)(am )

m=1

2

r  (r − n + 1)(bn )2

1/2 ,

n=1

(2.8.6)

212

Chapter 2. Inequalities Related to Hardy’s Inequality

where C(1, 1, k, r) is obtained by taking p = q = 1 in (2.8.2). The next result established by Pachpatte in [334] deals with the further generalization of the inequality obtained in (2.8.6). T HEOREM 2.8.2. Let {am }, {bn }, Am , Bn be as in Theorem 2.8.1. Let {pm } and {qn } be two positive sequences for m = 1, 2, . . . k and n = 1, 2, . . . , r, and n define Pm = m s=1 ps and Qn = t=1 qt . Let φ and ψ be two real-valued, nonnegative, convex and submultiplicative functions defined on R+ = [0, ∞). Then k  r  φ(Am )ψ(Bn ) m=1 n=1

m+n



k 

 M(k, r)  ×


 2 1/2 am (k − m + 1) pm φ pm

m=1


 2 1/2 r  bn (r − n + 1) qn ψ , qn

(2.8.7)

n=1

where 1 M(k, r) = 2



k  φ(Pm ) 2

1/2 

Pm

m=1

1/2 r  ψ(Qn ) 2 Qn

n=1

.

(2.8.8)

P ROOF. From the hypotheses and by using Jensen’s inequality and Schwarz inequality (see [211]), it is easy to observe that  φ(Am ) = φ Pm

 m m  ps a s  ps

s=1



 φ(Pm )φ

 ps

s=1

 m m  ps a s  s=1

ps

 ps

s=1


 m φ(Pm )  as  ps φ Pm ps s=1

 m
 2  φ(Pm ) as 1/2  ps φ (m) Pm ps s=1

1/2

(2.8.9)

213

2.8. Inequalities Similar to Hilbert’s Inequality

and similarly,  n
 2 ψ(Qn ) 1/2  bt qt ψ (n) ψ(Bn )  Qn qt

1/2

.

(2.8.10)

t=1

From (2.8.9) and (2.8.10) and using the elementary inequality c1/2 d 1/2  (c + d)/2 (c, d nonnegative reals), we observe that  m 
 2 1/2  φ(Pm )  1 as ps φ φ(Am )ψ(Bn )  (m + n) 2 Pm ps 

ψ(Qn ) × Qn



s=1

n  t=1




bt qt ψ qt

 2

1/2 

.

(2.8.11)

Dividing both sides of (2.8.11) by m + n and then taking the sum over n from 1 to r, first, and then the sum over m from 1 to k, and using the Schwarz inequality and then interchanging the order of the summations we observe that k  r  φ(Am )ψ(Bn )

m+n

m=1 n=1

 m  k 
 2 1  φ(Pm )  as ps φ  2 Pm ps m=1

 ×



1 2



s=1

  n r  ψ(Qn )  Qn

n=1

bt qt ψ qt

 2

1/2 

 m

1/2  
 2 1/2 k k   φ(Pm ) 2 as ps φ Pm ps

m=1

 ×

m=1

r  n=1





ψ(Qn ) Qn

s=1 r  t=1

s=1

 n

2 1/2   r  n=1

t=1




bt qt ψ qt

  k 1/2 as 2  ps φ 1 ps m=s

k 

= M(k, r)

×

t=1




1/2 




bt qt ψ qt




1/2  2   r 1 n=t

 2 1/2

214

Chapter 2. Inequalities Related to Hardy’s Inequality



1/2
 2 k  as ps φ = M(k, r) (k − s + 1) ps  ×

s=1

1/2
 2 r  bt (r − t + 1) qt ψ qt t=1



= M(k, r)  ×

k 

 1/2
am 2 (k − m + 1) pm φ pm

m=1


 2 1/2 r  bn (r − n + 1) qn ψ . qn n=1



The proof is complete.

R EMARK 2.8.2. By applying the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals) on the right-hand sides of (2.8.1) and (2.8.7), we get respectively the following inequalities  k   p−1 2 1  C(p, q, k, r) (k − m + 1) Am am m+n 2

k  r p q  Am Bn m=1 n=1

m=1

r   q−1 2 + (r − n + 1) Bn bn



n=1

(2.8.12) and k  r  φ(Am )ψ(Bn ) m=1 n=1

m+n

 k
 2  1 am  M(k, r) (k − m + 1) pm φ 2 pm m=1


 2  r  bn + (r − n + 1) qn ψ . qn n=1

(2.8.13) The following two theorems established by Pachpatte in [334] deal with slight variants of the inequality given in Theorem 2.8.2.

215

2.8. Inequalities Similar to Hilbert’s Inequality

2.8.3. Let {a T HEOREM m } and {bn } be as in Theorem 2.8.1, and define Am = n 1 m 1 a and B = n s=1 s t=1 bt , for m = 1, 2, . . . , k and n = 1, 2, . . . , r, where m n k, r are natural numbers. Let φ and ψ be two real-valued, nonnegative and convex functions defined on R+ . Then  k 1/2 k  r    2 mn φ(Am )ψ(Bn )  C(1, 1, k, r) (k − m + 1) φ(am ) m+n

m=1 n=1

 ×

m=1

r   2 (r − n + 1) ψ(bn )

1/2 ,

(2.8.14)

n=1

where C(1, 1, k, r) is defined by taking p = q = 1 in (2.8.2). P ROOF. From the hypotheses and by using Jensen’s inequality and Schwarz inequality, it is easy to observe that 

1 φ(Am ) = φ as m m



s=1

m 1  φ(as ) m s=1

 m  2 1 1/2 φ(as )  (m) m

1/2

(2.8.15)

s=1

and similarly,  n 2 1 1/2  ψ(bt ) ψ(Bn )  (n) n

1/2

.

(2.8.16)

t=1

The rest of the proof can be completed by following the same steps as in the proof of Theorems 2.8.1 and 2.8.2 with suitable changes, and hence we omit the details.  T HEOREM 2.8.4. Let {am }, {bn }, {pm }, {qn }, Pm , Qn be as in Theorem 2.8.2 1 n and define Am = P1m m s=1 ps as and Bn = Qn t=1 qt bt for m = 1, 2, . . . , k and n = 1, 2, . . . , r, where k, r are the natural numbers. Let φ and ψ be as in Theo-

216

Chapter 2. Inequalities Related to Hardy’s Inequality

rem 2.8.3. Then k  r 

Pm Qn

m=1 n=1

φ(Am )ψ(Bn ) m+n 

 C(1, 1, k, r)  ×

k 

 2 (k − m + 1) pm φ(am )

m=1 r 

 2 (r − n + 1) qn ψ(bn )

1/2

1/2 ,

(2.8.17)

n=1

where C(1, 1, k, r) is defined by taking p = q = 1 in (2.8.2). P ROOF. From the hypotheses and using Jensen’s inequality and Schwarz inequality, it is easy to observe that  φ(Am ) = φ

m 1  ps a s Pm



s=1



1 Pm

m 

ps φ(as )

s=1

 m  2 1 ps φ(as )  (m)1/2 Pm

1/2

(2.8.18)

s=1

and similarly,  n  2 1 1/2 ψ(Bn )  qt ψ(bt ) (n) Qn

1/2

.

(2.8.19)

t=1

Proceeding as in the proofs of Theorems 2.8.1 and 2.8.2 given above with suitable modifications we get the required inequality in (2.8.17).  In [350] Pachpatte has established the following theorem. T HEOREM 2.8.5. Let {am } and {bn } be two nonnegative sequences of real numbers defined for m = 0, 1, 2, . . . , k and n = 0, 1, 2, . . . , r and a0 = b0 = 0, where

217

2.8. Inequalities Similar to Hilbert’s Inequality

k, r are natural numbers. Then k  r  am bn m+n

m=1 n=1

√

kr  2



k 

1/2 

r  (r − n + 1)(∇bn )2

(k − m + 1)(∇am )2

m=1

1/2 ,

n=1

(2.8.20) where ∇am = am − am−1 and ∇bn = bn − bn−1 . P ROOF. From the hypotheses, it is easy to observe that the following identities hold am =

m 

∇as ,

m = 1, 2, . . . , k,

(2.8.21)

n = 1, 2, . . . , r.

(2.8.22)

s=1

and bn =

n 

∇bt ,

t=1

From (2.8.21) and (2.8.22) and using Schwarz inequality and the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals), we observe that  am bn =

m 

 ∇as

s=1

 (m)

1/2



n 

 ∇bt

t=1 m  (∇as )2 s=1

1/2

 1/2

(n)

n 

1/2 2

(∇bt )

t=1

 m 1/2  n 1/2   1 2 2  (m + n) (∇as ) (∇bt ) . 2 s=1

t=1

Rewriting the above inequality and taking the sum over n from 1 to r, first, and then the sum over m of the resulting inequality from 1 to k and using Schwarz

218

Chapter 2. Inequalities Related to Hardy’s Inequality

inequality and then interchanging the order of the summations we observe that k  r  am bn m+n

m=1 n=1

 m 1/2 r  n 1/2 k   1   (∇as )2 (∇bt )2 2 m=1

s=1



n=1



k m   1  (k)1/2 (∇as )2 2



m=1

s=1



k k   1√ = kr (∇as )2 1 2 m=s



t=1

1/2 (r) 1/2 

s=1

 n 1/2 r   2 (∇bt ) n=1

1/2

n=t

t=1

s=1

t=1



r r   (∇bt )2 1

1/2 

k  1√ = kr (∇as )2 (k − s + 1) 2



 1/2

1/2 r  2 (∇bt ) (r − t + 1) t=1

k  1√ = kr (k − m + 1)(∇am )2 2 m=1

1/2 

r  (r − n + 1)(∇bn )2

1/2 .

n=1



The proof is complete.

The next theorem deals with the further generalization of Theorem 2.8.5 and is established by Pachpatte in [335]. T HEOREM 2.8.6. Let {am } and {bn } be two nonnegative sequences of real numbers defined for m = 1, 2, . . . , k and n = 1, 2, . . . , r with a0 = b0 = 0 and let {pm } and {qn } be two positive sequences of real numbers defined for m = 1, 2, . . . , k and n = 1, 2, . . . , r, where k, r are natural numbers, and define n Pm = m s=1 ps and Qn = t=1 qt . Let φ and ψ be two real-valued nonnegative, convex and submultiplicative functions defined on R+ = [0, ∞). Then k  r  φ(am )ψ(bn ) m=1 n=1

m+n

  M(k, r)  ×

k 

 1/2
∇am 2 (k − m + 1) pm φ pm

m=1

 1/2
∇bn 2 (r − n + 1) qn ψ , qn

r  n=1

(2.8.23)

219

2.8. Inequalities Similar to Hilbert’s Inequality

where 1 M(k, r) = 2



k  φ(Pm ) 2 m=1

1/2 

Pm

1/2 r  ψ(Qn ) 2 n=1

Qn

(2.8.24)

and ∇am = am − am−1 , ∇bn = bn − bn−1 . P ROOF. From the hypotheses, it is easy to observe that the following identities hold am =

m 

∇as ,

m = 1, 2, . . . , k,

(2.8.25)

∇bt ,

n = 1, 2, . . . , r.

(2.8.26)

s=1

bn =

n  t=1

From (2.8.25) and (2.8.26) and using Jensen’s inequality (see [211]), we observe that    m m  ∇as  ps ps φ(am ) = φ Pm ps s=1 s=1  m  m  ∇as    φ(Pm )φ ps ps ps s=1

s=1

 m  ∇as  Pm  φ(Pm ) ps φ ps


(2.8.27)

s=1

and similarly, ψ(bn )  ψ(Qn )

n  t=1

 ∇bt  Qn . qt ψ qt


(2.8.28)

The rest of the proof can be completed by following the same arguments as in the proof of Theorem 2.8.2 with suitable modifications and here we omit the further details.  R EMARK 2.8.3. If we apply the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals) on the right-hand sides of (2.8.20) and (2.8.23) then we

220

Chapter 2. Inequalities Related to Hardy’s Inequality

get respectively the following inequalities k  r  am bn m+n

m=1 n=1

 k  r   1√ 2 2  kr (k − m + 1)(∇am ) + (r − n + 1)(∇bn ) 4 m=1

(2.8.29)

n=1

and k  r  φ(am )ψ(bn )

m+n

m=1 n=1

 k
  ∇am 2 1  M(k, r) (k − m + 1) pm φ 2 pm m=1

 
r  ∇bn 2 + (r − n + 1) qn ψ . qn

(2.8.30)

n=1

In [353] Pachpatte has established the following inequality similar to that of the extension of Hilbert’s inequality given in [141, p. 253]. T HEOREM 2.8.7. Let p > 1, q > 1 be constants and p1 + q1 = 1. Let {am } and {bn } be two sequences of real numbers defined for m = 1, 2, . . . , k and n = 1, 2, . . . , r, where k, r are natural numbers with a0 = b0 = 0. Then k  r  m=1 n=1

|am ||bn | qmp−1 + pnq−1 

 M(p, q, k, r)

k 

1/p  (k − m + 1)|∇am |p

m=1

r  (r − n + 1)|∇bn |q

1/q ,

n=1

(2.8.31) where M(p, q, k, r) =

1 (p−1)/p (q−1)/q k r pq

and ∇am = am − am−1 , ∇bn = bn − bn−1 .

(2.8.32)

221

2.8. Inequalities Similar to Hilbert’s Inequality

P ROOF. From the hypotheses, it is easy to observe that the following identities hold: am =

m 

∇as ,

(2.8.33)

∇bt ,

(2.8.34)

s=1

bn =

n  t=1

for m = 1, 2, . . . , k, n = 1, 2, . . . , r. From (2.8.33) and (2.8,34) and using Hölder’s inequality with indices p, p/(p − 1) and q, q/(q − 1), respectively, we have  m 1/p  (p−1)/p p |am |  (m) |∇as | , (2.8.35)  |bn |  (n)

(q−1)/q

s=1 n 

1/q

|∇bt |

q

,

(2.8.36)

t=1

for m = 1, 2, . . . , k, n = 1, 2, . . . , r. From (2.8.35), (2.8.36) and using the elementary inequality p

z1 z2 

q

z z1 + 2, p q

z1
0, z2
0,

1 1 + = 1, p > 1, p q

(2.8.37)

we observe that  |am ||bn |  (m)

(p−1)/p

(q−1)/q

(n)



mp−1 nq−1 +  p q

  m

m 

1/p  |∇as |

p

s=1

1/p 

|∇as |

p

s=1

n 

1/q |∇bt |

q

t=1 n 

1/q

|∇bt |

q

(2.8.38)

t=1

for m = 1, 2, . . . , k, n = 1, 2, . . . , r. From (2.8.38) we observe that |am ||bn | 1  p−1 q−1 pq qm + pn



m  s=1

1/p  |∇as |

p

n 

1/q |∇bt |

q

(2.8.39)

t=1

for m = 1, 2, . . . , k, n = 1, 2, . . . , r. Taking the sum on both sides of (2.8.39) first over n from 1 to r and then the sum over m from 1 to k of the resulting inequality

222

Chapter 2. Inequalities Related to Hardy’s Inequality

and using Hölder’s inequality with indices p, p/(p − 1) and q, q/(q − 1) and interchanging the order of summations we observe that k  r  m=1 n=1

|am ||bn | qmp−1 + pnq−1

1/p  r  n 1/q  k  m   1    |∇as |p |∇bt |q pq m=1

s=1



n=1



k m   1  (k)(p−1)/p |∇as |p pq

 = M(p, q, k, r)

m=1

k 



t=1

1/p (q−1)/q

(r)

s=1

1/p 

(k − m + 1)|∇am |p

m=1

 r  n   n=1



1/q

|∇bt |

q

t=1

r  (r − n + 1)|∇bn |q

1/q .

n=1



The proof is complete.

The following two independent variable version of the inequality given in Theorem 2.8.7 is also established by Pachpatte in [353]. In what follows, we denote by R the set of real numbers. Let N = {1, 2, . . . }, N0 = {0, 1, 2, . . . }, Nα = {0, 1, 2, . . . , α}, α ∈ N. For a function v(s, t) : N0 × N0 → R, we define the operators ∇1 v(s, t) = v(s, t) − v(s − 1, t), ∇2 v(s, t) = v(s, t) − v(s, t − 1) and ∇2 ∇1 v(s, t) = ∇2 (∇1 v(s, t)) = ∇1 (∇2 v(s, t)). T HEOREM 2.8.8. Let p > 1, q > 1 be constants and p1 + q1 = 1. Let a(s, t) : Nx × Ny → R, b(k, r) : Nz × Nw → R and a(0, t) = b(0, t) = 0, a(s, 0) = b(s, 0) = 0. Then  z w y x    s=1 t=1

|a(s, t)||b(k, r)| q(st)p−1 + p(kr)q−1

k=1 r=1





y x    p (x − s + 1)(y − t + 1)∇2 ∇1 a(s, t)  L(p, q, x, y, z, w)

 ×

s=1 t=1 z  w 

 q (z − k + 1)(w − r + 1)∇2 ∇1 b(k, r)

k=1 r=1

1/p

1/q (2.8.40)

223

2.8. Inequalities Similar to Hilbert’s Inequality

for x, y, z, w in N, where L(p, q, x, y, z, w) =

1 (xy)(p−1)/p (zw)(q−1)/q pq

(2.8.41)

for x, y, z, w in N. P ROOF. From the hypotheses, it is easy to observe that the following identities hold: a(s, t) =

s  t 

∇2 ∇1 a(ξ, η),

(2.8.42)

∇2 ∇1 b(σ, τ )

(2.8.43)

ξ =1 η=1

b(k, r) =

k  r  σ =1 τ =1

for (s, t) ∈ Nx × Ny , (k, r) ∈ Nz × Nw . From (2.8.42), (2.8.43) and using Hölder’s inequality with indices p, p/(p − 1) and q, q/(q − 1), respectively, we have  s t 1/p     p (p−1)/p a(s, t)  (st) ∇2 ∇1 a(ξ, η) ,

(2.8.44)

ξ =1 η=1

 k r 1/q      q b(k, r)  (kr)(q−1)/q ∇2 ∇1 b(σ, τ ) ,

(2.8.45)

σ =1 τ =1

for (s, t) ∈ Nx × Ny , (k, r) ∈ Nz × Nw . From (2.8.44), (2.8.45) and using the elementary inequality (2.8.37), it is easy to observe that |a(s, t)||b(k, r)| q(st)p−1 + p(kr)q−1 1/p  k r 1/q  s t   p q 1      ∇2 ∇1 a(ξ, η) ∇2 ∇1 b(σ, τ )  pq ξ =1 η=1

σ =1 τ =1

(2.8.46) for (s, t) ∈ Nx × Ny , (k, r) ∈ Nz × Nw . Taking the sum on both sides of (2.8.46) first over r from 1 to w and over k from 1 to z and then taking the sum on both sides of the resulting inequality first over t from 1 to y and over s from 1 to x and then using Hölder’s inequality with indices p, p/(p − 1) and q, q/(q − 1) and

224

Chapter 2. Inequalities Related to Hardy’s Inequality

interchanging the order of the summation we observe that  z w y x    s=1 t=1

k=1 r=1

|a(s, t)||b(k, r)| q(st)p−1 + p(kr)q−1



 s t 1/p y x p 1     ∇2 ∇1 a(ξ, η)  pq 

ξ =1 η=1

s=1 t=1



 k r 1/q z  w    q ∇2 ∇1 b(σ, τ ) × k=1 r=1

σ =1 τ =1

 x y  s t      p 1 (p−1)/p   ∇2 ∇1 a(ξ, η) (xy)  pq s=1 t=1

 × (zw)(q−1)/q

ξ =1 η=1

 k r  z  w    q ∇2 ∇1 b(σ, τ ) k=1 r=1



1/p

1/q

σ =1 τ =1

y x    p = L(p, q, x, y, z, w) (x − s + 1)(y − t + 1)∇2 ∇1 a(s, t)

 ×

s=1 t=1 z  w   q (z − k + 1)(w − r + 1)∇2 ∇1 b(k, r)

1/p

1/q .

k=1 r=1



The proof is complete.

R EMARK 2.8.4. If we apply the elementary inequality (2.8.37) on the right-hand sides of (2.8.31) and (2.8.40), then we get respectively the following inequalities k  r  m=1 n=1

|am ||bn | qmp−1 + pnq−1 

k r 1  1  M(p, q, k, r) (k − m + 1)|∇am |p + (r − n + 1)|∇bn |q p q m=1



n=1

(2.8.47)

225

2.8. Inequalities Similar to Hilbert’s Inequality

and  z w y x   

 |a(s, t)||b(k, r)| q(st)p−1 + p(kr)q−1 s=1 t=1 k=1 r=1  y x  p 1   L(p, q, x, y, z, w) (x − s + 1)(y − t + 1)∇2 ∇1 a(s, t) p s=1 t=1

 z w  q 1    + (z − k + 1)(w − r + 1) ∇2 ∇1 b(k, r) . q k=1 r=1

(2.8.48) The following theorems deals with the integral analogues of the inequalities in Theorems 2.8.1–2.8.4 established by Pachpatte in [334]. T HEOREM 2.8.9. Let p
1, q
1 and f (σ )
0, g(τ )
0 for σ ∈ (0, x), τ ∈

s (0, y), where x, y are positive real numbers, and define F (s) = 0 f (σ ) dσ and

t G(t) = 0 g(τ ) dτ , for s ∈ (0, x), t ∈ (0, y). Then  x 0

0

y


 x 1/2  p−1 2 F p (s)Gq (t) ds dt  D(p, q, x, y) (x − s) F (s)f (s) ds s +t 0
 y 1/2  q−1 2 × (y − t) G (t) dt , (2.8.49) 0

unless f ≡ 0 or g ≡ 0, where 1 √ D(p, q, x, y) = pq xy. 2

(2.8.50)

P ROOF. From the hypotheses, it is easy to observe that  F (s) = p p



s

F p−1 (σ )f (σ ) dσ,

s ∈ (0, x),

(2.8.51)

0

Gq (t) = q 0

t

Gq−1 (τ )g(τ ) dτ,

t ∈ (0, y).

(2.8.52)

226

Chapter 2. Inequalities Related to Hardy’s Inequality

From (2.8.51) and (2.8.52) and using Schwarz inequality and the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals), we observe that F p (s)Gq (t)
 s 
 t  p−1 q−1 = pq F (σ )f (σ ) dσ G (τ )g(τ ) dτ 0

0




s

2 F p−1 (σ )f (σ ) dσ

 pq(s)1/2




1/2

t

2 Gq−1 (τ )g(τ ) dτ

(t)1/2

0

1/2

0


 s 1/2
 t 1/2  p−1  q−1 2 2 1 F G (τ )g(τ ) dτ  pq(s + t) (σ )f (σ ) dσ . 2 0 0 (2.8.53) Dividing both sides of (2.8.53) by s + t and then integrating over t from 0 to y, first, and then integrating the resulting inequality over s from 0 to x and using Schwarz inequality we observe that  x

y

F p (s)Gq (t) ds dt s +t 0 0  x
 s 1/2   p−1 2 1  pq F (σ )f (σ ) dσ 2 0 0 1/2   y
 t  q−1 2 G (τ )g(τ ) dτ × 0

0

 x


 1/2 s 2 1 1/2 p−1  pq(x) F (σ )f (σ ) dσ ds 2 0 0  y
 t  1/2  q−1 2 G (τ )g(τ ) dτ dt × (y)1/2 0

0


 x 1/2  2 = D(p, q, x, y) (x − s) F p−1 (s)f (s) ds 0




y

×

 2 (y − t) Gq−1 (t)g(t) dt

1/2 .

0

The proof is complete.



227

2.8. Inequalities Similar to Hilbert’s Inequality

R EMARK 2.8.5. In the special case when p = q = 1, inequality (2.8.49) reduces to the following inequality  x

y

F (s)G(t) ds dt s +t 0 0
 x 1/2
 y 1/2 2 2  D(1, 1, x, y) (x − s)f (s) ds (y − t)g (t) dt , 0

0

(2.8.54) where D(1, 1, x, y) is obtained by taking p = q = 1 in (2.8.50). T HEOREM 2.8.10. Let f, g, F, G be as in Theorem 2.8.9. Let p(σ ) and q(τ ) be

s two positive functions tdefined for σ ∈ (0, x), τ ∈ (0, y), and define P (s) = 0 p(σ ) dσ and Q(t) = 0 q(τ ) dτ , for s ∈ (0, x), t ∈ (0, y), where x, y are positive real numbers. Let φ and ψ be as in Theorem 2.8.2. Then  x

y

φ(F (s))ψ(G(t)) ds dt s +t 0 0 
1/2
 x f (s) 2 (x − s) p(s)φ ds  L(x, y) p(s) 0  2 1/2
 y
g(t) × (y − t) q(t)ψ dt , q(t) 0

(2.8.55)

where L(x, y) =

1 2


 x 0

φ(P (s)) P (s)

1/2
 y

2 ds

0

ψ(Q(t)) Q(t)

2

1/2 dt

.

(2.8.56)

P ROOF. From the hypotheses and by using Jensen’s inequality and the Schwarz inequality, it is easy to observe that 
 s  s f (σ ) p(σ ) p(σ ) dσ φ(F (s)) = φ P (s) dσ p(σ ) 0 0 
 φ(P (s)) s f (σ )  dσ p(σ )φ P (s) 0 p(σ )  s


 1/2 φ(P (s)) f (σ ) 2 1/2  p(σ )φ (s) dσ P (s) p(σ ) 0

(2.8.57)

228

Chapter 2. Inequalities Related to Hardy’s Inequality

and similarly,  t


 1/2   g(τ ) 2 ψ(Q(t)) 1/2 q(τ )ψ (t) dτ . ψ G(t)  Q(t) q(τ ) 0

(2.8.58)

From (2.8.57) and (2.8.58) and using the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals), we observe that
 s  1/2     1 f (σ ) 2 φ(P (s)) p(σ )φ dσ φ F (s) ψ G(t)  (s + t) 2 P (s) p(σ ) 0
 t  1/2 g(τ ) 2 ψ(Q(t)) q(τ )ψ . (2.8.59) dτ × Q(t) q(τ ) 0 The rest of the proof can be completed by following the same steps as in the proof of Theorem 2.8.9 and closely looking at the proof of Theorem 2.8.2, hence we omit the details.  T HEOREM 2.8.11. Let f, g

be as in Theorem 2.8.9, and define F (s) = 1 s 1 t f (σ ) dσ and G(t) = s 0 t 0 g(τ ) dτ , for s ∈ (0, x), t ∈ (0, y), where x, y are positive real numbers. Let φ and ψ be as in Theorem 2.8.3. Then  x y    st  φ F (s) ψ G(t) ds dt 0 0 s +t
 x 1/2   2  D(1, 1, x, y) (x − s) φ f (s) ds
 ×

0 y

  2 (y − t) ψ g(t) dt

1/2 ,

(2.8.60)

0

where D(1, 1, x, y) is obtained by taking p = q = 1 in (2.8.50). Let f, g, p, q, P , Q be as in Theorem 2.8.10, and define T HEOREM 2.8.12.

s t 1 F (s) = P 1(s) 0 p(σ )f (σ ) dσ and G(t) = Q(t) 0 q(τ )g(τ ) dτ , for s ∈ (0, x), t ∈ (0, y), where x, y are positive real numbers. Let φ and ψ be as defined in Theorem 2.8.3. Then  x y P (s)Q(t)φ(F (s))ψ(G(t)) ds dt s+t 0 0
 x 1/2   2  D(1, 1, x, y) (x − s) p(s)φ f (s) ds 0

229

2.8. Inequalities Similar to Hilbert’s Inequality




y

×

  2 (y − t) q(t)ψ g(t) dt

1/2 ,

(2.8.61)

0

where D(1, 1, x, y) is defined by taking p = q = 1 in (2.8.50). The proofs of Theorems 2.8.11 and 2.8.12 can be completed by following the proof of Theorem 2.8.10 and closely looking at the proofs of Theorems 2.8.3 and 2.8.4 and by making use of the integral versions of Jensen’s and the Schwarz inequalities. Here we omit the details. The integral analogues of Theorems 2.8.5 and 2.8.6 established by Pachpatte in [335,350] are given in the following theorems. T HEOREM 2.8.13. Let f ∈ C 1 ([0, x), R+ ), g ∈ C 1 ([0, y), R+ ) and f (0) = g(0) = 0, where R+ = [0, ∞), x, y ∈ R, the set of real numbers. Then  x y f (s)g(t) ds dt s +t 0 0
 x 1/2
 y 1/2 1√
2
2  xy (x − s)f (s) ds (y − t)g (t) dt , (2.8.62) 2 0 0 where “
” denotes the derivative of a function. P ROOF. From the hypotheses we have the following identities  f (s) =

s

f
(σ ) dσ,

s ∈ [0, x),

(2.8.63)

g
(τ ) dτ,

t ∈ [0, y).

(2.8.64)

0

 g(t) =

t

0

From (2.8.63), (2.8.64) and using the Schwarz inequality and the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals), we observe that
 f (s)g(t) =

s

0

f
(σ ) dσ




t

0




s

 (s)1/2 0

f
2 (σ ) dσ

g
(τ ) dτ




1/2

t

(t)1/2

g
2 (τ ) dτ

1/2

0

1/2
 t 1/2
 s 1
2
2  (s + t) f (σ ) dσ g (τ ) dτ . 2 0 0

(2.8.65)

230

Chapter 2. Inequalities Related to Hardy’s Inequality

Rewriting (2.8.65) and then integrating over t from 0 to y, first, and then integrating the resulting inequality over s from 0 to x and using the Schwarz inequality we observe that  x y f (s)g(t) ds dt s+t 0 0
 x
 s 1/2 
 y
 t 1/2  1 f
2 (σ ) dσ ds g
2 (τ ) dτ dt  2 0 0 0 0
 x
 s  1/2 1 f
2 (σ ) dσ ds  (x)1/2 2 0 0
 y
 t  1/2 1/2
2 × (y) g (τ ) dτ dt 1√ = xy 2




0 x

0

1/2



2

y

(x − s)f (s) ds

0

1/2


2

(y − t)g (t) dt

.

0



The proof is complete.

T HEOREM 2.8.14. Let f ∈ C 1 ([0, x), R+ ), g ∈ C 1 ([0, y), R+ ) with f (0) = g(0) = 0 and let p(σ ) and q(τ ) be two positive functions defined for σ ∈ [0, x)

t s and τ ∈ [0, y), and P (s) = 0 p(σ ) dσ and Q(t) = 0 q(τ ) dτ , for s ∈ [0, x) and t ∈ [0, y), where x, y are positive real numbers. Let φ and ψ be as in Theorem 2.8.6. Then  x y φ(f (s))ψ(g(t)) ds dt s+t 0 0
 x

 2 1/2 f (s)  L(x, y) (x − s) p(s)φ ds p(s) 0
 y

 2 1/2 g (t) × (y − t) q(t)ψ dt , (2.8.66) q(t) 0 where L(x, y) =

1 2


 x 0

φ(P (s)) P (s)

1/2
 y

2 ds

0

ψ(Q(t)) Q(t)

2

1/2 dt

(2.8.67)

and “
” denotes the derivative of a function. P ROOF. From the hypotheses we have identities (2.8.63) and (2.8.64). From (2.8.63) and (2.8.64) and using Jensen’s integral inequality (see [211]), we

2.8. Inequalities Similar to Hilbert’s Inequality

231

observe that 
 s  s   f
(σ ) p(σ ) p(σ ) dσ φ f (s) = φ P (s) dσ p(σ ) 0 0  s 
 s   f
(σ ) dσ p(σ ) p(σ ) dσ  φ P (s) φ p(σ ) 0 0



 s  f (σ ) φ(P (s)) p(σ )φ  dσ P (s) p(σ ) 0

(2.8.68)

and similarly,

 t

   g (τ ) ψ(Q(t)) dτ. q(τ )ψ ψ g(t)  Q(t) q(τ ) 0

(2.8.69)

From (2.8.68) and (2.8.69) and using the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals), we observe that     φ f (s) ψ g(t)

 s 

φ(P (s)) f (σ ) dσ  p(σ )φ P (s) p(σ ) 0

 t

 g (τ ) ψ(Q(t)) dτ q(τ )ψ × Q(t) q(τ ) 0 1/2  s



 φ(P (s)) f (σ ) 2 1/2 dσ  p(s)φ (s) P (s) p(σ ) 0  t

 2 1/2

g (τ ) ψ(Q(t)) 1/2 q(τ )ψ (t) dτ × Q(t) q(τ ) 0



 s  1/2 f (σ ) 2 φ(P (s)) 1 p(σ )φ dσ  (s + t) 2 P (s) p(σ ) 0

 2 1/2

 t ψ(Q(t)) g (τ ) × q(τ )ψ . (2.8.70) dτ Q(t) q(τ ) 0 The rest of the proof can be completed by following the same steps as in the proof of Theorem 2.8.13, and hence we omit it here.  R EMARK 2.8.6. If we apply the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals) on the right-hand sides of (2.8.62) and (2.8.66), we get

232

Chapter 2. Inequalities Related to Hardy’s Inequality

respectively the following inequalities  x y f (s)g(t) ds dt s+t 0 0  x

 y 1√
2
2  xy (x − s)f (s) ds + (y − t)g (t) dt 4 0 0 and

 x

(2.8.71)

y

φ(f (s))ψ(g(t)) ds dt s +t 0 0  x

 2 f (s) 1 (x − s) p(s)φ ds  L(x, y) 2 p(s) 0

 2  y g (t) + (y − t) q(t)ψ dt . q(t) 0

(2.8.72)

The integral analogue of Theorem 2.8.7 established by Pachpatte in [353] is given in the following theorem. T HEOREM 2.8.15. Let p > 1, q > 1 be constants and p1 + q1 = 1. Let f (s) and g(t) be real-valued continuous functions defined on Ix = [0, x) and Iy = [0, y), respectively, and f (0) = g(0) = 0. Then  x y |f (s)||g(t)| ds dt p−1 + pt q−1 qs 0 0
 x 1/p
 y 1/q 
p 
q      K(p, q, x, y) (x − s) f (s) ds (y − t) g (t) dt 0

0

(2.8.73) for x, y ∈ I0 = (0, ∞), where K(p, q, x, y) =

1 (p−1)/p (q−1)/q x y pq

(2.8.74)

for x, y ∈ I0 . P ROOF. From the hypotheses we have the following identities  s f (s) = f
(σ ) dσ 0

(2.8.75)

233

2.8. Inequalities Similar to Hilbert’s Inequality

and



t

g(t) =

g
(τ ) dτ,

(2.8.76)

0

for s ∈ Ix , t ∈ Iy . From (2.8.75) and (2.8.76) and using Hölder’s integral inequality with indices p, p/(p − 1) and q, q/(q − 1), respectively, we have
 s 1/p   
p f (s)  (s)(p−1)/p f (σ ) dσ , (2.8.77)   g(t)  (t)(q−1)/q




0

 g
(τ ) dτ

t

1/q (2.8.78)

0

for s ∈ Ix , t ∈ Iy . From (2.8.77), (2.8.78) and using the elementary inequality (2.8.37), we observe that
 s 1/p
 t 1/q    
p 
q f (s)g(t)  (s)(p−1)/p (t)(q−1)/q f (σ ) dσ g (τ ) dτ 

s p−1 p

+


 s  t q−1

0

 f
(σ )p dσ

q

1/p


0

0

 g
(τ )q dτ

t

1/q

0

for s ∈ Ix , t ∈ Iy . From the above inequality we observe that
 s 1/p
 t 1/q 
p 
q 1 |f (s)||g(t)| f (σ ) dσ g (τ ) dτ  qs p−1 + pt q−1 pq 0 0

(2.8.79)

for s ∈ Ix , t ∈ Iy . Integrating both sides of (2.8.79) over t from 0 to y, first, and then integrating the resulting inequality over s from 0 to x and using Hölder’s integral inequality with indices p, p/(p − 1) and q, q/(q − 1) we observe that  x y |f (s)||g(t)| ds dt p−1 + pt q−1 qs 0 0    x
 s  y
 t  
p 1/p 
q 1/q 1     f (σ ) g (τ ) ds dt  pq 0 0 0 0  x
 s  1/p 
p 1 f (σ ) dσ ds (x)(p−1)/p  pq 0 0  y
 t  1/q 
q g (τ ) dτ dt × (y)(q−1)/q 0

0


 x 1/p
 y 1/q 
p 
q     = K(p, q, x, y) (x − s) f (s) ds (y − t) g (t) dt . 0

0

234

Chapter 2. Inequalities Related to Hardy’s Inequality



The proof is complete.

R EMARK 2.8.7. If we apply the elementary inequality (2.8.37) on the right-hand side of (2.8.73), then we get the following inequality  x

|f (s)||g(t)| ds dt p−1 + pt q−1 qs 0 0

 x  
p 
q 1 y 1     (x − s) f (s) ds + (y − t) g (t) dt .  K(p, q, x, y) p 0 q 0 (2.8.80) y

In [342] Pachpatte establishes the following inequality similar to the integral analogue of Hilbert’s inequality. T HEOREM 2.8.16. Let n
1 be an integer. Let u ∈ C n (Ix , R), v ∈ C n (Iy , R) and u(i) (0) = v (i) (0) = 0 for i = 0, 1, 2, . . . , n − 1, where Ix = [0, x), Iy = [0, y). Then  x

|u(k) (s)||v (k) (t)| ds dt 2n−2k−1 + t 2n−2k−1 0 0 s
 x 1/2  2 (x − s)u(n) (s) ds  M1 (n, k, x, y) y


 ×

0 y

 2 (y − t)v (n) (t) dt

1/2 ,

(2.8.81)

0

where M1 (n, k, x, y) =

√ xy 1 . 2 [(n − k − 1)!]2 (2n − 2k − 1)

(2.8.82)

P ROOF. From the hypotheses and Taylor expansion, we have 1 u (s) = (n − k − 1)!



(k)

v

(k)

1 (t) = (n − k − 1)!

s

(s − σ )n−k−1 u(n) (σ ) dσ,

(2.8.83)

(t − τ )n−k−1 v (n) (τ ) dτ,

(2.8.84)

0



0

t

235

2.8. Inequalities Similar to Hilbert’s Inequality

for s ∈ Ix , t ∈ Iy . From (2.8.83) and using the Schwarz integral inequality, we have  (k)  u (s)  

1 (n − k − 1)! 1 (n − k − 1)!



s

  (s − σ )n−k−1 u(n) (σ ) dσ

0




s

1/2
 (s − σ )2(n−k−1) dσ

0

s (2n−2k−1)/2

1 = (n − k − 1)! (2n − 2k − 1)1/2

 u(n) (σ )2 dσ

s

0




 u(n) (σ )2 dσ

s

1/2

1/2 (2.8.85)

0

for s ∈ Ix . Similarly, from (2.8.84) and using the Schwarz integral inequality, we have  (k)  v (t) 

t (2n−2k−1)/2 1 (n − k − 1)! (2n − 2k − 1)1/2




 v (n) (τ )2 dτ

t

1/2 (2.8.86)

0

for t ∈ Iy . From (2.8.85), (2.8.86) and using the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals), we have  (k)  (k)  1  2n−2k−1  1 u (s)v (t)  s + t 2n−2k−1 2 [(n − k − 1)!]2 (2n − 2k − 1)
 s 1/2
 t 1/2  (n) 2  (n) 2     u (σ ) dσ v (τ ) dτ × (2.8.87) 0

0

for s ∈ Ix , t ∈ Iy . Rewriting (2.8.87) and then integrating over t from 0 to y, first, and then integrating the resulting inequality over s from 0 to x and using the Schwarz integral inequality we have  x 0

y

0



|u(k) (s)||v (k) (t)| ds dt + t 2n−2k−1

s 2n−2k−1

1 1 2 [(n − k − 1)!]2 (2n − 2k − 1)
 x
 s 1/2 
 y
 t 1/2   (n) 2  (n) 2     u (σ ) dσ v (τ ) dτ × ds dt 0

0

0

0

236

Chapter 2. Inequalities Related to Hardy’s Inequality


 x
 s  1/2  (n) 2 √ 1 1   u (σ ) dσ ds  x 2 [(n − k − 1)!]2 (2n − 2k − 1) 0 0
 y
 t  1/2  (n) 2 √   v (τ ) dτ dt × y 0

0


 x 1/2
 y 1/2  2  2 = M1 (n, x, y) (x − s)u(n) (s) ds (y − t)v (n) (t) dt . 0

0



The proof is complete.

R EMARK 2.8.8. In the special case when k = 0, inequality (2.8.81) reduces to the following inequality  x y |u(s)||v(t)| ds dt 2n−1 + t 2n−1 0 0 s
 x 1/2
 y 1/2  (n) 2  (n) 2      M1 (n, 0, x, y) (x − s) u (s) ds (y − t) v (t) dt , 0

0

(2.8.88) and, by taking n = 1, inequality (2.8.88) reduces to the slight variant of the inequality given in Theorem 2.8.13. If we apply the elementary inequality c1/2 d 1/2  (c + d)/2 (for c, d nonnegative reals) on the right-hand side of (2.8.81), then we get the following inequality  x y |u(k) (s)||v (k) (t)| ds dt 2n−2k−1 + t 2n−2k−1 0 0 s  x

 y  (n) 2  (n) 2 1     (x − s) u (s) ds + (y − t) v (t) dt .  M1 (n, k, x, y) 2 0 0 (2.8.89) The integral analogue of the inequality in Theorem 2.8.8 established by Pachpatte in [353] is given in the following theorem. In what follows, we use the notations I = [0, ∞), I0 = (0, ∞), Iβ = [0, β), β ∈ I0 , denotes the subintervals of R. For any function u : I × I → R we denote 2 ∂ the partial derivatives ∂s u(s, t), ∂t∂ u(s, t) and ∂s∂ ∂t u(s, t) by D1 u(s, t), D2 u(s, t) and D2 D1 u(s, t) = D1 D2 u(s, t), respectively. T HEOREM 2.8.17. Let p > 1, q > 1 be constants and p1 + q1 = 1. Let f (s, t) and g(s, t) be real-valued continuous functions defined on Ix × Iy and Iz × Iw ,

237

2.8. Inequalities Similar to Hilbert’s Inequality

respectively, and f (0, t) = g(0, t) = 0, f (s, 0) = g(s, 0) = 0. Then   x y
 z w |f (s, t)||g(k, r)| dk dr ds dt p−1 + p(kr)q−1 0 0 0 0 q(st)
 x y 1/p  p  C(p, q, x, y, z, w) (x − s)(y − t)D2 D1 f (s, t) ds dt ×


 z 0

0 w

0

 q (z − k)(w − r)D2 D1 g(k, r) dk dr

1/q (2.8.90)

0

for x, y, z, w ∈ I0 , where 1 (xy)(p−1)/p (zw)(q−1)/q pq

C(p, q, x, y, z, w) =

(2.8.91)

for x, y, z, w ∈ I0 . P ROOF. From the hypotheses we have the following identities  s t f (s, t) = D2 D1 f (ξ, η) dξ dη, 0

g(k, r) =

(2.8.92)

0

 k

r

D2 D1 g(σ, τ ) dσ dτ, 0

(2.8.93)

0

for (s, t) ∈ Ix × Iy , (k, r) ∈ Iz × Iw . From (2.8.92), (2.8.93) and using Hölder’s integral inequality with indices p, p/(p − 1) and q, q/(q − 1), respectively, we observe that 1/p
 s t     D2 D1 f (ξ, η)p dξ dη f (s, t)  (st)(p−1)/p , (2.8.94) 0

  g(k, r)  (kr)(q−1)/q

0


 k 0

 D2 D1 g(σ, τ )q dσ dτ

r

1/q ,

(2.8.95)

0

for (s, t) ∈ Ix × Iy , (k, r) ∈ Iz × Iw . From (2.8.94) and (2.8.95) and using the elementary inequality (2.8.37), it is easy to observe that
 s t 1/p   |f (s, t)||g(k, r)| 1 D2 D1 f (ξ, η)p dξ dη  pq q(st)p−1 + p(kr)q−1 0 0
 k r 1/q q    × D2 D1 g(σ, τ ) dσ dτ 0

0

(2.8.96)

238

Chapter 2. Inequalities Related to Hardy’s Inequality

for (s, t) ∈ Ix × Iy , (k, r) ∈ Iz × Iw . Integrating both sides of (2.8.96) first over r from 0 to w and over k from 0 to z and then integrating both sides of the resulting inequality over t from 0 to y and over s from 0 to x and using Hölder’s inequality with indices p, p/(p − 1) and q, q/(q − 1) and Fubini’s theorem we observe that  x y
 z

 |f (s, t)||g(k, r)| dk dr ds dt p−1 + p(kr)q−1 0 0 0 0 q(st)  x y
 s t 1/p

  1 D2 D1 f (ξ, η)p dξ dη  ds dt pq 0 0 0 0 1/q

 z w
 k r q    dk dr D2 D1 g(σ, τ ) dσ dτ × 0



w

0

0

0

 1/p  D2 D1 f (ξ, η)p dξ dη ds dt


 x y
 s t  (xy)(p−1)/p pq

0

× (zw)(q−1)/q

0

0


 z 0

0

w
 k r  0

0

 1/q  D2 D1 g(σ, τ )q dσ dτ dk dr

0


 x y 1/p  p = C(p, q, x, y, z, w) (x − s)(y − t)D2 D1 f (s, t) ds dt ×


 z 0

0 w

0

 q (z − k)(w − r)D2 D1 g(k, r) dk dr

1/q .

0

The proof is complete.



R EMARK 2.8.9. By using the elementary inequality (2.8.37) on the right-hand side of (2.8.90), we get the following inequality  x y
 z

 |f (s, t)||g(k, r)| dk dr ds dt p−1 + p(kr)q−1 0 0 0 0 q(st)  x y  p 1 (x − s)(y − t)D2 D1 f (s, t) ds dt  C(p, q, x, y, z, w) p 0 0

   q 1 z w (z − k)(w − r)D2 D1 g(k, r) dk dr . + q 0 0 (2.8.97) w

239

2.9. Miscellaneous Inequalities

2.9 Miscellaneous Inequalities 2.9.1 Hardy and Littlewood [139] Suppose that an
0, n = 1, 2, . . . , and c is a real number. Set Am,n =

n 

av .

v=m

If p > 1 we have ∞ 

n−c A1,n  K p

n=1 ∞ 

∞ 

n−c (nan )p

with c > 1,

n−c (nan )p

with c < 1,

n−c (nan )p

with c > 1,

n−c (nan )p

with c < 1,

n=1

n−c An,∞  K p

n=1

∞  n=1

and if 0 < p < 1 we have ∞ 

n−c A1,n
K p

n=1 ∞ 

n

∞  n=1

−c

p An,∞

n=1


K

∞  n=1

where K denotes a positive absolute constant, not necessary the same at each occurrence.

2.9.2 Leindler [186] Let an
0 and λn
0, n = 1, 2, . . . , be given. Let v1 < · · · < vn < · · · denote the indices for which λvn > 0. Let N denote the number of the positive terms of the sequence λn provided this number is finite; in the contrary case, set N = ∞. Set v0 = 0, and if N < ∞ then vN +1 = ∞. Using the notations Am,n =

n  i=m

ai

and Λm,n =

n  i=m

λi ,

1  m  n  ∞,

240

Chapter 2. Inequalities Related to Hardy’s Inequality

we have the following inequalities ∞ 

p

λn A1,n  p p

n=1 ∞ 

N 

p

λv1−p Λpvn,∞ Avn−1 +1,vn , n

n=1 p

λn An,∞  p p

n=1

N 

p

p

λv1−p Λ1,vn Avn ,vn+1 −1 , n

n=1

for p
1 (the constant p p being the best possible one), and N 

p

λv1−p Λpvn,∞ Avn−1 +1,vn  8 n

n=1

∞ 

p

λn A1,n ,

n=1

N 

p

p

λv1−p Λ1,vn Avn ,vn+1 −1  9 n

n=1

∞ 

p

λn An,∞ ,

n=1

for 0 < p < 1.

2.9.3 Izumi, Izumi and Petersen [163] Let p > 1, am
0, m = 1, 2, . . . , g(m) > 0, m = 1, 2, . . . , and C = (cm,k ) be a positive triangular matrix (i.e., cm,k = 0 for k > m and cm,k > 0 for k  m, m = 1, 2, . . . ). If ∞ 

cm,m < ∞

m=1

and ∞ 

p

p−1

g(m)cm,n  A1 g(n)cn,n

for all n
1,

m=n

then ∞  m=1

 g(m)

m  n=1

p cm,n an

 A2

∞ 

p

g(m)am ,

m=1

where A1 , A2 are constants independent of the terms under the summation sign.

241

2.9. Miscellaneous Inequalities

2.9.4 Izumi, Izumi and Petersen [163] Let am
0, m = 1, 2, . . . , g(m) > 0, m = 1, 2, . . . , and C = (cm,k ) be a positive triangular matrix which satisfies the conditions ∞ 

g(m)cm,µ cm,v  A1 g(v)cv,µ

for all µ
v,

m=v

then ∞ 

 g(m)

m=1

m 

2 cm,v av

 A2

v=1

∞ 

2 g(m)am ,

m=1

where A1 , A2 are constants independent of the terms under the summation sign. 2.9.5 Love [196] If p > 1, α(t)
0, α(t) is decreasing in (0, 1], tα(t) is increasing in [1, ∞), 

t

c=

α(t)t −1/p dt < ∞,

λn > 0,

Λm =

0



λn ,

n=1


 Λn λn α |amn |  for m = n, Λm Λm then

m 

|ann |  2

λn α(1), Λn

 ∞ p 1/p  ∞ 1/p ∞       p amn xn  c λm |xm | ,   

m=1 n=1

m=1

where {xn } is an arbitrary fixed sequence. 2.9.6 Love [196] If q
p > 1, 1 − (p −1 − q −1 )  r −1  1, α(t) is nonnegative and decreasing in (0, 1],
 1 1/r m  r −r/q L= α(t) t dt < ∞, λn > 0, Λm = λn 0

n=1

and




1/p−1/q+1/r

|amn | 

λn

1/r

λm

α

Λn Λm

 for 0 < n  m,

242 then

Chapter 2. Inequalities Related to Hardy’s Inequality



∞  m=1

 m q 1/q  ∞ 1/p      λm  amn xn  L λm |xm |p ,   n=1

n=1

where {xn } is a fixed sequence. 2.9.7 Pachpatte [307] If p > 1 is a constant, a(n)
0 for n ∈ N, the set of natural numbers, and A(n) =

mr−2 mr−1 m1 n  1  1  1  ··· a(mr ) n m1 mr−1 m1 =1

m2 =1

mr−1 =1

mr =1

for n ∈ N with m0 = n, then ∞ 




p p−1

Ap (n) 

n=1

rp  ∞

a p (n).

(2.9.1)

n=1

Equality holds in (2.9.1) if a(n) = 0 for n ∈ N. 2.9.8 Pachpatte [292] Let R denote the set of real numbers and B be a subset of Rn defined by B = {x ∈ Rn : 1  x < ∞} where 1 = (1, . . . , 1) ∈ Rn . For a function u : B → R denote 

u( y) =

B

∞ 

···

∞ 

u( y1 , . . . , yn )

y1 =1

yn =1

x1 

xn 

and  B1,x

u( y) =

···

y1 =1

u( y1 , . . . , yn ),

yn =1

where 1 = (1, . . . , 1) ∈ B, x = (x1 , . . . , xn ) ∈ B such that 1  x, that is, 1  xi . Assume that all inequalities between vectors are componentwise and all the sums exist on the respective domains of their definitions and the value of any function u(x1 , . . . , xn ) with any of its component zero is equal to 0. If p > 1 is a constant, f (x)
0 for x ∈ B and  A(x) = f ( y), x ∈ B, (2.9.2) B1,x

243

2.9. Miscellaneous Inequalities

then


A(x) 
p np  #n  f p (x). p−1 i=1 xi B

(2.9.3)

B

Equality holds in (2.9.3) if f (x) = 0 for all xi , i = 1, 2, . . . , n. 2.9.9 Pachpatte [277] Let fj (u), j = 1, 2, be real-valued positive convex functions defined for u > 0. ∞ (j ) Let pj
1, j = 1, 2, be constants, λn > 0, an > 0, j = 1, 2, λn × n n=1 p1 +p2 j (j ) n fj (an ), j = 1, 2, converge, and further let Λn = i=1 λi , An = i=1 λi × (j )

ai , j = 1, 2. Then ∞ 


p

λn f 1 1

n=1



(1) 

An Λn


p

f2 2

(2) 

An Λn




p1 +p2 p1 + p 2 p1 + p 2 − 1  
 
∞ ∞ p1 p2 p1 +p2  (1)  p1 +p2  (2)  . an + an × λn f 1 λn f 2 p1 + p 2 p1 + p 2 n=1

n=1

2.9.10 Pachpatte [277] (i) Let fj (u), j = 1, 2, 3, be real-valued positive convex functions defined (j ) for u > 0. Let pj
1, j = 1, 2, 3, be constants, λn > 0, an > 0, j = 1, 2, 3, ∞ n 2pj (j ) (j ) n=1 λn fj (an ), j = 1, 2, 3, converge, and further let Λn = i=1 λi , An = n (j ) i=1 λi ai , j = 1, 2, 3. Then ∞ 






p λn f 1 1

n=1

(1) 

An Λn


p f2 2

(2) 

An Λn





(3) 
(3) 
(1)  (2)  An An An An p p p f3 3 + f3 3 f1 1 Λn Λn Λn Λn
 3 ∞ 2pj   2pj 2p  (j )  λn f j j an .  2pj − 1 p

+ f2 2

j =1

n=1

244

Chapter 2. Inequalities Related to Hardy’s Inequality (j )

(ii) Let fj , pj , Λn , An be as in (i) and verge. Then ∞ 


p λn f 1 1

n=1

∞

4pj (j ) n=1 λn fj (an ), j

= 1, 2, 3, con-


(2) 
(3)  A(1) n p2 An p3 An f2 f3 Λn Λn Λn


(1) 
(2) 
(3)  An An An p p p × f1 1 + f2 2 + f3 3 Λn Λn Λn
 3 ∞ 4pj   4pj 4p  (j )  λn f j j an .  4pj − 1 j =1

n=1

2.9.11 Pachpatte [277] Let fj (u), j = 1, . . . , m, be real-valued positive convex functions defined for (j ) u > 0. Let pj > 1, j = 1, . . . , m, be constants, λn > 0, an > 0, j = 1, . . . , m, ∞ mpj (j ) (an ), j = 1, . . . , m, converge, and further let Λn = ni=1 λi , n=1 λn fj (j ) (j ) An = ni=1 λi ai , j = 1, . . . , m. Then ∞  n=1

λn

m 

p fj j

j =1




(j ) 

An Λn

mpj  m
∞ mpj 1 mp  (j )   λn f j j an . m mpj − 1 j =1

n=1

2.9.12 Pachpatte [305] Let H (u) be a real-valued nonnegative convex function defined for u > 0. Let λn > 0, an
0 and Λn =

n 

λi ,

An =

i=1

n 

λi ai ,

i=1

Qn =

n 

λi H (ai ).

i=1

p q (i) If p
0, q > 1 be real constants and ∞ n=1 λn [Qn /Λn ] [H (an )] < ∞, then


∞ ∞   q An p+q Qn p  q H (an ) , λn H M λn Λn Λn n=1

where M = (p + q)/(p + q − 1).

n=1

245

2.9. Miscellaneous Inequalities

(ii) If p, q, r be nonnegative real constants such that q + r > 1 and [Qn /Λn ]p [H (an )]q+r < ∞, then ∞  n=1

∞

n=1 λn ×




∞  r q+r An p+q  Qn p  H (an )  B q H (an ) λn H λn , Λn Λn n=1

where B = (p + q + r)/(p + q + r − 1). 2.9.13 Bennett [23] Let p, q, r
1. If {an }∞ n=1 is a sequence of nonnegative numbers with partial sums An = a1 + a2 + · · · + an , then  p q
 1+p/q r
p(q + r) − q r  p q 1+r/q an An an An am  . p n n mn

2.9.14 Alzer [9] Let a1 , . . . , aN be nonnegative real numbers such that a1  a2  · · ·  aN and let An = ni=1 ai . If p
1, q > 0, r > 0 are real numbers such that d=

p(q + r) − q
k, p

where k
1 is an integer, then N 

 p q an An

N 

r 1+p/q am

m=n

n=1



k−1 

N   p q 1+r/q an An .

i=0

n=1

(d − i)r/k

If k = 1 then assumption a1  a2  · · ·  aN can be dropped. 2.9.15 Cochran and Lee [65] If γ and p are constants with γ
0 and p
1, and 0  xn  1, then ∞  m=1

 γ

m

m  n=1

p/mp p−1 xnn

 e(γ +1)p

∞  m=1

mγ xm .

246

Chapter 2. Inequalities Related to Hardy’s Inequality

2.9.16 Andersen and Heinig [14] Let {K(m, n)} be a nonnegative double sequence defined in D = {(m, n) ∈ Z × Z: n  m} such that K(m, n) is nonincreasing in m and nondecreasing in n where Z denote the set of integers. (i) If 1  p  q < ∞ and {un }, {vn } are nonnegative sequences such that, for some β, 0  β  1, and all integers γ , 

∞  

βq q K(n, r) un

1/q 

n=r

r   (1−β)p
−p
K(r, n) vn

1/p
 C < ∞,

n=−∞

(2.9.4)

where p
denotes the conjugate index of p, then for all sequences {an }, 

 q 1/q  ∞ 1/p β  n       p K(n, m)am   AC |vn an | . un  

n=−∞

m=−∞

n=−∞

In case p = 1, the second sum in (2.9.4) is replaced in the usual way by the supremum for n  r. (ii) If 1  p  q  ∞ and {un }, {vn } are nonnegative sequences such that, for some β, 0  β  1, and all integers r, 

r  

βq q K(r, n) un

1/q 

∞  

(1−β)p
−p
K(n, r) vn

1/p
 C · < ∞,

n=r

n=−∞

where p
denotes the conjugate index of p, then for all sequences {an }, 

 q 1/q  ∞ 1/p ∞ ∞        · p K(m, n)am   AC |vn an | . un  m=n 

n=−∞

n=−∞

2.9.17 Pachpatte [309] Let α
0, p
0, q
1 be real constants. Let N = {1, 2, . . . }, N0 = {0, 1, 2, . . . }, N0,m = {0, 1, 2, . . . , m} for some fixed m ∈ N and  is the forward difference operator. Let {un }, n ∈ N0,m , be a sequence of real numbers. Then m−1  n=0

n |un | α

p+q

m−1
q  α+q p |un | M (n + 1) |un | + |un | m n=0

1/q

247

2.9. Miscellaneous Inequalities

m−1  × (n + 1)α |un |p+q

1/q


,

n=0

m−1 

n |un | α

p+q

n=0

m−1
q  α+1 p |un | + |un | M (n + 1) |un | m

1/q

n=0

m−1  × (n + 1)α+1 |un |p+q

1/q


,

n=0

m−1 

n |un | α

p+q

n=0

m−1 q
 |un | + |un | M (n + 1)(α+1)q |un |p m

1/q

n=0

×

m−1 

1/q


|un |

p+q

,

n=0

m−1 

nα |un |p+q

n=0

m−1
q  |un | + |un | M (n + 1)α(q−1) |un |p m

1/q

n=0

m−1 

× (n + 1)α(q −1)+q |un |p+q

1/q


,

n=0

where   α+2 p+q , M = max α+1 α+1

and q
=

q . q −1

2.9.18 Pachpatte [303] Let p > 1, λn > 0, an > 0, n = 1, 2, . . . , An = p that ∞ n=1 λn an converges. Then ∞ 


λn

n=1 p

p

p

p

∇An

p−1

Λn




p

p p−1

n

i=1 λi ai ,

p−1  ∞

Λn =

n

i=1 λi

p

λn an ,

n=1

where ∇An = An − An−1 and that any number with suffix zero is equal to 0.

and

248

Chapter 2. Inequalities Related to Hardy’s Inequality

2.9.19 Andersen [13] ∞ Let λ
0, 1  p  q  ∞ and suppose {un }∞ 1 , {vm }1 are nonnegative extended ∞ real-valued sequences. There is a constant C independent of {am }∞ 1 , {bn }1 such that

∞ ∞   ∞ 1/p  ∞ 1/q
  a b    m n   p q
|am | vm |bn | un  C  (m + n)λ  n=1 m=1

m=1

n=1

if and only if there is a finite constant K such that  rλ

∞  n=1

un (n + r)λq

1/q 

∞ −1/(p−1)  vm
(m + r)λp

1/p
K

m=1

for all positive integers r, where p
and q
denote the conjugate index of p and q, respectively.

2.9.20 Izumi and Izumi [162] Let p > 1 and s > −1 and let f be a nonnegative, nonincreasing and integrable function on (0, b). If x s f (x)p is integrable, then 

b

 x G(x) dx  A s

p

0

where G(x) =

0

x x/2

f (t) t

b



 p
 b p x − f (x) dx + A x f f (x) dx , 2 b/2 s

dt and A is a constant depending only on p and s.

2.9.21 Shum [407] Let p > 1, r = 1 and f (x) ∈ L[0, b] or f (x) ∈ L[a, ∞] according as r > 1 or r < 1, where a > 0, b > 0. If F (x) is defined by  x F (x) =

f (t) dt,

0∞ x f (t) dt,

r > 1, r < 1,

249

2.9. Miscellaneous Inequalities

and if

b 0

x −r (xf )p dx < ∞ in (i) and 

(i)

b

x −r F p dx +

0






∞

(ii) a

p 

p 1−r

a

x −r (xf )p dx < ∞ in (ii), then

p 1−r p b F (b) r −1 b

x −r (xf )p dx

for r > 1,

0

x −r F p dx +




p r −1

∞

p 

p F p (a) 1−r ∞

x −r (xf )p dx

for r < 1,

a

with equality in (i) or (ii) only for f ≡ 0, where the constant (p/(r − 1))p or (p/(1 − r))p is the best possible when the left-hand side of (i) or (ii) is unchanged, respectively. 2.9.22 Mohapatra and Russell [217] Suppose that a(·, ·) is defined on R+ × R+ , with a(x, t)
0 for 0 < t < x, a(x, t) = 0 for t > x, and suppose that, for some constant K1
1, a(x, t)  K1 a( y, t)

for x > y > t.

(2.9.5)

Let g(x)
0, x ∈ R+ , and g(·)a(·, t) ∈ L(0, t) for each t > 0, and write  t G2 (t) = g(x)a(x, t) dx, t > 0. 0

Let f (t)
0, t ∈ R+ , and a(x, ·)f (·) ∈ L(0, x) for each x > 0, and write  x F1 (x) = a(x, t)f (t) dt, x > 0. 0

(a1 ) If 1 < p < ∞, 0 < m  ∞, g(x) > 0 on (0, m), then  m  m  p p−1 p gF1 dx  pK1 g 1−p (G2 f )p dx.

(2.9.6)

(a2 ) If 0 < p < 1, 0  r < ∞, F1 (x) > 0 on R+ , then  ∞  ∞  p p−1 p gF1 dx
pK1 g 1−p (G2 f )p dx.

(2.9.7)

0

r

0

r

250

Chapter 2. Inequalities Related to Hardy’s Inequality

(a3 ) If p = 1 then hypothesis (2.9.5) is not required and (2.9.6) for 0 < m < ∞ and (2.9.7) for 0 < r < ∞ hold, with equality in (2.9.6) for m = ∞ and (2.9.7) for r = 0. 2.9.23 Mohapatra and Russell [217] Assume that a(·, ·) is defined on R+ × R+ with a(x, t)
0 for 0 < x < t, a(x, t) = 0 for x > t, and suppose that, for some constant K2
1, a(x, t)  K2 a( y, t)

for x < y < t.

(2.9.8)

Let g(x)
0, x ∈ R+ , and g(·)a(·, t) ∈ L(0, t) for each t > 0, and write  t G1 (t) = g(x)a(x, t) dx, t > 0. 0

Let f (t)
0, t ∈ R+ , and a(x, ·)f (·) ∈ L(x, ∞) for each x > 0, and write  ∞ a(x, t)f (t) dt, x > 0. F2 (x) = x

(b1 ) If 1 < p < ∞, 0  r < ∞, g(x)
0 on (r, ∞), then  ∞  ∞  p p−1 p gF2 dx  pK2 g 1−p (G1 f )p dx.

(2.9.9)

(b2 ) If 0 < p < 1, 0 < m  ∞, F2 (x) > 0 on R+ , then  m  m  p p−1 p gF2 dx
pK2 g 1−p (G1 f )p dx.

(2.9.10)

r

0

r

0

(b3 ) If p = 1 then hypothesis (2.9.8) is not required and (2.9.9) for 0 < r < ∞ and (2.9.10) for 0 < m < ∞ hold, with equality in (2.9.9) for r = 0 and (2.9.10) for m = ∞. 2.9.24 Levinson [190] Let p > 1, f (x)
0 and r(x) > 0, x > 0, be absolutely continuous. Let xr
p − 1 1 −
r p λ

251

2.9. Miscellaneous Inequalities

for almost all x > 0 and for some λ > 0. If  r(x) ∞ f (t) J (x) = dt, x x r(t) then



∞



∞

J p (x) dx  λp

0

f p (x) dx.

0

2.9.25 Pachpatte [255] Let p > 1, m > 1 be constants. Let f be a nonnegative and integrable function on (0, b), b > 0 is a constant. Let r be a positive and absolutely continuous function on (0, b). Let 1−

p r
(x) 1 x
m − 1 r(x) α

for almost all x ∈ (0, b) and for some constant α > 0. Then  
p  b

 b  f (x) f (x/2)  p p −m p −m   dx, r(x) − x F (x) dx  α x m−1 r(x) r(x/2)  0 0 where

 F (x) = r(x)

x x/2




 f (t) dt. tr(t)

2.9.26 Pachpatte [255] Let p, f, r be as in Section 2.9.25 and R(x) = absolutely continuous function on (0, b). Let 1−

x 0

r(t) dt. Let q be a positive and

1 R(x) q
(x) 1 R(x)r
(x) 1 +
p − 1 r(x) q(x) p − 1 r 2 (x) α

for almost all x ∈ (0, b) for some constant α > 0. Then  0

b

q(x)F p (x) dx

 p  b

p

 x x  p 1  r(x)f (x) − r f  α q(x) dx,  p−1 xr(x) 2 2  0

252

Chapter 2. Inequalities Related to Hardy’s Inequality

where F (x) =

1 R(x)



x x/2

r(t)f (t) dt. t

2.9.27 Pachpatte [268] Let m = 1 and pj > 1, j = 1, 2, be constants such that p11 + p12 = 1. Let fj (x), j = 1, 2, be nonnegative and integrable functions on (0, ∞) and let rj (x), j = 1, 2, be positive and absolutely continuous functions on (0, ∞). Let

rj (x) pj 1 1+ x
for m > 1, m − 1 rj (x) αj 

rj (x) pj 1 x
1− for m < 1, 1 − m rj (x) βj for almost all x > 0 and for some positive constants αj , βj , j = 1, 2. If Fj (x), j = 1, 2, are defined by 

 r 1(x) 0x rj (t)ft j (t) dt for m > 1, j (2.9.11) Fj (x) =  1 ∞ rj (t)fj (t) dt for m < 1, rj (x) x t then 

∞

x 0

−m



p1  ∞ p1 1 p F1 (x)F2 (x) dx  x −m f1 1 (x) dx λ1 p1 |m − 1| 0

p2  ∞ p2 1 p λ2 x −m f2 2 (x) dx, + p2 |m − 1| 0 (2.9.12)

where λj = max{αj , βj } for j = 1, 2. Equality holds in (2.9.12) if fj (x) ≡ 0. 2.9.28 Pachpatte [268] Let m, fj , rj be as in Section 2.9.27 and pj
1, j = 1, 2, be constants. Let



rj (x) p1 + p 2 1 x
∗ m−1 rj (x) αj 

rj (x) 1 p 1 + p2 x
∗ 1− 1−m rj (x) βj 1+

for m > 1,

for m > 1,

2.9. Miscellaneous Inequalities

253

for almost all x > 0 and for some positive constants αj∗ , βj∗ , j = 1, 2. If Fj (x), j = 1, 2, are defined by (2.9.11), then  ∞ p p x −m F1 1 (x)F2 2 (x) dx 0



p1 +p2  ∞ p1 + p 2 p1 p +p λ∗1 x −m f1 1 2 (x) dx p1 + p 2 |m − 1| 0


p1 +p2  ∞ p1 p1 + p 2 p +p + λ∗2 x −m f2 1 2 (x) dx, p1 + p 2 |m − 1| 0 (2.9.13)




where λ∗j = max{αj∗ , βj∗ } for j = 1, 2. Equality holds in (2.9.13) if f (x) ≡ 0. 2.9.29 Pachpatte [268] Let m > 1 and pj > 1, j = 1, 2, be constants such that p11 + p12 = 1. Let hj (x), j = 1, 2, be nonnegative and integrable functions on (0, b) and let zj (x), j = 1, 2, be positive and absolutely continuous functions on (0, b). Let 
zj (x) pj 1 x
1+ m − 1 zj (x) γj


for almost all x ∈ (0, b) and for some positive constants γj , j = 1, 2. If Hj (x), j = 1, 2, defined by  x zj (t)hj (t) 1 Hj (x) = dt, (2.9.14) zj (x) x/2 t then  b

x −m H1 (x)H2 (x) dx

0







p1 p1  b p1 1  x x  1 z γ1 h1 x −m (x)h (x) − z dx 1 1 1  p1 m−1 z1 (x) 2 2  0

p2 p2 1 γ2 + p2 m−1  

p2  b 1  x x  z h2 × x −m (x)h (x) − z dx. 2 2 2  z2 (x) 2 2  0

254

Chapter 2. Inequalities Related to Hardy’s Inequality

2.9.30 Pachpatte [268] Let m, hj , zj be as in Section 2.9.29 and pj
1, j = 1, 2, be constants. Let



zj (x) p1 + p 2 1
1+ x m−1 zj (x) δj for almost all x ∈ (0, b) and for some positive constants δj , j = 1, 2. If Hj (x), j = 1, 2, are defined by (2.9.14), then  b p p x −m H1 1 (x)H2 2 (x) dx 0



p1 +p2 p 1 + p2 p1 δ1 p 1 + p2 m−1  

p1 +p2  b 1  x x  −m z1 (x)h1 (x) − z1 × x dx h1  z1 (x) 2 2  0 


p1 +p2 p1 + p 2 p2 δ2 + p1 + p 2 m−1  

p1 +p2  b 1  x x  −m × x dx. z2 (x)h2 (x) − z2 2 h2 2  z (x) 2 0




2.9.31 Pachpatte [337] Let p > 1, m > 1 be constants. Let f be a nonnegative and integrable function on (0, b), 0 < b < ∞. If F (x) is defined by   x
 t 1 f (s) ds dt F (x) = 0 t t/2 s for x ∈ (0, b), then
 b x −m F p (x) dx  0

p m−1

2p 

b 0


p  x  x −m f (x) − f dx. 2 

2.9.32 Pachpatte [337] Let p, m and f be as in Section 2.9.31. If F (x) is defined by   x
 t 1 f (s) ds dt F (x) = s x/2 t 0

255

2.9. Miscellaneous Inequalities

for x ∈ (0, b), then 

b

x

−m


F (x) dx  p

0

p m−1

2p 

b

x 0


p  x  f (x) − f 2  dx.

−m 

2.9.33 Pachpatte [255] Let p > 1, m > 1 be constants. Let f be a nonnegative and integrable function on (0, b). Let r be a positive and absolutely continuous function on (0, b). Let 1+

r
(x) p 1 p x +
m − 1 r(x) m−1 α

for almost all x ∈ (0, b) and for some constant α > 0. Then 

b

0

x −m F p (x) dx


 α

p m−1

p 

b

x −m



0



p 1 x 1  x  r(x)f (x) − r f dx,  r(x) 2 2 2 

where 1 F (x) = xr(x)



x

r(t)f (t) dt. x/2

2.9.34 Pachpatte [255] Let p, m, f and r be as in Section 2.9.33. Let 1−

r
(x) p 1 p x +
m − 1 r(x) m−1 α

for almost all x ∈ (0, b) and for some constant α > 0. Then 

b

x 0

−m



F (x) dx  α p

p m−1

p 

x

−m

0

where F (x) =

b

r(x) x



x

x/2

    f (x) 1 f (x/2)  p  dx,  r(x) − r(x) 2 r(x/2) 

f (t) dt. r(t)

256

Chapter 2. Inequalities Related to Hardy’s Inequality

2.9.35 Pachpatte [253] Assume that: (H1 ) Let p > 1 be a constant. Let f (x) be a nonnegative and integrable function on (0, ∞). Let ri (x), i = 1, . . . , n, be positive and absolutely continuous functions on (0, ∞). (H2 ) There exist positive constants αi , βi such that for almost all x > 0, 
r (x) 1 p x i
m − 1 ri (x) αi 

r (x) 1 p x i
1− 1 − m ri (x) βi


1+

for i = 1, . . . , n hold. If m = 1 and

∞ 0

for m > 1, for m < 1,

x −m f p (x) dx < ∞ and E(x) defined by



x r1 (t1 ) 1 t1 r2 (t2 ) 1

tn−2 rn−1 (tn−1 ) 1 1   r1 (x) 0 t1 r2 (t1 ) 0 t2 r3 (t2 ) · · · 0 tn−1 rn (tn−1 )  

t    × 0n−1 rnt(tnn ) f (tn ) dtn dtn−1 · · · dt2 dt1 , m > 1, E(x) =

∞ r1 (t1 ) 1 ∞ r2 (t2 ) 1

∞ (tn−1 ) 1 1  · · · tn−2 rn−1tn−1   x t r (x) t r (t ) t r (t ) rn−1 (tn−1 ) 1 1 1 2 1 2 3 2  

∞   × tn−1 rnt(tnn ) f (tn ) dtn dtn−1 · · · dt2 dt1 , m < 1, then 



∞

x

−m

E (x) dx  p

0



∞

 x −m E p (x) dx 

0

n 


αi

i=1 n  i=1


βi

p m−1 p 1−m

n p 

∞

x −m f p (x) dx

for m > 1,

x −m f p (x) dx

for m < 1.

0

 n p 

∞

0

2.9.36 Pachpatte [253] Assume that (H1 ) in Section 2.9.35 and following hypothesis (H3 ) hold. (H3 ) There exist positive constants ki such that, for almost all x > 0,
1+

 1 1 1 Ri (x)ri
(x)
2 p − 1 ri (x) ki

257

2.9. Miscellaneous Inequalities

for i = 1, . . . , n and



x

Ri (x) =

ri (t) dt,

i = 1, . . . , n,

0

holds. Let φ(u)
0 be defined on an open interval, finite or infinite, have a second derivative φ


0 and 
1
2 φ , φφ


1 − p and at the ends of the interval φ take its limiting values, finite or infinite, and for 0 < x < ∞, the range of values of f (x) lie in the closed interval of definition ∞ of φ. If 0 φ(f (x)) dx < ∞ and J (x) is defined by  tn−2  x  t1 1 1 1 ··· J (x) = r1 (t1 ) r2 (t2 ) rn−1 (tn−1 ) R1 (x) 0 R2 (t1 ) 0 R3 (t2 ) 0  tn−1 1 rn (tn )f (tn ) dtn dtn−1 · · · dt2 dt1 , × Rn (tn−1 ) 0 then



∞

  φ J (x) dx 



0

n  i=1


ki

p p−1

n p 

∞

  φ f (x) dx.

0

2.9.37 Pachpatte [310] Let B be a subset of the n-dimensional Euclidean space Rn defined by B = n n {x ∈

R : 0 < x < ∞} for 0 ∈ R . For the function u(z) defined on B, denote by B u(z) dz, Bx,y u(z) dz the n-fold integrals 

∞



∞

···



0 y1

···

x1



u(z1 , . . . , zn ) dzn · · · dz1 ,

0 yn

u(z1 , . . . , zn ) dzn · · · dz1 ,

xn

respectively, where xi < yi . (i) Let p
1 and c > 1 be constants. Let f (x) be a nonnegative and integrable function on B and let ri (xi ), i = 1, . . . , n, be nonnegative continuous functions on (0, ∞) and let  xi Ri (xi ) = ri (yi ) dyi , 0 < xi < ∞. 0

258

Chapter 2. Inequalities Related to Hardy’s Inequality

If F (x) is defined by 



F (x) = B0,x

n 

 x ∈ B,

ri (yi ) f (y) dy,

i=1

then   n B

 Ri−c (xi )ri (xi )

i=1




p c−1

F p (x) dx

np    n B

 p−c Ri (xi )ri (xi )

f p (x) dx.

(2.9.15)

i=1

Equality holds in (2.9.15) if f (x) ≡ 0. (ii) Let p, f, ri , Ri be defined as in (i) and c < 1 be a constant. If F (x) is defined by   n   F (x) = ri (yi ) f (y) dy, x ∈ B, Bx,∞

i=1

then   n B

i=1




 Ri−c (xi )ri (xi )

p 1−c

F p (x) dx

np    n B

 p−c Ri (xi )ri (xi )

f p (x) dx.

(2.9.16)

i=1

Equality holds in (2.9.16) if f (x) ≡ 0. 2.9.38 Pachpatte [310] Let H be a subset of the n-dimensional Euclidean space Rn defined by H = {x ∈ n Rn : a < x < b},

where a, b ∈ R and a > 0. For a function u(z) defined on H , we denote by H u(z) dz, Hx,y u(z) dz the n-fold integrals 

b1

···

a1



bn

 u(z1 , . . . , zn ) dzn · · · dz1 ,

an

respectively, where ai < bi , xi < yi .

y1

···

x1



yn

xn

u(z1 , . . . , zn ) dzn · · · dz1 ,

259

2.9. Miscellaneous Inequalities

(i) Let p
1, µ < 1 be constants and 0 < a < b  M, where 0, a, b, M are in Rn . Let g(x) be a nonnegative and integrable function on H and let ri (xi ), i = 1, . . . , n, be nonnegative continuous functions on ai < xi  Mi and let 

xi

Ri (xi ) =

ri (yi ) dyi ,

a i < x i  Mi .

ai

If G(x) is defined by 

 G(x) = Ha,x

n 

 ri (yi ) g(y) dy,

a < x < b,

i=1

then 
   n  Ri (Mi ) −µ −1 log Ri (xi )ri (xi ) Gp (x) dx Ri (xi ) H i=1 
np    
n  Ri (Mi ) p−µ p−1 p log Ri (xi )ri (xi ) g p (x) dx.  1−µ Ri (xi ) H i=1 (2.9.17) Equality holds in (2.9.17) if g(x) ≡ 0. (ii) Let p, a, b, M, g, ri , Ri be as in part (i) above and µ > 1 be a constant. If G(x) is defined by 

 G(x) = Hx,b

n 

 ri (yi ) g(y) dy,

a < x < b,

i=1

then 
   n  Ri (Mi ) −µ −1 log Ri (xi )ri (xi ) Gp (x) dx Ri (xi ) H i=1 
np    
n  Ri (Mi ) p−µ p−1 p log Ri (xi )ri (xi ) g p (x) dx.  µ−1 Ri (xi ) H i=1

(2.9.18) Equality holds in (2.9.18) if g(x) ≡ 0.

260

Chapter 2. Inequalities Related to Hardy’s Inequality

2.9.39 Pachpatte [342] Let n
2, 0  k  n − 2 be integers. Let r ∈ C 1 (I, R+ ), u ∈ C n (Ix , R), v ∈ C n (Iy , R) and u(i−1) (0) = v (i−1) (0) = 0, i = 1, . . . , n, where Ix = [0, x), Iy = [0, y). Then  x

|u(k) (s)||v (k) (t)| ds dt 2n−2k−3 + t 2n−2k−3 0 0 s  1/2
 x
 s   s  r(σ )u(n−1) (σ )
2 dσ ds (x − s) 2  M(n, k, x, y) r (s) 0 0
 t
 y  1/2   t  r(ξ )v (n−1) (ξ )
2 dξ dt × (y − t) 2 , r (t) 0 0 y

where M(n, k, x, y) =

√ xy 1 . 2 2 [(n − k − 2)!] (2n − 2k − 3)

2.9.40 Pachpatte [342] Let n
1, 0  k  n − 1 be integers. Let r ∈ C n (I, R+ ), u ∈ C 2n (Ix , R), v ∈ C 2n (Iy , R) and u(i−1) (0) = v (i−1) (0) = 0, (r(0)u(n) (0))(i−1) = (r(0) × v (n) (0))(i−1) = 0, i = 1, . . . , n, where Ix = [0, x), Iy = [0, y). Then  x

|u(k) (s)||v (k) (t)| ds dt 2n−2k−1 + t 2n−2k−1 0 0 s
 s  1/2
 x    s 2n−1  r(σ )u(n) (σ ) (n) 2 dσ ds (x − s) 2  M(n, k, x, y) r (s) 0 0

 y  1/2  t 2n−1   (n) 2 t (n)   r(ξ )v (ξ ) × (y − t) 2 dξ dt , r (t) 0 0 y

where M(n, k, x, y) =

√ xy 1 . 2 [(n − 1)!(n − k − 1)!(2n − 1)]2 (2n − 2k − 1)

2.10 Notes In 1920, G.H. Hardy proved the inequality given in Theorem 2.2.1. He deduced inequality (2.2.1) from the corresponding inequality for integrals. Theorems

2.10. Notes

261

2.2.2 and 2.2.3 are due to Copson [69]. Theorem 2.2.4 deals with a generalization of Hardy’s inequality in Theorem 2.2.1 and is established by Hardy and Littlewood in [139]. Theorem 2.2.5 is due to Nemeth [226] which deals with generalizations of the Hardy–Littlewood inequality given in Theorem 2.2.4. Theorems 2.2.6 and 2.2.7 are taken from Love [196]. The results in Theorems 2.3.1 and 2.3.2 are due to Copson [71]. Theorems 2.3.3 and 2.3.4 are taken from Pachpatte [277] and [307]. The result in Theorem 2.3.5 is due to Bennett [22] which, in fact, is motivated by Littlewood’s problem [195]. The inequalities in Theorem 2.3.6 are taken from Pachpatte [326]. Theorem 2.4.1 deals with the famous integral inequality first discovered by Hardy in [136]. Theorem 2.4.2 is a further generalization of the inequality in Theorem 2.4.1 and also established by Hardy in [137]. The inequalities in Theorems 2.4.3 and 2.4.4 are due to Copson [70]. Theorems 2.4.5 and 2.4.6 are taken from Love [199]. Theorems 2.4.7 and 2.4.8 deal with the general versions of Hardy’s integral inequality with weights and are taken from Muckenhoupt [221]. Theorems 2.5.1–2.5.3 deal with certain generalizations of well-known Hardy’s integral inequality established by Levinson in [190]. The results given in Theorems 2.5.4–2.5.8 deal with some basic generalizations of Hardy’s integral inequality established by Pachpatte [295,344]. Theorem 2.6.1 deals with the variant of Hardy’s integral inequality and is proved by Izumi and Izumi in [162]. The results in Theorems 2.6.2–2.6.9 deal with some extensions and variants of Hardy’s integral inequality established by Pachpatte [254,255,337] (see also [266,305,306]). The results given in Section 2.7 deal with certain multidimensional generalizations and variants of Hardy’s integral inequality established by Pachpatte in [293,315,333,341]. Section 2.8 contains some new results on inequalities similar to Hilbert’s inequality established by Pachpatte in [334,335, 342,343,350,352,353]. Section 2.9 deals with miscellaneous inequalities which claim their origin in well-known Hardy’s inequalities.

This page intentionally left blank

Chapter 3 Opial-Type Inequalities

3.1 Introduction In 1960, Z. Opial [231] discovered one of the most fundamental integral inequalities involving a function and its derivative, which is now known in the literature as Opial’s inequality. In the same year, C. Olech [230] published a note which addresses a simpler proof of Opial’s inequality under weaker conditions. Starting from the pioneer papers [230,231], the result of Opial has received considerable attention and many papers have appeared, which provides with the simple proofs, various generalizations, extensions and discrete analogues of Opial’s inequality and its generalizations. The importance of Opial’s inequality and its generalizations and extensions lies in successful utilization to many interesting applications in the theory of differential equations. Good surveys of the work on such inequalities together with many references are contained in monographs [4,211,215]. In the past few years, numerous variants, generalizations and extensions of Opial’s inequality which involves functions of one and many independent variables have been found in various directions. This chapter deals with important fundamental results on Opial-type inequalities recently investigated in the literature by various investigators.

3.2 Opial-Type Integral Inequalities In [231] Opial established the following interesting integral inequality  0

 u(t)u
(t) dt  h 4

h

263

 0

 u
(t)2 dt,

h

(3.2.1)

264

Chapter 3. Opial-Type Inequalities

where u(t) ∈ C 1 [0, h], u(t) > 0 in (0, h) such that u(0) = u(h) = 0. In (3.2.1) the constant h4 is the best possible. The first simple proof of inequality (3.2.1) is given by Olech [230] in his paper published along with Opial’s paper [231]. In the years thereafter, numerous variants, generalizations and extensions of inequality (3.2.1) have appeared in the literature; see [4,211,215] and the references given therein. In this section we present a weaker form of (3.2.1) and its simplified proof based on Olech [230] as well as variants established by various investigators during the past few years. We begin with the following weaker form of Opial’s inequality (3.2.1) which Olech establishes in [230]. T HEOREM 3.2.1. Let u be an absolutely continuous function on [0, h] and let u(0) = u(h) = 0. Then inequality (3.2.1) holds. Equality holds in (3.2.1) if and only if  cx for 0  x  h2 , (3.2.2) u(t) = c(h − x) for h2  x  h, where c is a constant.

t

P ROOF. Let y(t) = lowing relations

0

|u
(s)| ds and z(t) =

h t

|u
(s)| ds. Then we have the fol-

  y
(t) = u
(t) = −z
(t)

and

  u(t)  z(t),

  u(t)  y(t),

(3.2.3)

(3.2.4)

for t ∈ [0, h]. From (3.2.3) and (3.2.4), we get 

 u(t)u
(t) dt 

h/2 



0

and




 h 1 y(t)y
(t) dt = y 2 2 2

(3.2.5)


 1 2 h . z(t)z (t) dt = z 2 2 h/2

(3.2.6)

h/2 0

  u(t)u
(t) dt  −

h h/2



h




From (3.2.5) and (3.2.6), we find that  0



  u(t)u
(t) dt  1 y 2 h + z2 h . 2 2 2

h

(3.2.7)

265

3.2. Opial-Type Integral Inequalities

On the other hand, using the Cauchy–Schwarz inequality, we have 2

 h/2  h/2 
 
2 h u (t) dt  h u (t) dt, = y2 2 2 0 0 2

 h  h 
 
2 h u (t) dt  h u (t) dt. = z2 2 2 h/2 h/2 Now the desired inequality in (3.2.1) follows from (3.2.7)–(3.2.9). Now suppose that the equality holds in (3.2.1), that is,  h  h   
2 u(t)u
(t) dt = h u (t) dt. 4 0 0 Then from (3.2.7)–(3.2.9), we get
 h/2 2  h/2 
 
2 u (t) dt = h u (t) dt, 2 0 0 2
 h  h 
 
2 u (t) dt = h u (t) dt. 2 h/2 h/2

(3.2.8) (3.2.9)

(3.2.10)

(3.2.11) (3.2.12)

It is easy to see that equalities (3.2.11) and (3.2.12) are possible if and only if |u
(t)| = constant almost everywhere in [0, h2 ] and in [ h2 , h]. Hence y(t) and z(t) are linear. Further, it follows from (3.2.10), (3.2.7), (3.2.11) and (3.2.12) that |u(t)| = y(t) for 0  t  h2 and |u(t)| = z(t) for h2  t  h. These facts imply (3.2.2). The proof is complete.  In [419] Traple has given the inequalities in the following theorem. T HEOREM 3.2.2. Let p be a nonnegative and continuous function on [0, h]. Let u be an absolutely continuous function on [0, h] with u(0) = u(h) = 0. Then the following inequalities hold
 h 
 h   h 2  
2 h     u (t) dt , p(t) u(t) dt  p(t) dt (3.2.13) 4 0 0 0
 h 1/2
 h   h 
  
2 h 2       u (t) dt . (3.2.14) p(t) u(t) u (t) dt  p (t) dt 4 0 0 0 P ROOF. For t ∈ [0, h], we have  t   
 u(t)  u (s) ds, 0

  u(t) 

 t

 u
(s) ds.

h

(3.2.15)

266

Chapter 3. Opial-Type Inequalities

From (3.2.15) we observe that 

  u(t)  1 2

 u
(t) dt.

h

0

From the above inequality and using the Schwarz inequality, we have 

h

0

2  1 p(t)u(t) dt  4 h  4



h


 p(t)

0




 u
(t)2 dt

h

0 h




p(t) dt 0

2

  u
(t)2 dt ,

h

0

which is the required inequality in (3.2.13). By using inequality (3.2.13) and the Schwarz inequality, we observe that 

h

   p(t)u(t)u
(t) dt

0


 

h

2  p (t)u(t) dt

0

1/2


2

 u
(t)2 dt

h

1/2

0


 h 1/2
 h 1/2  h 
2 
2 h u (t) dt u (t) dt  p 2 (t) dt 4 0 0 0
 h 1/2
 h  
2 h u (t) dt . = p 2 (t) dt 4 0 0 

The proof is complete.

In the following two theorems we present the inequalities of the Opial type established by Pachpatte in [348]. T HEOREM 3.2.3. Let p
0, q
1, m
1 be real numbers. If u ∈ C 1 ([0, h], R) satisfies u(0) = u(h) = 0, then 

   u(t)m(p+q) dt  (p + q)m I (m) q

h

0



0

 0

   u(t)m(p+q) dt  (p + q)m I (m) p+q

h

   u(t)mp u
(t)mq dt, (3.2.16)

h

 0

 u
(t)m(p+q) dt,

h

(3.2.17)

267

3.2. Opial-Type Integral Inequalities

where  I (m) =

h

t 1−m + (h − t)1−m

−1

dt.

(3.2.18)

0

P ROOF. From the hypotheses, we have the following identities  p+q

u

t

(t) = (p + q)

up+q−1 (s)u
(s) ds,

(3.2.19)

0



p+q

u

h

(t) = −(p + q)

up+q−1 (s)u
(s) ds,

(3.2.20)

t

for t ∈ [0, h]. From (3.2.19), (3.2.20) and using Hölder’s inequality with indices m, m/(m − 1), we obtain   u(t)m(p+q) 

t

 (p + q)m t m−1

    u(s)p+q−1 u
(s)m ds,

(3.2.21)

0

  u(t)m(p+q)



   u(s)m(p+q−1) u
(s)m ds,

h

 (p + q) (h − t) m

m−1

(3.2.22)

t

for t ∈ [0, h]. Multiplying (3.2.21) by t 1−m and (3.2.22) by (h − t)1−m and adding these inequalities we obtain m(p+q)   1−m t + (h − t)1−m u(t)  h     u(s)m(p+q−1) u
(s)m ds.  (p + q)m

(3.2.23)

0

From (3.2.23) we get   u(t)m(p+q)  −1  (p + q)m t 1−m + (h − t)1−m  h        u(s)mp/q u
(s)m u(s)m(p+q−1)−mp/q ds × 0

(3.2.24)

268

Chapter 3. Opial-Type Inequalities

for t ∈ [0, h]. Integrating (3.2.24) on [0, h] and using Hölder’s inequality with indices q, q/(q − 1), we obtain 

 u(t)m(p+q) dt

h

0



      u(t)mp/q u
(t)m u(t)m(p+q−1)−mp/q dt

h 

 (p + q)m I (m) 0

 (p + q) I (m)
 h 1/q
     u(t)mp u
(t)mq dt × m

0

 u(t)m(p+q) dt

h

(q−1)/q .

0

(3.2.25)

h If 0 |u(t)|m(p+q) dt = 0 then (3.2.16) is trivially true, otherwise, dividing both

h sides of (3.2.25) by ( 0 |u(t)|m(p+q) dt)(q−1)/q and then taking the qth power on both sides of the resulting inequality we get the required inequality in (3.2.16). By using Hölder’s inequality with indices (p + q)/p, (p + q)/q to the integral on the right-hand side of (3.2.16) and following the arguments as in the last part of the proof of inequality (3.2.16) with suitable changes, we get the required inequality in (3.2.17). The proof is complete.  T HEOREM 3.2.4. Let p
0, q
1, r
0, m
1 be real numbers. If u ∈ C 1 ([0, h], R) satisfies u(0) = u(h) = 0, then 

   u(t)m(p+q) u
(t)mr dt

h

0

 q  (p + q + r)m I (m) 



   u(t)mp u
(t)m(q+r) dt,

h

(3.2.26)

0

   u(t)m(p+q) u
(t)mr dt

h

0

 p+q  (p + q + r)m I (m)



 u
(t)m(p+q+r) dt,

h

(3.2.27)

0

where I (m) is defined by (3.2.18). P ROOF. Rewriting the integral on the left-hand side of (3.2.26) and using Hölder’s inequality with indices (q + r)/r, (q + r)/q and inequality (3.2.16),

269

3.2. Opial-Type Integral Inequalities

we observe that  h     u(t)m(p+q) u
(t)mr dt 0

 =

      u(t)m(pr/(q+r)) u
(t)mr u(t)m(p+q)−m(pr/(q+r)) dt

h 

0



   u(t)mp u
(t)m(q+r) dt

h

 0



   u(t)mp u
(t)m(q+r) dt

h

 0



 q+r × (p + q + r)m I (m)  q = (p + q + r)m I (m)



r/(q+r) 

r/(q+r)



h

 u(t)m(p+q+r) dt

q/(q+r)

0

   u(t)mp u
(t)m(q+r) dt

h

q/(q+r)

0

   u(t)mp u
(t)m(q+r) dt.

h

0

This result is the required inequality in (3.2.26). From (3.2.26) and using Hölder’s inequality with indices (p + q)/p, (p + q)/q, we observe that 

   u(t)m(p+q) u
(t)mr dt

h 0

q   (p + q + r)m I (m)  h        u(t)mp u
(t)m(rp/(p+q)) u
(t)m(q+r)−m(rp/(p+q)) dt × 0

q   (p + q + r)m I (m)  h

p/(p+q)      u(t)m(p+q) u
(t)mr dt × 0

 u
(t)m(p+q+r) dt

h

q/(p+q) .

0

Now, by following the arguments as in the last part of the proof of inequality (3.2.16) with suitable modifications, we get the required inequality in (3.2.27). The proof is complete.  R EMARK 3.2.1. We note that the inequalities in (3.2.16) and (3.2.27) are similar to that of Opial’s inequality given in (3.2.1) which in turn yield respectively the lower and upper bounds on the integral of the form involved on the left-hand side

270

Chapter 3. Opial-Type Inequalities

of (3.2.1) while the inequalities obtained in (3.2.17) and (3.2.26) are different from those of (3.2.1). In [304] Pachpatte has established the inequalities in the following theorems which can be considered as their origin to well-known Weyl’s inequality [423], see also [141, p. 165] and Opial’s inequality in (3.2.1). T HEOREM 3.2.5. Let α
0, p
0, q
1 be real constants and f be a realvalued continuously differentiable function defined on (0, b) for a fixed real number b > 0. Then the following inequalities hold 

b

 1/q
p |f (t)| 
 q    f (t) + f (t) t dt b 0
 b (q−1)/q p+q  α+1   f (t) × t dt , (3.2.28)

p+q t f (t) dt  M 

α

0



b




b



α+1 

0

 1/q
p |f (t)| 
 q  + f (t) dt t (α+1)q f (t) b 0
 b (q−1)/q   f (t)p+q dt × , (3.2.29)

p+q  t α f (t) dt  M

0




b

0 2(p+q) where M = { α+2 α+1 , α+1 }.

R EMARK 3.2.2. It is interesting to note that, if the function f is continuously differentiable on (0, ∞), then letting b → ∞ in (3.2.28) and (3.2.29) we get respectively the following inequalities 

∞

p+q t f (t) dt  M 

α

0




∞

t 0




∞

× 

p  q  f (t) f
(t) dt

α+1 

∞

p+q  t α f (t) dt  M

0




p+q  t α+1 f (t) dt

1/q

(q−1)/q ,

0 ∞

p  q  t (α+1)q f (t) f
(t) dt

0


 ×

0

∞

 f (t)p+q dt

(3.2.30)

1/q

(q−1)/q .

(3.2.31)

271

3.2. Opial-Type Integral Inequalities

In particular, if we take α = 0, p = 0, q = 2, then the inequalities obtained in (3.2.30), (3.2.31) reduce to the slight variants of Weyl’s inequality given in [141, p. 165]. T HEOREM 3.2.6. Let α, p, q, f be as defined in Theorem 3.2.5. Then the following inequalities hold  b p+q  t α f (t) dt 0

  Mq 0



b

b


p |f (t)| 
 q  + f (t) dt, t α+q f (t) b

(3.2.32)

p+q  t α f (t) dt

0

  M p+q

b


t α+p+q

0

|f (t)| 
 + f (t) b

p+q dt,

(3.2.33)

where M is as defined in Theorem 3.2.5. R EMARK 3.2.3. If the function f is continuously differentiable on (0, ∞), then letting b → ∞ in (3.2.32) and (3.2.33) we get respectively the following inequalities  ∞  ∞ p+q p  q   t α f (t) dt  M q t α+q f (t) f
(t) dt, (3.2.34) 0



0 ∞

p+q  t α f (t) dt  M p+q

0



∞

p+q  t α+p+q f
(t) dt.

(3.2.35)

0

Here we note that the inequalities obtained in (3.2.34) and (3.2.35) are similar to that of the Opial-type inequality (3.2.1) and those of well-known Hardy’s inequality (2.4.1). T HEOREM 3.2.7. Let α, p, q be as defined in Theorem 3.2.5 and let f be a realvalued continuously differentiable function defined on (a, b) for fixed real numbers a < b. Then the following inequalities hold  a

b


1/q 
 b p+q p  q   p+q |t|α f (t) dt  |H | + |t|α+1 f (t) f
(t) dt α+1 a
 b (q−1)/q  p+q α+1   × |t| dt , (3.2.36) f (t) a

272

Chapter 3. Opial-Type Inequalities



b

a


 b
1/q p+q  p 
q  p+q (α+1)q      f (t) f (t) dt |t| f (t) dt  |H | + |t| α+1 a
 b (q−1)/q   f (t)p+q dt × , (3.2.37) 

α

a

where H=

p+q p+q    1  α+1 b . (sgn b)α f (b) − a α+1 (sgn a)α f (a) α+1

(3.2.38)

R EMARK 3.2.4. We note that, in the special case when q = 1, the inequalities obtained in (3.2.36) and (3.2.37) reduces to the following inequality 

b

p+1  |t|α f (t) dt

a


 |H0 | +

p+1 α+1



b

p    |t|α+1 f (t) f
(t) dt,

(3.2.39)

a

where H0 is defined by the right-hand side of (3.2.38) taking q = 1. P ROOFS OF T HEOREMS 3.2.5–3.5.7. Integrating by parts we have the following identity

 b p+q−1 
 1 α+2  α+1 f (t) sgn f (t) dt t f (t) − t b 0

 b p+q 1 α α+1 |f (t)| =− (α + 1)t − (α + 2)t dt. b p+q 0

(3.2.40)

From (3.2.40) we observe that  (α + 1)

b

p+q  t α f (t) dt

0



p+q 1 t α+1 f (t) dt b 0

 b p+q−1 
 1  α+1 f (t) sgn f (t) dt 1 − t f (t) − (p + q) t b 0

= (α + 2)

b

273

3.2. Opial-Type Integral Inequalities



p+q 1 t α+1 f (t) dt b 0

 b p+q−1 
 1  α+1 f (t) dt. 1 + t f (t) + (p + q) t b 0

 (α + 2)

b

(3.2.41)

From (3.2.41) we observe that 

b

p+q  t α f (t) dt

0






p+q 1 t α+1 f (t) dt b 0  p+q−1 
 2(p + q) b α+1  f (t) dt f (t) t + α+1 0

 b p+q−1 |f (t)| 
  α+1     M f (t) t + f (t) dt b 0 
 b p/q |f (t)| 
  (α+1)/q     f (t) t + f (t) =M b 0

p+q−1−p/q  × t (α+1)((q−1)/q) f (t) dt.



α+2 α+1

b

(3.2.42)

Now, by using Hölder’s inequality with indices q, q/(q − 1), we get the required inequality in (3.2.28). In order to establish inequality (3.2.29), we rewrite the last inequality in (3.2.42) in the following form  0

b

p+q  t α f (t) dt  M

 b 0


p/q |f (t)| 
  t α+1 f (t) + f (t) b

p+q−1−p/q   × f (t) dt.

(3.2.43)

By using Hölder’s inequality with indices q, q/(q − 1) on the right-hand side of (3.2.43), we get the desired inequality in (3.2.29). The proof of Theorem 3.2.5 is complete. By following the same arguments as in the proof of Theorem 3.2.5, we have the inequality (3.2.42). Rewriting the inequality (3.2.42) and using Hölder’s

274

Chapter 3. Opial-Type Inequalities

inequality with indices q, q/(q − 1), we have 
 b  b p+q p/q |f (t)| 
   α α+1−α((q−1)/q)      f (t) t t f (t) dt  M + f (t) b 0 0 p+q−1−p/q    × t α((q−1)/q) f (t) dt  1/q
p |f (t)| 
 q  + f (t) dt t α+q f (t) b 0
 b (q−1)/q p+q  × t α f (t) dt . (3.2.44)


b

M

0

b

If 0 t α |f (t)|p+q dt = 0 then (3.2.32) is trivially true; otherwise, dividing both

b sides of (3.2.44) by ( 0 t α |f (t)|p+q dt)(q−1)/q and then taking the qth power on both sides of the resulting inequality, we get the required inequality in (3.2.32). Rewriting inequality (3.2.42) and using Hölder’s inequality with indices p + q, (p + q)/(p + q − 1), we have 
 b  b p+q  |f (t)| 
 t α+1−α((p+q−1)/(p+q)) + f (t) t α f (t) dt  M b 0 0 p+q−1    × t α((p+q−1)/(p+q)) f (t) dt  1/(p+q) |f (t)| 
 p+q + f (t) dt b 0
 b (p+q−1)/(p+q) p+q  α  × t f (t) dt . (3.2.45)


M

b




t α+p+q

0

Now, by following the arguments as in the last part of the proof of inequality (3.2.32) with suitable modifications, we get the required inequality in (3.2.33). The proof of Theorem 3.2.6 is complete. By rewriting and integrating by parts the integral on the left-hand side of (3.2.36), we have  b  b p+q p+q   α  f (t) |t| dt = t α (sgn t)α f (t) dt a

a

=H −




p+q α+1



b a

p+q−1
 t α+1 f (t) f (t)(sgn t)α dt. (3.2.46)

3.3. Wirtinger–Opial-Type Integral Inequalities

275

From (3.2.46) we observe that  b p+q  |t|α f (t) dt a

 b p+q−1 
  p+q f (t) dt  |H | + |t|α+1 f (t) α+1 a
 b     (α+1)/q  p+q f (t)p/q f
(t)  |H | + |t| α+1 a p+q−1−p/q    × |t|(α+1)((q−1)/q) f (t) dt. (3.2.47)


Now, by using Hölder’s inequality with indices q, q/(q − 1) to the integral on the right-hand side of (3.2.47), we get the required inequality in (3.2.36). The proof of inequality (3.2.37) is similar to that of the proof of inequality (3.2.36) given above with suitable modifications, so we omit it here. The proof of Theorem 3.2.7 is complete. 

3.3 Wirtinger–Opial-Type Integral Inequalities There is extensive literature on integral inequalities involving functions and their derivatives which claim their origin to the well-known Wirtinger- and Opial-type integral inequalities (see [141,211]). In this section we present some results established in [51,238,241,283]. In [238] Pachpatte has established the Wirtinger- and Opial-type integral inequalities in the following three theorems. In what follows, the symbol D k u(x) denotes the kth derivative of u(x) with D 0 u(x) = u(x) for x ∈ [a, b] = I and we write D 1 u(x) = Du(x) for x ∈ I . T HEOREM 3.3.1. Let pi−1 , i = 1, . . . , n, be real-valued nonnegative continuous functions defined on I . Let f, g ∈ C (n−1) (I ) and D n−1 f (x), D n−1 g(x) are absolutely continuous on I with D k f (a) = D k f (b) = 0, D k g(a) = D k g(b) = 0 for 0  k  n − 1. Then the following inequalities hold  b n    pi−1 (t)D i−1 f (t)D i−1 g(t) dt a i=1




 1 b−a 2 4  
 b n 
 b 2  i 2   i     D f (t) + D g(t) dt , × pi−1 (t) dt i=1

a

a

(3.3.1)

276

Chapter 3. Opial-Type Inequalities



n b

   pi−1 (t)D i−1 f (t)D i−1 g(t) dt

2

a i=1


 n 1 2  (b − a)4 2 4  
 b n
 b       i 2 D f (t)4 + D i g(t)4 dt , × pi−1 (t) dt a

i=1 n
 

b

(3.3.2)

a

   pi−1 (t)D i−1 f (t)D i−1 g(t) dt



a

i=1


n
 1 b−a n  2 4  
 b n
 b       i D f (t)2 + D i g(t)2 dt . × pi−1 (t) dt a

i=1

(3.3.3)

a

R EMARK 3.3.1. In the special case when D i f = D i g, the inequalities established in Theorem 3.3.1 reduce to the new integral inequalities of the Wirtinger type studied by many authors in the literature (see [211]). In this special case, it is easy to observe from the inequalities in (3.3.1) and (3.3.3) that the following inequality  b  2 pi−1 (t)D i−1 f (t) dt a




b−a 4







b

 D i f (t)2 dt

b

pi−1 (t) dt a

 (3.3.4)

a

holds for i = 1, . . . , n, which in turn is a further generalization of the integral inequality established by Traple in [419, p. 160]. Further if we take D i g = D i f and n = 2, then inequality (3.3.2) reduces to the following integral inequality  b 2 2     p0 (t)f (t) + p1 (t)Df (t) dt a




 b 
 b 
2   1 Df (t)4 dt (b − a)4 2 p02 (t) dt 4 a a 
 b 
 b 4  2 2   p1 (t) dt D f (t) dt . (3.3.5) + a

a

277

3.3. Wirtinger–Opial-Type Integral Inequalities

The inequalities of the type (3.3.5) are considered by the authors in [18,211] by using a different technique. However, the bounds obtained on the right-hand side in (3.3.5) cannot be compared with the bound obtained in [18,211]. T HEOREM 3.3.2. Let pi−1 , f, g be as in Theorem 3.3.1. Then the following inequalities hold 

n b

 2  2 pi−1 (t)D i−1 f (t) D i−1 g(t) dt

a i=1


 1 1 2 (b − a)3  2 4  
 b n
 b  4  i 4   i     D f (t) + D g(t) dt , × pi−1 (t) dt i=1



n b

a

(3.3.6)

a

 2  2 pi−1 (t)D i−1 f (t) D i−1 g(t) dt

2

a i=1




 n 1 4 (b − a)8 2 4  
 b n
 b  8  i 8   i 2     D f (t) + D g(t) dt , × pi−1 (t) dt i=1

n
  i=1



b

a

(3.3.7)

a

 2  2 pi−1 (t)D i−1 f (t) D i−1 g(t) dt



a


n
2n 1 1 (b − a)3n 2 4  
 b n
 b  4  i 4   i     D f (t) + D g(t) dt . × pi−1 (t) dt i=1

a

(3.3.8)

a

R EMARK 3.3.2. In the special case when D i g = D i f , the inequalities in (3.3.6)–(3.3.8) reduce to the new inequalities. In this special case, it is easy to observe from inequalities (3.3.6) and (3.3.8) that the following inequality 

b a

 4 pi−1 (t)D i−1 f (t) dt 


2 1 (b − a)3 4

278

Chapter 3. Opial-Type Inequalities







b

×

 D i f (t)4 dt

b

pi−1 (t) dt a

 (3.3.9)

a

holds for i = 1, . . . , n. T HEOREM 3.3.3. Let pi−1 , f, g be as in Theorem 3.3.1. Then the following inequalities hold 

n b

      pi−1 (t) D i−1 f (t)D i g(t) + D i−1 g(t)D i f (t) dt

a i=1



 n

 b−a 4

i=1




b a

1/2 2 pi−1 (t) dt

    D i f (t)2 + D i g(t)2 dt

b 

×

 ,

(3.3.10)

a



n b

2  2  2  2   pi−1 (t) D i−1 f (t) D i g(t) + D i−1 g(t) D i f (t) dt

a i=1



n

2  1

4

i=1


 (b − a)3 a




b

1/2 2 pi−1 (t) dt

    D i f (t)4 + D i g(t)4 dt

b 

×

 .

(3.3.11)

a

R EMARK 3.3.3. We note that, for n = 1, the inequality established in (3.3.10) reduces to the inequality established by Pachpatte in [243]. In the special case when D i f = D i g, the inequalities established in (3.3.10) and (3.3.11) reduce to the Opial-type integral inequalities. P ROOFS OF T HEOREMS 3.3.1–3.3.3. From the hypotheses, for every t ∈ I and i = 1, . . . , n, we have  D

i−1

f (t) =

t

 i

D f (s) ds,

D

i−1

f (t) = −

a

 D

i−1

g(t) =

t

 i

D g(s) ds, a

D

i−1

b

D i f (s) ds, (3.3.12)

t

g(t) = − t

b

D i g(s) ds.

(3.3.13)

279

3.3. Wirtinger–Opial-Type Integral Inequalities

From (3.3.12) and (3.3.13), we observe that  b    i  i−1 D f (t) dt, D f (t)  1 2 a  b  i−1    i D g(t)  1 D g(t) dt, 2 a

(3.3.14) (3.3.15)

for i = 1, . . . , n. From (3.3.14) and (3.3.15), and using the elementary inequality cd  12 (c2 + d 2 ) (for c, d reals) and Schwarz inequality, we obtain n 

   pi−1 (t)D i−1 f (t)D i−1 g(t)

i=1




 b 
 b n    i  i 1 D f (t) dt D g(t) dt pi−1 (t) 4 a a i=1

2
 b 2
 b n    i  i 1 1     D f (t) dt + D g(t) dt  pi−1 (t) 4 2 a a i=1
 1 b−a  2 4 
 b n  2  i 2   i     D f (t) + D g(t) dt . × (3.3.16) pi−1 (t) a

i=1

Integrating both sides of (3.3.16) from a to b we obtain the desired inequality in (3.3.1). Taking the square on both sides of inequality (3.3.1) and using the elementary inequality (c1 + · · · + cn )2  n(c12 + · · · + cn2 ) (for c1 , . . . , cn reals), Schwarz inequality, and the elementary inequality (c + d)2  2(c2 + d 2 ) (for c, d reals), we obtain 2  n b  i−1  i−1      pi−1 (t) D f (t) D g(t) dt a i=1


2
2 1 1 (b − a)2 2 4 2 2
 b n
 b  2  i 2   i     D f (t) + D g(t) dt × pi−1 (t) dt

n

i=1

a

a

280

Chapter 3. Opial-Type Inequalities


2
2 1 1 n (b − a)4 2 4 
 b  n
 b       i 2 D f (t)2 + D i g(t)2 2 dt × pi−1 (t) dt i=1

a

i=1

a

a


 n 1 2 (b − a)4  2 4  
 b n
 b  4  i 4   i 2     D f (t) + D g(t) dt . × pi−1 (t) dt a

The proof of inequality (3.3.20) is complete. From (3.3.14) and (3.3.15), and using the elementary inequality cd  12 (c2 + d 2 ) (for c, d reals) and Schwarz inequality, we obtain, for i = 1, . . . , n, 

b

   pi−1 (t)D i−1 f (t)D i−1 g(t) dt

a

1  4







b

 D i f (t) dt

b

pi−1 (t) dt a




a

 D i g(t) dt

b



a

2
 b 2 
 b    i  i 1 1     D f (t) dt + D g(t) dt  pi−1 (t) dt 4 a 2 a a

 b  
 b 2  i 2   i 1 b−a     D f (t) + D g(t) dt .  pi−1 (t) dt 2 4 a a (3.3.17)


b

From (3.3.17) we have n
  i=1

b

   pi−1 (t)D i−1 f (t)D i−1 g(t) dt



a


n
 1 b−a n  2 4
  
 b n b  2  i 2   i     D f (t) + D g(t) dt , × pi−1 (t) dt i=1

a

a

which is the desired inequality in (3.3.3) and the proof of Theorem 3.3.1 is complete. 

281

3.3. Wirtinger–Opial-Type Integral Inequalities

From (3.3.14), (3.3.15) and using Schwarz inequality, we observe that
  b   i 1 D f (t)2 dt, (b − a) 4 a
  b    i  i−1 D g(t)2 dt, D g(t)2  1 (b − a) 4 a

  i−1 D f (t)2 

(3.3.18) (3.3.19)

for i = 1, . . . , n. Now, from (3.3.18) and (3.3.19), and following exactly the same arguments as in the proof of inequality (3.3.1) in Theorem 3.3.1, we obtain the desired inequality in (3.3.6). The details of the proofs of inequalities (3.3.7) and (3.3.8) follow from (3.3.18) and (3.3.19), and following exactly the same arguments as in the proofs of inequalities (3.3.2) and (3.3.3) given in Theorem 3.3.1 and hence we omit further details. By virtue of Schwarz inequality, the inequality (3.3.4) and the elementary inequality c1/2 d 1/2  12 (c + d) (for c, d
0, reals), we observe that 

n b

      pi−1 (t) D i−1 f (t)D i g(t) + D i−1 g(t)D i f (t) dt

a i=1



n
  a

i=1

+

b

 2 2 pi−1 (t)D i−1 f (t) dt

n
 


 n

 b−a 4

i=1


 ×



a

b

1/2


 D i g(t)2 dt

b

1/2

 D i f (t)2 dt

b

1/2

a


 2 pi−1 (t) dt

 D i g(t)2 dt

b a

2 2 pi−1 (t)D i−1 g(t) dt

a

i=1





b

1/2


 D i f (t)2 dt

b

1/2

a

1/2

a

+


 n

 b−a 4

i=1


 × a

a

b


 2 pi−1 (t) dt

 D i f (t)2 dt

b

1/2

a

 D i g(t)2 dt

b

1/2

282

Chapter 3. Opial-Type Inequalities

=2

 n

 b−a 4

i=1


 ×

b

a

1/2 2 pi−1 (t) dt

 D i f (t)2 dt

b

1/2


a



1/2

a

 n

 b−a 4

i=1

 D i g(t)2 dt

b

1/2


b

2 pi−1 (t) dt

a

    D i f (t)2 + D i g(t)2 dt

b 

 ,

a

which is the desired inequality in (3.3.10). The details of the proof of inequality (3.3.11) follow by the same argument as in the proof of inequality (3.3.10) given above by using inequality (3.3.9) in place of inequality (3.3.4). We omit the details. In [241] Pachpatte has established the inequalities in the following theorem. T HEOREM 3.3.4. Let p(t) be a real-valued nonnegative continuous function defined on I = [0, b]. Let f ∈ C (n−1) (I ) with D r−1 f (t) absolutely continuous for t ∈ I and D r−1 f (0) = D r−1 f (b) = 0, for r = 1, . . . , n. Then the following inequalities hold  n 2/n  b   D r−1 f (t) p(t) dt 0

r=1

b  4n 

b




n    r−1 D f (t)2 p(t)

1 n

r=1




×

0

0





b

   b   n 2  r   D f (t) p(t) dt dt ,

0

0



b

(3.3.20)

r=1

2/n

dt



b

p(t) dt 

0

n
 



r=1

 D r−1 f (t)2 dt

b

0

n    r−1 D f (t) p(t) r=1




 D r f (t)2 dt

b

  ,

(3.3.21)

0

1/n 

 n    r D f (t) dt r=1

 
 b 1/2  b   n   b 2 D r f (t) dt .  p 2 (t) dt 4 0 0 r=1

(3.3.22)

283

3.3. Wirtinger–Opial-Type Integral Inequalities

R EMARK 3.3.4. In the special cases when n = 1 and n = 2, the inequalities established in Theorem 3.3.4 reduces to Wirtinger- and Opial-type inequalities, see [241]. P ROOF OF T HEOREM 3.3.4. From the hypotheses we have the following identities  t r−1 D r f (s) ds, (3.3.23) D f (t) = 0



D r−1 f (t) = −

b

D r f (s) ds,

(3.3.24)

t

for t ∈ I and r = 1, . . . , n. From (3.3.23) and (3.3.24), we obtain  b    r  r−1 D f (t) dt D f (t)  1 2 0

(3.3.25)

for t ∈ I and r = 1, . . . , n. From (3.3.25) and using the elementary inequalities 

n 

1/n ai

1 ai n n



i=1

(3.3.26)

i=1

(for a1 , . . . , an
0 reals and n
1) and  n 2 n   ai  n ai2 i=1

(3.3.27)

i=1

(for a1 , . . . , an reals) and Schwarz inequality, we obtain 

n    r−1 D f (t) r=1

2/n

1/n 2
n 2/n   n
 b   r 1 D f (t) dt  2 0 r=1

2   n   1 1  b  r D f (t) dt  4 n 0 r=1  n
 2  b   1 r D f (t) dt  2 n 4n 0 r=1   b  n 2  r b D f (t) dt.  4n 0 r=1

(3.3.28)

284

Chapter 3. Opial-Type Inequalities

Multiplying (3.3.28) by p(t) and integrating the resulting inequality from 0 to b we obtain the desired inequality in (3.3.20). From the hypotheses, we have the following identities  t  r−1 2 D f (t) = 2 D r−1 f (s)D r f (s) ds, (3.3.29) 0

 r−1 2 D f (t) = −2



b

D r−1 f (s)D r f (s) ds,

(3.3.30)

t

for t ∈ I and r = 1, . . . , n. From (3.3.29) and (3.3.30), we obtain  b  r−1     r−1 D f (t)2  D f (t)D r f (t) dt

(3.3.31)

0

for t ∈ I and r = 1, . . . , n. From (3.3.31) and using inequalities (3.3.26), (3.3.27) and Schwarz inequality, we obtain  n 2/n  n
 1/n 2 b   2  r  r−1 r−1 D f (t) D f (t)D f (t) dt  r=1

0

r=1

2 n   r  1  b  r−1 D f (t)D f (t) dt  n 0 r=1  n
 2  b   r  1 r−1     D f (t) D f (t) dt  2 n n 0 

r=1



1 n

n
 b  

 D r−1 f (t)2 dt




0

r=1

 D r f (t)2 dt

b

 .

0

(3.3.32) Multiplying both sides of (3.3.32) by p(t) and integrating the resulting inequality from 0 to b we obtain the desired inequality in (3.3.21). By using Schwarz inequality and inequalities (3.3.20) and (3.3.27), we observe that  n 1/n  n   b     D r−1 f (t) D r f (t) dt p(t) 0

r=1



b

 0



p 2 (t)

r=1 n  r=1

  r−1 D f (t)

2/n

1/2   b

dt 0

n    r D f (t) r=1

2

1/2 dt

285

3.3. Wirtinger–Opial-Type Integral Inequalities

 

b 4n




b

 1/2  b   n   2 D r f (t) dt p 2 (t) dt

0



b

×

0



n 

n 0

r=1



  r D f (t)2 dt

1/2

r=1

 
 b 1/2  b   n 2  r b 2   D f (t) = p (t) dt dt . 4 0 0 r=1

This result is the desired inequality in (3.3.22). The proof is complete.



In [51] Calvert established the following inequalities by using the method of Olech [230]. T HEOREM 3.3.5. Let u be absolutely continuous on (a, b) with u(a) = 0, where −∞  a < b < ∞. Let f (t) be a continuous complex-valued

sfunction defined for all t in the range of u and for all real t of the form t (s) = a |u
(s)| ds. Suppose that |f (t)|  f (|t|) for all t, and that f (t1 )  f (t2 ) for 0  t1  t2 . Let r be

b positive, continuous, and a r 1−q (t) dt < ∞, where 1/p + 1/q = 1, p > 1. Let

s F (s) = 0 f (σ ) dσ , s > 0. Then the following inequality holds 

   f u(t) u
(t) dt

b

a



 F

1/q


b

r

1−q

(t) dt

a

b

 p r(t)u
(t) dt

1/p  ,

(3.3.33)

a

t with equality if and only if u(t) = A a r 1−q (s) ds. The same result (but with

b 1−q equality for u(t) = t r (s) ds) holds if u(b) = 0 and −∞ < a < b  ∞, where A is a constant. P ROOF. Let z(t) = that 

t a

|u
(s)| ds, t ∈ (a, b). Then z
(t) = |u
(t)|, and it follows 
 t   

f u (s) ds u (t) dt  a a   b
  t    
  f  u (s) ds  u
(t) dt

   f u(t) u
(t) dt =

b a



a

b

a

286

Chapter 3. Opial-Type Inequalities






b



t

f a



a b

=

   
 u (s) ds u
(t) dt

    f z(t) z
(t) dt = F z(b) .

(3.3.34)

a

Now, using Hölder’s inequality with indices p, q, we get 

 u
(t) dt

b

z(b) = 

a b

=

r −1/p (t)r 1/p (t)z
(t) dt

a


 

b

1/q
 r 1−q (t) dt

a

b

r(t)z
(t)p dt

1/p .

(3.3.35)

a

Inequality (3.3.33) now follows from (3.3.34) and (3.3.35) and the fact that F is nondecreasing.  R EMARK 3.3.5. Let f (t) = t p−1 , p > 1, u(a) = 0, −∞  a < b < ∞. Then 

 up−1 (t)u
(t) dt  1 p

b

a




p−1 

b

r

1−q

b

(t) dt

a

 p r(t)u
(t) dt.

a

T HEOREM 3.3.6. Let u and v be absolutely continuous functions on (a, b) with u(a) = v(a) = 0, where −∞  a < b < ∞. Let r(t) and s(t) be positive, con b

b tinuous functions on (a, b) and a (r(t))−2 dt < ∞, a (s(t))−2 dt < ∞. Then the following inequality holds 

   u(t)v
(t) + v(t)u
(t) dt

b  a

  a

b

−2 r(t) dt



b

−2 s(t) dt



a

b a

 2 r 2 (t)u
(t) dt



b

 2 s 2 (t)v
(t) dt

1/2 ,

a

(3.3.36) with equality if and only if u(t) = A where A, B are constants.

b a

(r(t))−2 dt and v(t) = B

b a

(s(t))−2 dt,

t

t P ROOF. Let x(t) = a |u
(σ )| dσ and y(t) = a |v
(σ )| dσ , then x
(t) = |u
(t)|

t and y
(t) = |v
(t)|. It is easy to observe that |u(t)| = | a u
(σ ) dσ | 

287

3.3. Wirtinger–Opial-Type Integral Inequalities

b a

|u
(σ )| dσ = x(t) and |v(t)|  y(t). Thus, it follows that 

   u(t)v
(t) + v(t)u
(t) dt 

b 

a

 

b

 x(t)y
(t) + y(t)x
(t) dt

a

 d x(t)y(t) dt dt

b

= a

= x(b)y(b), where 

  −1 r(t) r(t)u
(t) dt

b

x(b) = a




b

−2 r(t) dt



1/2


a

2 2  r(t) u
(t) dt

b

1/2

a

and 

  −1 s(t) s(t)v
(t) dt

b

y(b) = a




b

−2 s(t) dt

 a

1/2


2 2  s(t) v
(t) dt

b

1/2 .

a

Inequality (3.3.36) now follows immediately from the above obtained inequalities.  R EMARK 3.3.6. If we take v(t) = u(t) and r(t) = s(t) = 1 in (3.3.36), then we get the following inequality  a

 u(t)u
(t) dt  b − a 2

b



 u
(t)2 dt.

b

a

In [283] Pachpatte has established the following inequality. T HEOREM 3.3.7. Let ur , r = 1, . . . , m, be absolutely continuous functions defined on [a, b] with ur (a) = ur (b) = 0. Let gr (u), r = 1, . . . , m, be continuous functions

s range of ur and for all real t of the form

s defined for all u in the t (s) = a |u
r (σ )| dσ or t (s) = b |u
r (σ )| dσ ; |gr (u)|  gr (|u|) for all u and

288

Chapter 3. Opial-Type Inequalities

gr (u1 )  gr (u2 ) for 0  u1  u2 . Then for every c ∈ (a, b), the following inequality holds  b  m     gr ur (t) u
(t)

1/m

dt

r

a

r=1



 
 c
 b m 
 
 1 u (t) dt + Gr u (t) dt , Gr r r m a c

(3.3.37)

i=1

where Gr (u) =

u 0

gr (t) dt for u > 0 and r = 1, . . . , m.

P ROOF. Let c ∈ [a, b] and define 

t

zr (t) =


 u (s) ds

(3.3.38)

 u
(s) ds

(3.3.39)

r

0

for a  t  c and r = 1, . . . , m and 

b

vr (t) =

r

t

for c  t  b and r = 1, . . . , m. From (3.3.38) and (3.3.39), we have   zr
(t) = u
r (t)

(3.3.40)

for a  t  c and r = 1, . . . , m and   vr
(t) = −u
r (t)

(3.3.41)

for c  t  b and r = 1, . . . , m. We note that 

t

ur (t) = a

u
r (s) ds

(3.3.42)

for a  t  c and r = 1, . . . , m and  ur (t) = − t

b

u
r (s) ds

(3.3.43)

for c  t  b and r = 1, . . . , m. From the hypotheses, the arithmetic mean– geometric mean inequalities (3.3.26), (3.3.42), (3.3.40) and (3.3.38) we observe

289

3.3. Wirtinger–Opial-Type Integral Inequalities

that  c  m     gr ur (t) u
(t) r a

1/m

dt

r=1

1 m



1  m



1 m



1 m



m



   gr ur (t) u
(t) dt r

c

r=1 a m




c

gr

r=1 a m

=

a c

r=1 a m

=

t

   
 u (s) ds u
(t) dt r r

  gr zr (t) zr
(t) dt

zr (c)

gr (t) dt

r=1 0

=

m  1  Gr zr (c) m r=1

1 Gr m m

=

r=1




  u
(t) dt . r

c

a

(3.3.44)

Similarly, from the hypotheses and inequalities (3.3.26), (3.3.43), (3.3.41) and (3.3.39), we have  b  m     gr ur (t) u
(t) c

1/m

r

r=1

1 dt  Gr m m

r=1


 c

  u
(t) dt . (3.3.45) r

b

The desired inequality in (3.3.37) follows from (3.3.44) and (3.3.45) and the proof is complete.  R EMARK 3.3.7. In the special case when m = 1, inequality (3.3.37) reduces to  
 c
 b  b    
 
  g1 u1 (t) u
(t) dt  G1 u (t) dt + G1 u (t) dt 1 1 1 a

a

c

(3.3.46) for c ∈ [a, b]. Inequality (3.3.46) is a variant of the inequality due to Calvert given u in Theorem 3.3.5. On taking g1 (t) = t and hence G1 (u) = 0 σ dσ = u2 /2 and

290

Chapter 3. Opial-Type Inequalities

c = (a + b)/2 in (3.3.46) and using Schwarz inequality on the right-hand side of the resulting inequality, we obtain Opial’s inequality given in (3.2.1).

3.4 Inequalities Related to Opial’s Inequality Opial’s inequality given in (3.2.1) or its generalizations and variants have many important applications in the theory of differential equations. In the past few years many authors have obtained various useful generalizations and extensions of this inequality. In this section we offer some basic inequalities established by Pachpatte in [239,303], which claim their origin in Opial’s inequality. In [239] Pachpatte has established the inequalities in the following theorems which deal with the Opial-type integral inequalities involving two functions and their first-order derivatives. T HEOREM 3.4.1. Let p(t) be positive and continuous function on a finite or infi b nite interval a < t < b such that a p −1 (t) dt < ∞. If u(t) and v(t) are absolutely continuous functions on (a, b) and u(a) = u(b) = 0, v(a) = v(b) = 0, then 

   u(t)v
(t) + v(t)u
(t) dt  1 A 2

b 

a

where

 A=

c

p

−1



b

(t) dt =

a



b

2  2   p(t) u
(t) + v
(t) dt, (3.4.1)

a

p −1 (t) dt,

a  c  b.

(3.4.2)

c

Equality holds in (3.4.1) if and only if  u(t) = v(t) = M

t

p −1 (s) ds,

a  t  c,

p −1 (s) ds,

c  t  b,

a

 u(t) = v(t) = M

b

t

where M is a constant. R EMARK 3.4.1. In the special case when u(t) = v(t), Theorem 3.4.1 reduces to the inequality established by Yang [428, Theorem 1] which in turn contains as a special case Opial’s inequality given in Theorem 3.2.1. T HEOREM 3.4.2. Let p(t) be positive and continuous function on an interval a  c t  c with a p −1 (t) dt < ∞, and let q(t) be bounded, positive, continuous and

291

3.4. Inequalities Related to Opial’s Inequality

nonincreasing function on a  t  c. If u(t) and v(t) are absolutely continuous functions on a  t  c and u(a) = v(a) = 0, then  c     q(t) u(t)v
(t) + v(t)u
(t) dt a



1 2



c

p −1 (t) dt



a

c

2  2   p(t)q(t) u
(t) + v
(t) dt,

a

with equality if and only if q(t) = constant and u(t) = v(t) = M a  t  c, where M is a constant.

t a

(3.4.3)

p −1 (s) ds for

T HEOREM 3.4.3. Let p(t) be positive and continuous function on an interval

b c  t  b with c p −1 (t) dt < ∞, and let q(t) be bounded, positive, continuous and nondecreasing function on c  t  b. If u(t) and v(t) are absolutely continuous functions on c  t  b and u(b) = v(b) = 0, then  b     q(t) u(t)v
(t) + v(t)u
(t) dt c

1  2



b

p

−1



b

(t) dt

c

2  2   p(t)q(t) u
(t) + v
(t) dt,

(3.4.4)

c

with equality if and only if q(t) = constant and u(t) = v(t) = M c  t  b, where M is a constant.

b t

p −1 (s) ds for

R EMARK 3.4.2. In the special case when u(t) = v(t), Theorems 3.4.2 and 3.4.3 reduce to Theorems 3 and 3
given in [428]. T HEOREM 3.4.4. If u(t) and v(t) are absolutely continuous functions on a  t  b with u(a) = u(b) = 0, v(a) = v(b) = 0, then  b       u(t)v(t)m u(t)v
(t) + v(t)u
(t) dt a

(b − a)2m+1  2(m+1) 2 (m + 1)



    u
(t)2(m+1) + v
(t)2(m+1) dt,

b 

a

where m
0 is a constant. Equality holds in (3.4.5) if and only if u(t) = v(t) = M(t − a),

a  t  c,

u(t) = v(t) = M(b − t),

c  t  b,

where M is a constant.

(3.4.5)

292

Chapter 3. Opial-Type Inequalities

R EMARK 3.4.3. It is interesting to note that, in the special case when u(t) = v(t) and 2m + 1 = n, Theorem 3.4.4 reduces to the inequality established by Yang [428, Theorem 4] which in itself contains as a special case Opial’s inequality when n = 1, a = 0 and b = h. P ROOFS OF T HEOREMS 3.4.1–3.4.4. Let c ∈ [a, b] and define  t  t 
 
 u (s) ds, v (s) ds z(t) = y(t) = a

(3.4.6)

a

for a  t  c and  r(t) = −

 u
(s) ds,

b

 w(t) = −

t

 v
(s) ds

b

(3.4.7)

t

for c  t  b, then we have

for a  t  c and

  y
(t) = u
(t),

  z
(t) = v
(t)

(3.4.8)

  r
(t) = u
(t),

  w
(t) = v
(t)

(3.4.9)

for c  t  b. We note that  t u(t) = u
(s) ds, a

 v(t) =

t

v
(s) ds

(3.4.10)

a

for a  t  c and  u(t) = −

b

u
(s) ds,

t

 v(t) = −

b

v
(s) ds

(3.4.11)

t

for c  t  b. From (3.4.10) and (3.4.6) and (3.4.11) and (3.4.7), we observe that     v(t)  z(t) u(t)  y(t), (3.4.12) for a  t  c and

  u(t)  −r(t),

  v(t)  −w(t)

(3.4.13)

for c  t  b. Now, from (3.4.12), (3.4.8), and upon using the elementary inequality  1 αβ  α 2 + β 2 for α, β reals, (3.4.14) 2

293

3.4. Inequalities Related to Opial’s Inequality

the definitions of y(t) and z(t) given in (3.4.6) and Schwarz inequality, we have  c     u(t)v
(t) + v(t)u
(t) dt a



c

 y(t)z
(t) + z(t)y
(t) dt

 a

 =

a

c

 d y(t)z(t) dt dt

= y(c)z(c)  1  y 2 (c) + z2 (c) 2 2
 c
2  
 c
      1 1 1 = p(t)u
(t) dt + p(t)v
(t) dt √ √ 2 p(t) p(t) a a  c  c 2  2   1  (3.4.15) p −1 (t) dt p(t) u
(t) + v
(t) dt. 2 a a Similarly, from (3.4.13), (3.4.9) and upon using the elementary inequality (3.4.14), the definitions of r(t) and w(t) given in (3.4.7) and Schwarz inequality, we have 

   u(t)v
(t) + v(t)u
(t) dt

b 

c

1  2



b

p

−1



b

(t) dt

c

2  2   p(t) u
(t) + v
(t) dt.

(3.4.16)

c

From (3.4.15), (3.4.16) and the definition of A given in (3.4.2), the desired inequality in (3.4.1) follows. The proof of Theorem 3.4.1 is complete. Let c ∈ [a, b] and define  t  t 
     z(t) = (3.4.17) y(t) = q(s) u (s) ds, q(s)v
(s) ds a

for a  t  c and  b   r(t) = − q(s)u
(s) ds, t

for c  t  b, then we have    y
(t) = q(t)u
(t),

a

 w(t) = −

b

  q(s)v
(s) ds

(3.4.18)

t

z
(t) =



  q(t)v
(t)

(3.4.19)

294

Chapter 3. Opial-Type Inequalities

for a  t  c and r
(t) =



  q(t)u
(t),

w
(t) =



  q(t)v
(t)

(3.4.20)

for c  t  b. Now, from (3.4.10), (3.4.17), nonincreasing character of q(t) on a  t  c, in Theorem 3.4.2 and (3.4.11), (3.4.18), nondecreasing character of q(t) on c  t  b, in Theorem 3.4.3, we observe that

      u(t)  √ 1 v(t)  √ 1 y(t), z(t) (3.4.21) q(t) q(t) for a  t  c and


   u(t)  − √ 1 r(t), q(t)


   v(t)  − √ 1 w(t) q(t)

(3.4.22)

for c  t  b, respectively. Now the proofs of Theorems 3.4.2 and 3.4.3 follow by closely looking at the proof of Theorem 3.4.1 given above with suitable modifications. We omit the details. From (3.4.8) and (3.4.12) and using the elementary inequality (3.4.14), the definitions of y(t) and z(t) given in (3.4.6), Schwarz inequality and Hölder’s inequality, we have  c       u(t)v(t)m u(t)v
(t) + v(t)u
(t) dt a

 

c

  y m (t)zm (t) y(t)z
(t) + z(t)y
(t) dt

c

d dt

a

 =

a




1 y m+1 (t)zm+1 (t) dt m+1



1 y m+1 (c)zm+1 (c) m+1  m+1 2  m+1 2  1 y  (c) + z (c) 2(m + 1) 2 m+1 
 c 2 m+1 
 c 
 
 1 u (t) dt v (t) dt + = 2(m + 1) a a  c 2m+1 
2(m+1) 
2(m+1)  (c − a) u (t)  dt. (3.4.23) + v (t) 2(m + 1) a =

Similarly, from (3.4.9), (3.4.13) and upon using the elementary inequality (3.4.14), the definitions of r(t) and w(t) given in (3.4.7), Schwarz inequality

295

3.4. Inequalities Related to Opial’s Inequality

and Hölder’s inequality, we obtain 

     u(t)v(t)m u(t)v
(t) + v(t)u
(t) dt

b

c



(b − c)2m+1 2(m + 1)



    u
(t)2(m+1) + v
(t)2(m+1) dt.

b 

(3.4.24)

c

Now taking c = (a + b)/2, we obtain the desired inequality in (3.4.5) from (3.4.23) and (3.4.24). In the following theorems we present some general inequalities similar to Opial’s inequality established by Pachpatte in [303]. In what follows, for the sake of brevity we write fi for fi (|ui (t)|), fi
for fi
(|ui (t)|), u
i for u
i (t), with t ∈ [a, b] and use the notation   L f1 , . . . , fn , f1
, . . . , fn
, u
1 , . . . , u
n   = f1 · · · fn−1 fn
u
n     

un−1 fn + · · · + f1
u
1 f2 · · · fn , n
2. + f1 · · · fn−2 fn−1 T HEOREM 3.4.5. Let ui (t), i = 1, . . . , n, be real-valued absolutely continuous functions on [a, b] with ui (a) = 0. Let fi (r), i = 1, . . . , n, be real-valued nonnegative continuous nondecreasing functions for r
0 and fi (0) = 0 such that fi
(r) exist, nonnegative, continuous and nondecreasing for r
0. Then, the following inequality holds 

b

a

n    L f1 , . . . , fn , f1
, . . . , fn
, u
1 , . . . , u
n dt  fi i=1




  u
(t) dt . i

b a

(3.4.25) Inequality (3.4.25) also holds if we replace the condition ui (a) = 0 by ui (b) = 0. As an immediate consequence of Theorem 3.4.5 we have the following result. T HEOREM 3.4.6. Assume that in the hypotheses of Theorem 3.4.5 we have ui = u and fi = f . Then  a

b

n 
 b n−1
   
  1 u (t) dt f f u(t) f u(t) u
(t) dt  . n a

(3.4.26)

Inequality (3.4.26) also holds if we replace the condition u(a) = 0 by u(b) = 0.

296

Chapter 3. Opial-Type Inequalities

R EMARK 3.4.4. If we take n = 2 in (3.4.26), then we get the following inequality 2 
 b  b     
  1 u (t) dt f f u(t) f
u(t) u
(t) dt  , (3.4.27) 2 a a which is analogous to the inequality given in [130]. Further, by taking f (r) = r m+1 in (3.4.27), m
0 is a constant, and using Hölder’s inequality with indices 2(m + 1) and 2(m + 1)/(2m + 1) to the resulting integral on the right-hand side, we see that (3.4.27) reduces to the following inequality  b 2m+1  b       u(t)2m+1 u
(t) dt  (b − a) u
(t)2(m+1) dt, (3.4.28) 2(m + 1) a a which reduces to the form of Opial’s inequality given in [211, Theorem 2
, p. 154] when m = 0. A slightly different version of the inequality given in Theorem 3.4.5 is embodied in the following theorem. T HEOREM 3.4.7. Let ui , fi , fi
be as in Theorem 3.4.5. Let pi (t) > 0 be defined

b on [a, b] and a pi (t) dt = 1, i = 1, . . . , n. If h(r) is a positive, convex and increasing function for r > 0, then  b   L f1 , . . . , fn , f1
, . . . , fn
, u
1 , . . . , u
n dt a



n  i=1




−1




fi h

a

b

 

|ui (t)| dt . pi (t)h pi (t)

(3.4.29)

Inequality (3.4.29) also holds if we replace the condition ui (a) = 0 by ui (b) = 0. The following result is an easy consequence of Theorem 3.4.7. T HEOREM 3.4.8. Assume that in the hypotheses of Theorem 3.4.7 we have ui = u, fi = f and pi = p. Then  b n−1
     f u(t) f u(t) u
(t) dt a




 b 
 n

1 |u (t)| f h−1 dt p(t)h . n p(t) a

(3.4.30)

Inequality (3.4.30) also holds if we replace the condition u(a) = 0 by u(b) = 0.

297

3.4. Inequalities Related to Opial’s Inequality

R EMARK 3.4.5. If we take n = 2 in (3.4.30), then we get the following inequality 

b

a

     f u(t) f
u(t) u
(t) dt


 b 
 2

1 |u (t)| −1  f h dt p(t)h . 2 p(t) a

(3.4.31)

We also note that in the special cases inequality (3.4.31) yields the various inequalities as discussed in Remark 3.4.4. P ROOFS OF T HEOREMS 3.4.5–3.4.8. Let t ∈ [a, b] and define  t 
 u (s) ds, i = 1, . . . , n, zi (t) =

(3.4.32)

a

implying

  zi
(t) = ui (t),

t ∈ [a, b], i = 1, . . . , n.

(3.4.33)

For t ∈ [a, b] we have the following identities  t ui (t) = u
i (s) ds, i = 1, . . . , n.

(3.4.34)

From (3.4.34) and (3.4.32), we observe that   ui (t)  zi (t), i = 1, . . . , n.

(3.4.35)

a

Using (3.4.35), (3.4.33) and (3.4.32) we get 

b a

  L f1 , . . . , fn , f1
, . . . , fn
, u
1 , . . . , u
n dt 

b



      f1 z1 (t) · · · fn−1 zn−1 (t) fn
zn (t) zn
(t)

a

    
 
 + f1 z1 (t) · · · fn−2 zn−2 (t) fn−1 zn−1 (t) zn−1 (t)fn zn (t)       + · · · + f1
z1 (t) z1
(t)f2 z2 (t) · · · fn zn (t) dt  = a

b

  n  d   fi zi (t) dt dt i=1

298

Chapter 3. Opial-Type Inequalities

=

n 

  fi zi (b)

i=1

=

n 




  u
(t) dt , i

b

fi a

i=1

b being the required inequality in (3.4.25). Defining zi (t) = t u
i (s) ds in case of ui (b) = 0, then observing that |ui (t)|  zi (t), similarly as above, we get (3.4.25). The proof of Theorem 3.4.5 is complete.  From the hypotheses of Theorem 3.4.7, we observe that  a

 u
(t) dt =

b



b

pi (t)

i

a

|u
i (t)| dt pi (t)



−1

b

pi (t) dt

,

i = 1, . . . , n.

a

(3.4.36) Since h is convex, from (3.4.36) and using Jensen’s inequality [174, p. 113], we obtain   b 
 b


 |ui (t)| u (t) dt  dt (3.4.37) h p (t)h i i pi (t) a a which implies  a

 u
(t) dt  h−1

b

i


 a

b

 

|ui (t)| dt . pi (t)h pi (t)

(3.4.38)

All the hypotheses of Theorem 3.4.5 being satisfied we get (3.4.25). Using (3.4.38) in (3.4.25), we obtain the required inequality in (3.4.29). The proof of Theorem 3.4.7 is complete.  We omit the proofs of Theorems 3.4.6 and 3.4.8 being immediate from those of Theorems 3.4.5 and 3.4.7.

3.5 General Opial-Type Integral Inequalities Since its discovery in 1960, Opial’s integral inequality has been generalized in various directions by several authors. In this section we shall give the inequalities established by Godunova and Levin [130], Rozanova [399] and Pachpatte [346] which contain as special cases many known generalizations of Opial’s integral inequality given by other investigators. In 1967, Godunova and Levin [130] established the following inequalities.

299

3.5. General Opial-Type Integral Inequalities

T HEOREM 3.5.1. Let u(t) be real-valued absolutely continuous function defined on [a, b] with u(a) = 0. Let F be real-valued convex, increasing function on [0, ∞) with F (0) = 0. Then the following inequality holds 

b

   F
u(t) u
(t) dt  F




a

  u
(t) dt .

b

(3.5.1)

a

t P ROOF. Define z(t) = a |u
(s)| ds, t ∈ [a, b]. Then z
(t) = |u
(t)| and |u(t)|  z(t). Thus, it follows that 

b



   F
u(t) u
(t) dt 

a

b

  F
z(t) z
(t) dt

a



 d  F z(t) dt a dt   = F z(b) 
 b 
   u (t) dt . =F =

b

a



The proof is complete.

R EMARK 3.5.1. By taking F (r) = r 2 and hence F
(r) = 2r in (3.5.1) and using Hölder’s inequality on the right-hand side of the resulting inequality, we get Opial’s inequality given in [211, Theorem 2
, p. 154]. T HEOREM 3.5.2. Let u(t) be real-valued absolutely continuous function defined on [a, b] with u(a) = u(b) = 0. Let F, g be real-valued convex and increasing functions on [0, ∞) with F (0) = 0. Further, let p(t) be real-valued positive on

b [a, b] and a p(t) dt = 1. Then the following inequality holds 

b



 
  −1     F u(t) u (t) dt  2F g


a

b

a

  |u
(t)| dt . p(t)g 2p(t)


(3.5.2)

P ROOF. Let c ∈ (a, b), so that in the interval [a, c] the function u(t) satisfies the hypotheses of Theorem 3.5.1 and the following inequality holds  a

c

   F u(t) u
(t) dt  F



 a

  u
(t) dt .

c

(3.5.3)

300

Chapter 3. Opial-Type Inequalities

Next, in the interval [c, b] the function u(t) is absolutely continuous and u(b) = 0. By following the similar argument as in the proof of Theorem 3.5.1, we obtain 

b

   F u(t) u
(t) dt  F





c

  u
(t) dt .

b

(3.5.4)

c

If we choose c so that   c 
 u (t) dt = a

c

 u
(t) dt = 1 2

b



 u
(t) dt,

b

(3.5.5)

a

then a combination of (3.5.4) and (3.5.5) gives 


 b    
  1 u (t) dt . F
u(t) u
(t) dt  2F 2 a

b

a

(3.5.6)

Since g(t) is convex, by using Jensen’s inequality (see [174, p. 133]), we have
 b
g a

  b   b   b

|u
(t)| |u (t)| p(t) dt p(t) dt p(t) dt  g p(t) dt 2p(t) 2p(t) a a a

which in view of

b

1 2

a

p(t) dt = 1 and the increasing nature of g, implies

 a

 u
(t) dt  g −1

b







b

p(t)g a

  |u
(t)| dt . 2p(t)

(3.5.7)

Using the increasing behavior of F and (3.5.7) in (3.5.6), inequality (3.5.2) follows.  In 1972, Rozanova [399] obtained the following extension of the inequality given in Theorem 3.5.1. T HEOREM 3.5.3. Let u(t) be absolutely continuous on [a, b] and u(a) = 0. Let F, g be as in Theorem 3.5.2 and let p(t)
0, p
(t) > 0, t ∈ [a, b], with p(a) = 0. Then




 b  

 b |u(t)| |u (t)| |u (t)|


g dt  F dt . p (t)F p(t)g p (t)g p(t) p
(t) p
(t) a a (3.5.8) Moreover, equality holds in (3.5.8) for the function u(t) = cp(t), where c is a constant.

3.5. General Opial-Type Integral Inequalities

301

t P ROOF. Define z(t) = a |u
(s)| ds, t ∈ [a, b]. Then z
(t) = |u
(t)| and |u(t)|  z(t). Let t ∈ (a, b), then by using Jensen’s inequality (see [174, p. 133]), it follows that

 |u(t)| z(t) g g p(t) p(t)  t 
 t |u
(s)| ds p
(s)
p
(s) ds g p (s) a a

  t (s) z 1 ds. p
(s)g
 p(t) a p (s) Using the above inequality we obtain

 |u(t)| |u
(t)|
F p(t)g dt p (t)g p
(t) p(t) a


 t

   b z (t) z (s)


F ds dt  p (t)g
p (s)g
p (t) p (s) a a

   b
 t d z (s)
F ds dt = p (s)g
p (s) a dt a
 b

  z (t)
dt =F p (t)g
p (t) a  
 b

|u (t)|
dt , =F p (t)g p
(t) a



b







which is the same as (3.5.8). The proof is complete.



The following theorems deal with the generalized Opial-type integral inequalities established by Pachpatte in [346]. T HEOREM 3.5.4. Let ui , vi , i = 1, . . . , n, be real-valued absolutely continuous functions on I = [a, b], a, b ∈ R+ = [0, ∞), with ui (a) = vi (a) = 0, i = 1, . . . , n. Let F, G be real-valued nonnegative, continuous and nondecreasing functions on Rn+ with F (0, . . . , 0) = 0, G(0, . . . , 0) = 0 such that all their first-order partial derivatives Fi
, G
i , i = 1, . . . , n, are nonnegative, continuous and nondecreasing on Rn+ . Let φi , ψi , i = 1, . . . , n, be real-valued positive, convex and increasing functions on (0, ∞). Let ri (t)
0, ri
(t) > 0, ri (a) = 0, ei (t)
0, ei
(t) > 0,

302

Chapter 3. Opial-Type Inequalities

ei (a) = 0, i = 1, . . . , n. Then the following integral inequality holds

   b
|u1 (t)| |un (t)| F r1 (t)φ1 , . . . , rn (t)φn r1 (t) rn (t) a




   n  |vi (t)| |v1 (t)| |vn (t)|

, . . . , en (t)ψn ei (t)ψi × Gi e1 (t)ψ1 e1 (t) en (t) ei
(t) i=1



 
|v1 (t)| |vn (t)| , . . . , en (t)ψn + G e1 (t)ψ1 e1 (t) en (t)




   n  |ui (t)| |u1 (t)| |un (t)| , . . . , rn (t)φn ri
(t)φi dt × Fi
r1 (t)φ1 r1 (t) rn (t) ri
(t) i=1






    b |u
1 (t)| |un (t)|
r (t)φ dt, . . . , dt n n r1
(t) rn
(t) a a
 b



    b |v1 (t)| |vn (t)|
×G dt, . . . , dt . e1
(t)ψ1 e (t)ψ n n e1
(t) en
(t) a a

F

b

r1
(t)φ1




(3.5.9)

P ROOF. From the hypotheses on ui , vi , ri , ei , i = 1, . . . , n, we have    t    t
 
 ui (t) =   u (s) ds, u (s) ds i i   a

(3.5.10)

a

   t    t
 
 vi (t) =  v (s) ds, vi (s) ds   i  a a  t ri (t) = ri
(s) ds,

(3.5.11) (3.5.12)

a



t

ei (t) = a

ei
(s) ds,

(3.5.13)

for t ∈ I . From (3.5.10)–(3.5.13) and using the hypotheses on φi , ψi , i = 1, . . . , n, and Jensen’s inequality [174, p. 133], we obtain
φi

|ui (t)| ri (t)






 t  ri
(s)|u
i (s)|
ds r (s) ds i ri
(s) a a

  t |ui (s)| 1 ds  ri
(s)φi ri (t) a ri
(s)

 φi

t

(3.5.14)

303

3.5. General Opial-Type Integral Inequalities

and
ψi



|vi (t)| ei (t)




 t  ei
(s)|vi
(s)|
 ψi ds ei (s) ds ei
(s) a a

  t |vi (s)| 1
ds, e (s)ψi  ei (t) a i ei
(s) t

(3.5.15)

for t ∈ I . From (3.5.14), (3.5.15) and using the hypotheses F , Fi
, G, G
i , i = 1, . . . , n, we observe that

   b
|u1 (t)| |un (t)| , . . . , rn (t)φn F r1 (t)φ1 r1 (t) rn (t) a ×

n  i=1






   |vi (t)| |v1 (t)| |vn (t)| , . . . , en (t)ψn ei
(t)ψi G
i e1 (t)ψ1 e1 (t) en (t) ei
(t)



 
|v1 (t)| |vn (t)| , . . . , en (t)ψn + G e1 (t)ψ1 e1 (t) en (t)




   n  |u (t)| |u |u (t)| (t)| 1 n i × , . . . , rn (t)φn ri
(t)φi Fi
r1 (t)φ1 dt r1 (t) rn (t) ri
(t) i=1



    t  b 
 t |u1 (s)| |un (s)|
ds, . . . , ds r1
(s)φ1 r (s)φ F  n n r1
(s) rn
(s) a a a ×

n 

G
i




t a

i=1

× ei
(t)ψi




e1
(s)ψ1

|vi
(t)| ei
(t)






    t |v1
(s)| |vn (s)|
ds, . . . , ds e (s)ψ n n e1
(s) en
(s) a







  
 t  t |v1 (s)| |vn (s)|
ds, . . . , ds e1
(s)ψ1 e (s)ψ +G n n e1
(s) en
(s) a a ×

n 

Fi



 a

i=1

× ri
(t)φi

t




r1
(s)φ1

|u
i (t)| ri
(t)




 dt



    t |u
1 (s)| |un (s)|
ds, . . . , ds r (s)φ n n r1
(s) rn
(s) a

304

Chapter 3. Opial-Type Inequalities






 t     t |u1 (s)| |un (s)| d

F ds, . . . , ds = r1 (s)φ1 rn (s)φn r1
(s) rn
(s) a dt a a



  
 t  t |v1 (s)| |vn (s)|

ds, . . . , ds dt ×G e1 (s)ψ1 en (s)ψn e1
(s) en
(s) a a
 b



    b |u1 (t)| |un (t)|
=F dt, . . . , dt r1
(t)φ1 r (t)φ n n r1
(t) rn
(t) a a
 b



    b |v1 (t)| |vn (t)|
×G dt, . . . , dt . e1
(t)ψ1 e (t)ψ n n e1
(t) en
(t) a a 

b

The proof of inequality (3.5.9) is complete.



T HEOREM 3.5.5. Let ui , vi , F , Fi
, G, G
i , φi , ψi , i = 1, . . . , n, be as in Theorem 3.5.4. Let pi , qi , i = 1, . . . , n, be real-valued positive functions defined on

b

b I and a pi (t) dt = 1, a qi (t) dt = 1, i = 1, . . . , n. Let hi , wi , i = 1, . . . , n, be real-valued positive, convex, and increasing functions on (0, ∞). Then the following integral inequality holds

   b
|u1 (t)| |un (t)| , . . . , rn (t)φn F r1 (t)φ1 r1 (t) rn (t) a ×

n 

G
i

i=1






   |vi (t)| |v1 (t)| |vn (t)|
e1 (t)ψ1 , . . . , en (t)ψn ei (t)ψi e1 (t) en (t) ei
(t)



 
|v1 (t)| |vn (t)| , . . . , en (t)ψn + G e1 (t)ψ1 e1 (t) en (t)




   n  |ui (t)| |u1 (t)| |un (t)|

× , . . . , rn (t)φn ri (t)φi Fi r1 (t)φ1 dt r1 (t) rn (t) ri
(t) i=1




   |u1 (t)|  p1 (t) dt , p1 (t)h1 r1
(t)φ1 r1 (t) a
 b


   |un (t)| 
r p p (t)h (t)φ (t) dt . . . , h−1 n n n n n n rn (t) a
 b


  
|v1 (t)|  q q1 (t)w1 e1
(t)ψ1 (t) dt , × G w1−1 1 e1
(t) a
 b


   |vn (t)|  −1
qn (t) dt . (3.5.16) . . . , wn qn (t)wn en (t)ψn en
(t) a


 F h−1 1




b

3.5. General Opial-Type Integral Inequalities

305

P ROOF. From the assumptions, we write

  b |ui (t)|
dt ri (t)φi ri
(t) a

   b  b
|ui (t)| 
= pi (t)ri (t)φi pi (t) dt pi (t) dt, (3.5.17) ri
(t) a a

  b |ui (t)| dt ei
(t)ψi ri
(t) a

   b  b
|vi (t)|  = qi (t)ei
(t)ψi q (t) dt qi (t) dt, (3.5.18) i ei
(t) a a for i = 1, . . . , n. From (3.5.17), (3.5.18) and using the hypotheses on hi , wi , i = 1, . . . , n, and Jensen’s inequality [174, p. 133], we obtain
 b

  |ui (t)|
dt hi ri (t)φi ri
(t) a


   b |ui (t)| 
pi (t) dt, pi (t)hi ri (t)φi (3.5.19)  ri
(t) a
 b

  |vi (t)| wi ei
(t)ψi dt ei
(t) a


   b |vi (t)| 
qi (t) dt, qi (t)wi ei (t)ψi (3.5.20)  ei
(t) a for i = 1, . . . , n. From (3.5.19) and (3.5.20), we observe that

  b |ui (t)| dt ri
(t)φi ri
(t) a  
 b


 |ui (t)|  −1
 hi pi (t) dt , pi (t)hi ri (t)φi ri
(t) a

  b |vi (t)|
dt ei (t)ψi ei
(t) a
 b


   |vi (t)|   wi−1 q qi (t)wi ei
(t)ψi (t) dt , i ei
(t) a

(3.5.21)

(3.5.22)

for i = 1, . . . , n. Since all the hypotheses of Theorem 3.5.4 are among those of Theorem 3.5.5, we see that inequality (3.5.9) holds. Now using (3.5.21), (3.5.22)

306

Chapter 3. Opial-Type Inequalities

on the right-hand side of (3.5.9) we get the desired inequality in (3.5.16) and the proof is complete.  R EMARK 3.5.2. (i) In the special case when n = 1, the inequalities established in Theorems 3.5.4 and 3.5.5 reduce to the inequalities established by Pachpatte in [302]. (ii) If we take G = 1 and hence G
i = 0, i = 1, . . . , n, in (3.5.9) and (3.5.16), then we get the inequalities established by Peˇcari´c and Brneti´c in [377]. For a detailed discussion on the further special versions of the inequalities given in (3.5.9) and (3.5.16), see [302,346,399]. In [30] Bloom has established some Opial-type inequalities involving generalized Hardy operators. The results given in [30] are based on the observation made by Sinnamon in [409] and also as discussed by Bloom in [30, p. 28]. An operator T acting on R is called a Hardy operator, if T has the form  t Tf (t) = f (s) ds (3.5.23) a

for t ∈ I = [a, b], a, b ∈ R+ = [0, ∞), where f (t) is real-valued continuous function defined on I . We say that the function f (t) belongs to the class U if it can be represented in the form (3.5.23). We note that the results given below also hold, if the Hardy operator T has the form  b Tf (t) = f (s) ds (3.5.24) t

for t ∈ I , where f (t) is continuous function on I . The following theorems deal with the inequalities established by Pachpatte in [346]. T HEOREM 3.5.6. Let fi , gi ∈ U , i = 1, . . . , n, and F , Fi
, G, G
i , i = 1, . . . , n, be as in Theorem 3.5.4. Then the following integral inequality holds  b n           G
T g1 (t), . . . , T gn (t) gi (t) F Tf1 (t), . . . , Tfn (t) i

a

i=1

 n          
+ G T g1 (t), . . . , T gn (t) Fi Tf1 (t), . . . , Tfn (t) fi (t) dt
 F a

 f1 (t) dt, . . . ,

b

 a

i=1


 b     fn (t) dt G g1 (t) dt, . . . ,

b

a

  gn (t) dt .

b

a

(3.5.25)

307

3.5. General Opial-Type Integral Inequalities

P ROOF. From the hypotheses, it is easy to observe that    t   t     fi (s) ds, Tfi (t) =  fi (s) ds    a a    t    t    T gi (t) =  gi (s) ds, gi (s) ds    a

(3.5.26) (3.5.27)

a

for t ∈ I , i = 1, . . . , n. From (3.5.26), (3.5.27) and using the assumptions, we observe that  b n           G
T g1 (t), . . . , T gn (t) gi (t) F Tf1 (t), . . . , Tfn (t) i

a

i=1

 n          
          + G T g1 (t) , . . . , T gn (t) Fi Tf1 (t) , . . . , Tfn (t) fi (t) dt i=1

  t  b 
 t     f1 (s) ds, . . . , fn (s) ds F  a

a

×

n 

a

G
i




t

  g1 (s) ds, . . . ,



a

i=1

t

     gn (s) ds gi (t)

a


 t  t     g1 (s) ds, . . . , gn (s) ds +G a

×

n 

Fi


i=1



b

= a

a




t

  f1 (s) ds, . . . ,



a

t

      fn (s) ds fi (t) dt

a


 t  t     d     f1 (s) ds, . . . , fn (s) ds F dt a a 
 t  t         g1 (s) ds, . . . , gn (s) ds dt ×G


 =F

a

 f1 (t) dt, . . . ,

b

a

a



 fn (t) dt

b a


 b    g1 (t) dt, . . . , ×G a

The proof is complete.



  gn (t) dt .

b

a



308

Chapter 3. Opial-Type Inequalities

T HEOREM 3.5.7. Let fi , gi , F , Fi
, G, G
i be as in Theorem 3.5.6 and pi , qi , hi , wi for i = 1, . . . , n be as in Theorem 3.5.5. Then, the following integral inequality holds  b n           G
T g1 (t), . . . , T gn (t) gi (t) F Tf1 (t), . . . , Tfn (t) i

a

i=1

 n          
          + G T g1 (t) , . . . , T gn (t) Fi Tf1 (t) , . . . , Tfn (t) fi (t) dt





i=1

 |f1 (t)| dt , p1 (t) a
 b
  |fn (t)| dt . . . , h−1 p (t)h n n n pn (t) a
 b
 
|g1 (t)| dt , × G w1−1 q1 (t)w1 q1 (t) a
 b
  |gn (t)| dt . . . . , wn−1 qn (t)wn qn (t) a


 F h−1 1

b



p1 (t)h1

(3.5.28)

The proof can be completed by following the proof of Theorem 3.5.6 and closely looking at the proofs of Theorems 3.5.4 and 3.5.5 with suitable modifications. Here we omit the details. R EMARK 3.5.3. In the special cases, the inequalities given in Theorems 3.5.6 and 3.5.7 yield various new inequalities of the Opial type which are different from those of given by Bloom in [30]. For further generalizations of Theorems 3.5.6 and 3.5.7, see [346].

3.6 Opial-Type Inequalities Involving Higher-Order Derivatives In 1968, Willett [425] established the following inequality  x n  x    u(t)u(n) (t) dt  (x − a) u(n) (t)2 dt, 2 a a

(3.6.1)

where x ∈ [a, b], u ∈ C (n) [a, b] with u(i) (a) = 0 for i = 0, 1, 2, . . . , n − 1 and n
1. Further results on some improvements, variants and generalizations of

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

309

inequality (3.6.1) are given by a number of investigators, see [4] and the references given therein. In this section we shall present certain variants and extensions of inequality (3.6.1) investigated by Pachpatte in [239,296,312,317]. In the year 1986, Pachpatte [239] has proved the following Opial-type integral inequalities involving two functions and their nth-order derivatives. T HEOREM 3.6.1. Let u, v ∈ C (n−1) [a, b] such that u(k) (a) = v (k) (a) = 0 for k = 0, 1, 2, . . . , n − 1, where n
1. Let u(n−1) , v (n−1) be absolutely continuous and

b (n) 2

b (n) 2 a |u (t)| dt < ∞, a |v (t)| dt < ∞. Then 

   u(t)v (n) (t) + v(t)u(n) (t) dt

b 

a



    u(n) (t)2 + v (n) (t)2 dt,

b 

 B(b − a)n

(3.6.2)

a

where B=


1/2 1 n . 2n! 2n − 1

(3.6.3)

Equality holds in (3.6.2) if and only if n = 1 and u(n) (t) = v (n) (t) = M, where M is a constant. T HEOREM 3.6.2. Let u, v ∈ C[a, b] and u
, . . . , u(n−1) , v
, . . . , v (n−1) are piece b wise continuous, u(n−1) , v (n−1) are absolutely continuous with a |u(n) (t)|2 dt <

b (n) 2 ∞, a |v (t)| dt < ∞, u(k) (a) = v (k) (a) = 0, u(k) (b) = v (k) (b) = 0 for k = 0, 1, . . . , n − 1, where n
1, then  b     u(t)v (n) (t) + v(t)u(n) (t) dt a


B

b−a 2

n 

    u(n) (t)2 + v (n) (t)2 dt,

b 

(3.6.4)

a

where B is given by (3.6.3). Equality holds in (3.6.4) if and only if n = 1 and u(t) = v(t) = M(t − a)n , a  t  (a + b)/2; u(t) = v(t) = M(b − t)n , (a + b)/2  t  b, where M is a constant. R EMARK 3.6.1. We note that, in the special case when we take u(t) = v(t) in Theorems 3.6.1 and 3.6.2, we get the integral inequalities established by Das in [77, Theorem 1 and Remark on p. 259] which in turn contains as a special case the Opial inequality (3.2.1) and the sharper version of the inequality established

310

Chapter 3. Opial-Type Inequalities

by Willett in (3.6.1). In order to avoid duplication, we omit the detailed discussion concerning the equalities in (3.6.2) and (3.6.4) and refer the reader to [77, p. 259] and [4, pp. 130–131]. P ROOFS OF T HEOREMS 3.6.1 AND 3.6.2. From the hypotheses of Theorem 3.6.1 we have  t 1 u(t) = (t − s)n−1 u(n) (s) ds, (3.6.5) (n − 1)! a  t 1 (t − s)n−1 v (n) (s) ds, (3.6.6) v(t) = (n − 1)! a for t ∈ [a, b]. Now, multiplying (3.6.5) and (3.6.6) by v (n) (t) and u(n) (t), respectively, and upon using Schwarz inequality, we obtain 1/2 (n) n−1/2
 t     u(t)v (n) (t)  |v (t)|(t − a) u(n) (s)2 ds , (3.6.7) (n − 1)!(2n − 1)1/2 a 1/2 (n) n−1/2
 t     v(t)u(n) (t)  |u (t)|(t − a) v (n) (s)2 ds . (3.6.8) (n − 1)!(2n − 1)1/2 a From (3.6.7) and (3.6.8), we obtain  b     u(t)v (n) (t) + v(t)u(n) (t) dt a



1 (n − 1)!(2n − 1)1/2
 t 1/2  b   (n) 2  n−1/2  (n)    u (s) ds v (t) × (t − a) a

a

  + u(n) (t)




t

 (n) 2 v (t) dt

1/2 dt.

(3.6.9)

a

Now, first applying Schwarz inequality and then upon using the elementary inequalities (α + β)2  2(α 2 + β 2 ) and α 1/2 β 1/2  12 (α + β), α, β
0 (for α, β reals) to the right-hand side of (3.6.9), we obtain  b     u(t)v (n) (t) + v(t)u(n) (t) dt a

1  (n − 1)!(2n − 1)1/2


 a

b

1/2 (t − a)

2(n−1/2)

dt

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

×


 b

 (n)  v (t)




a

t

 (n) 2 u (s) ds

1/2

a

  + u(n) (t)




t

311

 (n) 2 v (s) ds

1/2 2

1/2 dt

a



(b − a)n (n − 1)!(2n − 1)1/2 (2n)1/2
 b 
 t  (n) 2  (n) 2     u (s) ds v (t) × 2 a

a

 2 + u(n) (t)




t

 (n) 2 v (s) ds



1/2 dt

a

√ 2(b − a)n = (n − 1)!(2n − 1)1/2 (2n)1/2
 b 
 t 
 t  1/2  (n) 2  (n) 2 d u (s) ds v (s) ds dt × a dt a a √

 
 b 1/2 b 2  (n) 2 2(b − a)n (n)     u (s) ds v (s) ds = (n − 1)!(2n − 1)1/2 (2n)1/2 a a
1/2  b  (n) 2  (n) 2  n 1 n u (t) + v (t) dt.  (b − a) 2n! 2n − 1 a The proof of Theorem 3.6.1 is complete. The proof of Theorem 3.6.2 follows immediately on using (3.6.2) once on a+b [a, a+b 2 ] and again on [ 2 , b], where on the latter interval, in view of the assumptions on u, v, we have u(t) = v(t) = The details are omitted.

(−1)n (n − 1)! (−1)n (n − 1)!



b

(s − t)n−1 u(n) (s) ds,

t



b

(s − t)n−1 v (n) (s) ds.

t



In [296] Pachpatte has established the Opial-type inequalities in the following theorems, involving functions and their higher-order derivatives. In what follows, we let I = [a, b] and rk (t) > 0, k = 1, . . . , n − 1, and z(t) be sufficiently smooth

312

Chapter 3. Opial-Type Inequalities

functions on [a, b]. The r-derivative of the function z is defined as follows.  (0)   Dr z = z,  (k) (k−1) 
Dr z = rk Dr z ,   (n−1) 
 (n) z . Dr z = Dr

 k = 1, . . . , n − 1 “
” =

Further, we set  1, Rk (a, t) = t

dsk+1 sk+1 dsk+2 a rk+1 (sk+1 ) a rk+2 (sk+2 )

···

sn−2 a

d dt

 =D ,

(3.6.10)

if k = n − 1, dsn−1 rn−1 (sn−1 ) ,

if 0  k < n − 1. (3.6.11)

T HEOREM 3.6.3. Let rj > 0, j = 1, . . . , n − 1, u, v be real-valued continuous functions defined on I and r-derivatives of u, v exist, be continuous on I and such (i) (i) that Dr u(a) = Dr v(a) = 0, i = 0, 1, . . . , n − 1, for n
1 and a ∈ I . Then  a

            D (k) u (t) D (n) v (t) +  D (k) v (t) D (n) u (t) dt r r r r

b 

 (b−a) b  (n)  2  (n)  2   Dr u (t) +  Dr v (t) dt, a 2 

b  (n)  2  (n)  2  M a  Dr u (t) +  Dr v (t) dt,

where M=

if k = n − 1, if 0  k < n − 1, (3.6.12)

 b

1/2 1 (t − a)Rk2 (a, t) dt . 2 a

(3.6.13)

R EMARK 3.6.2. (i) If we take k = 0 in inequality (3.6.12), then it reduces to the following inequality 

        u(t) D (n) v (t) + v(t) D (n) u (t) dt

b 

r

a



r

       D (n) u (t)2 +  D (n) v (t)2 dt, r r

b 

 M0 a

where M0 =

 b

1/2 1 (t − a)R02 (a, t) dt . 2 a

(3.6.14)

(3.6.15)

313

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

(ii) Putting v = u in (3.6.12) and rj = 1, j = 1, . . . , n − 1, we get 

  u(t)u(n) (t) dt  Cn

b



a

 u(n) (t)2 dt,

b

(3.6.16)

a

√

where Cn = 12 n!n (b − a)n . Inequality (3.6.16) contains Opial’s inequality given in Theorem 2
in [211, p. 154] with n = 1. T HEOREM 3.6.4. Let p, q be positive constants satisfying p + q > 1 and rj , u be as in Theorem 3.6.3. Then  b  (k)  p  (n)  q  D u (t)  D u (t) dt r r a



q q/(p+q) (p + q)−1 (b − a)p

b  (n)  p+q N a  Dr u (t) dt,



b  (n)  p+q   dt, if k = n − 1, a Dr u (t) if 0  k < n − 1, (3.6.17)

where
N=

q p+q

q/(p+q) 

b

(t − a)

p+q−1

a

p+q Rk (a, t) dt

p/(p+q) .

R EMARK 3.6.3. If we take k = 0 in (3.6.17), we get  b  b     (n)  p+q   u(t)p  D (n) u (t)q dt  N0  D u (t) dt, r

a

a

r

(3.6.18)

(3.6.19)

where N0 is obtained by the right-hand side of (3.6.18) by taking k = 0. T HEOREM 3.6.5. Let rj , u be as in Theorem 3.6.3. Then 

a i=0

where

    D (i) u (t) dt  Q r

n b 



1 Q= n+1

 a

b

   D (n) u (t)2 dt r

b  a

(t − a)

n

n−2 

(n+1)/2 ,

(3.6.20)

1/2 Ri2 (a, t) dt

.

(3.6.21)

i=0

R EMARK 3.6.4. By setting #rj2 = 1,2j = 1, . . . , n − 1, then taking n = 1 and using Ri (a, t) = 1 for n1
n2 , where n1 and n2 are the usual convention that nt=n 1

314

Chapter 3. Opial-Type Inequalities

integers, we see that inequality (3.6.20) reduces to Opial’s inequality given in Theorem 2
in [211, p. 154]. P ROOFS OF T HEOREMS 3.6.3–3.6.5. Under the assumptions of Theorem 3.6.3 for any t ∈ I , we have  t  (n)  D u (s) ds, if k = n − 1,    a r

sn−2 dsn−1 sn−1  (n)   (k)  t dsk+1 sk+1 dsk+2 Dr u (s) ds Dr u (t) = a rk+1 (sk+1 ) a rk+2 (sk+2 ) · · · a rn−1 (sn−1 ) a  

t  (n)     Rk (a, t) a  Dr u (s) ds, if 0  k < n − 1. (3.6.22) Now, multiplying (3.6.22) by |(Dr(n) v)(t)| and (3.6.22) with u = v by |(Dr(n) u)(t)|, respectively, and making use of the properties of modulus and Schwarz inequality, we get the inequalities  (k)   (n)    D u (t) D v (t) r r   (n)   t  (n)    Dr v (t)  Dr u (s) ds,  a    if k = n − 1,       2 1/2   (t − a)1/2 Rk (a, t) Dr(n) v (t) at  Dr(n) u (s) ds ,   if 0  k < n − 1,  (k)   (n)    D v (t) D u (t) r r   (n)   t  (n)         Dr u (t) a Dr v (s) ds,   if k = n − 1,       (t − a)1/2 Rk (a, t)D (n) u(t) t D (n) v (s)2 ds 1/2 ,  r r  a  if 0  k < n − 1, which imply  b  (k)   (n)    (k)   (n)    D u (t) D v (t) +  D v (t) D u (t) dt r r r r a

 b  t  (n)    t  (n)    d   Dr u (s) ds    a Dr v (s) ds dt, if k = n − 1,  a dt a    b (t − a)1/2 Rk (a, t) a   (n)   t  (n)  2 1/2   ×  Dr v (t) a  Dr u (s) ds     (n)   t  (n)  2 1/2   dt, if 0  k < n − 1. +  Dr u (t) a  Dr v (s) ds (3.6.23)

315

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

In order to prove inequality (3.6.12), we consider the following two cases. Case I. Let k = n − 1. From (3.6.23), using the elementary inequality αβ  1 2 2 2 (α + β ), α, β
0 (for α, β reals) and the Schwarz inequality, we obtain 

          D (k) u (t) D (n) v (t) +  D (k) v (t) D (n) u (t) dt r r r r

b 

a




   D (n) u (t) dt r

b 

 a

1  (b − a) 2

 a




   D (n) v (t) dt r

b  a



       D (n) u (t)2 +  D (n) v (t)2 dt, r r

b 

(3.6.24)

being the required inequality in (3.6.12) for k = n − 1. Case II. Let 0  k < n − 1. From (3.6.23),√using Schwarz inequality, the elementary inequality (α + β)2  2(α 2 + β 2 ) and αβ  12 (α + β), α, β
0 (α, β reals), we get 

          D (k) u (t) D (n) v (t) +  D (k) v (t) D (n) u (t) dt r r r r

b 

a


 

b

a

×

1/2 (t − a)Rk2 (a, t) dt

 b

 (n)    D v (t)




r

a

t

 (n)  2  D u (s) ds r

a

   +  D (n) u (t)




r


  a

b

1/2

1/2

t

 (n)  2  D v (s) ds

1/2 2 dt

r

a

1/2

(t − a)Rk2 (a, t) dt


 t   b   (n)  2  (n)  2  D u (s) ds  D v (t) × 2 r r a

a

  2 +  Dr(n) u (t)





 b 1/2 2 = 2 (t − a)Rk (a, t) dt a

a

t

 (n)  2  D v (s) ds r



1/2 dt

316

Chapter 3. Opial-Type Inequalities



b

× a

d dt


 a

t

 (n)  2  D u (s) ds




r

a


 b 1/2 = 2 (t − a)Rk2 (a, t) dt a


 × a

   D (n) u (t)2 dt r

b 

t

1/2


 1/2

r

   D (n) v (t)2 dt r

b  a

 (n)  2  D v (s) ds

1/2


 b 1/2  b  (n)  2  (n)  2  1 2  D u (t) +  D v (t) dt,  (t − a)Rk (a, t) dt r r 2 a a (3.6.25) being the required inequality in (3.6.12) for 0  k < n − 1. Thus the proof of Theorem 3.6.3 is complete. To prove Theorem 3.6.4, take modulo and pth power on both sides of (3.6.22) and use Hölder’s inequality with indices p + q and (p + q)/(p + q − 1), so we have  (k)  p  D u (t) r

  t  (n)  p+q p/(p+q) (t − a)p(p+q−1)/(p+q) a  Dr u (s) ds ,     if k = n − 1,   t  (n)  p+q p/(p+q) p   ds , (t − a)p(p+q−1)/(p+q) Rk (a, t) a  Dr u (s)   if 0  k < n − 1. (3.6.26) (n)

Now, multiplying both sides of (3.6.26) by |(Dr u)(t)|q , then integrating from a to b and applying Hölder’s inequality with indices (p + q)/p, (p + q)/q to the integrals on the right-hand side, we find  b  (k)  p  (n)  q  D u (t)  D u (t) dt r r a

 

p/(p+q) b  (t − a)p+q−1 dt  a     b  (n)  p+q  t  (n)  p+q p/q q/(p+q)     × a  Dr u (t) ds dt ,  a Dr u (s)    if k = n − 1,  

p/(p+q) p+q b   (t − a)p+q−1 Rk (a, t) dt  a    b   p+q  t  (n)  p+q p/q q/(p+q)      × a  Dr(n) u (t) ds dt  a Dr u (s)   if 0  k < n − 1,

317

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

 =

q q/(p+q) (p + q)−1 (b − a)p

b  (n)  p+q N a  Dr u (t) dt,

b  (n)  p+q   dt, a Dr u (t)

if k = n − 1, if 0  k < n − 1. (3.6.27)

The proof of Theorem 3.6.4 is complete. By the hypotheses of Theorem 3.6.5, we have inequality (3.6.22). Taking k = 0, 1, . . . , n − 1 in (3.6.22) and modulo, we get  (0)    D u (t)  R0 (a, t) r



t

 (n)    D u (s) ds, r

a

 (1)    D u (t)  R1 (a, t) r



t

 (n)    D u (s) ds, r

a

.. .  (n−2)    D u (t)  Rn−2 (a, t) r

 (n−1)    D u (t)  r

 a



t

 (n)    D u (s) ds, r

a t

 (n)    D u (s) ds. r

From these inequalities and using Schwarz inequality, we obtain n
 t n    (n)    (i)   n−2  (n)       D u (t)   Dr u (s) ds Ri (a, t) Dr u (t) r i=0

a

i=0



n−2 

   Ri (a, t) Dr(n) u (t)(t − a)n/2

i=0




t

a

 (n)  2  D u (s) ds

n/2

r

.

(3.6.28) Integrating both sides of (3.6.28) from a to b and using again Schwarz inequality, we find 

n b 

a i=0



   D (i) u (t) dt r

b

 a

(t − a)

n/2

n−2  i=0

   Ri (a, t) Dr(n) u (t)


 a

t

 (n)  2  D u (s) ds r

n/2 dt

318

Chapter 3. Opial-Type Inequalities

 

b

(t − a)n

a

Ri2 (a, t) dt


   D (n) u (t)2 r

b 

× a

a

1/2

i=0



 =Q

n−2 

t

 (n)  2  D u (s) ds

a

   D (n) u (t)2 dt r

b 

r

n

1/2 dt

(n+1)/2 . 

The proof of Theorem 3.6.5 is complete.

R EMARK 3.6.5. We note that, by following the proof of Theorem 3.6.3 with suitable modifications, we can establish inequality (3.6.14) for u = v in the following useful variant  t  t    (n−1)  2   u(s) D (n−1) u (s) ds  M ∗ (t)  D u (s) ds, (3.6.29) r r 0 a

a

where a, t ∈ I and rj , u are as defined in Theorem 3.6.3 but with j = 1, . . . , n − 2, i = 0, 1, . . . , n − 2 for n
2, M0∗ (t) =

 t

1/2 1 (s − a)R0∗2 (a, s) ds 2 a

(3.6.30)

with R0∗ (a, t) =

 a

t

ds1 r1 (s1 )

 a

s1

ds2 ··· r2 (s2 )

 a

sn−3

dsn−2 . rn−2 (sn−2 )

(3.6.31)

Inequality (3.6.29) is formulated in the framework of Willett’s inequality (3.6.1) which is suitable in certain applications. It is easy to observe that the constant obtained in (3.6.16) is better than that in (3.6.1). 1 n ( 2n−1 )1/2 is established in Inequality (3.6.16) with sharper constant cn = 2n! Das [77, Theorem 1]. However, our proof does not yield the better constant as in [77], because there is a difficulty involved in proving the much more general result as given in Theorem 3.6.3, that is, proving (3.6.24), (3.6.25). We also note that the results established in Theorems 3.6.3–3.6.5 can be extended to the case when we replace the conditions Dr(i) u(a) = Dr(i) v(a) = 0 by Dr(i) u(b) = Dr(i) v(b) = 0,

i = 0, 1, . . . , n − 1.

319

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

The following theorem established by Pachpatte in [312] involves a generalization of Opial’s inequality involving a function and its higher-order derivatives. T HEOREM 3.6.6. Let u ∈ C (n) [a, b] be a real-valued function such that u(k) (a) = 0 for k = 0, 1, . . . , n − 1 and n
1. Let w, v be positive and continuous functions defined on [a, b]. Let p
1 and q > 0 be real numbers and rk
0, k = 0, 1, . . . , n − 1, be real numbers with n−1 k=0 rk = 1. Then 

 n−1 p  rk  (n) q (k)   u (t) dt u (t) w(t)

b

a

k=0



b

 C(p, q)

 p+q v(t)u(n) (t) dt,

(3.6.32)

a

where n−1 q/(p+q)  b   −p q (p+q)/p −q/p w (t)v (t) rk (n − k − 1)! C(p, q) = p+q a k=0  t × v −1/(p+q−1) (s)


a

p(p+q−1)/(p+q)

(p+q)/p

× (t − s)(p+q)(n−k−1)/(p+q−1) ds

p/(p+q)

dt (3.6.33)

is finite. P ROOF. From the hypotheses, on u we have u(k) (t) =

1 (n − k − 1)!



t

(t − s)n−k−1 u(n) (s) ds

(3.6.34)

a

for k = 0, 1, . . . , n − 1. From (3.6.34) and using the elementary inequality n−1  k=0

r akk



n−1  k=0

rk ak 

n−1 

1/p p

rk ak

,

k=0

where ak
0, k = 0, 1, . . . , n − 1, and p
1 be any real number and rk as stated in theorem. By using Hölder’s inequality with indices p + q, (p + q)/(p + q − 1),

320

Chapter 3. Opial-Type Inequalities

we observe that p  n−1   r k u(k) (t) k=0



n−1  p  rk u(k) (t) k=0



n−1   −p rk (n − k − 1)! k=0

 ×

t

v

−1/(p+q)

(s)(t − s)

n−k−1

 1/(p+q)  (n)  v (s)u (s) ds

p

a



n−1   −p rk (n − k − 1)! k=0



t

×

v −1/(p+q−1) (s)(t − s)(p+q)(n−k−1)/(p+q−1)

p(p+q−1)/(p+q)

a



t

×

 p+q v(s)u(n) (s) ds

p/(p+q) .

(3.6.35)

a

Multiplying both sides of (3.6.35) by w(t)|u(n) (t)|q and integrating the resulting inequality from a to b, rewriting and then using Hölder’s inequality with indices (p + q)/p, (p + q)/q, we observe that 

b

 n−1 p  rk  (n) q (k) u (t) u (t) dt w(t)

a



 b

k=0

w(t)v −q/(p+q) (t)

a

n−1   −p rk (n − k − 1)! k=0

 ×

t

v −1/(p+q−1) (s)(t − s)(p+q)(n−k−1)/(p+q−1) ds

p(p+q−1)/(p+q) 

a

 t p/(p+q)  (n) q  (n) p+q q/(p+q)     dt × v (t) u (t) v(s) u (s) ds a

321

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

 

b

w

(p+q)/p

(t)v

−q/p

n−1   −p (t) rk (n − k − 1)!

a

k=0



t

×

v −1/(p+q−1) (s)

a

p(p+q−1)/(p+q)

(p+q)/p

× (t − s)(p+q)(n−k−1)/(p+q−1) ds  ×

b

a



 p+q v(t)u(n) (t)

t

p/(p+q)

dt

 p+q v(s)u(n) (s) ds

p/q

q/(p+q) dt

a



b

= C(p, q)

 p+q v(t)u(n) (t) dt.

a



The proof is complete.

R EMARK 3.6.6. We note that by specializing inequality (3.6.32) we get the various inequalities established earlier by different investigators. We also note that Theorem 3.6.6 can be extended to the case when we replace the conditions u(k) (a) = 0 by u(k) (b) = 0 for k = 0, 1, . . . , n − 1. For more details, see [312]. The inequalities in the following theorems are established by Pachpatte in [317]. To formulate the results conveniently, we set −p  −p  M1 = (n − i − 1)! 1 (n − j − 1)! 2  b × w p/(p−p3 ) (t) a


 ×

t

p(n−i−1)/(p−1) −1/(p−1)

(t − s)

v

p1 (p−1)/(p−p3 ) (s) ds

a


 ×

t

(t − s)p(n−j −1)/(p−1) v −1/(p−1) (s) ds

a

× v −p3 /(p−p3 ) (t) dt

p2 (p−1)/(p−p3 )

(p−p3 )/p (3.6.36)

322

Chapter 3. Opial-Type Inequalities

and  −2p M2 = (n − 1)!  b
 t  × w (p+q)/p (t)

(p+q)/(p+q−1) (t − s)n−1 (s − τ )n−1 ds r(s) a τ p+q−1 p/(p+q) × v −1/(p+q−1) (τ ) dτ v −q/p (t) dt , (3.6.37)

a

t

where p1 , p2 , p3 , p = p1 + p2 + p3 ; p, q, n, i, j are suitable constants and w(t), v(t), r(t) are suitable functions defined on I = [a, b], a < b are real constants, and  M3 =

b

w

p/(p−pn )

a

 n−2 p/(p−pn )  p i (t) Ri (a, t) i=0




t

×

v −1/(p−1) (s) ds

p−1

(p−pn )/p

v −pn /(p−pn ) (t)

,

(3.6.38)

a

where p0 , p1 , . . . , pn , p = ni=0 pi are suitable constants, w(t) and v(t) are suitable functions defined on I and Ri is as defined in (3.6.11). T HEOREM 3.6.7. Let p1 , p2 , p3 be nonnegative real numbers satisfying p = p1 + p2 + p3 > p3 > 0, p > 1, and let n
2 and 0  i  j  n − 1 be integers. Let f (t) be of class C n on I satisfying f (a) = f
(a) = · · · = f (n−1) (a) = 0. Suppose that w(t) and v(t) are positive and continuous functions defined on I . Then 

b

 p  p  p w(t)f (i) (t) 1 f (j ) (t) 2 f (n) (t) 3 dt

a




p3 p

p3 /p



b

M1

 p v(t)f (n (t) dt,

(3.6.39)

a

where M1 is finite and defined by (3.6.36). T HEOREM 3.6.8. Let p, q be positive real numbers satisfying p + q > 1 and let n
1 be an integer. Let r(t) > 0 be of class C n on I and f (t) be of class C 2n on I satisfying f (i−1) (a) = 0, (r(a)f (n) (a))(i−1) = 0 for i = 1, 2, . . . , n. Suppose

323

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

that w(t) and v(t) are positive and continuous functions defined on I . Then  b  p   (n) q w(t)f (t)  r(t)f (n) (t)  dt a




q p+q

q/(p+q)



b

M2

 (n) p+q v(t) r(t)f (n) (t)  dt,

(3.6.40)

a

where M2 is finite and defined by (3.6.37). The following corollary to Theorem 3.6.8 given by Pachpatte in [317] is of independent interest. C OROLLARY 3.6.1. Let r(t) > 0 be of class C n on I and f (t) be of class C 2n on I satisfying f (i−1) (a) = 0, (r(a)f (n) (a))(i−1) = 0 for i = 1, 2, . . . , n. Suppose that M2∗ (t) defined by M2∗ (t) =

 −2 (n − 1)!

 t
 x  a

a

(x − s)n−1 (s − τ )n−1 ds r(s)

x

τ

2



1/2

dτ dx

is finite, then  t  t         f (s) r(s)f (n) (s) (n)  ds  √1 M ∗ (t)  r(t)f (n) (s) (n) 2 ds 2 2 a a for n
1 and t ∈ I . This situation is the case of Theorem 3.6.8 in which p = q = 1 and w(t) = v(t) = 1 and b is replaced by a variable t and M2 is replaced by M2∗ (t). T HEOREM 3.6.9. Let p0 , p1 , . . . , pn be nonnegative real numbers satisfying p = ni=0 pi > pn , p > 1. Let ri (t) > 0, i = 1, . . . , n − 1, n
1, and f (t) be continuous function defined on I . Let r-derivatives of f (t) exist, be continuous (i) on I and such that Dr f (a) = 0, i = 0, 1, . . . , n − 1. Suppose that w(t) and v(t) are positive and continuous functions defined on I . Then 

b

w(t) a




n   (i)  pi  D f (t) dt r i=0

pn p

pn /p

 M3 a

b

  p v(t) Dr(n) f (t) dt,

where M3 is finite and defined by (3.6.38).

(3.6.41)

324

Chapter 3. Opial-Type Inequalities

P ROOFS OF T HEOREMS 3.6.7–3.6.9. From the hypotheses of Theorem 3.6.7 and Taylor expansion, we have the representation  t 1 (t − s)n−i−1 f (n) (s) ds (3.6.42) f (i) (t) = (n − i − 1)! a for 0  i  n − 1. From (3.6.42) and using Hölder’s inequality with indices p/(p − 1), p, we observe that, for t ∈ I ,  (i) p1 f (t) p1  t     −p  (t − s)n−i−1 v −1/p (s) v 1/p (s)f (n) (s) ds  (n − i − 1)! 1 a

 −p  (n − i − 1)! 1




t

(t − s)

a




t

×

p(n−i−1)/(p−1) −1/(p−1)

 p v(s)f (n) (s) ds

v

p1 (p−1)/p (s) ds

p1 /p .

(3.6.43)

a

From (3.6.43) and rewriting (3.6.43) by replacing i by j, 0  i  j  n − 1, and p1 by p2 , we observe that  p  p  p w(t)f (i) (t) 1 f (j ) (t) 2 f (n) (t) 3 −p  −p   (n − i − 1)! 1 (n − j − 1)! 2
 t p1 (p−1)/p p(n−i−1)/(p−1) −1/(p−1) × w(t) (t − s) v (s) ds a




t

×

p(n−j −1)/(p−1) −1/(p−1)

(t − s)

v

p2 (p−1)/p (s) ds

v

−p3 /p

(t)

a


 t (p−p3 )/p  p  p . v(s)f (n) (s) ds × v p3 /p (t)f (n) (t) 3

(3.6.44)

a

Now, integrating both sides of (3.6.44) from a to b and using Hölder’s inequality with indices p/(p − p3 ), p/p3 on the right-hand side of the resulting inequality, we observe that  b  p  p  p w(t)f (i) (t) 1 f (j ) (t) 2 f (n) (t) 3 dt a

  M1 a

b

 p v(t)f (n) (t)


 a

t

 p v(s)f (n) (s) ds

(p−p3 )/p3

p3 /p dt

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives


=

p3 p

p3 /p



b

M1

325

 p v(t)f (n) (t) dt,

a

where M1 is defined in (3.6.36). The proof of Theorem 3.6.7 is complete. From the hypotheses of Theorem 3.6.8 and Taylor expansion, we have the representations  t 1 (t − s)n−1 f (n) (s) ds (3.6.45) f (t) = (n − 1)! a and r(s)f

(n)

1 (s) = (n − 1)!



s

 (n) (s − τ )n−1 r(τ )f (n) (τ ) dτ.

(3.6.46)

a

By substituting (3.6.46) into (3.6.45) and reversing the order of integration on the double integral, we have the representation formula (see [97, p. 315]) f (t) =

1 [(n − 1)!]2

 t  t  (n) (t − s)n−1 (s − τ )n−1 ds r(τ )f (n) (τ ) × dτ r(s) a τ

(3.6.47)

for a  τ  s  t  b. From (3.6.47) and using Hölder’s inequality with indices (p + q)/(p + q − 1), p + q, we observe that     f (t)p  (n − 1)! −2p   t
 t

(t − s)n−1 (s − τ )n−1 −1/(p+q) ds v × (τ ) r(s) a τ p (n)   1/(p+q)  (n)   dτ (τ ) r(τ )f (τ ) × v  −2p  (n − 1)!

 t
 a

 × a

t

(p+q)/(p+q−1) (t − s)n−1 (s − τ )n−1 ds r(s) τ p(p+q−1)/(p+q) × v −1/(p+q−1) (τ ) dτ t

 (n) p+q v(τ ) r(τ )f (n) (τ )  dτ

p/(p+q) .

(3.6.48)

326

Chapter 3. Opial-Type Inequalities

From (3.6.48) we observe that p   (n) q w(t)f (t)  r(t)f (n) (t)   t
  −2p w(t)  (n − 1)! a

(p+q)/(p+q−1) (t − s)n−1 (s − τ )n−1 ds r(s) τ p(p+q−1)/(p+q)

× v −1/(p+q−1) (τ ) dτ v −q/(p+q) (t) t



 (n) q × v q/(p+q) (t) r(t)f (n) (t)  

t

×

 (n) p+q v(τ ) r(τ )f (n) (τ )  dτ

p/(p+q) .

(3.6.49)

a

Now, integrating both sides of (3.6.49) from a to b and using Hölder’s inequality with indices (p + q)/p, (p + q)/q on the right-hand side of the resulting inequality, we observe that 

b

 p   (n) q w(t)f (t)  r(t)f (n) (t)  dt

a

  M2

b

 (n) p+q v(t) r(t)f (n) (t) 

a


 ×


=

t

 (n) p+q v(τ ) r(τ )f (n) (τ )  dτ

a

q p+q

p/(p+q)

 M2

b

p/q

q/(p+q) dt

 (n) p+q v(t) r(t)f (n) (t)  dt,

a

where M2 is defined by (3.6.37). This result is the required inequality in (3.6.40) and the proof of Theorem 3.6.8 is complete. From the hypotheses of the Theorem 3.6.9, for any t ∈ I , we have

 (i)  Dr f (t) =

 t  (n)  D f (s) ds,    a r

  

t dsi+1 si+1 dsi+2 a ri+1 (si+1 ) a ri+2 (si+2 )

sn−1  (n)  × a Dr f (s) ds,

if i = n − 1,

s dsn−1 · · · a n−2 ri−1 (sn−1 ) if 0  i < n − 1.

(3.6.50)

327

3.6. Opial-Type Inequalities Involving Higher-Order Derivatives

From (3.6.50) we observe that  (i)    D f (t)  r

 t  (n)     if i = n − 1, a Dr f (s) ds,

t  (n)   Ri (a, t) a  Dr f (s) ds, if 0  i < n − 1.

(3.6.51)

From (3.6.51) we observe that p0
 t  (0)  p0  (n)    D f (t)  R p0 (a, t)  D f (s) ds , r r 0 a

 (1)  p1  D f (t) r

p1
 t  (n)   p  D f (s) ds  R1 1 (a, t) , r a

.. .

pn−2
 t  (n)    (n−2)  pn−2 pn−2   D f (s) ds  D f (t)  R (a, t) , r r n−2  (n−1)  pn−1  D f (t)  r


 a

a

t

 (n)    D f (s) ds r

pn−1 .

From these inequalities and using Hölder’s inequality with indices p/(p − 1), p, we observe that w(t)

n   (i)  pi  D f (t) r i=0

  p  w(t) Dr(n) f (t) n × 

n−2 

p−pn
 t    p Ri i (a, t) v −1/p (s)v 1/p (s) Dr(n) f (s) ds a

i=0

 w(t)

n−2  i=0


 p Ri i (a, t)

t

v

−1/(p−1)



(p−1)(p−pn )/p (s) ds

v

−pn /p

(t)

a


 t (p−pn )/p    p  p . × v pn /p (t) Dr(n) f (t) n v(s) Dr(n) f (s) ds a

(3.6.52) Now, integrating both sides of (3.6.52) from a to b and using Hölder’s inequality with indices p/(p − pn ), p/pn on the right-hand side of the resulting inequality,

328

Chapter 3. Opial-Type Inequalities

we observe that 

b

w(t) a

n   (i)  pi  D f (t) dt r i=0

  M3
=

a

pn p

b

  p v(t) Dr(n) f (t)

pn /p



b

M3 a




t

a

  p v(s) Dr(n) f (s) ds

(p−pn )/pn

pn /p dt

  p v(t) Dr(n) f (t) dt,

where M3 is defined by (3.6.38). The proof of Theorem 3.6.9 is complete.



3.7 Opial-Type Inequalities in Two and Many Independent Variables In the past few years, a number of papers have been written dealing with Opialtype inequalities, involving functions of two and many independent variables and their partial derivatives. In this section, we offer basic integral inequalities involving functions of two and many independent variables established by Yang [429] and Pachpatte [233,261,267,284] which claim their origin in Opial’s inequality. First we introduce some of the notations used in our subsequent discussion: Let ∆ = [a, b] × [c, d], ∆1 = [a, X] × [c, Y ], ∆2 = [a, X] × [Y, d], ∆3 = [X, b] × [c, Y ], ∆4 = [X, b] × [Y, d] for a  X  b, c  Y  d; a, b, c, d, X, Y ∈ R (R the set of real numbers). Further, let Dp(r) = drd p(r), 2 ∂ D1 h(s, t) = ∂s h(s, t), D2 h(s, t) = ∂t∂ h(s, t), D2 D1 h(s, t) = ∂s∂ ∂t h(s, t), for functions p(r), h(s, t) defined on R and ∆ respectively. In 1982, Yang [429] has obtained the following analogue of Opial’s inequality in two independent variables. T HEOREM 3.7.1. If f (s, t), D1 f (s, t) and D2 D1 f (s, t) are continuous functions on ∆ and f (a, t) = f (b, t) = D1 f (s, c) = D1 f (s, d) = 0 for a  s  b, c  t  d, then  b a

d

   f (s, t)D2 D1 f (s, t) dt ds

c



(b − a)(d − c) 8

 b a

c

d

  D2 D1 f (s, t)2 dt ds.

(3.7.1)

3.7. Opial-Type Inequalities in Two and Many Independent Variables

329

P ROOF. In order to prove (3.7.1), we consider the following four cases. Case I. Let (s, t) ∈ ∆1 and define  s t   D2 D1 f (u, v) dv du. z(s, t) = a

(3.7.2)

c

Then  D1 z(s, t) =

t

  D2 D1 f (s, v) dv,

s

  D2 D1 f (u, t) du.

c

 D2 z(s, t) =

(3.7.3)

a

From (3.7.3) we observe that, for each fixed s, z(s, t) is nondecreasing for t on [c, Y ]. Since f (a, t) = 0 and D1 f (s, c) = 0 for (s, t) ∈ ∆1 , we have  s     f (s, t)  D1 f (u, t) du, (3.7.4) a

  D1 f (s, t) 



  D2 D1 f (s, v) dv = D1 z(s, t).

t

(3.7.5)

c

From (3.7.4) and (3.7.5), we observe that, for (s, t) ∈ ∆1 ,  s     f (s, t)  D1 z(u, t) du = z(s, t). a

From (3.7.6), (3.7.5), (3.7.2) and applying Schwarz inequality, we have  X a

Y

   f (s, t)D2 D1 f (s, t) dt ds

c



 X a



Y

  z(s, t)D2 D1 f (s, t) dt ds

c X





Y

z(s, Y ) a

 =

  D2 D1 f (s, t) dt ds

c X

z(s, Y )D1 z(s, Y ) ds a

1 = z2 (X, Y ) 2

(3.7.6)

330

Chapter 3. Opial-Type Inequalities

1 = 2


 X a

Y

  D2 D1 f (s, t) dt ds

c

(X − a)(Y − c) 2



 X a

Y

2

  D2 D1 f (s, t)2 dt ds.

Case II. Let (s, t) ∈ ∆2 and define  s d   D2 D1 f (u, v) dv du. z(s, t) = a

(3.7.9)

c

Case IV. Let (s, t) ∈ ∆4 and define  b d   D2 D1 f (u, v) dv du. z(s, t) = s

(3.7.8)

t

Case III. Let (s, t) ∈ ∆3 and define  b t   D2 D1 f (u, v) dv du. z(s, t) = s

(3.7.7)

c

(3.7.10)

t

Now, by following similar arguments to those in the proof of Case I, but with suitable modifications, we obtain the following estimates in Cases II–IV:  X d    f (s, t)D2 D1 f (s, t) dt ds a

Y

  2 (X − a)(d − Y ) X d   D2 D1 f (s, t) dt ds, 2 a Y  b Y    f (s, t)D2 D1 f (s, t) dt ds X c

(b − X)(Y − c)  2

 b

Y

  D2 D1 f (s, t)2 dt ds

(3.7.11)

(3.7.12)

X c

and  b

d

   f (s, t)D2 D1 f (s, t) dt ds

X Y

 respectively.

(b − X)(d − Y ) 2

 b X Y

d

  D2 D1 f (s, t)2 dt ds,

(3.7.13)

3.7. Opial-Type Inequalities in Two and Many Independent Variables

331

Let X = (a + b)/2, Y = (c + d)/2. Then X − a = b − X = (b − a)/2, Y − c = d − Y = (d − c)/2. It follows from (3.7.7), (3.7.11)–(3.7.13) that  b a

d

   f (s, t)D2 D1 f (s, t) dt ds

c

=

 X a

+

Y

c

 X a

+

   f (s, t)D2 D1 f (s, t) dt ds

 b

d

   f (s, t)D2 D1 f (s, t) dt ds

Y

   f (s, t)D2 D1 f (s, t) dt ds

d

   f (s, t)D2 D1 f (s, t) dt ds

Y

X c

+

 b

X Y



(b − a)(d − c) 8

 b a

d

  D2 D1 f (s, t)2 dt ds.

c

This result is the desired inequality in (3.7.1) and the proof is complete.



In 1985, Pachpatte [233] has established some integral inequalities of Opial type in two independent variables. To formulate the results in [233], we list the following hypotheses. (H1 ) Let f (s, t), D1 f (s, t), D2 D1 f (s, t) and g(s, t), D1 g(s, t), D2 D1 g(s, t) be continuous on ∆ and f (a, t) = f (b, t) = D1 f (s, c) = D1 f (s, d) = 0, g(a, t) = g(b, t) = D1 g(s, c) = D1 g(s, d) = 0 for (s, t) ∈ ∆. (H2 ) Let h(s, t), D1 h(s, t), D2 D1 h(s, t) be continuous on ∆ and h(a, t) = h(b, t) = D1 h(s, c) = D1 h(s, d) = 0 for (s, t) ∈ ∆. Before stating the results in [233], we introduce the following notation for convenience:   L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) m         f (s, t)D2 D1 g(s, t) + g(s, t)D2 D1 f (s, t) ; = f (s, t)g(s, t)   D2 D1 L m, D2 D1 f (s, t), D2 D1 g(s, t) 2(m+1)  2(m+1)  + D2 D1 g(s, t) ; = D2 D1 f (s, t)

332

Chapter 3. Opial-Type Inequalities

  M m, f (s, t), g(s, t), h(s, t), D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t) m         f (s, t)D2 D1 g(s, t) + g(s, t)D2 D1 f (s, t) = f (s, t)g(s, t) m         g(s, t)D2 D1 h(s, t) + h(s, t)D2 D1 g(s, t) + g(s, t)h(s, t)  m        h(s, t)D2 D1 f (s, t) + f (s, t)D2 D1 h(s, t) ; + h(s, t)f (s, t)   D2 D1 M m, D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t) 2(m+1)  2(m+1)  2(m+1)  + D2 D1 g(s, t) + D2 D1 h(s, t) ; = D2 D1 f (s, t)   N f (s, t), g(s, t), h(s, t), D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t)          = f (s, t)g(s, t)h(s, t) D2 D1 f (s, t) + D2 D1 g(s, t) + D2 D1 h(s, t)       + f (s, t) + g(s, t) + h(s, t)     × f (s, t)g(s, t)D2 D1 h(s, t)         + g(s, t)h(s, t)D2 D1 f (s, t) + h(s, t)f (s, t)D2 D1 g(s, t) ; where m
0 is a constant. The results established in [233] are embodied in the following theorems. T HEOREM 3.7.2. Assume that (H1 ) holds. Then  b a

d

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

c

 Km

 b a

d

  D2 D1 L m, D2 D1 f (s, t), D2 D1 g(s, t) dt ds, (3.7.14)

c

where Km =



(b − a)(d − c) 2m+1 1 . 2(m + 1) 4

(3.7.15)

R EMARK 3.7.1. In the special case when g(s, t) = f (s, t) and 2m + 1 = n, the inequality established in Theorem 3.7.2 reduces to the following inequality  b a

d

    f (s, t)n D2 D1 f (s, t) dt ds

c



  n+1 1 (b − a)(d − c) n b d   dt ds, D2 D1 f (s, t) n+1 4 a c

(3.7.16)

3.7. Opial-Type Inequalities in Two and Many Independent Variables

333

which in turn contains as a special case Yang’s inequality given in (3.7.1) when n = 1. We also note that the inequality obtained in (3.7.16) is a two independent variable analogue of Yang’s generalization of the Opial inequality [428, Theorem 4] (see also [430]). As a consequence of Theorem 3.7.2, we have the following corollary. C OROLLARY 3.7.1. Assume that (H1 ) and (H2 ) hold. Then  b d  M m, f (s, t), g(s, t), h(s, t), a

c

 D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t) dt ds  2Km

 b a

d

  D2 D1 M m, D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t) dt ds,

c

(3.7.17) where Km is as defined in (3.7.15). T HEOREM 3.7.3. Assume that (H1 ) and (H2 ) hold. Then  b d   N f (s, t), g(s, t), h(s, t), D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t) dt ds a

c

 4K1

 b a

d

  D2 D1 M 1, D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t) dt ds,

c

(3.7.18) where K1 is obtained by substituting m = 1 in (3.7.15). R EMARK 3.7.2. Note that the inequalities established in Theorems 3.7.2 and 3.7.3 and Corollary 3.7.1 are the two independent variable analogues of the inequalities established earlier by Pachpatte in [239,240,256]. P ROOFS OF T HEOREMS 3.7.2 AND 3.7.3. In order to prove Theorem 3.7.2, we consider the following four cases. Case I. Let (s, t) ∈ ∆1 and define  s t   D2 D1 f (u, v) dv du, z(s, t) = a

c

(3.7.19)

334

Chapter 3. Opial-Type Inequalities

and w(s, t) =

 s a

t

  D2 D1 g(u, v) dv du.

(3.7.20)

c

Then 

  D2 D1 f (s, v) dv,

t

D1 z(s, t) =



s

D2 z(s, t) =

c

  D2 D1 f (u, t) du,

a

(3.7.21) and  D1 w(s, t) =

t

  D2 D1 g(s, v) dv,

c

 D2 w(s, t) =

s

  D2 D1 g(u, t) du.

a

(3.7.22) From (3.7.21) and (3.7.22), we observe that for each fixed s, z(s, t) and w(s, t) are nondecreasing for t on [c, Y ]. Since f (a, t) = g(a, t) = 0 and D1 f (s, c) = D1 g(s, c) = 0, for (s, t) ∈ ∆1 , we have  s     f (s, t)  D1 f (u, t) du, a (3.7.23)  s     g(s, t)  D1 g(u, t) du, a

  D1 f (s, t) 



t

  D2 D1 f (s, v) dv = D1 z(s, t),

(3.7.24)

  D2 D1 g(s, v) dv = D1 w(s, t).

(3.7.25)

c

  D1 g(s, t) 



t

c

From (3.7.23)–(3.7.25), we observe that  s     f (s, t)  D1 z(u, t) du = z(s, t),

(3.7.26)

a

  g(s, t) 



s

  D1 w(u, t) du = w(s, t).

(3.7.27)

a

From (3.7.26), (3.7.27), (3.7.24), (3.7.25) and applying the elementary inequality αβ  12 (α 2 + β 2 ) (for α, β reals), (3.7.19), (3.7.20) followed by two applications each of the Schwarz inequality and the Hölder inequality with indices m + 1 and

3.7. Opial-Type Inequalities in Two and Many Independent Variables

335

(m + 1)/m, we obtain  X a

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

Y c



 X a

Y

m z(s, t)w(s, t)

c

     × z(s, t)D2 D1 g(s, t) + w(s, t)D2 D1 f (s, t) dt ds 

X

 a


 zm+1 (s, Y )w m (s, Y )

=

c

a

= a

Y

   D2 D1 f (s, t) dt ds

c

X

 zm+1 (s, Y )w m (s, Y )D1 w(s, Y ) + zm (s, Y )w m+1 (s, Y )D1 z(s, Y ) ds

a



   D2 D1 g(s, t) dt ds


 X zm (s, Y )w m+1 (s, Y )



+ 

Y

X



1 ∂ zm+1 (s, Y )w m+1 (s, Y ) ds ∂s m + 1

1 zm+1 (X, Y )w m+1 (X, Y ) m+1  m+1 2  2  1 z  (X, Y ) + w m+1 (X, Y ) 2(m + 1) 2 m+1 
 X Y   1   D2 D1 f (s, t) dt ds = 2(m + 1) a c 2 m+1 
 X Y   D2 D1 g(s, t) dt ds +

=

a

{(X − a)(Y − c)}m+1  2(m + 1)

c

 X a

+

  D2 D1 f (s, t)2 dt ds

m+1

c

 X a



Y

Y

  D2 D1 g(s, t)2 dt ds

m+1

c

− c)}2m+1

{(X − a)(Y 2(m + 1)  X Y   D2 D1 L m, D2 D1 f (s, t), D2 D1 g(s, t) dt ds. × a

c

(3.7.28)

336

Chapter 3. Opial-Type Inequalities

Case II. Let (s, t) ∈ ∆2 and define z(s, t) =

 s a

w(s, t) =

d

(3.7.29)

  D2 D1 g(u, v) dv du.

(3.7.30)

  D2 D1 f (u, v) dv du,

(3.7.31)

  D2 D1 g(u, v) dv du.

(3.7.32)

  D2 D1 f (u, v) dv du,

(3.7.33)

  D2 D1 g(u, v) dv du.

(3.7.34)

t

 s a

  D2 D1 f (u, v) dv du,

d

t

Case III. Let (s, t) ∈ ∆3 and define z(s, t) =

 b s

w(s, t) =

t

c

 b s

t

c

Case IV. Let (s, t) ∈ ∆4 and define z(s, t) =

 b s

w(s, t) =

t

 b s

d

d

t

Now, by following similar arguments to those in the proof of Case I, but with suitable modifications, we obtain the following estimates in Cases II–IV:  X a

d

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

Y



{(X − a)(d − Y )}2m+1 2(m + 1)  X d   D2 D1 L m, D2 D1 f (s, t), D2 D1 g(s, t) dt ds, × a

 b

Y

(3.7.35)

Y

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

X c



{(b − X)(Y − c)}2m+1 2(m + 1)  b Y   D2 D1 L m, D2 D1 f (s, t), D2 D1 g(s, t) dt ds × X c

(3.7.36)

337

3.7. Opial-Type Inequalities in Two and Many Independent Variables

and  b

d

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

X Y



{(b − X)(d − Y )}2m+1 2(m + 1)  b d   D2 D1 L m, D2 D1 f (s, t), D2 D1 g(s, t) dt ds, ×

(3.7.37)

X Y

respectively. Let X = (a + b)/2, Y = (c + d)/2. Then X − a = b − X = (b − a)/2, Y − c = d − Y = (d − c)/2. It follows from (3.7.28) and (3.7.35)–(3.7.37) that  b a

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

d c

=

 X a

+

Y

c

 X a

+

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

 b

d

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

Y

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

d

  L m, f (s, t), g(s, t), D2 D1 f (s, t), D2 D1 g(s, t) dt ds

Y

X c

+

 b

X Y

 Km

 b a

d

  D2 D1 L m, D2 D1 f (s, t), D2 D1 g(s, t) dt ds.

c

The proof of Theorem 3.7.2 is complete. In order to prove Theorem 3.7.3, we make the following definitions in corresponding Cases I–IV considered in the proof of Theorem 3.7.2:  s t   D2 D1 h(u, v) dv du for (s, t) ∈ ∆1 , r(s, t) = (3.7.38) a

r(s, t) =

 s a

r(s, t) =

c d

(3.7.39)

  D2 D1 h(u, v) dv du for (s, t) ∈ ∆3 ,

(3.7.40)

t

 b s

  D2 D1 h(u, v) dv du for (s, t) ∈ ∆2 ,

c

t

338

Chapter 3. Opial-Type Inequalities

r(s, t) =

 b s

d

  D2 D1 h(u, v) dv du for (s, t) ∈ ∆4 .

(3.7.41)

t

Now we consider the details of the proof of the following case corresponding to Case I in the proof of Theorem 3.7.2. Case I 0 . Let (s, t) ∈ ∆1 as in Case I. It is easy to observe that for each fixed s, r(s, t), (s, t) ∈ ∆1 as in Case I, we have   h(s, t)  r(s, t) (3.7.42) and   D1 h(s, t) 



t

  D2 D1 h(s, v) dv

c

= D1 r(s, t).

(3.7.43)

From (3.7.26), (3.7.27), (3.7.42), (3.7.24), (3.7.25), (3.7.43) and using the elementary inequalities α1 α2 α3 (α1 + α2 + α3 )  13 (α1 α2 + α2 α3 + α3 α1 )2 , α1 α2 + α2 α3 + α3 α1  α12 + α22 + α32 , (α1 + α2 + α3 )2  3(α12 + α22 + α32 ) (for α1 , α2 , α3 reals), (3.7.19), (3.7.20), (3.7.38) and repeated application of Schwarz inequality, we obtain  X Y  N f (s, t), g(s, t), h(s, t), a

c

 

 D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t) dt ds X

  z(s, Y )w(s, Y )r(s, Y ) D1 z(s, Y ) + D1 w(s, Y ) + D1 r(s, Y )

a



  + z(s, Y ) + w(s, Y ) + r(s, Y )  × z(s, Y )w(s, Y )D1 r(s, Y )

 + w(s, Y )r(s, Y )D1 z(s, Y ) + r(s, Y )z(s, Y )D1 w(s, Y ) ds

  ∂  z(s, Y )w(s, Y )r(s, Y ) z(s, Y ) + w(s, Y ) + r(s, Y ) ds a ∂s   = z(X, Y )w(X, Y )r(X, Y ) z(X, Y ) + w(X, Y ) + r(X, Y ) =



X

2 1 z(X, Y )w(X, Y ) + w(X, Y )r(X, Y ) + r(X, Y )z(X, Y ) 3

3.7. Opial-Type Inequalities in Two and Many Independent Variables

339

2 1 2 z (X, Y ) + w 2 (X, Y ) + r 2 (X, Y ) 3  2 2  2  2  z (X, Y ) + w 2 (X, Y ) + r 2 (X, Y )

2 2   X Y   D2 D1 f (s, t) dt ds = 

a

+

c

  X a

+

  X a



Y

  D2 D1 g(s, t) dt ds

Y

  D2 D1 h(s, t) dt ds

c

2 2

2 2

c

3  (X − a)(Y − c)  X Y   × D2 D1 M 1, D2 D1 f (s, t), D2 D1 g(s, t), D2 D1 h(s, t) dt ds. a

c

The proofs of Cases II0 –IV0 corresponding to Cases II–IV follow by the same arguments as those given in the proof of Theorem 3.7.2 in view of the above proof of Case I0 with suitable modifications. We omit the remaining details of the proof of Theorem 3.7.3.  The inequalities in the following two theorems similar to those of Wirtingerand Opial-type inequalities are established by Pachpatte [267]. T HEOREM 3.7.4. Let p(x, y) be a real-valued nonnegative continuous function defined on ∆. Let fr (x, y), D1 fr (x, y), D2 D1 fr (x, y) be real-valued continuous functions defined on ∆ for r = 1, . . . , n with fr (a, y) = fr (b, y) = D1 fr (x, c) = D1 fr (x, d) = 0 for a  x  b, c  y  d. Then  b a

d



n    fr (x, y)mr p(x, y)

c

r=1

2/n dy dx


 b d  1 p(x, y) dy dx  K(a, b, c, d, n, m1 , . . . , mn ) n a c    n b d 2mr  D2 D1 fr (x, y) dy dx , × (3.7.44) a

c

r=1

340

Chapter 3. Opial-Type Inequalities

where mr
1, r = 1, . . . , n, are constants and K(a, b, c, d, n, m1 , . . . , mn )   2 nr=1 mr  1+ 2 nr=1 (mr −1) 1 n n = (b − a)(d − c) 4

(3.7.45)

is a constant depending on a, b, c, d, n, m1 , . . . , mn . R EMARK 3.7.3. In the special cases when (i) mr = 1 for r = 1, . . . , n, (ii) n = 2, (iii) n = 1, (iv) n = 2 and m1 = m2 = 1, and (v) n = 1 and m1 = 1, the inequality established in (3.7.44) reduces to some interesting inequalities of the Wirtinger type which are similar to the two independent variable analogues of the inequalities given by Pachpatte in [243] and Traple in [419]. T HEOREM 3.7.5. Let the functions p(x, y), fr (x, y), D1 fr (x, y), D2 D1 fr (x, y) be as in Theorem 3.7.4. Then  n 1/n  n   b d   m r  mr fr (x, y) D2 D1 fr (x, y) p(x, y) dy dx a

c

r=1


 b  K(a, b, c, d, n, m1 , . . . , mn ) a

r=1 d

1/2 2

p (x, y) dy dx c

   n   b d  2mr D2 D1 fr (x, y) × dy dx , a

c

(3.7.46)

r=1

where mr
1 ( for r = 1, . . . , n) are constants and K(a, b, c, d, n, m1 , . . . , mn ) is as defined in (3.7.45). R EMARK 3.7.4. If we take (i) mr = 1 for r = 1, . . . , n, (ii) n = 1, (iii) n = 1 and m1 = 1 in (3.7.46), then we get Opial-type inequalities similar to that of given by Traple in [419]. Further, in the special case when p(x, y) is constant, n = 1 and m1 = 1, the inequality in (3.7.46) reduces to the following inequality  b d    f1 (x, y)D2 D1 f1 (x, y) dy dx a

c



(b − a)(d − c) 4

 b a

d

  D2 D1 f1 (x, y)2 dy dx.

(3.7.47)

c

Here we note that the constant (b − a)(d − c)/4 involved in (3.7.47) is not the √ best possible constant. Inequality (3.7.47) with better constant (b −a)(d −c)/(8 2 ) is

3.7. Opial-Type Inequalities in Two and Many Independent Variables

341

established by Pachpatte in [260]. However, here our proof of inequality (3.7.46) depends on the inequality established in Theorem 3.7.4 which in turn does not yield the better constant obtained in [260]. P ROOFS OF T HEOREMS 3.7.4 AND 3.7.5. From the hypothesis of Theorem 3.7.4, it is easy to observe that the following identities hold: fr (x, y) =

 x

y

D2 D1 fr (s, t) dt ds, a

fr (x, y) = −

 x a

fr (x, y) = −

 b x

fr (x, y) =

(3.7.48)

c

d

D2 D1 fr (s, t) dt ds,

(3.7.49)

D2 D1 fr (s, t) dt ds,

(3.7.50)

y y

c

 b

d

D2 D1 fr (s, t) dt ds, x

(3.7.51)

y

for r = 1, . . . , n. From (3.7.48)–(3.7.51), we observe that   fr (x, y)  1 4

 b a

  D2 D1 fr (s, t) dt ds.

d

(3.7.52)

c

From (3.7) and using Hölder’s inequality with indices mr , mr /(mr − 1) for r = 1, . . . , n, we obtain
mr     m −1 b d  1 D2 D1 fr (s, t)mr dt ds. (b − a)(d − c) r 4 a c (3.7.53) From (3.7.53) and using the elementary inequalities   fr (x, y)mr 



n 

1/n

i=1

1 bi n n



bi

(3.7.54)

i=1

(for b1 , . . . , bn
0 reals and n
1) and 

n  i=1

2 bi

n

n  i=1

bi2

(3.7.55)

342

Chapter 3. Opial-Type Inequalities

(for b1 , . . . , bn reals), and Schwarz inequality, we obtain 

n    fr (x, y)mr

2/n

r=1


 2 nr=1 mr   2 n (m −1) 1 n (b − a)(d − c) n r=1 r  4  n
   b d   D2 D1 fr (s, t)mr dt ds ×



a

r=1 n

1/n 2

c


 r=1 mr   2 n (m −1) 1 (b − a)(d − c) n r=1 r 4  n
  2 b d  mr 1   D2 D1 fr (s, t) dt ds × n a c 2 n

r=1


 2 n  2 n (m −1) 1 1 n r=1 mr  (b − a)(d − c) n r=1 r  n 4  n
  2  b d   mr D2 D1 fr (s, t) dt ds × r=1

a

c

1  K(a, b, c, d, n, m1 , . . . , mn ) n   b d   n 2mr    D2 D1 fr (s, t) × dt ds. a

c

(3.7.56)

r=1

Multiplying both sides of (3.7.56) by p(x, y) and integrating the resulting inequality on ∆ we have  b a

d



n    fr (x, y)mr p(x, y)

c

r=1

2/n dy dx


 b d  1 p(x, y) dy dx  K(a, b, c, d, n, m1 , . . . , mn ) n a c      n b d  2mr D2 D1 fr (x, y) dy dx . × a

c

r=1

3.7. Opial-Type Inequalities in Two and Many Independent Variables

343

This result is the desired inequality in (3.7.44) and the proof of Theorem 3.7.4 is complete. From the hypotheses of Theorem 3.7.5 we have inequality (3.7.44). By using Schwarz inequality and inequalities (3.7.44) and (3.7.55), we observe that  b a

d



n    fr (x, y)mr p(x, y)

c



r=1

  b a

d



p 2 (x, y)

c

1/n 

 n   mr  D2 D1 fr (x, y) dy dx r=1

n 

  fr (x, y)mr

1/2

2/n dy dx

r=1

   n 1/2 2 b d   mr D2 D1 fr (x, y) × dy dx a

 

c

r=1


 b d  1 K(a, b, c, d, n, m1 , . . . , mn ) p 2 (x, y) dy dx n a c      n b d  2mr   D2 D1 fr (x, y) dy dx × a

×

c

  b a

1/2

r=1

d



 n  2mr    D2 D1 fr (x, y) n dy dx

c

1/2

r=1


 b = K(a, b, c, d, n, m1 , . . . , mn ) a

d

1/2 p 2 (x, y) dy dx

c

   n  b d  2mr D2 D1 fr (x, y) × dy dx , a

c

r=1

which is the desired inequality in (3.7.46) and the proof of Theorem 3.7.5 is complete.  In the following theorems, we shall deal with some Opial-type inequalities involving functions of several independent variables established by Pachpatte in [261,284]. First we will introduce some notations which we will use in our discussion. Let R denote the set of real numbers and Rn the n-dimensional # Euclidean space. Let B be a bounded domain in Rn defined by B = ni=1 [ai , bi ].

344

Chapter 3. Opial-Type Inequalities

Let x = (x1 , . . . , xn ) denote a variable point in B, Bx =

#n

i=1 [ai , xi ] and ∂ ∂xk h(x1 , . . . , xn ),

Dk h(x1 , . . . , xn ) = dx = dx1 · · · dxn . Let Dh(u) = ∂k 1  k  n, and D k h(x1 , . . . , xn ) = ∂x1 ··· ∂xn h(x1 , . . . , xn ) = D1 · · · Dk h(x1 , D1 h = D 1 h. For any . . . , xn ), 1  k  n. By using the above notation we have

real-valued function u(x) defined on B, we denote by B u(x) dx the n-fold inte b

b gral ann · · · a11 u(x1 , . . . , xn ) dx1 · · · dxn , and for x ∈ B we denote by Bx u(y) dy

xn x1 the n-fold integral an · · · a1 u(y1 , . . . , yn ) dy1 · · · dyn and | grad u(x)| = ( ni=1 | ∂x∂ i |2 )1/2 . We denote by F (B) the class of continuous functions u(x) : B → R for which D n u(x) = D1 · · · Dn u(x) (Di = ∂x∂ i ) exists and that, for each i, 1  i  n, u(x)|xi =ai = 0. In [261] Pachpatte has established the following Opial-type integral inequality. d du h(u),

T HEOREM 3.7.6. Let p
1, q
1 be constants. Let u be a real-valued function belonging to C 1 (B) which vanishes on the boundary ∂B of B. Then the following inequality holds 

    u(x)p  grad u(x)q dx  M

B



   grad u(x)p+q dx,

(3.7.57)

B

where q/(p+q)
  n 1 1 p  p(p+q)/q M= (bj − aj ) . n 2

(3.7.58)

j =1

P ROOF. From the hypotheses, we have the following identities nu(x) =

n  

xj

j =1 aj

nu(x) = −

n  

∂ u(x1 , . . . , tj , . . . , xn ) dtj , ∂tj bj

j =1 xj

∂ u(x1 , . . . , tj , . . . , xn ) dtj . ∂tj

(3.7.59)

(3.7.60)

From (3.7.59) and (3.7.60), we observe that n    u(x)  1 2n



bj

j =1 aj

   ∂    u(x , . . . , t , . . . , x ) 1 j n  dtj .  ∂t j

(3.7.61)

345

3.7. Opial-Type Inequalities in Two and Many Independent Variables

Using Hölder’s inequality with indices (p + q)/(p + q − 1) and p + q to the integral on the right-hand side of (3.7.61), we obtain n    u(x)  1 (bj − aj )(p+q−1)/(p+q) 2n j =1




 p+q 1/(p+q)  ∂    . u(x , . . . , t , . . . , x ) dtj 1 j n   ∂t

bj

×

j

aj

(3.7.62) Taking pth power on both sides of (3.8.62) and using the elementary inequality  n k n   ci  Mk,n cik , (3.7.63) i=1

i=1

where c1 , . . . , cn
0 reals and Mk,n = nk−1 , k > 1, and Mk,n = 1, 0  k  1, we obtain   u(x)p
p n  1 p−1 (bj − aj )p(p+q−1)/(p+q)  n 2n j =1


 ×

bj

aj

 p+q p/(p+q)  ∂    . u(x , . . . , t , . . . , x ) dtj 1 j n   ∂t j

(3.7.64) Multiplying both sides of (3.7.64) by | grad u(x)|q we have     u(x)p  grad u(x)q
 n q  1 1 p (bj − aj )p(p+q−1)/(p+q)  grad u(x)  n 2 j =1


 ×

bj

aj

 p+q p/(p+q)  ∂    . dtj  ∂t u(x1 , . . . , tj , . . . , xn ) j

(3.7.65) Integrating both sides of (3.7.65) with respect to x1 , . . . , xn on B and using Hölder’s inequality for integrals with indices (p + q)/p and (p + q)/q on the

346

Chapter 3. Opial-Type Inequalities

right-hand side we get 

    u(x)p  grad u(x)q dx

B




 n q/(p+q)   1 1 p  grad u(x)p+q dx (bj − aj )p(p+q−1)/(p+q) n 2 B j =1




bj

× B

aj

 p+q  p/(p+q)  ∂    u(x , . . . , t , . . . , x ) dtj dx 1 j n   ∂t j


 n 1 1 p (bj − aj )p(p+q−1)/(p+q) (bj − aj )p/(p+q) = n 2 j =1

 ×

   grad u(x)p+q dx

q/(p+q)

B

p+q p/(p+q)    ∂    . × dx  ∂x u(x)

(3.7.66)

j

B

Now, using Hölder’s inequality for sum with indices (p + q)/p and (p + q)/q on the right-hand side of (3.7.66) and an application of a suitable version of inequality (3.7.63), we obtain 

    u(x)p  grad u(x)q dx

B


  n    1 1 p   grad u(x)p+q dx (bj − aj )p(p+q)/q  n 2 B

q/(p+q)

j =1



p+q n     ∂    × dx  ∂x u(x) j B

p/(p+q)

j =1



   grad u(x)p+q dx

=M B

  × B

q/(p+q)

p+q 2/(p+q) (p+q)/2 n    ∂    dx  ∂x u(x) j =1

j

p/(p+q)

347

3.7. Opial-Type Inequalities in Two and Many Independent Variables



   grad u(x)p+q dx

M 

q/(p+q) 

B

   grad u(x)p+q dx

q/(p+q)

B

   grad u(x)p+q dx.

=M B



This inequality is required in (3.7.57) and the proof is complete.

A slightly different version of Theorem 3.7.6 also given by Pachpatte in [261] is embodied in the following theorem. T HEOREM 3.7.7. Let pr
1, qr
1, r = 1, . . . , m, be constants. Let ur , r = 1, . . . , m, be real-valued functions belonging to C 1 (B) which vanish on the boundary ∂B of B. Then, the following inequality holds    m m        ur (x)pr  grad ur (x)qr dx  1  grad ur (x)m(pr +qr ) dx, Mr m B B r=1

r=1

(3.7.67) where qr /(pr +qr )
  n 1 1 mpr  mpr (pr +qr )/qr Mr = (bj − aj ) n 2

(3.7.68)

j =1

for r = 1, . . . , m. P ROOF. Using the elementary inequality 

m  i=1

1/m ci

1 ci m m



i=1

(for c1 , . . . , cn
0 reals), inequality (3.7.63) and the repeated application of inequality (3.7.57) we observe that   m     ur (x)pr  grad ur (x)qr dx B r=1

 m   m pr  qr 1/m  ur (x)  grad ur (x) = dx B

r=1

348

Chapter 3. Opial-Type Inequalities

   B

m p  q 1   ur (x) r  grad ur (x) r m

m dx

r=1

1  Mr m m

r=1



   grad ur (x)m(pr +qr ) dx. B



This inequality is desired in (3.7.67) and the proof is complete.

In [284] Pachpatte has established the following Opial-type inequality involving functions of several variables. T HEOREM 3.7.8. Let u ∈ F (B). Then the following inequality holds     u(x)D1 · · · Dn u(x) dx B

  n    (xi − ai ) B

Bx

i=1




 1/2   D1 · · · Dn u(y)2 dy dx

  D1 · · · Dn u(x)2 dx

×

1/2 .

(3.7.69)

B

P ROOF. For any u ∈ F (B) we have the following identity  u(x) = D1 · · · Dn u(y) dy.

(3.7.70)

Bx

From (3.7.70) and using Schwarz inequality in the integral form, we observe that      u(x)  D1 · · · Dn u(y) dy Bx

 

1/2
 n  (xi − ai )

  D1 · · · Dn u(y)2 dy

1/2 .

(3.7.71)

Bx

i=1

Now, by using Schwarz inequality in the integral form, we have     u(x)D1 · · · Dn u(x) dx B




  u(x)2 dx

 B

1/2
 B

  D1 · · · Dn u(x)2 dx

1/2 .

(3.7.72)

349

3.8. Discrete Opial-Type Inequalities

Using (3.7.71) on the right-hand side of (3.7.72) we get the required inequality in (3.7.69) and the proof is complete.  R EMARK 3.7.5. It is easy to observe that      n 2    D1 · · · Dn u(y) dy dx (xi − ai ) B

Bx

i=1

 
   n     D1 · · · Dn u(y)2 dy (xi − ai ) dx  B

=

B

i=1

n 1  (bi − ai )2 2n i=1



  D1 · · · Dn u(x)2 dx.

(3.7.73)

B

Now, using (3.7.73) on the right-hand side of (3.7.69), we have the following inequality     u(x)D1 · · · Dn u(x) dx B

 n 2  1   √ (bi − ai ) D1 · · · Dn u(x) dx. ( 2 )n i=1 B

(3.7.74)

If we take n = 1 in (3.7.74) and denote by a1 = a, b1 = b, D1 u = u
, x1 = x, then inequality (3.7.74) reduces to the following inequality 

  −a u(x)u
(x) dx  b√ 2

b a



 u
(x)2 dx.

b

(3.7.75)

a

Here we note that the constant appearing in (3.7.75) is greater than the constant obtained in Opial’s inequality given in Theorem 2
in [211, p. 154]. The main reason for increase is the difficulty involved in proving the much more general inequality given in (3.7.74).

3.8 Discrete Opial-Type Inequalities In 1967, Wong [426] has established the following discrete inequality n  i=1

p ui (ui

n (n + 1)p  − ui−1 )  (ui − ui−1 )p+1 , p+1 i=1

(3.8.1)

350

Chapter 3. Opial-Type Inequalities

valid for a nondecreasing sequence {ui } of nonnegative real numbers with u0 = 0 and p
1. Inequality (3.8.1) is a discrete analogue of the variant of Opial’s inequality given by Hua in [158]. In the past few years many results have appeared in the literature concerning various extensions and variants of inequality (3.8.1), see [4] and the references therein. In this section we shall deal with some discrete inequalities investigated by Pachpatte in [235,262,280,287,318,347] which claim their origin to the discrete analogue of Opial’s inequality. Before giving the results we first introduce some of the notations and definitions used in our discussion. Let N = {1, 2, . . . }, N0 = {0, 1, 2, . . . }, N0,n = {0, 1, 2, . . . , n}, Nn+1 = {1, 2, . . . , n + 1}, n ∈ N;  and ∇ are the forward and backward difference operators defined by uk = uk+1 − uk , k ∈ N0 , ∇uk = uk − uk−1 , k ∈ N. The symbol i uk = (i−1 uk ) = i−1 (uk ), where 0 uk = uk . Throughout, we shall use the convention that the empty sums and products are taken to be 0 and 1, respectively. An interesting Opial-type discrete inequality involving two sequences and their forward differences, established by Pachpatte in [262], is given in the following theorem. T HEOREM 3.8.1. Let {uk } and {vk }, k ∈ N0 , be nondecreasing sequences of nonnegative real numbers with u0 = v0 = 0. Then the following inequality holds n−1 n−1    n   uk vk + vk+1 uk  (uk )2 + (vk )2 2 k=0

(3.8.2)

k=0

for all n ∈ N0 . P ROOF. It is easy to observe that the following identity holds (uk vk ) = uk vk + vk+1 uk

(3.8.3)

for k ∈ N0 . From (3.8.3) we obtain n−1  [uk vk + vk+1 uk ] = un vn

(3.8.4)

k=0

for n ∈ N0 . Using the elementary inequality αβ  12 (α 2 + β 2 ) (for α, β reals) n−1 and the facts that un = n−1 k=0 uk , vn = k=0 vk , and Schwarz inequality, we observe that 2  n−1 2   n−1   1 un vn  uk + vk 2 k=0

k=0

351

3.8. Discrete Opial-Type Inequalities

 n  (uk )2 + (vk )2 . 2 n−1



(3.8.5)

k=0

The desired inequality in (3.8.2) follows from (3.8.4) and (3.8.5). The proof is complete.  As an immediate consequence of Theorem 3.8.1 established in [262] is embodied in the following theorem. T HEOREM 3.8.2. Let {uk }, k ∈ N0 , be a nondecreasing sequence of nonnegative real numbers with u0 = 0. Then the following inequality holds n−1 

n+1  (uk )2 2 n−1

uk+1 uk 

k=0

(3.8.6)

k=0

for all n ∈ N0 . P ROOF. Setting vk = uk , k ∈ N0 , in (3.8.2), we have n−1 n−1   [uk + uk+1 ]uk  n (uk )2 . k=0

(3.8.7)

k=0

We observe that n−1 n−1   [uk + uk+1 ]uk = [−uk + 2uk+1 ]uk k=0

k=0

=−

n−1  k=0

(uk ) + 2 2

n−1 

uk+1 uk .

(3.8.8)

k=0

From (3.8.7) and (3.8.8) we obtain the desired inequality in (3.8.6) and the proof is complete.  The following Wirtinger-type discrete inequality established in [347] is useful in the proof of the next result. T HEOREM 3.8.3. Let p
1 be a given real number and {ak }, k ∈ N0,n , be a sequence of nonnegative real numbers. Let {uk }, k ∈ N0,n , be a sequence of real

352

Chapter 3. Opial-Type Inequalities

numbers with u0 = un = 0. Then the following inequality holds n−1  k=0

 n−1  n−1     1−p 1−p −1 p k ak |uk |  + (n − k) ak |uk | . p

k=0

(3.8.9)

k=0

P ROOF. From the hypotheses, we have uk =

k−1 

uσ ,

(3.8.10)

σ =0

uk = −

n−1 

uσ ,

(3.8.11)

σ =k

for k ∈ N0,n . From (3.8.10), (3.8.11) and using Hölder’s inequality with indices p, p/(p − 1), we obtain |uk |p  k p−1

k−1 

|uσ |p ,

(3.8.12)

σ =0

|uk |p  (n − k)p−1

n−1 

|uσ |p ,

(3.8.13)

σ =k

for k ∈ N0,n . Multiplying (3.8.12) by k 1−p and (3.8.13) by (n − k)1−p and adding the resulting inequalities we obtain n−1   1−p  k + (n − k)1−p |uk |p  |uσ |p

(3.8.14)

σ =0

for k ∈ N0,n . From (3.8.14) we observe that n−1 −1   ak |uk |p  k 1−p + (n − k)1−p ak |uσ |p

(3.8.15)

σ =0

for k ∈ N0,n . Now summing both sides of (3.8.15) from k = 0 to n − 1 we get inequality (3.8.9). The proof is complete.  The following result established in [347] deals with the discrete Opial-type inequality.

353

3.8. Discrete Opial-Type Inequalities

T HEOREM 3.8.4. Let q > 0, r
0, α > 0, β > 0 be real numbers with 1 1 α + β = 1 and qα
1, and {bk }, k ∈ N0,n , be a sequence of nonnegative real numbers. Let {xk } and {yk }, k ∈ N0,n , be sequences of real numbers with x0 = y0 = xn = yn = 0. Then the following inequality holds n−1 

  bk |xk |q |yk |r + |yk |q |xk |r

k=0

 n−1 1/α   1−qα 1−qα −1 α  k + (n − k) bk k=0

 n−1

  1  1  qα qα rβ rβ |xk | + |yk | + |xk | + |yk | × . α β k=0

(3.8.16) P ROOF. From Hölder’s inequality with indices α and β, we have n−1 

bk |xk | |yk |  q

r

 n−1 

k=0

bkα |xk |qα

1/α  n−1 

k=0

1/β |yk |

rβ

.

(3.8.17)

k=0

From (3.8.17) and (3.8.9) and Young’s inequality, we observe that n−1 

bk |xk |q |yk |r

k=0



 n−1 

−1 α k 1−qα + (n − k)1−qα bk

 n−1 

k=0

×

n−1 



1/α

|xk |

qα

k=0 1/β

|yk |

rβ

k=0

 n−1 1/α   −1 k 1−qα + (n − k)1−qα  bkα k=0

×

 n−1  1 k=0

1 |xk |qα + |yk |rβ α β

 .

(3.8.18)

354

Chapter 3. Opial-Type Inequalities

Similarly, we obtain n−1 

 n−1 1/α   1−qα 1−qα −1 α k bk |yk | |xk |  + (n − k) bk q

r

k=0

k=0

×

 n−1  1 α

k=0

|yk |

qα

1 + |xk |rβ β

 .

(3.8.19)

Adding (3.8.18) and (3.8.19) gives inequality (3.8.16). The proof is complete.  The inequality in the following theorem is established in [280]. T HEOREM 3.8.5. Let {ui }, i ∈ N0 , be a sequence of real numbers with u0 = 0. j Let f (t) be defined for all t = ui and for all t of the form t (j ) = k=1 ∇uk , |f (t)|  f (|t|) for all t and that f (t) is nondecreasing for t
0, where ∇uk = uk − uk−1 . Then the following inequality holds  n  n     f (ui )∇ui   F |∇ui | i=1

i=1

  i−1    i n    + |∇uk | − f |∇uk | |∇ui |, (3.8.20) f i=1

where F (s) =

s 0

k=1

k=1

f (σ ) dσ , s
0.

R EMARK 3.8.1. If we take f (t) = t, then we get F (s) = s 2 /2, and inequality (3.8.20) reduces to the following inequality n 


|ui ∇ui | 

i=1

 n n +1 |∇ui |2 . 2

(3.8.21)

i=1

P ROOF OF T HEOREM 3.8.5. Since ui =

i

k=1 ∇uk ,

it follows that

  i   n n          f (ui )∇ui  = ∇uk ∇ui  f   i=1

i=1



n  i=1

 f

k=1

i  k=1



|∇uk | |∇ui |.

(3.8.22)

355

3.8. Discrete Opial-Type Inequalities

Now, from the definition of F and the properties of the function f , we obtain  i   i−1    F |∇uk | − F |∇uk | k=1  i

=

k=1

k=1 |∇uk |

i−1


f

k=1 |∇uk |

 i−1  

=f

k=1 i 

f (σ ) dσ 

|∇uk | |∇ui | 

  i−1   i    |∇uk | |∇ui | + f |∇uk | − f |∇uk | |∇ui |.

k=1

k=1

k=1

(3.8.23) From (3.8.23) we observe that  i   i   i−1     f |∇uk | |∇ui |  F |∇uk | − F |∇uk | k=1

k=1

  + f

i 



k=1

|∇uk | − f

k=1

 i−1 

 |∇uk |

|∇ui |.

k=1

(3.8.24) Now, substituting i = 1, . . . , n on both sides of inequality (3.8.24) and summing up, we obtain  i   n  n    f |∇uk | |∇ui |  F |∇uk | i=1

k=1

k=1

  i−1    i n    + |∇uk | − f |∇uk | |∇ui |. f i=1

k=1

k=1

(3.8.25) Replacing k by i in the first term on the right-hand side in (3.8.25) and using this bound in (3.8.22) we obtain the desired inequality in (3.8.20). The proof is complete.  The following theorem deals with the discrete Opial-type inequalities established in [318].

356

Chapter 3. Opial-Type Inequalities

T HEOREM 3.8.6. Let p
1, q
1 be constants. Let λn > 0, an
0 and Λn = λ1 + · · · + λn , An = λ1 a1 + · · · + λn an for n ∈ N. Then the following inequalities hold p+q−1 
p q q m m  An (An − An−1 ) p+q p+q  q λn an , (3.8.26) p+q−1 p + q − 1 Λn n=1 n=1 m  n=1

m q(m + 1)p+q−1  p q q  An An − An−1  (λn an )p+q , p+q

(3.8.27)

n=1

where any number with suffix zero is equal to 0. P ROOF. Since An−1  An , we have p q An An

p  − An−1

=

p An

 q−1 

 q−1−k k An An−1

(An − An−1 )

k=0 p+q−1

 qAn

(An − An−1 ),

(3.8.28)

which implies, by using Hölder’s inequality with indices p + q, (p + q)/ (p + q − 1) and a suitable version of Theorem 2.2.2, the inequality p q p m  An (An − An−1 ) p+q−1

n=1

q

Λn m 
n=1

=q

m 

An Λn

p+q−1 (λn an )


1/(p+q)

λn

n=1

 q  q

m 

1/(p+q)  p+q λn an

n=1 m 

(p+q−1)/(p+q)

an λn

m 

=q

λn

n=1

1/(p+q) 
p+q λn an

n=1







p+q p+q −1

p+q−1  m n=1

An Λn

p+q−1

An Λn

p+q p+q −1 p+q

λn an

,

p+q (p+q−1)/(p+q)

p+q  m n=1

(p+q−1)/(p+q) p+q λn an

357

3.8. Discrete Opial-Type Inequalities

proving (3.8.26). From (3.8.28), using inequality (3.8.1), we have m 

m  p q q  p+q−1 An An − An−1  q An (An − An−1 )

n=1

n=1



m q(m + 1)p+q−1  (An − An−1 )p+q p+q n=1

=

m q(m + 1)p+q−1  (λn an )p+q , p+q n=1

which proves (3.8.27). The proof is complete.



Before giving the next theorem, we introduce the basic notations and definitions needed in our discussion. Let N = {1, 2, . . . } and N0,n = {0, 1, 2, . . . , n}, M0,m = {0, 1, 2, . . . , m} for m, n ∈ N and Q = N0,n × M0,m . We shall use the usual convention of writing z(x, y) = 0 if x ∈ / N0,n or y ∈ / M0,m , or both x ∈ / N0,n and y ∈ / M0,m , where z(x, y) is a function defined on Q. We define the operators: ∇1 z(x, y) = z(x, y) − z(x − 1, y), ∇2 z(x, y) = z(x, y) − z(x, y − 1), ∇2 ∇1 z(x, y) = ∇1 z(x, y) − ∇1 z(x, y − 1) for (x, y) ∈ Q. The inequalities in the following theorem are established in [235]. T HEOREM 3.8.7. Let f (x, y) and g(x, y) be real-valued functions defined for (x, y) ∈ Q such that f (0, y) = g(0, y) = 0, f (n, y) = g(n, y) = 0, f (x, 0) = g(x, 0) = 0, f (x, m) = g(x, m) = 0. Then the following inequalities hold n  m     f (x, y)g(x, y) x=1 y=1




 n m 2  2  1 nm 2   ∇2 ∇1 f (x, y) + ∇2 ∇1 g(x, y) , 2 4

(3.8.29)

x=1 y=1

n  m 

      f (x, y)∇2 ∇1 g(x, y) + g(x, y)∇2 ∇1 f (x, y)

x=1 y=1




 n m 2  2  nm   ∇2 ∇1 f (x, y) + ∇2 ∇1 g(x, y) . 4 x=1 y=1

(3.8.30)

358

Chapter 3. Opial-Type Inequalities

R EMARK 3.8.2. If we take g(x, y) = f (x, y) in (3.8.29) and (3.8.30), then we get respectively the following inequalities 2 
n  n  m m      f (x, y)2  nm ∇2 ∇1 f (x, y)2 , 4 x=1 y=1

x=1 y=1

(3.8.31) n  m 

   f (x, y)∇2 ∇1 f (x, y) 




x=1 y=1

nm 4

 n  m

  ∇2 ∇1 f (x, y)2 .

x=1 y=1

(3.8.32) We note that the inequalities obtained in (3.8.31) and (3.8.32) are respectively the discrete Wirtinger- and Opial-type inequalities in two independent variables. P ROOF OF T HEOREM 3.8.7. From the hypotheses, it is easy to observe that the following identities hold f (x, y) =

y x  

∇2 ∇1 f (s, t),

(3.8.33)

s=1 t=1

f (x, y) = −

x  m 

∇2 ∇1 f (s, t),

(3.8.34)

∇2 ∇1 f (s, t),

(3.8.35)

∇2 ∇1 f (s, t).

(3.8.36)

n  m      ∇2 ∇1 f (s, t). 4f (x, y) 

(3.8.37)

s=1 t=y+1

f (x, y) = −

y n   s=x+1 t=1

f (x, y) =

n 

m 

s=x+1 t=y+1

From (3.8.33)–(3.8.36), we obtain

s=1 t=1

Similarly, we obtain n  m        ∇2 ∇1 g(s, t). 4 g(x, y)  s=1 t=1

(3.8.38)

359

3.8. Discrete Opial-Type Inequalities

From (3.8.37), (3.8.38), and using the elementary inequality αβ  12 (α 2 + β 2 ) (for α, β reals) and Schwarz inequality, we obtain n  m     f (x, y)g(x, y) x=1 y=1

 n m   n m n m    1      ∇2 ∇1 g(s, t)  ∇2 ∇1 f (s, t) 16 x=1 y=1


=

nm 16

s=1 t=1

  n  m

s=1 t=1

  ∇2 ∇1 f (s, t)



s=1 t=1


1 nm  2 16



n  m    ∇2 ∇1 g(s, t)



s=1 t=1

n  m    ∇2 ∇1 f (s, t) s=1 t=1

2

 +

n  m    ∇2 ∇1 g(s, t)

2 

s=1 t=1




 n m 2  2  1 nm 2   ∇2 ∇1 f (x, y) + ∇2 ∇1 g(x, y) .  2 4 x=1 y=1

This result completes the proof of inequality (3.8.29). By using Schwarz inequality, inequality (3.8.31) and the elementary inequality α 1/2 β 1/2  12 (α + β) (for α, β
0 reals), we observe that n  m        f (x, y)∇2 ∇1 g(x, y) + g(x, y)∇2 ∇1 f (x, y) x=1 y=1



n  m    f (x, y)2 

1/2  n m 

x=1 y=1

x=1 y=1



nm 4

1/2

x=1 y=1

 n m   g(x, y)2 + 


  ∇2 ∇1 g(x, y)2

2  n  m x=1 y=1

1/2  n m 

  ∇2 ∇1 f (x, y)2

1/2

x=1 y=1

  ∇2 ∇1 f (x, y)2

1/2  n m  x=1 y=1

  ∇2 ∇1 g(x, y)2

1/2

360

Chapter 3. Opial-Type Inequalities


+

nm 4






nm =2 4


2  m n 

  ∇2 ∇1 g(x, y)2

1/2  n m 

x=1 y=1 n  m    ∇2 ∇1 f (x, y)2

  ∇2 ∇1 f (x, y)2

1/2

x=1 y=1 1/2  n m 

x=1 y=1

  ∇2 ∇1 g(x, y)2

1/2

x=1 y=1

 n m 2  2  nm   ∇2 ∇1 f (x, y) + ∇2 ∇1 g(x, y) , 4 x=1 y=1



which is the desired inequality in (3.8.30), and the proof is complete. In [287] Pachpatte has established the inequalities in the following theorem.

T HEOREM 3.8.8. Let u(x, y) be a real-valued function defined for (x, y) ∈ Q such that u(0, y) = u(n, y) = 0, u(x, 0) = u(x, m) = 0 and 1  pi < ∞ for i = 1, 2, 3, 4 be constants. Then the following inequalities hold n  m          u(x, y)p1 ∇1 u(x, y)p2 ∇2 u(x, y)p3 ∇2 ∇1 u(x, y)p4 x=1 y=1

 n m 4     ∇2 ∇1 u(x, y)2pi K

1/2

,

(3.8.39)

i=1 x=1 y=1 n  m        u(x, y)p1 ∇1 u(x, y)p2 ∇2 u(x, y)p3 x=1 y=1

 n m 3     ∇2 ∇1 u(x, y)pi , L

(3.8.40)

i=1 x=1 y=1

where
2p1 +p2 +p3 1 np1 +p3 −1 mp1 +p2 −1 , 2
2p1 +p2 +p3 1 L= np1 +p3 −2 mp1 +p2 −2 . 2

K=

(3.8.41) (3.8.42)

361

3.8. Discrete Opial-Type Inequalities

P ROOF. From the hypotheses, it is easy to observe that the following identities hold: u(x, y) =

y x  

∇2 ∇1 u(s, t),

(3.8.43)

s=1 t=1

u(x, y) = −

m x  

∇2 ∇1 u(s, t),

(3.8.44)

∇2 ∇1 u(s, t),

(3.8.45)

∇2 ∇1 u(s, t),

(3.8.46)

s=1 t=y+1 y n  

u(x, y) = −

s=x+1 t=1

u(x, y) =

n 

m 

s=x+1 t=y+1

∇1 u(x, y) =

y 

∇2 ∇1 u(x, t),

(3.8.47)

t=1

∇1 u(x, y) = −

m 

∇2 ∇1 u(x, t),

(3.8.48)

t=y+1

∇2 u(x, y) =

x 

∇2 ∇1 u(s, y),

(3.8.49)

s=1

∇2 u(x, y) = −

n 

∇2 ∇1 u(s, y),

(3.8.50)

s=x+1

for (x, y) ∈ Q. From (3.8.43)–(3.8.46), (3.8.47), (3.8.48) and (3.8.49), (3.8.50), we observe that   u(x, y) 


2  n  m   1 ∇2 ∇1 u(s, t), 2

(3.8.51)

s=1 t=1

m      ∇1 u(x, y)  1 ∇2 ∇1 u(x, t), 2

(3.8.52)

n      ∇2 u(x, y)  1 ∇2 ∇1 u(s, y), 2

(3.8.53)

t=1

s=1

362

Chapter 3. Opial-Type Inequalities

respectively, for (x, y) ∈ Q. Taking on both sides of (3.8.51), (3.8.52) and (3.8.53) the powers p1 , p2 and p3 , respectively, and using Hölder’s inequality with indices p1 , p1 /(p1 − 1); p2 , p2 /(p2 − 1) and p3 , p3 /(p3 − 1), respectively, on the righthand sides we get   u(x, y)p1 


2p1 n  m    1 ∇2 ∇1 u(s, t)p1 , (nm)p1 −1 2

(3.8.54)


p2 m    1 p2 −1 ∇2 ∇1 u(x, t)p2 , m 2

(3.8.55)


p3 n    1 ∇2 ∇1 u(s, y)p3 , np3 −1 2

(3.8.56)

s=1 t=1

  ∇1 u(x, y)p2 

t=1

  ∇2 u(x, y)p3 

s=1

respectively. From (3.8.54)–(3.8.56), we observe that         u(x, y)p1 ∇1 u(x, y)p2 ∇2 u(x, y)p3 ∇2 ∇1 u(x, y)p4  n m  m  p1      ∇2 ∇1 u(x, t)p2 ∇2 ∇1 u(s, t) L s=1 t=1

 ×

n 

t=1

    ∇2 ∇1 u(s, y)p3 ∇2 ∇1 u(x, y)p4 ,

(3.8.57)

s=1

where L is defined by (3.8.42). Now, taking the sum on both sides of (3.8.57), first from y = 1 to m and then from x = 1 to n, and using Schwarz inequality and rewriting the sums, we observe that n  m          u(x, y)p1 ∇1 u(x, y)p2 ∇2 u(x, y)p3 ∇2 ∇1 u(x, y)p4 x=1 y=1



L

n  m    ∇2 ∇1 u(s, t)p1 s=1 t=1

 m  n n  m   p2       ∇2 ∇1 u(x, t) ∇2 ∇1 u(s, y)p3 ∇2 ∇1 u(x, y)p4 × x=1 y=1

 L

n  m  s=1 t=1

t=1

  ∇2 ∇1 u(s, t)p1

s=1

363

3.9. Miscellaneous Inequalities



 m 2  n 2 m n     p2 p3 ∇2 ∇1 u(x, t) ∇2 ∇1 u(s, y) × x=1 y=1

 ×

t=1

1/2

s=1

n  m    ∇2 ∇1 u(x, y)2p4

1/2

x=1 y=1

  L(nm)

1/2

1/2

n  m    ∇2 ∇1 u(x, y)2p1

(nm)1/2

x=1 y=1



 m  n  n  m    2p2 2p3     ∇2 ∇1 u(x, t) ∇2 ∇1 u(s, y) × x=1 y=1

 ×

t=1

1/2

s=1

n  m    ∇2 ∇1 u(x, y)2p4

1/2

x=1 y=1

 n m 4     ∇2 ∇1 u(x, y)2pi =K

1/2

.

i=1 x=1 y=1

This result completes the proof of inequality (3.8.39). The proof of inequality (3.8.40) follows by closely looking at the proof of inequality (3.8.39) and here we omit the details.  For various other discrete Opial-type inequalities, see [4,270,284,360] and some of the references given therein.

3.9 Miscellaneous Inequalities 3.9.1 Agarwal and Pang [5] Let α
1 be a given real number and let p be a nonnegative and continuous function on [0, h]. Further, let u be an absolutely continuous function on [0, h], with u(0) = u(h) = 0. Then the following inequality holds  0

h

 α 1 p(t)u(t) dt  2




h

(α−1)/2 t (h − t) p(t) dt

0

 0

 u
(t)α dt.

h

364

Chapter 3. Opial-Type Inequalities

For p(t) = constant, the above inequality reduces to 

 h α
 
2 u(t)α dt  h B α + 1 , α + 1 u (t) dt, 2 2 2 0

h

0

where B is the beta function. 3.9.2 Agarwal and Pang [5] Let r > 0, s
0, α > 0 and β > 0 be real numbers with α1 + β1 = 1 and rα
1, and let p ∈ C 0 [0, h] be nonnegative. Furthermore, let f and g be absolutely continuous on [0, h] with f (0) = g(0) = f (h) = g(h) = 0. Then the following inequality holds 

h 0

r  r  s  s   p(x) f (x) g
(x) + f
(x) g(x) dx

  h   
rα 
rα  1 1 h 
sβ 
sβ      f (x) + g (x) f (x) + g (x)  I1 dx + dx , α 0 β 0

where I1 =


 h 1/α  (rα−1)/2 α 1 x(h − x) p (x) dx . 2 0

3.9.3 Alzer [11] Let r > 0, s
0, α > 0 and β > 0 be real numbers with α1 + β1 = 1 and rα
1, and let p ∈ C 0 [0, h] be nonnegative. Furthermore, let f and g be absolutely continuous on [0, h] with f (0) = g(0) = f (h) = g(h) = 0. Then the following inequality holds 

h 0

r  r  s  s   p(x) f (x) g
(x) + f
(x) g(x) dx

  h   
rα 
rα  1 1 h 
sβ 
sβ      f (x) + g (x) f (x) + g (x)  I2 dx + dx , α 0 β 0

where




h

I2 =

x 1−rα + (h − x)1−rα

0

−1

1/α p α (x) dx

.

365

3.9. Miscellaneous Inequalities

3.9.4 Adams [2] Let u be a continuously differentiable function on an open interval (0, h) for fixed h > 0. If β
1 and α > 0, then  h  h  h         u(t)β t α−1 dt  α + 1 u(t)β t α dt + 2β u(t)β−1 u
(t)t α dt. αh 0 α 0 0 If p
1 and α > p − 1, then
 p  h
 h   |u(t)|p 
p α u(t)p t α−p dt  2p−1 α + 2 + p u t dt. + (t) α+1−p hp 0 0 3.9.5 Pachpatte [283] Let fr for r = 1, . . . , m be absolutely continuous functions on [a, b] with fr (a) = fr (b) = 0. If hr (u) for r = 1, . . . , m be nonnegative convex and increasing functions on [0, ∞) and hr (0) = 0, then, for every c ∈ (a, b), the following inequality holds 1/m  b  m    h
fr (x) f
(x) dx r

a

r

r=1

 
 b m
 c 
 
 1     fr (x) dx + hr fr (x) dx .  hr m a c i=1

Furthermore, let pr for r = 1, . . . , m be positive functions on [a, b] and

b a pr (x) dx < ∞. If ψr (u) for r = 1, . . . , m are nonnegative, convex and increasing functions on [0, ∞) and ψr (0) = 0, then, for every c ∈ (a, b), the following inequality holds 1/m  b  m 
 
    h fr (x) f (x) dx r

a

r

r=1



 m

 c 1 hr pr (x) dx ψr−1 m a r=1

 ×




c

pr (x)ψr a



 + hr



b

pr (x) dx c

ψr−1

  c  |fr
(x)| dx pr (x) dx pr (x) a






b

pr (x)ψr c

  b  |fr
(x)| dx pr (x) dx . pr (x) c

366

Chapter 3. Opial-Type Inequalities

3.9.6 Pachpatte [256] If f, g, h are absolutely continuous functions on [a, b] and f (a) = f (b) = 0, g(a) = g(b) = 0, h(a) = h(b) = 0, then 

      f (t)g(t)h(t) f
(t) + g
(t) + h
(t)

b 

a

      + f (t) + g(t) + h(t)       × f (t)g(t)h
(t) + g(t)h(t)f
(t) + h(t)f (t)g
(t) dt
  b − a 3 b 
4 
4 
4  f (t) + g (t) + h (t) dt.  (3.9.1) 2 a

Equality holds in (3.9.1) if and only if  f (t) = g(t) = h(t) =

M(t − a),

at 

M(b − t),

a+b 2

a+b 2 ,

 t  b,

where M is a constant. 3.9.7 Love [197] Let p > 0, q > 0, p + q = r
1, 0  a < b  ∞, γ < r, w(x) be decreasing and positive in (a, b). Let m and n be integers, m
n
0, F be complex-valued and has (m − 1)th derivative locally absolutely continuous in [a, b), and F (a) = F
(a) = · · · = F (m−1) (a) = 0. Then the following inequality holds 

   F (x)p F (m−n) (x)q x γ −mp−nq−1 w(x) dx

b

a

1  {(1 − γ /r)m }p {(1 − γ /r)n }q



 F (m) (x)r x γ −1 w(x) dx,

b

a

where (k)m = k(k + 1)(k + 2) · · · (k + m − 1) and (k)0 = 1. 3.9.8 Pachpatte [245] Let u, v ∈ C (n−1) [a, b] be such that u(k) (a) = v (k) (a) = 0 for k = 0, 1, . . . , n − 1, b where n
1, u(n−1) , v (n−1) be absolutely continuous and a |u(n) (t)|2 dt < ∞,

367

3.9. Miscellaneous Inequalities

b a

|v (n) (t)|2 dt < ∞. Then the following inequality holds 

   u(k) (t)v (n) (t) + v (k) (t)u(n) (t) dt

b 

a

1  Mk (b − a)n−k 2 where Mk =



    u(n) (t)2 + v (n) (t)2 dt,

b 

(3.9.2)

a


1/2 n−k 1 (n − k)! 2n − 2k − 1

(3.9.3)

for 0  k  n − 1. Equality holds in (3.9.2) if and only if k = 0, n = 1 and u(n) (t) = v (n) (t) = c, where c is a constant. 3.9.9 Pachpatte [245] Assume that the hypotheses of Section 3.9.8 hold. Then the following inequality holds  b         (k) u (t)u(n) (t) + v (k) (t)v (n) (t) + u(k) (t)v (n) (t) + v (k) (t)u(n) (t) dt a

  Mk (b − a)n−k

    u(n) (t)2 + v (n) (t)2 dt,

b 

(3.9.4)

a

where Mk is as given in (3.9.3) for 0  k  n − 1. Equality holds in (3.9.4) if and only if k = 0, n = 1 and u(n) (t) = v (n) (t) = c, where c is a constant. 3.9.10 Pachpatte [245] Let u ∈ C (n−1) [a, b] be such that u(k) (a) = 0 for k = 0, 1, . . . , n − 1, where n
1, b u(n−1) be absolutely continuous and a |u(n) (t)|2 dt < ∞. Then the following inequality holds 
 b (n+1)/2  b   n   (n) 2 2   (k) u (t) dt u (t) dt  Nk (b − a)(n +1)/2 , (3.9.5)   a  a k=0

where Nk =

(n2 + 1)(n + 1)




(n2 + 1)(n + 1) #n−1 k=0 (n − k − 1)! k=0 (2n − 2k − 1)

1 #n−1

1/2

368

Chapter 3. Opial-Type Inequalities

for 0  k  n − 1. Equality holds in (3.9.5) if and only if n = 1 and u(n) (t) is a constant. 3.9.11 Pachpatte [323] Let u ∈ C (n−1) [a, b] be such that u(i) (a) = 0 for i = 0, 1, . . . , n − 1 where n
1. b Let u(n−1) be absolutely continuous and a |u(n) (t)|2 dt < ∞. Then 

n b 

  u(n−k) (t)u(n) (t) dt  M



a k=1

where

 u(n) (t)2 dt,

b a

1/2 √  n n (b − a)2k . M= 2 (k − 1)!k!(2k − 1) k=1

3.9.12 Pachpatte [323]

b Let u be as in Section 3.9.11 and a |u(n) (t)|4 dt < ∞. Then, for 0  i  j  n − 1,
 b 1/2  b   (i)  (n) 4 u (t)u(j ) (t) dt  √1 C(n, i, j )(b − a)2n−i−j +1/2 u (t) dt , 3 a a where C(n, i, j ) =

1 . √ √ (n − i − 1)!(n − j − 1)! 2(n − i) − 1 2(n − j ) − 1

3.9.13 Pachpatte [324] Let rj , j = 1, . . . , n − 1, u be real-valued, continuous functions defined on I = (i) [a, b] and r-derivatives of u exist, be continuous on I and such that Dr u(a) = 0, i = 0, 1, . . . , n − 1, for n
1 and a ∈ I . Then 

n−1 b  a

    M  D (k) u (t) D (n) u (t) dt  √ r r 2 k=1

where M=

  n−1 b  a

k=0

 a

   D (n) u (t)2 dt, r

b 

2 Rk (a, t)

1/2 (t − a) dt

369

3.9. Miscellaneous Inequalities

and Rk (a, t) is defined by (3.6.11). 3.9.14 Pachpatte [324] Let rj , u be as in Section 3.9.13. Then, for 0  i  j  n − 1,  b  (i)   (j )   (n)    D u (t) Dr u (t) D u (t) dt r r a

 

 b  (n)  2 3/2   , a Dr u (t) dt  b  (n)  2 3/2   N2 a Dr u (t) dt ,

if i = j = n − 1,

N1

if 0  i  j < n − 1,

where 1 N1 = (b − a)3/2 , 3

1 N2 = √ 3




b

2 Ri (a, t)Rj (a, t)(t − a) dt

1/2

a

and Rk (a, t) is defined by (3.6.11). 3.9.15 Pachpatte [316] Let p, q be positive real numbers satisfying p + q > 1 and let n
1 be an integer. Let u ∈ C n [a, b] be a real-valued function such that u(i) (a) = 0 for i = 0, 1, . . . , n − 1. Let w(t) and v(t) be positive and continuous functions defined on [a, b]. Then the following inequality holds  b n   (n−k) p  (n) q u w(t) (t) u (t) dt a


 where



b

M(p, q) =

k=1

q p+q

q/(p+q)



b

M(p, q)

 p+q v(t)u(n) (t) dt,

a

 −p w (p+q)/p (t)v −q/p (t) (k − 1)!

a



t

×

v −1/(p+q−1) (s)

a

× (t − s)(k−1)(p+q)/(p+q−1) ds is finite.

p(p+q−1)/(p+q) (p+q)/p p/(p+q) dt

370

Chapter 3. Opial-Type Inequalities

3.9.16 Cheung [60] Let p
1 and q > 0 be any real numbers and n
1 be a fixed integer. Let n rk
0, k = 0, 1, . . . , n − 1, be real numbers with n−1 k=0 rk = 1. Let f ∈ C be a real-valued function and w be a positive continuous weight function on [a, b]. If f (k) (a) = 0 for all k = 0, 1, . . . , n − 1, and if w is nonincreasing, then the following inequality holds  n−1 p  b    (n) q r k f (k) (x) f (x) dx w(x) a

k=0



n−1 

 Mk rk (b − a)(n−k)p

 p+q w(x)f (n) (x) dx,

a

k=0

where

Mk = αq

b

αq

(n − k)(1 − α) n−k−α

(1−α)p

 −p (n − k)!

and α=

1 . p+q

3.9.17 Fink [117] Let 0  k < r < n, n
2, but fixed, and let x(t) ∈ C (n−1) [0, a], x (i) (0) = 0, a 0  i  n − 1, x (n−1) (t) absolutely continuous and 0 |x (n) (t)|µ dt < ∞, where 1 1 µ
1 and µ + ν = 1. Then the following inequality holds 

 x (k) (t)x (r) (t) dt  C(n, k, r, µ)a 2n−k−r+1−2/µ

a




0

 x (n) (t)µ dt

a

2/µ

0

where C(n, k, k + 1, µ) =

1 2((n − k

− 1)!)2 [(n − k

− 1)ν + 1]2/ν

and C(n, k, r, µ) 

1 . (n − k − 1)!(n − r)![(n − r)ν + 1]1/ν [(2n − k − r − 1)ν + 2]1/ν

,

371

3.9. Miscellaneous Inequalities

3.9.18 Pachpatte [359] Let n
2, 0  m  n − 2 be integers. Let r(t) > 0 be of class C 1 on I = [a, b], a < b and y(t) be of class C n on I satisfying y(a) = 0, y (i−1) (a) = 0,

b i = 2, 3, . . . , n, and a |(r(t)y (n−1) (t))
|2 dt < ∞. Then the following inequality holds  b   (m)   y (t)r(t)y (n−1) (t) r(t)y (n−1) (t)
 dt a


  M1

b 

  r(t)y (n−1) (t)
2 dt

3/2 ,

a

where M1 = √



1 3(n − m − 2)!

b a

2 1/2
 t 1 ds dt (t − a) (t − s)n−m−2 (s − a)1/2 r(s) a

is finite. 3.9.19 Pachpatte [359] Let n
2, 0  m  n − 2 be integers. Let r(t) > 0 be of class C n−1 on I = [a, b], a < b and y(t) be of class C n−1 on I satisfying y(a) = 0, (r(a)y
(a))(i−2) = 0,

b i = 2, 3, . . . , n, and a |(r(t)y
(t))(n−1) |2 dt < ∞. Then the following inequality holds  b       y(t) r(t)y
(t) (m)  r(t)y
(t) (n−1)  dt a


  M2

b 

   r(t)y
(t) (n−1) 2 dt

3/2 ,

a

where 1 M2 = √ √ √ 3 2(n − 2) + 1 2(n − m − 2) + 1(n − 2)!(n − m − 2)! 2 1/2  b
 s 1 2(n−m−2)+1 [2(n−2)+1]/2 (t − a) ds dt × (s − a) a a r(s) is finite.

372

Chapter 3. Opial-Type Inequalities

3.9.20 Pachpatte [359] Let n
1, 0  k  n − 1, 0  m  n − 1 be integers. Let r(t) > 0 be of class C n on I = [a, b], a < b, and y(t) be of class C 2n on I satisfying y (i−1) (a) = 0,

b (r(a)y (n) (a))(i−1) = 0, for i = 1, 2, . . . , n, and a |(r(t)y (n) (t))(n) |2 dt < ∞. Then the following inequality holds  b  (k)      y (t) r(t)y (n) (t) (m)  r(t)y (n) (t) (n)  dt a


  M3

b 

   r(t)y (n) (t) (n) 2 dt

3/2 ,

a

where 1 M3 = √ √ √ 3 2n − 1 2n − 2m − 1(n − 1)!(n − k − 1)!(n − m − 1)!
 t 2 1/2  b 2n−2m−1 n−k−1 (2n−1)/2 1 ds dt × (t − a) (t − s) (s − a) r(s) a a is finite. 3.9.21 Pachpatte [260] Suppose p, q are positive and continuous functions on ∆1 = [a, X] × [c, Y ]. Let f , D1 f , D2 D1 f be continuous functions on ∆1 with f (a, t) = D1 f (s, c) = 0 for a  s  X, c  t  Y . Then, if m, n > 0, m + n > 1, we have  X Y p|f |m |D2 D1 f |n dt ds a

c

 K1 (X, Y, m, n)

 X a

Y

q|D2 D1 f |m+n dt ds,

(3.9.6)

c

where K1 (X, Y, m, n)
n/(m+n)  X Y n = p (m+n)/m q −n/m m+n a c
 s t m+n−1 m/(m+n) × q −1/(m+n−1) dv du dt ds a

c

(3.9.7)

373

3.9. Miscellaneous Inequalities

is finite. In case m < 0, m + n > 1, inequality (3.9.6) holds with “” replaced by “
”. 3.9.22 Pachpatte [260] Suppose p, q are positive and continuous functions on ∆2 = [a, X] × [Y, d]. Let f , D1 f , D2 D1 f be continuous functions on ∆2 with f (a, t) = D1 f (s, d) = 0 for a  s  X, Y  t  d. Then, if m, n > 0, m + n > 1, we have  X a

d

p|f |m |D2 D1 f |n dt ds

Y

 K2 (X, Y, m, n)

 X a

d

q|D2 D1 f |m+n dt ds,

(3.9.8)

Y

where K2 (X, Y, m, n)
n/(m+n)  X d n = p (m+n)/m q −n/m m+n a Y
 s d m+n−1 m/(m+n) × q −1/(m+n−1) dv du dt ds a

t

(3.9.9) is finite. In case m < 0, m + n > 1, inequality (3.9.8) holds with “” replaced by “
”. 3.9.23 Pachpatte [260] Suppose p, q are positive and continuous functions on ∆3 = [X, b] × [c, Y ]. Let f , D1 f , D2 D1 f be continuous functions on ∆3 with f (b, t) = D1 f (s, c) = 0 for X  s  b, c  t  Y . Then, if m, n > 0, m + n > 1, we have  b

Y

p|f |m |D2 D1 f |n dt ds

X c

 K3 (X, Y, m, n)

 b X c

Y

q|D2 D1 f |m+n dt ds,

(3.9.10)

374

Chapter 3. Opial-Type Inequalities

where K3 (X, Y, m, n)
n/(m+n)  b Y n = p (m+n)/m q −n/m m+n X c
 b t m+n−1 m/(m+n) −1/(m+n−1) × q dv du dt ds s

c

(3.9.11) is finite. In case m < 0, m + n > 1, inequality (3.9.10) holds with “” replaced by “
”. 3.9.24 Pachpatte [260] Suppose p, q are positive and continuous functions on ∆4 = [X, b] × [Y, d]. Let f , D1 f , D2 D1 f be continuous functions on ∆4 with f (b, t) = D1 f (s, d) = 0 for X  s  b, Y  t  d. Then, if m, n > 0, m + n > 1, we have  b d p|f |m |D2 D1 f |n dt ds X Y

 K4 (X, Y, m, n)

 b

d

q|D2 D1 f |m+n dt ds,

(3.9.12)

X Y

where K4 (X, Y, m, n)
n/(m+n)  b d n = p (m+n)/m q −n/m m+n X Y
 b d m+n−1 m/(m+n) −1/(m+n−1) × q dv du dt ds s

t

(3.9.13) is finite. In case m < 0, m + n > 1, inequality (3.9.12) holds with “” replaced by “
”. 3.9.25 Pachpatte [260] Suppose p, q are positive and continuous functions on ∆ = [a, b] × [c, d]. Let f , D1 f , D2 D1 f be continuous functions on ∆ with f (a, t) = f (b, t) =

375

3.9. Miscellaneous Inequalities

D1 f (s, c) = D1 f (s, d) = 0 for a  s  b, c  t  d. Suppose there exist X0 ∈ (a, b) and Y1 , Y2 ∈ (c, d) such that K1 (X0 , Y1 , m, n) = K2 (X0 , Y1 , m, n) = K3 (X0 , Y2 , m, n) = K4 (X0 , Y2 , m, n),

(3.9.14)

where K1 , K2 , K3 and K4 are defined by (3.9.7), (3.9.9), (3.9.11) and (3.9.13), respectively. Then, if m, n > 0, m + n > 1, we have  b d  b d p|f |m |D2 D1 f |n dt ds  K(m, n) q|D2 D1 f |m+n dt ds, a

c

a

c

(3.9.15) where K(m, n) denotes any common value of the four constants given in (3.9.14). In case m < 0, m + n > 1, inequality (3.9.15) holds with “” replaced by “
”. 3.9.26 Pachpatte [257] Let f, D1 f, D2 D1 f be real-valued continuous functions on ∆ = [a, b] × [c, d] and f (a, t) = f (b, t) = D1 f (s, c) = D1 f (s, d) = 0 for a  s  b, c  t  d. H (r) be a real-valued continuous function defined for all r(s, t) of the form

Let s t a c |D2 D1 f (m, n)| dn dm, (s, t) ∈ ∆1 = [a, X] × [c, Y ], and similar integrals for (t, s) on ∆2 = [a, X] × [Y, d], ∆3 = [X, b] × [c, Y ] and ∆4 = [X, b] × [Y, d], and |H (r)|  H (|r|) for all r and that H (r1 )  H (r2 ) for 0  r1  r2 . Then the following inequality holds  b d     H f (s, t) D2 D1 f (s, t) dt ds a

c

F


 X a

+F

Y


 X   D2 D1 f (s, t) dt ds + F

c


 b

Y

  D2 D1 f (s, t) dt ds + F

X c

where F (r) =

r 0



a

d

  D2 D1 f (s, t) dt ds

Y


 b

d



   D2 D1 f (s, t) dt ds ,

X Y

H (σ ) dσ , r > 0.

3.9.27 Pachpatte [266] Let f, D1 f, D2 D1 f be real-valued continuous functions on ∆ = [a, b] × [c, d] and f (a, t) = f (b, t) = D1 f (s, c) = D1 f (s, d) = 0 for a  s  b, c  t  d.

376

Chapter 3. Opial-Type Inequalities

If H (r) is a convex increasing function on [0, ∞) with H (0) = 0, then, for (X, Y ) ∈ ∆, the following inequality holds  b a

d

c

H

   H
f (s, t) D2 D1 f (s, t) dt ds
 X a

+H


 X   D2 D1 f (s, t) dt ds + H

Y

c

a


 b

Y

   D2 D1 f (s, t) dt ds + H

X c

d

  D2 D1 f (s, t) dt ds

Y


 b

d



   D2 D1 f (s, t) dt ds .

X Y

3.9.28 Pachpatte [271] Let f (s, t), D1 f (s, t), D2 D1 f (s, t) be real-valued continuous functions on ∆ = [a, b] × [c, d] and f (a, t) = f (b, t) = D1 f (s, c) = D1 f (s, d) = 0 for a  s  b, c  t  d. Let H (r) be a real-valued continuously differentiable function on [0, ∞) with H (0) = 0, H
(r)
0 and H
(r) nondecreasing on [0, ∞]. Then, for (X, Y ) ∈ ∆, the following inequality holds  b a

n−1
    H f (s, t) H f (s, t) D2 D1 f (s, t) dt ds

d

c

n 1   H I j D2 D1 f , n 4



j =1

where n
2 and I 1 D2 D1 f =

 X a

I 2 D2 D1 f =

  D2 D1 f (s, t) dt ds,

d

  D2 D1 f (s, t) dt ds,

Y

  D2 D1 f (s, t) dt ds,

d

  D2 D1 f (s, t) dt ds.

c

 X a

I3 D2 D1 f =

Y

 b

Y

X c

I4 D2 D1 f =

 b

X Y

377

3.9. Miscellaneous Inequalities

3.9.29 Pachpatte [294] Let u(x, y), D1 u(x, y), D2 u(x, y), D2 D1 u(x, y) be real-valued continuous functions defined on ∆ = [a, b] × [c, d] with u(a, y) = u(b, y) = D1 u(x, c) = D1 u(x, d) = 0 for a  x  b, c  y  d. (i) Let 1  pi < ∞ for i = 1, 2, 3 be constants. Then  b a

d

      u(x, y)p1 D1 u(x, y)p2 D2 u(x, y)p3 dy dx

c

 M1

3
 b  i=1

where

a

d

   D2 D1 u(x, y)pi dy dx ,

c


2p1 +p2 +p3 1 M1 = (b − a)p1 +p3 −2 (d − c)p1 +p2 −2 . 2

(ii) Let 1  pi < ∞ for i = 1, 2, 3, 4 be constants. Then  b a

d

        u(x, y)p1 D1 u(x, y)p2 D2 u(x, y)p3 D2 D1 u(x, y)p4 dy dx

c

 M2

4
 b  i=1

where

a

d

  D2 D1 u(x, y)2pi dy dx

1/2 ,

c


2p1 +p2 +p3 1 M2 = (b − a)p1 +p3 −1 (d − c)p1 +p2 −1 . 2

3.9.30 Pachpatte [244] Let ui (x, y) (for i = 1, 2) and their partial derivatives D1 ui (x, y), D2 ui (x, y) be absolutely continuous real-valued functions defined on ∆ = [a, b] × [c, d] and ui (a, y) = ui (b, y) = 0, ui (x, c) = ui (x, d) = 0. Then the following inequality holds  b d     u1 (x, y)D2 D1 u2 (x, y) + u2 (x, y)D2 D1 u1 (x, y) a

c

    + D1 u1 (x, y)D2 u2 (x, y) + D1 u2 (x, y)D2 u1 (x, y) dy dx

378

Chapter 3. Opial-Type Inequalities

 b

(b − a)(d − c)  8

a

    D2 D1 u1 (x, y)2 + D2 D1 u2 (x, y)2 dy dx.

d 

c

3.9.31 Pachpatte [313] Let m, n
1 be integers and ∆ = [0, a] × [0, b], a > 0, b > 0. Let u(x, y) ∈ F (∆), where F (∆) denote the class of continuous functions u : ∆ → R for which j D2m D1n u(x, y) exists and continuous on ∆ and such that D2 u(x, 0) = 0, 0  j  i m − 1, D1 u(0, y) = 0, 0  i  n − 1, where D1n u(x, y) =

∂ n u(x, y) , ∂x n

D2m u(x, y) =

∂ m u(x, y) ∂x m

and D2m D1n u(x, y) =

∂ n+m u(x, y) . ∂x m ∂y n

Then the following inequalities hold  a 0

  u(x, y)D m D n u(x, y) dy dx

b

2

0

√  a L



0

 a 0

1

√

1

2

 a

 D m D n u(x, y)2 dy dx, 2 1

b

M 0

1

0

  D m u(x, y)D m D n u(x, y) dy dx

b

0



2

0

  D n u(x, y)D m D n u(x, y) dy dx

 a 0

 D m D n u(x, y)2 dy dx,

b

b

0



1

2

2

√  a N 0

1

 D m D n u(x, y)2 dy dx,

b 0

2

1

where L=

a 2n b2m , [(n − 1)!(m − 1)!]2 2n(2n − 1)2m(2m − 1)

M=

b2m , [(m − 1)!]2 2m(2m − 1)

N=

a 2n . [(n − 1)!]2 2n(2n − 1)

379

3.10. Notes

3.9.32 Pachpatte [280] Let {ui } and {vi } for i ∈ N be sequences of real numbers with u0 = v0 = 0. Then the following inequality holds n n      n+1  |ui ||∇vi | + |vi ||∇ui |  |∇ui |2 + |∇vi |2 2 i=1

i=1

for all n ∈ N, where N and ∇ are as defined in Section 3.8. 3.9.33 Pachpatte [234] Let {pk }, k = 1, . . . , n, be a sequence of nonnegative real numbers. If {fk }, {gk }, k ∈ Nn+1 , are the sequences of real numbers such that f1 = fn+1 = 0, g1 = gn+1 = 0, then   n  n n    n  2 2 |fk | + |gk | pk |fk ||gk |  pk 8 k=1

k=1

k=1

for all n ∈ N. Further, let q > 1, r > 1 be constants, then   n  n
q+r+1 n     1 q r q+r−1 2q 2r |fk | + |gk | pk |fk | |gk |  n pk 2 k=1

k=1

k=1

for all n ∈ N, where Nn+1 and N are as defined in Section 3.8. 3.9.34 Pachpatte [234] Let {pk }, {fk }, {gk } be the sequences as defined in Section 3.9.33. Then the following inequality holds n 

  pk |fk ||gk | + |gk ||fk | 

k=1



n pk 4 n

k=1

1/2 

 n    2 2 |fk | + |gk | . k=1

3.10 Notes Inequality (3.2.1) was first proved by the Polish mathematician Z. Opial [231] in 1960. An interesting feature of Opial’s result is that it yields the best possible constant. The original proof of Opial’s inequality can also be found in [4].

380

Chapter 3. Opial-Type Inequalities

Theorem 3.2.1 covers a weaker form of Opial’s inequality due to Olech [230]. Moreover, Olech’s proof is simpler than that of Opial. Theorem 3.2.2 which deals with Wirtinger- and Opial-type inequalities is due to Traple [419]. Theorems 3.2.3 and 3.2.4 are due to Pachpatte [348] which provide new estimates on Opial-type inequalities. The inequalities in Theorems 3.2.5–3.5.7 are due to Pachpatte [304] which claim their origin to the well-known Weyl inequality [141, p. 165] and in the special cases contains the inequalities of Weyl, Opial and Hardy type. Theorems 3.3.1–3.3.4 deal with Wirtinger- and Opial-type inequalities and are taken from Pachpatte [238,241]. Theorems 3.3.5 and 3.3.6 are due to Calvert [51], and Theorem 3.3.7 is taken from Pachpatte [283]. The inequalities in Theorems 3.4.1–3.4.8 are taken from Pachpatte [239,303] which are motivated by the various generalizations and extensions of Opial’s inequality. The inequalities in Theorems 3.5.1 and 3.5.2 are due to Godunov and Levin [130]. Theorem 3.5.3 is a generalization of Theorem 3.5.1 given by Rozanova in [399]. Theorems 3.5.4–3.5.7 deal with generalized Opial-type integral inequalities established by Pachpatte in [346]. The results given in Section 3.6 cover basic Opial-type inequalities involving functions and their higher-order derivatives established by Pachpatte. Theorems 3.6.1 and 3.6.2 are taken from [239], Theorems 3.6.3–3.6.5 are taken from [296], Theorem 3.6.6 is taken from [312] and Theorems 3.6.7–3.6.9 are taken from [317]. In 1982, Yang [429] obtained an analogue of Opial’s inequality involving functions of two independent variables. Theorem 3.7.1 is due to Yang [429]. Theorems 3.7.2–3.7.5 are taken from Pachpatte [233,267]. Theorems 3.7.6 and 3.7.7 cover Opial-type inequalities in several independent variables and established by Pachpatte [261]. Theorem 3.7.8 is about another version of Opial-type inequality involving functions of many independent variables and is due to Pachpatte [284]. Discrete analogues of Opial’s inequality and its generalizations are established by Wong [426], Lee [183] and others, see [4]. Inequality (3.8.1) is due to Wong [426] and is a discrete variant of Opial’s inequality given by Hua in [158]. All the results given in Section 3.8 are due to Pachpatte [235,262,280,287,318,347] which claim their origin to the discrete analogue of Opial’s inequality, see [4]. Section 3.9.9 is about some useful miscellaneous inequalities related to Opial’s inequality investigated by various investigators.

Chapter 4 Poincaré- and Sobolev-Type Inequalities

4.1 Introduction In the development of the theory of partial differential equations and in establishing the foundations of the finite element analysis, the fundamental role played by certain inequalities and variational principles involving functions and their partial derivatives is well known. In particular, the integral inequalities originally due to Poincaré and Sobolev and their various generalizations and variants have been extensively used in the study of problems in the theory of partial differential equations and finite element analysis. Because of the dominance of such inequalities in the qualitative analysis of partial differential equations and in finite element analysis, numerous studies have been made of various types of new inequalities related to Poincaré- and Sobolev-type inequalities. These investigations have achieved a diversity of desired goals. Over the years a number of papers have appeared in the literature which deals with the far-reaching generalizations, extensions and variants of Poincaré and Sobolev inequalities and their various applications. This chapter deals with a number of new inequalities recently discovered in the literature which claim their origin to the inequalities of Poincaré and Sobolev. Let R be the set of real numbers and B be a # bounded domain in Rn , the n-dimensional Euclidean space, defined by B = ni=1 [ai , bi ]. For xi ∈ R, x = (x1 , . . . , xn ) is a variable point in B and dx = dx1 · · · dxn . For any continuous real-valued function u(x) defined on B, we denote by B u(x) dx the

b

b

b n-fold integral ann · · · a11 u(x1 , . . . , xn ) dx1 · · · dxn . The notation aii u(x1 , . . . , ti ,

b . . . , xn ) dti for i = 1, . . . , n we mean, for i = 1, it is a11 u(t1 , x2 , . . . , xn ) dt1 and

b so on, and for i = n, it is ann u(x1 , . . . , xn−1 , tn ) dtn . For any continuous real

valued function u(x) defined on Rn , we denote by i u(x1 , . . . , ti , . . . , xn ) dti the

∞ integral −∞ u(x1 , . . . , ti , . . . , xn ) dti , i = 1, . . . , n, taken along the whole line 381

382

Chapter 4. Poincaré- and Sobolev-Type Inequalities

through x = (x1 , . . . , xi , . . . , xn ) parallel to the xi -axis, and denote by Rn u(x) dx

∞

∞ the n-fold integral −∞ · · · −∞ u(x1 , . . . , xn ) dx1 · · · dxn . For any function u(x) 2 1/2 . We say that a defined on B or Rn , we define | grad u(x)| = ( ni=1 | ∂u(x) ∂xi | ) function is of compact support in S if it is nonzero only on a bounded subdomain S
of the domain S, where S
lies at a positive distance ∂S, the boundary of S. We assume without further mention that all the integrals exist on the respective domains of their definitions.

4.2 Inequalities of Poincaré, Sobolev and Others There exists a vast literature on the various generalizations, extensions and variants of Poincaré’s inequality (10), see Introduction. We start with the following useful version of Poincaré’s inequality given in Friedman [120, p. 284]. T HEOREM 4.2.1. Let Q = {x = (x1 , . . . , xn ) ∈ Rn : 0  xi  σ, i = 1, . . . , n} and let u be a real-valued function belonging to C 1 (Q). Then  u2 (x) dx  Q

1 σn




2 u(x) dx

Q

n + σ2 2



  grad u(x)2 dx.

(4.2.1)

Q

P ROOF. For any x = (x1 , . . . , xn ), y = (y1 , . . . , yn ) ∈ Q, the following identity holds n  xi  ∂ u(x) − u(y) = u(y1 , . . . , yi−1 , ti , xi+1 , . . . , xn ) dti . (4.2.2) yi ∂ti i=1

Taking square on both sides of (4.2.2) and using the elementary inequality ( ni=1 ai )2  n ni=1 ai2 , where ai are reals and Schwarz inequality, we have u2 (x) + u2 (y) − 2u(x)u(y) 2 n  σ
 ∂ u(y1 , . . . , yi−1 , ti , xi+1 , . . . , xn ) dti .  nσ ∂ti 0

(4.2.3)

i=1

Integrating (4.2.3) with respect to x1 , . . . , xn , y1 , . . . , yn , we get


 2σ

u (x) dx − 2

n

2

Q

from which (4.2.1) follows.

2 u(x) dx

Q

 nσ

n+2

2 n 
 ∂ u(x) dx, Q ∂xi i=1



383

4.2. Inequalities of Poincaré, Sobolev and Others

In [247] Pachpatte has given the following variant of Theorem 4.2.1. T HEOREM 4.2.2. Let Q be as defined in Theorem 4.2.1 and f, g be real-valued functions belonging to C 1 (Q). Then  f (x)g(x) dx Q

1  n σ









f (x) dx Q

n + σ2 4



g(x) dx Q

     grad f (x)2 + grad g(x)2 dx.

(4.2.4)

Q

P ROOF. For any x, y ∈ Q and h ∈ C 1 (Q), the following identity holds h(x) − h(y) =

n  

xi

∂ h(y1 , . . . , yi−1 , ti , xi+1 , . . . , xn ) dti . ∂ti

i=1 yi

(4.2.5)

Writing (4.2.5) for the functions f and g, and then by multiplying the results and using the elementary inequalities ab  12 (a 2 + b2 ), ( ni=1 ai )2  n ni=1 ai2 (a, b, ai are reals) and Schwarz inequality, we obtain f (x)g(x) + f (y)g(y) − f (x)g(y) − f (y)g(x) 2 n   ∂ n  σ  σ f (y1 , . . . , yi−1 , ti , xi+1 , . . . , xn ) 2 ∂ti 0 i=1

 +

2 ∂ g(y1 , . . . , yi−1 , ti , xi+1 , . . . , xn ) dti . ∂ti

(4.2.6)

Integrating both sides of (4.2.6) with respect to x1 , . . . , xn , y1 , . . . , yn , we get
 
   2σ n f (x)g(x) dx − 2 f (x) dx g(x) dx Q

n  σ n+2 2

Q



Q

     grad f (x)2 + grad g(x)2 dx.

(4.2.7)

Q

The desired inequality (4.2.4) follows from inequality (4.2.7).



R EMARK 4.2.1. We note that in the special case when g(x) = f (x), the inequality established in Theorem 4.2.2 reduces to the inequality given in Theorem 4.2.1.

384

Chapter 4. Poincaré- and Sobolev-Type Inequalities

In [236] Pachpatte has established the following Poincaré-type inequality. T HEOREM 4.2.3. Let Q be as defined in Theorem 4.2.1 and f, g be real-valued functions belonging to C 1 (Q) which vanish on the boundary ∂Q of Q. Then  2          grad f (x)2 + grad g(x)2 dx. f (x)g(x) dx  σ (4.2.8) 8n Q Q P ROOF. If x ∈ Q, then we have the following identities nf (x) =

n  

xi

i=1 0

nf (x) = −

n  

∂ f (x1 , . . . , ti , . . . , xn ) dti , ∂ti σ

∂ f (x1 , . . . , ti , . . . , xn ) dti . ∂ti

i=1 xi

From (4.2.9) and (4.2.10), we obtain  n  σ    ∂    f (x1 , . . . , ti , . . . , xn ) dti . 2nf (x)   ∂t  i 0

(4.2.9)

(4.2.10)

(4.2.11)

i=1

Similarly, we obtain n    2ng(x) 



i=1 0

    ∂ g(x1 , . . . , ti , . . . , xn ) dti .  ∂t 

σ

(4.2.12)

i

From (4.2.11), (4.2.12) and using the elementary inequalities ab  12 (a 2 + b2 ), ( ni=1 ai )2  n ni=1 ai2 (for a, b, ai reals) and Schwarz inequality, we obtain    f (x)g(x)  n   2  σ ∂  1  f (x1 , . . . , ti , . . . , xn ) dti  σ   8n ∂ti i=1 0 2  n  σ   ∂   g(x1 , . . . , ti , . . . , xn ) dti . + (4.2.13)  ∂t  i 0 i=1

Integrating both sides of (4.2.13) with respect to x1 , . . . , xn we get  2          grad f (x)2 + grad g(x)2 dx. f (x)g(x) dx  σ 8n Q Q

385

4.2. Inequalities of Poincaré, Sobolev and Others



The proof is complete.

R EMARK 4.2.2. In the special case when g(x) = f (x), the inequality established in Theorem 4.2.3 reduces to the following Poincaré-type integral inequality 

2   f (x)2 dx  σ 4n Q



  grad f (x)2 dx.

(4.2.14)

Q

One of the many mathematical discoveries of S.L. Sobolev is the following integral inequality (see [157, p. 101]) 

∞ −∞



∞

α u dx dy  2 −∞




4

∞



∞

−∞ −∞


 2

u dx dy

∞



∞

−∞ −∞

 | grad u| dx dy , 2

(4.2.15) where u(x, y) is any smooth function of compact support in two-dimensional Euclidean space and α is a dimensionless constant. Inequality (4.2.15) is known as Sobolev’s inequality, although the same name is attached to the above inequality in n-dimensional Euclidean space. Inequalities of the form (4.2.15) or its variants have been applied with considerable success to the study of many problems in the theory of partial differential equations and in establishing the foundations of the finite element analysis. There is a vast literature which deals with various generalizations, extensions and variants of inequality (4.2.15). In 1964, Payne [362] has given the following version of inequality (4.2.15). T HEOREM 4.2.4. Let u(x, y) be any smooth function of compact support in twodimensional Euclidean space E2 . Then 

∞

−∞



∞

1 u dx dy  2 −∞ 4




∞



∞

−∞ −∞


 2

u dx dy

∞



∞

−∞ −∞

 | grad u| dx dy . 2

(4.2.16) P ROOF. From the hypotheses, we have the following identities 

 ∞ ∂ ∂ u (x, y) = 2 u(s, y) u(s, y) ds = −2 u(s, y) u(s, y) ds, ∂s ∂s −∞ x  ∞  y ∂ ∂ u(x, t) u(x, t) dt = −2 u(x, t) u(x, t) dt. u2 (x, y) = 2 ∂t ∂t −∞ y 2

x

(4.2.17) (4.2.18)

386

Chapter 4. Poincaré- and Sobolev-Type Inequalities

From (4.2.17) and (4.2.18), we obtain    ∞    u(s, y) ∂ u(s, y) ds u2 (x, y)   ∂s 

(4.2.19)

−∞

and

 u (x, y)  2

    u(x, t) ∂ u(x, t) dt.  ∂t 

∞

−∞

(4.2.20)

From (4.2.19) and (4.2.20), we observe that  ∞ ∞ u4 (x, y) dx dy −∞ −∞





∞



     u(s, y) ∂ u(s, y) ds  ∂s  −∞   
 ∞  ∂      × u(x, t)  u(x, t) dt dx dy. ∂t −∞

∞ 
 ∞ 

−∞ −∞

(4.2.21)

By using the Schwarz inequality on the right-hand side of (4.2.21), we get  ∞ ∞ u4 (x, y) dx dy −∞ −∞





∞





∞

2

−∞ −∞




×

∞

u (x, y) dx dy



∞
∂u 2

−∞ −∞

∂x


 dx dy

∞



∞
∂u 2

∂y

−∞ −∞

1/2 dx dy

.

(4.2.22)

Now an application of the arithmetic mean and geometric mean inequality on the last term on the right-hand side of (4.2.22) leads to the desired inequality in (4.2.16).  In 1963, Serrin [405] proved the following useful multidimensional integral inequality. T HEOREM 4.2.5. Let E be a bounded domain in Rn , n
2, and u be a realvalued function such that u ∈ C 1 (E) and u = 0 on ∂E, the boundary of E, then


(n−1)/n |u|n/(n−1) (x) dx

E




1 4n

1/2  E

  grad u(x) dx.

(4.2.23)

387

4.2. Inequalities of Poincaré, Sobolev and Others

P ROOF. From the hypotheses, we have the following identities  u(x) =

x1

∂ u(t1 , x2 , . . . , xn ) dt1 , ∂t1

−∞



u(x) = −

∞

x1

(4.2.24)

∂ u(t1 , x2 , . . . , xn ) dt1 . ∂t1

(4.2.25)

From (4.2.24) and (4.2.25), we obtain        u(x)  1  ∂ u(t1 , x2 , . . . , xn ) dt1 .   2 1 ∂t1

(4.2.26)

Similarly, we obtain   u(x)  1 2

   ∂   u(x1 , . . . , ti , . . . , xn ) dti  ∂t  i

(4.2.27)

i

for i = 2, 3, . . . , n. From (4.2.26) and (4.2.27), we observe that   u(x)n/(n−1) 

 1/(n−1)
n/(n−1)    ∂  1  u(t1 , x2 , . . . , xn ) dt1   2 1 ∂t1  1/(n−1)    ∂    × ··· × .  ∂t u(x1 , . . . , xn−1 , tn ) dtn n n

(4.2.28)

We integrate both sides of (4.2.28) with respect to x1 and use on the right-hand side the general version of Hölder’s inequality (see [179, p. 40]) 

 |f1 · · · fk | dk  i

1/k |f1 |k dt

i



1/k

···

|fk |k dt

,

(4.2.29)

i

where k = n − 1. We then integrate the resulting inequality with respect to x2 and use inequality (4.2.29) on the right-hand side. We repeat this procedure, integrating with respect to x3 , . . . , xn , and obtain (see [121, Chapter 1, Theorem 9.3]) 

  u(x)n/(n−1) dx

E

 1/(n−1)  1/(n−1)  
n/(n−1)    ∂  ∂   1     ··· .   ∂x u(x) dx  ∂x u(x) dx 2 1 n E E (4.2.30)

388

Chapter 4. Poincaré- and Sobolev-Type Inequalities

From (4.2.30) and using the elementary inequalities 

n 

1/n

1 ci n n



ci

i=1

i=1

for nonnegative reals c1 , . . . , cn and n
1 and 

n 

2 ci

n

i=1

n 

ci2

i=1

for c1 , . . . , cn reals, we obtain


  u(x)n/(n−1) dx E



1 2

(n−1)/n

 1/n     ∂    dx u(x) ···  ∂x  E

1

 n    1   ∂  u(x) dx  2n E ∂xi i=1

   n   ∂  1  = u(x)  2n E ∂xi

E

  1/n  ∂    dx u(x)  ∂x  n

2 1/2

dx

i=1

1  2n
=

2 1/2    n   ∂    dx n  ∂x u(x)

1 4n

E

i=1

1/2 

i

  grad u(x) dx.

E



The proof is complete.

R EMARK 4.2.3. We note that on employing Schwarz inequality on the righthand side of (4.2.23) we get the following inequality
 E

  u(x)n/(n−1) dx

(n−1)/n




V (D) 4n

1/2


  grad u(x)2 dx

1/2 ,

E

(4.2.31)

389

4.2. Inequalities of Poincaré, Sobolev and Others

where V (D) is the n-dimensional measure of E. By taking n = 3 and u = φ 2 in (4.2.23) and using the Schwarz inequality, we obtain


  φ(x)3 dx

2/3

 3−1/2




1/2
 φ 2 (x) dx

E

E

  grad φ(x)2 dx

1/2

E

and so



  3/4
 3/4  2   2  φ(x)3 dx  3−3/4  grad φ(x) dx φ (x) dx .

E

E

E

(4.2.32) In 1991, Pachpatte [290] has established the following inequality. T HEOREM 4.2.6. Let u be a real-valued sufficiently smooth function of compact support in E, the n-dimensional Euclidean space with n
2, and p
0, q
1 and q < n. Then


  u(x)(p+q)n/(n−q) dx

(n−q)/n

E

 q n   p  ∂      u(x)  M u(x) dx, ∂x i=1 E

i

(4.2.33) where M=



1 (p + q)(n − 1) q . n 2(n − q)

P ROOF. First we establish inequality (4.2.33) for p = 0, q = 1 and by taking u(x) = v(x). Since v(x) is a smooth function of compact support in E, we have the following identities  v(x) =

x1

∂ v(t1 , x2 , . . . , xn ) dt1 , ∂t1

−∞



v(x) = −

∞

x1

∂ v(t1 , x2 , . . . , xn ) dt1 . ∂t1

From (4.2.34) and (4.2.35), we obtain        v(x)  1  ∂ v(t1 , x2 , . . . , xn ) dt1 .   2 1 ∂t1

(4.2.34) (4.2.35)

(4.2.36)

390

Chapter 4. Poincaré- and Sobolev-Type Inequalities

Similarly, we obtain   v(x)  1 2

   ∂   v(x1 , . . . , ti , . . . , xn ) dti  ∂t  i

(4.2.37)

i

for i = 2, . . . , n. Now, by following exactly the same steps as in the proof of Theorem 4.2.5 below inequality (4.2.27), we obtain 
 (n−1)/n n      1   ∂  dx. v(x)n/(n−1) dx (4.2.38)  v(x)   2n E E ∂xi i=1

This result proves inequality (4.2.33) for p = 0, q = 1 and u(x) = v(x). To prove (4.2.33), we take  (p+q)(n−1)/(n−q) v(x) = u(x) and hence (p+q)(n−1)/(n−q)−1 ∂ ∂ (p + q)(n − 1)  u(x) v(x) = u(x) ∂xi n−q ∂xi in inequality (4.2.38), and rewriting the resulting inequality we have (n−1)/n
   u(x)(p+q)n/(n−q) dx E

(p + q)(n − 1)   2n(n − q) n



i=1 E

       u(x)p/q  ∂ u(x)u(x)(p+q)(n−1)/(n−q)−1−p/q dx.  ∂x  i

(4.2.39) Using Hölder’s inequality with indices q, q/(q − 1) on the right-hand side of (4.2.39) we obtain
 (n−1)/n   u(x)(p+q)n/(n−q) dx E



 q 1/q n      (p + q)(n − 1)  u(x)p  ∂ u(x) dx   2n(n − q) ∂xi E i=1

 × E

  u(x)(p+q)n/(n−q) dx

(q−1)/q .

(4.2.40)

If E |u(x)|(p+q)n/(n−q) dx = 0 then (4.2.33) is trivially true; otherwise, we divide

both sides of (4.2.40) by { E |u(x)|(p+q)n/(n−q) dx}(q−1)/q and then raise both

391

4.3. Poincaré- and Sobolev-Type Inequalities I

sides to the power q and use the elementary inequality  n q n   q ci  dq,n = ci , i=1

i=1

where ci are nonnegative reals, dq,n = nq−1 , q > 1, and dq,n = 1, 0  q  1, on the right-hand side to get (4.2.33). The proof is complete.  R EMARK 4.2.4. By taking p = 0, q = 2 and n
3 in (4.2.33) and then raising the power 1/2 on both sides of the resulting inequality, we get

 (n−2)/(2n) 1/2  2   (n − 1)  u(x)2n/(n−2) dx  grad u(x) dx √ . n(n − 2) E E (4.2.41) Further, by taking p = 1, q = 1 in (4.2.33) and raising the power 1/2 on both sides of the resulting inequality, we get   1/2
 (n−1)/(2n) n   ∂      1  u(x)2n/(n−1) dx   √ u(x) dx . u(x)  ∂xi n E E i=1

(4.2.42) We note that inequality (4.2.41) is established by Nirenberg in [229] and inequality (4.2.42) provides a new estimate on the Nirenberg-type inequality.

4.3 Poincaré- and Sobolev-Type Inequalities I The importance of the Poincaré and Sobolev inequalities in the theory of partial differential equations is well known, and over the years much effort has been devoted to the study of these inequalities. In this section we present some Poincaréand Sobolev-type inequalities established by Pachpatte in [249,265,290]. In 1987, Pachpatte [265] established the following Poincaré-type inequality. # T HEOREM 4.3.1. Let p
2 be a constant and B = ni=1 [0, ai ] be a bounded domain in Rn . Let u be a real-valued function belonging to C 1 (B) which vanishes on the boundary ∂B of B. Then
p       u(x)p dx  1 α grad u(x)p dx, (4.3.1) n 2 B B where α = max{a1 , . . . , an }.

392

Chapter 4. Poincaré- and Sobolev-Type Inequalities

P ROOF. From the hypotheses, we have the following identities nu(x) =

n  

xi

∂ u(x1 , . . . , ti , . . . , xn ) dti , ∂ti

i=1 0

nu(x) = −

n  

ai

i=1 xi

∂ u(x1 , . . . , ti , . . . , xn ) dti . ∂ti

(4.3.2)

(4.3.3)

From (4.3.2) and (4.3.3), we observe that n    u(x)  1 2n



    ∂ u(x1 , . . . , ti , . . . , xn ) dti .  ∂t 

ai 

i=1 0

(4.3.4)

i

From (4.3.4) and using the elementary inequality (see [79,211]) 

n 

k ci

 Ck,n

i=1

n 

cik ,

(4.3.5)

i=1

where ci are nonnegative reals and Ck,n = nk−1 , k > 1, and Ck,n = 1, 0  k  1, Hölder’s inequality with indices p, p/(p − 1) and using the definition of α, we obtain  n
   p 
p ai  ∂  p   1 p−1 u(x)   u(x1 , . . . , ti , . . . , xn ) dti n   2n ∂ti 0 i=1  n p  
 ai 
p   ∂  1 p−1 p−1   n (ai ) u(x1 , . . . , ti , . . . , xn ) dti  2n ∂ti 0 i=1   p 
 n   1 1 p p−1  ai  ∂  α u(x1 , . . . , ti , . . . , xn ) dti . (4.3.6)  n 2 ∂ti 0 i=1

Integrating both sides of (4.3.6) with respect to x1 , . . . , xn on B and using the definition of α and inequality (4.3.5) we have  n   p 
p    ∂     u(x)p dx  1 1 α p−1 α u(x) dx  n 2 ∂xi B i=1 B  p 
 n    1 1 p p   ∂ = α u(x) dx  n 2 B ∂xi i=1

4.3. Poincaré- and Sobolev-Type Inequalities I

393

p 2/p p/2
   n   ∂  1 α p  = u(x) dx  n 2 ∂xi B i=1 2 p/2
   n   ∂  1 α p  u(x) dx   n 2 B i=1 ∂xi
  p 1 α p  grad u(x) dx. = n 2 B This result is the desired inequality in (4.3.1) and the proof is complete.



The following theorem deals with the Poincaré-type inequality which is an integral analogue of the discrete inequality given by Pachpatte in [242, Theorem 1]. T HEOREM 4.3.2. Let u, p, B, α be as in Theorem 4.3.1. Then
 (p−1)/p   u(x)p/(p−1) dx B





 1/2   1 1 1/2 (2(p−n)+np)/(2p) grad u(x)2 dx α . 2 n B

(4.3.7)

P ROOF. From the hypotheses and by following the proof of Theorem 4.3.1, we have (4.3.4). From (4.3.4) and using inequality (4.3.5) and Hölder’s inequality with indices p, p/(p − 1), we have   u(x)p/(p−1)  p/(p−1)
p/(p−1)  n  ai   ∂  1   u(x1 , . . . , ti , . . . , xn ) dti  2n ∂ti i=1 0  p/(p−1)
p/(p−1) n
 ai    ∂  1 p/(p−1)−1   n u(x1 , . . . , ti , . . . , xn ) dti  2n ∂ti 0 i=1
 1/p
p/(p−1) n ai  1 1/(p−1)  n dti 2n 0 i=1 p/(p−1) (p−1)/p p/(p−1)  ai   ∂    × dti  ∂t u(x1 , . . . , ti . . . , xn ) i 0 p/(p−1)
p/(p−1) n  ai    ∂  1  u(x1 , . . . , ti , . . . , xn )  (αn)1/(p−1) dti .   2n ∂ti i=1 0 (4.3.8)

394

Chapter 4. Poincaré- and Sobolev-Type Inequalities

Integrating both sides of (4.3.8) with respect to x1 , . . . , xn on B, using the definition of α and inequality (4.3.5) we observe that    u(x)p/(p−1) dx B





=

1 2n 1 2n

p/(p−1) 1/(p−1)

(αn)

p/(p−1) n     ∂    α dx  ∂x u(x) i=1 B

p/(p−1)

i

(αn)1/(p−1) α

p/(p−1) 2(p−1)/p   n   ∂    ×  ∂x u(x) B




1 2n

i=1

p/(2(p−1))

dx

i

 

p/(p−1) 1/(p−1)

(αn)

n2(p−1)/p−1

α B

2 n    ∂    u(x)  ∂x  i=1

p/(2(p−1))

dx

i


p/(p−1)    α −p/(2(p−1)) grad u(x)p/(p−1) dx. = n 2 B

(4.3.9)

From (4.3.9) and using Hölder’s inequality with indices 2(p − 1)/p, 2(p − 1)/(p − 2) and the definition of α we observe that
 (p−1)/p   u(x)p/(p−1) dx B



 (p−1)/p   α −1/2 grad u(x)p/(p−1) dx n 2 B

 (p−2)/(2(p−1))  p/(2(p−1)) (p−1)/p   α −1/2 grad u(x)2 dx n  dx 2 B B

 1/2   α −1/2  n (p−2)/(2p) grad u(x)2 dx n α  2 B

1/2 1/2   1 1 grad u(x)2 dx = α (2(p−n)+pn)/(2p) . 2 n B 

This result is the required inequality in (4.3.7) and the proof is complete.



The following theorem established in [265] deals with the Sobolev-type inequality.

395

4.3. Poincaré- and Sobolev-Type Inequalities I

T HEOREM 4.3.3. Let p
1 be a constant and u, B, α be as in Theorem 4.3.1. Then    u(x)p dx B

pα  √ 2 n




  u(x)2(p−1) dx

1/2


B

  grad u(x)2 dx

1/2 .

(4.3.10)

B

P ROOF. From the hypotheses, we have the following identities nup (x) = p

n  

xi

up−1 (x1 , . . . , ti , . . . , xn )

i=1 0

∂ u(x1 , . . . , ti , . . . , xn ) dti , ∂ti (4.3.11)

nup (x) = −p

n  ai 

up−1 (x1 , . . . , ti , . . . , xn )

i=1 xi

∂ u(x1 , . . . , ti , . . . , xn ) dti . ∂ti (4.3.12)

From (4.3.11) and (4.3.12), we observe that n    u(x)p  p 2n



i=1 0

 u(x1 , . . . , ti , . . . , xn )p−1

ai 

   ∂   ×  u(x1 , . . . , ti , . . . , xn ) dti . ∂t

(4.3.13)

i

Integrating both sides of (4.3.13) with respect to x1 , . . . , xn on B and using the definition of α we have    n         u(x)p dx  pα u(x)p−1  ∂ u(x) dx. (4.3.14)  ∂x  2n i B B i=1

From and using Schwarz inequality and the elementary inequality (4.3.14) ( ni=1 bi )2  n ni=1 bi2 (for b1 , . . . , bn reals), we obtain    u(x)p dx B

pα  2n


 B

  u(x)2(p−1) dx

2 1/2 1/2   n   ∂     ∂x u(x) dx i B i=1

396

Chapter 4. Poincaré- and Sobolev-Type Inequalities

pα 1/2  n 2n pα = √ 2 n




  u(x)2(p−1) dx B




  u(x)2(p−1) dx

2 1/2 1/2   n   ∂     ∂x u(x) dx i B

1/2


B

i=1

  grad u(x)2 dx

1/2 .

B

This result is the desired inequality in (4.3.10) and the proof is complete.



The following variant of Sobolev’s inequality is established in [290]. T HEOREM 4.3.4. Let p
0, q
1 be constants and u, B, α be as in Theorem 4.3.1. Then 

  u(x)p+q dx  1 n B




 q  q  n      p+q u(x)p  ∂ u(x) dx. α   2 ∂xi B

(4.3.15)

i=1

P ROOF. From the hypotheses, we have the following identities nup+q (x) = (p + q)

n  

xi

up+q−1 (x1 , . . . , ti , . . . , xn )

i=1 0

×

∂ u(x1 , . . . , ti , . . . , xn ) dti ∂ti

(4.3.16)

and p+q

nu

(x) = −(p + q)

n  

ai

up+q−1 (x1 , . . . , ti , . . . , xn )

i=1 xi

×

∂ u(x1 , . . . , ti , . . . , xn ) dti . ∂ti

(4.3.17)

From (4.3.16) and (4.3.17), we observe that n  ai      u(x1 , . . . , ti , . . . , xn )p+q−1 u(x)p+q  p + q 2n i=1 0    ∂   ×  u(x1 , . . . , ti , . . . , xn ) dti . ∂ti

(4.3.18)

397

4.3. Poincaré- and Sobolev-Type Inequalities I

Integrating both sides of (4.3.18) over B and using the definition of α and rewriting the resulting inequality we have    u(x)p+q dx B






    n       p+q u(x)p/q  ∂ u(x)u(x)p+q−p/q−1 dx. α   2n ∂xi B

(4.3.19)

i=1

By using Hölder’s inequality on the right-hand side of (4.3.19) with indices q, q/(q − 1), we have    u(x)p+q dx B






 q 1/q    (q−1)/q n  p  ∂ p+q    p+q       u(x)  u(x) α u(x) dx dx . 2n ∂xi B B i=1

(4.3.20)

If B |u(x)|p+q dx = 0 then (4.3.15) is trivially true; otherwise, we divide both

sides of (4.3.20) by { B |u(x)|p+q dx}(q−1)/q and then raise both sides to the power q and use the elementary inequality ( ni=1 ci )k  nk−1 ni=1 cik (for ci
0 reals and k
1) to get (4.3.15). The proof is complete.  R EMARK 4.3.1. We note that, in the special cases when (i) p = 2, q = 2 and (ii) p = 0, inequality (4.3.15) reduces, respectively, to the following inequalities 

n    u(x)4 dx  1 (2α)2 n B



i=1 B

 2     u(x)2  ∂ u(x) dx  ∂x 

(4.3.21)

i

and q
q   n    ∂    u(x)q dx  1 qα u(x) dx.  n 2 ∂xi B B



(4.3.22)

i=1

Inequality (4.3.21) is a Sobolev-type inequality, while inequality (4.3.22) is a variant of Poincaré-type inequality given in Theorem 4.3.1. The following Poincaré- and Sobolev-type inequalities involving two functions are established in [249].

398

Chapter 4. Poincaré- and Sobolev-Type Inequalities

# T HEOREM 4.3.5. Let p, q
1 be constants and B = ni=1 [ai , bi ] be a bounded domain in Rn . Let u, v be sufficiently smooth functions defined on B which vanish on the boundary ∂B of B. Then 

    u(x)p v(x)q dx

B


  2p  2q  1 1 p+q+1 p+q  grad u(x) + grad v(x) dx,  α n 2 B

(4.3.23)

where α = max{b1 − a1 , . . . , bn − an }. T HEOREM 4.3.6. Let p, q, B, u, v, α be as in Theorem 4.3.5. Then 

    u(x)p v(x)q dx

B



pqα 2 8n




  u(x)2p dx

(p−1)/p


B

  grad u(x)2p dx

1/p

B




  v(x)2q dx

+

(q−1)/q


B

  grad v(x)2q dx

1/q .

(4.3.24)

B

R EMARK 4.3.2. In the special cases when p = q = 1 and ai = 0, inequalities (4.3.23) and (4.3.24) reduce to the Poincaré-type inequality given in Theorem 4.2.3. P ROOFS OF T HEOREMS 4.3.5 AND 4.3.6. From the hypotheses of Theorem 4.3.5, we have the following identities nu(x) =

n  

xi

i=1 ai

nu(x) = −

n  

∂ u(x1 , . . . , ti , . . . , xn ) dti , ∂ti bi

i=1 xi

∂ u(x1 , . . . , ti , . . . , xn ) dti . ∂ti

(4.3.25)

(4.3.26)

From (4.3.25) and (4.3.26), we observe that n    u(x)  1 2n



    ∂ u(x1 , . . . , ti , . . . , xn ) dti .  ∂t 

bi 

i=1 ai

i

(4.3.27)

399

4.3. Poincaré- and Sobolev-Type Inequalities I

From (4.3.27) and using inequality (4.3.5), Hölder’s inequality with indices p, p/(p − 1) (see [74, p. 126]) and the definition of α, we obtain   u(x)p 




1 2n

p n

p−1

 n  

  p   ∂  u(x1 , . . . , ti , . . . , xn ) dti  ∂t 

bi 

i

ai

i=1

 n   p 
p  1 1 p−1  bi  ∂ α  u(x1 , . . . , ti , . . . , xn ) dti .  2 n ai ∂ti

(4.3.28)

i=1

Similarly, we obtain   v(x)q 

 n   q 
q  1 1 q−1  bi  ∂ α v(x1 , . . . , ti , . . . , xn ) dti .  2 n ai ∂ti

(4.3.29)

i=1

From (4.3.28), (4.3.29) and using the elementary inequality cd  12 (c2 + d 2 ) (for c, d reals), inequality (4.3.5) with k = 2, the Schwarz inequality and the definition of α, we obtain     u(x)p v(x)q  n   p 2

  1 1 p+q 1 2 p+q−2  bi  ∂  α u(x1 , . . . , ti , . . . , xn ) dti  2 2 n ai ∂ti i=1



+

n  

 q  2  ∂  v(x1 , . . . , ti , . . . , xn ) dti  ∂t 

bi 

i

i=1 ai




p+q+1
2 1 1 α p+q−2 n 2 n

 n  

+

n  

i

 q 2   ∂ v(x1 , . . . , ti , . . . , xn ) dti  ∂t 

bi  ai

i=1





ai

i=1

 p 2   ∂ u(x1 , . . . , ti , . . . , xn ) dti  ∂t 

bi 

i

 2p
 n   1 1 p+q+1 p+q−2  bi  ∂  α α u(x , . . . , t , . . . , x ) 1 i n  dti  n 2 ai ∂ti i=1

+

n  

 2q   ∂ v(x1 , . . . , ti , . . . , xn ) dti .  ∂t 

bi 

i=1 ai

i

(4.3.30)

400

Chapter 4. Poincaré- and Sobolev-Type Inequalities

Integrating both sides of (4.3.30) with respect to x1 , . . . , xn on B, using the definition of α and a suitable version of inequality (4.3.5) we get      u(x)p v(x)q dx B


 1 1 p+q+1 p+q−1  α α n 2   n  2p 1/p  ∂    ×  ∂x u(x) B

i=1

i

p

2q 1/q   n   ∂    dx +  ∂x v(x) i B

q

dx

i=1


  2p  2q  1 1 p+q+1 p+q  grad u(x) + grad v(x) dx.  α n 2 B The proof of Theorem 4.3.5 is complete. From the hypotheses of Theorem 4.3.6, for any x in B, we have the following identities n  xi  ∂ nup (x) = p up−1 (x1 , . . . , ti , . . . , xn ) u(x1 , . . . , ti , . . . , xn ) dti , ∂t i ai i=1

(4.3.31) nup (x) = −p

n  bi 

up−1 (x1 , . . . , ti , . . . , xn )

i=1 xi

∂ u(x1 , . . . , ti , . . . , xn ) dti . ∂ti (4.3.32)

From (4.3.31) and (4.3.32), we observe that n    u(x)p  p 2n



 u(x1 , . . . , ti , . . . , xn )p−1

bi 

i=1 ai

   ∂   ×  u(x1 , . . . , ti , . . . , xn ) dti . ∂t

(4.3.33)

i

Similarly, for any x in B, we obtain the following inequality n    v(x)q  q 2n



 v(x1 , . . . , ti , . . . , xn )q−1

bi 

i=1 ai

   ∂   ×  v(x1 , . . . , ti , . . . , xn ) dti . ∂t i

(4.3.34)

4.3. Poincaré- and Sobolev-Type Inequalities I

401

From (4.3.33), (4.3.34) and using the elementary inequality cd  12 (c2 + d 2 ) (for c, d reals), inequality (4.3.5) with k = 2, the Schwarz inequality and the definition of α, we obtain     u(x)p v(x)q  pq 8n2



n  

 u(x1 , . . . , ti , . . . , xn )p−1

bi 

i=1 ai

  2  ∂   ×  u(x1 , . . . , ti , . . . , xn ) dti ∂t i

+

 n  

 v(x1 , . . . , ti , . . . , xn )q−1

bi 

i=1 ai

  2  ∂   ×  v(x1 , . . . , ti , . . . , xn ) dti ∂t i





n  bi   npq  u(x1 , . . . , ti , . . . , xn )p−1 2 8n ai i=1

+

  2  ∂   ×  u(x1 , . . . , ti , . . . , xn ) dti ∂t i

n  bi  

 v(x1 , . . . , ti , . . . , xn )q−1

i=1

ai

  2  ∂  ×  v(x1 , . . . , ti , . . . , xn ) dti ∂ti  n  2(p−1) pq  bi  u(x1 , . . . , ti , . . . , xn ) α  8n ai i=1

 2  ∂   ×  u(x1 , . . . , ti , . . . , xn ) dti ∂t i

+

n  bi  

 v(x1 , . . . , ti , . . . , xn )2(q−1)

i=1 ai

 2  ∂   ×  v(x1 , . . . , ti , . . . , xn ) dti . ∂t i

(4.3.35)

402

Chapter 4. Poincaré- and Sobolev-Type Inequalities

Integrating both sides of (4.3.35) with respect to x1 , . . . , xn on B, using the definition of α and Hölder’s inequality on the right-hand side with indices p, p/(p − 1) and q, q/(q − 1) (see [74, p. 126]) we obtain      u(x)p v(x)q dx B

pqα 2  8n 

pqα 8n



    u(x)2(p−1) grad u(x)2 dx +

B

2


  u(x)2p dx

(p−1)/p


B



    v(x)2(q−1) grad v(x)2 dx B

  grad u(x)2p dx

1/p

B




  v(x)2q dx

+

(q−1)/q


B



  grad v(x)2q dx

1/q .

B

This inequality is the desired inequality in (4.3.24) and the proof of Theorem 4.3.6 is complete. 

4.4 Poincaré- and Sobolev-Type Inequalities II In the recent past, several authors have presented numerous integral inequalities of Poincaré and Sobolev type. In this section we present some Poincaré- and Sobolev-type inequalities investigated by Pachpatte in [237,246]. In 1986, Pachpatte [237] has established the following inequalities of the Poincaré and Sobolev type, involving functions of several independent variables. # T HEOREM 4.4.1. Let B = ni=1 [0, ai ] be a bounded domain in Rn , n
3. Let 1  p < Q and u be a real-valued function belonging to C 1 (B) which vanishes on the boundary ∂B of B. Then
 B



  u(x)p dx

1/p

# ( ni=1 ai )(Q−p)/(pQ) 2n1/p  n (Q−p)/(pQ)
 1/Q  pQ/(Q−p)  Q    ∇u(x) Q dx × ai , (4.4.1) B

i=1

where (∇u(x)Q )Q =

n

∂ Q i=1 | ∂ti u(x)| .

403

4.4. Poincaré- and Sobolev-Type Inequalities II

R EMARK 4.4.1. In the special case when Q = 2 and p = n/(n − 1) (for n
3), we see that 1 < p < Q holds and inequality (4.4.1) reduces to
 (n−1)/n   u(x)n/(n−1) dx B

# ( ni=1 ai )(n−2)/(2n)  2n(n−1)/n  n (n−2)/(2n)
 1/2  2n/(n−2)   grad u(x)2 dx × ai .

(4.4.2)

B

i=1

T HEOREM 4.4.2. Let p
1, P , Q > 1, P −1 + Q−1 = 1, B be as in Theorem 4.4.1 and u be a real-valued function belonging to C 1 (B) which vanishes on the boundary ∂B of B. Then 1/P
  n 1/P   p P (p−1)   p P  u(x) dx   u(x) aj dx 2n B B j =1


 ×

B

   ∇u(x) Q dx Q

1/Q ,

(4.4.3)

where (∇u(x)Q )Q is as defined in Theorem 4.4.1. R EMARK 4.4.2. By taking p = n/(n − 1) (for n
3), P = Q = 2 in (4.4.3) and then squaring on both sides of the resulting inequality we have the following inequality
 2   u(x)n/(n−1) dx B



n

2
 i=1 ai 4(n − 1)2

  u(x)2/(n−1) dx




B

   grad u(x)2 dx .

(4.4.4)

B

Further, for n = 3, inequality (4.4.4) reduces to
 2   u(x)3/2 dx B



3

2
 i=1 ai

16

  u(x) dx B




   grad u(x)2 dx .

B

For the inequalities of the forms (4.4.4) and (4.4.5), see [152,155].

(4.4.5)

404

Chapter 4. Poincaré- and Sobolev-Type Inequalities

P ROOFS OF T HEOREMS 4.4.1 AND 4.4.2. If u ∈ C 1 (B), then we have the following identities nu(x) =

n  

xi

∂ u(x1 , . . . , ti , . . . , xn ) dti , ∂ti

i=1 0

nu(x) = −

n  

ai

i=1 xi

∂ u(x1 , . . . , ti , . . . , xn ) dti . ∂ti

From (4.4.6) and (4.4.7), we obtain  n  ai      ∂  u(x)  1  u(x1 , . . . , ti , . . . , xn ) dti .   2n ∂ti 0

(4.4.6)

(4.4.7)

(4.4.8)

i=1

From (4.4.8) and using the elementary inequality (see [3, p. 338])  n k n   k−1 ci  n cik i=1

(4.4.9)

i=1

(for ci
0 reals and k
1), we obtain p
p n
 ai      ∂  p−1 u(x)p  1  n u(x1 , . . . , ti , . . . , xn ) dti   2n ∂ti 0

(4.4.10)

i=1

for any p
1. Applying Hölder’s inequality with indices P , Q > 1 (P −1 + Q−1 = 1) to each integral in (4.4.10) we get Q 1/Q p 1/P
 ai  n

 ai   ∂      u(x)p  1 1 dt u(x , . . . , t , . . . , x ) i 1 i n  dti  p 2 n ∂ti 0 0 i=1

1  p/P = p ai 2 n n


 0

i=1

 Q p/Q   ∂ u(x1 , . . . , ti , . . . , xn ) dti .  ∂t 

ai 

(4.4.11)

i

Integrating both sides of (4.4.11) over B we get    u(x)p dx B

1  p/P  p ai 2 n n

i=1




 1· B

0

 Q p/Q   ∂ u(x1 , . . . , ti , . . . , xn ) dti dx.  ∂t 

ai 

i

(4.4.12)

405

4.4. Poincaré- and Sobolev-Type Inequalities II

Now, applying Hölder’s inequality with indices p1 = Q/(Q − p), q1 = Q/p to each integral on the right-hand side in (4.4.12), we get    u(x)p dx B

# Q p/Q
  n  ∂  ( ni=1 ai )(Q−p)/Q  p/P p/Q   dx  a a u(x) i i   2p n B ∂xi i=1

# Q p/Q
  n  ∂  ( ni=1 ai )(Q−p)/Q  p  = ai u(x) dx .  p 2 n B ∂xi

(4.4.13)

i=1

Now, applying Hölder’s inequality to the sum on the right-hand side in (4.4.13) with indices p1 and q1 again, we obtain    u(x)p dx B



# ( ni=1 ai )(Q−p)/Q 2p n (Q−p)/Q  n
  n  pQ/(Q−p)  ai × i=1

i=1

B

 Q p/Q  ∂    .  ∂x u(x) dx

(4.4.14)

i

From (4.4.14) we have
 1/p   u(x)p dx B

# ( ni=1 ai )(Q−p)/(pQ)  2n1/p  n (Q−p)/(pQ)
 1/Q  pQ/(Q−p)    ∇u(x) Q dx × ai . Q B

i=1

The proof of Theorem 4.4.1 is complete. From the hypotheses of Theorem 4.4.2, if u ∈ C 1 (B) then we have the following identities n  xi   p−1 p nu (x) = p u(x1 , . . . , ti , . . . , xn ) i=1 0

×

∂ u(x1 , . . . , ti , . . . , xn ) dti , ∂ti

(4.4.15)

406

Chapter 4. Poincaré- and Sobolev-Type Inequalities

nup (x) = −p

n  

ai 

p−1 u(x1 , . . . , ti , . . . , xn )

i=1 xi

×

∂ u(x1 , . . . , ti , . . . , xn ) dti . ∂ti

(4.4.16)

From (4.4.15) and (4.4.16), we obtain   n  ai        u(x1 , . . . , ti , . . . , xn )p−1  ∂ u(x1 , . . . , ti , . . . , xn ) dti . u(x)p  p  ∂t  2n i 0 i=1

(4.4.17) Integrating both sides of (4.4.17) over B we get     n   p−1  ∂      dx. u(x)p dx  p ai u(x) u(x)   2n ∂xi B B

(4.4.18)

i=1

Applying Hölder’s inequality with indices P , Q > 1 (P −1 + Q−1 = 1) to each integral on the right-hand side in (4.4.18) we get    u(x)p dx B

Q 1/Q
 1/P
  n P (p−1)  ∂   p     u(x) ai dx u(x) dx   2n B B ∂xi i=1 Q 1/Q
 
 1/P  n   ∂   p   dx u(x)P (p−1) dx = ai u(x) .   2n B B ∂xi i=1

Now, applying Hölder’s inequality to the sum on the right-hand side in the above inequality with the same indices P , Q, we obtain    u(x)p dx B 1/P
  n 1/P
 1/Q  Q P (p−1)   p  P     ∇u(x) Q dx u(x) ai dx .  2n B B i=1

This inequality is the desired inequality in (4.4.3) and the proof of Theorem 4.4.2 is complete.  The following Poincaré- and Sobolev-type inequalities in which the constants appearing do not depend on the size of the domain of definitions of the functions are established in [246].

407

4.4. Poincaré- and Sobolev-Type Inequalities II

T HEOREM 4.4.3. Let ur , r = 1, . . . , m, be sufficiently smooth functions of compact support in E, the n-dimensional Euclidean space with n
2. Then   E

m    ur (x)n/(n−1)

1/m

(n−1)/n

dx

i=1


(n−1)/n  m    1 1 grad ur (x) dx. √ 4n m r=1 E

(4.4.19)

R EMARK 4.4.3. We note that in the special case when m = 1, u1 = u, inequality (4.4.19) reduces to the following inequality 

  u(x)n/(n−1) dx

(n−1)/n

 µ

E

  grad u(x) dx,

E

√ where µ = 1/ 4n, which is given in Theorem 4.2.5. T HEOREM 4.4.4. Let ur , r = 1, . . . , m, be sufficiently smooth functions of compact support in E, the n-dimensional Euclidean space with n
2, and let pr
1 be constants. Then   E

m    ur (x)((pr +2)/2)(n/(n−1))

1/m

(n−1)/n

dx

r=1


(n−1)/n   1/m m
1 pr + 2 1 √ 4 n m r=1

×

m   r=1

  ur (x)pr dx

1/2 

E

  grad ur (x)2 dx

1/2 .

(4.4.20)

E

R EMARK 4.4.4. We note that in the special case where m = 1, inequality (4.4.20) reduces to 

  u1 (x)((p1 +2)/2)(n/(n−1)) dx

(n−1)/n

E

1/2
 1/2  p1    1 p1 + 2     u1 (x) dx grad u1 (x) dx √ . 4 n E E

(4.4.21)

408

Chapter 4. Poincaré- and Sobolev-Type Inequalities

On taking n = 2 and p1 = 2 in (4.4.21) and squaring both sides of the resulting inequality, we obtain the sharpened version of Sobolev’s inequality established by Payne in [362]. The next two theorems established in [246] deal with the Poincaré- and Sobolev-type inequalities in which the constants appearing depend on the size of the domain of definitions of the function. # T HEOREM 4.4.5. Let B = ni=1 [ai , bi ] be a bounded domain in Rn with n
2, ur , r = 1, . . . , m, be sufficiently smooth functions defined on B which vanish on the boundary ∂B of B and pr
2 be constants. Then 1/m
1/m( mr=1 pr )    m  m pr    α 1 ur (x) grad ur (x)pr dx, dx  mn 2 B B r=1

r=1

(4.4.22) where α = max{b1 − a1 , . . . , bn − an }. T HEOREM 4.4.6. Let B, ur , r = 1, . . . , m, be as in Theorem 4.4.5 and pr
1 be constants. Then 1/m   m   ur (x)(pr +2)/2 dx B

r=1

 m
1/m  pr + 2  α  √ 2 2m n r=1

×

m   r=1

  ur (x)pr dx

B

1/2 

  grad ur (x)2 dx

1/2 ,

(4.4.23)

B

where α is as defined in Theorem 4.4.5. R EMARK 4.4.5. In the special case when m = 1, inequalities (4.4.22) and (4.4.23) reduce respectively to the following Poincaré- and Sobolev-type inequalities
p1       u1 (x)p1 dx  1 α grad u1 (x)p1 dx, p1
2, (4.4.24) n 2 B B

409

4.4. Poincaré- and Sobolev-Type Inequalities II

and 

  u1 (x)(pr +2)/2 dx

B


 1/2  1/2     p1 + 2 α u1 (x)p1 dx grad u1 (x)2 dx  √ , 2 2 n B B

p1
1. (4.4.25)

For similar inequalities, see [73,120,121,152–157,178,179,418]. P ROOFS OF T HEOREMS 4.4.3 AND 4.4.4. From the hypotheses of Theorem 4.4.3, we have the following identities  x1 ∂ ur (x) = ur (t1 , x2 , . . . , xn ) dt1 , (4.4.26) ∂t −∞ 1  ∞ ∂ ur (x) = − ur (t1 , x2 , . . . , xn ) dt1 , (4.4.27) ∂t 1 x1 for r = 1, . . . , m. From (4.4.26) and (4.4.27), we obtain        ur (x)  1  ∂ ur (t1 , x2 , . . . , xn ) dt1 .   2 1 ∂t1

(4.4.28)

Similarly, we obtain   ur (x)  1 2

   ∂   ur (x1 , . . . , ti , . . . , xn ) dti  ∂t 

(4.4.29)

i

i

for i = 2, . . . , n. From (4.4.28) and (4.4.29), we observe that   ur (x)n/(n−1)  1/(n−1)
n/(n−1)    ∂  1   ur (t1 , x2 , . . . , xn ) dt1  2 1 ∂t1  1/(n−1)    ∂    × ··· ×  ∂t ur (x1 , . . . , xn−1 , tn ) dtn n n

(4.4.30)

for r = 1, . . . , m. From (4.4.30) and using the inequality 

k  i=1

1/k ci

1  ci k k

i=1

(4.4.31)

410

Chapter 4. Poincaré- and Sobolev-Type Inequalities

(for ci nonnegative reals and k
1), we obtain 

m    ur (x)n/(n−1)

1/m

r=1

 1/(n−1)  
  ∂  1 1 n/(n−1)     ∂t u1 (t1 , x2 , . . . , xn ) dt1 m 2 1 1  1/(n−1)    ∂    × ··· ×  ∂t u1 (x1 , . . . , xn−1 , tn ) dtn n n .. .

 1/(n−1)    ∂    +  ∂t um (t1 , x2 , . . . , xn ) dt1 1

1

 1/(n−1)     ∂    . × ··· ×  ∂t um (x1 , . . . , xn−1 , tn ) dtn n

n

(4.4.32) We integrate both sides of (4.4.32) with respect to x1 and use on the right-hand side the general version of Hölder’s inequality (4.2.29) (see [179, p. 40]) with k = n − 1. We then integrate the resulting inequality with respect to x2 and use inequality (4.4.31) on the right-hand side. We repeat this procedure, integrating with respect to x3 , . . . , xn , and obtain (see [121, Chapter 1, Theorem 9.3]) 1/m   m n/(n−1)  ur (x) dx E

r=1


 1 1 n/(n−1)  m 2  1/(n−1)    1/(n−1)    ∂  ∂       × ···  ∂x u1 (x) dx  ∂x u1 (x) dx 1 n E E .. .

 1/(n−1)     ∂    ··· +  ∂x um (x) dx E

1

E

  1/(n−1)  ∂    .  ∂x um (x) dx n

(4.4.33)

411

4.4. Poincaré- and Sobolev-Type Inequalities II

From (4.4.33) and using inequalities (4.3.5), (4.4.31) and the inequality 

n 

2 n

ci

i=1

n 

ci2 ,

(4.4.34)

i=1

where c1 , . . . , cn are reals, we obtain   E

m    ur (x)n/(n−1)

1/m

(n−1)/n

dx

r=1

 1/n    1/n  
  ∂  ∂   1 1 (n−1)/n     u1 (x) dx ··· u1 (x) dx   2 m E ∂x1 E ∂xn .. .

 1/n     ∂    + ···  ∂x um (x) dx E

1

E

  1/n   ∂     ∂x um (x) dx n

       ∂  ∂   1 1 (n−1)/n     dx + · · · +  u (x) u (x) 1 1     2n m ∂xn E ∂x1


.. .

       ∂  ∂       +  ∂x um (x) + · · · +  ∂x um (x) dx E

n

1

   2 1/2      ∂  ∂   1 1 (n−1)/n     = + · · · + u (x) u (x) dx 1 1     2n m ∂x1 ∂xn E


.. . +

   2 1/2      ∂  ∂       + · · · + u (x) u (x) dx  ∂x m   ∂x m  E

1


(n−1)/n  m    1 1 grad ur (x) dx. √ 4n m r=1 E The proof of Theorem 4.4.3 is complete.

n

412

Chapter 4. Poincaré- and Sobolev-Type Inequalities

From the assumptions of Theorem 4.4.4, we have the following identities 

(p +2)/2 ur (x) r =




pr + 2 2



x1

−∞

p /2

ur r (t1 , x2 , . . . , xn ) ×



∂ ur (t1 , x2 , . . . , xn ) dt1 , ∂t1

(4.4.35)

 ∞
(p +2)/2 pr + 2 p /2 ur (x) r =− ur r (t1 , x2 , . . . , xn ) 2 x1 ×

∂ ur (t1 , x2 , . . . , xn ) dt1 , ∂t1

(4.4.36)

for r = 1, . . . , m. From (4.4.35) and (4.4.36), we obtain   ur (x)(pr +2)/2   
pr /2  ∂   pr + 2     ur (t1 , x2 , . . . , xn )   ∂t ur (t1 , x2 , . . . , xn ) dt1 . 4 1 1

(4.4.37)

Similarly, we obtain   ur (x)(pr +2)/2   
pr /2  ∂   pr + 2     ur (x1 , . . . , ti , . . . , xn )   ∂t ur (x1 , . . . , ti , . . . , xn ) dti 4 i i (4.4.38) for i = 2, . . . , n. From (4.4.37) and (4.4.38), we observe that   ur (x)((pr +2)/2)(n/(n−1))  pr + 2 n/(n−1) 4   1/(n−1)      ur (t1 , x2 , . . . , xn )pr /2  ∂ ur (t1 , x2 , . . . , xn ) dt1 ×  ∂t  1 1   1/(n−1)  pr /2  ∂       ur (x1 , . . . , xn−1 , tn ) × ··· ×  ∂t ur (x1 , . . . , xn−1 , tn ) dtn n n (4.4.39)




413

4.4. Poincaré- and Sobolev-Type Inequalities II

for r = 1, . . . , m. From (4.4.39) and inequality (4.4.31), we obtain m 1/m   ur (x)((pr +2)/2)(n/(n−1)) r=1

m
 1  pr + 2 n/(n−1)  m 4

1/m

r=1

  1/(n−1)     u1 (t1 , x2 , . . . , xn )p1 /2  ∂ u1 (t1 , x2 , . . . , xn ) dt1  ∂t  1 1    u1 (x1 , . . . , xn−1 , tn )p1 /2 × ··· ×

 ×

n

  1/(n−1)  ∂  ×  u1 (x1 , . . . , xn−1 , tn ) dtn ∂tn   1/(n−1)  pm /2  ∂       um (t1 , x2 , . . . , xn ) + ··· +  ∂t um (t1 , x2 , . . . , xn ) dt1 1 1    um (x1 , . . . , xn−1 , tn )pm /2 × ··· × n

  1/(n−1)  ∂   . × um (x1 , . . . , xn−1 , tn ) dtn ∂t

(4.4.40)

n

We integrate both sides of (4.4.40) with respect to x1 , use Hölder’s inequality (4.2.29) on the right-hand side, then integrate the resulting inequality with respect to x2 , and finally use inequality (4.2.29) on the right-hand side once more. We repeat this process, integrating with respect to x3 , . . . , xn , we obtain 1/m   m   ur (x)((pr +2)/2)(n/(n−1)) dx E

r=1

m
 1  pr + 2 n/(n−1)  m 4 r=1

 ×

E

1/m

  1/(n−1)     u1 (x)p1 /2  ∂ u1 (x) dx  ∂x  

× ··· × E

1

  1/(n−1)     u1 (x)p1 /2  ∂ u1 (x) dx  ∂x  n

414

Chapter 4. Poincaré- and Sobolev-Type Inequalities

 + ··· + E

 × ··· × E

  1/(n−1)     um (x)pm /2  ∂ um (x) dx  ∂x  1

  1/(n−1)     um (x)pm /2  ∂ um (x) dx .  ∂x 

(4.4.41)

n

From (4.4.41), (4.3.5), (4.4.31), the Schwarz inequality and (4.4.34), we obtain   E

dx

r=1




(n−1)/n

1/m

m    ur (x)((pr +2)/2)(n/(n−1))

1 m

(n−1)/n   m
r=1

 × E

pr + 2 4



1/m

  1/n     u1 (x)p1 /2  ∂ u1 (x) dx  ∂x  1

 × ··· × E

  1/n     u1 (x)p1 /2  ∂ u1 (x) dx  ∂x  n

.. .  + E

  1/n     um (x)pm /2  ∂ um (x) dx  ∂x  1

 × ··· × E

  1/n     um (x)pm /2  ∂ um (x) dx  ∂x  n

m

  1 1 (n−1)/n  pr + 2  n m 4

1/m

r=1

 × E

          u1 (x)p1 /2  ∂ u1 (x) + · · · +  ∂ u1 (x) dx  ∂x  ∂x   n

1

 + ··· + E

           um (x)pm /2  ∂ um (x) + · · · +  ∂ um (x) dx  ∂x   ∂x  1

n

415

4.4. Poincaré- and Sobolev-Type Inequalities II

m

  1 1 (n−1)/n  pr + 2  n m 4

1/m

r=1



  u1 (x)p1 dx

×

1/2

E

   2 1/2    ∂  ∂       + · · · + × u (x) u (x)  ∂x 1  dx  ∂x 1  n

1

E

.. . 

  um (x)pm dx

+

1/2

E

   2 1/2    ∂  ∂       + · · · + × u (x) u (x)  ∂x m  dx  ∂x m  n

1

E


(n−1)/n   m
1 pr + 2 1 √ 4 n m

1/m

r=1

×

m   r=1

  ur (x)pr dx

1/2 

E

  grad ur (x)2 dx

1/2 .

E

This inequality is the desired inequality (4.4.20) and the proof of Theorem 4.4.4 is complete.  P ROOFS OF T HEOREMS 4.4.5 AND 4.4.6. From the hypotheses of Theorem 4.4.5, since ur (x) are smooth functions defined on B which vanish on the boundary ∂B of B, we have the following identities nur (x) =

n  

xi

i=1 ai

∂ ur (x1 , . . . , ti , . . . , xn ) dti ∂ti

(4.4.42)

∂ ur (x1 , . . . , ti , . . . , xn ) dti , ∂ti

(4.4.43)

and nur (x) = −

n  

bi

i=1 xi

416

Chapter 4. Poincaré- and Sobolev-Type Inequalities

for r = 1, . . . , m. From (4.4.42) and (4.4.43), we observe that  n  bi   ∂      ur (x1 , . . . , ti , . . . , xn ) dti . 2nur (x)   ∂t  i ai

(4.4.44)

i=1

From (4.4.44) and on using inequality (4.3.5), Hölder’s inequality with indices pr , pr /(pr − 1) and the definition of α, we obtain  n   pr  
pr  bi  ∂    pr −1 ur (x)pr  1   n  ur (x1 , . . . , ti , . . . , xn ) dti 2n ai ∂ti i=1



 pr 
 n   1 1 pr pr −1  bi  ∂  α ur (x1 , . . . , ti , . . . , xn ) dti .  n 2 ai ∂ti i=1

(4.4.45) From (4.4.45) and inequality (4.4.31), we obtain  m 1/m   ur (x)pr r=1


 1 m 1 1 m r=1 pr 1 ( m pr )−1  α m r=1 nm 2  n   p1   bi  ∂   u1 (x1 , . . . , ti , . . . , xn ) dti ×  ∂t  i ai i=1

.. . +

 n  

 pm   ∂  um (x1 , . . . , ti , . . . , xn ) dti .  ∂t 

bi 

i=1 ai

(4.4.46)

i

By integrating both sides of (4.4.46) over B, using the definition of α and inequality (4.3.5) with k = 2/pr  1, we have 1/m   m pr  ur (x) dx B

r=1


 1 m 1 1 m r=1 pr 1 ( m pr )−1  α m r=1 nm 2

417

4.4. Poincaré- and Sobolev-Type Inequalities II

p1  p1 2/p1 p1 /2     ∂   ∂      dx ×α  ∂x u1 (x) + · · · +  ∂x u1 (x) n

1

B

.. .

pm  pm 2/pm pm /2      ∂   ∂      + dx  ∂x um (x) + · · · +  ∂x um (x) 


1 1 α m nm 2

n

1

B

m

r=1 pr

m     grad ur (x)pr dx. r=1 B

The proof of Theorem 4.4.5 is complete. From the assumptions on the functions ur (x) in Theorem 4.4.6, we have the following identities  (p +2)/2 n ur (x) r =




pr + 2 2




 n 

(p +2)/2  pr + 2 =− n ur (x) r 2

xi

i=1 ai

p /2

ur r (x1 , . . . , ti , . . . , xn )  ∂ × ur (x1 , . . . , ti , . . . , xn ) dti , ∂ti

 n 

(4.4.47) bi

i=1 xi

p /2

ur r (x1 , . . . , ti , . . . , xn )  ∂ ur (x1 , . . . , ti , . . . , xn ) dti , × ∂ti (4.4.48)

for r = 1, . . . , m. From (4.4.47) and (4.4.48), we observe that (p +2)/2  2nur (x) r  n 
p /2 pr + 2  bi  ur (x1 , . . . , ti , . . . , xn ) r  2 ai i=1

    ∂   ×  ur (x1 , . . . , ti , . . . , xn ) dti . ∂t i

(4.4.49)

418

Chapter 4. Poincaré- and Sobolev-Type Inequalities

From (4.4.49) and inequality (4.4.31), we obtain 

m    ur (x)(pr +2)/2

1/m

r=1

 m
1/m  pr + 2  1  2nm 2 r=1  n      bi  p1 /2  ∂      u1 (x1 , . . . , ti , . . . , xn ) ×  ∂t u1 (x1 , . . . , ti , . . . , xn ) dti i ai i=1

.. .



+

n  

 um (x1 , . . . , ti , . . . , xn )pm /2

bi 

i=1 ai

    ∂  ×  um (x1 , . . . , ti , . . . , xn ) dti . ∂t

(4.4.50)

i

Integrating both sides of (4.4.50) over B, using the definition of α, the Schwarz inequality and inequality (4.4.34) we have 1/m   m   ur (x)(pr +2)/2 dx B

r=1

 m
1/m  pr + 2  1  2nm 2 r=1

 ×α

B

.. .

          u1 (x)p1 /2  ∂ u1 (x) + · · · +  ∂ u1 (x) dx  ∂x  ∂x   n

1



+ B



           um (x)pm /2  ∂ um (x) + · · · +  ∂ um (x) dx  ∂x   ∂x 

m
 α pr + 2  2nm 2 r=1

1

1/m

n

419

4.5. Inequalities of Dubinskii and Others



  u1 (x)p1 dx

× B

.. .

   2 1/2 1/2    ∂   ∂       ∂x u1 (x) + · · · +  ∂x u1 (x) dx



  um (x)pm dx

+

n

1

B

1/2

B

   2 1/2    ∂  ∂       ×  ∂x um (x) + · · · +  ∂x um (x) dx 

1 √ 2m n ×

B



m
 r=1

m   r=1

B

1

pr + 2 2

n

1/m

  ur (x)pr dx

1/2 

  grad ur (x)2 dx

1/2 .

B

This inequality is the required inequality in (4.4.23) and the proof of Theorem 4.4.6 is complete. 

4.5 Inequalities of Dubinskii and Others Integral inequalities of Poincaré and Sobolev type play a fundamental role in the theory and applications of partial differential equations. A large number of inequalities related to these inequalities are established by several authors in the literature. In this section we deal with certain inequalities established by Dubinskii [95], Alzer [10] and Pachpatte [345]. In what follows, we let x = (x1 , . . . , xn ) be a variable point in Rn , an n-dimensional Euclidean space, G be a bounded region in Rn with boundary ∂G satisfying the cone condition (see [95]), C m (G) is the space of functions (the closure of G) up to order m inclusive, u(x) with bounded derivatives in G dx = dx1 · · · dxn is the volume element, and ds is the surface element corresponding to ∂G. Constant quantities, not depending on u(x), will be denoted by the symbol K. In different inequalities their meaning will be different. The inequalities in the following theorems are established by Dubinskii [95]. T HEOREM 4.5.1. Let −∞ < α0 < +∞, α1
1, u(x), |u(x)|α0 +α1 ∈ C 1 (G). Then the following inequality is valid  α1 

    α0 +α1 α0  ∂u  α0 +α1 |u| dx  K |u|  dx + |u| ds (4.5.1) ∂xi  G G ∂G

420

Chapter 4. Poincaré- and Sobolev-Type Inequalities

for i = 1, . . . , n. The constant K depends on α0 , α1 and G. P ROOF. From the divergence theorem we have    ∂  xi |u|α0 +α1 dx = xi |u|α0 +α1 ds. G ∂xi ∂G From (4.5.2) it is easy to observe that   

    α0 +α1 α0 +α1 −1  ∂u  α0 +α1 |u| dx  K |u| |u| ds ,  ∂x  dx + i G G ∂G from which, for α1 = 1, we obtain inequality (4.5.1). If α1 > 1, then      α0 +α1 −1  ∂u  |u|  ∂x  dx i G      α0 /α1  ∂u  α0 +α1 −1−α0 /α1 = |u| dx  ∂x |u| i G  α1
     α1 − 1 −α1 /(α1 −1) ε α1 α0  ∂u   |u|  dx + |u|α0 +α1 dx. ε α1 G ∂xi  α1 G

(4.5.2)

(4.5.3)

(4.5.4)

Here we have used Young’s inequality ab 

ε p p 1 −q q a + ε b , p q

a, b
0,

1 1 + = 1, ε > 0, p q

for p = α1 . Choosing ε > 0 sufficiently large, from (4.5.3) and (4.5.4), we obtain inequality (4.5.1).  R EMARK 4.5.1. We note that, for the case when α0 , α1 are even and u|∂G = 0, inequality (4.5.1) was obtained earlier by Visik [421]. T HEOREM 4.5.2. Let −∞ < α0 < +∞, α1
0, α2
0, α1 + α2
1, u(x), |u(x)|α0 +α1 +α2 ∈ C 1 (G). Then the following inequality is valid  α2  α1 +α2 

      α0 +α1  ∂u  α0  ∂u  α0 +α1 +α2 |u| |u|  dx + |u| ds (4.5.5)  ∂x   K ∂xi  i G G ∂G for i = 1, . . . , n. The proof follows by estimating the integral on the left-hand side of (4.5.5), by using Young’s inequality with index p = (α1 + α2 )α2−1 and Theorem 4.5.1.

421

4.5. Inequalities of Dubinskii and Others

T HEOREM 4.5.3. Let α0 , α1 and α2 be nonnegative numbers, α3
1, α3
α1 , α0 + α2 + α3 − (α3 − α1 )(α3 − 1)−1
0, u(x) ∈ C 2 (G). Then the following inequality is valid     ∂u α1 +α2 +α3  |u|α0  dx ∂xi  G  α2  2 α3      α0 +α1  ∂u   ∂ u  K |u|  ∂x   ∂x 2  dx i G i 

    ∂u α0 +α1 +α2 +α3 α0 +α1 +α2 +α3   + |u| ds + ds (4.5.6)   ∂G ∂G ∂xi for i = 1, . . . , n. P ROOF. We have the obvious equalities  α1 +α2 +α3  α1 +α2 +α3 −1     ∂u α0  ∂u  α0 ∂u  ∂u  |u|  = |u| sign    ∂xi ∂xi ∂xi ∂xi      ∂u α1 +α2 +α3 −1 ∂ 1 ∂u |u|α0 +1 sign u  = sign . α + 1 ∂x ∂x  ∂x 0

i

i

i

Integrating this equation over G we obtain     ∂u α1 +α2 +α3  |u|α0  dx ∂xi  G     ∂u α1 +α2 +α3 −1 1 ∂  α0 +1 ∂u   = |u| sign u  sign dx.  α +1 ∂x ∂x ∂x 0

G

i

i

i

From this equation, integrating by parts, we have  α1 +α2 +α3    α0  ∂u  |u|  dx ∂xi  G      α1 +α2 +α3 −1    ∂u α1 +α2 +α3 −2  ∂ 2 u    α0 +1  ∂u     dx + K |u|α0 +1  |u| ds     2 ∂xi ∂xi  ∂xi G ∂G       ∂u α1 +α2 +α3 −2  ∂ 2 u     |u|α0 +1  K  ∂x 2  dx ∂xi  G i 

    ∂u α0 +α1 +α2 +α3 α0 +α1 +α2 +α3   + |u| ds + ds . (4.5.7)  ∂x  ∂G

∂G

i

Here we use Young’s inequality with index p = (α0 + α1 + α2 + α3 )(α0 + 1)−1 to the integral over ∂G. Inequality (4.5.7) yields inequality (4.5.6) for the case

422

Chapter 4. Poincaré- and Sobolev-Type Inequalities

α3 = α1 = 1. If α3 > 1, then applying Young’s inequality and Theorem 4.5.2, we obtain       ∂u α1 +α2 +α3 −2  ∂ 2 u     |u|α0 +1   ∂x 2  dx ∂xi  G i       ∂u α2 /α3  ∂ 2 u     = |u|(α0 +α1 )/α3   ∂x 2  ∂xi  G i  α1 +α2 +α3 −2−α2 /α3   α0 +1−(α0 +α1 )/α3  ∂u  × |u| dx  ∂x  i  α2  2 α3      ε α3 α0 +α1  ∂u   ∂ u   |u|  ∂x   ∂x 2  dx α3 G i i 
α3 − 1 −α3 /(α3 −1) ε + α3  α1 +α2 +α3 −(α3 −α1 )/(α3 −1)    α0 +(α3 −α1 )/(α3 −1)  ∂u  × |u| dx  ∂x  i G  α2  2 α3      ε α3 α0 +α1  ∂u   ∂ u   |u|  ∂x   ∂x 2  dx α3 G i i  α1 +α2 +α3    −α3 /(α3 −1) α0  ∂u  |u|  dx + Kε  ∂x i G  + Kε −α3 /(α3 −1) |u|α0 +α1 +α2 +α3 ds. (4.5.8) ∂G

Inequality (4.5.6) follows from (4.5.7) and (4.5.8) if ε > 0 is taken sufficiently large.  T HEOREM 4.5.4. Let α0 , α1 , α2 , α3 be nonnegative numbers, α4
1, α3
α1 , α0 α3 − α1 α4
0, 4i=0 αi − α4 (α3 − α1 )(α4 − 1)−1
0, and u(x) ∈ C 2 (G). Then the following inequality is valid  α1 +α2 +α3  2 α4    ∂ u α0  ∂u    |u|    ∂x 2  dx ∂xi G i  α2  2 α3 +α4      ∂u  ∂ u |u|α0 +α1  dx K   2 ∂xi ∂xi  G  4 αi    4   i=1 ∂u   + |u| i=1 αi ds + ds (4.5.9)  ∂x  i ∂G ∂G

423

4.5. Inequalities of Dubinskii and Others

for i = 1, . . . , n. The proof of inequality (4.5.9) follows from Young’s inequality with index p = (α3 + α4 )α4−1 and Theorem 4.5.3. In the following theorems, we let 

  grad u(x) = µ

µ 1/µ n    ∂    ,  ∂x u(x) i=1

µ > 0,

i

S be the set of all real-valued functions u(x) which are continuous on B = # n n i=1 [ai , bi ] (the bounded domain in R ) which satisfy u(x)|xi =ai = u(x)|xi =bi = 0 for each i ∈ {1, . . . , n}, and for which the partial derivatives ∂ ∂xi u(x) exist. The following theorem is given by Alzer in [10]. T HEOREM 4.5.5. Let λ
1 and µ > 0 be real numbers. Then we have for all u∈S       u(x)λ dx  Kn (λ, µ; a, b) grad u(x)λ dx, (4.5.10) µ B

B

where Kn (λ, µ; a, b) = I (λ)n−min(1,λ/µ)

n  (bi − ai )λ/n , i=1

in which



1

I (λ) =

t 1−λ + (1 − t)1−λ

−1

dt.

0

P ROOF. From the hypotheses, we have the following identities 

xi

u(x) =

ai

∂ u(x1 , . . . , ti , . . . , xn ) dti ∂ti

(4.5.11)

and  u(x) = −

bi

xi

∂ u(x1 , . . . , ti , . . . , xn ) dti . ∂ti

(4.5.12)

424

Chapter 4. Poincaré- and Sobolev-Type Inequalities

From (4.5.11), (4.5.12) and using Hölder’s inequality with indices λ, λ/(λ − 1), we get  λ
 xi     ∂  u(x)λ   u(x1 , . . . , ti , . . . , xn ) dti  ∂t  i ai λ  xi   ∂  λ−1    (xi − ai )  ∂t u(x1 , . . . , ti , . . . , xn ) dti , (4.5.13) i ai λ  bi    ∂    u(x1 , . . . , ti , . . . , xn ) dti . u(x)λ  (bi − xi )λ−1 (4.5.14)  ∂t  i xi From (4.5.13) and (4.5.14), we obtain for xi ∈ (ai , bi ) λ  bi     ∂     u(x1 , . . . , ti , . . . , xn ) dti . u(x)λ (xi − ai )1−λ + (bi − xi )1−λ   ∂t  i ai (4.5.15) Next, we multiply both sides of (4.5.15) by [(xi − ai )1−λ + (bi − xi )1−λ ]−1 and integrate over B. Then we have λ   bi     ∂     1−λ 1−λ −1   u(x)λ dx  (xi − ai ) + (bi − xi ) dxi  ∂x u(x) dx. i B ai B Now, by taking i = 1, . . . , n in the above inequality and multiplying the resulting inequalities and applying arithmetic mean–geometric mean inequality, we obtain    u(x)λ dx B



n
 

bi 

(xi − ai )1−λ + (bi − xi )1−λ

−1

1/n dxi

ai

i=1

λ 1/n n
    ∂    ×  ∂x u(x) dx i B i=1

λ 1/n   n  n
 bi  ∂   −1 1   dx (xi − ai )1−λ + (bi − xi )1−λ dxi u(x)   n ai B i=1 ∂xi i=1   n  1    1  λ/n 1−λ 1−λ −1 grad u(x)λ dx. t (bi − ai ) + (1 − t) dt = λ n B 0



i=1

(4.5.16)

425

4.5. Inequalities of Dubinskii and Others

Finally, we use the inequality (see [48, pp. 143 and 159]) n 

 aiα  n1−min(1,α)

i=1

n 

α ai

ai
0, i = 1, . . . , n, α > 0, (4.5.17)

,

i=1

to obtain λ (λ/µ)µ n  n       ∂  ∂   grad u(x)λ =      ∂x u(x) =  ∂x u(x) λ i=1

i



 n1−min(1,λ/µ)

i

i=1

µ λ/µ n    ∂     ∂x u(x) i=1

i

λ  = n1−min(1,λ/µ) grad u(x) ,

(4.5.18)

µ

so that (4.5.16) and (4.5.18) imply 

  u(x)λ dx 

B



 n 1  −1 λ/n t 1−λ + (1 − t)1−λ (bi − ai ) dt 0

i=1



× n−min(1,λ/µ)

  grad u(x)λ dx. µ

B



The proof is complete.

R EMARK 4.5.2. We note that inequality (4.5.10) sharpens the inequality given by Agarwal and Sheng in [6]. For further results, see [7,10] and the references given therein. In [345] Pachpatte has established the inequalities in the following theorems. T HEOREM 4.5.6. Let p
0, q
1, r
1, µ > 0 be constants and u ∈ S. Then 

  u(x)r(p+q) dx  M q B





µ

B

  u(x)r(p+q) dx  M p+q B

    u(x)rp grad u(x)rq dx,  B

  grad u(x)r(p+q) dx, µ

(4.5.19)

(4.5.20)

426

Chapter 4. Poincaré- and Sobolev-Type Inequalities

where 



M = (p + q)r n−min(1,r/µ)

  n  (bi − ai )r/n I (r) ,

(4.5.21)

i=1

in which



1

t 1−r + (1 − t)1−r

I (r) =

−1

dt.

(4.5.22)

0

P ROOF. From the hypotheses, we have the following identities  xi up+q (x) = (p + q) up+q−1 (x1 , . . . , ti , . . . , xn ) ai

×  up+q (x) = −(p + q)

bi

∂ u(x1 , . . . , ti , . . . , xn ) dti , ∂ti

(4.5.23)

up+q−1 (x1 , . . . , ti , . . . , xn )

xi

×

∂ u(x1 , . . . , ti , . . . , xn ) dti , ∂ti

(4.5.24)

for i = 1, . . . , n. From (4.5.23), (4.5.24) and using Hölder’s inequality with indices r, r/(r − 1), we observe that  xi     u(x)r(p+q)  (p + q)r (xi − ai )r−1 u(x1 , . . . , ti , . . . , xn )r(p+q−1) ai

 r  ∂   ×  u(x1 , . . . , ti , . . . , xn ) dti , ∂t i

  u(x)r(p+q)  (p + q)r (bi − xi )r−1



(4.5.25)  u(x1 , . . . , ti , . . . , xn )r(p+q−1)

bi 

xi

 r  ∂  ×  u(x1 , . . . , ti , . . . , xn ) dti , ∂ti (4.5.26)

for i = 1, . . . , n. From (4.5.25) and (4.5.26), we obtain for xi ∈ (ai , bi ) p+q   (xi − ai )1−r + (bi − xi )1−r u(x)

427

4.5. Inequalities of Dubinskii and Others

  (p + q)

r

 u(x1 , . . . , ti , . . . , xn )r(p+q−1)

bi 

ai

 r  ∂   ×  u(x1 , . . . , ti , . . . , xn ) dti . ∂t

(4.5.27)

i

Next, we multiply both sides of (4.5.27) by [(xi − ai )1−r + (bi − xi )1−r ]−1 and integrate over B. Then we have 

  u(x)r(p+q) dx  (p + q)r

B



bi 

(xi − ai )1−r + (bi − xi )1−r

−1

dxi

ai

 r     u(x)r(p+q−1)  ∂ u(x) dx.  ∂x 

 ×

(4.5.28)

i

B

Now, by taking i = 1, . . . , n in (4.5.28) and multiplying the resulting inequalities and applying the arithmetic mean–geometric mean inequality, we obtain    u(x)r(p+q) dx B

 (p + q)

r

n
  i=1

×

bi 

(xi − ai )

1−r

 1−r −1

+ (bi − xi )

1/n dxi

ai

 r 1/n n
      u(x)r(p+q−1)  ∂ u(x) dx  ∂x  i=1

i

B

1/n n
 bi    1 r 1−r 1−r −1 (xi − ai )  (p + q) + (bi − xi ) dxi n ai i=1

 r   n r(p+q−1)  ∂       u(x) ×  ∂x u(x) dx B i=1

i





n 1  −1 1 r t 1−r + (1 − t)1−r (bi − ai )r/n dt = (p + q) n 0 i=1  r(p+q−1)    grad u(x)r dx. × u(x) (4.5.29) r B

By using inequality (4.5.17), as in the proof of Theorem 4.5.5, we obtain     grad u(x)r  n1−min(1,r/µ) grad u(x)r . (4.5.30) r µ

428

Chapter 4. Poincaré- and Sobolev-Type Inequalities

From (4.5.29) and (4.5.30), we obtain    u(x)r(p+q) dx B

 (p + q)r n−min(1,r/µ)  n    r(p+q−1)    r/n grad u(x)r dx × (bi − ai ) I (r) u(x) µ B

i=1

 =M

B

       u(x)rp/q grad u(x)r u(x)r(p+q−1)−rp/q dx. (4.5.31) µ

Using Hölder’s inequality with indices q, q/(q − 1) on the right-hand side of (4.5.31) we have    u(x)r(p+q) dx B



    u(x)rp grad u(x)rq

M

µ

B

1/q 

  u(x)r(p+q) dx

(q−1)/q .

(4.5.32)

B

If B |u(x)|r(p+q) dx = 0 then (4.5.19) is trivially true; otherwise, we divide both

sides of (4.5.32) by [ B |u(x)|r(p+q) dx](q−1)/q and then raise both sides to the power q to get the required inequality in (4.5.19). By using Hölder’s inequality with indices (p + q)/p, (p + q)/q to the righthand side of (4.5.19), we get    u(x)r(p+q) dx B



 Mq

  u(x)r(p+q) dx

B

p/(p+q)  B

  grad u(x)r(p+q) dx

q/(p+q)

µ

. (4.5.33)



If B |u(x)|r(p+q) dx = 0 then (4.5.20) is trivially true; otherwise, we divide both

sides of (4.5.33) by [ B |u(x)|r(p+q) dx]p/(p+q) and then raise both sides to the power (p + q)/q to get the required inequality in (4.5.20). The proof is complete.  T HEOREM 4.5.7. Let p
0, q
1, m
0, r
1, µ > 0 be constants and u ∈ S. Then           u(x)r(p+q) grad u(x)rm dx  Lq u(x)rp grad u(x)r(q+m) dx, B

µ

B

µ

(4.5.34)

429

4.5. Inequalities of Dubinskii and Others

and 

    u(x)r(p+q) grad u(x)rm dx  Lp+q



µ

B

  grad u(x)r(p+q+m) dx, µ

B

(4.5.35) where 

 r −min(1,r/µ)

L = (p + q + m) n

n 

 (bi − ai )

r/n

 I (r) ,

(4.5.36)

i=1

in which I (r) is defined by (4.5.22). P ROOF. By rewriting the integral on the left-hand side of (4.5.34) and using Hölder’s inequality with indices (q + m)/m, (q + m)/q and inequality (4.5.19), we observe that      u(x)r(p+q) grad u(x)rm dx µ B



       u(x)r(pm/(q+m)) grad u(x)rm u(x)r(p+q)−r(pm/(q+m)) dx µ

= B



    u(x)rp grad u(x)r(q+m) dx



µ

B



  u(x)r(p+q+m) dx

×

q/(q+m)

B



    u(x)rp grad u(x)r(q+m) dx



m/(q+m)

m/(q+m)

µ

B



 r −min(1,r/µ)

×

(p + q + m) n

 q+m n  r/n (bi − ai ) I (r) i=1

 ×

µ

B

 =L

    u(x)rp grad u(x)r(q+m) dx

    u(x)rp grad u(x)r(q+m) dx.

q B

µ

The proof of inequality (4.5.34) is complete.

q/(q+m)

430

Chapter 4. Poincaré- and Sobolev-Type Inequalities

By rewriting inequality (4.5.34) and using Hölder’s inequality with indices (p + q)/p, (p + q)/q, we observe that 

    u(x)r(p+q) grad u(x)rm dx µ

B



       u(x)rp grad u(x)r(mp/(p+q)) grad u(x)r(q+m)−r(mp/(p+q)) dx

 Lq

µ

B



µ

    u(x)r(p+q) grad u(x)rm dx

 Lq

µ

B



  grad u(x)r(p+q+m) dx

×

p/(p+q)

q/(p+q) .

µ

B

Now, by following the arguments as in the last part of the proof of inequality (4.5.20) with suitable modifications, we get the required inequality in (4.5.35). The proof is complete. 

4.6 Poincaré- and Sobolev-Like Inequalities In the present section we shall deal with the Poincaré- and Sobolev-like inequalities established by Pachpatte in [276,289]. The following inequalities are established in [276]. T HEOREM # 4.6.1. Let ur , r = 1, . . . , N , be sufficiently smooth functions defined on B = ni=1 [ai , bi ], the bounded domain in Rn , which vanish on the boundary ∂B of B and let m
1, p
2 be real constants. Then   N   ur (x)2 B

2m(p−1)/p

p/(p−1)

dx

r=1

4m n  N     ∂     k1  ∂x ur (x) dx, i B r=1

i=1

(4.6.1) where 1 k1 = nN




N 4

2m α (p(4m+2nm−n)−2nm)/p ,

in which α = max{b1 − a1 , . . . , bn − an }.

431

4.6. Poincaré- and Sobolev-Like Inequalities

R EMARK 4.6.1. In the special case when m = 1, inequality (4.6.1) reduces to the following inequality   B

2(p−1)/p

p/(p−1)

N    ur (x)2

 k10

dx

r=1

4 N   n    ∂    dx, u (x) r  ∂x  r=1 B i=1

i

(4.6.2) where k10 =

N (n+4)−2n/p α . 16n

T HEOREM 4.6.2. Let ur , m, p be as in Theorem 4.6.1. Then   B

N    ur (x)2

2m(p−1)/p

p/(p−1)

dx

r=1

 2m N   n  2m  ∂      ur (x)   k2 ur (x) dx, ∂x

(4.6.3)

i

r=1 B i=1

where 1 k2 = N 2m−1 α (p(2m+2nm−n)−2nm)/p , n in which α = max{b1 − a1 , . . . , bn − an }. R EMARK 4.6.2. We note that in the special case when m = 1, inequality (4.6.3) reduces to   N   ur (x)2 B

2(p−1)/p

p/(p−1)

dx

r=1

 k20

 2 n N        ur (x)2  ∂ ur (x) dx,  ∂x  r=1 B i=1

i

where k20 =

N (n+2)−2n/p α . n

(4.6.4)

432

Chapter 4. Poincaré- and Sobolev-Type Inequalities

P ROOFS OF T HEOREMS 4.6.1 AND 4.6.2. From the hypotheses of Theorem 4.6.1, we have the following identities nur (x) =

n  

xi

i=1 ai

∂ ur (x1 , . . . , ti , . . . , xn ) dti ∂ti

(4.6.5)

∂ ur (x1 , . . . , ti , . . . , xn ) dti , ∂ti

(4.6.6)

and nur (x) = −

n  

bi

i=1 xi

for r = 1, . . . , N . From (4.6.5) and (4.6.6), we observe that n    2nur (x) 



    ∂ ur (x1 , . . . , ti , . . . , xn ) dti  ∂t 

bi 

i=1 ai

(4.6.7)

i

for r = 1, . . . , N . From (4.6.7), using inequality (4.3.5), the Schwarz inequality and the definition of α, we obtain   ur (x)2 








1 2n 1 2n

2  n 

  2   ∂ ur (x1 , . . . , ti , . . . , xn ) dti  ∂t 

bi 

i

i=1 ai

2  n  n i=1

  2   ∂ ur (x1 , . . . , ti , . . . , xn ) dti  ∂t 

bi 

ai

i

2  n    α  bi  ∂   ∂t ur (x1 , . . . , ti , . . . , xn ) dti . 4n i ai

(4.6.8)

i=1

From (4.6.8), using inequality (4.3.5) repeatedly, Hölder’s inequality with indices p, p/(p − 1) and the definition of α, we obtain 

N    ur (x)2

p/(p−1)

r=1




α 4n

×

p/(p−1) (Nn)p/(p−1)−1

 n  N   r=1

i=1

 2 p/(p−1)   ∂ ur (x1 , . . . , ti , . . . , xn ) dti  ∂t 

bi  ai

i

433

4.6. Poincaré- and Sobolev-Like Inequalities




α 4n

×

p/(p−1) (Nn)1/(p−1) α 1/(p−1)

 n  N   r=1

i=1

 2p/(p−1)    ∂ ur (x1 , . . . , ti , . . . , xn ) dti .  ∂t 

bi 

(4.6.9)

i

ai

Integrating both sides of (4.6.9) over B and using the definition of α we have p/(p−1)   N   ur (x)2 dx B

r=1






α 4n

p/(p−1) 1/(p−1)

(N nα)

 n   2p/(p−1)  N    ∂    α u (x) dx .  ∂x r  i B r=1

i=1

(4.6.10) From (4.6.10), using inequality (4.3.5) repeatedly, Hölder’s inequality with indices 2m(p − 1)/p, 2m(p − 1)/(2m(p − 1) − p) and the definition of α, we obtain 2m(p−1)/p   N p/(p−1)  2 ur (x) dx B

r=1

 2m(p−1)/p α p/(p−1) 1/(p−1)  (Nnα) α 4n  N  n   2p/(p−1)  2m(p−1)/p    ∂    × dx  ∂x ur (x) 





r=1

α 4n

i=1

B

i

p/(p−1)

2m(p−1)/p 1/(p−1)

(Nnα)

α

(N n)2m(p−1)/p−1

 n   2p/(p−1) 2m(p−1)/p N    ∂    × dx  ∂x ur (x) i B r=1 i=1 
p/(p−1) 2m(p−1)/p α  (Nnα)1/(p−1) α (N n)2m(p−1)/p−1 4n  n   4m N   ∂   n (2m(p−1)−p)/p    × α u (x)  ∂x r  dx i B r=1 i=1 4m n  N     ∂    = k1 (4.6.11)  ∂x ur (x) dx. i B r=1

i=1

434

Chapter 4. Poincaré- and Sobolev-Type Inequalities

The proof of Theorem 4.6.1 is complete. From the assumptions on the functions ur (x) in Theorem 4.6.2, we have the following identities nu2r (x)

=2

n  

xi

ur (x1 , . . . , ti , . . . , xn )

i=1 ai

∂ ur (x1 , . . . , ti , . . . , xn ) dti , ∂ti (4.6.12)

n  bi 

nu2r (x) = −2

ur (x1 , . . . , ti , . . . , xn )

i=1 xi

∂ ur (x1 , . . . , ti , . . . , xn ) dti , ∂ti (4.6.13)

for r = 1, . . . , N . From (4.6.12) and (4.6.13), we observe that   n  bi  2   ∂        n ur (x)  ur (x1 , . . . , ti , . . . , xn )  ur (x1 , . . . , ti , . . . , xn ) dti . ∂ti ai i=1

(4.6.14) From (4.6.14), using inequality (4.3.5) repeatedly, Hölder’s inequality with indices p, p/(p − 1) and the definition of α, we obtain as in (4.6.9) N p/(p−1)   ur (x)2 r=1


p/(p−1) 1  (N nα)1/(p−1) n  n  N bi     ur (x1 , . . . , ti , . . . , xn ) × r=1

i=1

ai

  p/(p−1)   ∂  ×  ur (x1 , . . . , ti , . . . , xn ) dti . ∂t

(4.6.15)

i

Integrating both sides of (4.6.15) over B and using the definition of α, we have p/(p−1)   N   ur (x)2 dx B

r=1


p/(p−1) 1  (N nα)1/(p−1) α n

435

4.6. Poincaré- and Sobolev-Like Inequalities

 n    p/(p−1)  N      ur (x) ∂ ur (x) dx . ×  ∂x  r=1

(4.6.16)

i

B

i=1

From (4.6.16), using inequality (4.3.5) repeatedly, Hölder’s inequality with indices 2m(p − 1)/p, 2m(p − 1)/(2m(p − 1) − p) and the definition of α and following the same steps as in the proof of inequality (4.6.11) we get the required inequality in (4.6.3). The proof of Theorem 4.6.2 is complete.  In our further discussion, we make use of the following fundamental result. In what follows, an open, simply connected, bounded set B of points in Rn is said to be a normal domain if B admits the application of the following Gauss integral theorem (see [149, p. 49]). = B + ∂B (union of B and ∂B) On the set of boundary points x ∈ ∂B with B there is a real-valued vector field  n 1/2    2 z(x) = z1 (x), . . . , zn (x) with |z| = zi (x) =1 i=1

such that, for all complex-valued w(x) = w(x1 , . . . , xn ) ∈ C 1 (B),   ∂ w(x) dx = w(x)zi (x) ds, i = 1, . . . , n, B ∂xi ∂B

(4.6.17)

where dx = dx1 · · · dxn is the volume element and ds the surface element corresponding to ∂B. The following inequalities are also established in [276]. = T HEOREM 4.6.3. Let B be a normal domain in Rn with boundary ∂B and B B + ∂B. Let m
1, p
2 be real constants and ur , r = 1, . . . , N , be real-valued 2 p/(p−1) ∈ C 1 (B). Then functions such that ur , { N r=1 |ur | }   B

N    ur (x)2 r=1





 k3 ∂B

2m(p−1)/p

p/(p−1)

dx

N    ur (x)2

2m(p−1)/p

p/(p−1)

ds

r=1

 2m n N    2m  ∂      ur (x)  + ur (x) dx , ∂x r=1 B i=1

i

(4.6.18)

436 where

Chapter 4. Poincaré- and Sobolev-Type Inequalities

 k3 = max 22m(p−1)/p−1 (2δ)2m(p−1)/p ,


2m(p−1)/p


n(p − 1) 2 4δ   (2m(p−1)−p)/p × D(B) (N n)2m−1 , 2m(p−1)/p−1

4δ n

−2m/δ

in which δ = max{|x1 |, . . . , |xn |} and D(B) is the n-dimensional measure of B. T HEOREM 4.6.4. Let B be a normal domain in Rn with sufficiently smooth i = 1, . . . , n, be aux = B + ∂B. Let αi (x) ∈ C 1 (B), boundary ∂B and B iliary functions such that αi (x) = zi (x) for x ∈ ∂B. Let m
1, p
2 be real ur , r = 1, . . . , N , be real-valued functions such that ur , constants2 and p/(p−1) ∈ C 1 (B). Then |u (x)| } { N r r=1 



∂B

N    ur (x)2

2m(p−1)/p

p/(p−1)

ds

r=1

   k4 B

N    ur (x)2

2m(p−1)/p

p/(p−1)

dx

r=1

 2m n N    2m  ∂      ur (x)  + ur (x) dx , ∂x r=1 B i=1

(4.6.19)

i

where
  2c1 cp 2m(p−1)/p , k4 = max 22m(p−1)/p−1 c0 + p−1  2m(p−1)/p 22m(p−1)/p 2c1 c−p/(p−1)   (2m(p−1)−p)/p × D(B) (N n)2m−1 , in which D(B) is as in Theorem 4.6.3, c > 0 is an arbitrary constant and  n   ∂  $  %   c1 = sup sup αi (x) . c0 = sup  αi (x),  ∂xi x∈B  i=1,...,n x∈B i=1

437

4.6. Poincaré- and Sobolev-Like Inequalities

ROOFS OF T HEOREMS 4.6.3 AND 4.6.4. If we set w(x) = xi × P 2 p/(p−1) in Gauss integral formula (4.6.17), then we have { N r=1 |ur (x)| } N p/(p−1) p/(p−1)    N   2   ur (x)2  ur (x) dx = xi zi (x) ds B

∂B

r=1

r=1




 −

xi B

×

p p−1

N  r=1

 N

  ur (x)2

p/(p−1)−1

r=1

  ∂ 2ur (x) ur (x) sign ur (x) dx ∂xi (4.6.20)

for i = 1, . . . , n. From (4.6.20) we observe that p/(p−1)   N   ur (x)2 n dx B

r=1



 = ∂B

n 

 xi

i=1

N    ur (x)2

p/(p−1)

zi (x) ds

r=1

2p p−1 N   n   ur (x)2 × xi −

B

i=1

1/(p−1) N 

r=1

r=1

  ur (x) ∂ ur (x) sign ur (x) dx. ∂xi (4.6.21)

From (4.6.21), the definition of δ and the fact that |zi (x)|  1 for i = 1, . . . , n, we obtain p/(p−1)   N 2    ur (x) n dx B

r=1

  nδ ∂B



N    ur (x)2 r=1

2pδ + p−1

p/(p−1)

  N   ur (x)2 B

r=1

ds 1/(p−1) N   r=1

 n   ∂      ur (x) u (x)  ∂x r  dx. i=1

i

(4.6.22)

438

Chapter 4. Poincaré- and Sobolev-Type Inequalities

From (4.5.22) and using the following version of Young’s inequality 
1 p p p − 1 −p/(p−1) p/(p−1) ε d1 d2  ε d1 + d2 , p p

(4.6.23)

where d1 , d2
0, p
2, ε > 0, and setting ε = {n(p − 1)/(4δ)}1/p , we observe that p/(p−1)   N   ur (x)2 dx n B

r=1



  nδ ∂B

N    ur (x)2

p/(p−1)

ds

r=1

2pδ + p−1

 N  
2 1 n(p − 1)  ur (x) 4δ B p


p/(p−1)

r=1




 p−1 n(p − 1) −1/(p−1) + p 4δ  N   n      ∂      ur (x) ×  ∂x ur (x) i r=1

p/(p−1) 

dx.

(4.6.24)

i=1

From (4.6.24) we observe that p/(p−1)   N   ur (x)2 dx B

r=1

  2δ ∂B



N    ur (x)2

p/(p−1)

ds

r=1

 
   N n   ∂    4δ n(p − 1) −1/(p−1)   ur (x) u (x) + r   n 4δ ∂xi B r=1

p/(p−1)

dx.

i=1

(4.6.25) From (4.6.25) and using the following inequality repeatedly,  n k n   ai  Mk,n aik , i=1

i=1

(4.6.26)

439

4.6. Poincaré- and Sobolev-Like Inequalities

where ai are nonnegative reals and Mk,n = nk−1 , k
1, Mk,n = 1, 0  k  1, Hölder’s inequality with indices 2m(p − 1)/p, 2m(p − 1)/(2m(p − 1) − p), we observe that   B

2m(p−1)/p

p/(p−1)

N    ur (x)2

dx

r=1

 22m(p−1)/p−1 





× (2δ)

2m(p−1)/p ∂B

N    ur (x)2

2m(p−1)/p

p/(p−1)

ds

r=1


 4δ n(p − 1) −1/(p−1) 2m(p−1)/p + n 4δ   N   p/(p−1) 2m(p−1)/p n     ∂       ur (x) × dx  ∂x ur (x) i B 

r=1

2

2m(p−1)/p−1

i=1



2m(p−1)/p

(2δ)

N   ur (x)2

∂B

 + 22m(p−1)/p−1  ×

2m(p−1)/p

p/(p−1)

ds

r=1


 4δ n(p − 1) −1/(p−1) 2m(p−1)/p n 4δ

(2m(p−1)−p)/(2m(p−1)) 1 dx

B

  × B

  N n    ∂      ur (x) u (x)  ∂x r  r=1

dx

i

i=1



 22m(p−1)/p−1 (2δ)2m(p−1)/p ∂B



p/(2m(p−1)) 2m(p−1)/p

2m

N   ur (x)2

2m(p−1)/p

p/(p−1)

ds

r=1


 4δ n(p − 1) −1/(p−1) 2m(p−1)/p +2 n 4δ  2m N   n  2m  ∂    (2m(p−1)−p)/p 2m−1    ur (x)  × D(B) (Nn) ur (x) dx. ∂x i B 2m(p−1)/p−1

r=1

i=1

(4.6.27)

440

Chapter 4. Poincaré- and Sobolev-Type Inequalities

From (4.6.27) and the definition of k3 , the desired inequality in (4.6.18) follows. The proof of Theorem 4.6.3 is complete. From the hypotheses of Theorem 4.6.4, since B has sufficiently smooth boundary, we have auxiliary functions αi (x) = zi (x) for x ∈ ∂B (see [149, p. 69]). Then, by making use of formula (4.6.17), we have 

 ∂B

N    ur (x)2

p/(p−1)

ds

r=1



 = ∂B



 = ∂B

n 

 zi2 (x)

i=1 n 

 αi (x)

i=1

p/(p−1)

N    ur (x)2

ds

r=1 N    ur (x)2

p/(p−1)

zi (x) ds

r=1

N  n p/(p−1)  2 ∂    ur (x) αi (x) = dx B ∂xi i=1 r=1 N p/(p−1)   n   ∂ ur (x)2 αi (x) dx = B i=1 ∂xi r=1 N 1/(p−1)   n  2 2p   ur (x) αi (x) + p−1 B 

i=1 n 

×

r=1

r=1

  ur (x) ∂ ur (x) sign ur (x) dx. ∂xi

(4.6.28)

From (4.6.28) and using the definitions of c0 , c1 , and Young’s inequality (4.6.23) with ε = c, we observe that 

 ∂B

N    ur (x)2

p/(p−1)

ds

r=1

  N   ur (x)2  c0 B

r=1

2pc1 + p−1

p/(p−1)

  N   ur (x)2 B

r=1

dx 1/(p−1) N   r=1

 n   ∂      ur (x)  ∂x ur (x) dx i=1

i

441

4.6. Poincaré- and Sobolev-Like Inequalities

  N   ur (x)2  c0 B

r=1

2pc1 + p−1

  B

p/(p−1)

dx

N p/(p−1) 2 1 p   ur (x) c p r=1 
p − 1 −p/(p−1) c + p N   n     ∂     ur (x) × u (x)  ∂x r  i r=1

   N   2c1 cp ur (x)2 = c0 + p−1 B

p/(p−1) 

dx

i=1




p/(p−1)

dx

r=1

    N n   ∂    −p/(p−1)     ur (x) + 2c1 c  ∂x ur (x) B

r=1

i=1

p/(p−1)

dx. (4.6.29)

i

From (4.6.29), using inequality (4.6.26) repeatedly, Hölder’s inequality with indices 2m(p − 1)/p, 2m(p − 1)/(2m(p − 1) − p) and following the same steps as in the proof of inequality (4.6.27) with suitable changes, we get the desired inequality in (4.6.19). The proof of Theorem 4.6.4 is complete.  The inequalities in the following theorems are established by Pachpatte in [289]. = T HEOREM 4.6.5. Let B be a normal domain in Rn with boundary ∂B and B Then B + ∂B. Let ur , r = 1, . . . , m, be real-valued functions belonging to C 1 (B). 1/m   m        m m  2  2 2   grad ur (x) u (x) dx  µ u (x) ds + dx , B

r

∂B

r=1

r

B

r=1

r=1

(4.6.30) 2

2δ where µ = max{ 4δ mn , m }, δ = max{|x1 |, . . . , |xn |}.

R EMARK 4.6.3. In the special case when m = 1 and u1 (x) = u(x), inequality (4.6.30) reduces to the following inequality 

   2 2 2   u (x) dx  µ1 u (x) ds + (4.6.31) grad u(x) dx , B

∂B

B

442

Chapter 4. Poincaré- and Sobolev-Type Inequalities

where µ1 is the constant defined by µ when m = 1. An inequality closely related to (4.6.31) in which the multiplicative constant on the right-hand side is different was first used by Friedrichs (see [392, p. 242]) to study the problem of boundedness from below of a differential operator and is now known in the literature as Friedrich’s second inequality. T HEOREM 4.6.6. Let B be a normal domain in Rn with sufficiently smooth = B + ∂B. Let αi (x) ∈ C 1 (B), i = 1, . . . , n, be auxiliary boundary ∂B and B functions such that αi (x) = zi (x) for x ∈ ∂B. Let ur , r = 1, . . . , m, be real-valued Then functions belonging to C 1 (B). 

 ∂B

m 

1/m u2r (x)

ds

r=1

  λ B

where λ = max{c0 c +

m 

 u2r (x)

    m 2  grad ur (x) dx , dx + B

r=1 c1 cc1 n mc , m },

(4.6.32)

r=1

c > 0 is arbitrary constant and

 n   ∂    c0 = sup  αi (x),  ∂xi x∈B 

c1 = sup

$

%  sup αi (x) .

i=1,...,n x∈B

i=1

R EMARK 4.6.4. We note that in the special case when m = 1 and u1 (x) = u(x), inequality (4.6.32) reduces to 

 u (x) ds  λ1 2

∂B



2   u2 (x) + grad u(x) dx,

(4.6.33)

B

where λ1 is the constant defined by λ when m = 1. The inequalities of the forms (4.6.33) are established by many authors by using Trace theorem in interpolation spaces (see, e.g., [154]). For different forms, see [149,208,392] and the references given therein. P ROOFS OF T HEOREMS 4.6.5 AND 4.6.6. If we set u(x) = xi u2r (x) in Gauss integral formula (4.6.17), then we have 

 B

u2r (x) dx

= ∂B

 xi u2r (x)zi (x) ds

−

2xi ur (x) B

∂ ur (x) dx ∂xi

(4.6.34)

443

4.6. Poincaré- and Sobolev-Like Inequalities

for i = 1, . . . , n and r = 1, . . . , m. From (4.6.34) we observe that  n u2r (x) dx B





= ∂B

n 

 ds −

xi u2r (x)zi (x)

  n B

i=1

i=1

 ∂ 2xi ur (x) ur (x) dx. ∂xi

(4.6.35)

Using the elementary inequality 1 |2ab|  ca 2 + b2 , c

(4.6.36)

1 where a, b, c are arbitrary real numbers and c > 0. Setting c = 2δ , we observe that         −2xi ur (x) ∂ ur (x)  δ 2ur (x) ∂ ur (x)     ∂xi ∂xi  2 1 2 ∂ δ u (x) + 2δ ur (x) 2δ r ∂xi  2 ∂ 1 ur (x) . (4.6.37) = u2r (x) + 2δ 2 2 ∂xi

From (4.6.35), (4.6.37), the definition of δ and the fact that |zi (x)|  1 for i = 1, . . . , n, we obtain  n u2r (x) dx B



 δn ∂B

u2r (x) ds

1 + n 2

 B

u2r (x) dx

2    n  ∂ + 2δ ur (x) dx. ∂xi B 2

i=1

(4.6.38) From (4.6.38) we obtain the inequality    2 4δ 2  grad ur (x) dx u2r (x) dx  2δ u2r (x) ds + n B B ∂B for r = 1, . . . , m. From (4.6.39) and the elementary inequality  m 1/m m  1 ar  ar , ar
0, m r=1

r=1

(4.6.39)

(4.6.40)

444

Chapter 4. Poincaré- and Sobolev-Type Inequalities

we observe that   m B

1/m u2r (x)

r=1

   m 1 dx  u2r (x) dx m B r=1   m      m  2  2 grad ur (x) dx . µ ur (x) ds + ∂B

B

r=1

r=1

The proof of Theorem 4.6.5 is complete. From the hypotheses of Theorem 4.6.6, since B has a sufficiently smooth and αi (x) = boundary, we choose auxiliary functions αi (x) so that αi (x) ∈ C 1 (B) zi (x) for x ∈ ∂B (see [149, p. 69]), we have  ∂B

u2r (x) ds 



= ∂B

 = ∂B



n  i=1 n 

 zi2 (x)u2r (x)

ds 

αi (x)u2r (x)zi (x) ds

i=1

    n n ∂ ∂ 2 αi (x) ur (x) dx + 2αi (x)ur (x) ur (x) dx. = ∂xi ∂xi B B i=1

i=1

(4.6.41) Here, a suitable version of the Gauss integral formula (4.6.17) has been used to get the last equality in (4.6.41). Using (4.6.36), Schwarz inequality for sums and the definition of c1 we observe that  n   n     ∂    ∂      2αi (x)ur (x) ur (x)  2c1 ur (x) ur (x)     ∂xi ∂xi i=1

i=1

 1 2 + ur (x) c i i=1   2 n   ∂ 1 2  c1 cn ur (x) + ur (x) . ∂xi c

  n    ∂     c1 c  ∂x ur (x)

i=1

2

(4.6.42)

445

4.7. Some Extensions of Rellich’s Inequality

From (4.6.41), (4.6.42) and using the definition of c0 , we obtain 
  2  c0 c + c1 u2r (x) ds  u2r (x) dx + cc1 n grad ur (x) dx. (4.6.43) c ∂B B B From (4.6.40) and (4.6.43), we observe that  ∂B



m 

1/m u2r (x)

r=1

   m 1 2 ds  ur (x) ds m ∂B r=1   m      m    2 grad ur (x) dx . λ u2r (x) dx + B

B

r=1

r=1

(4.6.44) This inequality is the desired inequality in (4.6.32) and the proof of Theorem 4.6.6 is complete.  For various other inequalities similar to that of Poincaré and Sobolev, see [56,98,127,154,193,264] and the references given therein.

4.7 Some Extensions of Rellich’s Inequality In his fundamental work on perturbations theory of eigenvalue problems F. Rellich [396] established the following inequality: 

n2 (n − 4)2 |u| dx
16 Rn



2

Rn

|x|−4 |u|2 dx,

n = 2,

(R)

where u(x) is a function in C0∞ (Rn \{0}) which is not identically zero, C0∞ denote the vector space of infinitely differentiable functions with compact support (see 2 [3, p. 9]) and  = ni=1 ∂ 2 . ∂xi

In this section we deal with extensions of inequality (R) established by Pachpatte in [286,288]. In what follows, we assume that H is an open, connected subset of Rn that is not necessarily bounded and that the boundary ∂H of H is sufficiently smooth in order that the Green formulas applies. Let ∇ = ( ∂x∂ 1 , . . . , ∂x∂ n ) 2 and  = ni=1 ∂ 2 . A point in Rn is denoted by x = (x1 , . . . , xn ) and its norm ∂xi is given by |x| = ( ni=1 |xi |2 )1/2 . For any nonnegative integer m, we denote by C m (H ) the vector space consisting of all functions φ which, together with all their partial derivatives D α φ of order |α|  m, are continuous on H and denote

446

Chapter 4. Poincaré- and Sobolev-Type Inequalities

by C0∞ (H ) the vector space of infinitely differentiable functions with compact support (see [3, p. 9]). We begin with the following useful inequalities established in [286]. T HEOREM 4.7.1. Let p
0, q
1 be constants, g ∈ C 2 (H ), g = 0 in H and u ∈ C0∞ (H ) be a real-valued function. Then 



|g|−(q−1) |∇g|q |u|p |∇u|q dx.

|g||u|p+q dx  (p + q)q H

(4.7.1)

H

T HEOREM 4.7.2. Let p, q, g, u be as in Theorem 4.7.1. Then  |g||u|p+q dx H



|g|−(p+q−1) |∇g|p+q |∇u|p+q dx.

 (p + q)

p+q

(4.7.2)

H

R EMARK 4.7.1. If we take g = |x|α+2 , α
0 is a real constant, and hence |∇g|2 = (α + 2)2 |x|2α+2 and g = (α + n)(α + 2)|x|α in (4.7.2), then we get the following Hardy-type inequality (see [27, p. 303])


 |x|α |u|p+q dx  H

p+q α+n

p+q  |x|p+q+α |∇u|p+q dx.

(4.7.3)

H

The Rellich-type inequalities established in [286] are given in the following theorems. T HEOREM 4.7.3. If p, q, g, u be as in Theorem 4.7.1, then for any constants δ
0, ε > 0,  |g|−(q−1) |g|q |u|p |u|q dx H




−ε q−1 q(p + q − 1) sgn(g)

g|u|p+q−2 |∇u|2 dx H

 qδ |g|−(q−1) |∇g|q |u|p |∇u|q dx p+q H

 q qδ − (q − 1)ε + |g||u|p+q dx. + ε q−1 p+q (p + q)q+1 H

− ε q−1

(4.7.4)

447

4.7. Some Extensions of Rellich’s Inequality

T HEOREM 4.7.4. If p, q, g, u, δ, ε be as in Theorem 4.7.3, then  |g|−(p+q−1) |g|p+q |u|p+q dx H




−ε (p+q−1) (p + q)(p + q − 1) sgn(g)  −ε

(p+q−1)

g|u|p+q−2 |∇u|2 dx H

|g|−(p+q−1) |∇g|p+q |∇u|p+q dx

δ H

+ ε (p+q−1) 1 − (p + q − 1)ε +

δ (p + q)p+q

 |g||u|p+q dx.

(4.7.5)

H

R EMARK 4.7.2. We note that in the special cases when p = 0, q = 2 and using the definition sgn(g) = g/|g|, inequalities (4.7.4) and (4.7.5) reduce to the following inequality  |g|−1 |g|2 |u|2 dx H

   δ 2 −1 2 2gg + δ|∇g| |g| |∇u| dx + ε 1 − ε +
−ε |g||u|2 dx, 4 H H (4.7.6) 

which is established by Bannett in [21, Theorem 5]. By taking p = 0 and q = 4 in (4.7.4) and p = 2, q = 2 in (4.7.5), we get the inequalities of the Rellich type. Furthermore, by specializing the conditions on p, q and the function g in (4.7.4) and (4.7.5) we get different inequalities of some interest in their own right. T HEOREMS 4.7.1 AND 4.7.2. By applying Green’s first formula to

P ROOFS OF p+q dx, we have g|u| H     (4.7.7) g|u|p+q dx = − ∇g∇ |u|p+q dx. H

H

From (4.7.7) and using the definition, sgn(g) = g/|g|, the fact that ∇(|u|p+q ) = (p + q)|u|p+q−1 ∇u sgn u, and applying Hölder’s inequality with indices q, q/(q − 1), we observe that  |g||u|p+q dx H



  ∇g∇ |u|p+q dx

= − sgn(g) H

448

Chapter 4. Poincaré- and Sobolev-Type Inequalities

 = −(p + q) sgn(g)

∇g|u|p+q−1 ∇u sgn u dx H



|∇g||u|p+q−1 |∇u| dx

 (p + q) H



   |g|−(q−1)/q |∇g||u|p/q |∇u| |g|(q−1)/q |u|p+q−1−p/q dx

= (p + q) H

1/q (q−1)/q  −(q−1) q p q p+q |g| |∇g| |u| |∇u| dx |g||u| dx .  (p + q) H

H

(4.7.8)

If H |g||u|p+q dx = 0 then (4.7.1) is trivially true; otherwise, we divide both

sides of (4.7.8) by { H |g||u|p+q dx}(q−1)/q and then raise both sides of the resulting inequality to the power q, to get inequality (4.7.1). The proof of Theorem 4.7.1 is complete. From the hypotheses of Theorem 4.7.2 and by following the proof of Theorem 4.7.1, we have   |g||u|p+q dx  (p + q) |∇g||u|p+q−1 |∇u| dx H

H

 = (p + q)

H

  |g|−(p+q−1)/(p+q) |∇g||∇u|   × |g|(p+q−1)/(p+q) |u|p+q−1 dx.

(4.7.9)

Now, using Hölder’s inequality with indices p + q, (p + q)/(p + q − 1) on the right-hand side of (4.7.9) and following exactly the same arguments as in the last part of the proof of Theorem 4.7.1 given above with suitable changes, we get the desired inequality in (4.7.2). The proof of Theorem 4.7.2 is complete.  R EMARK 4.7.3. If we take g, |∇g|2 and g as in Remark 4.7.1, in inequality (4.7.9), then we get  |x|α |u|p+q dx H





=

p+q α+n p+q α+n

 |x|α+1 |u|p+q−1 |∇u| dx H



 (α+1)/(p+q)   |x| |∇u| |x|−(α+1)/(p+q) |x|α+1 |u|p+q−1 dx. H

(4.7.10)

4.7. Some Extensions of Rellich’s Inequality

449

Using Hölder’s inequality with indices p + q, (p + q)/(p + q − 1) on the righthand side of (4.7.10) we get the following Weyl-type inequality (see [27, p. 303]) 
1/(p+q)  p+q |x|α |u|p+q dx  |x|α+1 |∇u|p+q dx α+n H H  (p+q−1)/(p+q) α+1 p+q × |x| |u| dx . (4.7.11) H

For a version of Weyl’s inequality in one independent variable, see [25]. P ROOFS OF T HEOREMS 4.7.3 AND 4.7.4. Let A, B, C, D denote integrals (without the exterior constants) in (4.7.4) successively. Applying Green’s second formula to H g|u|p+q dx we have     (4.7.12) g|u|p+q dx = g |u|p+q dx. H

H

Using the definition, sgn(g) = g/|g| in (4.7.12), we observe that    D = sgn(g) g |u|p+q dx.

(4.7.13)

H

Using the fact that    |u|p+q = (p + q)|u|p+q−1 u sgn u + (p + q)(p + q − 1)|u|p+q−2 |∇u|2 (4.7.14) in (4.7.13) we have  D = sgn(g)(p + q)

g|u|p+q−1 u sgn u dx H

 g|u|p+q−2 |∇u|2 dx

+ sgn(g)(p + q)(p + q − 1) 

H

|g||u|p+q−1 |u| dx + (p + q)(p + q − 1) sgn(g)B

 (p + q) H

 = (p + q)

   |g|−(q−1)/q |g||u|p/q |u| |g|−(q−1)/q |u|p+q−1−p/q dx

H

+ (p + q)(p + q − 1) sgn(g)B.

(4.7.15)

Now, first applying Hölder’s inequality with indices q, q/(q −1) on the right-hand side of (4.7.15) and then using Young’s inequality with indices q, q/(q − 1), we

450

Chapter 4. Poincaré- and Sobolev-Type Inequalities

see that 1/q  (q−1)/q  −(q−1) q p q p+q |g| |g| |u| |u| dx |g||u| dx D  (p + q) H

H

+ (p + q)(p + q − 1) sgn(g)B = (p + q)A1/q D (q−1)/q + (p + q)(p + q − 1) sgn(g)B    = (p + q) ε −(q−1)/q A1/q ε (q−1)/q D (q−1)/q + (p + q)(p + q − 1) sgn(g)B
 p + q −(q−1) (p + q)(q − 1)  ε εD A+ q q + (p + q)(p + q − 1) sgn(g)B

(4.7.16)

for ε > 0. Now, for any δ
0, from (4.7.1) we observe that δC −

δ D
0. (p + q)q

Combining this fact with (4.7.16) we have
D

 (p + q