Integral and finite difference inequalities and applications

INTEGRAL AND FINITE DIFFERENCE INEQUALITIES AND APPLICATIONS NORTH-HOLLAND MATHEMATICS STUDIES 205 (Continuation of t...

Author: B. G. Pachpatte

25 downloads 709 Views 1MB Size Report

This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
Report copyright / DMCA form

DOWNLOAD

INTEGRAL AND FINITE DIFFERENCE INEQUALITIES AND APPLICATIONS

NORTH-HOLLAND MATHEMATICS STUDIES 205 (Continuation of the Notas de Matemática)

Editor: Jan van Mill Faculteit der Exacte Wetenschappen Amsterdam, The Netherlands

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

INTEGRAL AND FINITE DIFFERENCE INEQUALITIES AND APPLICATIONS

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

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

Elsevier Radarweg 29, PO Box 211, 1000 AE Amsterdam, The Netherlands The Boulevard, Langford Lane, Kidlington, Oxford OX5 1GB, UK

First edition 2006 Copyright © 2006 Elsevier B.V. All rights reserved No part of this publication may be reproduced, stored in a retrieval system or transmitted in any form or by any means electronic, mechanical, photocopying, recording or otherwise without the prior written permission of the publisher Permissions may be sought directly from Elsevier’s Science & Technology Rights Department in Oxford, UK: phone (+44) (0) 1865 843830; fax (+44) (0) 1865 853333; email: [email protected]. Alternatively you can submit your request online by visiting the Elsevier web site at http://elsevier.com/locate/permissions, and selecting Obtaining permission to use Elsevier material 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 Library of Congress Cataloging-in-Publication Data A catalog record for this book is available from the Library of Congress British Library Cataloguing in Publication Data A catalogue record for this book is available from the British Library ISBN-13: 978-0-444-52762-2 ISBN-10: 0-444-52762-1 ISSN (Series): 0304-0208 For information on all Elsevier publications visit our website at books.elsevier.com

Printed and bound in The Netherlands

To the memory of my mother

This page intentionally left blank

Preface Inequalities have proven to be one of the most important and far-reaching tools for the development of many branches of mathematics. There are many types of inequalities of importance. Integral and finite difference inequalities with explicit estimates are powerful mathematical appartus which aid the study of the qualitative behavior of solutions of various types of differential, integral and finite difference equations. Because of its usefulness and importance, such inequalities have attracted much attention and a great number of papers, surveys and monographs have appeared in the literature. The extensive surveys of such inequalities which are adequate in many applications may be found in the monographs [34] and [42] up to the years of their publications. Inequalities with explicit estimates are particularly fascinating and have numerous applications. The variety of nonlinear problems is evergrowing, and new methods have to be found to study them. By the desire to widen the scope of such inequalities, recently many papers have appeared which deal with the large number of inequalities applicable in situations in which the earlier inequalities do not apply directly. I believe that these inequalities will strongly influence further research into the topic for a long time to come. The present monograph is an attempt to present some of the more recent developments related to integral and finite difference inequalities with explicit estimates. The literature in this field is extensive and as yet scattered in the original papers in the journals. The rapid development of this area and the variety of applications force us to be quite selective. We only concentrate on recent advances not covered in the earlier monographs [34] and [42] by the author. Our choices reflect our interests and what we know, as well as those results we consider potentially applicable in a wider range of applications. We do not claim to include all the recent results about such inequalities, but at least to cover those results that have a considerable variety of applications. This monograph will be of interest to mathematicians whose work involves differential, integral and finite difference equations and numerical analysis. For researchers working in these areas, it will be a valuable source of reference and inspiration. All the material included is presented in an elementary way and the book can be used as a text for advanced graduate cources. It will also be of interest to researchers in mathematical analysis, statistics, computer science and other areas of applied science and engineering. It is my pleasure to acknowledge the fine cooperation and assistance provided by Jan van Mill, Arjen Sevenster, (Mrs.) Andy Deelen and the editorial and vii

viii

Preface

production staff of Elsevier Science. Finally, I wish to express my greatful appreciation to my family members for their understanding, patience and constant encourgement during the writing of the book. B.G. Pachpatte

Contents Preface. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 Chapter 1. Integral inequalities in one variable . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 1.1. 1.2. 1.3. 1.4. 1.5. 1.6.

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 Basic nonlinear integral inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 More nonlinear integral inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19 Inequalities with iterated integrals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29 Bounds on certain integral inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 1.6.1. Nonlinear integral and differential equations . . . . . . . . . . . . . . . . . . . 53 1.6.2. Iterated Volterra integral equation . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 1.6.3. General Volterra-Fredholm integral equation . . . . . . . . . . . . . . . . . . 57 1.6.4. Terminal value problem . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58 1.7. Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61 Chapter 2. Integral inequalities in two variables . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 2.1. 2.2. 2.3. 2.4. 2.5. 2.6.

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 Some nonlinear integral inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 63 Further nonlinear integral inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73 Inequalities involving iterated integrals. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 84 Estimates on some integral inequalities. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 95 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115 2.6.1. Nonlinear partial differential equation . . . . . . . . . . . . . . . . . . . . . . . 115 2.6.2. Hyperbolic partial differential equations with terminal values . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117 2.6.3. Non-self-adjoint hyperbolic partial Fredholm integrodifferential equation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119 2.6.4. Volterra-Fredholm integral equation . . . . . . . . . . . . . . . . . . . . . . . . 123 2.7. Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 125 Chapter 3. Retarded integral inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 3.1. 3.2. 3.3. 3.4. 3.5. 3.6.

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 127 Basic retarded integral inequalities in one variable . . . . . . . . . . . . . . . . . . . 127 Further retarded integral inequalities in one variable . . . . . . . . . . . . . . . . . 142 Retarded integral inequalities in two variables . . . . . . . . . . . . . . . . . . . . . . 155 More retarded integral inequalities in two variables . . . . . . . . . . . . . . . . . . 167 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 180 ix

x

Contents 3.6.1. 3.6.2. 3.6.3. 3.6.4.

Differential equations with many retarded arguments . . . . . . . . . . . 181 Retarded differential and integrodifferential equations . . . . . . . . . . 183 Retarded partial differential equations in two variables. . . . . . . . . . 187 Retarded Volterra-Fredholm integral equation in two variables. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191 3.7. Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 196 Chapter 4. Finite difference inequalities in one variable . . . . . . . . . . . . . . . . . . . . 197 4.1. 4.2. 4.3. 4.4. 4.5. 4.6.

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 197 Fundamental finite difference inequalities. . . . . . . . . . . . . . . . . . . . . . . . . . 197 Some more finite difference inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . 205 Finite difference inequalities with iterated sums . . . . . . . . . . . . . . . . . . . . . 214 Bounds on certain finite difference inequalities . . . . . . . . . . . . . . . . . . . . . 224 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 234 4.6.1. Perturbed difference equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 234 4.6.2. Volterra type difference equations involving iterated sums. . . . . . . 236 4.6.3. Volterra-Fredholm type sum-difference equations . . . . . . . . . . . . . 237 4.6.4. Fredholm type sum-difference equations . . . . . . . . . . . . . . . . . . . . . 238 4.7. Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 241 Chapter 5. Finite difference inequalities in two variables . . . . . . . . . . . . . . . . . . . 243 5.1. 5.2. 5.3. 5.4. 5.5. 5.6.

Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 243 Some basic finite difference inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . 243 Further finite difference inequalities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 255 Estimates on certain finite difference inequalities I. . . . . . . . . . . . . . . . . . . 266 Estimates on certain finite difference inequalities II . . . . . . . . . . . . . . . . . . 286 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 294 5.6.1. Partial finite difference equations. . . . . . . . . . . . . . . . . . . . . . . . . . . 294 5.6.2. Volterra type sum-difference equation . . . . . . . . . . . . . . . . . . . . . . . 296 5.6.3. Partial finite sum-difference equation . . . . . . . . . . . . . . . . . . . . . . . 298 5.6.4. Sum-difference equations of Volterra-Fredholm type . . . . . . . . . . . 300 5.7. Notes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 303 References. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 304 Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 308

Introduction It is a well known truth that the inequalities have always been of great importance for the development of many branches of mathematics. Indeed, this importance seems to have increased considerably during the last century and the theory of inequalities nowadays may be regarded as an independent branch of mathematics. This field is dynamic and experiencing an explosive growth in both theory and applications. A particular feature that makes the study of this interesting topic so fascinating arises from the numerous fields of applications. As a response to the needs of diverse applications, a large variety of inequalities have been proposed and studied in the literature, see [1-85] and the references given therein. This theory did not just add new objects of study, but also brought with it some new insights and new techniques which are instrumental in solving many important problems.

The integral inequalities of various types have been widely studied in most subjects involving mathematical analysis. They are particulary useful for approximation theory and numerical analysis in which estimates of approximation errors are involved. In recent years, the application of integral inequalities has greatly expanded and they are now used not only in mathematics but also in the areas of physics, technology and biological sciences. The theory of differential and integral inequalities has gained increasing significance in the last century as is apparent from the large number of publications on the subject. With the growing range of applications, the theory of integral inequalities enjoy a rapid increase of interest and widespread recognition as an important area of mathematical analysis.

Many nonlinear dynamical systems are too complicated to be effectively analized. In many situations, we are interested in knowing qualitative properties of solutions without explicit knowledge of the solution process. Having knowledge of the existence of solutions of the system, the integral inequalities with explicit estimates serve as an important tool in their analysis. In fact, the integral inequalities with explicit estimates and fixed point theorems are powerful tools in nonlinear analysis. The theory of integral inequalities with explicit estimates has emerged as an interesting and fascinating topic of applicable analysis with a wide range of applications. One can hardly imagine the development of the theory of differential and integral equations without such inequalities. As the literature is extensive and spans more than a century, it will be helpful to summarize some fundamental known inequalities.

An early significant result in this area and certainly a keystone in the development of the theory of differential equations can be stated as follows: 1

2

Introduction If u is a continuous function defined on [a, a + h] and Zt 0 ≤ u (t) ≤

(c + du (s)) ds, a

for t ∈ [a, a + h] where c, d are nonnegative constants, then for the function u(t) one has the estimate u (t) ≤ c exp (dh) , for t in the same interval. The above inequality was discovered by Gronwall [16] in 1919 while investigating the dependence of a system of differential equations with respect to a parameter and now known in general as Gronwall’s inequality. However, it seems that the idea of such an inequality was grounded in the work of Peano [80] in 1885-86. Gronwall might not have thought that this discovery would be an object for such great interest in the future. Gronwall’s inequality, like the fundamental inequalities as, the arithmetic mean and geometric mean inequality, the Hölder’s (in particular, Cauchy-Schwarz) inequality and the Minkowoski inequality caught the fancy of a number of research workers and a large number of papers which deal with various generalizations, extensions and numerious variants have appeared in the literature, see [1-9,11,12,14,15,17,19,20-28,33-79,84,85] and the references cited therein. In 1956, Bihari [8] gave a nonlinear generalization of Gronwall’s inequality, of fundamental importance in the study of nonlinear problems and is known as Bihari’s inequality. Another important development that also started almost simultaneously, when Wendroff has given some important extensions of Gronwall’s inequality in two independent variables, see [4, p. 154]. The main result due to Wendroff can be stated as follows. Let u(x, y), c(x, y) be nonnegative continuous functions defined for x, y ∈ R+ . If Zx Zy u (x, y) ≤ a (x) + b (y) +

c (s, t) u (s, t) dtds, 0

0

for x, y ∈ R+ , where a(x), b(y) are positive continuous functions for x, y ∈ R+ having derivatives such that a0 (x) ≥ 0, b0 (y) ≥ 0 for x, y ∈ R+ , then   x y Z Z c (s, t) dtds , u (x, y) ≤ E (x, y) exp  0

0

3

Introduction for x, y ∈ R+ ,where E (x, y) =

[a (x) + b (0)] [a (0) + b (y)] , [a (0) + b (0)]

for x, y ∈ R+ . The above inequality has its orgin in the field of partial differential equations and provides a very useful and inspiring integral inequality of fundamental importance. Indeed, the well known book ’Inequalities’ by Beckenbach and Bellman [4] is certainly to be credited for bringing to the notice a fundamental unpublished work of Wendroff. Since the publication of the book [4] in 1961, a great interest in such kinds of inequalities has certainly contributed to the development of the theory of certain partial differential and integral equations, see [3,34] and the references given therein. The well known Gronwall’s inequality and its nonlinear version due to Bihari [8] are not directly applicable to studing integral equations with weakly singular kernels. In the theory of such problems, Henry [17] proposes a method to estimate solutions of linear integral inequality with weakly singular kernel. In ˇ [24] proposed a new approach for obtaining explicit estimates on 1997, Medved the inequalities of the form Zt u (t) ≤ a (t) +

β−1

(t − s)

f (s) w (u (s)) ds,

0

and its variants and generalizations, where 0 < β < 1. The case β = 1, a, f, u continuous, nonnegative, w linear is covered by the Gronwall’s inequality and the case β = 1, w continuous, nonnegative, nonlinear is covered by the Bihari result [8]. The resulting estimates obtained in [17,24-28] play the same role in the theory of parabolic partial differential equations; see [25,27,28]. In the study of qualitative behavior of solutions of certain nonlinear differential and integral equations some specific types of inequalities are needed in various situations. To name a few, the following inequality which provides an explicit bound on unknown function has played a very important role in the study of various classes of differential and integral equations; see [33,34]. If u, f are nonnegative continuous functions on R+ , c ≥ 0 is a constant, and 2

Zt

u (t) ≤ c + 2

f (s) u (s) ds, 0

4

Introduction

for t ∈ R+ ,then √ u (t) ≤ c +

Zt f (s) ds, 0

for t ∈ R+ . The striking feature of this inequality is that it is applicable in situations for which the well known Gronwall and Bihari inequalities do not apply directly. For a detailed account on such inequalities and some applications, see [34]. The explicit bounds on the integral inequalities of the form Zβ

Zt u (t) ≤ c +

a (s) u (s) ds + α

b (s) u (s) ds, α

for t ∈ [α, β] , under some suitable conditions on the functions involved, are also equally important in the study of certain classes of differential and integral equations. It appears that Gamidov [15] first initiated the study of obtaining explicit upper bounds on such inequalities while studying the boundary value problems for higher order differential equations. The theory of retarded differential equations is the object of many works for more than a century. There are many ideas and techniques that have been outlined to study such equations, see [7,13,18,19] and the references cited therein. Inspired by the important role played by the integral inequalities with explicit estimates in the theory of differential and integral equations, some researchers have obtained analogues of such inequalities, which can be used as tools in the study of retarded differential and integral equations, see [21,22,43,47,58,61,64,69,77] and [3, pp. 142-145]. There is no doubt that the retarded integral inequalities with explicit estimates will continue to play an important role in the study of various types of retarded differential and integral equations. During the past few decades some researchers have shown interest in developing the theory of the advanced type of differential equations. If we compare some fundamental aspects on the advanced type of equations with retarded type including ordinary differential equations, it seems, however, to be difficult to apply the fixed point theorems to the advanced types. If the uniqueness of the solutions is not guaranteed, it is convenient to consider the maximal and minimal solutions. As for the advanced types, however, the same methods as in the theory of retarded types may not be possible. In the study of retarded types of differential and integral equations, some retarded integral inequalities with explicit estimates play an important role. It seems, however, not to be easy to obtain such inequalities for advanced types. See [82]. We would like to mention here that another interesting but challenging problem associated with

Introduction

5

the study of differential equations in which the derivatives depend not only on constant values of unknown function from the past, but also on those from the future. The main advantage of such equations is that it enables the formulation of initial value problems that can be extended to the past as well as to the future, that is for all real time t. Numerous models related to such equations remain to be studied for which the above noted basic problems remain open. Many physical problems, arising in a wide variety of applications are governed by both ordinary and partial finite difference equations. The theory of finite difference equations, the methods used in their solutions and their wide applications has drawn much attention in recent years.Through the widespread use of computers in recent years and renewed interest in numerical techniques, it seems that the theory of difference equations will quite likely be a fruitful source for future research. We hope that the tools developed in this theory may shed some light in the development of various fields of applied sciences as well. As can be anticipated, since the integral inequalities with explicit estimates are so important in the study of properties of solutions of differential and integral equations, their finite difference (or discrete) analogues should also be useful in the study of properties of solutions of finite difference equations. The finite difference version of the well known Gronwall inequality seems to have appeared first in the work of Mikeladze [29] in 1935. It is well recognized that the discrete version of Gronwall’s inequality provides a very useful and important tool in proving convergence of the discrete variable methods. In view of wider applications, finite difference inequalities with explicit estimates have been generalized, extended and used considerably in the development of the theory of finite difference equations. A large number of related results can be found in the references [1,3,5,12,42]. The lasting influence of integral and finite difference inequalities with explicit estimates, in the development of the theory of differential, integral and finite difference equations is enormous. Since about 1980, the subject has undergone explosive growth and attracted many researchers by its usefulness and basic character. Indeed, a particular feature that makes such inequalities so fascinating arises from the numerous fields of applications. The variety of nonlinear problems is evergrowing, and new methods have to be found for each of them. During nearly one hundred year history, the subject has been reflected in a great number of books and papers dedicated to such inequalities and applications. See [1,3,12,14,23,34,42] and the references given therein. The theory of such inequalities is basic and important and will no doubt continue to serve as an indispensable tool in future investidations. In 1998 and 2002, the author wrote the monographs [34] and [42], which are devoted to the integral and finite difference inequalities with explicit estimates. Dictated by the need of various types of inequalities while studying

6

Introduction

many systems arising from diverse applications, such inequalities have received considerable attention during the past few years and a number of papers have appeared in the literature. This monograph is an outgrowth of the author’s recent work, among many others in this area, tracing back to his earlier books mentioned above. As the literature is extensive, our focus in this monograph is mainly the results which have quite recently appeared and which are adequate in new applications in the development of the theory of differential, integral and finite difference equations. In fact it brings readers to the forefront of current research in this prosperous field and complement the results in monographs [34] and [42] in various ways. The selection of the material is largely influenced by my interests and the content consists predominantly of my own work. This monograph is written with a view to provide basic tools for researchers working in mathematical analysis and applications, and those concentrating on differential, integral and finite difference equations. Of course, many generalizations, extensions, variants and applications of the results presented here are also possible. Naturally, these considerations will make the analysis more complicated, and leave it to the reader to fill in where needed. The book is self-contained and thus should be useful for those who are interested in learning or applying the inequalities with explicit estimates in their studies. In addition, it can be used as a text for advanced graduate cources and will serve as a reference in the field of system theory. I hope that, it will convince the reader that the integral, and finite difference inequalities with explicit estimates constitute a very useful tool in the study of various types of differential, integral and finite difference equations and will be a valuable source for a long time to come. The present monograph consists of five chapters and references. Chapters 1 and 2 present a large number of basic linear and nonlinear integral inequalities involving functions of one and two independent variables, which in turn can be used as powerful tools in the study of various classes of differential and integral equations. Chapter 3 contains many new linear and nonlinear retarded integral inequalities involving functions of one and two independent variables which are useful in the study of various types of retarded differential and integral equations. Chapters 4 and 5 deals with the new linear and nonlinear finite difference inequalities involving functions of one and two independent variables, which find important applications in the study of different types of finite difference equations. Each chapter contains a section on basic applications of some of the inequalities therein. Regarding the list of references, I would like to mention that a large number of references on the topics discussed here are provided in the books [34] and [42] by the present author; see also [1,3,4,12,14,23,32,84] and the references given there. Without any intention of being complete, here only those references from the recent journal literature which are used in the text are given. Throughout, we shall use the following notations and definitions.

Introduction

7

Let R denotes the set of real numbers and R+ = [0, ∞) , Z = {0, ±1, ±2, ...} , N = {1, 2, ...} , N0 = {0, 1, 2, ...} , Nα,β = {α, α + 1, ..., α + n = β} for n ∈ N, α ∈ N0 , β ∈ N such that α ≤ β. The derivative of a function u(t) for t ∈ R d u (t) . The partial derivatives of a function z(x, y) for is denoted by u0 (t) or dt x, y ∈ R with respect to x, y and xy are denoted by D1 z (x, y) or zx (x, y) or ∂ ∂ ∂x z (x, y) , D2 z (x, y) or zy (x, y) or ∂y z (x, y) and D1 D2 z (x, y) = D2 D1 z (x, y) 2

∂ z (x, y). For the functions w(m) , z(m, n) for m, n ∈ Z, we or zxy (x, y) or ∂y∂x define the operators ∆, ∆1 , ∆2 by ∆w (m) = w (m + 1) − w (m) , ∆1 z (m, n) = z (m + 1, n) − z (m, n) , ∆2 z (m, n) = z (m, n + 1) − z (m, n) respectively and ∆2 ∆1 z (m, n) = ∆2 (∆1 z (m, n)) . Let C (A, B) , C 1 (A, B) , D (A, B) denote the class of continuous functions, the class of continuous and differentiable functions, the class of functions from the set A to the set B respectively. We use the usual conventions that the empty sums and products are taken to be 0 and 1 respectively. Furthermore, throughout the work, we shall assume that all the integrals, sums and products involved exist on the respective domains of their definitions and are finite, and hence converge, so we shall omit such types of conditions. The notations, definitions, and symbols used in the work are standard and are explained, if necessary,at appropriate places.


Chapter 1

Integral inequalities in one variable 1.1 Introduction During the past few decades abundance of applications is stimulating a rapid development of the theory of differential and integral equations. A variety of new methods and tools are developed by different investigators to study various types of differential and integral equations. The method of integral inequalities with explicit estimates is a very powerful tool in studying various properties of solutions of differential and integral equations. Motivated by the desire to apply such inequalities to numerious applications, in the past few years, a number of new inequalities have been investigated in [24-28,44,45,50-55]. In this chapter we present some fundamental integral inequalities recently established in the literature, which can be used as handy tools in the analysis of certain classes of differential and integral equations. Some immediate applications are also given.

1.2 Basic nonlinear integral inequalities The explicit bounds given by the well known Gronwall-Bellman [16,6] inequality and its nonlinear generalization due to Bihari [8] (see also, LaSalle [20]) are used to a considerable extent in the study of differential and integral equations. In this section we present some useful generalizations and variants of the above mentioned inequalities. We shall start with the following generalization of Bihar’s inequality (see [34, p. 107]). 9

10

Integral inequalities in one variable

∂ k (t, σ) ∈ C (D Theorem 1.2.1. Let a0 (t) ∈ C (R+ , R + ) , k (t, σ) , ∂t u(t), a(t), 2 : 0 ≤ σ ≤ t < ∞ . Let g ∈ C (R+ , R+ ) be a , R+ ) where D = (t, σ) ∈ R+ nondecreasing function, g(u) > 0 on (0, ∞) . If

Zt u (t) ≤ a (t) +

k (t, σ)g (u (σ)) dσ,

(1.2.1)

0

for t ∈ R+ , then for 0 ≤ t ≤ t1 ; t, t1 ∈ R+,  u (t) ≤ G−1 G (a (t)) +



Zt

A (s) ds ,

(1.2.2)

0

where Zt A (t) = k (t, t) +

∂ k (t, σ)dσ, ∂t

(1.2.3)

0

Zr G (r) =

ds , r > 0, G (s)

(1.2.4)

r0

r0 > 0 is arbitrary and G−1 is the inverse of G and t1 ∈ R+ is chosen so that Zt G (a (t)) +

A (s) ds ∈ Dom G−1 ,

0

for all t ∈ R+ lying in the interval 0 ≤ t ≤ t1 . Proof. We note that, since a0 (t) ≥ 0, the function a(t) is monotonically increasing. Let a(t) > 0 for t ∈ R+ and define a function z(t) by the right hand side of (1.2.1). Then z(0) = a(0), u (t) ≤ z (t) , z(t) is positive and by hypotheses, it is nondecreasing and z 0 (t) = a0 (t) + k (t, t) g (u (t)) +

Zt

∂ k (t, σ)g (u (σ)) dσ ∂t

0

≤ a0 (t) + A (t) g (z (t)) .

(1.2.5)

From (1.2.4), (1.2.5) the fact that a (t) ≤ z (t) and the nondecreasing character of g we have d z 0 (t) a0 (t) + A (t) g (z (t)) G (z (t)) = ≤ dt g (z (t)) g (z (t))

Chapter 1 ≤

11

a0 (t) + A (t) g (a (t))

d G (a (t)) + A (t) . (1.2.6) dt By setting t = s in (1.2.6) and integrating it from 0 to t , t ∈ R+ and using the fact that z(0) = a(0) we have =

Zt G (z (t)) ≤ G (a (t)) +

A (s) ds.

(1.2.7)

0

From (1.2.7) and the hypotheses on G we observe that   Zt −1  z (t) ≤ G G (a (t)) + A (s) ds .

(1.2.8)

0

Using (1.2.8) in u (t) ≤ z (t) we get the required inequality in (1.2.2). If a(t) is nonnegative, we carry out the above procedure with a (t) + ε instead of a(t) ,where ε > 0 is an arbitrary small constant, and subsequently pass to the limit ε → 0 to obtain (1.2.2). The subinterval 0 ≤ t ≤ t1 is obvious. Remark 1.2.1. We note that the inequality established in Theorem 1.2.1 is a slight variant of the inequality given by Pachpatte in [68]. In the special case ∂ k (t, σ) = when a(t) = c ( a nonnegative constant), k (t, σ) = f (σ) and hence ∂t 0, the inequality in Theorem 1.2.1 reduces to the Bihari’s inequality, see [8]. If we take g(u) = u in Theorem 1.1, then the bound obtained in (1.2.2) reduces to   t Z u (t) ≤ a (t) exp  A (s) ds , 0

for t ∈ R+. In this case Theorem 1.2.1 is a generalization of the well known Gronwall-Bellman inequality, see [16,6]. The inequalities in the following theorem are established by Pachpatte in [55]. ∂ k (t, σ) be as in Theorem 1.2.1 and c ≥ 0 Theorem 1.2.2. Let u (t) , k (t, σ) , ∂t is a constant.

(a1 ) If 2

Zt

u (t) ≤ c +

k (t, σ)u (σ) dσ, 0

(1.2.9)

12


for t ∈ R+ , then √ 1 u (t) ≤ c + 2

Zt A (s) ds,

(1.2.10)

0

for t ∈ R+ , where A(t) is given by (1.2.3). (a2 ) Let g(u) be as in Theorem 1.2.1. If u2 (t) ≤ c +

Zt k (t, σ)u (σ) g (u (σ)) dσ,

(1.2.11)

0

for t ∈ R+ , then for 0 ≤ t ≤ t2 ; t, t2 ∈ R+ ,   Zt √ 1 A (s) ds , u (t) ≤ G−1 G c + 2

(1.2.12)

0

where G, G

−1

, A are as in Theorem 1.2.1, and t2 ∈ R+ is chosen so that

√ 1 G c + 2

Zt

A (s) ds ∈ Dom G−1 ,

0

for all t ∈ R+ lying in the interval 0 ≤ t ≤ t2 . Proof. (a1 ) Let c > 0 and define p a function z(t) by the right hand side of (1.2.9). Then z(0) = c, u (t) ≤ z (t), z(t) is positive and nondecreasing for t ∈ R+ and Zt

0

z (t) = k (t, t) u (t) +

∂ k (t, σ)u (σ) dσ ∂t

0

≤ k (t, t)

p z (t) +

Zt

p ∂ k (t, σ) z (σ)dσ ∂t

0

p ≤ A (t) z (t),

(1.2.13)

which implies p

√ 1 z (t) ≤ c + 2

Zt A (s) ds.

(1.2.14)

0

p Using (1.2.14) in u (t) ≤ z (t), we get the desired inequality in (1.2.10. The proof of the case when c ≥ 0 can be completed as mentioned in the proof of Theorem 1.2.1.

Chapter 1

13

(a2 ) Let c > 0 and define p a function w(t) by the right hand side of (1.2.11). Then w(0) = c, u (t) ≤ w (t), w(t) is positive, nondecreasing for t ∈ R+ and as in the proof of (1.2.13) we get p p w0 (t) ≤ A (t) w (t)g w (t) , (1.2.15) which implies p

√ w (t) ≤ c +

Zt A (s) g

p w (t) ds.

(1.2.16)

0

Now an application of Bihari’s inequality given in Theorem 1.3.1 in [34] yields   Zt p √ 1 w (t) ≤ G−1 G c + A (s) ds . (1.2.17) 2 0

p Using (1.2.17) in u (t) ≤ w (t), we get the required inequality in (1.2.12). The proof of the case when c ≥ 0 follows as mentioned in the proof of Theorem 1.2.1. The subinterval 0 ≤ t ≤ t2 is obvious. ∂ k (t, σ) = 0 in Theorem Remark 1.2.2. If we take k (t, σ) = f (σ) and hence ∂t 1.2.2, then the bounds obtained in (1.2.10), (1.2.12) reduces to

√ 1 u (t) ≤ c + 2

Zt f (σ)dσ, 0



√ 1 u (t) ≤ G−1 G c + 2

Zt

 f (σ) dσ  ,

0

respectively. We note that, by following the proof of Theorem 1.2.1 one can very easily obtain the bounds on inequalities (1.2.9), (1.2.11) when the constant c is replaced by the function a(t), where a(t) is as in Theorem 1.2.1. ˇ defined a special class of nonlinear functions and developed In [24] Medved a method to estimate solutions for nonlinear integral inequalities with singular kernels and the nonlinearity of that class. The class of functions defined in [24] is as follows. Let q > 0 be a real number and 0 < T ≤ ∞. We say that a function w : R+ → R satisfies a condition (q), if q e−qt [w (u)] ≤ R (t) w e−qt uq , (q) for all u ∈ R+ , t ∈ [0, T ) , where R(t) is continuous, nonnegative function.

14

Integral inequalities in one variable If w (u) = um , m > 0, then q e−qt [w (u)] = e(m−1)qt w e−qt uq ,

Remark 1.2.3.

for any q > 1, i.e., the condition q is satisfied with R (t) = e(m−1)qt . For w (u) = u + aum , where 0 ≤ a ≤ 1, m ≥ 1 the function w satisfies the condition (q) with q > 1 and R (t) = 2q−1 eqmt , see [24]. ˇ [24]. The following theorems are proved in Medved Theorem 1.2.3. Let 0 < T ≤ ∞, u (t) , b (t) , a (t) , a0 (t) ∈ C ([0, T ) , R+ ) ; w ∈ C (R+ , R) be a nondecreasing function, w(0) = 0, w(u) > 0 on (0, T ) and Zt u (t) ≤ a (t) +

β−1

(t − s)

b (s) w (u (s)) ds,

(1.2.18)

0

for t ∈ [0, T ) where β > 0 is a constant. Then the following assertions hold: (i) Suppose β >

1 2

and w satisfies the condition (q) with q = 2. Then

n h io 12 2 u (t) ≤ et Ω−1 Ω 2a (t) + g1 (t) ,

(1.2.19)

for t ∈ [0, T1 ] , where Γ (2β − 1) g1 (t) = 4β−1

Zt

2

R (s) b (s) ds, 0

Rv ds Γ is the gamma function, Ω (v) = w(s) , v0 > 0, Ω−1 is the inverse of Ω, and v0 2 t1 ∈ R+ is such that Ω 2a (t) + g1 (t) ∈ Dom Ω−1 for all t ∈ [0, T1 ] . (ii) Let β ∈ 0, 12 and w satisfies the condition (q) with q = z + 2 , where 1 −1 z = 1−β be as in part (i). Then β i.e., β = z+1 . Let Ω, Ω 1 q u (t) ≤ et Ω−1 Ω 2q−1 a (t) + g2 (t) q ,

(1.2.20)

for t ∈ [0, T1 ] , where g2 (t) = 2

q−1

Kzq

Zt

q

R (s) b (s) ds, 0

Γ (1 − αp) p1−αp

p1

z+2 z ,p = , (1.2.21) z+1 z+1 q and T1 ∈ R+ is such that Ω 2q−1 a (t) + g2 (t) ∈ Dom Ω−1 for all t ∈ [0, T1 ] . Kz =

,α =

Chapter 1

15

Proof. First we shall prove the assertion (i). Using the Cauchy-Schwarz inequality we obtain from (1.2.18) Zt

β−1 s

e b (s) e−s w (u (s)) ds

(t − s)

u (t) ≤ a (t) + 0

 t  12  t  12 Z Z 2β−2 2s   2 2 ≤ a (t) +  (t − s) e ds b (s) e−2s w (u (s)) ds . (1.2.22) 0

0

For the first integral in (1.2.22) we have the estimate Zt

Zt

2β−2 2s

(t − s)

=

e ds =

0

τ 2β−2 e2(t−τ ) dτ

0

2t

Zt τ

=e

2β−2 −2τ

e

2e2t dτ = β 4

0

Z2t

σ 2β−2 e−σ dσ

0

2t

2e Γ (2β − 1) . 4β Therefore we obtain from (1.2.22)
0 are real numbers, see [30,65]), with n = 2, r = 2 we obtain e2t Γ (2β − 1) u (t) ≤ 2a (t) + 4β−1 2

2

Zt

2

2

b (s) e−2s w (u (s)) ds,

(1.2.24)

0

and applying the condition (q) with q = 2 we have Zt v (t) ≤ α (t) + K

2

b (s) R (s) w (v (s)) ds, 0

where 2 Γ (2β − 1) 2 v (t) = e−t u (t) , α (t) = 2a (t) , K = . 4β−1

(1.2.25)

16


Now proceeding as in the proof of Theorem 1.2.1 we obtain v (t) ≤ Ω−1 [Ω (α (t)) + g1 (t)] .

(1.2.26)

From (1.2.25) and (1.2.26) we get (1.2.19). z . Let p, q be Next, we prove the assertion (ii). Obviously, β − 1 = −α = − z+1 1 1 as in the statement of theorem. Then p + q = 1 and using the Hölder’s integral inequality we obtain from (1.2.18)

Zt u (t) ≤ a (t) +

β−1

(t − s)

b (s) w (u (s)) ds

0

Zt

−α s

(t − s)

= a (t) +

e b (s) e−s w (u (s)) ds

0

 p1  t  q1  t Z Z −αp ps   q q e ds b (s) e−qs w (u (s)) ds . ≤ a (t) +  (t − s) 0

(1.2.27)

0

For the first integral in (1.2.27) we have the estimate Zt

−αp ps

(t − s)

pt

e ds = e

0

=

Zt

τ −αp e−pτ dτ

0

ept

Zpt

p1−αp

σ −αp e−σ dσ
0 and so Γ (1 − αp) ∈ R. Thus (1.2.27) and the

 q1  t Z q q u (t) ≤ a (t) + et Kz  b (s) R (s) w e−qs u (s) ds ,

(1.2.28)

0

where Kz is defined by (1.2.21). Now using the inequality (1.2.23) with n = 2, r = q we obtain q

q−1

u (t) ≤ 2

q

q−1 qt

a (t) + 2

e

Kzq

Zt

q

q

b (s) R (s) w e−qs u (s)

ds,

(1.2.29)

0

and this yields q−1

v (t) ≤ φ (t) + 2

Kzq

Zt 0

b(s)q R (s) w (v (s)) ds,

(1.2.30)

Chapter 1

17

where q q v (t) = e−t u (t) , φ (t) = 2q−1 a (t) .

(1.2.31)

Now by proceeding as in the proof of Theorem 1.2.1 we obtain v (t) ≤ Ω−1 [Ω (φ (t)) + g2 (t)] .

(1.2.32)

The required inequality in (1.2.20) follows from (1.2.31) and (1.2.32). As a consequence of Theorem 1.2.3 we have Let 0 < T ≤ ∞, u (t) , b (t) , a (t) , a0 (t) be as in Theorem

Theorem 1.2.4. 1.2.3 and

Zt

β−1

(t − s)

u (t) ≤ a (t) +

b (s) u (s) ds,

(1.2.33)

0

where β > 0. Then the following assertions hold: (i) If β > 12 , then   Zt √ 2Γ (2β − 1) 2 b (s) ds + t , u (t) ≤ 2 a (t) exp  4β

(1.2.34)

0

for t ∈ [0, T ) . (ii) If β =

1 z+1

for some z ≥ 1, then

  Zt q−1 1 2 q Kzq b (s) ds + t , u (t) ≤ 2q−1 q a (t) exp  q

(1.2.35)

0

for t ∈ [0, T ), where Kz is defined by (1.2.11), q = z + 2. Theorem 1.2.5. Let 0 < T ≤ ∞, u (t) , b (t) , a (t) , a0 (t) and w(u) be as in Theorem 1.2.3 and 2

Zt

u (t) ≤ a (t) +

β−1

(t − s)

b (s) w (u (s)) ds,

0

where β > 0 is a constant. Then the following assertions hold:

(1.2.36)

18

Integral inequalities in one variable (i) Suppose β > u (t) ≤ et

 

1 2

and w satisfies the condition (q) with q = 2. Then 

2

Λ−1 Λ 2a (t)

Zt +K



0

 14  2 b (s) R (s) ds , 

(1.2.37)

for t ∈ [0, T1 ] , where Γ (2β − 1) , Λ (v) = K= 4β−1

Zv

dσ √ , v0 > 0, w ( σ)

(1.2.38)

v0

Rt 2 2 T1 ∈ R+ is such that Λ 2a (t) + K b (s) R (s) ds ∈ Dom Λ−1 for all 0

t ∈ [0, T1 ], Γ is the gamma function. (ii) Let β ∈ 0, 12 and w satisfies the condition (q) with q = z + 2, where 1 −1 z = 1−β be as in part (i). Then β i.e., β = z+1 . Let Λ, Λ u (t) ≤ et

 

 Λ−1 Λ 2q−1 a (t)

q

+ 2q−1 Kzq



Zt 0

 2q1  q b (s) R (s) ds , (1.2.39) 

for t ∈ [0, T1 ] , where 1 z+2 Γ (1 − βp) p 1 ,p = , ,β = Kz = p1−βp z+1 z+1 T1 ∈ R+ is such that Λ 2q−1 a (t)

q

+ 2q−1 Kzq

Rt

(1.2.40)

q b (s) R (s) ds ∈ Dom Λ−1 for

0

all t ∈ [0, T1 ]. Proof. First we prove the assertion (i). Following the proof of Theorem 1.2.3 one can show that 2

Zt

v (t) ≤ α (t) + K

2

b (s) R (s) w (v (s)) ds,

(1.2.41)

0

where 2 Γ (2β − 1) 2 . v (t) = e−t u (t) , α (t) = 2a (t) , K = 4β−1

(1.2.42)

p Define by e(t) the right hand side of (1.2.41). Then v (t) ≤ e (t). Now by following the proof of Theorem 1.2.1 with suitable modifications we obtain   Zt 2 e (t) ≤ Λ−1 Λ (α (t)) + K b (s) R (s) ds , 0

Chapter 1

19

and thus we have   12  Zt   p 2 v (t) ≤ e (t) ≤ Λ−1 Λ (α (t)) + K b (s) R (s) ds .  

(1.2.43)

0

From (1.2.42) and (1.2.43) we get (1.2.37). Now we shall prove the assertion (ii). Following the proof of assertion (ii) of Theorem 1.2.3 one can show that 2

q−1

v (t) ≤ φ (t) + 2

Kzq

Zt

q

b (s) R (s) w (v (s)) ds,

(1.2.44)

0

where q q v (t) = e−t u (t) , φ (t) = 2q−1 a (t) ,

(1.2.45)

and Kz is given as in (1.2.40). Following the procedure from the proof of assertion (i) we obtain

v (t) ≤

 

 Λ−1 Λ (φ (t)) + 2q−1 Kzq



Zt 0

 12  q b (s) R (s) ds . 

(1.2.46)

From (1.2.45) and (1.2.46) we obtain (1.2.39). Remark 1.2.4. We note that in the book [17] Henry obtained by an iterative argument an estimate on the inequality of the form (1.2.33). The analysis used in the proof of Theorems 1.2.3 and 1.2.5 is based on the method developed ˇ in [24]. For the application to global existence of solutions and by Medved a stability theorem for a class of parabolic partial differential equations, see [25,28].

1.3 More nonlinear integral inequalities This section deals with some more nonlinear integral inequalities established by Pachpatte in [35,45] which claims their orgins in the inequalities given by Ou-Iang [33] and Dafermos [10], see also [34]. In [35] Pachpatte proved the inequalities in the following two theorems. Theorem 1.3.1. a real constant.

Let u (t) , a (t) , b (t) , g (t) , h (t) ∈ C (R+ , R+ ) and p > 1 be

20

Integral inequalities in one variable (a1 ) If Zt

p

u (t) ≤ a (t) + b (t)

[g (s) up (s) + h (s) u (s)] ds,

(1.3.1)

0

for t ∈ R+ , then  Zt  p − 1 a (s) u (t) ≤ a (t) + b (t) + g (s) a (s) + h (s)  p p 0



Zt

× exp 

b (σ) g (σ) +

s

h (σ) p

 p1  dσ  ds ,  

(1.3.2)

for t ∈ R+ . (a2 ) Let c(t) be a real-valued positive continuous and nondecreasing function defined on R+ . If p

Zt

p

u (t) ≤ c (t) + b (t)

[g (s) up (s) + h (s) u (s)] ds,

(1.3.3)

0

for t ∈ R+ , then u (t) ≤ c (t)

 

Zt 1 + b (t)

 

Zt

× exp 

g (s) + h (s) c1−p (s)

0

b (σ) g (σ) + s



 p1 

h (σ) 1−p c (σ) dσ  ds ,  p

(1.3.4)

for t ∈ R+ . (a3 ) Let k(t, s) and its partial derivative continuous functions for 0 ≤ s ≤ t < ∞. If p

Zt

u (t) ≤ a (t) + b (t)

∂ ∂t k (t, s)

be real-valued nonnegative

k (t, s) [g (s) up (s) + h (s) u (s)]ds,

(1.3.5)

0

for t ∈ R+ , then   t   p1 Zt Z   u (t) ≤ a (t) + b (t) B (σ) exp  A (τ )dτ  dσ ,   0

σ

(1.3.6)

Chapter 1

21

for t ∈ R+ , where

h (t) A (t) = k (t, t) b (t) g (t) + p Zt

∂ h (s) k (t, s) b (s) g (s) + ds, ∂t p

+

(1.3.7)

0

p − 1 a (t) + B (t) = k (t, t) g (t) a (t) + h (t) p p Zt

p − 1 a (s) ∂ k (t, s) g (s) a (s) + h (s) + ds, ∂t p p

+

(1.3.8)

0

for t ∈ R+ . Proof.

(a1 ) Define a function z(t) by Zt

z (t) =

[g (s) up (s) + h (s) u (s) ds] .

(1.3.9)

0

Then z(0) = 0 and (1.3.1) can be written as up (t) ≤ a (t) + b (t) z (t) .

(1.3.10)

From (1.3.10) and using the elementary inequality, see [30, p. 30] 1

1

xp y q ≤

x y + , p q

where x ≥ 0, y ≥ 0 and

(1.3.11) 1 p

+

1 q

= 1, we observe that

1. p /p − 1 u (t) ≤ (a (t) + b (t) z (t)) (1) 1 p

≤

p − 1 a (t) b (t) + + z (t) . p p p

(1.3.12)

Differentiating (1.3.9) and using (1.3.10) and (1.3.12) we get h (t) 0 z (t) ≤ b (t) g (t) + z (t) p p − 1 a (t) + . + g (t) a (t) + h (t) p q

(1.3.13)

22


The inequality (1.3.13) implies the estimate Zt p − 1 a (s) + g (s) a (s) + h (s) z (t) ≤ p p 0



Zt

× exp 

h (σ) b (σ) g (σ) + p

 dσ  ds.

(1.3.14)

s

The required inequality (1.3.2) follows from (1.3.14) and (1.3.10). (a2 ) Since c(t) is a positive, continuous and nondecreasing function for t ∈ R+ , from (1.3.3) we observe that

u (t) c (t)

p

p Zt u (s) u (s) 1−p ds. ≤ 1 + b (t) + h (s) c (s) g (s) c (s) c (s) 0

Now an application of the inequality given in (a1 ) yields the desired result in (1.3.4). (a3 ) Define a function z(t) by Zt z (t) =

k (t, s) [g (s) up (s) + h (s) u (s)] ds.

(1.3.15)

0

Then as in the proof of part (a1 ) , from (1.3.15) we see that the inequalities (1.3.10) and (1.3.12) hold. Differentiating (1.3.15) and using (1.3.10), (1.3.12) and the fact that z(t) is monotonic nondecreasing in t we get z 0 (t) = k (t, t) [g (t) up (t) + h (t) u (t)] Zt +

∂ k (t, s) [g (s) up (s) + h (s) u (s)] ds ∂t

0

p − 1 a (t) b (t) ≤ k (t, t) g (t) (a (t) + b (t) z (t)) + h (t) + + z (t) p p p Zt +

∂ k (t, s) [g (s) (a (s) + b (s) z (s)) ∂t

0

+h (s)

p − 1 a (s) b (s) + + z (s) ds p p p

Chapter 1 

≤ k (t, t) b (t) g (t) +

h (t) p

23 Zt

+



∂ h (s)  k (t, s) b (s) g (s) + z (t) ∂t p

0

p − 1 a (t) + +k (t, t) g (t) a (t) + h (t) p p Zt +

p − 1 a (s) ∂ k (t, s) g (s) a (s) + h (s) + ds ∂t p p

0

= A (t) z (t) + B (t) .

(1.3.16)

The inequality (1.3.16) implies the estimate 

Zt z (t) ≤

Zt

B (σ) exp 

 A (τ )dτ  dσ.

(1.3.17)

σ

0

Using (1.3.17) in up (t) ≤ a (t) + b (t) z (t) , we get the required inequality in (1.3.6). Theorem 1.3.2. Let u (t) , a (t) , b (t) , g (t) ∈ C (R+ , R+ ) and p > 1 be a real constant. 2 → R+ be a continuous function such that (b1 ) Let f : R+

0 ≤ f (t, x) − f (t, y) ≤ m (t, y) (x − y) ,

(1.3.18)

2 → R+ is a continuous function. If for t ∈ R+ and x ≥ y ≥ 0,where m : R+

Zt

p

u (t) ≤ a (t) + b (t)

f (s, u (s)) ds,

(1.3.19)

0

for t ∈ R+ , then  Zt  p − 1 a (s) + u (t) ≤ a (t) + b (t) f s,  p p 0



Zt

× exp  s

for t ∈ R+ .

  p1 p − 1 a (σ) b (σ)   + dσ ds m σ, ,  p p p

(1.3.20)

24


2 → R+ be a continuous function and φ : R+ → R+ be a (b2 ) Let f : R+ continuous and strictly increasing function with φ (0) = 0 such that

0 ≤ f (t, x) − f (t, y) ≤ m (t, y) φ−1 (x − y) ,

(1.3.21)

2 for t ∈ R+ and x ≥ y ≥ 0, where m : R+ → R+ is a continuous function and −1 φ is the inverse function of φ and

φ−1 (xy) ≤ φ−1 (x) φ−1 (y) ,

(1.3.22)

for x, y ∈ R+ . If  t  Z up (t) ≤ a (t) + b (t) φ  f (s, u (s)) ds ,

(1.3.23)

0

for t ∈ R+ , then   t  Z  a (s) p − 1  u (t) ≤ a (t) + b (t) φ  f s, +  p p 0



Zt

× exp  s

  p1  b (σ) p − 1 a (σ) + φ−1 dσ  ds m σ, ,  p p p

(1.3.24)

for t ∈ R+ . (b3 ) Let W (r) be a real-valued, continuous, nondecreasing, subadditive and submultiplative function defined on R+ and W (r) > 0 on (0, ∞) . If Zt

p

u (t) ≤ a (t) + b (t)

g (s) W (u (s)) ds,

(1.3.25)

0

for t ∈ R+ , then for 0 ≤ t ≤ t1 ,

u (t) ≤

 

 a (t) + b (t) G−1 G (D (t)) +



Zt

g (s) W

0

b (s) p

 p1  ds , (1.3.26) 

where for t ∈ R+ , Zt D (t) =

g (s) W

p − 1 a (s) + p p

ds,

(1.3.27)

0

Zr G (r) = r0

ds , r > 0, W (s)

(1.3.28)

Chapter 1

25

r0 > 0 is arbitrary, G−1 is the inverse function of G and t1 ∈ R+ is chosen so that Zt G (D (t)) +

g (s) W

b (s) p

ds ∈ Dom G−1 ,

0

for all t ∈ R+ lying in the interval 0 ≤ t ≤ t1 . Proof. (b1 ) Define a function z(t) by Zt z (t) =

f (s, u (s)) ds.

(1.3.29)

0

Then as in the proof of Theorem 1.3.1, part (a1 ), from (1.3.19) we see that the inequalities (1.3.10) and (1.3.12) hold. From (1.3.29), (1.3.12) and the condition (1.3.18) it follows that z 0 (t) = f (t, u (t)) p − 1 a (t) b (t) p − 1 a (t) + + z (t) − f t, + ≤ f t, p p p p p p − 1 a (t) +f t, + p p p − 1 a (t) b (t) p − 1 a (t) ≤ m t, + z (t) + f t, + . p p p p p

(1.3.30)

The inequality (1.3.30) implies the estimate Zt z (t) ≤

f

s,

p − 1 a (s) + p p

0



Zt

× exp 

 p − 1 a (σ) b (σ)  + dσ ds. m σ, p p p

(1.3.31)

s

From (1.3.31) and (1.3.10) the desired inequality in (1.3.20) follows. (b2 ) Defining a function z(t) by (1.3.29) and following the arguments as in the proof of Theorem 1.3.1, part (a1 ) we see that corresponding to the inequalities (1.3.10) and (1.3.12) we get up (t) ≤ a (t) + b (t) φ (z (t)) ,

(1.3.32)

and u (t) ≤

p − 1 a (t) b (t) + + φ (z (t)) . p p p

(1.3.33)

26


From (1.3.29), (1.3.33) and the conditions (1.3.21), (1.3.22) it follows that z 0 (t) = f (t, u (t)) p − 1 a (t) b (t) p − 1 a (t) ≤ f t, + + φ (z (t)) − f t, + p p p p p p − 1 a (t) + +f t, p p p − 1 a (t) b (t) p − 1 a (t) −1 + φ φ (z (t)) + f t, + ≤ m t, p p p p p b (t) p − 1 a (t) p − 1 a (t) + φ−1 z (t) + f t, + . (1.3.34) ≤ m t, p p p p p The inequality (1.3.34) implies the estimate Zt z (t) ≤

f

p − 1 a (s) + s, p p

0



Zt

× exp 

 b (σ) p − 1 a (σ) + φ−1 dσ  ds. m σ, p p p

(1.3.35)

s

The required inequality (1.3.24) follows from (1.3.32) and (1.3.35). (b3 ) Define a function z(t) by Zt z (t) =

g (s) W (u (s)) ds.

(1.3.36)

0

Then as in the proof of Theorem 1.3.1, part (a1 ) , from (1.3.25) we see that the inequalities (1.3.10) and (1.3.12) hold. From (1.3.36), (1.3.12) and the conditions on W it follows that Zt z (t) ≤ D (t) +

g (s) W

b (s) p

W (z (s)) ds,

(1.3.37)

0

where D(t) is defined by (1.3.27). The rest of the proof can be completed by closely looking at the proof of Theorem 2.4.2 given in [34, p.121]. We omit the further details. Remark 1.3.1. We note that in the special cases when (i) g = 0, (ii) g = 0, p = 2 in Theorem 1.3.1, and (iii) p = 2 in Theorem 1.3.2, we get new inequalities which may be convenient in certain applications.

Chapter 1

27

The following Bihari type inequality is proved by Pachpatte in [45]. 2 Theorem 1.3.3. Let u (t) , f (t) ∈ C (R+ , R+ ) , h (t, s) ∈ C R+ , R+ , for 0 ≤ s ≤ t < ∞ and c ≥ 0, p > 1 are real constants. Let g ∈ C (R+ , R+ ) be a nondecreasing function, g(u) > 0 for u > 0 and up (t) ≤ c +

Zt





Zs

h (s, σ) g (u (σ)) dσ  ds,

f (s) g (u (s)) + 0

(1.3.38)

0

for t ∈ R+ , then for 0 ≤ t ≤ t1 , 1 u (t) ≤ H −1 [H (c) + E (t)] p ,

(1.3.39)

where Zt



h (s, σ)dσ ds,

f (s) +

E (t) = 0

Zr H (r) = r0



Zs

(1.3.40)

0

ds 1 , r > 0, g sp

(1.3.41)

r0 > 0 is arbitrary, H −1 is the inverse function of H and t1 ∈ R+ is chosen so that H (c) + E (t) ∈ Dom H −1 , for all t ∈ R+ lying in the interval 0 ≤ t ≤ t1 . Proof. We first assume that c > 0 and define a function z(t) by the right 1 hand side of (1.3.38). Then z(0) = c, u (t) ≤ (z (t)) p , z(t) is positive and nondecreasing for t ∈ R+ and z 0 (t) = f (t) g (u (t)) +

Zt h (t, σ)g (u (σ)) dσ 0

Zt 1 1 p ≤ f (t) g (z (t)) + h (t, σ)g (z (σ)) p dσ 0



≤ g (z (t))

1 p

Zt

f (t) +

 h (t, σ) dσ  .

0

(1.3.42)

28


From (1.3.41) and (1.3.42) we have d z 0 (t) H (z (t)) = 1 dt g (z (t)) p 

Zt

≤ f (t) +

 h (t, σ) dσ  .

(1.3.43)

0

By setting t = s in (1.3.43) and integrating it from 0 to t we have H (z (t)) ≤ H (c) + E (t) .

(1.3.44)

Since H −1 is increasing, from (1.3.44) we have z (t) ≤ H −1 [H (c) + E (t)] .

(1.3.45)

1

Using (1.3.45) in u (t) ≤ (z (t)) p we have the required inequality in (1.3.39). If c is nonngative, we carry out the above procedure with c + ε instead of c, where ε > 0 is an arbitrary small constant, and by letting ε → 0, we obtain (1.3.39). The subinterval 0 ≤ t ≤ t1 is obvious. As an immediate consequence of Theorem 1.3.3 we have the following Theorem 1.3.4.

Let u (t) , f (t) , h (t, s) , c, p be as in Theorem 1.3.3. If   Zt Zs up (t) ≤ c + f (s) u (s) + h (s, σ) u (σ) dσ  ds, (1.3.46) 0

0

for t ∈ R+ , then 1 p−1 p−1 p−1 H (t) , u (t) ≤ c p + p

(1.3.47)

for t ∈ R+ , where E(t) is given by (1.3.40). Proof.

Let g(u) = u in Theorem 1.3.3.Then (1.3.38) reduces to (1.3.46) and p−1 p−1 p r p − r0 p , H (r) = p−1

H

−1

p−1 p−1 r + r0 p (r) = p

p p−1

,

and consequently the bound obtained in (1.3.39) reduces to the bound in (1.3.47).

Chapter 1

29

Remark 1.3.2.

We note that the definition of the function H in (1.3.41) R∞ ds ˇ [26]. If 1 = ∞, then H (∞) = ∞ and the is motivated from Medved r0 g s p

inequality in (1.3.39) is true for t ∈ R+ . In the special case when p = 2, the inequality given in Theorem 1.3.4 reduces to a variant of the inequality given in [34, p. 233]. We also note that by following the proof of Theorem 1.2.1, one can very easily obtain the bounds on the inequalities (1.3.38) and (1.3.46) by replacing the constant c by a function a(t) as in Theorem 1.2.1.

1.4 Inequalities with iterated integrals Integral inequalities with iterated integrals play a very important role in the qualitative theory of differential and integral equations. In this section we offer some fundamental iterated integral inequalities established by Bykov and Salpagarov in [9] and Pachpatte in [53,78]. Our first theorem deals with the inequalities established by Pachpatte in [53]. ∂ k (t, s) Theorem 1.4.1. Let u (t) , f (t) , a (t) ∈C (R+ , R+ ) , k (t, s) , ∂t , C (D, 2 R+ ) and c ≥ 0 is a constant, where D = (t, s) ∈ R+ : 0 ≤ s ≤ t < ∞ .

(a1 ) If 

Zt u (t) ≤ c +

f (s) u (s) + 0

for t ∈ R+ , then 



Zs

k (s, σ) u (σ) dσ  ds,

(1.4.1)

0



Zt

u (t) ≤ c 1 +

f (s) exp  0

 

Zs

[f (σ) + g (σ)]dσ ds ,

(1.4.2)

0

for t ∈ R+ , where Zt A (t) = k (t, t) +

∂ k (t, τ ) dτ. ∂t

(1.4.3)

0

(a2 ) If Zt u (t) ≤ a (t) +



Zs

f (s) u (s) + 0

 k (s, σ) u (σ) dσ  ds,

0

(1.4.4)

30


for t ∈ R+ , then 



Zt

u (t) ≤ a (t) + e (t) 1 +

f (s) exp  0

 

Zs

[f (σ) + A (σ)]dσ ds ,

(1.4.5)

0

for t ∈ R+ , where 

Zt

f (s) a (s) +

e (t) =



Zs

0

k (s, σ)a (σ) dσ  ds,

(1.4.6)

0

and A(t) is defined by (1.4.3). Proof. (a1 ) Define a function z(t) by the right hand side of (1.4.1). Then z(0) = c, u (t) ≤ z (t) and  z 0 (t) = f (t) u (t) +



Zt

k (t, σ)u (σ) dσ  0





Zt

≤ f (t) z (t) +

k (t, σ)z (σ) dσ  .

(1.4.7)

0

Define a function v(t) by Zt v (t) = z (t) +

k (t, σ)z (σ) dσ.

(1.4.8)

0

Then v(0) = z(0) = c, z (t) ≤ v (t) , z 0 (t) ≤ f (t) v (t) and v(t) is nondecreasing for t ∈ R+ and 0

Zt

0

v (t) = z (t) + k (t, t) z (t) +

∂ k (t, σ)z (σ) dσ ∂t

0

Zt ≤ f (t) v (t) + k (t, t) v (t) +

∂ k (t, σ)v (σ) dσ ∂t

0



Zt

≤ f (t) + k (t, t) + 0

= [f (t) + A (t)] v (t) ,

 ∂ k (t, σ)dσ  v (t) ∂t

Chapter 1

31

implying 



Zt

v (t) ≤ c exp 

[f (σ) + A (σ)] dσ  .

(1.4.9)

0

Using (1.4.9) in (1.4.7) and integrating the resulting inequality from 0 to t, t ∈ R+ , we get   s   Zt Z z (t) ≤ c 1 + f (s) exp  [f (σ) + A (σ)]dσ ds . (1.4.10) 0

0

The desired inequality in (1.4.2) follows by using (1.4.10) in u (t) ≤ z (t) . (a2 ) Define a function z(t) by   Zt Zs z (t) = f (s) u (s) + k (s, σ) u (σ) dσ ds. 0

(1.4.11)

0

Then from (1.4.4), u (t) ≤ a (t) + z (t) and using this in (1.4.11) we get   Zt Zs z (t) ≤ f (s) a (s) + z (s) + k (s, σ) (a (σ) + z (σ)) dσ ds 0

0



Zt

f (s) z (s) +

= e (t) + 0



Zs

k (s, σ) z (σ) dσ ds,

(1.4.12)

0

where e(t) is defined by (1.4.6). Clearly e(t) is nonnegative, continuous and nondecreasing for t ∈ R+ . First we assume that e(t) > 0 for t ∈ R+ . From (1.4.12) it is easy to observe that   Zt Zs z (s) z (t) z (σ) ≤ 1 + f (s)  + k (s, σ) dσ ds. (1.4.13) e (t) e (s) e (σ) 0

0

Now, an application of the inequality in (a1 ) to (1.4.13) we have   s   Zt Z z (t)  ≤ 1 + f (s) exp  [f (σ) + A (σ)]dσ ds . e (t) 0

(1.4.14)

0

The desired inequality in (1.4.5) follows from (1.4.14) and the fact that u (t) ≤ a (t) + z (t). If e (t) ≥ 0, we carry out the above procedure with e (t) + ε instead of e (t), where ε > 0 is an arbitrary small constant, and subsequently pass to the limit as ε → 0 to obtain (1.4.5).

32


Remark 1.4.1. We note that in the special case when k(t, s) = k(s), the inequality given in (a1 ) reduces to the inequality established earlier by Pachpatte, see [34, p. 33]. For a number of inequalities involving iterated integrals and their applications, see [3,34]. In [9] Bykov and Salpagarov proved the inequalities in the following theorem. Theorem 1.4.2. Let u (t) ∈ C (R+ , R+ ) , k (t, R+ ) , h (t, s, σ) ∈ s) ∈ C (D, 2 D = (t, s) ∈ R : C (E,R+ ) and c ≥ 0 be a constant, where + 0≤s≤t 0, g (s)

(1.4.24)

r0

r0 > 0 is arbitrary, G−1 is the inverse of G, B(t) is given by (1.4.17) and t1 ∈ R+ is chosen so that Zt G (a (t)) +

B (s) ds ∈ Dom G−1 ,

0

for all t ∈ R+ lying in the interval 0 ≤ t ≤ t1 . (c2 ) Let

∂ ∂ ∂t k (t, s) , ∂t h (t, s, σ)

be as in Theorem 1.4.2, part (b2 ). If

Zt u (t) ≤ a (t)+

Zt k (t, s) g (u (s)) ds +

0

0

 s  Z  h (t, s, σ) g (u (σ)) dσ  ds, (1.4.25) 0

34


for t ∈ R+ , then for 0 ≤ t ≤ t2 ; t, t2 ∈ R+ ,   Zt u (t) ≤ G−1 G (a (t)) + [R (s) + Q (s)] ds ,

(1.4.26)

0

where G, G−1 are as defined in part (c2 ), R(t), Q(t) are given by (1.4.20), (1.4.21) and t2 ∈ R+ is chosen so that Zt G (a (t)) +

[R (s) + Q (s)] ds ∈ Dom G−1 ,

0

for all t ∈ R+ lying in the interval 0 ≤ t ≤ t2 . Proof. First we note that, since a0 (t) ≥ 0, the function a(t) is monotonically increasing. (c1 ) Let a(t) > 0 for t ∈ R+ and define a function z(t) by the right hand side of (1.4.22). Then z(t) > 0, z(0) = a(0), u (t) ≤ z (t), a (t) ≤ z (t), z(t) is nondecreasing for t ∈ R+ and 0

Zt

0

z (t) = a (t) + b (t) g (u (t)) +

k (t, τ ) g (u (τ ))dτ 0

 t Z +

Zτ

h (t, τ, σ) g (u (σ))dσ dτ

 0



0

Zt

0

≤ a (t) + b (t) g (z (t)) +

k (t, τ ) g (z (τ ))dτ 0

Zt +



h (t, τ, σ) g (z (σ))dσ dτ

 0



Zτ 0

0

≤ a (t) + B (t) g (z (t)) . Now by following the same arguments as in the proof of Theorem 1.2.1 below the inequality (1.2.5) we get the required inequality in (1.4.23). (c2 ) Let a(t) > 0 for t ∈ R+ and define a function z(t) by the right hand side of (1.4.25). Then z(t) > 0, z(0) = a(0), u (t) ≤ z (t) , a (t) ≤ z (t) . In view of the hypotheses, it is easy to observe that z(t) is nondecreasing and 0

0

Zt

z (t) = a (t) + k (t, t) g (u (t)) + 0

∂ k (t, s) g (u (s)) ds ∂t

Chapter 1

35

Zt +

Zt h (t, t, σ) g (u (σ))dσ +

0

  t Z  ∂ h (t, s, σ) g (u (σ))dσ ds ∂t

0

Zt

0

≤ a (t) + k (t, t) g (z (t)) +

0

∂ k (t, s) g (z (s)) ds ∂t

0

Zt +

Zt h (t, t, σ) g (z (σ))dσ +

0

  t Z ∂  h (t, s, σ) g (z (σ))dσ ds ∂t

0

0

0

≤ a (t) + [R (t) + Q (t)] g (z (t)) . The remaining proof can be completed by following the proof of Theorem 1.2.1. Remark 1.4.2. As a consequence of Theorem 1.4.3, if we take g(u) = u, then G (r) = log rr0 , G−1 (r) = r0 exp (r) and the bounds obtained in (1.4.23) and (1.4.26) reduces respectively to  t  Z u (t) ≤ a (t) exp  B (s) ds ,

(1.4.27)

0

and 



Zt

u (t) ≤ a (t) exp 

[R (s) + Q (s)] ds ,

(1.4.28)

0

for t ∈ R+ . Furthermore, if we take a(t) = c, a nonnegative constant, then we get the inequalities in Theorem 1.4.2 established by Bykov and Salpagarov in [9]. Before giving the next result, we introduce some notations to simplify the details of presentation. Let I = [0, α) be the given subset of R and for i = 1, ..., n, let Ii = (t1 , ..., ti ) : (t1 , ..., ti ) ∈ I i . For i = 1, ..., n and any functions w (t) , a (t) , b (t) ∈ C (I, R+ ) , Li (t1 , ..., ti , w (ti )) , Mi (t1 , ..., ti , a (ti )) ∈ C (Ii × R+ , R+ ) and t ∈ I we set Zt Fi [w] (t) = 0

 t  ti−1   Z1 Z  ...  Li (t1 , ..., ti , w (ti )) dti  ... dt1 , 0

0

Zt E (t) = L1 (t, a (t)) +

L2 (t, t2 , a (t2 )) dt2 + ... 0

36

Integral inequalities in one variable Zt +



Zt2

 0

 tn−1   Z ...  Ln (t, t2 , ..., tn , a (tn )) dtn  dtn−1 ... dt2 ,

0

0

Zt H (t) = M1 (t, a (t)) b (t) +

M2 (t, t2 , a (t2 )) b (t2 ) dt2 + ... 0

Zt +



Zt2

 0

   tn−1 Z Mn (t, t2 , ..., tn , a (tn )) b (tn ) dtn  dtn−1 ... dt2 . ... 

0

0

The following theorem deals with the inequalities established by Pachpatte in [78]. Theorem 1.4.4.

Let u (t) , a (t) , b (t) ∈ C (I, R+ ) .

(d1 ) For i = 1, ..., n, let the functions Li ∈ C (Ii × R+ , R+ ) satisfy the conditions 0 ≤ Li (t1 , ..., ti , x (ti )) − Li (t1 , ..., ti , y (ti )) ≤ Mi (t1 , ..., ti , y (ti )) (x (ti ) − y (ti )) ,

(1.4.29)

for (t1 , ..., ti ) ∈ Ii and x (ti ) ≥ y (ti ) ≥ 0, where Mi ∈ C (Ii × R+ , R+ ). If u (t) ≤ a (t) + b (t)

n X

Fi [u] (t) ,

(1.4.30)

i=1

for t ∈ I, then Zt u (t) ≤ a (t) + b (t)

 t  Z E (t1 ) exp  H (σ) dσ  dt1 ,

(1.4.31)

t1

0

for t ∈ I. (d2 ) Let ψ ∈ C (R+ , R+ ) be a strictly increasing function with ψ (0) = 0. For i = 1, ..., n let the functions Li ∈ C (Ii × R+ , R+ ) satisfy the conditions 0 ≤ Li (t1 , ..., ti , x (ti )) − Li (t1 , ..., ti , y (ti )) ≤ Mi (t1 , ..., ti , y (ti )) ψ −1 (x (ti ) − y (ti )) ,

(1.4.32)

for (t1 , ..., ti ) ∈ Ii and x (ti ) ≥ y (ti ) ≥ 0,where Mi ∈ C (Ii × R+ , R+ ) and ψ −1 is the inverse function of ψ. If ! n X Fi [u] (t) , (1.4.33) u (t) ≤ a (t) + ψ b (t) i=1

Chapter 1

37

for t ∈ I, then 

Zt

u (t) ≤ a (t) + ψ b (t)

 t   Z E (t1 ) exp  H (σ) dσ  dt1  ,

(1.4.34)

t1

0

for t ∈ I. (d3 ) Let Li , Mi , ψ, ψ −1 be as in part (d2 )and the conditions in (1.4.32) hold. Suppose in addition that ψ −1 (xy) ≤ ψ −1 (x) ψ −1 (y) ,

(1.4.35)

for all x, y ∈ R+ . If u (t) ≤ a (t) + b (t) ψ

n X

! Fi [u] (t) ,

(1.4.36)

i=1

for t ∈ I, then  t    t Z Z u (t) ≤ a (t) + b (t) ψ  E (t1 ) exp  H1 (σ) dσ  dt1  ,

(1.4.37)

t1

0

for t ∈ I, where H1 (t) is obtained by replacing b by ψ −1 (b) on the right hand side of the definition of H(t). (d4 ) For i = 1, ..., n, let Li , Mi be as in part (d1 ) and the conditions (1.4.29) hold. Let g ∈ C (R+ , R+ ) be a nondecreasing function with g(u) > 0 for u > 0. If ! n X Fi [u] (t) , (1.4.38) u (t) ≤ a (t) + b (t) g i=1

for t ∈ I, then for 0 ≤ t ≤ t¯; t, t¯ ∈ I,   ¯ (t) + u (t) ≤ a (t) + b (t) g G−1 G E

Zt

 H (t1 ) dt1  ,

(1.4.39)

0

where ¯ (t) = E

Zt E (t1 ) dt1

(1.4.40)

0

G, G

−1

are as defined in Theorem 1.4.3, part (c1 ) and t¯ ∈ I is chosen so that

¯ (t) + G E

Zt

H (t1 ) dt1 ∈ Dom G−1 ,

0

for all t ∈ I lying in the interval 0 ≤ t ≤ t¯.

38

Integral inequalities in one variable (d1 ) Define a function z(t) by

Proof.

z (t) =

n X

Fi [u] (t)

i=1

Zt

Zt L1 (t1 , u (t1 )) dt1 +

= 0



Zt1

L2 (t1 , t2 , u (t2 )) dt2  dt1 + ...

 0



0

 tn−1   Z Zt1 Z +  ...  Ln (t1 , ...tn , u (tn )) dtn  dtn−1 ...dt1 .  t

0

0

(1.4.41)

0

Then z(0) = 0, z(t) is nondecreasing for t ∈ I and (1.4.30) can be restated as u (t) ≤ a (t) + b (t) z (t) .

(1.4.42)

From (1.4.41), (1.4.42) and the hypotheses we observe that Zt

0

z (t) = L1 (t, u (t)) +

L2 (t, t2 , u (t2 ))dt2 + ... 0

 tn−1   Z Zt2 Z +  ...  Ln (t, t2 , ...tn , u (tn )) dtn  dtn−1 ...dt2 .  t

0

0

0

≤ {L1 (t, a (t) + b (t) z (t)) − L1 (t, a (t))} + L1 (t, a (t)) Zt [{L2 (t, t2 , a (t2 ) + b (t2 ) z (t2 )) − L2 (t, t2 , a (t2 ))}

+ 0

+L2 (t, t2 , a (t2 ))] dt2 + ...  tn−1  Zt Zt2 Z +  ...  [{Ln (t, t2 , ...tn , a (tn ) + b (tn ) z (tn )) 0

0

0

−Ln (t, t2 , ...tn , a (tn ))} + Ln (t, t2 , ...tn , a (tn ))] dtn ) dtn−1 ...) dt2 ≤ E (t) + M1 (t, a (t)) b (t) z (t) Zt M2 (t, t2 , a (t2 )) b (t2 )z (t2 ) dt2 + ...

+ 0

Zt + 0

  t  tn−1  Z2 Z  ...  Mn (t, t2 , ...tn , a (tn )) b (tn ) z (tn )dtn  dtn−1 ... dt2 0

0

Chapter 1 ≤ E (t) + H (t) z (t) .

39 (1.4.43)

The inequality (1.4.43) yields  t  Zt Z z (t) ≤ E (t1 ) exp  H (s) ds dt1 .

(1.4.44)

t1

0

The desired inequality in (1.4.31) follows from (1.4.42) and (1.4.44). (d2 ) Define a function z(t) by (1.4.41).Then z(0) = 0, z(t) is nondecreasing for t ∈ I and (1.4.33) can be restated as u (t) ≤ a (t) + ψ (b (t) z (t)) .

(1.4.45)

By following a similar argument as in the proof of part (d1 ) with suitable changes, see also [12,34] we obtain (1.4.44).Using (1.4.44) in (1.4.45) we get the required inequality in (1.4.34). (d3 ) Define a function z(t) by (1.4.41). Then z(0) = 0, z(t) is nondecreasing for t ∈ I and (1.4.36) can be restated as u (t) ≤ a (t) + b (t) ψ (z (t)) .

(1.4.46)

Now by following a similar argument as in the proof of part (d1 ) with suitable modifications, we obtain  t  Zt Z z (t) ≤ E (t1 ) exp  H1 (s) ds dt1 . (1.4.47) t1

0

Using (1.4.47) in (1.4.46) we get (1.4.37). (d4 ) Define a function z(t) by (1.4.41). Then z(0) = 0, z(t) is nondecreasing for t ∈ I and (1.4.38) can be restated as u (t) ≤ a (t) + b (t) g (z (t)) .

(1.4.48)

From (1.4.41), (1.4.48), (1.4.29) and following the proof of part (d1 ) we get z 0 (t) ≤ E (t) + H (t) g (z (t)) , which yields ¯ (t) + z (t) ≤ E

Zt H (t1 ) g (z (t1 )) dt1 . 0

(1.4.49)

40


By following the same arguments as in the proof of Theorem 2.4.2 given in [34] we get   Zt ¯ (t) + H (t1 ) dt1  . (1.4.50) z (t) ≤ G−1 G E 0

Using (1.4.50) in (1.4.48) we get (1.4.39). The subinterval 0 ≤ t ≤ t¯ is obvious. Remark 1.4.3. If we take L1 = L, Li = 0 for i = 1, ..., n and the interval I = [α, β) in Theorem 1.4.4, then we recapture the inequalities in Lemma 74, Theorem 81, Theorem 85, Theorem 91 given in [12] respectively. Here it is to be noted that, one can very easily obtain from Theorem 1.4.4 the corollaries similar to those of various corollaries of the corresponding results given in [12] which can be used in certain applications.We also note that, in view of the results given in Theorem 1.3.2, the inequalities in Theorem 1.4.4 can be extended when the function u(t) on the left sides in (1.4.30), (1.4.33), (1.4.36), (1.4.38) is replaced by up (t), where p > 1 is a real constant.

1.5 Bounds on certain integral inequalities The classical integral inequalities which give explicit bounds for an unknown function have played a fundamental role in establishing the foundations of the theory of differential and integral equations. In this section we shall give explicit bounds on certain integral inequalities which will be equally important to achieve a diversity of desired goals in some applications. In what follows, I = [α, β] is a given subset of R and D = (t, s) ∈ I 2 : α ≤ s ≤ t ≤ β . The following three theorems give the inequalities established by Pachpatte in [52,54,70,75]. Theorem 1.5.1.

Let u (t) , a (t) , b (t) , f (t) , g (t) ∈ C (I, R+ ) .

(a1 ) Let a(t) be continuously differentiable on I, a0 (t) ≥ 0 and Zβ

Zt u (t) ≤ a (t) +

b (s) u (s) ds + α

c (s) u (s) ds,

(1.5.1)

α

for t ∈ I. If Zβ p1 = α

 s  Z c (s) exp  b (σ) dσ ds < 1, α

(1.5.2)

Chapter 1

41

then 



Zt

u (t) ≤ M1 exp 

Zt

b (s) ds + α

 t  Z a0 (s) exp  b (σ) dσ  ds,

α

(1.5.3)

s

for t ∈ I, where  s  s     Zβ Z Z 1  M1 = a (α) + c (s)  a0 (τ ) exp  b (σ) dσ  dτ  ds . (1.5.4) 1 − p1 α

α

τ

(a2 ) Suppose that Zβ

Zt u (t) ≤ a (t) + b (t)

f (s) u (s) ds + c (t) α

g (s) u (s) ds.

(1.5.5)

α

for t ∈ I. If Zβ p2 =

g (s) K2 (s)ds < 1,

(1.5.6)

u (t) ≤ K1 (t) + M2 K2 (t) ,

(1.5.7)

α

then

for t ∈ I, where 

Zt K1 (t) = a (t) + b (t)

Zt

f (τ )a (τ ) exp  α

f (σ) b (σ) dσ  dτ,

(1.5.8)

τ



Zt K2 (t) = c (t) + b (t)



Zt

f (τ )c (τ ) exp  α

 f (σ) b (σ) dσ  dτ,

(1.5.9)

τ

and 1 M2 = 1 − p2

Zβ g (s) K1 (s) ds.

(1.5.10)

α

Proof. (a1 ) Define a function z(t) by the right hand side of (1.5.1). Then u (t) ≤ z (t) , Zβ z (α) = a (α) +

c (s) u (s) ds, α

(1.5.11)

42


and z 0 (t) = a0 (t) + b (t) u (t) ≤ a0 (t) + b (t) z (t) , which implies  t  t   t Z Z Z u (t) ≤ z (t) ≤ z (α) exp  b (σ) dσ  + a0 (s) exp  b (σ) dσ  ds. (1.5.12) α

α

s

From (1.5.11) and (1.5.12)we have   s   s   Zβ Z Zs Z   z (α) ≤ a (α)+ c (s) z (α) exp  b (σ) dσ  + a0 (τ ) exp  b (σ)dσ  dτ ds,   α

α

α

τ

i.e.,

z (α)

 

Zβ 1−



α

Zβ ≤ a (α) +

 s   Z  c (s) exp  b (σ)dσ ds  α



Zs

c (s)  α

 a0 (τ ) exp 

α

Zs





b (σ) dσ  dτ ds, τ

which implies z (α) ≤ M1 .

(1.5.13)

Using (1.5.13) in (1.5.12) we get the desired inequality in (1.5.3). (a2 ) Let Zt f (s) u (s) ds,

z (t) =

(1.5.14)

α

Zβ λ=

g (s) u (s) ds.

(1.5.15)

α

Then z(0) = 0, (1.5.5) can be restated as u (t) ≤ a (t) + b (t) z (t) + c (t) λ,

(1.5.16)

z 0 (t) = f (t) u (t) .

(1.5.17)

and

Chapter 1

43

From (1.5.16) and (1.5.17) we have z 0 (t) ≤ {f (t) a (t) + λf (t) c (t)} + f (t) b (t) z (t) , which implies 

Zt z (t) ≤

{f (τ ) a (τ ) + λf (τ ) c (τ )} exp  α



Zt

f (σ) b (σ) dσ  dτ.

(1.5.18)

τ

Using (1.5.18) in (1.5.16) we get Zt {f (τ ) a (τ ) + λf (τ ) c (τ )}

u (t) ≤ {a (t) + λc (t)} + b (t) α





Zt

× exp 

f (σ) b (σ) dσ  dτ τ

= K1 (t) + λK2 (t) .

(1.5.19)

From (1.5.15) and (1.5.19) as in the proof of (a1 ) it is easy to observe that λ ≤ M2 .

(1.5.20)

Using (1.5.20) in (1.5.19) we get 1.5.7). Remark 1.5.1. If we take a(t) = d (a constant) and hence a0 (t) = 0, then the inequality given in (a1 ) reduces to the special version of inequality given by Bainov and Simeonov in [3, p. 11] in case u(t) and d therein are nonnegative. The inequality in (a2 ) is a variant of the inequality given by Gamidov in [15, Lemma 1.2]. Theorem 1.5.2. (b1 ) Let

Let u (t) , a (t) , c (t) ∈ C (I, R+ )

∂ ∂t h (t, s)

∈ C (D, R+ ) and Zβ

Zt u (t) ≤ a (t) +

h (t, s) u (s) ds + α

c (s) u (s) ds,

(1.5.21)

α

for t ∈ I. If Zβ p3 = α

 s  Z c (s) exp  B (σ) dσ ds < 1, α

(1.5.22)

44


then 



Zt

u (t) ≤ a (t)+M3 exp 

Zt

B (σ) dσ  + α

 t  Z A (s) exp  B (σ) dσ  ds, (1.5.23)

α

s

for t ∈ I, where Zt A (t) = h (t, t) a (t) +

∂ h (t, s) a (s) ds, ∂t

(1.5.24)

α

Zt B (t) = h (t, t) +

∂ h (t, s) ds, ∂t

(1.5.25)

α

and M3 =

1 1 − p3

Zβ



Zs

c (s) a (s) + α

 s   Z A (τ ) exp  B (σ) dσ  dτ ds. (1.5.26)

α

τ

(b2 ) Let h (t, s) , g (t, s) ∈ C (D, R+ ) and be nondecreasing in t ∈ I, for each s ∈ I and Zβ

Zt u (t) ≤ k +

h (t, s) u (s) ds + α

g (t, s) u (s) ds,

(1.5.27)

α

for t ∈ I, where k ≥ 0 is a constant. If Zβ

 g (t, s) exp 

p (t) = α



Zs

h (s, σ) dσ ds < 1,

(1.5.28)

α

for t ∈ I, then  u (t) ≤

k exp  1 − p (t)



Zt

h (t, s) ds ,

(1.5.29)

α

for t ∈ I. Proof. Define a function z(t) by Zβ

Zt h (t, s) u (s) ds +

z (t) = α

c (s) u (s) ds. α

(1.5.30)

Chapter 1

45

Then z(t) is nondecreasing for t ∈ I, (1.5.21) can be restated as u (t) ≤ a (t) + z (t) ,

(1.5.31)

Zβ z (α) =

c (s) u (s) ds,

(1.5.32)

α

and Zt

0

z (t) = h (t, t) u (t) +

∂ h (t, s) u (s) ds ∂t

0

Zt ≤ h (t, t) {a (t) + z (t)} +

∂ h (t, s) {a (s) + z (s)} ds ∂t

0

≤ A (t) + B (t) z (t) , which implies  t   t  Z Zt Z z (t) ≤ z (α) exp  B (σ) dσ  + A (s) exp  B (σ) dσ ds. (1.5.33) α

α

s

The rest of the proof can be completed by following the proof of Theorem 1.5.1. (b2 ) Fix any T , α ≤ T ≤ β, then for α ≤ t ≤ T we have Zβ

Zt u (t) ≤ k +

h (T, s) u (s) ds + α

g (T, s) u (s) ds.

(1.5.34)

α

Define a function z(t, T ), α ≤ t ≤ T by the right hand side of (1.5.34). Then u (t) ≤ z (t, T ) , α ≤ t ≤ T , Zβ g (T, s) u (s) ds,

z (α, T ) = k +

(1.5.35)

α

and D1 z (t, T ) = h (T, t) u (t) ≤ h (T, t) z (t) ,

(1.5.36)

for α ≤ T . By setting t = σ in (1.5.36) and integrating it with respect to σ from α to T we get  T  Z z (T, T ) ≤ z (α, T ) exp  h (T, σ) dσ  . (1.5.37) α

46


Since T is arbitrary,from (1.5.37) and (1.5.35) with T replaced by t and u (t) ≤ z (t, t) we have   t Z (1.5.38) u (t) ≤ z (α, t) exp  h (t, σ) dσ  , α

where Zβ z (α, t) = k +

g (t, s) u (s) ds.

(1.5.39)

α

Using (1.5.38) on the right hand side of (1.5.39) and in view of the condition (1.5.28) it is easy to observe that k . 1 − p (t)

z (α, t) ≤

(1.5.40)

Using (1.5.40) in (1.5.38) we get the desired inequality in (1.5.29). Remark 1.5.2. In the special case when c(t) = 0, the inequality in (b1 ) reduces to the inequality given in [3, Theorem 1.8, p. 11]. The inequality in (b2 ) is a useful variant of the inequality given in [3, Theorem 1.7, p.11]. Theorem 1.5.3.

Let u (t) ∈ C (I, R+ ) and k ≥ 0 be a real constant.

(c1 ) Let a (t, s) , b (t, s) , c (t, s) ∈ C (D, R+ ); a(t, s), b(t, s) are nondecreasing in t for each s ∈ I and   Zt Zs Zβ   u (t) ≤ k+ a (t, s) u (s) + c (s, σ) u (σ) dσ ds+ b (t, s) u (s) ds (1.5.41) α

α

α

for t ∈ I. If Zβ q (t) =

 s  Z b (t, s) exp  E (s, ξ) dξ ds < 1,

α

(1.5.42)

α

for t ∈ I, where 

Zξ

 c (ξ, σ) dσ  ,

(1.5.43)

 t  Z k exp  E (t, ξ) dξ  , u (t) ≤ 1 − q (t)

(1.5.44)

E (t, ξ) = a (t, ξ) 1 + α

for (t, ξ) ∈ D, then

α

for t ∈ I.

Chapter 1

47

(c2 ) Let f (t) , g (t) , h (t) ∈ C (I, R+ ) and 

Zt u (t) ≤ k +

Zβ

Zs

f (s) u (s) + α

g (σ) u (σ) dσ + α

 h (σ) u (σ) dσ ds, (1.5.45)

α

for t ∈ I. If Zβ r=

 s  Z h (σ) exp  [f (τ ) + g (τ )]dτ dσ < 1,

α

(1.5.46)

α

then  t  Z k exp  [f (s) + g (s)] ds , u (t) ≤ 1−r

(1.5.47)

α

for t ∈ I. Proof. (c1 ) Let k > 0 and fix any T ∈ I, then for α ≤ t ≤ T, from (1.5.41) we have   Zt Zs u (t) ≤ k + a (T, s) u (s) + c (s, σ) u (σ) dσ  ds α

α

Zβ +

b (T, s) u (s) ds.

(1.5.48)

α

Define a function z(t, T ), t ∈ [α, T ] by the right hand side of (1.5.48). Then for t ∈ [α, T ] , u (t) ≤ z (t, T ) , z(t, T ) > 0, Zβ z (α, T ) = k +

b (T, s) u (s) ds,

(1.5.49)

α

and 



Zt

D1 z (t, T ) = a (T, t) u (t) +

c (t, σ) u (σ) dσ  α



Zt

≤ a (T, t) z (t) +

 c (t, σ) z (σ, T ) dσ  .

α

(1.5.50)

48


From (1.5.50) and using the fact that z(t, T ) is nondecreasing in t, it is easy to observe that   Zt D1 z (t, T ) ≤ a (T, t) 1 + c (t, σ) dσ  , (1.5.51) z (t, T ) α

for t ∈ [α, T ]. By setting t = ξ in (1.5.51) and integrating it with respect to ξ from α to T we get     T Z Zξ (1.5.52) z (T, T ) ≤ z (α, T ) exp  a (T, ξ) 1 + c (ξ, σ) dσ  dξ  . α

α

Since T is arbitrary, from (1.5.52), (1.5.49) with T replaced by t we have for t ∈ I,   t Z (1.5.53) z (t, t) ≤ z (α, t) exp  E (t, ξ) dξ  , α

Zβ z (α, t) = k +

b (t, s) u (s) ds.

(1.5.54)

α

Using (1.5.53) in u (t) ≤ z (t) we get  t  Z u (t) ≤ z (α, t) exp  E (t, ξ) dξ  ,

(1.5.55)

α

for t ∈ I. Using (1.5.55) on the right hand side of (1.5.54) and in view of (1.5.42), it is easy to observe that z (α, t) ≤

k . 1 − q (t)

(1.5.56)

The required inequality in (1.5.44) follows by using (1.5.56) in (1.5.55). If k ≥ 0, we carry out the above procedure with k + ε instead of k where ε > 0 is an arbitrary small constant, and subsequently pass to the limit as ε → 0 to obtain (1.5.44). (c2 ) Define a function z(t) by the right hand side of (1.5.45). Then z(0) = 0, u (t) ≤ z (t) and  z 0 (t) = f (t) u (t) +

Zβ

Zt g (σ) u (σ) dσ + α

 h (σ) u (σ) dσ 

α

Chapter 1 

49 Zβ

Zt

≤ f (t) z (t) +

g (σ) z (σ) dσ + α

 h (σ) z (σ) dσ  ,

(1.5.57)

α

for t ∈ I. Define a function v(t) by Zβ

Zt g (σ) z (σ) dσ +

v (t) = z (t) + α

h (σ) z (σ) dσ,

(1.5.58)

α

then z (t) ≤ v (t), z 0 (t) ≤ f (t) v (t) , Zβ h (σ) z (σ) dσ, .

v (α) = k +

(1.5.59))

α

and v 0 (t) = z 0 (t) + g (t) z (t) ≤ f (t) v (t) + g (t) z (t) ≤ [f (t) + g (t)] v (t) , which implies  t  Z v (t) ≤ v (α) exp  [f (s) + g (s)] ds ,

(1.5.60)

α

for t ∈ I. Using (1.5.60) in z (t) ≤ v (t) we get  t  Z z (t) ≤ v (α) exp  [f (s) + g (s)] ds ,

(1.5.61)

α

for t ∈ I. Using (1.5.61) on the right hand side of (1.5.59) and in view of (1.5.46) it is easy to observe that v (α) ≤

k . 1−r

(1.5.62)

Using (1.5.62) in (1.5.61) and the fact that u (t) ≤ z (t) we get the desired inequality in (1.5.47). In the following theorem we present the inequalities established in [51] (see also [44]). Theorem 1.5.4.

Let u (t) , a (t) , b (t) ∈ C (R+ , R+ ) .

50

Integral inequalities in one variable (d1 ) Let a(t) be nonincreasing for t ∈ R+ . If Z∞ u (t) ≤ a (t) +

b (s) u (s) ds,

(1.5.63)

t

for t ∈ R+ , then ∞  Z u (t) ≤ a (t) exp  b (s) ds ,

(1.5.64)

t

for t ∈ R+ . 2 (d2 ) Let L ∈ C R+ , R+ and 0 ≤ L (t, u) − L (t, v) ≤ M (t, v) (u − v) , 2 , R+ . If for u ≥ v ≥ 0, where M ∈ C R+ Z∞ u (t) ≤ a (t) +

(1.5.65)

Z∞ b (s) u (s) ds+

t

L (s, u (s)) ds,

(1.5.66)

t

for t ∈ R+ , then ∞  Z u (t) ≤ F (t) a (t) + G (t) exp  M (s, F (s) a (s)) F (s) ds , (1.5.67) 

t

for t ∈ R+ , where ∞  Z F (t) = exp  b (s) ds ,

(1.5.68)

t

Z∞ L (s, F (s) a (s)) ds,

G (t) =

(1.5.69)

t

for t ∈ R+ . (d3 ) Let L and M be as in (d2 ). If Z∞ u (t) ≤ a (t) + b (t)

L (s, u (s)) ds, t

(1.5.70)

Chapter 1

51

for t ∈ R+ , then  ∞ Z u (t) ≤ a (t) + b (t) e (t) exp  M (s, a (s)) b (s) ds ,

(1.5.71)

t

for t ∈ R+ , where Z∞ e (t) =

L (s, a (s)) ds,

(1.5.72)

t

for t ∈ R+ . Proof. (d1 ) First we assume that a(t) > 0 for t ∈ R+ . From (1.5.63) it is easy to observe that Z∞ u (t) u (s) ≤ 1 + b (s) ds. (1.5.73) a (t) a (s) t

Define a function z(t) by the right hand side of (1.5.73), then z (∞) = 1, u(t) a(t) ≤ z (t) and z 0 (t) = −b (t)

u (t) ≥ −b (t) z (t) . a (t)

The inequality (1.5.74) implies the estimate ∞  Z z (t) ≤ exp  b (s) ds .

(1.5.74)

(1.5.75)

t

Using (1.5.75) in

u(t) a(t)

≤ z (t) , we get the desired inequality in (1.5.64).

If a(t) is nonnegative, we carry out the above procedure with a (t) + ε instead of a(t), where ε > 0 is an arbitrary small constant, and subsequently pass to the limit as ε → 0 to obtain (1.5.64). (d2 ) Define a function z(t) by Z∞ L (s, u (s)) ds,

z (t) =

(1.5.76)

t

then (1.5.66) can be restated as Z∞ u (t) ≤ a (t) + z (t) +

b (s) u (s) ds. t

(1.5.77)

52


Since a(t) + z(t) is nonnegative, continuous and nonincreasing for t ∈ R+ , by applying the inequality in part (d1 ) to (1.5.77) we have u (t) ≤ (a (t) + z (t)) F (t) .

(1.5.78)

From (1.5.76) and (1.5.78) and the hypotheses on L, we observe that Z∞ [L (s, F (s) a (s) + F (s) z (s)) − L (s, F (s) a (s)) + L (s, F (s) a (s))] ds

z (t) ≤ t

Z∞ ≤ G (t) +

M (s, F (s) a (s)) F (s) z (s) ds.

(1.5.79)

t

Clearly, G(t) is nonnegative, continuous and nonincreasing for t ∈ R+ . Now an application of the inequality in part (d1 ) to (1.5.79) yields  ∞ Z (1.5.80) z (t) ≤ G (t) exp  M (s, F (s) a (s)) F (s) ds . t

Using (1.5.80) in (1.5.78) we get the required inequality in (1.5.67). (d3 ) Define a function z(t) by (1.5.76). Then from (1.5.70) we have u (t) ≤ a (t) + b (t) z (t) .

(1.5.81)

From (1.5.76), (1.5.81) and the hypotheses on L, we observe that Z∞ [L (s, a (s) + b (s) z (s)) − L (s, a (s)) + L (s, a (s))]ds

z (t) ≤ t

Z∞ ≤ e (t) +

M (s, a (s)) b (s) z (s) ds,

(1.5.82)

t

where e(t) is defined by (1.5.72). Clearly e(t) is real-valued, nonnegative, continuous and nonincreasing for t ∈ R+ . An application of the inequality in part (d1 ) to (1.5.82) yields  ∞ Z (1.5.83) z (t) ≤ e (t) exp  M (s, a (s)) b (s) ds . t

The desired inequality in (1.5.71) follows from (1.5.81) and (1.5.83).

Chapter 1

53

1.6 Applications The study of various types of differential and integral equations has led to the investigation of a number of inequalities contained in earlier sections (see also [51,55,75,78]). In this section we present applications of some of the inequalities contained in sections 1.2-1.5 to study the qualitative properties of the solutions of certain differential and integral equations.

1.6.1 Nonlinear differential and integral equations First,consider the nonlinear integral equation of the form Zt

2

x (t) = f (t) +

F (t, s, x (s)) ds,

(1.6.1)

0

where f ∈ C (R+ , R) , F ∈ C (D × R+ , R) ; D is as in Theorem 1.2.1. Here we assume that every solution x(t) of (1.6.1) under discussion exists on R+ . As an application of the inequality given in Theorem 1.2.2, part (a1 ), we present the following theorem related to the solutions of equation (1.6.1) given in [55]. We list the following hypotheses on the functions f, F involved in (1.6.1): |f (t)| ≤ c, |F (t, s, x)| ≤ k (t, s) |x| ,

(1.6.2)

|f (t)| ≤ ce−αt , |F (t, s, x)| ≤ k (t, s) e−α(t− 2 s) |x| , 1

Q (t) =

√

c+

1 2

(1.6.3)

Zt A (s) ds < ∞,

(1.6.4)

0

where c, k(t, s), A(t) are as in Theorem 1.2.2 and α ≥ 0 is a real constant. Theorem 1.6.1. (i) Suppose that the hypotheses (1.6.2), (1.6.4) are satisfied. Then all solutions of equation (1.6.1) are bounded for t ∈ R+ . (ii) Suppose that the hypotheses (1.6.3), (1.6.4) are satisfied. Then all solutions of equation (1.6.1) approach zero as t → ∞.

54


Proof. (i) Let x(t), t ∈ R+ be a solution of equation (1.6.1). From (1.6.1) and (1.6.2) we have Zt

2

|x (t)| ≤ c +

k (t, s) |x (s)| ds.

(1.6.5)

0

An application of the inequality given in Theorem 1.2.2 to (1.6.5) yields |x (t)| ≤ Q (t) ,

(1.6.6)

for t ∈ R+ . From the hypothesis (1.6.4), the estimation in (1.6.6) implies the boundedness of the solution x(t) of equation (1.6.1) on R+ . (ii) Let x(t), t ∈ R+ be a solution of equation (1.6.1). Then from (1.6.1), (1.6.3) we have 2

−αt

|x (t)| ≤ ce

Zt +

k (t, s) e−α(t− 2 s) |x (s)| ds. 1

(1.6.7)

0

From (1.6.7) it is easy to observe that Zt 2 1 1 αt ≤ c + k (t, s) |x (s)| e 2 αs ds. |x (t)| e 2

(1.6.8)

0

Now applying the inequality given in Theorem 1.2.2,part (a1 ) to (1.6.8), and 1 then multiplying the resulting inequality by e− 2 αt , we obtain 1

|x (t)| ≤ Q (t) e− 2 αt ,

(1.6.9)

for t ∈ R+ . In view of the hypothesis (1.6.4), the inequality (1.6.9) yields the desired result. Next, we apply the inequality given in Theorem 1.3.3 (see [45]) to obtain a bound on the solution of the differential equation of the form xp−1 (t) x0 (t) = F (t, x (t)) , x (0) = x0 .

(1.6.10)

where x0 , p > 1 are constants and F ∈ C (R+ × R+ , R). Theorem 1.6.2.

Assume that

|F (t, x)| ≤ f (t) g (|x|) ,

(1.6.11)

for t ∈ R+ , where f and g are as in Theorem 1.3.3. Let x(t) be a solution of equation (1.6.10) on R+ . Then   p1  Zt   p , (1.6.12) |x (t)| ≤ H −1 H (|x0 | ) + p f (s) ds   0

for 0 ≤ t ≤ t1 ; t, t1 ∈ R+ , where H, H −1 are as in Theorem 1.3.3.

Chapter 1

55

Proof. It is easy to see that the solution x(t) of equation (1.6.10) satisfies the equivalent integral equation Zt

xp (t) xp0 − = p p

F (s, x (s)) ds.

(1.6.13)

0

From (1.6.13) and (1.6.11) we observe that p

Zt

p

|x (t)| ≤ |x0 | + p

f (s) g (|x (s)|) ds.

(1.6.14)

0

Now a suitable application of Theorem 1.3.3 (when h = 0) to (1.6.14) yields the desired bound in (1.6.12).

1.6.2 Iterated Volterra integral equation In this section, we present applications of the inequality given in Theorem 1.4.4, part (d1 ) which provide estimates for the solutions of Volterra integral equation of the form z (t) = f (t) +

n X

Gi [z] (t) ,

(1.6.15)

i=1

for t ∈ I, where Zt Gi [z] (t) = 0

 t  ti−1   Z1 Z  ...  ki (t, t1 , ..., ti , z (ti )) dti  ... dt1 , 0

0

f ∈ C (I, R) , ki ∈ C (I × Ii × R, R). Here we note that, our discussion uses the notations and definitions as used in Theorem 1.4.4. Theorem 1.6.3.

Suppose that the kernel functions ki for i = 1, ..., n satisfy

|ki (t, t1 , ..., ti , z (ti ))| ≤ b (t) Li (t1 , ..., ti , |z (ti )|) ,

(1.6.16)

for t ∈ I, (t1 , ..., ti ) ∈ Ii ,where b ∈ C (I, R+ ) , Li be as in Theorem 1.4.4, part (d1 ) and verify the conditions in (1.4.29), Mi being the same as given therein. If z (t) ∈ C (I, R) is any solution of equation (1.6.15), then  t  Zt Z ¯ (t1 ) exp  H ¯ (σ)dσ  dt1 , |z (t)| ≤ |f (t)| + b (t) E (1.6.17) 0

t1

¯ (t) and H ¯ (t) are respectively given by the right hand sides of for t ∈ I, where E the definitions of E(t) and H(t) given in Section 1.4, by replacing a(t) by |f (t)|.

56


Proof. Let z (t) ∈ C (I, R) be a solution of equation (1.6.15). Using the fact that z(t) is a solution of (1.6.15) and (1.6.16) we observe that |z (t)| ≤ |f (t)| +

n X

|Gi [z] (t)|

i=1

≤ |f (t)| + b (t)

n X

Fi [|z|] (t).

(1.6.18)

i=1

Now a suitable application of the inequality given in Theorem 1.4.4, part (d1 ) to (1.6.18) yields (1.6.17). Suppose that the kernel functions ki for i = 1, ..., n satisfy

Theorem 1.6.4.

|ki (t, t1 , ..., ti , x (ti )) − ki (t, t1 , ..., ti , y (ti ))| ≤ b (t) Li (t1 , ..., ti , |x (ti ) − y (ti )|) ,

(1.6.19)

for t ∈ I, (t1 , ..., ti ) ∈ Ii , where b (t) ∈ C (I, R+ ), Li be as in Theorem 1.4.4, part (d1 ) and verify the conditions in (1.4.29), Mi being the same functions as given therein. If z (t) ∈ C (I, R) is any solution of equation (1.6.15), then  t  Zt Z (1.6.20) |z (t) − f (t)| ≤ e (t) + b (t) E0 (t1 ) exp  H0 (σ) dσ  dt1 , t1

0

for t ∈ I, where e (t) =

n Z X

t



Zt1

 i=1 0

 ti−1   Z ...  |ki (t, t1 , ..., ti , f (ti ))| dti  ... dt1 ,

0

0

E0 (t) and H0 (t) are respectively given by the right hand sides of the definitions of E (t) and H(t) given in Section 1.4, by replacing a(t) by e(t). Proof. Let z (t) ∈ C (I, R) be a solution of equation (1.6.15). Using the fact that z(t) is a solution of (1.6.15) and (1.6.19) we observe that  t  ti−1 Z1 Z n Zt X  ...  |ki (t, ti , ..., ti , z (ti )) |z (t) − f (t)| ≤ i=1 0

0

0

−ki (t, ti , ..., ti , f (ti )) + ki (t, ti , ..., ti , f (ti ))| dti ) ...) dt1 ≤ e (t) + b (t)

n X

Fi [|z − f |] (t) .

(1.6.21)

i=1

Now a suitable application of the inequality given in Theorem 1.4.4, part (d1 ) to (1.6.21) yields (1.6.20).

Chapter 1

57

1.6.3 General Volterra-Fredholm integral equation Consider the following general Volterra-Fredholm integral equation Zt

 F t, s, x (s) ,

x (t) = f (t) +



Zs

α

g (s, σ, x (σ)) dσ  ds α

Zβ h (t, s, x (s)) ds,

+

(1.6.22)

α

for t ∈ I, were x(t) is an unknown function, f ∈ C (I, Rn ) , g, h ∈ C (D × Rn , Rn ) , F ∈ C (D × Rn × Rn , Rn ) , in which I = [α, β], D = (t, s) ∈ I 2 : α ≤ s ≤ t ≤ β and Rn the n dimensional Euclidean space with norm |.| . Here we apply the inequality given in Theorem 1.5.3 to study certain properties of solutions of equation (1.6.22). The following results are proved by Pachpatte in [75]. Theorem 1.6.5. Suppose that the functions f, g, h, F in equation (1.6.22) satisfy the conditions |f (t)| ≤ k,

(1.6.23)

|g (t, s, x)| ≤ c (t, s) |x| ,

(1.6.24)

|h (t, s, x)| ≤ b (t, s) |x| ,

(1.6.25)

|F (t, s, x, y)| ≤ a (t, s) (|x| + |y|) ,

(1.6.26)

where a(t, s), b(t, s), c(t, s) and k are as given in Theorem 1.5.3. Let q(t) be as in (1.5.42). If x(t), t ∈ I is a solution of equation (1.6.22), then  t  Z k |x (t)| ≤ exp  E (t, ξ)dξ  , 1 − q (t) α

for t ∈ I, where E (t, ξ) is defined by (1.5.43).

(1.6.27)

58


Proof. Using the fact that x(t), t ∈ I is a solution of equation (1.6.22) and the hypotheses (1.6.23)-(1.6.26) we have   Zt Zs |x (t)| ≤ k + a (t, s) |x (s)| + c (s, σ) |x (σ)|dσ ds α

α

Zβ b (t, s) |x (s)| ds.

+

(1.6.28)

α

Now an application of Theorem 1.5.3 to (1.6.28) yields the required estimate in (1.6.27). Theorem 1.6.6. Suppose that the functions f, g, h, F in equation (1.6.22) satisfy the conditions |g (t, s, x) − g (t, s, y)| ≤ c (t, s) |x − y| ,

(1.6.29)

|h (t, s, x) − h (t, s, y)| ≤ b (t, s) |x − y| ,

(1.6.30)

|F (t, s, x, y) − F (t, s, x ¯, y¯)| ≤ a (t, s) (|x − x ¯| + |y − y¯|) ,

(1.6.31)

where a(t, s), b(t, s), c(t, s) are as in Theorem 1.5.3. Let q(t) be as in (1.5.42). Then the equation (1.6.22) has at most one solution on I. Proof. Let u(t) and v(t) be two solutions of equation (1.6.22) on I. Using these facts and hypotheses (1.6.29)-(1.6.31) we have   Zt Zs |u (t) − v (t)| ≤ a (t, s) |u (s) − v (s)| + c (s, σ) |u (σ) − v (σ)|dσ ds α

α

Zβ b (t, s) |u (s) − v (s)| ds.

+

(1.6.32)

α

Now a suitable application of Theorem 1.5.3 to (1.6.32) yields u(t) = v(t), t ∈ I i.e., there is at most one solution of equation (1.6.22) on I.

1.6.4 Terminal value problem In this section, we apply the inequality given in Theorem 1.5.4, part (d1 ) to study certain properties of solutions of the following terminal value problem u0 (t) = f (t, u (t)) + p (t) ,

(1.6.33)

u (∞) = u∞ ,

(1.6.34)

for t ∈ R+ , where f ∈ C (R+ × R, R) , p ∈ C (R+ , R) and u∞ ∈ R. For the exitence of solutions of problem (1.6.33)-(1.6.34) when p(t) = 0, see [3, p.80].

Chapter 1

59

In the following theorems we present some results on the behavior of solutions of problem (1.6.33)-(1.6.34) given in [51]. Theorem 1.6.7.

Suppose that

|f (t, u)| ≤ b (t) |u| ,

(1.6.35)

|u∞ − Q (t)| ≤ a (t) , where a(t), b(t) are as in Theorem 1.5.4, part (d1 ) and Q (t) =

(1.6.36) R∞

p (s) ds. If u(t),

t

t ∈ R+ is a solution of the problem (1.6.33)-(1.6.34), then ∞  Z |u (t)| ≤ a (t) exp  b (s) ds ,

(1.6.37)

t

for t ∈ R+ . Proof. The solution u(t) of the problem (1.6.33)-(1.6.34) can be written as (see [3, p. 80]) Z∞ u (t) = u∞ −

[f (s, u (s)) + p (s)] ds,

(1.6.38)

t

for t ∈ R+ . From (1.6.38), (1.6.35), (1.6.36) we observe that Z∞ b (s) |u (s)| ds.

|u (t)| ≤ a (t) +

(1.6.39)

t

Now an application of Theorem 1.5.4, part (d1 ) to (1.6.39) yields the required estimate in (1.6.37). Theorem 1.6.8. dition

(i) Suppose that the function f in (1.6.33) satisfies the con-

|f (t, u) − f (t, v)| ≤ b (t) |u − v| ,

(1.6.40)

where b(t) is as defined in Theorem 1.5.4. Then the problem (1.6.33)-(1.6.34) has at most one solution on R+ . (ii) Let u1 (t) and u2 (t), t ∈ R+ be the solutions of (1.6.33) with the given terminal conditions u1 (∞) = u1∞ ,

(1.6.41)

60


and u2 (∞) = u2∞ ,

(1.6.42)

respectively, where u1∞ , u2∞ ∈ R. Suppose that the function f in (1.6.33) satisfies the condition (1.6.40). Then the solutions of (1.6.33) depends on terminal values and ∞  Z (1.6.43) |u1 (t) − u2 (t)| ≤ |u1∞ − u2∞ | exp  b (s) ds , t

for t ∈ R+ . Proof. (i) The problem (1.6.33)-(1.6.34) is equivalent to the integral equation (1.6.38). Let u(t) and v(t) be two solutions of (1.6.33)-(1.6.34) on R+ . Using the facts that u(t) and v(t) are the solutions of (1.6.38) and the condition (1.6.40) we have Z∞ b (s) |u (s) − v (s)| ds.

|u (t) − v (t)| ≤

(1.6.44)

t

Now an application of Theorem 1.5.4, part (d1 ) (when a(t) = 0) to (1.6.44) yields u(t) = v(t) i.e., there is at most one solution to the problem (1.6.33)-(1.6.34) on R+ . (ii) By using the facts that u1 (t) and u2 (t), t ∈ R+ are the solutions of (1.6.33)-(1.6.41) and (1.6.33)-(1.6.42) respectively, we have Z∞ u1 (t) − u2 (t) = u1∞ − u2∞ −

[f (s, u1 (s)) − f (s, u2 (s))]ds.

(1.6.45)

t

From (1.6.45) and (1.6.40) we have Z∞ |u1 (t) − u2 (t)| ≤ |u1∞ − u2∞ | +

b (s) |u1 (s) − u2 (s)| ds.

(1.6.46)

t

Now an application of Theorem 1.5.4, part (d1 ) to (1.6.46) yields the required estimate in (1.6.43), which shows the dependency of solutions of (1.6.33) on terminal values.

Chapter 1

61

1.7 Notes The celebrated Gronwall’s inequality [16,6] and its nonlinear generalization due to Bihari [8] have a profound and enduring influence on the development of the theory of differential and integral equations. Section 1.2 deals with some such basic nonlinear integral inequalities recently appeared in the literature. Theorem 1.2.1 is due to Pachpatte [68], which is a useful generalization of the well known Bihari’s inequality [8], see also [34, p. 107]. The inequalities in Theorem 1.2.2 are taken from Pachpatte [55]. The results in Theorems 1.2.3-1.2.5 ˇ in [24], which gives estimates on integral are recently established by Medved inequalities with weakly singular kernel. Indeed, the roots of such an inequality can be found in the work of Henry [17] who proved some results concerning linear integral inequalities with weakly singular kernel. Section 1.3 deals with some more nonlinear integral inequalities which claim their origin in the inequalities given by Ou-Iang [33] and Deformos [10]. The inequalities in Theorems 1.3.11.3.4 are due to Pachpatte and taken from [35,45]. Section 1.4 contains some useful integral inequalities involving iterated integrals.The inequalities in Theorem 1.4.1 are due to Pachpatte [53]. Theorem 1.4.2 is taken from Bykov and Salpagarov [9]. The results in Theorems 1.4.3 and 1.4.4 are the further generalizations of the inequalities in Theorem 1.4.2 and are due to Pachpatte [79,78]. The results given in Section 1.5 deals with some specific inequalities which are more convenient in certain situations. Theorems 1.5.1-1.5.3 are due to Pachpatte [52,54,70,75],while Theorem 1.5.4 is taken from Pachpatte and Pachpatte [51]. The material in Section 1.6 is taken from [51,55,75,78] and devoted to the applications of the inequalities given in earlier sections.


Chapter 2

Integral inequalities in two variables 2.1 Introduction Inequalities involving functions of two or more independent variables, their partial derivatives and integrals play a fundamental role in the continuous development of the theory, methods and applications of partial differential and integral equations. In view of the wider applications, integral inequalities involving functions of two independent variables which furnish explicit known bounds have received considerable attention. Recently, different versions of such inequalities have been established, which are useful in the study of different classes of partial differential and integral equations. The main objective of this chapter is to present some useful integral inequalities in two independent variables recently appeared in the literature. These inequalities can be used as ready tools in the study of certain classes of partial differential and integral equations. We also give applications to convey the importance of some of these inequalities.

2.2 Some nonlinear integral inequalities Integral inequalities involving functions of two and more independent variables which provide explicit bounds on unknown functions have played a fundamental role in the study of certain partial differential and integral equations. In this section we present some basic nonlinear integral inequalities in two variables which can be used as convenient tools in some applications. The following theorem deals with a fairly general version of the inequality given by Pachpatte in [68]. 63

64

Integral inequalities in two variables

2 , R+ , Theorem 2.2.1. Let u (x, y) , a (x, y) , D1 a (x, y) , D2 a (x, y) ∈ C R+ k (x, y, s, t) ∈ C (E, R+ ) , where s, t) , D1 k (x, 4y, s, t) , D2 k (x, y, s, t) , D2 D1 k (x, y, : 0 ≤ s ≤ x < ∞, 0 ≤ t ≤ y < ∞ . Let g(u) be a continuE = (x, y, s, t) ∈ R+ ously differentiable function defined for u ≥ 0, g (u) > 0 for u > 0 and g 0 (u) ≥ 0 for u ≥ 0. If Zx Zy u (x, y) ≤ a (x, y) +

k (x, y, σ, τ ) g (u (σ, τ ))dτ dσ, 0

(2.2.1)

0

for x, y ∈ R+ , then for 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 ; x, x1 , y, y1 ∈ R+ ,   Zx Zy A (s, t) dtds , u (x, y) ≤ G−1 G (a (x, y)) + 0

(2.2.2)

0

where Zx A (x, y) = k (x, y, x, y) +

D1 k (x, y, σ, y) dσ 0

Zy +

Zx Zy D2 k (x, y, x, τ ) dτ +

0

D2 D1 k (x, y, σ, τ ) dσdτ, 0

Zr G (r) =

(2.2.3)

0

ds , r > 0, g (s)

(2.2.4)

r0

r0 > 0 is arbitrary and G−1 is the inverse of G and x1 , y1 ∈ R+ are chosen so that Zx Zy G (a (x, y)) + 0

A (s, t) dtds ∈ Dom G−1 ,

0

for all x, y lying in 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 respectively. Proof. From the hypotheses, it is easy to observe that the function a(x, y) is monotonically increasing in both the variables x and y. We also note that since g 0 (u) ≥ 0 on R+ , the function g(u) is monotonically increasing on (0, ∞) . Let a(x, y) > 0 for x, y ∈ R+ and define a function z(x, y) by the right hand side of (2.2.1). Then z(x, y) is positive and by hypotheses, it is nondecreasing in x, y ∈ R+ ,z(x, 0) = a(x, 0), z(0, y) = a(0, y), u (x, y) ≤ z (x, y) and Zy D1 z (x, y) = D1 a (x, y) +

k (x, y, x, τ ) g (u (x, τ )) dτ 0

Chapter 2

65

Zx Zy +

D1 k (x, y, σ, τ ) g (u (σ, τ ))dτ dσ, 0

0

Zx D2 z (x, y) = D2 a (x, y) +

k (x, y, σ, y) g (u (σ, y)) dσ 0

Zx Zy D2 k (x, y, σ, τ ) g (u (σ, τ ))dτ dσ,

+ 0

0

D2 D1 z (x, y) = D2 D1 a (x, y) + k (x, y, x, y) g (u (x, y)) Zy

Zx +

D1 k (x, y, σ, y) g (u (σ, y)) dσ + 0

D2 k (x, y, x, τ ) g (u (x, τ )) dτ 0

Zx Zy D2 D1 k (x, y, σ, τ ) g (u (σ, τ ))dτ dσ

+ 0

0

≤ D2 D1 a (x, y) + k (x, y, x, y) g (z (x, y)) Zy

Zx +

D1 k (x, y, σ, y) g (z (σ, y)) dσ + 0

D2 k (x, y, x, τ ) g (z (x, τ )) dτ 0

Zx Zy D2 D1 k (x, y, σ, τ ) g (z (σ, τ ))dτ dσ

+ 0

0

≤ D2 D1 a (x, y) + A (x, y) g (z (x, y)) .

(2.2.5)

It is easy to observe that D2 D1 G (z (x, y)) = G00 (z (x, y)) D1 z (x, y) D2 z (x, y) +G0 (z (x, y)) D2 D1 z (x, y) .

(2.2.6)

Since a (x, y) ≤ z (x, y) and D1 z (x, y) ≥ 0, D2 z (x, y) ≥ 0, G0 (z (x, y)) = 1 00 g(z(x,y)) and G (z (x, y)) ≤ 0, we obtain from (2.2.5) and (2.2.6) D2 D1 G (z (x, y)) ≤ G0 (z (x, y)) {D2 D1 a (x, y) + A (x, y) g (z (x, y))} =

D2 D1 a (x, y) + A (x, y) g (z (x, y))

≤

D2 D1 a (x, y) + A (x, y) . g (a (x, y))

(2.2.7)

66


On the other hand we observe that  

a(x,y) Z

  D2 D1 G (a (x, y)) = D2 D1 

 ds   g (s)

r0

= D2 = =

D1 a (x, y) g (a (x, y))

g (a (x, y)) D2 D1 a (x, y) − D1 a (x, y) g 0 (a (x, y)) D2 a (x, y) 2

[g (a (x, y))]

D2 D1 a (x, y) g 0 (a (x, y)) D1 a (x, y) D2 a (x, y) − 2 g (a (x, y)) [g (a (x, y))]

which implies D2 D1 G (a (x, y)) ≥

D2 D1 a (x, y) . g (a (x, y))

(2.2.8)

From (2.2.7) and (2.2.8) we have D2 D1 G (z (x, y)) ≤ D2 D1 G (a (x, y)) + A (x, y) , and this yields Zx Zy G (z (x, y)) ≤ G (a (x, y)) +

A (s, t) dtds, 0

0

which implies (see [34, Chapter 5])  u (x, y) ≤ z (x, y) ≤ G−1 G (a (x, y)) +

Zx Zy

 A (s, t) dtds .

0

0

If a(x, y) is nonnegative, we carry out the above procedure with a (x, y) + ε instead of a(x, y), where ε > 0 is an arbitrary small constant, and subsequently pass to the limit ε → 0 to obtain (2.2.2). The subdomain 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 is obvious. Remark 2.2.1. If we take g(u) = u in Theorem 2.2.1, then the bound obtained in (2.2.2) reduces to   x y Z Z A (s, t) dtds , u (x, y) ≤ a (x, y) exp  0

0

for x, y ∈ R+ . In this case the inequality given in Theorem 2.2.1 is a generalization of the Wendroff’s inequality given in [4, p. 154], see also [34].

Chapter 2

67

In [55] Pachpatte has established the inequalities in the following theorem. Theorem 2.2.2. Let u(x, y), k(x, y, s, t) , D1 k (x, y, s, t) , D2 k (x, y, s, t) , D2 D1 k (x, y, s, t) be as in Theorem 2.2.1 and c ≥ 0 is a constant. (a1 ) If Zx Zy

2

u (x, y) ≤ c +

k (x, y, σ, τ ) u (σ, τ )dτ dσ, 0

(2.2.9)

0

for x, y ∈ R+ , then √ 1 u (x, y) ≤ c + 2

Zx Zy A (s, t) dtds, 0

(2.2.10)

0

for x, y ∈ R+ , where A(x, y) is defined ny (2.2.3). (a2 ) Let g(u) be as in Theorem 2.2.1. If Zx Zy

2

u (x, y) ≤ c +

k (x, y, σ, τ ) g (u (σ, τ ))dτ dσ, 0

(2.2.11)

0

for x, y ∈ R+ , then for 0 ≤ x ≤ x2 , 0 ≤ y ≤ y2 ; x, x2 , y, y2 ∈ R+   Zx Zy √ 1 u (x, y) ≤ G−1 G c + A (s, t) dtds 2 0

(2.2.12)

0

where A(x, y) is defined by (2.2.3), G, G−1 are as defined in Theorem 2.2.1 and x2 , y2 ∈ R+ are chosen so that √ 1 G c + 2

Zx Zy 0

A (s, t) dtds ∈ Dom G−1 ,

0

for all x, y ∈ R+ lying in 0 ≤ x ≤ x2 , 0 ≤ y ≤ y2 . Proof. (a1 ) It is sufficient to assume that c is positive, since the standard limiting argument can be used to treat the remaining case. Let c > 0 and define a functionp z(x, y) by the right hand side of (2.2.9). Then z(0, y) = z(x, 0) = c, u (x, y) ≤ z (x, y), z(x, y) is positive and nondecreasing in x, y ∈ R+ and Zx D2 D1 z (x, y) = k (x, y, x, y) u (x, y) +

D1 k (x, y, σ, y) u (σ, y) dσ 0

68

Integral inequalities in two variables Zx Zy

Zx +

D2 k (x, y, x, τ ) u (x, τ ) dτ + 0

D2 D1 k (x, y, σ, τ ) u (σ, τ ) dτ dσ 0

0

x

Z p p ≤ k (x, y, x, y) z (x, y) + D1 k (x, y, σ, y) z (σ, y)dσ 0

Zx +

Zx Zy p p D2 k (x, y, x, τ ) z (x, τ )dτ + D2 D1 k (x, y, σ, τ ) z (σ, τ )dτ dσ

0

≤ A (x, y)

0

0

p z (x, y).

(2.2.13)

Now by following the proof of Theorem 5.8.1 given in [34, p. 528], from (2.2.13) we get p

√ 1 z (x, y) ≤ c + 2

Zx Zy A (s, t) dtds. 0

(2.2.14)

0

p Using (2.2.14) in u (x, y) ≤ z (x, y), we get the required inequality in (2.2.10). (a2 ) The proof follows by closely looking at the proof of Theorem 5.8.2 in [34]. Remark 2.2.2. If we take k(x, y, s, t) = p(s, t) in Theorem 2.2.2, then the estimates obtained in (2.2.10), (2.2.12) reduces respectively to √ 1 u (x, y) ≤ c + 2

Zx Zy p (s, t) dtds, 0



0

√ 1 u (x, y) ≤ G−1 G c + 2

Zx Zy

 p (s, t) dtds .

0

0

In this case the inequalities in (a1 ) , (a2 ) reduces respectively to the variants of the inequalities in Theorems 5.8.1, 5.8.2 given in [34]. We note that, by following the proof of Theorem 2.2.1 one can obtain the estimates on the inequalities (2.2.9), (2.2.11) when c is replaced by the function a(x, y), where a(x, y) is as in Theorem 2.2.1. ˇ in [26]. The inequalities in the following theorems are proved by Medved

Chapter 2

69

Theorem 2.2.3. Let 0 < T ≤ ∞ and I = [0, T) . Let u(x, y), F (x, y), a(x, y), D1 a (x, y) , D2 a (x, y) , D2 D1 a (x, y) ∈ C I 2 , R+ . Let w(u) be a continuously differentiable function defined for u ≥ 0, w(u) > 0 for u > 0 and w0 (u) ≥ 0 for u ≥ 0. If Zx Zy

α−1

(x − s)

u (x, y) ≤ a (x, y)+ 0

(y − t)

β−1

F (s, t)w (u (s, t)) dtds, (2.2.15)

0

for x, y ∈ I, then the following assertions hold: (i) Suppose α > 12 , β > 1.2 with q = 2. Then

1 2

and w satisfies the condition (q) as given in Section

u (x, y) ≤ ex+y Φ (x, y) ,

(2.2.16)

for x, y ∈ [0, T1 ] , T1 ∈ I, where h h 2 Φ (x, y) = Ω−1 Ω 2a (x, y)  12

Zx Zy 0

K=

2

F (s, t) R (s + t) dtds ,

+2K

(2.2.17)

0

Γ (2α − 1) Γ (2β − 1) , 4α+β−1

Γ is the Gamma function, Ω (r) =

(2.2.18) Rr r0

ds w(s) , r

> 0 and r0 > 0 is arbitrary, Ω−1

−1 is the inverse of Ω and T1 is chosen so that the argument of Ω in (2.2.17) −1 for all x, y ∈ [0, T1 ]. belongs to Dom Ω 1 (ii) Suppose α = β = z+1 for some real number z ≥ 1 and w satisfies the condition (q) in Section 1.2 with q = z + 2. Let Ω, Ω−1 be as in part (i). Then

u (x, y) ≤ ex+y Ψ (x, y)

(2.2.19)

for x, y ∈ [0, T2 ] , T2 ∈ I, where q Ψ (x, y) = Ω−1 Ω 2q−1 a (x, y)

+2q−1 Mzq

q

F (s, t) R (s + t) dtds , 0

 q1

Zx Zy

(2.2.20)

0

Γ (1 − pδ) Mz = p(1−pδ)

q2 ,δ = 1 − β =

z+2 z ,p = , z+1 z+1

(2.2.21)

T2 is chosen so that the argument of Ω−1 in (2.2.20) belongs to Dom Ω−1 for all x, y ∈ [0, T2 ].

70


Proof. First we prove the assertion (i). Using the Cauchy-Schwarz inequality for double integrals we obtain from (2.2.15) Zx Zy

α−1 s

(x − s)

u (x, y) ≤ a (x, y)+ 0

e (y − t)

h i e e−(s+t) F (s, t) w (u (s, t)) dtds

β−1 t

0

 12  x y Z Z 2α−2 2s 2β−2 2t (x − s) e (y − t) e dtds ≤ a (x, y) +  0



Zx Zy

× 0

0

 12 2 2 e−2(s+t) F (s, t) w (u (s, t)) dtds .

(2.2.22)

0

For the first integral in (2.2.22) we have the estimate Zx Zy

2α−2 2s

(x − s) 0

e (y − t)

e dtds

0

2(x+y)

Zx

=e

σ

2α−2 −2σ

e2(x+y)

Zy

e

0

=

2β−2 2t

η 2β−2 e−2η dηdσ

0

Z2x τ

22(α+β)−2

2α−2 −τ

e

Z2y dτ

0

ξ 2β−2 e−ξ dξ

0

2(x+y)

e Γ (2α − 1) Γ (2β − 1) . 22(α+β)−2 Therefore we obtain from (2.2.22)
1.2 with q = 2. Then

1 2

and w satisfies the condition (q) as given in Section

u (x, y) ≤ ex+y L (x, y) ,

(2.2.32)

for x, y ∈ [0, T1 ] , T1 ∈ I, where  14   Zx Zy 2 F (s, t) R (s + t) dtds , (2.2.33) L (x, y) = Λ−1 Λ 2a2 + 2K 0

0

K is defined as in (2.2.18) and Λ (r) = T1 is chosen so that the argument of Λ all x, y ∈ [0, T1 ].

Rr

r0 −1

ds √ ,r w ( s)

> 0 and r0 > 0 is arbitrary, in (2.2.33) belongs to Dom Λ−1 for

1 z+2 for some real number z ≥ 1 and let p = z+1 ,q = (ii) Suppose α = β = z+1 z + 2. Assume that w satisfies the condition (q) as given in Section 1.2 with q = z + 2. Let Λ, Λ−1 be as in part (i). Then

u (x, y) ≤ ex+y Q (x, y) ,

(2.2.34)

for x, y ∈ [0, T2 ] , T2 ∈ I, where Q (x, y) = Λ−1 Λ 2q−1 aq +2q−1 Mzq

Zx Zy

 2q1 q

F (s, t) R (s + t) dtds 0

,

(2.2.35)

0

−1 Mz is defined as in (2.2.21) and T2 is chosen so that the argument of Λ in −1 for all x, y ∈ [0, T2 ] , T2 ∈ I. (2.2.35) belongs to Dom Λ

Chapter 2

73

Proof. First we prove the assertion (i). Following the proof of Theorem 2.2.3, part (i) one can show that 2

Zx Zy

v (x, y) ≤ c + 2K

2

F (s, t) R (s + t)w (v (s, t)) dtds, 0

(2.2.36)

0

where 2 v (x, y) = e−(x+y) u (x, y) , c = 2a2 .

(2.2.37)

Let z(x, y) be the right hand side of p (2.2.36). Then z(x, y) is positive and nondecreasing for x, y ∈ I, v (x, y) ≤ z (x, y), z (x, 0) = z (0, y) = c, 2

D2 D1 z (x, y) = 2KF (x, y) R (x + y) w (v (x, y)) p 2 ≤ 2KF (x, y) R (x + y) w z (x, y) ,

(2.2.38)

and as in the proof of Theorem 2.2.1 we observe that D2 D1 Λ (x, y) ≤

D2 D1 z (x, y) p . w z (x, y)

(2.2.39)

From (2.2.39) and (2.2.38) we have 2

D2 D1 Λ (x, y) ≤ 2KF (x, y) R (x + y) , and this yields Zx Zy Λ (x, y) ≤ Λ (c) + 2K

2

F (s, t) R (s + t) dtds. 0

(2.2.40)

0

Using (2.2.40), the fact that v 2 (x, y) ≤ z (x, y) and (2.2.37) we get the desired inequality in (2.2.32). The proof of the case (ii) can be completed by following the proof of case (i) given above and closely looking at the proof of Theorem 2.2.3 ,case (ii).

2.3 Further nonlinear integral inequalities In view of the important applications of the integral inequalities which furnish explicit bounds on unknown functions, in the past few years, some new inequalities have been developed in the literature. In this section we give some integral inequalities involving functions of two variables established by Pachpatte in [46,40,45].

74

Integral inequalities in two variables The inequalities in the following theorems are given in [46].

2 , R+ . Let a Theorem 2.3.1. Let u (x, y) , a (x, y) , p (x, y) , b (x, y) ∈C R+ 3 (x, y) be nondecreasing for x, y ∈ R+ and L ∈ C R+ , R+ satisfies the condition 0 ≤ L (x, y, v1 ) − L (x, y, v2 ) ≤ M (x, y, v2 ) (v1 − v2 ) , 3 for v1 ≥ v2 ≥ 0, where M ∈ C R+ , R+ .

(2.3.1)

(a1 ) If Zx u (x, y) ≤ a (x, y) + p (x, y)

b (s, y) u (s, y) ds 0

Zx Zy +

L (s, t, u (s, t)) dtds, 0

(2.3.2)

0

for x, y ∈ R+ , then u (x, y) ≤ f (x, y) [a (x, y) + e (x, y)   x y Z Z M (s, t, f (s, t) a (s, t)) f (s, t) dtds , × exp  0

(2.3.3)

0

for x, y ∈ R+ , where Zx f (x, y) = 1 + p (x, y)

 x  Z b (s, y) exp  b (σ, y) p (σ, y) dσ ds,

(2.3.4)

s

0

Zx Zy e (x, y) =

L (s, t, f (s, t) a (s, t)) dtds, 0

(2.3.5)

0

for x, y ∈ R+ . (a2 ) If Zy u (x, y) ≤ a (x, y) + p (x, y)

b (x, t) u (x, t) dt 0

Zx Zy +

L (s, t, u (s, t)) dtds, 0

0

(2.3.6)

Chapter 2

75

for x, y ∈ R+ , then u (x, y) ≤ f¯ (x, y) [a (x, y) + e¯ (x, y)  x y  Z Z × exp  M s, t, f¯ (s, t) a (s, t) f¯ (s, t) dtds , 0

(2.3.7)

0

for x, y ∈ R+ , where f¯ (x, y) = 1 + p (x, y)

Zy

 y  Z b (x, t) exp  b (x, τ ) p (x, τ ) dτ dt,

Zx Zy e¯ (x, y) = 0

(2.3.8)

t

0

L s, t, f¯ (s, t) a (s, t) dtds,

(2.3.9)

0

for x, y ∈ R+ . Proof. (a1 ) It is sufficient to assume that a(x, y) > 0 for x, y ∈ R+ , since the standard limiting argument can be used to treat the remaining case,see [34, p. 226]. Let a(x, y) > 0 for x, y ∈ R+ and define a function z(x, y) by Zx Zy z (x, y) = a (x, y) +

L (s, t, u (s, t)) dtds. 0

(2.3.10)

0

Then (2.3.2) can be restated as Zy u (x, y) ≤ z (x, y) + p (x, y)

b (s, y) u (s, y) ds.

(2.3.11)

0

Clearly z(x, y) is nonnegative and nondecreasing function for x, y ∈ R+ . Treating (2.3.11) as one-dimensional integral inequality for any fixed y ∈ R+ and a suitable application of the inequality given in Theorem 1.3.3 in [34, p. 15] yields u (x, y) ≤ z (x, y,) f (x, y) ,

(2.3.12)

for x, y ∈ R+ , where f (x, y) is defined by (2.3.4). From (2.3.10) and (2.3.12) we have u (x, y) ≤ f (x, y,) [a (x, y) + r (x, y)] ,

(2.3.13)

where Zx Zy r (x, y) =

L (s, t, u (s, t)) dtds. 0

0

(2.3.14)

76


From (2.3.13), (2.3.14) and (2.3.1) we observe that Zx Zy r (x, y) ≤

[L (s, t, f (s, t) [a (s, t) + r (s, t)]) 0

0

− L (s, t, f (s, t) a (s, t)) + L (s, t, f (s, t) a (s, t))] dtds Zx Zy M (s, t, f (s, t) a (s, t)) f (s, t) r (s, t) dtds, ≤ e (x, y) + 0

(2.3.15)

0

where e(x, y) is defined by (2.3.5). Obviously, e(x, y) is nonnegative and nondecreasing in each variable x, y ∈ R+ . A suitable application of Theorem 4.2.2 given in [34, p. 325] yields   x y Z Z M (s, t, f (s, t) a (s, t)) f (s, t)dtds . (2.3.16) r (x, y) ≤ e (x, y) exp  0

0

Using (2.3.16) in (2.3.13) we get the required inequality in (2.3.3). (a2 ) The proof follows by a similar argument to that employed in (a1 ) . We omit the details. 2 , R+ . Theorem 2.3.2. Let u (x, y) , a (x, y) , g (x, y) , h (x, y) ∈ C R+ Let a(x, y), L and M be as in Theorem 2.3.1 and the condition (2.3.1) holds. (b1 ) If 

Zx u (x, y) ≤ a (x, y) +

g (s, y) u (s, y) + 0

Zx



Zs

h (σ, y) u (σ, y) dσ ds 0

Zy

+

L (s, t, u (s, t)) dtds, 0

(2.3.17)

0

for x, y ∈ R+ , then u (x, y) ≤ k (x, y) [a (x, y) + E (x, y)   x y Z Z M (s, t, k (s, t) a (s, t)) k (s, t) dtds , × exp  0

(2.3.18)

0

for x, y ∈ R+ , where Zx k (x, y) = 1 + 0

 s  Z g (s, y) exp  [g (σ, y) + h (σ, y)] dσ ds, 0

(2.3.19)

Chapter 2

77

Zx Zy E (x, y) =

L (s, t, k (s, t) a (s, t)) dtds, 0

(2.3.20)

0

for x, y ∈ R+ . (b2 ) If Zy u (x, y) ≤ a (x, y) +





Zt

g (x, t) u (x, t) + 0

h (x, τ ) u (x, τ ) dτ dt 0

Zx Zy +

L (s, t, u (s, t)) dtds, 0

(2.3.21)

0

for x, y ∈ R+ , then ¯ (x, y) u (x, y) ≤ k¯ (x, y) a (x, y) + E   x y Z Z M s, t, k¯ (s, t) a (s, t) k¯ (s, t) dtds , × exp  0

(2.3.22)

0

for x, y ∈ R+ , where k¯ (x, y) = 1 +

Zy

 t  Z g (x, t) exp  [g (x, τ ) + h (x, τ )] dτ dt,

0

¯ (x, y) = E

Zx 0

Zy

(2.3.23)

0

L s, t, k¯ (s, t) a (s, t) dtds,

(2.3.24)

0

for x, y ∈ R+ . Proof. As in the proof of Theorem 2.3.1, part (a1 ) let a(x, y) > 0 for x, y ∈ R+ and define a function z(x, y) by (2.3.10). Then (2.3.17) can be written as   Zx Zs u (x, y) ≤ z (x, y) + g (s, y) u (s, y) + h (σ, y) u (σ, y) dσ ds. (2.3.25) 0

0

Clearly z(x, y) is nonnegative and nondecreasing function for x, y ∈ R+ . Treating (2.3.25) as an one-dimensional integral inequality for any fixed y ∈ R+ and a suitable application of Theorem 1.7.4 given in [34, p. 39] yields u (x, y) ≤ z (x, y) k (x, y) ,

(2.3.26)

where k(x, y) is defined by (2.3.19). Now by following the proof of Theorem 2.3.1, part (a1 ) with suitable modifications, we get the desired inequality in (2.3.18).

78

Integral inequalities in two variables (b2 ) The proof is similar to that of part (b1 ) given above. We omit the details.

Remark 2.3.1. We note that from Theorems 2.3.1 and 2.3.2 one can obtain Corollaries similar to those of Corollaries of Lemma 74 discussed in [12, p. 43] which can be used in some applications. The inequalities established in [40] are embodied in the following theorems. 2 , R+ Theorem 2.3.3. Let u (x, y) , a (x, y) , b (x, y) , g (x, y) , h (x, y) ∈ C R+ and p > 1 be a real constant.

(c1 ) If Zx Zy

p

u (x, y) ≤ a (x, y)+b (x, y) 0

[g (s, t) up (s, t) + h (s, t) u (s, t)]dtds, (2.3.27)

0

for x, y ∈ R+ , then u (x, y) ≤ {a (x, y) + b (x, y) e (x, y)  x y  p1 Z Z  h (s, t) × exp  b (s, t) dtds , g (s, t) +  p 0

(2.3.28)

0

for x, y ∈ R+ , where Zx Zy p − 1 a (s, t) e (x, y) = + h (s, t) dtds, (2.3.29) g (s, t) a (s, t) + p p 0

0

for x, y ∈ R+ . (c2 ) Let c(x, y) be a real-valued, continuous, positive and nondecreasing function defined for x, y ∈ R+ .If up (x, y) ≤ cp (x, y) + b (x, y) Zx Zy × 0

[g (s, t) up (s, t) + h (s, t) u (s, t)] dtds,

(2.3.30)

0

for x, y ∈ R+ , then u (x, y) ≤ c (x, y) {1 + b (x, y) e0 (x, y)  p1 Zx Zy  h (s, t) 1−p c × exp  g (s, t) + (s, t) b (s, t) dtds ,  p 

0

0

(2.3.31)

Chapter 2

79

for x, y ∈ R+ , where Zx Zy e0 (x, y) = 0

g (s, t) + h (s, t) c1−p (s, t) dtds,

(2.3.32)

0

for x, y ∈ R+ . Proof. (c1 ) Define a function z(x, y) by Zx Zy z (x, y) = 0

[g (s, t) up (s, t) + h (s, t) u (s, t)] dtds,

(2.3.33)

0

then z(0, y) = z(x, 0) = 0 and (2.3.27) can be written as up (x, y) ≤ a (x, y) + b (x, y) z (x, y) .

(2.3.34)

From (2.3.34) and using the elementary inequality (1.3.11) (see [30, p. 30]) we observe that 1/ 1 u (x, y) ≤ (a (x, y) + b (x, y) z (x, y)) p (1) (p/p − 1) p − 1 a (x, y) b (x, y) + + z (x, y) . p p p From (2.3.33)-(2.3.35) it is easy to observe that ≤

(2.3.35)

Zx Zy h (s, t) b (s, t) z (s, t) dtds, z (x, y) ≤ e (x, y) + g (s, t) + p

(2.3.36)

0

0

where e(x, y) is defined by (2.3.29). Clearly e(x, y) is nonnegative, continuous and nondecreasing for x, y ∈ R+ . A suitable application of Theorem 4.2.2 given in [34, p. 325] to (2.3.36) yields   x y Z Z h (s, t) b (s, t) dtds , (2.3.37) g (s, t) + z (x, y) ≤ e (x, y) exp  p 0

0

for x, y ∈ R+ The required inequality (2.3.28) follows from (2.3.34) and (2.3.37). (c2 ) Since c(x, y) is positive, continuous and nondecreasing function for x, y ∈ R+ , from (2.3.30) we observe that

u (x, y) c (x, y)

p

p Zx Zy u (s, t) g (s, t) ≤1+ c (s, t) 0

0

u (s, t) dtds. (2.3.38) +h (s, t) c (s, t) c (s, t) Now a suitable application of the inequality given in part (c1 ) to (2.3.38) yields the desired inequality in (2.3.31). 1−p

80

Integral inequalities in two variables 2 , R+ and p > 1 be a Let u (x, y) , a (x, y) , b (x, y) ∈ C R+

Theorem 2.3.4. real constant.

3 (d1 ) Let f ∈ C R+ , R+ satisfies the condition 0 ≤ f (x, y, u) − f (x, y, v) ≤ m (x, y, v) (u − v) , 3 , R+ .If for x, y ∈ R+ , u ≥ v ≥ 0, where m ∈ C R+

(2.3.39)

Zx Zy

p

u (x, y) ≤ a (x, y) + b (x, y)

f (s, t, u (s, t)) dtds, 0

(2.3.40)

0

for x, y ∈ R+ , then u (x, y) ≤ {a (x, y) + b (x, y) e¯ (x, y)  p1  x y Z Z  p − 1 a (s, t) b (s, t) + dtds m s, t, , × exp   p p p 0

(2.3.41)

0

for x, y ∈ R+ , where Zx Zy

f

e¯ (x, y) = 0

p − 1 a (s, t) + dtds, s, t, p p

(2.3.42)

0

for x, y ∈ R+ . 3 (d2 ) Let f ∈ C R+ , R+ and Φ ∈ C (R+ , R+ ) be strictly increasing with Φ (0) = 0 and (2.3.43) 0 ≤ f (x, y, u) − f (x, y, v) ≤ m (x, y, v) Φ−1 (u − v) , 3 , R+ and Φ−1 is the inverse for x, y ∈ R+ , u ≥ v ≥ 0, where m ∈ C R+ function of Φ and Φ−1 (uv) ≤ Φ−1 (u) Φ−1 (v) ,

(2.3.44)

for u, v ∈ R+ . If  x y  Z Z up (x, y) ≤ a (x, y) + b (x, y) Φ  f (s, t, u (s, t)) dtds , 0

(2.3.45)

0

for x, y ∈ R+ , then u (x, y) ≤ {a (x, y) + b (x, y) Φ (¯ e (x, y)  p1  x y Z Z  a (s, t) b (s, t) p − 1 + dtds m s, t, , × exp   p p p 0

0

for x, y ∈ R+ , where e¯ (x, y) is defined by (2.3.42).

(2.4.46)

Chapter 2

81

(d1 ) Define a function z(x, y) by Zx Zy f (s, t, u (s, t)) dtds,

z (x, y) = 0

(2.3.47)

0

then as in the proof of Theorem 2.3.3 part (c1 ),from (2.3.40) we see that the inequalities (2.3.34), (2.3.35) hold. From (2.3.47), (2.3.35) and the assumptions on f , it follows that Zx Zy p − 1 a (s, t) b (s, t) z (x, y) ≤ + + z (s, t) f s, t, p p p 0

−f

s, t,

0

p − 1 a (s, t) + p p Zx Zy

≤ e¯ (x, y) + 0

+f

s, t,

p − 1 a (s, t) + p p

dtds

p − 1 a (s, t) b (s, t) + z (s, t) dtds, m s, t, p p p

(2.3.48)

0

where e¯ (x, y) is defined by (2.3.42). Clearly e¯ (x, y) is nonnegative, continuous and nondecreasing function for x, y ∈ R+ . A suitable application of Theorem 4.2.2 given in [34, p. 325] to (2.3.48) yields   x y Z Z b (s, t) a (s, t) p − 1 + dtds . (2.3.49) z (x, y) ≤ e¯ (x, y) exp  m s, t, p p p 0

0

From (2.3.34) and (2.3.49) the desired inequality in (2.3.41) follows. (d2 ) Defining a function z(x, y) by (2.3.47) and following the arguments as in the proof of Theorem 2.3.3, part (c1 ) we see that, corresponding to the inequalities (2.3.34) and (2.3.35) we have the following inequalities up (x, y) ≤ a (x, y) + b (x, y) Φ (z (x, y)) ,

(2.3.50)

and u (x, y) ≤

p − 1 a (x, y) b (x, y) + + Φ (z (x, y)) . p p p

(2.3.51)

From (2.3.47), (2.3.51) and the assumptions on f and Φ we observe that Zx Zy p − 1 a (s, t) b (s, t) z (x, y) ≤ + + Φ (z (x, y)) f s, t, p p p 0

−f

0

p − 1 a (s, t) + s, t, p p

+f

p − 1 a (s, t) s, t, + p p

dtds

82

Integral inequalities in two variables Zx Zy ≤ e¯ (x, y) +

f

0

s, t,

p − 1 a (s, t) b (s, t) + Φ−1 z (s, t) dtds, (2.3.52) p p p

0

where e¯ (x, y) is defined by (2.3.42). Clearly e¯ (x, y) is nonnegative, continuous and nondecreasing function for x, y ∈ R+ . A suitable application of Theorem 4.2.2 given in [34, p. 325] yields z (x, y) ≤ e¯ (x, y)   x y Z Z b (s, t) p − 1 a (s, t) + Φ−1 dtds . m s, t, × exp  p p p 0

(2.3.53)

0

The required inequality in (2.3.46) follows from (2.3.50) and (2.3.53). In the following theorem we give the inequalities established in [45]. 2 4 Theorem 2.3.5. Let u (x, y) , f (x, y) ∈ C R+ , R+ , h (x, y, s, t) ∈ C R+ , R+ for 0 ≤ s ≤ x < ∞, 0 ≤ t ≤ y < ∞ and c ≥ 0, p > 1 are real constants. (k1 ) Let g ∈ C (R+ , R+ ) be a nondecreasing function, g(u) > 0 for u > 0. If Zx Zy

p

u (x, y) ≤ c +

[f (s, t) g (u (s, t)) 0

0



Zs Zt +

h (s, t, σ, η)g (u (σ, η)) dηdσ  dtds, 0

(2.3.54)

0

for x, y ∈ R+ , then for 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 ; x, x1 , y, y1 ∈ R+ , 1 u (x, y) ≤ G−1 [G (c) + A (x, y)] p ,

(2.3.55)

where Zx Zy A (x, y) =

G (r) = r0

Zs Zt

0

 h (s, t, σ, η) dηdσ dtds,

f (s, t) + 0

Zr



0

(2.3.56)

0

ds 1 , r > 0, g sp

(2.3.57)

r0 > 0 is arbitrary, G−1 is the inverse function of G and x1 , y1 ∈ R+ are chosen so that G (c) + A (x, y) ∈ Dom G−1 , for all x, y lying in the intervals 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 of R+ .

Chapter 2

83

(k2 ) If Zx Zy

p

u (x, y) ≤ c +

[f (s, t) u (s, t) 0

0



Zs Zt +

h (s, t, σ, η)u (σ, η) dηdσ  dtds, 0

(2.3.58)

0

for x, y ∈ R+ ,, then 1 p−1 p−1 p−1 p A (x, y) + , u (x, y) ≤ c p

(2.3.59)

for x, y ∈ R+ , where A(x, y) is defined by (2.3.56). Proof. (k1 ) Let c > 0 and define a function z(x, y) by the right hand side of 1 (2.3.54). Then z(0, y) = z(x, 0) = c, u (x, y) ≤ (z (x, y)) p and   Zy Zx Zt h (x, t, σ, η) g (u (σ, η)) dηdσ dt D1 z (x, y) = f (x, t) g (u (x, t)) + 0

0

0

  Zy Zx Zt 1 1 ≤ f (x, t) g (z (x, t)) p + h (x, t, σ, η) g (z (σ, η)) p dηdσ dt 0

Zy

1 ≤ g (z (x, y)) p



0

0

Zx

Zt

h (x, t, σ, η) dηdσ dt.

f (x, t) + 0



0

(2.3.60)

0

From (2.3.57) and (2.3.60) we observe that D1 G (z (x, y)) = Zy ≤



D z (x, y) 1 1 g (z (x, y)) p

h (x, t, σ, η) dηdσ dt.

f (x, t) + 0



Zx Zt 0

(2.3.61)

0

Keeping y fixed in (2.3.61), setting x = s and integrating with respect to s from 0 to x and using the fact that z(0, y) = c, we have G (z (x, y)) ≤ G (c) + A (x, y) .

(2.3.62) 1

Now substituting the bound on z(x, y) from (2.3.62) in u (x, y) ≤ (z (x, y)) p we obtain the desired bound in (2.3.55). The proof of the case when c ≥ 0 can be completed as mentioned in the proof of Theorem 1.3.3. The subdomain 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 is obvious.

84


(k2 ) The proof is similar to that of given in Theorem 1.3.4 and we omit it here. Remark 2.3.2. We note that the upper bound on the inequality (2.3.58) when p = 1 and h = 0 is first established by Wendroff, see [4, p. 154]. For various useful generalizations and variants of Wendroff’s inequality, see [3,34,42].

2.4 Inequalities involving iterated integrals During the past few years some useful integral inequalities in two independent variables which provide explicit bounds on unknown functions have appeared in the literature. In this section we shall deal with the inequalities involving iterated integrals established by Pachpatte in [53,72,78] which can be used as tools in certain applications. First we introduce some notation to simplify the details of presentation. Let I = [0, α) , J = [0, β) are the given subsets of R and ∆ = I × J. Let D = (x, y, s, t) ∈ ∆2 : 0 ≤ s ≤ x < α, 0 ≤ t ≤ y < β , and E = (x, y, s, t, σ, τ ) ∈ ∆3 : 0 ≤ σ ≤ s ≤ x < α, 0 ≤ τ ≤ t ≤ y < β . For any functions k(x, y, s, t), D1 k (x, y, s, t) , D2 k (x, y, s, t), D2 D1 k (x, y, s, t) ∈ C (D, R+ ) and h (x, y, s, t, σ, τ ) , D1 h (x, y, s, t, σ, τ ) , D2 h (x, y, s, t, σ, τ ) , D2 D1 h (x, y, s, t, σ, τ ) ∈ C (E, R+ ) , we set Zx A (x, y) = k (x, y, x, y) +

D1 k (x, y, ξ, y) dξ 0

Zy

Zx Zy D2 k (x, y, x, η) dη +

+ 0

D2 D1 k (x, y, ξ, η) dηdξ, 0

0

Zx Zy B (x, y) =

h (x, y, x, y, σ, τ )dτ dσ 0

Zx + 0

Zy + 0

0

  s y Z Z  D1 h (x, y, s, y, σ, τ )dτ dσ ds 0

0

  x t Z Z  D2 h (x, y, x, t, σ, τ )dτ dσ dt 0

0

(2.4.1)

Chapter 2 Zx Zy + 0

85

  s t Z Z  D2 D1 h (x, y, s, t, σ, τ )dτ dσ dtds.

0

0

(2.4.2)

0

For i = 1, ..., n, let Ii = (t1 , ..., ti ) : (t1 , ..., ti ) ∈ I i , Ji = {(s1 , ..., si ) : (s1 , ..., si ) ∈ J i and ∆i = Ii × Ji and any functions w (s, t) , a (s, t) , b (s, t) ∈ C (∆, R+ ) , and Li (t1 , ..., ti , s1 , ..., si , w (ti , si )) , Mi (t1 , ..., ti , s1 , ..., si , a (ti , si )) ∈ C (∆i × R+ , R+ ) , we set Hi [w] (t, s) Zt Zs = 0

  t s  ti−1 si−1  Z1Z 1 Z Z  ...  Li (t1 , ..., ti , s1 , ..., si , w (ti , si )) dsi dti  dsi−1 dti−1 ...

0

0

0

0

0

×ds1 dt1 ,

(2.4.3) Zt Zs L1 (t1 , s1 , a (t1 , s1 )) ds1 dt1

P (t, s) = 0

Zt Zs + 0

0

t s  Z1Z 1  L2 (t1 , t2 , s1 , s2 , a (t2 , s2 )) ds2 dt2 ds1 dt1 + ...

0

0

0

 tn−1 sn−1    Zt Zs Zt1 Zs1 Z Z  ...  Li (t1 , ..., tn , s1 , ..., sn , w (tn , sn )) dsn dtn  dsn−1 dtn−1 ... + 0

0

0

0

0

0

×ds1 dt1 ,

(2.4.4)

Zt Zs M2 (t, t2 , s, s2 , a (t2 , s2 )) b (t2 , s2 ) ds2 dt2 + ... Q (s, t) = M1 (t, s, a (t, s)) b (t, s)+ 0

0

 tn−1 sn−1  Zt Zs Zt2 Zs2 Z Z  ...  Mn (t, t2 , ...tn , s, s2 , ...sn , a (tn , sn )) + 0

0

0

0

0

0

×b (tn , sn ) dsn dtn ) dsn−1 dtn−1 ...) ds2 dt2 .

(2.4.5)

Our first theorem deals with the inequalities proved in [53]. Theorem 2.4.1. Let u (x, y) , f (x, y) , a (x, y) ∈ C (∆, R+ ) ; k(x, y, s, t), D1 k (x, y, s, t) , D2 k (x, y, s, t) , D2 D1 k (x, y, s, t) ∈ C (D, R+ ) and c ≥ 0 be a real constant.

86

Integral inequalities in two variables (a1 ) If Zx Zy u (x, y) ≤ c +

 f (s, t) u (s, t) +

0



Zs Zt

0

k (s, t, σ, τ ) u (σ, τ ) dτ dσ  0

0

×dtds,

(2.4.6)

for (x, y) ∈ ∆, then Zx Zy

 u (x, y) ≤ c 1 +

f (s, t) 0



0



Zs Zt

× exp 



[f (σ, τ ) + A (σ, τ )]dτ dσ  dtds , 0

(2.4.7)

0

for (x, y) ∈ ∆, where A(x, y) is defined by (2.4.1). (a2 ) If Zx Zy u (x, y) ≤ a (x, y) +

 f (s, t) u (s, t) +

0



Zs Zt

0

k (s, t, σ, τ ) u (σ, τ ) dτ dσ  0

0

×dtds,

(2.4.8)

for (x, y) ∈ ∆, then Zx Zy

 u (x, y) ≤ e (x, y) 1 +

f (s, t) 0



0



Zs Zt

× exp 



[f (σ, τ ) + A (σ, τ )]dτ dσ  dtds , 0

(2.4.9)

0

for (x, y) ∈ ∆, where Zx Zy e (x, y) =

 f (s, t) a (s, t) +

0

0



Zs Zt

k (s, t, σ, τ ) a (σ, τ ) dτ dσ  dtds, 0

0

for (x, y) ∈ ∆ and A(x, y) is defined by (2.4.1).

Chapter 2

87

Proof. (a1 ) Let c > 0 and define a function z(x, y) by the right hand side of (2.4.6). Then z(x, y) > 0, z(0, y) = z(x, 0) = c, u (x, y) ≤ z (x, y) and   Zx Zy k (x, y, σ, τ ) u (σ, τ )dτ dσ  D2 D1 z (x, y) = f (x, y) u (x, y) + 0

0

Zx Zy

 ≤ f (x, y) z (x, y) +

 k (x, y, σ, τ ) z (σ, τ )dτ dσ  .

0

(2.4.10)

0

Define a function v(x, y) by Zx Zy k (x, y, σ, τ ) z (σ, τ )dτ dσ.

v (x, y) = z (x, y) + 0

(2.4.11)

0

Then v(x, y) > 0, v(0, y) = z(0, y) = c, v(x, 0) = z(x, 0) = c, z (x, y) ≤ v (x, y) , D2 D1 z (x, y) ≤ f (x, y) v (x, y) , v(x, y) is nondecreasing for (x, y) ∈ ∆ and Zx D2 D1 v (x, y) = D2 D1 z (x, y)+k (x, y, x, y) z (x, y)+

D1 k (x, y, σ, y) z (σ, y)dσ 0

Zy

Zx Zy D2 k (x, y, x, τ ) z (x, τ )dτ +

+ 0

D2 D1 k (x, y, σ, τ ) z (σ, τ ) dτ dσ 0

0

Zx ≤ f (x, y) v (x, y) + k (x, y, x, y) v (x, y) +

D1 k (x, y, σ, y) v (σ, y)dσ 0

Zy

Zx Zy D2 k (x, y, x, τ ) v (x, τ )dτ +

+ 0

D2 D1 k (x, y, σ, τ ) v (σ, τ ) dτ dσ 0

≤ [f (x, y) + A (x, y)] v (x, y) ,

0

(2.4.12)

where A(x, y) is defined by (2.4.1). Now by following the proof of Theorem 4.2.1 given in [34], the inequality (2.4.12) implies  x y  Z Z v (x, y) ≤ c exp  [f (σ, τ ) + A (σ, τ )]dτ dσ  . (2.4.13) 0

0

Using (2.4.13) in (2.4.10) and integrating the resulting inequality first from 0 to y and then from 0 to x for (x, y) ∈ ∆ we get  Zx Zy f (s, t) z (x, y) ≤ c 1 + 0

0

88

Integral inequalities in two variables 



Zs Zt

× exp 



[f (σ, τ ) + A (σ, τ )]dτ dσ  dtds . 0

(2.4.14)

0

Using (2.4.14) in u (x, y) ≤ z (x, y), we get the required inequality in (2.4.7). If c ≥ 0, we carry out the above procedure with c + ε instead of c, where ε > 0 is an arbitrary small constant, and then subsequently pass to the limit as ε → 0 to obtain (2.4.7). (a2 ) The proof can be completed by closely looking at the proofs of Theorem 1.4.1, part (a2 ) and (a1 ) given above. Here we omit the details. Remark 2.4.1. If we take k(x, y, s, t) = k(s, t), then the inequality established in (a1 ) reduces to the inequality given in [34, Remark 4.4.1]. For several other inequalities of the type given in Theorem 2.4.1, see [34]. The next two theorems are established in [71] which can be used in certain situations. Theorem 2.4.2. Let u (x, y) ∈ C (∆, R+ ) ; k (x, y, s, t), D1 k (x, y, s, t) , D2 k (x, y, s, t) , D2 D1 k (x, y, s, t) ∈ C (D, R+ ) ; h (x, y, s, t, σ, τ ) , D1 h (x, y, s, t, σ, τ ) , D2 h (x, y, s, t, σ, τ ) , D2 D1 h (x, y, s, t)σ, τ ) ∈ C (E, R+ ) and c ≥ 0 be a real constant. (b1 ) If Zx Zy u (x, y) ≤ c +

k (x, y, s, t) u (s, t) dtds 0

0

  Zx Zy Zs Zt  h (x, y, s, t, σ, τ ) u (σ, τ ) dτ dσ dtds, + 0

0

0

(2.4.15)

0

for (x, y) ∈ ∆, then 

Zx Zy

u (x, y) ≤ c exp 

 [A (m, n) + B (m, n)] dndm ,

0

(2.4.16)

0

for (x, y) ∈ ∆, where A(x, y), B(x, y) are given by (2.4.1), (2.4.2). (b2 ) Let g(u) be continuously differentiable function defined for u ≥ 0 , g(u) > 0 for u > 0 and g 0 (u) ≥ 0 for u ≥ 0. If Zx Zy u (x, y) ≤ c +

k (x, y, s, t) g (u (s, t)) dtds 0

0

Chapter 2 Zx Zy + 0

89

  s t Z Z  h (x, y, s, t, σ, τ ) g (u (σ, τ )) dτ dσ dtds,

0

0

(2.4.17)

0

for (x, y) ∈ ∆, then for 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 ; x, x1 ∈ I, y, y1 ∈ J,   Zx Zy u (x, y) ≤ G−1 G (c) + [A (m, n) + B (m, n)] dndm , 0

(2.4.18)

0

where A(x, y), B(x, y) are given by (2.4.1), (2.4.2), Zr G (r) =

ds , r > 0, g (w)

(2.4.19)

r0

r0 > 0 is arbitrary, G−1 is the inverse function of G and x1 ∈ I, y1 ∈ J are chosen so that Zx Zy G (c) + 0

[A (m, n) + B (m, n)] dndm ∈ Dom G−1 ,

0

for (x, y) ∈ ∆ such that 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 . Proof. We first assume that c > 0 and define a function z(x, y) by the right hand side of (2.4.15). Then z(x, y) > 0, z(0, y) = z(x, 0) = c, u (x, y) ≤ z (x, y) and z(x, y) is nondecreasing in both the variables (x, y) ∈ ∆. It is easy to observe that (see [34, p. 328]) D2 D1 z (x, y) ≤ [A (x, y) + B (x, y)] z (x, y) ,

(2.4.20)

where A(x, y), B(x, y) are given by (2.4.1), (2.4.2). Now by following the proof of Theorem 4.2.1 given in [34], from (2.4.20) we get  x y  Z Z , z (x, y) ≤ c exp  [A (m, n) + B (m, n)] dndm , (2.4.21) 0

0

for (x, y) ∈ ∆. Using (2.4.21) in u (x, y) ≤ z (x, y), we get the required inequality in (2.4.16). If c ≥ 0 we carry out the above procedure with c + ε instead of c, where ε > 0 is an arbitrary small constant, and subsequently pass to the limit as ε → 0 to obtain (2.4.16). (b2 ) We note that since g 0 (u) ≥ 0 on R+ , the function g(u) is monotone increasing on (0, ∞). Assume that c > 0 and define a function z(x, y) by the right hand side of (2.4.17). Then z(x, y) > 0, z(0, y) = z(x, 0) = c, u (x, y) ≤

90


z (x, y) and z(x, y) is nondecreasing in both the variables (x, y) ∈ ∆. It is easy to observe that D2 D1 z (x, y) ≤ [A (x, y) + B (x, y)] g (z (x, y)) ,

(2.4.22)

where A(x, y), B(x, y) are given by (2.4.1), (2.4.2). The remaining proof can be completed by following the proof of Theorem 5.2.1 given in [34] . The proof of the case when c ≥ 0 follows as mentioned in the proof of (b1 ). Theorem 2.4.3. Let u (x, y) , a (x, y) ∈ C (∆, R+ ) , k (x, y, s, t) ∈ C (D, R+ ) , h (x, y, s, t, σ, τ ) ∈ C (E, R+ ) and c ≥ 0 be a real constant. (c1 ) If Zx Zy u (x, y) ≤ c +

a (s, t) u (s, t) dtds 0

Zx Zy + 0

0

  s t Z Z  k (s, t, σ, τ ) u (σ, τ ) dτ dσ  dtds

0

0

0

    Zx Zy Zs Zt Zσ Zτ   + h (s, t, σ, τ, m, n)u (m, n) dndm dτ dσ  dtds, (2.4.23) 0

0

0

0

0

0

for (x, y) ∈ ∆, then  x y  Z Z u (x, y) ≤ c exp  N (s, t) dtds , 0

(2.4.24)

0

for (x, y) ∈ ∆, where Zx Zy k (x, y, σ, τ )dτ dσ

N (x, y) = a (x, y) + 0

0

  Zx Zy Zσ Zτ  + h (x, y, σ, τ, m, n) dndm dτ dσ. 0

0

0

0

(c2 ) Let g(u) be as in Theorem 2.4.2, part (b2 ). If Zx Zy u (x, y) ≤ c +

a (s, t) g (u (s, t)) dtds 0

0

(2.4.25)

Chapter 2 Zx Zy + 0

91

  s t Z Z  k (s, t, σ, τ ) g (u (σ, τ )) dτ dσ  dtds

0

0

0

    Zx Zy Zs Zt Zσ Zτ   + h (s, t, σ, τ, m, n) g (u (m, n)) dndm dτ dσ  0

0

0

0

0

0

×dtds,

(2.4.26)

for (x, y) ∈ ∆, then for 0 ≤ x ≤ x2 , 0 ≤ y ≤ y2 ; x, x2 ∈ I, y, y2 ∈ J,   Zx Zy N (s, t) dtds , u (x, y) ≤ G−1 G (c) + 0

(2.4.27)

0

where N (x, y) is given by (2.4.25), G, G−1 are as in Theorem 2.4.2, part (b2 ) and x2 ∈ I, y2 ∈ J are chosen so that Zx Zy G (c) + 0

N (s, t) dtds ∈ Dom G−1 ,

0

for all (x, y) ∈ ∆ such that 0 ≤ x ≤ x2 , 0 ≤ y ≤ y2 . Proof. (c1 ) Let c > 0 and define a function z(x, y) by the right hand side of (2.4.23).Then z(x, y) > 0, z(0, y) = z(x, 0) = c, u (x, y) ≤ z (x, y) and z(x, y) is nondecreasing in both the variables (x, y) ∈ ∆ and Zx Zy D2 D1 z (x, y) = a (x, y) u (x, y) +

k (x, y, σ, τ ) u (σ, τ )dτ dσ 0

Zx Zy + 0

0

0

  σ τ Z Z  h (x, y, σ, τ, m, n) u (m, n) dndm dτ dσ 0

0

≤ N (x, y) z (x, y) ,

(2.4.28)

where N (x, y) is given by (2.4.25). Following the proof of Theorem 4.2.1 given in [34], from (2.4.28) we get   x y Z Z N (s, t) dtds . (2.4.29) z (x, y) ≤ c exp  0

0

Using (2.4.29) in u (x, y) ≤ z (x, y) we get the desired inequality in (2.4.24). The case when c ≥ 0 follows as noted in the proof of Theorem 2.4.1, part (a1 ).

92


(c2 ) The proof can be completed by following the proof of (c1 ) and closely looking at the proof of Theorem 5.2.1 given in [34]. Here we leave the details to the reader. Remark 2.4.2. We note that, by following the proof of Theorem 2.2.1, one can very easily obtain the bounds on the inequalities in Theorems 2.4.2 and 2.4.3, when the constant c is replaced by the function c(x, y) satisfying some suitable conditions. The inequalities embodied in the following theorem are established in [78]. Theorem 2.4.4.

Let u (t, s) , a (t, s) , b (t, s) ∈ C (∆, R+ ) .

(d1 ) For i = 1, ..., n let the functions Li ∈ C (∆i × R+ , R+ ) satisfy the conditions 0 ≤ Li (t1 , ..., ti , s1 , ..., si , x (ti , si )) − Li (t1 , ..., ti , s1 , ..., si , y (ti , si )) ≤ Mi (t1 , ..., ti , s1 , ..., si , y (ti , si )) (x (ti , si ) − y (ti , si )) ,

(2.4.30)

for (t1 , ..., ti , s1 , ..., si ,) ∈ ∆i and x (ti , si ) ≥ y (ti , si ) ≥ 0, where Mi ∈ C (∆i × R+ , R+ ). If u (s, t) ≤ a (s, t) + b (s, t)

n X

Hi [u] (t, s) ,

(2.4.31)

i=1

for (t, s) ∈ ∆, then 



Zt Zs

u (s, t) ≤ a (s, t) + b (s, t) P (s, t) exp 

Q (t1 , s1 ) ds1 dt1  , 0

(2.4.32)

0

for (t, s) ∈ ∆, where P (s, t), Q(s, t) are given by (2.4.4),(2.4.5). (d2 ) Let Ψ ∈ C (R+ , R+ ) be strictly increasing function with Ψ (0) = 0 and Ψ−1 is the inverse function of Ψ. For i = 1, ..., n let the functions Li ∈ C (∆i × R+ , R+ ) satisfy the conditions 0 ≤ Li (t1 , ..., ti , s1 , ..., si , x (ti , si )) − Li (t1 , ..., ti , s1 , ..., si , y (ti , si )) ≤ Mi (t1 , ..., ti , s1 , ..., si , y (ti , si )) ψ −1 (x (ti , si ) − y (ti , si )) ,

(2.4.33)

for (t1 , ..., ti , s1 , ..., si ,) ∈ ∆i and x (ti , si ) ≥ y (ti , si ) ≥ 0, where Mi ∈ C (∆i × R+ , R+ ). If ! n X Hi [u] (t, s) , (2.4.34) u (s, t) ≤ a (s, t) + ψ b (s, t) i=1

Chapter 2

93

for (x, y) ∈ ∆, then 





Zt Zs

u (t, s) ≤ a (t, s)+Ψ b (t, s) P (t, s) exp 

Q (t1 , s1 ) ds1 dt1  , (2.4.35) 0

0

For (t, s) ∈ ∆,, where P (t, s), Q(t, s) are given by (2.4.4), (2.4.5). (d3 ) Let Li , Mi , Ψ, ψ −1 be as in part (d2 ) and the conditions in (2.4.33) and ψ −1 (xy) ≤ ψ −1 (x) ψ −1 (y) ,

(2.4.36)

for all x, y ∈ R+ hold. If u (t, s) ≤ a (t, s) + b (t, s) Ψ

n X

! Hi [u] (t, s) ,

(2.4.37)

i=1

for (t, s) ∈ ∆, then 





Zt Zs

u (t, s) ≤ a (t, s)+b (t, s) Ψ P (t, s) exp 

Q1 (t1 , s1 ) ds1 dt1  , (2.4.38) 0

0

for (t, s) ∈ ∆, where P (t, s) is given by (2.4.4) and Q1 (t, s) is obtained by replacing b(t, s) by ψ −1 (b (t, s)) on the right hand side of (2.4.5). (d4 ) For i = 1, ..., n, let Li , Mi be as in part (d1 ) and (2.4.30) hold. Let g(u) be as in Theorem 2.4.2, part (b2 ). If ! n X Hi [u] (t, s) , (2.4.39) u (t, s) ≤ a (t, s) + b (t, s) g i=1

for (t, s) ∈ ∆, then for 0 ≤ t ≤ t¯, 0 ≤ s ≤ s¯; t, t¯ ∈ I, s, s¯ ∈ J, u (t, s) ≤ a (t, s) + b (t, s) g G−1 [G (P (t, s))  Zs Zt + Q (t1 , s1 ) dt1 ds1  , 0

(2.4.40)

0

where P (s, t), Q(s, t) are given by (2.4.4),(2.4.5), G, G−1 be as in Theorem 2.4.2, part (b2 ) and (t¯, s¯) ∈ ∆ be chosen so that Zt Zs G (P (t, s)) + 0

Q (t1 , s1 ) ds1 dt1 ∈ Dom G−1 ,

0

for all (t, s) ∈ ∆ such that 0 ≤ t ≤ t¯, 0 ≤ s ≤ s¯.

94

Integral inequalities in two variables (d1 ) Define a function z(t, s) by

Proof.

z (t, s) =

n X

Hi [u] (t, s)

i=1

Zt Zs L1 (t1 , s1 , u (t1 , s1 )) ds1 dt1

= 0

0

Zt

Zs

+



Zt1 Zs1

L2 (t1 , t2 , s1 , s2 , u (t2 , s2 )) ds2 dt2  ds1 dt1 + ...

 0

0



0

0

 tn−1 sn−1  Zt Zs Zt1 Zs1 Z Z  ...  Ln (t1 , ...tn , s1 , ..., sn , u (tn , sn )) dsn dtn + 0

0

0

0

0

0

) dsn−1 dtn−1 ...) ds1 dt1 .

(2.4.41)

Then z(t, 0) = z(0, s) = 0, z(t, s) is nondecreasing for (t, s) ∈ ∆ and (2.4.31) can be restated as u (t, s) ≤ a (t, s) + b (t, s) z (t, s) .

(2.4.42)

From (2.4.41), (2.4.42) and the hypotheses we observe that Zt Zs z (s, t) ≤

[{L1 (t1 , s1 , a (t1 , s1 ) + b (t1 , s1 ) z (t1 , s1 )) 0

0

−L1 (t1 , s1 , a (t1 , s1 ))} + L1 (t1 , s1 , a (t1 , s1 ))] ds1 dt1  Zt Zs Zt1 Zs1  + [{L2 (t1 , t2 , s1 , s2 , a (t2 , s2 ) + b (t2 , s2 ) z (t2 , s2 )) 0

0

0

0

−L2 (t1 , t2 , s1 , s2 , a (t2 , s2 ))} + L2 (t1 , t2 , s1 , s2 , a (t2 , s2 ))] ds2 dt2 ) ds1 dt1 + ...  tn−1 sn−1  Zt Zs Zt1 Zs1 Z Z  ...  [{Ln (t1 , ..., tn , s1 , ..., sn , + 0

0

0

0

0

0

a (tn , sn ) + b (tn , sn ) z (tn , sn )) −Ln (t1 , ..., tn , s1 , ..., sn , a (tn , sn ))} + Ln (t1 , ..., tn , s1 , ..., sn , a (tn , sn ))] ×dsn dtn ) dsn−1 dtn−1 ...) ds1 dt1 Zt Zs ≤ P (s, t) +

M1 (t1 , s1 , a (t1 , s1 )) b (t1 , s1 ) z (t1 , s1 )ds1 dt1 0

0

Chapter 2 Zt Zs + 0

t s  Z1Z 1  M2 (t1 , t2 , s1 , s2 , a (t2 , s2 )) b (t2 , s2 ) z (t2 , s2 ) ds2 dt2 ds1 dt1 +...

0

0

Zt Zs + 0

95

0

0

 t s  tn−1 sn−1 Z1Z 1 Z Z   ... Mn (t1 , ..., tn , s1 , ..., sn , a (tn , sn )) 0

0

0

0

×b (tn , sn ) z (tn , sn ) dsn dtn ) dsn−1 dtn−1 ...) ds1 dt1 Zt Zs ≤ P (t, s) +

Q (t1 , s1 )z (t1 , s1 ) ds1 dt1 . 0

(2.4.43)

0

Clearly P (t, s) is continuous, nonnegative and nondecreasing in (t, s) ∈ ∆. Now a suitable application of Theorem 4.2.2 given in [34, p. 325] to (2.4.43) yields   t s Z Z Q (t1 , s1 )ds1 dt1  . z (t, s) ≤ P (t, s) exp  0

(2.4.44)

0

Using (2.4.44) in (2.4.42) we get (2.4.32). The proofs of the remaining inequalities can be completed by following the proof of (d1 ) and closely looking at the proof of Theorem 1.4.4, parts (d2 ) − (d4 ) and the similar results given in [34]. Here we omit the details. Remark 2.4.3. If we take L1 = L and Li = 0 for i = 2, ..., n in the inequality established in (d1 ), then we get the inequality given in Theorem 5.3.1, part (i) in [34]. The inequalities in parts (d2 ) − (d4 ) can be considered as further generalizations of the inequality in Theorem 5.3.1, part (i) given in [34]

2.5 Estimates on some integral inequalities In the qualitative analysis of certain classes of differential,integral and integrodifferential equations some specific type of integral inequalities play a vital role. In this section we offer some such integral inequalities established by Pachpatte in [41,48,62,72,76] involving functions of two variables. The following two theorems contain the inequalities investigated in [62] and [72] respectively, which can be used in some applications.

96


Theorem 2.5.1. Let I = [0, α] , J = [0, β] and ∆ = I×J. Let u (x, y) , p (x, y) , f (x, y) , g (x, y) , h (x, y) ∈ C (∆, R+ ) and suppose that Zx Zy

Zx u (x, y) ≤ c +

p (s, y) u (s, y) ds + 0

0

0

Zα Zβ

Zs Zt +

g (σ, τ )u (σ, τ ) dτ dσ + 0

f (s, t) [u (s, t)

0

 h (σ, τ )u (σ, τ ) dτ dσ  dtds,

0

(2.5.1)

0

for (x, y) ∈ ∆, where c ≥ 0 is a real constant. If Zα Zβ k= 0

 σ τ  Z Z h (σ, τ )A (σ, τ ) exp  A (s, t) [f (s, t) + g (s, t)] dtds

0

0

0

×dτ dσ < 1,

(2.5.2)

where 



Zx

p (s, y) ds ,

A (x, y) = exp 

(2.5.3)

0

for (x, y) ∈ ∆, then  x y  Z Z c A (x, y) exp  u (x, y) ≤ A (s, t) [f (s, t) + g (s, t)] dtds , (2.5.4) 1−k 0

0

for (x, y) ∈ ∆ . Proof. Let c > 0 and define a function z(x, y) by Zx Zy

Zs Zt f (s, t) [u (s, t) +

z (x, y) = 0

0

g (σ, τ )u (σ, τ ) dτ dσ 0

Zα Zβ

0

 h (σ, τ )u (σ, τ ) dτ dσ  dtds.

+ 0

(2.5.5)

0

Then (2.5.1) can be restated as Zx u (x, y) ≤ z (x, y) +

p (s, y) u (s, y) ds. 0

(2.5.6)

Chapter 2

97

It is easy to observe that z(x, y) is positive, continuous and nondecreasing function for (x, y) ∈ ∆. Treating y fixed in (2.5.6) and using Theorem 1.3.1 given in [34] to (2.5.6) we get u (x, y) ≤ A (x, y) z (x, y) ,

(2.5.7)

for (x, y) ∈ ∆, where A(x, y) is defined by (2.5.3). From (2.5.5), (2.5.7) and the fact that A (x, y) ≥ 1, we observe that Zx Zy z (x, y) ≤ c +

Zs Zt f (s, t) [A (s, t) z (s, t) +

0

0

0

Zα Zβ +

g (σ, τ )A (σ, τ ) z (σ, τ ) dτ dσ 0

 h (σ, τ )A (σ, τ ) z (σ, τ ) dτ dσ  dtds.

0

(2.5.8)

0

Define a function v(x, y) by the right hand side of (2.5.8). Then v(x, y) > 0, v(0, y) = v(x, 0) = c, z (x, y) ≤ v (x, y) and  Zx Zy g (σ, τ ) A (σ, τ ) z (σ, τ ) dτ dσ D2 D1 v (x, y) = f (x, y) A (x, y) z (x, y) + 0

Zα Zβ +

0

 h (σ, τ )A (σ, τ ) z (σ, τ ) dτ dσ 

0

0

Zx Zy

 ≤ f (x, y) A (x, y) v (x, y) +

g (σ, τ ) A (σ, τ ) v (σ, τ ) dτ dσ 0

Zα Zβ

0

 h (σ, τ )A (σ, τ ) v (σ, τ ) dτ dσ  .

+ 0

(2.5.9)

0

Define a function w(x, y) by Zx Zy w (x, y) = v (x, y) +

g (σ, τ )A (σ, τ ) v (σ, τ ) dτ dσ 0

0

Zα Zβ +

h (σ, τ )A (σ, τ ) v (σ, τ ) dτ dσ, 0

0

then w(x, y) > 0, v (x, y) ≤ w (x, y), D2 D1 v (x, y) ≤ f (x, y) A (x, y) w (x, y), Zα Zβ w (0, y) = w (x, 0) = c+

h (σ, τ )A (σ, τ ) v (σ, τ ) dτ dσ = L (say) , (2.5.10) 0

0

98


and D2 D1 w (x, y) = D2 D1 v (x, y) + g (x, y) A (x, y) v (x, y) ≤ f (x, y) A (x, y) w (x, y) + g (x, y) A (x, y) w (x, y) = A (x, y) [f (x, y) + g (x, y)] w (x, y) .

(2.5.11)

Now by following the proof of Theorem 4.2.1 given in [34], the inequality (2.5.11) implies the estimate  x y  Z Z w (x, y) ≤ L exp  A (s, t) [f (s, t) + g (s, t)] dtds . (2.5.12) 0

0

Using (2.5.12) in v (x, y) ≤ w (x, y) we get  x y  Z Z v (x, y) ≤ L exp  A (s, t) [f (s, t) + g (s, t)] dtds . 0

(2.5.13)

0

From (2.5.10), (2.5.13) and (2.5.2) it is easy to observe that L≤

c . 1−k

(2.5.14)

Using (2.5.14) in (2.5.13) and the facts that z (x, y) ≤ v (x, y) , u (x, y) ≤ A (x, y) z (x, y) we get the desired inequality in (2.5.4). The proof of the case when c ≥ 0 follows as mentioned in the proof of Theorem 2.4.2,part (b1 ). Remark 2.5.1. We note that, in the special cases when (i)p = 0, (ii)g = 0, (iii)h = 0, the inequality in Theorem 2.5.1 reduces to the new inequalities which can be used as tools in different applications. Theorem 2.5.2. Let I, J, ∆ be as in Theorem 2.5.1 and D = (x, y, s, t) ∈ ∆2 : 0 ≤ s ≤ x ≤ α, 0 ≤ t ≤ y ≤ β , E = (x, y, s, t, σ, τ ) ∈ ∆3 : 0 ≤ σ ≤ s ≤ x ≤ α, 0 ≤ τ ≤ t ≤ y ≤ β . Let u (x, y) ∈ C (∆, R+ ) and c ≥ 0 be a real constant. (a1 ) Let k (x, y, s, t) , e (x, y, s, t) ∈ C (D, R+ ) , h (x, y, s, t, σ, τ ) ∈ C (E, R+ ) be nondecreasing in (x, y) ∈ ∆ for fixed (s, t) ∈ ∆, (s, t, σ, τ ) ∈ ∆2 and suppose that Zx Zy u (x, y) ≤ c +

k (x, y, s, t) u (s, t) dtds 0

0

Chapter 2 Zx Zy + 0

99

  s t Z Z  h (x, y, s, t, σ, τ ) u (σ, τ ) dτ dσ dtds

0

0

0

Zα Zβ +

e (x, y, s, t) u (s, t) dtds 0

(2.5.15)

0

for (x, y) ∈ ∆. If Zα Zβ e (x, y, s, t)

p (x, y) = 0



0

Zs Zt

× exp 

[k (s, t, m, n) 0

0



Zm Zn



h (x, y, m, n, σ, τ ) dτ dσ  dndm dtds < 1,

+ 0

(2.5.16)

0

for (x, y) ∈ ∆, then  s t Z Z c exp  [k (s, t, m, n) u (x, y) ≤ 1 − p (x, y) 0

Zm Zn +

0





h (x, y, m, n, σ, τ ) dτ dσ  dndm , 0

(2.5.17)

0

for (x, y) ∈ ∆. (a2 ) Let a (x, y) , b (x, y) ∈ C (∆, R+ ), k (x, y, s, t) ∈ C (D, R+ ) , h (x, y, s, t, σ, τ ) ∈ C (E, R+ ) and suppose that Zx Zy u (x, y) ≤ c +


0

  Zx Zy Zs Zt  k (s, t, σ, τ ) u (σ, τ )dτ dσ dtds + 0

0

Zx

Zy

0

0

+

0

0

   s t σ τ Z Z Z Z   h (s, t, σ, τ, m, n) u (m, n) dndmdτ dσ dtds 0

0

0

0

100

Integral inequalities in two variables Zα Zβ +

b (s, t) u (s, t) dtds, 0

(2.5.18)

0

for (x, y) ∈ ∆. If Zα Zβ q= 0

 s t  Z Z b (s, t) exp  Q (ξ, η) dηdξ dtds < 1,

0

0

(2.5.19)

0

where Zx Zy Q (x, y) = a (x, y) +

k (x, y, σ, τ ) dτ dσ 0

Zx Zy + 0

0

  σ τ Z Z  h (x, y, σ, τ, m, n) dndm dτ dσ,

0

0

(2.5.20)

0

for (x, y) ∈ ∆, then  u (x, y) ≤

c exp  1−q

Zx Zy

 Q (s, t) dtds ,

0

(2.5.21)

0

for (x, y) ∈ ∆. Proof. (a1 ) First assume that c > 0 and fix any arbitrary element (X, Y ) ∈ ∆. Then for 0 ≤ x ≤ X, 0 ≤ y ≤ Y we have Zx Zy u (x, y) ≤ c +

k (X, Y, s, t) u (s, t) dtds 0

Zx Zy +



0



Zs Zt

h (X, Y, s, t, σ, τ ) u (σ, τ ) dτ dσ dtds

 0

0

0

0

Zα Zβ +

e (X, Y, s, t) u (s, t) dtds. 0

(2.5.22)

0

Let Zα Zβ d(X, Y ) = c +

e (X, Y, s, t) u (s, t) dtds, 0

0

(2.5.23)

Chapter 2

101

then (2.5.22) can be restated as Zx Zy u (x, y) ≤ d(X, Y ) +

k (X, Y, s, t) u (s, t) dtds 0

0

  Zx Zy Zs Zt  + h (X, Y, s, t, σ, τ ) u (σ, τ ) dτ dσ dtds, 0

0

0

(2.5.24)

0

for 0 ≤ x ≤ X, 0 ≤ y ≤ Y . Define a function z(x, y, X, Y ) by the right hand side of (2.5.24). Then z(x, y, X, Y ) > 0, z(0, y, X, Y ) = z(x, 0, X, Y ) = d(X, Y ), u (x, y) ≤ z (x, y, X, Y ), z(x, y, X, Y ) is nondecreasing in both the variables x, y lying in 0 ≤ x ≤ X, 0 ≤ y ≤ Y and Zx Zy D2 D1 z (x, y, X, Y ) = k (X, Y, x, y) u (x, y)+

h (X, Y, x, y, σ, τ ) u (σ, τ ) dτ dσ 0

0

Zx Zy

 ≤ k (X, Y, x, y) +

 h (X, Y, x, y, σ, τ ) dτ dσ  z (x, y) .

0

(2.5.25)

0

Now by following the proof of Theorem 4.2.1 given in [34] from (2.5.25) we get  x y Z Z [k (X, Y, m, n) z (x, y) ≤ d exp  0

0



Zm Zn +



h (X, Y, m, n, σ, τ ) dτ dσ  dndm , 0

(2.5.26)

0

for 0 ≤ x ≤ X, 0 ≤ y ≤ Y . Since (X, Y ) ∈ ∆ is arbitrary, from (2.5.26), (2.5.23) with (X, Y ) replaced by (x, y) and u (x, y) ≤ z (x, y, x, y) we have  x y Z Z [k (x, y, m, n) u (x, y) ≤ d exp  0



Zm Zn +

0



h (x, y, m, n, σ, τ ) dτ dσ  dndm , 0

(2.5.27)

0

for (x, y) ∈ ∆, where Zα Zβ e (x, y, s, t) u (s, t) dtds,

d(x, y) = c + 0

0

(2.5.28)

102


for (x, y) ∈ ∆. Using (2.5.27), in the integrand on the right hand side of (2.5.28) and in view of (2.5.16) we have c . 1 − p (x, y)

d(x, y) ≤

(2.5.29)

Using (2.5.29) in (2.5.27) we get the required inequality in (2.5.17). The proof of the case when c ≥ 0 follows as noted in the proof of Theorem 2.4.1, part (a1 ). (a2 ) Let c > 0 and denote Zα Zβ

0

d =c+

b (s, t) u (s, t) dtds. 0

(2.5.30)

0

Then (2.5.18) can be restated as Zx Zy

0

u (x, y) ≤ d +


Zx Zy +



0

Zy

0

0

+

0



Zs Zt

k (s, t, σ, τ ) u (σ, τ ) dτ dσ dtds



Zx

0

0

0

   s t σ τ Z Z Z Z   h (s, t, σ, τ, m, n) u (m, n) dndm dτ dσ  dtds. (2.5.31) 0

0

0

0

Define a function z(x, y) by the right hand side of (2.5.31). Then z(x, y) > 0, z(0, y) = z(x, 0) = d0 , u (x, y) ≤ z (x, y) , z(x, y) is nondecreasing in both the variables (x, y) ∈ ∆ and Zs Zt D2 D1 z (x, y) = a (x, y) u (x, y) +

k (x, y, σ, τ ) u (σ, τ ) dτ dσ 0

Zx Zy +



0



Zσ Zτ

h (x, y, σ, τ, m, n) u (m, n) dndm dτ dσ

 0

0

0

0

≤ Q (x, y) z (x, y) ,

(2.5.32)

where Q(x, y) is given by (2.5.20). The rest of the proof can be completed by following the proof of Theorem 4.2.1 given in [34] and closely looking at the proof of (a1 ) given above. Remark 2.5.2. In the various special cases the inequalities given in Theorem 2.5.2 reduces to different inequalities which can be used as tools in variety of applications.

Chapter 2

103

The following three theorems contain the inequalities investigated in [41] which can be used more conveniently in certain applications. 2 , R+ . Theorem 2.5.3. Let u (x, y) , a (x, y) , b (x, y) , c (x, y) ∈ C R+ (b1 ) If Zx Z∞ u (x, y) ≤ a (x, y) + b (x, y)


(2.5.33)

y

for x, y ∈ R+ , then  x ∞  Z Z u (x, y) ≤ a (x, y) + b (x, y) e (x, y) exp  c (s, t) b (s, t) dtds (2.5.34) 0

y

for x, y ∈ R+ , where Zx Z∞ c (s, t) a (s, t) dtds,

e (x, y) = 0

(2.5.35)

y

for x, y ∈ R+ . (b2 ) If Z∞ Z∞ u (x, y) ≤ a (x, y) + b (x, y)

c (s, t) u (s, t) dtds, x

(2.5.36)

y

for x, y ∈ R+ , then ∞∞  Z Z u (x, y) ≤ a (x, y) + b (x, y) e¯ (x, y) exp  c (s, t) b (s, t) dtds , (2.5.37) x

y

for x, y ∈ R+ , where Z∞ Z∞ c (s, t) a (s, t) dtds,

e¯ (x, y) = x

y

for x, y ∈ R+ . 2 , R+ . Theorem 2.5.4. Let u (x, y) , a (x, y) , b (x, y) , c (x, y) ∈ C R+

(2.5.38)

104


(c1 ) Assume that a(x, y) is nondecreasing for x ∈ R+ . If Zx Z∞

Zx u (x, y) ≤ a (x, y) +

b (s, y) u (s, y) ds+ 0

c (s, t) u (s, t) dtds, (2.5.39) 0

y

for x, y ∈ R+ , then u (x, y) ≤ p (x, y) [a (x, y)   x ∞ Z Z c (s, t) p (s, t) dtds , +A (x, y) exp  0

(2.5.40)

y

for x, y ∈ R+ , where  x  Z p (x, y) = exp  b (s, y) ds ,

(2.5.41)

0

Zx Z∞ A (x, y) =

c (s, t) p (s, t) a (s, t) dtds, 0

(2.5.42)

y

for x, y ∈ R+ . (c2 ) Assume that a(x, y) is nonincreasing for x ∈ R+ . If Z∞ u (x, y) ≤ a (x, y) +

Z∞ Z∞ b (s, y) u (s, y) ds+

x

c (s, t) u (s, t) dtds, (2.5.43) x

y

for x, y ∈ R+ , then u (x, y) ≤ p¯ (x, y) [a (x, y) ∞∞  Z Z +A¯ (x, y) exp  c (s, t) p¯ (s, t) dtds , x

(2.5.44)

y

for x, y ∈ R+ , where ∞  Z p¯ (x, y) = exp  b (s, y) ds ,

(2.5.45)

x

A¯ (x, y) =

Z∞ Z∞ c (s, t) p¯ (s, t) a (s, t) dtds, x

for x, y ∈ R+ .

y

(2.5.46)

Chapter 2

105

2 3 , R+ and F ∈ C R+ Theorem 2.5.5. Let u (x, y) , a (x, y) , b (x, y) ∈ C R+ , R+ ) satisfies the condition 0 ≤ F (x, y, u) − F (x, y, v) ≤ K (x, y, v) (u − v) , 3 , R+ . for u ≥ v ≥ 0, where K ∈ C R+

(2.5.47)

(d1 ) Assume that a(x, y) is nondecreasing for x ∈ R+ . If Zx Z∞

Zx u (x, y) ≤ a (x, y) +

b (s, y) u (s, y) ds+ 0

F (s, t, u (s, t)) dtds, (2.5.48) 0

y

for x, y ∈ R+ , then u (x, y) ≤ p (x, y) [a (x, y)   x ∞ Z Z K (s, t, p (s, t) a (s, t)) p (s, t) dtds , +B (x, y) exp  0

(2.5.49)

y

for x, y ∈ R+ , where p(x, y) is defined by (2.5.41) and Zx Z∞ B (x, y) =

F (s, t, p (s, t) a (s, t)) dtds, 0

(2.5.50)

y

for x, y ∈ R+ . (d2 ) Assume that a(x, y) is nonincreasing for x ∈ R+ .If Z∞ u (x, y) ≤ a (x, y) +

Z∞ Z∞ b (s, y) u (s, y) ds+

x

F (s, t, u (s, t)) dtds, (2.5.51) x

y

for x, y ∈ R+ , then u (x, y) ≤ p¯ (x, y) [a (x, y)  ∞∞ Z Z ¯ (x, y) exp  K (s, t, p¯ (s, t) a (s, t)) p¯ (s, t) dtds , +B x

(2.5.52)

y

for x, y ∈ R+ , where p¯ (x, y) is defined by (2.5.45) and ¯ (x, y) = B

Z∞ Z∞ F (s, t, p¯ (s, t) a (s, t)) dtds, x

for x, y ∈ R+ .

y

(2.5.53)

106


Proofs of Theorems 2.5.3-2.5.5. Since the proofs resemble one another, we give the details for (b1 ) , (c1 ) and (d1 ); the proofs of (b2 ) , (c2 ) and (d2 ) can be completed by following the proofs of the above mentioned results with suitable changes. (b1 ) Define a function z(x, y) by Zx Z∞ c (s, t) u (s, t) dtds,

z (x, y) =

(2.5.54)

y

0

then (2.5.33) can be restated as u (x, y) ≤ a (x, y) + b (x, y) z (x, y) .

(2.5.55)

From (2.5.54) and (2.5.55) we have Zx Z∞ z (x, y) ≤

c (s, t) [a (s, t) + b (s, t) z (s, t)] dtds, y

0

Zx Z∞ c (s, t) b (s, t) z (s, t) dtds,

= e (x, y) + 0

(2.5.56)

y

where e(x, y) is defined by (2.5.35). Clearly e(x, y) is nonnegative, continuous, nondecreasing in x and nonincreasing in y for x, y ∈ R+ . First we assume that e(x, y) > 0 for x, y ∈ R+ . From (2.5.56) it is easy to observe that z (x, y) ≤1+ e (x, y)

Zx Z∞ c (s, t) b (s, t) 0

z (s, t) dtds. e (s, t)

(2.5.57)

y

Define a function v(x, y) by the right hand side of (2.5.57), then v(x, y) > 0, v (0, y) = v (x, ∞) = 1, z(x,y) e(x,y) ≤ v (x, y), v(x, y) is nonincreasing in y, y ∈ R+ and Z∞ D1 v (x, y) =

c (x, t) b (x, t)

z (x, t) dt e (x, t)

y

Z∞ ≤

c (x, t) b (x, t) v (x, t)dt y

Z∞ ≤ v (x, y)

c (x, t) b (x, t)dt. y

(2.5.58)

Chapter 2

107

Treating y, y ∈ R+ fixed in (2.5.58), dividing both sides of (2.5.58) by v(x, y), setting x = s and integrating the resulting inequality from 0 to x, x ∈ R+ we get  x ∞  Z Z v (x, y) ≤ exp  c (s, t) b (s, t) dtds . (2.5.59) 0

y

z(x,y) e(x,y)

≤ v (x, y) we have   x ∞ Z Z c (s, t) b (s, t) dtds . z (x, y) ≤ e (x, y) exp 

Using (2.5.59) in

0

(2.5.60)

y

The desired inequality in (2.5.34) follows from (2.5.55) and (2.5.60). The proof of the case when e (x, y) ≥ 0 follows as mentioned in the proof of Theorem 2.2.1. (c1 ) Define a function z(x, y) by Zx Z∞ z (x, y) = a (x, y) +

c (s, t) u (s, t) dtds. 0

(2.5.61)

y


b (s, y) u (s, y) ds.

(2.5.62)

0

Clearly z(x, y) is nonnegative, continuous and nondecreasing function in x, x ∈ R+ . Treating y, y ∈ R+ fixed in (2.5.62) and using the inequality given in Lemma 2, part (α1 ) in [41], (see also [34]) to (2.5.62) we get u (x, y) ≤ z(x, y)p(x, y),

(2.5.63)

where p(x, y) is defined by (2.5.41). From (2.5.63) and (2.5.61) we have u (x, y) ≤ p(x, y) [a(x, y) + v(x, y)] ,

(2.5.64)

where Zx Z∞ c (s, t) u (s, t) dtds.

v (x, y) = 0

y

From (2.5.64) and (2.5.65) we get Zx Z∞ v (x, y) ≤

c (s, t) p (s, t) [a(s, t) + v(s, t)] dtds 0

y

(2.5.65)

108

Integral inequalities in two variables Zx Z∞ = A (x, y) +

c (s, t) p(s, t)v(s, t)dtds, 0

y

where A(x, y) is defined by (2.5.42). Clearly A(x, y) is nonnegative, continuous, nondecreasing in x, x ∈ R+ and nonincreasing in y, y ∈ R+ . Now by following the proof of (b1 ) we obtain   x ∞ Z Z c (s, t) p (s, t) dtds . (2.5.66) v (x, y) ≤ A (x, y) exp  0

y

Using (2.5.66) in (2.5.64) we get the required inequality in (2.5.40). (d1 ) Define a function z(x, y) by Zx Z∞ z (x, y) = a (x, y) +

F (s, t, u (s, t)) dtds. 0

(2.5.67)

y


b (s, y) u (s, y) ds.

(2.5.68)

0

Clearly z(x, y) is nonnegative, continuous and nondecreasing function in x, x ∈ R+ . Treating y, y ∈ R+ fixed in (2.5.68) and using the inequality given in Lemma 2.1, part (α1 ) in [41] (see also [34]) to (2.5.68) we obtain u (x, y) ≤ z(x, y)p(x, y),

(2.5.69)

where p(x, y) is defined by (2.5.41). From (2.5.69) and (2.5.67) we have u (x, y) ≤ p(x, y) [a(x, y) + v(x, y)] ,

(2.5.70)

where Zx Z∞ F (s, t, u (s, t)) dtds.

v (x, y) = 0

y

From (2.5.71), (2.5.70) and the hypotheses on F it follows that Zx Z∞ v (x, y) ≤

[{F (s, t, p (s, t) [a (s, t) + v (s, t)]) 0

y

−F (s, t, p (s, t) a (s, t))} + F (s, t, p (s, t) a (s, t))] dtds

(2.5.71)

Chapter 2

109

Zx Z∞ ≤ B (x, y) +

K (s, t, p(s, t)a(s, t)) p(s, t)v(s, t)dtds, 0

(2.5.72)

y

where B(x, y) is defined by (2.5.50). Clearly B(x, y) is nonnegative, continuous and nondecreasing in x and nonincreasing in y for x, y ∈ R+ . By following the proof of part (b1 ) we get  x ∞  Z Z v (x, y) ≤ B (x, y) exp  K (s, t, p(s, t)a(s, t)) p(s, t)dtds . (2.5.73) 0

y

The required inequality in (2.5.49) follows from (2.5.70) and (2.5.73). The next theorem deals with the inequalities proved in [48]. 2 Theorem 2.5.6. Let u (x, y) , a (x, y) , b (x, y) , c (x, y) ∈ C R+ , R+ and p > 1 be a real constant. (k1 ) If Zx Z∞

p

u (x, y) ≤ a (x, y) + b (x, y)


(2.5.74)

y

for x, y ∈ R+ , then u (x, y) ≤ [a (x, y) + b (x, y) A (x, y)   p1  x ∞ Z Z b (s, t)  dtds , × exp  c (s, t) p 0

(2.5.75)

y

for x, y ∈ R+ , where Zx Z∞

c (s, t)

A (x, y) = 0

p − 1 a (s, t) + p p

dtds,

(2.5.76)

y

for x, y ∈ R+ . 3 (k2 ) Let L ∈ C R+ , R+ satisfies the condition 0 ≤ L (x, y, u) − L (x, y, v) ≤ G (x, y, v) (u − v) , 3 for u ≥ v ≥ 0, where G ∈ C R+ , R+ . If p

(2.5.77)

Zx Z∞

u (x, y) ≤ a (x, y) + b (x, y)

L (s, t, u (s, t)) dtds, 0

y

(2.5.78)

110


for x, y ∈ R+ , then u (x, y) ≤ a (x, y) + b (x, y) A¯ (x, y)  p1  x ∞ Z Z a (s, t) b (s, t) p − 1 + dtds , G s, t, × exp  p p p

(2.5.79)

y

0

for x, y ∈ R+ , where A¯ (x, y) =

Zx Z∞ p − 1 a (s, t) + dtds, L s, t, p p 0

(2.5.80)

y

for x, y ∈ R+ . Proof. (k1 ) Define a function z(x, y) by Zx Z∞ z (x, y) =


(2.5.81)

y

then (2.5.74) can be restated as up (x, y) ≤ a (x, y) + b (x, y) u (x, y) .

(2.5.82)

As in the proof of Theorem 2.3.3, part (c1 ), from (2.5.82) and using the elementary inequality (1.3.11) (see [30, p. 30]) we get u (x, y) ≤

p − 1 a (x, y) b (x, y) + + z (x, y) . p p p

(2.5.83)

From (2.5.81) and (2.5.83) we have Zx Z∞ z (x, y) ≤

c (s, t)

0

p − 1 a (s, t) b (s, t) + + z (s, s) dtds p p p

y

Zx Z∞ = A (x, y) +

c (s, t) 0

b (s, t) z (s, s) dtds, p

y

where A(x, y) is defined by (2.5.76). The rest of the proof follows by the similar argument as in the proof of Theorem 2.5.3, part (b1 ). (k2 ) The proof can be completed by closely looking at the proof of (k1 ) given above and the proof of Theorem 2.3.4, part (d1 ). Here we omit the details. The inequalities in the following theorem are established in [76].

Chapter 2

111

2 Let u (x, y) , a (x, y) , b (x, y) , c (x, y) , f (x, y) , g (x, y) ∈ C R+

Theorem 2.5.7. , R+ ) .

(r1 ) Suppose that Zx Zy u (x, y) ≤ a (x, y) + b (x, y)

f (s, t) u (s, t) dtds 0

0

Z∞ Z∞ g (s, t) u (s, t) dtds,

+c (x, y) 0

(2.5.84)

0

for x, y ∈ R+ . If Z∞ Z∞ p1 =

g (s, t) D1 (s, t) dtds < 1,

(2.5.85)

u (x, y) ≤ B1 (x, y) + M1 D1 (x, y) ,

(2.5.86)

0

0

then

for x, y ∈ R+ , where Zx Zy B1 (x, y) = a (x, y) + b (x, y) A1 (x, y) 0

f (s, t) a (s, t) dtds,

(2.5.87)

f (s, t) c (s, t) dtds,

(2.5.88)

0

Zx Zy D1 (x, y) = c (x, y) + b (x, y) A1 (x, y) 0

0

  x y Z Z A1 (x, y) = exp  f (s, t) b (s, t) dtds , 0

(2.5.89)

0

and 1 M1 = 1 − p1

Z∞ Z∞ g (s, t) B1 (s, t) dtds. 0

0

(r2 ) Suppose that Z∞ Z∞ u (x, y) ≤ a (x, y) + b (x, y)

f (s, t) u (s, t) dtds x

y

(2.5.90)

112

Integral inequalities in two variables Z∞ Z∞ +c (x, y)

g (s, t) u (s, t) dtds, 0

(2.5.91)

0

for x, y ∈ R+ . If Z∞ Z∞ p2 =

g (s, t) D2 (s, t) dtds < 1,

(2.5.92)

u (x, y) ≤ B2 (x, y) + M2 D2 (x, y) ,

(2.5.93)

0

0

then

for x, y ∈ R+ , where Z∞ Z∞ B2 (x, y) = a (x, y) + b (x, y) A2 (x, y) x


(2.5.94)


(2.5.95)

y

Z∞ Z∞ D2 (x, y) = c (x, y) + b (x, y) A2 (x, y) x

y

∞∞  Z Z f (s, t) b (s, t) dtds , A2 (x, y) = exp  x

(2.5.96)

y

and 1 M2 = 1 − p2

Z∞ Z∞ g (s, t) B2 (s, t) dtds. x

(2.5.97)

y

(r3 ) Suppose that Zx Z∞ u (x, y) ≤ a (x, y) + b (x, y)

f (s, t) u (s, t) dtds 0

y

Z∞ Z∞ +c (x, y)

g (s, t) u (s, t) dtds, 0

(2.5.98)

0

for x, y ∈ R+ . If Z∞ Z∞ p3 =

g (s, t) D3 (s, t) dtds < 1, 0

0

(2.5.99)

Chapter 2

113

then u (x, y) ≤ B3 (x, y) + M3 D3 (x, y) ,

(2.5.100)

for x, y ∈ R+ , where Zx Z∞ B3 (x, y) = a (x, y) + b (x, y) A3 (x, y) 0


(2.5.101)


(2.5.102)

y

Zx Z∞ D3 (x, y) = c (x, y) + b (x, y) A3 (x, y) 0



Zx Z∞

A3 (x, y) = exp  0

y

 f (s, t) b (s, t) ,

(2.5.103)

g (s, t) B3 (s, t) dtds.

(2.5.104)

y

and Z∞ Z∞

1 M3 = 1 − p3

0

0

Proof. (r1 ) Let Zx Zy f (s, t) u (s, t) dtds,

z (x, y) = 0

(2.5.105)

0

Z∞ Z∞ k=

g (s, t) u (s, t) dtds. 0

(2.5.106)

0

Then (2.5.84) can be restated as u (x, y) ≤ a (x, y) + b (x, y) z (x, y) + c (x, y) k.

(2.5.107)

From (2.5.105) and (2.5.107) we have Zx Zy z (x, y) ≤

f (s, t) [a (s, t) + kc (s, t) + b (s, t) z (s, t)] dtds 0

0

Zx Zy f (s, t) b (s, t) z (s, t) dtds,

= e (x, y) + 0

0

where Zx Zy [f (s, t) a (s, t) + kf (s, t) c (s, t)] dtds.

e (x, y) = 0

0

(2.5.108)

114


Clearly e(x, y) is continuous, nonnegative and nondecreasing in both the variables x, y ∈ R+ . Now an application of Theorem 4.2.2 given in [34] to (2.5.108) yields z (x, y) ≤ e (x, y) A1 (x, y) .

(2.5.109)

Using (2.5.109) in (2.5.107) we have u (x, y) ≤ a (x, y) + kc (x, y) + b (x, y) e (x, y) A1 (x, y) = B1 (x, y) + kD1 (x, y) .

(2.5.110)

Now, from (2.5.106), (2.5.110)and (2.5.85) we have Z∞ Z∞ k≤

g (s, t) {B1 (s, t) + kD1 (s, t)} dtds, 0

0

i.e., k

 

Z∞ Z∞ 1−



0

0

  Z∞ Z∞ g (s, t) D1 (s, t) dtds ≤ g (s, t) B1 (s, t) dtds,  0

0

which implies k ≤ M1 .

(2.5.111)

Using (2.5.111) in (2.5.110) we get (2.5.86). (r2 ) Let Z∞ Z∞ z (x, y) =

f (s, t) u (s, t) dtds, x

(2.5.112)

y

and k be as in (2.5.106). The proof can be completed by following the proof of (r1 ) and making use of the inequality in Theorem 1.2.3 given in [3, p. 110] (see also [34, p. 440]). (r3 ) Let Zx Z∞ z (x, y) =

f (s, t) u (s, t) dtds, 0

(2.5.113)

y

and k be as in (2.5.106). The proof follows by the similar arguments as in (r1 ) and using the inequality in Theorem 1.2.4 given in [3, p. 110] (see also [34, p. 440]).

Chapter 2

115

2.6 Applications One of the main motivations for the discovery of different type of inequalities given in earlier sections was to apply them as tools in the study of various classes of partial differential, integrodifferential and integral equations. In this section we give applications of some of the inequalities which has been investigated during the past few years.

2.6.1 Nonlinear partial differential equation Consider the partial differential equation ∂ ∂ up−1 (x, y) u (x, y) + F (x, y, u (x, y)) = r (x, y) , ∂y ∂x

(2.6.1)

with the given initial boundary conditions u (x, 0) = σ (x) , u (0, y) = τ (y) , σ (0) = τ (0) = 0, (2.6.2) 2 2 where p > 1 is a real constant and F ∈ C R+ × R, R , r ∈ C R+ , R , σ, τ ∈ C (R+ , R) . As an application of Theorem2.3.5 we present the following result proved by Pachpatte in [45] which gives the bound on the solution of problem (2.6.1)(2.6.2). Theorem 2.6.1.

Assume that

|F (x, y, u)| ≤ f (x, y) g (|u|) ,

(2.6.3)

|¯ a (x, y)| ≤ c,

(2.6.4)

where f, g, c are as in Theorem 2.3.5 and p

p

Zx Zy

a ¯ (x, y) = σ (x) + τ (y) + p

r (s, t) dtds, 0

(2.6.5)

0

for x, y ∈ R+ .Let u(x, y) be a solution of (2.6.1)-(2.6.2) for x, y ∈ R+ Then for 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 ; x, x1 , y, y1 ∈ R+ ,

|u (x, y)| ≤

  

 G−1 G (c) + p

Zx Zy 0

0

 p1  f (s, t) dtds , 

(2.6.6)

116


where G, G−1 are as in Theorem 2.3.5, part (k1 ) and x1 , y1 ∈ R+ are chosen so that Zx Zy G (c) + p 0

f (s, t) dtds ∈ Dom G−1 ,

0

for all x, y lying in 0 ≤ x ≤ x1 , 0 ≤ y ≤ y1 . Proof. It is easy to observe that the problem (2.6.1)-(2.6.2) is equivalent to the integral equation up (x, y) σ p (x) τ p (y) − − + p p p

Zx Zy F (s, t, u (s, t)) dtds 0

0

Zx Zy r (s, t) dtds.

= 0

(2.6.7)

0

From (2.6.7), (2.6.3) and (2.6.4) we observe that Zx Zy

p

|u (x, y)| ≤ c + p

f (s, t) g (|u (s, t)|) dtds. 0

(2.6.8)

0

Now a suitable application of Theorem 2.3.5, part (k1 ) (when h = 0) to (2.6.8) yields (2.6.6). The next result proved by Pachpatte in [40] deals with the bound on the solution of (2.6.1)-(2.6.2) and is obtained by applying Theorem 2.3.3, part (c1 ). Theorem 2.6.2.

Assume that

|F (x, y, u)| ≤ h (x, y) |u| , 2 where h ∈ C R+ , R+ . Let p

(2.6.9)

p

Zx Zy

a0 (x, y) = |σ (x)| + |τ (y)| + p

|r (s, t)| dtds, 0

(2.6.10)

0

and u(x, y) be a solution of (2.6.1)-(2.6.2) for x, y ∈ R+ . Then  x y  p1 Z Z  |u (x, y)| ≤ a0 (x, y) + pe0 (x, y) exp  h (s, t) dtds ,    

0

0

(2.6.11)

Chapter 2

117

for x, y ∈ R+ , where Zx Zy e0 (x, y) = 0

p − 1 a0 (s, t) + p p

h (s, t) dtds,

(2.6.12)

0

for x, y ∈ R+ . Proof. The solution u(x, y) of (2.6.1)-(2.6.2) satisfies the equivalent integral equation (2.6.7). From (2.6.7), (2.6.9) and (2.6.10) we observe that Zx Zy

p

|u (x, y)| ≤ a0 (x, y) + p

h (s, t) |u (s, t)| dtds. 0

(2.6.13)

0

Now a suitable application of Theorem 2.3.3, part (c1 ) (with a (x, y) = a0 (x, y) , b (x, y) = p and g(x, y) = 0) to (2.6.13) we get the required estimate in (2.6.11).

2.6.2 Hyperbolic partial differential equations with terminal values Consider the hyperbolic partial differential equation uxy (x, y) = h (x, y, u (x, y)) + r (x, y) ,

(2.6.14)

with the given terminal value conditions (2.6.15) u (x, ∞) = σ∞ (x) , u (∞, y) = τ∞ (y) , u (∞, ∞) = d, 2 2 × R, R+ , r ∈ C R+ , R+ σ∞ , τ∞ ∈ C (R+ , R+ ) and d is a where h ∈ C R+ real constant. As an application of Theorem 2.5.3, part (b2 ) we present the results given by Pachpatte in [41] which deals with the estimate and uniqueness of solutions of (2.6.14)-(2.6.15). Theorem 2.6.3. Suppose that |h (x, y, u)| ≤ c (x, y) |u| ,

(2.6.16)

Z∞ Z∞ σ∞ (x) + τ∞ (x) − d + r (s, t) dtds ≤ a (x, y) ,

(2.6.17)

x

y

118


2 , R+ . Let u(x, y) be a solution of (2.6.14)where a (x, y) , c (x, y) ∈ C R+ (2.6.15) for x, y ∈ R+ , then  ∞∞ Z Z c (s, t) dtds , (2.6.18) |u (x, y)| ≤ a (x, y) + e¯ (x, y) exp  x

y

for x, y ∈ R+ , where e¯ (x, y) is defined by (2.5.38). Proof. The solution u(x, y) of (2.6.14)-(2.6.15) satisfies the following equivalent integral equation (see also [3, p. 80]) Z∞ Z∞ u (x, y) = σ∞ (x) + τ∞ (y) − d +

[h (s, t, u (s, t)) + r (s, t)] dtds, (2.6.19) x

y

for x, y ∈ R+ . From (2.6.19), (2.6.16), (2.6.17) we get Z∞ Z∞ |u (x, y)| ≤ a (x, y) +

c (s, t) |u (s, t)| dtds. x

(2.6.20)

y

Now a suitable application of Theorem 2.5.3, part (b2 ) to (2.6.20) yields the required estimate in (2.6.18). Theorem 2.6.4.

Suppose that the function h in (2.6.14) satisfies the condition

|h (x, y, u) − h (x, y, v)| ≤ c (x, y) |u − v| , (2.6.21) 2 where c (x, y) ∈ C R+ , R+ .Then the problem (2.6.14)-(2.6.15) has at most one 2 . solution on R+ Proof. The problem (2.6.14)-(2.6.15) is equivalent to the integral equation (2.6.19). Let u(x, y), v(x, y) be two solutions of (2.6.14)-(2.6.15). From (2.6.19), (2.6.21) we have Z∞ Z∞ |u (x, y) − v (x, y)| ≤

c (s, t) |u (s, t) − v (s, t)| dtds. x

(2.6.22)

y

Now a suitable application of Theorem 2.6.3, part (b2 ) yields u(x, y) = v(x, y) i.e., there is at most one solution to the problem (2.6.14)-(2.6.15). We note that the inequality given in Theorem 2.6.4, part (c2 ) can be used to obtain the bound and uniqueness of the solutions of the following non-selfadjoint hyperbolic partial differential equation uxy (x, y) = (r (x, y) u (x, y))x + h (x, y, u (x, y)) ,

(2.6.23)

with the given terminal value conditions given in (2.6.15), under some suitable conditions on the functions involved in proplem (2.6.23)-(2.6.15).

Chapter 2

119

2.6.3 Non-self-adjoint Hyperbolic partial Fredholm integrodifferential equation In this section we present some applications of the special version of the inequality in Theorem 2.5.1 to study certain properties of solutions of the initial boundary value problem (IBVP for short) for the following non-self-adjoint hyperbolic partial Fredholm integrodifferential equation uxy (x, y) = (p (x, y) u (x, y))y Zx Zy

 +F x, y, u (x, y) ,

 k (x, y, σ, τ, u (σ, τ )) dτ dσ  ,

0

(2.6.24)

0

u (x, 0) = α (x) , u (0, y) = β (y) , α (0) = β (0) = 0,

(2.6.25) , β ∈ C (I , R) ; for 0 ≤ σ ≤ x, 0 ≤ τ ≤ y, k ∈ C G × R, R , where α ∈ C (Ia , R) b 2 F ∈ C G × R , R and p ∈ C (G, R) is differentiable with respect to y, in which Ia = [0, a] , Ib = [0, b] be subsets of R and G = Ia × Ib . 2

The following theorems are given by Pachpatte in [62] which deals with the properties of solutions of IBVP (2.6.24)-(2.6.25). Theorem 2.6.5. Assume that |E (x, y)| ≤ c,

(2.6.26)

|k (x, y, s, t, u)| ≤ e (x, y) h (s, t) |u| ,

(2.6.27)

|F (x, y, u, u ¯)| ≤ f (x, y) (|u| + |¯ u|) ,

(2.6.28)

where Zx E (x, y) = α (x) + β (y) −

p (s, 0) α (s) ds,

(2.6.29)

0

f, h, c are as in Theorem 2.5.1 and e (x, y) ∈ C (G, R+ ) such that e (x, y) ≥ 1. Let  σ τ  Za Zb Z Z h (σ, τ )A¯ (σ, τ ) exp  A¯ (s, t) f (s, t) e (s, t) dtds q0 = 0

0

×dτ dσ < 1,

0

0

(2.6.30)

120


where  A¯ (x, y) = exp 



Zx

|p (s, y)| ds ,

(2.6.31)

0

for (x, y) ∈ G. If u(x, y) is any solution of IBVP (2.6.24)-(2.6.25) for (x, y) ∈ G, then  x y  Z Z c ¯ |u (x, y)| ≤ A (x, y) exp  A¯ (s, t) f (s, t) e (s, t) dtds , (2.6.32) 1 − q0 0

0

for (x, y) ∈ G. Proof. The solution u(x, y) of IBVP (2.6.24)-(2.6.25) satisfies the equivalent integral equation Zx p (s, y) u (s, y) ds

u (x, y) = E (x, y) + 0

Zx Zy

 F s, t, u (s, t) ,

+ 0



Za Zb

0

k (s, t, σ, τ, u (σ, τ )) dτ dσ dtds, 0

(2.6.33)

0

where E(x, y) is given by (2.6.29). Using (2.6.26)-(2.6.28) in (2.6.33) we have Zx |p (s, y)| |u (s, y)| ds

|u (x, y)| ≤ c + 0

Zx Zy

 f (s, t) |u (s, t)| +

+ 0



Za Zb

0

e (σ, τ )h (σ, τ ) |u (σ, τ )| dτ dσ dtds 0

0

Zx |p (s, y)| |u (s, y)| ds

≤c+ 0

Zx Zy



Za Zb

f (s, t) e (s, t) |u (s, t)| +

+ 0

0

 h (σ, τ ) |u (σ, τ )|dτ dσ dtds. (2.6.34)

0

0

Now a suitable application of Theorem 2.5.1 (with g = 0 ) to (2.6.34) yields (2.6.32).

Chapter 2

121

Theorem 2.6.6. (i) Assume that |k (x, y, s, t, u) − k (x, y, s, t, u ¯)| ≤ e (x, y) h (s, t) |u − u ¯| ,

(2.6.35)

|F (x, y, u, u ¯) − F (x, y, v, v¯)| ≤ f (x, y) (|u − v| + |¯ u − v¯|) ,

(2.6.36)

where e, h, f are as in Theorem 2.6.5. Let q0 and A¯ (x, y) be as in (2.6.30) and (2.6.31) respectively. Then the IBVP (2.6.24)-(2.6.25) has at most one solution on G. (ii) Let u(x, y) and v(x, y) be the solutions of (2.6.24) with the initial boundary conditions (2.6.25) and v (x, 0) = α ¯ (x) , v (0, y) = β¯ (y) , α ¯ (0) = β¯ (0) = 0,

(2.6.37)

respectively, where α ¯ ∈ C (Ia , R) , β¯ ∈ C (Ib , R) . Suppose that the functions k and F in (2.6.24) satisfy the conditions (2.6.35) and (2.6.36) in part (i). Let E(x, y) be given by (2.6.29), ¯ (x, y) = α E ¯ (x) + β¯ (y) −

Zx p (s, 0) α ¯ (s) ds,

(2.6.38)

0

and ¯ (x, y) ≤ c, E (x, y) − E

(2.6.39)

where c is as in Theorem 2.5.1. Let q0 and A¯ (x, y) be as in (2.6.30) and (2.6.31) respectively. Then the solutions of (2.6.24) depends on the initial boundry conditions and c ¯ |u (x, y) − v (x, y)| ≤ A (x, y) 1 − q0  x y  Z Z × exp  A¯ (s, t) f (s, t) e (s, t) dtds , (2.6.40) 0

0

for (x, y) ∈ G. Proof. Let u(x, y) and v(x, y) be two solutions of IBVP (2.6.24)-(2.6.25) on G, then we have Zx p (s, y) {u (s, y) − v (s, y)} ds

u (x, y) − v (x, y) = 0

   Zx Zy  Za Zb + k (s, t, σ, τ, u (σ, τ )) dτ dσ  F s, t, u (s, t) ,  0

0

0

0

122

Integral inequalities in two variables 

Za Zb

−F s, t, v (s, t) , 0

0

  k (s, t, σ, τ, v (σ, τ )) dτ dσ  dtds. 

(2.6.41)

From (2.6.41), (2.6.35), (2.6.36) we obtain Zx |u (x, y) − v (x, y)| ≤

p (s, y) |u (s, y) − v (s, y)| ds 0

Zx Zy f (s, t) (|u (s, t) − v (s, t)|

+ 0

0



Za Zb

h (σ, τ ) |u (σ, τ ) − v (σ, τ )|dτ dσ  dtds.

+e (s, t) 0

(2.6.42)

0

Rewtiting (2.6.42) in view of the fact that e (x, y) ≥ 1 and a suitable application of Theorem 2.5.1 (with c = 0, g = 0 ) yields |u (x, y) − v (x, y)| ≤ 0. Therefore u(x, y) = v(x, y) i.e., there is at most one solution of IBVP (2.6.24)-(2.6.25) on G. (ii) Since u(x, y) and v(x, y) are the solutions of IBVP (2.6.24)-(2.6.25) and (2.6.24)-(2.6.37) respectively, we have ¯ (x, y) + u (x, y) − v (x, y) = E (x, y) − E

Zx p (s, y) {u (s, y) − v (s, y)} ds 0

   Zx Zy  Za Zb k (s, t, σ, τ, u (σ, τ )) dτ dσ  F s, t, u (s, t) , +  0

0

0



Za Zb

−F s, t, v (s, t) , 0

0

0

  k (s, t, σ, τ, v (σ, τ )) dτ dσ  dtds. 

From (2.6.43), (2.6.39), (2.6.36), (2.6.35), we have Zx |u (x, y) − v (x, y)| ≤ c +

p (s, y) |u (s, y) − v (s, y)| ds 0

Zx Zy f (s, t) (|u (s, t) − v (s, t)|

+ 0

0

Za Zb

 h (σ, τ ) |u (σ, τ ) − v (σ, τ )|dτ dσ  dtds

+e (s, t) 0

0

(2.6.43)

Chapter 2

123

Zx ≤c+

p (s, y) |u (s, y) − v (s, y)| ds 0

Zx Zy f (s, t) e (s, t) (|u (s, t) − v (s, t)|

+ 0

0



Za Zb

h (σ, τ ) |u (σ, τ ) − v (σ, τ )|dτ dσ  dtds,

+ 0

(2.6.44)

0

for (x, y) ∈ G. Now a suitable application of Theorem 2.5.1 (with g = 0 ) to (2.6.44) yields the estimate (2.6.40), which shows the dependency of solutions of (2.6.24) on given initial boundary data. Here, we note that the inequality in Theorem 2.5.1 can be used to study similar properties as in Theorems 2.6.5 and 2.6.6 for solutions of the non-selfadjoint hyperbolic partial Volterra-Fredholm integrodifferential equation uxy (x, y) = (p (x, y) u (x, y))y  Zx Zy +F x, y, u (x, y) , k1 (x, y, s, t, u (s, t)) dtds, 0

0



Za Zb ,

k2 (x, y, s, t, u (s, t)) dtds , 0

(2.6.45)

0

with the given initial boundary conditions (2.6.25) under some suitable conditions on the functions involved in IBVP (2.6.45)-(2.6.25). We omit the details.

2.6.4 Volterra-Fredholm integral equation In this section we present applications of Theorem 2.5.7, part (r1 ) to study certain properties of the solutions of Volterra-Fredholm integral equation of the form Zx Zy z (x, y) = E (x, y) + F (x, y, s, t, z (s, t)) dtds 0

0

Z∞ Z∞ H (x, y, s, t, z (s, t)) dtds,

+ 0

(2.6.46)

0

2 for x, y ∈ R+ , where z(x, y) is an unknown function, E ∈ C R+ , R and F, H ∈ 4 × R, R . C R+

124


In [76] Pachpatte has given the following theorems which deals with the properties of solutions of equation (2.6.46). Theorem 2.6.7. Suppose that the functions E, F, H in equation (2.6.46) satisfy the conditions |E (x, y)| ≤ a (x, y) ,

(2.6.47)

|F (x, y, s, t, z)| ≤ b (x, y) f (s, t) |z| ,

(2.6.48)

|H (x, y, s, t, z)| ≤ c (x, y) g (s, t) |z| ,

(2.6.49)

where a, b, c, f, g are as in Theorem 2.5.7. Let p1 be as in (2.5.85). If z(x, y) is 2 ,then a solution of equation (2.6.46) on R+ |z (x, y)| ≤ B1 (x, y) + M1 D1 (x, y) ,

(2.6.50)

where B1 , D1 , M1 are as given in Theorem 2.5.7, part (r1 ) . 2 Proof. Let z(x, y) be a solution of equation (2.6.46) on R+ . Using the fact that z(x, y) is a solution of equation (2.6.46) and (2.6.47)-(2.6.49) we observe that

Zx Zy f (s, t) |z (s, t)| dtds

|z (x, y)| ≤ a (x, y) + b (x, y) 0

0

Z∞ Z∞ g (s, t) |z (s, t)| dtds.

+c (x, y) 0

(2.6.51)

0

Now an application of Theorem 2.5.7, part (r1 ) to (2.6.51) yields the required estimate in (2.6.50). Theorem 2.6.8. Suppose that the functions F, H in equation (2.6.46) satisfy the conditions |F (x, y, s, t, z) − F (x, y, s, t, z¯)| ≤ b (x, y) f (s, t) |z − z¯| ,

(2.6.52)

|H (x, y, s, t, z) − H (x, y, s, t, z¯)| ≤ c (x, y) g (s, t) |z − z¯| ,

(2.6.53)

where b, c, f, g are as in Theorem 2.5.7. Let p1 be as in (2.5.85).Then the equa2 . tion (2.6.46) has at most one solution on R+

Chapter 2

125

2 . Proof. Let u(x, y) and v(x, y) be two solutions of equation (2.6.46) on R+ Using the facts that u(x, y) and v(x, y) are the solutions of equation (2.6.46) and (2.6.52), (2.6.53) we have

Zx Zy f (s, t) |u (s, t) − v (s, t)| dtds

|u (x, y) − v (x, y)| ≤ b (x, y) 0

0

Z∞ Z∞ g (s, t) |u (s, t) − v (s, t)| dtds.

+c (x, y) 0

(2.6.54)

0

Now an application of the inequality given in Theorem 2.5.7, part (r1 ) (with a(x, y) = 0 which in fact implies B1 (x, y) = 0, M1 = 0 ) to (2.6.54) yields 2 u(x, y) = v(x, y), i.e., there is at most one solution of equation (2.6.46) on R+ . Finally, we note that the applications presented here display the importance of some of the inequalities given in earlier sections.Most of the inequalities given here are recently developed and we hope that these inequalities will serve as a model for further investigation

2.7 Notes The origin of the results included in this chapter can be traced back to the well known Wendroff’s inequalities, see [4, p. 154]. Integral inequalities of Wendroff’s type have proved to be very useful in the study of certain partial differential and integral equations. The material included in Section 2.2 contains some basic results on integral inequalities developed during the past few years. The inequalities in Theorems 2.2.1 and 2.2.2 are due to Pachpatte [68,55]. The ˇ [24], which yield inequalities in Theorems 2.2.3 and 2.2.4 are proved by Medved estimates on nonlinear integral inequalities with singular kernels. Section 2.3 is dedicated to further nonlinear integral inequalities involving functions of two independent variables. The results given in Theorems 2.3.1-2.3.5 are due to Pachpatte [46,40,45]. Section 2.4 contains some integral inequalities in two independent variables involving iterated double integrals, which are adequate in new applications. The inequalities in Theorems 2.4.1-2.4.4 are all due to Pachpatte and taken from [53,72,78]. Section 2.5 is devoted to the inequalities which yield estimates on certain integral inequalities involving functions of two independent variables,which are mainly used when the earlier inequalities do not apply directly. All the results in this section are due to Pachpatte and taken from [62,72,41,48,76]. Section 2.6 is devoted to the applications of some of the inequalities given in this chapter, to study various aspects of certain partial differential and integral equations. The literature concerning such inequalities is rich and for earlier work we refer the reader to the books by Bainov and

126


Simeonov [3] Martinjuk and Gutowski [23] and Pachpatte [34] which contains many references on this topic.

Chapter 3

Retarded integral inequalities 3.1 Introduction Differential equations with retarded arguments have been studied by many investigators and various methods and ideas have been proposed for the study of their different aspects. The fundamental role played by the integral inequalities which provide explicit bounds on unknown functions in the development of the theory of differential and integral equations is well known, see [3,6,12,14,17,19, 23,83,84]. It is natural to expect that some new generalizations and variants of such inequalities would also be equally important in certain new applications. Motivated by a desire to apply integral inequalities which provide explicit bounds on unknown functions, in the development of the theory of differential and integral equations with retarded arguments, recently some new inequalities have been developed to achive a diversity of desired goals, see [21,22,43,47,5861,69,74,77]. This chapter deals with some basic retarded integral inequalities involving functions of one and two independent variables, which can be used as tools in the study of differential and integral equations involving retarded arguments. Applications of some of the inequalities are also given.

3.2 Basic retarded integral inequalities in one variable Motivated by the needs of diverse applications in different branchas of differential and integral equations,various investigators have discovered many useful integral inequalities in the literature. In this section, we present some basic retarded integral inequalities established by Pachpatte in [43,60,69,74] which can 127

128

Retarded integral inequalities

be used as handy tools in the study of certain new classes of retarded differential and integral equations. The following theorems contains some useful inequalities proved in [43]. Theorem 3.2.1. Let I = [t0 , T ) ⊂ R (the set of real numbers), a (t) , b (t) ∈ C (I, R+ ) , α (t) ∈ C 1 (I, I) be nondecreasing with α (t) ≤ t on I and k ≥ 0, c ≥ 1 and p > 1 are real constants. (a1 ) If u (t) ∈ C (I, R+ ) and α(t) Z

Zt u (t) ≤ k +

a (s) u (s) ds + t0

b (s) u (s) ds,

(3.2.1)

α(t0 )

for t ∈ I, then u (t) ≤ k exp (A (t) + B (t)) ,

(3.2.2)

for t ∈ I, where Zt a (s) ds,

A (t) =

(3.2.3)

t0

α(t) Z

B (t) =

b (s) ds,

(3.2.4)

α(t0 )

for t ∈ I. (a2 ) Let R1 = [1, ∞) . If u (t) ∈ C (I, R1 ) and α(t) Z

Zt u (t) ≤ c +

a (s) u (s) log u (s) ds + t0

b (s) u (s) log u (s) ds,

(3.2.5)

α(t0 )

for t ∈ I, then u (t) ≤ cexp(A(t)+B(t)) , for t ∈ I where A(t) and B(t) are defined by (3.2.3) and (3.2.4).

(3.2.6)

Chapter 3

129

(a3 ) If u (t) ∈ C (I, R+ ) and α(t) Z

Zt

p

u (t) ≤ k +

a (s) u (s) ds + t0

b (s) u (s) ds,

(3.2.7)

α(t0 )

for t ∈ I, then u (t) ≤ k

p−1 p

+

p−1 p

1 p−1 (A (s) + B (s)) ,

(3.2.8)

for t ∈ I, where A(t) and B(t) are defined by (3.2.3) and (3.2.4). Proof.

From the hypotheses we observe that α0 (t) ≥ 0 for t ∈ I.

(a1 ) Let k > 0 and define a function z(t) by the right hand side of (3.2.1). Then z (t0 ) = k, u (t) ≤ z (t) , z(t) is positive, nondecreasing for t ∈ I and z 0 (t) = a (t) u (t) + b (α (t)) u (α (t)) α0 (t) ≤ a (t) u (t) + b (α (t)) u (α (t)) α0 (t) ≤ a (t) z (t) + b (α (t)) z (t) α0 (t) i.e., z 0 (t) ≤ a (t) + b (α (t)) α0 (t) . z (t)

(3.2.9)

Integrating (3.2.9) from t0 to t, t ∈ I, and the change of variable yield z (t) ≤ k exp (A (t) + B (t)) ,

(3.2.10)

for t ∈ I. Using (3.2.10) in u (t) ≤ z (t) we get the inequality (3.2.2). If k ≥ 0, we carry out the above procedure with k + ε instead of k, where ε > 0 is an arbitrary small constant, and subsequently pass the limit as ε → 0 to obtain (3.2.2). (a2 ) Define a function z(t) by the right hand side of (3.2.5). Then z (t0 ) = c, u (t) ≤ z (t), z(t) is positive and nondecreasing for t ∈ I and as in the proof of part (a1 ) we get z 0 (t) ≤ a (t) log z (t) + b (α (t)) log z (α (t)) α0 (t) . z (t)

(3.2.11)

Integrating (3.2.11) from t0 to t, t ∈ I, and the change of variable yield α(t) Z

Zt log z (t) ≤ log c +

a (s) log z (s) ds + t0

b (s) log z (s) ds. α(t0 )

(3.2.12)

130


Now by a suitable application of the inequality given in (a1 ) to (3.2.12) we get log z (t) ≤ (log c) exp (A (t) + B (t)) = log cexp(A(t)+B(t)) .

(3.2.13)

From (3.2.13) we observe that z (t) ≤ cexp(A(t)+B(t)) .

(3.2.14)

Using (3.2.14) in u (t) ≤ z (t) we get the required inequality in (3.2.6). (a3 ) Let k > 0 and define a function z(t) by the right hand side of (3.2.7). 1 Then z (t0 ) = k, u (t) ≤ {z (t)} p , z(t) is positive and nondecreasing for t ∈ I and as in the proof of part (a1 ) we have 1

{z (t)} p z 0 (t) ≤ a (t) + b (α (t)) α0 (t) .

(3.2.15)

Integrating (3.2.15) from t0 to t, t ∈ I, and the change of variable gives p p−1 p−1 p−1 (A (t) + B (t)) . z (t) ≤ k p + p

(3.2.16) 1

The desired inequality in (3.2.8) follows by using (3.2.16) in u (t) ≤ {z (t)} p . The case k ≥ 0 can be completed as mentioned in the proof of part (a1 ). Remark 3.2.1. If we take a(t) = 0 in part (a1 ), then we get the inequality given by Lipovan in [21, Corollary, p. 391] which in turn contains as a special case, the celebrated Gronwall-Bellman inequality, see [34, p.11] and in this special case, the inequality in (a2 ) reduces to the further extension of the inequality given in [34, Theorem 3.8.2, p. 268]. The inequality in (a3 ) can be considered as a generalization of the inequality given in [34, Theorem 4.3.1, p. 233]. Theorem 3.2.2. Let a (t) , b (t) , α (t) , k, c, p be as in Theorem 3.2.1. For i = 1, 2 , let gi ∈ C (R+ , R+ ) be nondecreasing functions with gi (u) > 0 for u > 0. (b1 ) If u (t) ∈ C (I, R+ ) and for t ∈ I, α(t) Z

Zt u (t) ≤ k +

a (s) g1 (u (s)) ds + t0

then for t0 ≤ t ≤ t1 ; t, t1 ∈ I,

b (s) g2 (u (s)) ds, α(t0 )

(3.2.17)

Chapter 3

131

(i) in case g2 (u) ≤ g1 (u) , u (t) ≤ G−1 1 [G1 (k) + A (t) + B (t)] ;

(3.2.18)

(ii) in case g1 (u) ≤ g2 (u) , u (t) ≤ G−1 2 [G2 (k) + A (t) + B (t)] ;

(3.2.19)

where A(t) and B(t) are given by (3.2.3) and (3.2.4) and for i = 1, 2 , G−1 are i the inverse functions of Zr Gi (r) =

ds , r > 0, gi (s)

(3.2.20)

r0

r0 > 0 is arbitrary and t1 ∈ I is chosen so that Gi (k) + A (t) + B (t) ∈ Dom G−1 , i respectively, for all t lying in the interval [t0 , t1 ] . (b2 ) If u(t) be as in Theorem 3.2.1, part(a2 ) and for t ∈ I, α(t) Z

Zt u (t) ≤ c+

a (s) u (s) g1 (log u (s)) ds+

t0

b (s) u (s) g2 (log u (s)) ds, (3.2.21)

α(t0 )

then for t0 ≤ t ≤ t2 ; t, t2 ∈ I, (i) in case g2 (u) ≤ g1 (u) , u (t) ≤ exp G−1 1 [G1 (log c) + A (t) + B (t)] ;

(3.2.22)

(ii) in case g1 (u) ≤ g2 (u), u (t) ≤ exp G−1 2 [G2 (log c) + A (t) + B (t)] ;

(3.2.23)

where Gi , G−1 i , A(t), B(t) are as in (b1 ) and t2 ∈ I is chosen so that for i = 1, 2 Gi (log c) + A (t) + B (t) ∈ Dom G−1 , i respectively, for all t lying in the interval [t0 , t2 ] . (b3 ) If u (t) ∈ C (I, R+ ) and for t ∈ I, p

α(t) Z

Zt

u (t) ≤ k +

a (s) g1 (u (s)) ds + t0

then for t0 ≤ t ≤ t3 ; t, t3 ∈ I,

b (s) g2 (u (s)) ds, α(t0 )

(3.2.24)

132


(i) in case g2 (u) ≤ g1 (u) , 1 u (t) ≤ H1−1 [H1 (k) + A (t) + B (t)] p ,

(3.2.25)

(ii) in case g1 (u) ≤ g2 (u) , 1 u (t) ≤ H2−1 [H2 (k) + A (t) + B (t)] p ,

(3.2.26)

where A(t), B(t) are given as in (b1 ) and for i = 1, 2, Hi−1 are the inverse functions of Zr Hi (r) = r0

ds 1 , r > 0, gi s p

(3.2.27)

r0 > 0 is arbitrary and t3 ∈ I is chosen so that Hi (k) + A (t) + B (t) ∈ Dom Hi−1 , respectively, for all t lying in the interval [t0 , t3 ] . Proof. (b1 ) From the hypotheses we observe that α0 (t) ≥ 0 for t ∈ I. Let k > 0 and define a function z(t) by the right hand side of (3.2.17). Then z (t0 ) = k, u (t) ≤ z (t), z(t) is positive and nondecreasing for t ∈ I and as in the proof of Theorem 3.2.1, part (a1 ) we get z 0 (t) ≤ a (t) g1 (z (t)) + b (α (t)) g2 (z (α (t))) α0 (t) .

(3.2.28)

(i) when g2 (u) ≤ g1 (u) , then from (3.2.28) we observe that z 0 (t) ≤ g1 (z (t)) [a (t) + b (α (t)) α0 (t)] .

(3.2.29)

From (3.2.20) and (3.2.29) we have d z 0 (t) G1 (z (t)) = ≤ a (t) + b (α (t)) α0 (t) . dt g1 (z (t))

(3.2.30)

Integrating (3.2.30) from t0 to t, t ∈ I, and by making the change of variable, we have G1 (z (t)) ≤ G1 (k) + A (t) + B (t) .

(3.2.31)

Since G−1 1 is increasing, from (3.2.31) we have z (t) ≤ G−1 1 [G1 (k) + A (t) + B (t)] .

(3.2.32)

Using (3.2.32) in u (t) ≤ z (t) gives the required inequality in (3.2.18). The case k ≥ 0 can be completed as mentioned in the proof of Theorem 3.2.1, part (a1 ). The proof of the case when g1 (u) ≤ g2 (u) can be completed similarly. The subinterval t0 ≤ t ≤ t1 is obvious.

Chapter 3

133

The proofs of (b2 ) and (b3 ) can be completed by following the proof of (b1 ) and closely looking at the proofs of similar inequalities given in [34]. We omit the details. Remark 3.2.2. We note that the inequalities in Theorem 3.2.2 parts (b1 )−(b3 ) can be considered as further generalizations of the inequalities given in Theorems 2.3.1, 3.9.1, 3.4.1 in [34] respectively. We also note that the definitions of the ˇ [26]. functions Hi in (3.2.27) are motivated from the work of Medved The following useful generalization of the inequality (3.2.17) is proved in [69]. For suitable functions defined on the respective domains of their definitions, first we give the following notation used to simplify the details of presentation: φZ1 (t)

H [t, m; φ1 , a1 , p1 ; φ2 , a2 , p2 ] =

φZ2 (t)

a1 (s) p1 (m (s)) ds + φ1 (t0 )

a2 (s) p2 (m (s)) ds. φ2 (t0 )

Theorem 3.2.3. Let u (t) , f (t) , b (t) , a1 (t) , a2 (t) ∈ C (I, R+ ) ; φ1 (t) , φ2 (t) ∈ C 1 (I, I) be nondecreasing with φ1 (t) ≤ t, φ2 (t) ≤ t on I = [t0 , T ) . For i = 1, 2, let gi (t) ∈ C (R+ , R+ ) be nondecreasing, subadditive and submultiplicative functions with gi (u) > 0 for u > 0 and for t ∈ I, u (t) ≤ f (t) + b (t) H [t, u; φ1 , a1 , g1 ; φ2 , a2 , g2 ] ,

(3.2.33)

then for t0 ≤ t ≤ t1 ; t, t1 ∈ I, (i) in case g2 (u) ≤ g1 (u) , u (t) ≤ f (t) + b (t) G−1 1 [G1 (e (t)) + H [t, b; φ1 , a1 , g1 ; φ2 , a2 , g2 ]] , (3.2.34) (ii) in case g1 (u) ≤ g2 (u) , u (t) ≤ f (t) + b (t) G−1 2 [G2 (e (t)) + H [t, b; φ1 , a1 , g1 ; φ2 , a2 , g2 ]] , (3.2.35) where e (t) = H [t, f ; φ1 , a1 , g1 ; φ2 , a2 , g2 ] , Gi , G−1 are as in Theorem 3.2.2, part (b1 ) and t1 ∈ I is chosen so that i Gi (e (t)) + H [t, b; φ1 , a1 , g1 ; φ2 , a2 , g2 ] ∈ Dom G−1 , i respectively, for all t lying in the interval [t0, t1 ] .

(3.2.36)

134


Proof. From the hypotheses we observe that φ01 (t) ≥ 0, φ02 (t) ≥ 0 for t ∈ I. Define a function z(t) by z (t) = H [t, u; φ1 , a1 , g1 ; φ2 , a2 , g2 ] φZ1 (t)

=

φZ2 (t)

a1 (s) g1 (u (s)) ds + φ1 (t0 )

a2 (s) g2 (u (s)) ds.

(3.2.37)

φ2 (t0 )

Then z (t0 ) = 0 and (3.2.33) can be restated as u (t) ≤ f (t) + b (t) z (t) .

(3.2.38)

Using (3.2.38) in (3.2.37) and the hypotheses on g1 , g2 we have φZ1 (t)

z (t) ≤

a1 (s) g1 (f (s) + b (s) z (s)) ds φ1 (t0 )

φZ2 (t)

a2 (s) g2 (f (s) + b (s) z (s)) ds

+ φ2 (t0 )

φZ1 (t)

≤ e (t) +

a1 (s) g1 (b (s))g1 (z (s)) ds

φ1 (t0 ) φZ2 (t)

a2 (s) g2 (b (s))g2 (z (s)) ds.

+

(3.2.39)

φ2 (t0 )

Let β ∈ I be an arbitrary number. From (3.2.39), for t0 ≤ t ≤ β we have φZ1 (t)

z (t) ≤ e (β) +

a1 (s) g1 (b (s))g1 (z (s)) ds

φ1 (t0 ) φZ2 (t)

+

a2 (s) g2 (b (s))g2 (z (s)) ds.

(3.2.40)

φ2 (t0 )

Now assume that e (β) > 0 and let g2 (u) ≤ g1 (u) . Define a function v(t) by the right hand side of (3.2.40). Then v (t0 ) = e (β) z (t) ≤ v (t), v(t) is positive and nondecreasing for t0 ≤ t ≤ β and v 0 (t) = a1 (φ1 (t)) g1 (b (φ1 (t))) g1 (z (φ1 (t))) φ01 (t) +a2 (φ2 (t)) g2 (b (φ2 (t))) g2 (z (φ2 (t))) φ02 (t)

Chapter 3

135

≤ a1 (φ1 (t)) g1 (b (φ1 (t))) g1 (v (φ1 (t))) φ01 (t) +a2 (φ2 (t)) g2 (b (φ2 (t))) g2 (v (φ2 (t))) φ02 (t) ≤ a1 (φ1 (t)) g1 (b (φ1 (t))) g1 (v (t)) φ01 (t) +a2 (φ2 (t)) g2 (b (φ2 (t))) g2 (v (t)) φ02 (t) ≤ [a1 (φ1 (t)) g1 (b (φ1 (t))) φ01 (t) +a2 (φ2 (t)) g2 (b (φ2 (t))) φ02 (t)] g1 (v (t)) .

(3.2.41)

From (3.2.20) and (3.2.41) we have d v 0 (t) G1 (v (t)) = dt g1 (v (t)) ≤ [a1 (φ1 (t)) g1 (b (φ1 (t))) φ01 (t) +a2 (φ2 (t)) g2 (b (φ2 (t))) φ02 (t)] .

(3.2.42)

By taking t = s in (3.2.42) and integrating it with respect to s from t0 to t for t0 ≤ t ≤ β we get Zt G1 (v (t)) ≤ G1 (e (β)) +

[a1 (φ1 (s)) g1 (b (φ1 (s))) φ01 (s)

t0

+a2 (φ2 (s)) g2 (b (φ2 (s))) φ02 (s)] ds,

(3.2.43)

for t0 ≤ t ≤ β. Since z (t) ≤ v (t) for t0 ≤ t ≤ β and β ∈ I is arbitrary, from (3.2.43) we have  z (t) ≤

G−1 1

Zt

G1 (e (β)) +

[a1 (φ1 (s)) g1 (b (φ1 (s))) φ01 (s)

t0

+a2 (φ2 (s)) g2 (b (φ2 (s))) φ02 (s)] ds] ,

(3.2.44)

for t0 ≤ t ≤ t1 . By making the change of variable in the integral on the right hand side in (3.2.44) we have z (t) ≤ G−1 1 [G1 (e (t)) + H [t, b; φ1 , a1 , g1 ; φ2 , a2 , g2 ]] ,

(3.2.45)

for t0 ≤ t ≤ t1 . The conclusion (3.2.34) follows from (3.2.38) and (3.2.45). If e (β) in (3.2.40) is nonnegative, we carry out the above procedure with e (β) + ε instead of e (β), where ε > 0 is an arbitrary small constant, and subsequently pass to the limit ε → 0 to obtain (3.2.34). The subinterval t0 ≤ t ≤ t1 is obvious. The proof of the case when g1 (u) ≤ g2 (u) can be completed similarly.

136


Remark 3.2.3. We note that in [2] the authors have given the upper bound on (3.2.33) (when b(t) = 1 ), which depends on the continuous solution of a certain initial value problem for first order differential equation. The bound obtained on (3.2.33) in Theorem 3.2.3 is explicit and it is more convenient in applications. Here, it is to be noted that the conditions required on the functions involved in (3.2.33) are different from those of given in [2]. Next, we shall give the inequalities established in [74] which can be used more conveniently in certain situations. Theorem 3.2.4. Let u (t) , a (t) , bi (t) ∈ C (I, R+ ) ; αi (t) ∈ C 1 (I, I) be nondecreasing with αi (t) ≤ t on I = [t0 , T ) for i = 1, ..., n and k ≥ 0 be a real constant. (c1 ) If

u (t) ≤ k +

α Zi (t) n X i=1

bi (s) u (s) ds,

(3.2.46)

αi (t0 )

for t ∈ I, then u (t) ≤ k exp (E (t)) ,

(3.2.47)

for t ∈ I, where

E (t) =

α Zi (t) n X i=1

bi (σ) dσ,

(3.2.48)

αi (t0 )

for t ∈ I. (c2 ) If a(t) is nondecreasing for t ∈ I and

u (t) ≤ a (t) +

α Zi (t) n X i=1

bi (s) u (s) ds,

(3.2.49)

αi (t0 )

for t ∈ I, then u (t) ≤ a (t) exp (E (t)) ,

(3.2.50)

for t ∈ I, where E(t) is given by (3.2.48). Proof. From the hypotheses on αi (t) we observe that αi0 (t) ≥ 0 for t ∈ I and i = 1, ..., n.

Chapter 3

137

(c1 ) Let k > 0 and define a function z(t) by the right hand side of (3.2.46). Then z (t0 ) = k, u (t) ≤ z (t), z(t) > 0 and z 0 (t) =

n X

bi (αi (t)) u (αi (t)) αi0 (t)

i=1

≤

n X

bi (αi (t)) z (αi (t)) αi0 (t)

i=1

≤

n X

bi (αi (t)) z (t) αi0 (t)

i=1

i.e., n

z 0 (t) X ≤ bi (αi (t)) αi0 (t). z (t) i=1

(3.2.51)

Integrating (3.2.51) from t0 to t; t ∈ I and then the change of variables yields z (t) ≤ k exp (E (t)) ,

(3.2.52)

for t ∈ I. Using (3.2.52) in u (t) ≤ z (t) we get the inequality in (3.2.47). If k ≥ 0 we carry out the above procedure with k + ε insteead of k, where ε > 0 is an arbitrary small constant, and subsequently pass the limit ε → 0 to obtain (3.2.47). (c2 ) First we assume that a(t) > 0 for t ∈ I. From the hypotheses, for s ≤ αi (t) ≤ t, we have a (s) ≤ a (αi (t)) ≤ a (t) . In view of this, from (3.2.49) we observe that α Zi (t) n X u (t) u (s) ≤1+ ds. bi (s) a (t) a (s) i=1

(3.2.53)

αi (t0 )

Now an application of the inequality in part (c1 ) to (3.2.53) yields the required inequality in (3.2.50). If a(t) = 0 , then from (3.2.49) we observe that

u (t) ≤ ε +

α Zi (t) n X i=1

bi (s) u (s) ds,

(3.2.54)

αi (t0 )

where ε > 0 is an arbitrary small constant. An application of the inequality in part (c1 ) to (3.2.54) yields u (t) ≤ ε exp (E (t)) .

(3.2.55)

Now by letting ε → 0 in (3.2.55) we have u(t) = 0 and hence (3.2.50) holds.

138


Theorem 3.2.5. Let u (t) , bi (t) , αi (t) be as in Theorem 3.2.4. Let k ≥ 0, p > 1 be real constants. Let g ∈ C (R+ , R+ ) be nondecreasing function with g(u) > 0 for u > 0. (d1 ) If for t ∈ I,

u (t) ≤ k +

α Zi (t) n X i=1

bi (s) g (u (s)) ds,

(3.2.56)

αi (t0 )

then for t0 ≤ t ≤ t1 ; t, t1 ∈ I, u (t) ≤ G−1 [G (k) + E (t)] ,

(3.2.57)

where E(t) is given by (3.2.48) and G−1 is the inverse function of Zr G (r) =

ds , r > 0, g (s)

(3.2.58)

r0

r0 > 0 is arbitrary and t1 ∈ I is chosen so that G (k) + E (t) ∈ Dom G−1 , for all t lying in the interval [t0 , t1 ] . (d2 ) If for t ∈ I, p

u (t) ≤ k +

α Zi (t) n X i=1

bi (s) g (u (s)) ds,

(3.2.59)

αi (t0 )

then for t0 ≤ t ≤ t2 ; t, t2 ∈ I, 1 u (t) ≤ H −1 [H (k) + E (t)] p ,

(3.2.60)

where E(t) is given by (3.2.48) and H −1 is the inverse function of Zr H (r) = r0

ds 1 , r > 0, g sp

r0 > 0 is arbitrary and t2 ∈ I is chosen so that H (k) + E (t) ∈ Dom H −1 , for all t lying in the interval [t0 , t2 ].

(3.2.61)

Chapter 3

139

Proof. From the hypotheses on αi (t) we observe that αi0 (t) ≥ 0 for t ∈ I and i = 1, ..., n. (d1 ) Let k > 0 and define a function z(t) by the right hand side of (3.2.56). Then z (t0 ) = k, u (t) ≤ z (t) , z(t) is positive and nondecreasing for t ∈ I and following the proof of Theorem 3.2.4, part (c1 ) we have n

X z 0 (t) ≤ bi (αi (t)) αi0 (t) . g (z (t)) i=1

(3.2.62)

From (3.2.58) and (3.2.62) we have n

X z 0 (t) d G (z (t)) = ≤ bi (αi (t)) αi0 (t) . dt g (z (t)) i=1

(3.2.63)

Integrating (3.2.63) from t0 to t; t ∈ I, and making the change of variables, we get G (z (t)) ≤ G (k) + E(t), which implies z (t) ≤ G−1 [G (k) + E(t)] .

(3.2.64)

Using (3.2.64) in u (t) ≤ z (t) gives the required inequality in (3.2.57). The case k ≥ 0 can be completed as mentioned in the proof of Theorem 3.2.4, part (c1 ). The subinterval t0 ≤ t ≤ t1 is obvious. (d2 ) The proof can be completed by following the proof of part (d1 ) given above with suitable changes. Here we omit the details. The inequalities established in [60] are embodied in the following theorem. Theorem 3.2.6. Let u (t) , ai (t) , bi (t) ∈ C (I, R+ ) and αi (t) ∈ C 1 (I, I) be nondecreasing with αi (t) ≤ t on I = [t0 , T ) for i = 1, ..., n. Let p > 1 and c ≥ 0 be real constants. (q1 ) If p

u (t) ≤ c + p

α Zi (t) n X i=1

[ai (s) up (s) + bi (s) u (s)] ds,

(3.2.65)

αi (t0 )

for t ∈ I, then 1   p−1  α   Zi (t) n   X   ai (σ)dσ  , u (t) ≤ M (t) exp (p − 1)     i=1 αi (t0 )

(3.2.66)

140


for t ∈ I, where M (t) = {c}

p−1 p

+ (p − 1)

α Zi (t) n X i=1

bi (σ)dσ,

(3.2.67)

αi (t0 )

for t ∈ I. (q2 ) Let w ∈ C (R+ , R+ ) be nondecreasing function with w(u) > 0 on (0, ∞) . If for t ∈ I, p

u (t) ≤ c + p

α Zi (t) n X i=1

[ai (s) u (s) w (u (s)) + bi (s) u (s)] ds,

(3.2.68)

αi (t0 )

then for t0 ≤ t ≤ t1 ; t, t1 ∈ I, 1   p−1  α i (t)   Z n   X   ai (σ)dσ  , u (t) ≤ F −1 F (M (t)) + (p − 1)     i=1

(3.2.69)

αi (t0 )

where M (t) is given by (3.2.67), F −1 is the inverse function of Zr F (r) = r0

ds 1 , r > 0, w s p−1

(3.2.70)

r0 > 0 is arbitrary and t1 ∈ I is chosen so that F (M (t)) + (p − 1)

α Zi (t) n X i=1

ai (σ)dσ ∈ Dom F −1 ,

αi (t0 )

for all t lying in the interval t0 ≤ t ≤ t1 . Proof. From the hypotheses on αi (t) we observe that αi0 (t) ≥ 0 for t ∈ I and i = 1, ..., n. (q1 ) Let c > 0 and define a function z(t) by the right hand side of (3.2.65). 1 Then z (t0 ) = c, u (t) ≤ {z (t)} p , z(t) is positive and nondecreasing for t ∈ I and 0

z (t) = p

n X

[ai (αi (t)) up (αi (t)) + bi (αi (t)) u (αi (t))]αi0 (t)

i=1

≤p

n h X i=1

i 1 ai (αi (t)) z (αi (t)) + bi (αi (t)) {z (αi (t))} p αi0 (t)

Chapter 3

=p

n h X

141 1 1− p

i 1 + bi (αi (t)) {z (αi (t))} p αi0 (t)

p−1 p

i 1 + bi (αi (t)) {z (t)} p αi0 (t)

ai (αi (t)) {z (αi (t))}

i=1

≤p

n h X

ai (αi (t)) {z (αi (t))}

i=1

i.e., z 0 (t) {z (t)}

1 p

≤p

n h X

ai (αi (t)) {z (αi (t))}

p−1 p

i + bi (αi (t)) αi0 (t) .

(3.2.71)

i=1

By taking t = s in (3.2.71) and integrating it with respect to s from t0 to t we get {z (t)} ×

p−1 p

Zt X n h

≤c

p−1 p

+ (p − 1)

ai (αi (s)) {z (αi (s))}

p−1 p

i + bi (αi (s)) αi0 (s) ds.

(3.2.72)

t0 i=1

Making the change of variables on the right hand side of (3.2.72) and rewriting we get {z (t)}

p−1 p

α Zi (t)

≤ M (t) + (p − 1) αi (t0 )

n X

ai (σ) {z (σ)}

p−1 p

dσ.

(3.2.73)

i=1

Clearly M (t) is continuous,positive and nondecreasing function for t ∈ I. Now by following the idea used in the proof of Theorem 1 in [22] (see also [43]) we get   α Zi (t) n X p−1   ai (σ) dσ  . (3.2.74) {z (t)} p ≤ M (t) exp (p − 1) i=1

αi (t0 )

1

Using (3.2.74) in u (t) ≤ {z (t)} p we get the desired inequality in (3.2.66). The case c ≥ 0 can be completed as mentioned in the proof of Theorem 3.2.4, part (c1 ). (q2 ) Let c > 0 and define a function z(t) by the right hand side of (3.2.68). 1 Then z (t0 ) = c, u (t) ≤ {z (t)} p , z(t) is positive and nondecreasing for t ∈ I and by following the proof of (q1 ) given above upto (3.2.73) with suitable changes we get {z (t)}

p−1 p

≤ M (t) + (p − 1)

α Zi (t) n X i=1

αi (t0 )

1 ai (σ) w {z (σ)} p dσ.

(3.2.75)

142


Now fix λ ∈ I such that t0 ≤ t ≤ λ ≤ t1 . Then from (3.2.75) we observe that {z (t)}

p−1 p

≤ M (λ) + (p − 1)

α Zi (t) n X i=1

1 ai (σ) w {z (σ)} p dσ,

(3.2.76)

αi (t0 )

for t0 ≤ t ≤ λ. Define a function v(t) by the right hand side of (3.2.76). Then v (t0 ) = M (λ) , {z (t)} t0 ≤ t ≤ λ and v (t) ≤ M (λ) + (p − 1)

p−1 p

≤ v (t) , v(t) is positive and nondecreasing for

α Zi (t) n X i=1

1 ai (σ) w {v (σ)} p−1 dσ,

αi (t0 )

for t0 ≤ t ≤ λ. The rest of the proof can be completed by following the proof of Theorem 3.2.5, part (d1 ) with suitable changes (see also [43]). We omit the details.

3.3 Further retarded integral inequalities in one variable In view to widen the scope of applications of the inequalities of the type given earlier section, in [58,61,64,74,77] Pachpatte has established a number of such inequalities. In this section we offer some of the inequalities given in the above references, which are more adequate in certain situations. First we shall give the following theorems which deals with the inequalities proved in [61]. ∂ Theorem 3.3.1. Let u (t) , a (t) ∈ C (I, R+ ), ki (t, s) , ∂t ki (t, s) ∈ C I 2 , R+ for t0 ≤ s ≤ t < T and αi (t) ∈ C 1 (I, I) be nondecreasing with αi (t) ≤ t on I = [t0 , T ) for i = 1, ..., n. (a1 ) If c ≥ 0 is a real constant and u (t) ≤ c +

α Zi (t) n X i=1

ki (t, s) u (s) ds,

(3.3.1)

αi (t0 )


Zt

u (t) ≤ c exp  t0

 Q (s) ds ,

(3.3.2)

Chapter 3

143

for t ∈ I, where Q (t) =

n X

  0 ki (t, αi (t)) αi (t) +

i=1

α Zi (t)

 ∂  ki (t, σ) dσ , ∂t

(3.3.3)

αi (t0 )

for t ∈ I. (a2 ) If a(t) is nondecreasing for t ∈ I and u (t) ≤ a (t) +

α Zi (t) n X i=1

ki (t, s) u (s) ds,

(3.3.4)

αi (t0 )

for t ∈ I, then   t Z u (t) ≤ a (t) exp  Q (s) ds ,

(3.3.5)

t0

for t ∈ I, where Q(t) is given by (3.3.3). Proof. From the hypotheses on αi (t) we observe that αi0 (t) ≥ 0 for t ∈ I and i = 1, ..., n. (a1 ) Define a function z(t) by the right hand side of (3.3.1). Then z (t0 ) = c, u (t) ≤ z (t) and   α i (t) Z n X ∂  0 ki (t, s) u (s) ds z 0 (t) = ki (t, αi (t)) u (αi (t)) αi (t) + ∂t i=1 αi (t0 )

 α Zi (t) n X ∂   0 ki (t, s) z (s) ds ≤ ki (t, αi (t)) z (αi (t)) αi (t) + ∂t i=1 

αi (t0 )



n X  0 ≤ ki (t, αi (t)) αi (t) + i=1

α Zi (t)

 ∂  ki (t, s) dsz (αi (t)) ∂t

αi (t0 )

≤ Q (t) z (t) , which implies  t  Z z (t) ≤ c exp  Q (s) ds . t0

Using (3.3.6) in u (t) ≤ z (t) we get the desired inequality in (3.3.2).

(3.3.6)

144


(a2 ) First we assume that a(t) > 0 for all t ∈ I. It is easy to observe that for s ≤ αi (t) ≤ t we have a (s) ≤ a (αi (t)) ≤ a (t) . In view of this, from (3.3.4) we observe that α Zi (t) n X u (t) u (s) ≤1+ ds. ki (t, s) a (t) a (s) i=1

(3.3.7)

αi (t0 )

Now an application of the inequality in part (a1 ) to (3.3.7) yields (3.3.5). If a(t) = 0, then from (3.3.4) we observe that

u (t) ≤ ε +

α Zi (t) n X i=1

ki (t, s) u (s) ds,

(3.3.8)

αi (t0 )

where ε > 0 is an arbitrary small constant. An application of the inequality in part (a1 ) to (3.3.8) yields  t  Z u (t) ≤ ε exp  Q (s) ds .

(3.3.9)

t0

Now by letting ε → 0 in (3.3.9) we have u(t) = 0 and hence (3.3.5) holds. ∂ ki (t, s) , αi (t) be as in Theorem Theorem 3.3.2 . Let u (t) , a (t) , ki (t, s) , ∂t 3.3.1.

(b1 ) Let c ≥ 0 be a real constant, g ∈ C (R+ , R+ ) be a nondecreasing function with g(u) > 0 for u > 0 . If for t ∈ I,

u (t) ≤ c +

α Zi (t) n X i=1

ki (t, s) g (u (s)) ds,

(3.3.10)

αi (t0 )

then for t0 ≤ t ≤ t1 ; t, t1 ∈ I,   Zt u (t) ≤ G−1 G (c) + Q (s) ds ,

(3.3.11)

t0

where Q(t) is given by (3.3.3) and G−1 is the inverse function of Zr G (r) = r0

ds , r > 0, g (s)

(3.3.12)

Chapter 3

145

r0 > 0 is arbitrary and t1 ∈ I is chosen so that Zt G (c) +

Q (s) ds ∈ Dom G−1 ,

t0

for all t lying in the interval t0 ≤ t ≤ t1 . (b2 ) Let g(u) be as in (b1 ) and suppose in addition it is subadditive. If for t ∈ I,

u (t) ≤ a (t) +

α Zi (t) n X i=1

ki (t, s) g (u (s)) ds,

(3.3.13)

αi (t0 )

then for t0 ≤ t ≤ t2 ; t, t2 ∈ I,  u (t) ≤ a (t) + G−1 G (A (t)) +



Zt

Q (s) ds ,

(3.3.14)

t0

where G, G−1 , Q(t) be as in (b1 ),

A (t) =

α Zi (t) n X i=1

ki (t, s) g (a (s)) ds,

(3.3.15)

αi (t0 )

for t ∈ I and t2 ∈ I is chosen so that Zt G (A (t)) +

Q (s) ds ∈ Dom G−1 ,

t0

for all t lying in the interval t0 ≤ t ≤ t2 . Proof. From the hypotheses on αi (t) we observe that αi0 (t) ≥ 0 for t ∈ I and i = 1, ..., n. (b1 ) We first assume that c > 0 and define a function z(t) by the right hand side of (3.3.10). Then z (t0 ) = c, u (t) ≤ z (t), z(t) is positive and nondecreasing for t ∈ I and by following the proof of Theorem 3.3.1, part (a1 ) with suitable changes we have z 0 (t) ≤ Q (t) g (z (t)) .

(3.3.16)

The rest of the proof can be completed by following the proof of Theorem 3.2.5, part (d1 ).

146


(b2 ) Define a function z(t) by

z (t) =

α Zi (t) n X i=1

ki (t, s) g (u (s)) ds.

(3.3.17)

αi (t0 )

Then z (t0 ) = 0 and from (3.3.13) we have u (t) ≤ a (t) + z (t) .

(3.3.18)

Using (3.3.18) in (3.3.17) we have

z (t) ≤

α Zi (t) n X i=1

≤ A (t) +

ki (t, s) g (a (s) + z (s)) ds

αi (t0 )

α Zi (t) n X i=1

ki (t, s) g (z (s)) ds,

αi (t0 )

where A(t) is given by (3.3.15). It is easy to observe that A(t) is nonnegative and nondecreasing for t ∈ I. Now by following the similar arguments as in the proof of Theorem 2.4.2 given in [34] and in view of the proof of Theorem 3.2.5, part (d1 ) we get   Zt (3.3.19) z (t) ≤ G−1 G (A (t)) + Q (s) ds . t0

Using (3.3.19) in (3.3.18) we get the required inequality in (3.3.14). The subinterval t0 ≤ t ≤ t2 is obvious. The next theorem contains the inequalities established in [77] involving Lipschitizian type kernel function. Theorem 3.3.3. Let u (t) , a (t) , b (t) ∈ C (I, R+ ) and α (t) ∈ C 1 (I, I) be nondecreasing with α (t) ≤ t on I = [t0 , T ) . (c1 ) Let L ∈ C (I × R+ , R+ ) and 0 ≤ L (t, x) − L (t, y) ≤ M (t, y) (x − y) ,

(3.3.20)

for t ∈ I and x ≥ y ≥ 0,where M ∈ C (I × R+ , R+ ). If α(t) Z

u (t) ≤ a (t) + b (t) α(t0 )

L (s, u (s)) ds,

(3.3.21)

Chapter 3

147


α(t) Z

u (t) ≤ a (t) + b (t)



α(t) Z

 L (σ, a (σ)) exp 

 M (τ, a (τ )) b (τ ) dτ dσ, (3.3.22) σ

α(t0 )

for t ∈ I (c2 ) Let L ∈ C (I × R+ , R+ ) and ψ ∈ C (R+ , R+ ) be strictly increasing function with ψ (0) = 0 and 0 ≤ L (t, x) − L (t, y) ≤ M (t, y) ψ −1 (x − y) ,

(3.3.23)

for t ∈ I and x ≥ y ≥ 0,, where M ∈ C (I × R+ , R+ ) and ψ −1 is the inverse of ψ. If   α(t) Z   u (t) ≤ a (t) + ψ b (t) L (s, u (s)) ds , (3.3.24) α(t0 )


α(t) Z

 u (t) ≤ a (t) + ψ b (t)

L (σ, a (σ))

α(t0 )





α(t) Z

 × exp 



  M (τ, a (τ )) b (τ )dτ  dσ  ,

(3.3.25)

σ

for t ∈ I. (c3 ) Let L, ψ, M be as in (c2 ) and the condition (3.3.23) holds. Suppose in addition ψ −1 (xy) ≤ ψ −1 (x) ψ −1 (y) for x, y ∈ R+ .If   α(t) Z   L (s, u (s)) ds , (3.3.26) u (t) ≤ a (t) + b (t) ψ  α(t0 )


α(t) Z

 u (t) ≤ a (t) + b (t) ψ 

L (σ, a (σ))

α(t0 )



α(t) Z



  M (τ, a (τ )) ψ −1 (b (τ ))dτ  dσ  ,

 × exp  σ

for t ∈ I.



(3.3.27)

148


(c4 ) Let L, M be as in (c1 ) and the condition (3.3.20) holds. Let g ∈ C (R+ , R+ ) be nondecreasing function with g(u) > 0 for u > 0 . If for t ∈ I,   α(t) Z   u (t) ≤ a (t) + b (t) g  L (s, u (s)) ds , (3.3.28) α(t0 )

for t0 ≤ t ≤ t1 ; t, t1 ∈ I, 

 

   u (t) ≤ a (t) + b (t) g G−1 G 

α(t) Z

  L (σ, a (σ))

α(t0 )



α(t) Z

+

 M (σ, a (σ)) b (σ) dσ  ,

(3.3.29)

α(t0 )

where G, G−1 be as in Theorem 3.2.5, part (d1 ) and t1 ∈ I is chosen so that   α α Zi (t) Zi (t)   G L (σ, a (σ))dσ  + M (σ, a (σ)) b (σ)dσ ∈ Dom G−1 , αi (t0 )

αi (t0 )

for all t lying in the interval t0 ≤ t ≤ t1 . Proof.

From the hypotheses on α (t) we observe that α0 (t) ≥ 0 fot t ∈ I.

(c1 ) Define a function z(t) by α Zi (t)

L (s, u (s))ds.

z (t) =

(3.3.30)

αi (t0 )

Then z (t0 ) = 0 and from (3.3.21) we have u (t) ≤ a (t) + b (t) z (t) ,

(3.3.31)

for t ∈ I. From (3.3.30), (3.3.31) and the condition (3.3.20) it follows that z 0 (t) = L (α (t) , u (α (t))) α0 (t) ≤ L (α (t) , a (α (t)) + b (α (t)) z (α (t))) α0 (t) − L (α (t) , a (α (t))) α0 (t) +L (α (t) , a (α (t))) α0 (t) ≤ M (α (t) , a (α (t))) b (α (t)) z (α (t)) α0 (t) + L (α (t) , a (α (t))) α0 (t) ,

Chapter 3

149

which implies Zt z (t) ≤

L (α (s) , a (α (s))) α0 (s)

t0



Zt

× exp 

 M (α (σ) , a (α (σ))) b (α (σ)) α0 (σ) dσ  ds.

(3.3.32)

s

By making the change of variable on the right hand side of (3.3.32) we get   α(t) α(t) Z Z   z (t) ≤ L (σ, a (σ)) exp  M (τ, a (τ )) a (τ ) b (τ ) dτ  dσ. (3.3.33) σ

α(t0 )

Using (3.3.33) in (3.3.31) we get the required inequality in (3.3.22). The proofs of (c2 ) − (c4 ) can be completed by following the proof of (c1 ) given above and closely looking at the proof of Theorem 1.4.4 parts (d2 ) − (d4 ). We omit the details. Another useful inequality proved in [74] is embodied in the following theorem. Theorem 3.3.4. Let u (t) , a (t) , b (t) ∈ C (I, R+ ) , α (t) ∈ C 1 (I, I) be nondecreasing with α (t) ≤ t on I = [t0 , T ) and k ≥ 0 be a real constant. If   α(t) Z Zs   u (t) ≤ k + a (s) u (s) + b (σ) u (σ) dσ ds, (3.3.34) α(t0 )

α(t0 )

for t ∈ I, then 

α(t) Z

 u (t) ≤ k 1 + α(t0 )



Zs

 a (s) exp 

    [a (σ) + b (σ)]dσ ds ,

(3.3.35)

α(t0 )

for t ∈ I. Proof. From the hypotheses on α (t) we have α0 (t) ≥ 0 for t ∈ I. Define a function z(t) by the right hand side of (3.3.34). Then z (t0 ) = k,, u (t) ≤ z (t) and   α(t) Z   z 0 (t) = a (α (t)) u (α (t)) + b (σ) u (σ) dσ  α0 (t) α(t0 )

150

Retarded integral inequalities 

α(t) Z

 ≤ a (α (t)) z (α (t)) +

  b (σ) z (σ) dσ  α0 (t)

α(t0 )



α(t) Z

 ≤ a (α (t)) z (t) +

  b (σ) z (σ) dσ  α0 (t) .

(3.3.36)

α(t0 )

Let α(t) Z

v (t) = z (t) +

b (σ) z (σ) dσ,

(3.3.37)

α(t0 )

then v (t0 ) = z (t0 ) = k, z (t) ≤ v (t) and from (3.3.36) we get z 0 (t) ≤ a (α (t)) v (t) α0 (t) .

(3.3.38)

From (3.3.37), (3.3.38) and the fact that z (t) ≤ v (t) we have v 0 (t) = z 0 (t) + b (α (t)) z (α (t)) α0 (t) ≤ a (α (t)) v (t) α0 (t) + b (α (t)) z (α (t)) α0 (t) ≤ [a (α (t)) + b (α (t))] α0 (t) v (t) , which implies  t  Z v (t) ≤ k exp  [a (α (s)) + b (α (s))] α0 (s) ds .

(3.3.39)

t0

By making the change of variable on the right hand side of (3.3.39) we get   α(t) Z   v (t) ≤ k exp  [a (σ) + b (σ)] dσ  . (3.3.40) α(t0 )

Using (3.3.40) in (3.3.38) and integrating it from t0 to t; t ∈ I and then making the change of variable and using the fact that u (t) ≤ z (t) we get the desired inequality in (3.3.35). Remark 3.3.1. In the special case when α (t) = t, the inequality given in Theorem 3.3.4 reduces to the inequality established earlier by Pachpatte, see[34, Theorem 1.7.1]. We shall now give the following theorem which deals with the inequalities proved in [58].

Chapter 3

151

Theorem 3.3.5. Let u (t) , a (t) ∈ C (I, R+ ) , b (t, s) ∈ C I 2 , R+ for t0 ≤ s ≤ t < T, α (t) ∈ C 1 (I, I) be nondecreasing with α (t) ≤ t on I = [t0 , T ) and k ≥ 0 be a real constant. (d1 ) If α(t) Z

u (t) ≤ k +





Zs

 b (s, σ) u (σ) dσ  ds,

 a (s) u (s) +

α(t0 )

(3.3.41)

α(t0 )

for t ∈ I, then u (t) ≤ k exp (B (t)) ,

(3.3.42)

for t ∈ I, where α(t) Z

  a (s) +

B (t) = α(t0 )



Zs

 b (s, σ) dσ  ds,

(3.3.43)

α(t0 )

for t ∈ I. (d2 ) Let g ∈ C (R+ , R+ ) be a nondecreasing function with g(u) > 0 for u > 0. If for t ∈ I,   α(t) Z Zs   b (s, σ) g (u (σ)) dσ  ds, (3.3.44) u (t) ≤ k + a (s) g (u (s)) + α(t0 )

α(t0 )

then for t0 ≤ t ≤ t1 ; t, t1 ∈ I, u (t) ≤ G−1 [G (k) + B (t)] ,

(3.3.45)

where B(t) is given by (3.3.43), G, G−1 be as in Theorem 3.3.2, part (b1 ) and t1 ∈ I is chosen so that G (k) + B (t) ∈ Dom G−1 , for all t lying in the interval t0 ≤ t ≤ t1 . Proof. From the hypotheses on α (t) we have α0 (t) ≥ 0 for t ∈ I. (d1 ) Define a function z(t) by the right hand side of (3.3.41). Then z (t0 ) = k, u (t) ≤ z (t) , z(t) is positive and nondecreasing for t ∈ I and   α(t) Z   z 0 (t) = a (α (t)) u (α (t)) + b (α (t) , σ) u (σ) dσ  α0 (t) α(t0 )

152

Retarded integral inequalities 

α(t) Z

 ≤ a (α (t)) z (α (t)) +

  b (α (t) , σ) z (σ) dσ  α0 (t)

α(t0 )



α(t) Z

 ≤ a (α (t)) +

  b (α (t) , σ) dσ  α0 (t) z (t) ,

α(t0 )

which implies     α(s) Zt Z     z (t) ≤ k exp  a (α (s)) + b (α (s) , σ) dσ  α0 (s) ds . t0

(3.3.46)

α(t0 )

By making the change of variable on the right hand side in (3.3.46) and using the fact that u (t) ≤ z (t) we get the inequality in (3.3.42). (d2 ) The proof follows by the similar arguments as in the proof of (d1 ) and the proof of Theorem 3.2.5, part (d1 ). Here we omit the details. Remark 3.3.2. We note that the inequalities given in Theorem 3.3.5 contains in the special case when b(t, s) = 0, the well known inequalities due to Gronwall, Bellman and Bihari (see [34, Theorems 1.2.2 and 2.3.1]). To the end of this section we present the inequality established in [64]. Theorem 3.3.6. Let I = [α, β] , D = (t, s) ∈ I 2 : α ≤ s ≤ t ≤ β and u (t) , f (t) ∈ C (I, R+ ) a (t, s) , b (t, s) , c (t, s) ∈ C (D, R+ ). Suppose that a(t, s), b(t, s) be nondecreasing in t for each s ∈ I, h (t) ∈ C 1 (I, I) be nondecreasing with h (t) ≤ t on I, k ≥ 0 be a real constant and 

h(t) Z

u (t) ≤ k +

Zs

 a (t, s) f (s) u (s) +

h(α)

  c (s, σ) u (σ) dσ  ds

h(α)

h(β) Z

+

b (t, s) u (s) ds,

(3.3.47)

h(α)

for t ∈ I. If h(β) Z

p (t) =

b (t, s) exp (E (s)) ds < 1, h(α)

(3.3.48)

Chapter 3

153

for t ∈ I, where 

h(t) Z

 a (t, ξ) f (ξ) +

E (t) =



Zξ

h(α)

 c (ξ, σ) dσ  dξ,

(3.3.49)

h(α)

for t ∈ I, then u (t) ≤

k exp (E (t)) , 1 − p (t)

(3.3.50)

for t ∈ I. Proof. From the hypotheses on h(t) we have h0 (t) ≥ 0 for t ∈ I. Let k > 0 and fix T ∈ I, then for α ≤ t ≤ T, from (3.3.47) we have   h(t) Z Zs   a (T, s) f (s) u (s) + c (s, σ) u (σ) dσ  ds u (t) ≤ k + h(α)

h(α)

h(β) Z

+

b (T, s) u (s) ds.

(3.3.51)

h(α)

Define a function z(t, T ), t ∈ [α, T ] by the right hand side of (3.3.51). Then for t ∈ [α, T ], u (t) ≤ z (t, T ), z(t, T ) is positive and nondecreasing in t, h(β) Z

z (α, T ) = k +

b (T, s) u (s) ds,

(3.3.52)

h(α)

and 

h(t) Z

 D1 z (t, T ) = a (T, h (t)) f (h (t)) u (h (t)) +

  c (h (t) , σ) u (σ) dσ  h0 (t)

h(α)



h(t) Z

 ≤ a (T, h (t)) f (h (t)) z (h (t)) +

  c (h (t) , σ) z (σ, T ) dσ  h0 (t)

h(α)



h(t) Z

 ≤ a (T, h (t)) f (h (t)) + h(α)

  c (h (t) , σ) dσ  h0 (t) z (t, T )

154


i.e.,  D1 z (t, T )  ≤ a (T, h (t)) f (h (t)) + z (t, T )

h(t) Z

  c (h (t) , σ) dσ  h0 (t) .

(3.3.53)

h(α)

By setting t = s in (3.3.53) and integrating it with respect to s from α to T we get  T Z z (T ) ≤ z (α) exp  a (T, h (s)) [f (h (s)) α h(t) Z

+





  c (h (s) , σ) dσ  h0 (s) ds .

(3.3.54)

h(α)

Since T is arbitrary, from (3.3.54), (3.3.52) with T replaced by t we have  t Z  a (t, h (s)) [f (h (s)) z (t) ≤ z (α) exp α h(t) Z

+





  c (h (s) , σ) dσ  h0 (s) ds ,

(3.3.55)

h(α) h(β) Z

z (α, t) = k +

b (t, s) u (s) ds.

(3.3.56)

h(α)

By making the change of variable on the right hand side of (3.3.55) and using u (t) ≤ z (t, t), t ∈ I we get u (t) ≤ z (α, t) exp (E (t)) ,

(3.3.57)

for t ∈ I. Using (3.3.57) in (3.3.56) and in view of (3.3.48), it is easy to observe that z (α, t) ≤

k . 1 − p (t)

(3.3.58)

The required inequality in (3.3.50) follows by using (3.3.58) in (3.3.57). The case k ≥ 0 can be completed as mentioned in the proof of Theorem 3.2.4, part (c1 ). Remark 3.3.3. If we take in Theorem 3.3.6, (i) c(t, s) = 0, b(t, s) = 0, a(t, s) = a(s), then we get the inequality given by Lipovan in [21, Corollary on p. 391] for t ∈ I, (ii) c(t, s) = 0, h(t) = t, then we get the inequality given by Pachpatte in [52, Theorem 1]

Chapter 3

155

3.4 Retarded integral inequalities in two variables The study of various classes of partial differential and integral equations has led to the investigation of a number of new integral inequalities which provide explicit bounds on the unknown functions. In this section we present some fundamental retarded integral inequalities in two independent variables, recently investigated by Pachpatte in [43,58,69,77], which can be used more conveniently in certain applications. In what follows R denote the set of real numbers; R+ = [0, ∞) , R1 = [1, ∞) , I1 = [x0 , X) , I2 = [y0 , Y ) are the given subsets of R, ∆ = I1 × I2 and 0 denotes the derivative. The partial derivatives of a function z(x, y) for ∂ x, y ∈ R with respect to x, y and xy are denoted by D1 z (x, y) (or ∂x z (x, y) ), ∂ ∂2 D2 z (x, y) (or ∂y z (x, y) ) and D1 D2 z (x, y) = D2 D1 z (x, y) (or ∂y∂x z (x, y) or zxy (x, y) ) respectively. We begin with the following theorems which contains the inequalities proved in [43]. Theorem 3.4.1. Let a (x, y) , b (x, y) ∈ C (∆, R+ ) and α (x) ∈ C 1 (I1 , I1 ) , β (y) ∈ C 1 (I2 , I2 ) be nondecreasing with α (x) ≤ x on I1 , β (y) ≤ y on I2 . Let k ≥ 0, c ≥ 1 and p > 1 be real constants. (a1 ) If u (x, y) ∈ C (∆, R+ ) and α(x) β(y) Z Z

Zx Zy u (x, y) ≤ k +

a (s, t) u (s, t) dtds+ x0 y0

b (s, t) u (s, t) dtds, (3.4.1)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, then u (x, y) ≤ k exp (A (x, y) + B (x, y)) ,

(3.4.2)

for (x, y) ∈ ∆, where Zx Zy a (s, t) dtds,

A (x, y) =

(3.4.3)

x0 y0 α(x) β(y) Z Z

b (s, t) dtds,

B (x, y) = α(x0 ) β(y0 )

for (x, y) ∈ ∆.

(3.4.4)

156


(a2 ) If u (x, y) ∈ C (∆, R1 ) and Zx Zy u (x, y) ≤ c +

a (s, t) u (s, t) log u (s, t) dtds x0 y0

α(x) β(y) Z Z

+

b (s, t) u (s, t) log u (s, t) dtds,

(3.4.5)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, then u (x, y) ≤ cexp(A(x,y)+B(x,y)) ,

(3.4.6)

for (x, y) ∈ ∆,where A(x, y) and B(x, y) are given by (3.4.3) and (3.4.4). (a3 ) If u (x, y) ∈ C (∆, R+ ) and α(x) β(y) Z Z

Zx Zy

p

u (x, y) ≤ c +

a (s, t) u (s, t) dtds +

x0 y0

b (s, t) u (s, t) dtds, (3.4.7)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, then 1 p−1 p−1 p−1 p (A (x, y) + B(x, y)) u (x, y) ≤ k + , p

(3.4.8)

for (x, y) ∈ ∆, where A(x, y) and B(x, y) are given by (3.4.3) and (3.4.4). Theorem 3.4.2. Let a(x, y), b(x, y), α (x) , β (y) , k, c, p be as in Theorem 3.4.1. For i = 1, 2, let gi ∈ C (R+ , R+ ) be nondecreasing with gi (u) > 0 for u > 0. (b1 ) If u (x, y) ∈ C (∆, R+ ) and for (x, y) ∈ ∆, Zx Zy u (x, y) ≤ k +

a (s, t) g1 (u (s, t)) dtds x0 y0

α(x) β(y) Z Z

+

b (s, t) g2 (u (s, t)) dtds,

α(x0 ) β(y0 )

then for x0 ≤ x ≤ x1 , y0 ≤ y ≤ y1 ; x, x1 ∈ I1 , y, y1 ∈ I2 ,

(3.4.9)

Chapter 3

157

(i) in case g2 (u) ≤ g1 (u) , u (x, y) ≤ G−1 1 [G1 (k) + A (x, y) + B (x, y)] ,

(3.4.10)

(ii) in case g1 (u) ≤ g2 (u) , u (x, y) ≤ G−1 2 [G2 (k) + A (x, y) + B (x, y)] ,

(3.4.11)

are as in Theorem 3.2.2, part (b1 ) and A(x, y), B(x, y) are given where Gi , G−1 i by (3.4.3), (3.4.4) and x1 ∈ I1 , y1 ∈ I2 are chosen so that for i = 1, 2, , Gi (k) + A (x, y) + B (x, y) ∈ Dom G−1 i for all x and y lying in [x0 , x1 ] and [y0 , y1 ] respectively. (b2 ) If u (x, y) ∈ C (∆, R1 ) and for (x, y) ∈ ∆, Zx Zy u (x, y) ≤ c +

a (s, t) u (s, t) g1 (log u (s, t)) dtds x0 y0

α(x) β(y) Z Z

b (s, t) u (s, t) g2 (log u (s, t)) dtds,

+

(3.4.12)

α(x0 ) β(y0 )

then for x0 ≤ x ≤ x2 , y0 ≤ y ≤ y2 ; x, x2 ∈ I1 , y, y2 ∈ I2 , (i) in case g2 (u) ≤ g1 (u), u (x, y) ≤ exp G−1 1 [G1 (log c) + A(x, y) + B(x, y)] ,

(3.4.13)

(ii) in case g1 (u) ≤ g2 (u) , u (x, y) ≤ exp G−1 2 [G2 (log c) + A(x, y) + B(x, y)] ,

(3.4.14)

where Gi , G−1 i , A(x, y), B(x, y) are as in (b1 ) and x2 ∈ I1 , y2 ∈ I2 are chosen so that for i = 1, 2, , Gi (log c) + A (x, y) + B (x, y) ∈ Dom G−1 i for all x and y lying in [x0 , x2 ] and [y0 , y2 ] respectively. (b3 ) If u (x, y) ∈ C (∆, R+ ) and for (x, y) ∈ ∆, Zx Zy

p

u (x, y) ≤ k +

a (s, t) g1 (u (s, t)) dtds x0 y0

α(t) β(t) Z Z

+

b (s, t) g2 (u (s, t)) dtds,

α(x0 ) β(y0 )

then for x0 ≤ x ≤ x3 , y0 ≤ y ≤ y3 ; x, x3 ∈ I1 , y, y3 ∈ I2 ,

(3.4.15)

158


(i) in case g2 (u) ≤ g1 (u) , 1 u (x, y) ≤ H1−1 [H1 (k) + A (x, y) + B (x, y)] p ,

(3.4.16)

(ii) in case g1 (u) ≤ g2 (u) , 1 u (x, y) ≤ H2−1 [H2 (k) + A (x, y) + B (x, y)] p ,

(3.4.17)

where Hi , Hi−1 are as in Theorem 3.2.2, part (b3 ) and A(x, y), B(x, y) are given by (3.4.3), (3.4.4) and x3 ∈ I1 , y3 ∈ I2 are chosen so that for i = 1, 2, Hi (k) + A (x, y) + B (x, y) ∈ Dom Hi−1 , for all x and y lying in [x0 , x3 ] and [y0 , y3 ] respectively. Proofs of Theorems 3.4.1 and 3.4.2. Since the proofs resemble one another, we give the details for (a1 ) and (b3 ) only; the proofs of the remaining inequalities can be completed by following the proofs of the above mentioned inequalities and closely looking at the proofs of Theorems 3.2.1 and 3.2.2. From the hypotheses we observe that α0 (x) ≥ 0 for x1 ∈ I1 , β 0 (y) ≥ 0 for y ∈ I2 . (a1 ) Let k > 0 and define a function z(x, y) by the right hand side of (3.4.1).Then z (x0 , y) = z (x, y0 ) = k, u (x, y) ≤ z (x, y) , z(x, y) is positive and nondecreasing for (x, y) ∈ ∆ and   β(y) Zy Z   b (α (x) , t) u (α (x) , t) dt α0 (x) D1 z (x, y) = a (x, t) u (x, t) dt +  y0

Zy ≤

β(y0 )



β(y) Z

 a (x, t) z (x, t) dt +  y0

  b (α (x) , t)z (α (x) , t) dtα0 (x)

β(y0 )



Zy ≤ z (x, t)

β(y) Z

 a (x, t) dt + z (α (x) , β (y))  y0

  b (α (x) , t) dt α0 (x)

β(y0 )

    β(y) Zy Z     b (α (x) , t) dt α0 (x) ; ≤ z (x, y)  a (x, t) dt +  y0

β(y0 )

i.e., D1 z (x, y) ≤ z (x, y)

Zy



β(y) Z

 a (x, t) dt +  y0

β(y0 )

  b (α (x) , t) dt α0 (x).

(3.4.18)

Chapter 3

159

Keeping y fixed in (3.4.18), setting x = σ, and integrating it with respect to σ from x0 to x, x ∈ I1 , and by making the change of variable we get z (x, y) ≤ k exp (A (x, y) + B (x, y)) .

(3.4.19)

Using (3.4.19) in u (x, y) ≤ z (x, y) we get the required inequality in (3.4.2). The case k ≥ 0 follows as mentioned in the proof of Theorem 3.2.1, part (a1 ). (b3 ) Let k > 0 and define a function z(x, y) by the right hand side of (3.4.15). 1 Then z (x0 , y) = z (x, y0 ) = k, u (x, y) ≤ {z (x, y)} p , z(x, y) is positive and nondecreasing for (x, y) ∈ ∆ and Zy D1 z (x, y) =

a (x, t) g1 (u (x, t)) dt y0



β(y) Z

 +

  b (α (x) , t) g2 (u (α (x) , t)) dt α0 (x)

β(y0 )

Zy ≤

1 a (x, t) g1 {z (x, t)} p dt

y0



β(y) Z

 +

 1  b (α (x) , t) g2 {z (α (x) , t)} p dt α0 (x)

β(y0 )

Zy 1 p ≤ g1 {z (x, t)} a (x, t) dt y0

  β(y) Z 1   b (α (x) , t) α0 (x) . +g2 {z (α (x) , β (y))} p 

(3.4.20)

β(y0 )

(i) When g2 (u) ≤ g1 (u) , then from (3.4.20) we observe that   β(y) Zy Z D z (x, y)  1 ≤ a (x, t) dt +  b (α (x) , t) dt α0 (x) .  1 g1 {z (x, y)} p y 0

From (3.2.27) and (3.4.21) we have D1 H1 (z (x, y)) =

D z (x, y) 1 1 g1 {z (x, y)} p

β(y0 )

(3.4.21)

160

Retarded integral inequalities 

Zy ≤

β(y) Z

 a (x, t) dt +  y0

  b (α (x) , t) dt α0 (x) .

(3.4.22)

β(y0 )

Keeping y fixed in (3.4.22), setting x = σ,then integrating with respect to σ from x0 to x; x ∈ I1 , and making the change of variable we have H1 (z (x, y)) ≤ H1 (k) + A (x, y) + B (x, y) .

(3.4.23) 1

Using the bound on z(x, y) from (3.4.23) in u (x, y) ≤ {z (x, y)} p we get (3.4.16). The case k ≥ 0 follows as mentioned in the proof of Theorem 3.2.1, part (a1 ). The subdomain for x, y is obvious. The proof of the case when g1 (u) ≤ g2 (u) can be completed similarly. Remark 3.4.1. We note that the above proofs can be carried out by differentiation of z(x, y) defined therein, with respect to y. Similar remarks apply to the proofs of other inequalities in Theorems 3.4.1 and 3.4.2. A more general version of the inequality (3.4.9) in Theorem 3.4.2, recently established in [69] is embodied in the following theorem. For some suitable functions defined on the respective domains of their definitions we set F [x, y, m; φ1 , ψ1 , a1 , p1 ; φ2 , ψ2 , a2 , p2 ] φZ1 (x) ψZ1 (y)

=

a1 (s, t) p1 (m (s, t)) dtds φ1 (x0 ) ψ1 (y0 ) φZ2 (x) ψZ2 (y)

+

a2 (s, t) p2 (m (s, t)) dtds,

φ2 (x0 ) ψ2 (y0 )

to simplify the details of presentation. Theorem 3.4.3. Let u (x, y) , f (x, y) , b (x, y) , a1 (x, y) , a2 (x, y) ∈ C (∆, R+ ) and for i = 1, 2 φi (x) ∈ C 1 (I1 , I1 ) , ψi (y) ∈ C 1 (I2 , I2 ) be nondecreasing with φi (x) ≤ x on I1 , ψi (y) ≤ y on I2 . Let gi (u) , i = 1, 2 be as in Theorem 3.2.3 and for (x, y) ∈ ∆, u (x, y) ≤ f (x, y) + b (x, y) F [x, y, u; φ1 , ψ1 , a1 , g1 ; φ2 , ψ2 , a2 , g2 ] , (3.4.24) then for x0 ≤ x ≤ x1 , y0 ≤ y ≤ y1 ; x, x1 ∈ I1 , y, y1 ∈ I2 ,

Chapter 3

161

(i) in case g2 (u) ≤ g1 (u) , u (x, y) ≤ f (x, y) + b (x, y) G−1 1 [G1 (E (x, y)) +F [x, y, b; φ1 , ψ1 , a1 , g1; φ2 , ψ2 , a2 , g2 ]] ,

(3.4.25)

(ii) in case g1 (u) ≤ g2 (u) , u (x, y) ≤ f (x, y) + b (x, y) G−1 2 [G2 (E (x, y)) +F [x, y, b; φ1 , ψ1 , a1 , g1; φ2 , ψ2 , a2 , g2 ]] , where

Gi , G−1 i ,i

(3.4.26)

= 1, 2 are as in Theorem 3.3.2, part (b1 ),

E (x, y) = F [x, y, f ; φ1 , ψ1 , a1 , g1 ; φ2 , ψ2 , a2 , g2 ] ,

(3.4.27)

and x1 ∈ I1 , y1 ∈ I2 are chosen so that for i = 1, 2, Gi (E (x, y)) + F [x, y, b; φ1 , ψ1 , a1 , g1 ; φ2 , ψ2 , a2 , g2 ] ∈ Dom G−1 , i for all x and y lying in [x0 , x1 ] and [y0 , y1 ] respectively. Proof. From the hypotheses we observe that for i = 1, 2 , φ0i (x) ≥ 0 for x ∈ I1 , ψi0 (y) ≥ 0 for y ∈ I2 . Define a function z(x, y) by z (x, y) = F [x, y, u; φ1 , ψ1 , a1 , g1 ; φ2 , ψ2 , a2 , g2 ] .

(3.4.28)

Then z (x0 , y) = z (x, y0 ) = 0 and (3.4.24) can be restated as u (x, y) ≤ f (x, y) + b (x, y) z (x, y) .

(3.4.29)

Using (3.4.29) in (3.4.28) and making use of the hypotheses on g1 , g2 we get φZ1 (x) ψZ1 (y)

z (x, y) ≤ E (x, y) +

a1 (s, t) g1 (b (s, t)) g1 (z (s, t)) dtds

φ1 (x0 ) ψ1 (y0 ) φZ2 (x) ψZ2 (y)

+

a2 (s, t) g2 (b (s, t)) g2 (u (s, t)) dtds.

(3.4.30)

φ2 (x0 ) ψ2 (y0 )

The rest of the proof can be completed by closely looking at the proof of Theorem 3.2.3 given in section 3.2 and following the proofs of similar results given in [43] and [34] with suitable changes. Here we omit the further details. Remark 3.4.2. We note that the inequalities given in Theorem 3.4.2, parts (b2 ) and (b3 ) can be extended very easily in the framework of Theorem 3.4.3, when b(x, y) = 1 and f (x, y) is equal to the respective constants given therein. Since these translations are quite straightforward in view of Theorem 3.4.3, we leave it for the readers to fill in where needed.

162


The following theorem involving Lipschitzian type kernel functions, deals with the inequalities proved in [77]. Theorem 3.4.4. Let u (x, y) , a (x, y) , b (x, y) ∈ C (∆, R+ ) and α (x) ∈ C 1 (I1 , I1 ) , β (y) ∈ C 1 (I2 , I2 ) be nondecreasing with α (x) ≤ x,for x ∈ I1 β (y) ≤ y for y ∈ I2 . (c1 ) Let L ∈ C (∆ × R+ , R+ ) and 0 ≤ L (x, y, u) − L (x, y, v) ≤ M (x, y, v) (u − v) ,

(3.4.31)

for (x, y) ∈ ∆ and u ≥ v ≥ 0, where M ∈ C (∆ × R+ , R+ ) . If α(x) β(y) Z Z

u (x, y) ≤ a (x, y) + b (x, y)

L (s, t, u (s, t)) dtds,

(3.4.32)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, then u (x, y) ≤ a (x, y) + b (x, y) e (x, y)   α(x) β(y) Z Z   × exp  M (σ, τ, a (σ, τ )) b (σ, τ ) dτ dσ  ,

(3.4.33)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, where α(x) β(y) Z Z

e (x, y) =

L (s, t, a (σ, τ )) dτ dσ,

(3.4.34)

α(x0 ) β(y0 )

for (x, y) ∈ ∆. (c2 ) Let L ∈ C (∆ × R+ , R+ ) and ψ ∈ C (R+ , R+ ) be strictly increasing function with ψ (0) = 0 and 0 ≤ L (x, y, u) − L (x, y, v) ≤ M (x, y, v) ψ −1 (u − v) ,

(3.4.35) −1

for (x, y) ∈ ∆ and u ≥ v ≥ 0, where M ∈ C (∆ × R+ , R+ ) and ψ is the inverse of ψ. If   α(x) β(y) Z Z   L (s, t, u (s, t)) dtds , (3.4.36) u (x, y) ≤ a (x, y) + ψ b (x, y) α(x0 ) β(y0 )

for (x, y) ∈ ∆,, then u (x, y) ≤ a (x, y) + ψ (b (x, y) e (x, y)   α(x) β(y) Z Z   × exp  M (σ, τ, a (σ, τ )) b (σ, τ ) dτ dσ  , α(x0 ) β(y0 )

for (x, y) ∈ ∆, where e(x, y) is given by (3.4.34).

(3.4.37)

Chapter 3

163

(c3 ) Let L, ψ and M be as in (c2 ) and the condition (3.4.35) holds. Suppose in addition ψ −1 (xy) ≤ ψ −1 (x) ψ −1 (y) for x, y ∈ R+ . If   α(x) β(y) Z Z   L (s, t, u (s, t)) dtds , (3.4.38) u (x, y) ≤ a (x, y) + b (x, y) ψ  α(x0 ) β(y0 )

for (x, y) ∈ ∆, then u (x, y) ≤ a (x, y) + b (x, y) ψ (e (x, y)   α(x) β(y) Z Z   M (σ, τ, a (σ, τ )) ψ −1 (b (σ, τ )) dτ dσ  , × exp 

(3.4.39)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, where e(x, y) is given by (3.4.34). (c4 ) Let L, M be as in (c1 ) and the condition (3.4.31) holds. Let g, G, G−1 be as in Theorem 3.2.5, part (d1 ). If for (x, y) ∈ ∆,   α(x) β(y) Z Z   L (s, t, u (s, t)) dtds , (3.4.40) u (x, y) ≤ a (x, y) + b (x, y) g  α(x0 ) β(y0 )

then for x0 ≤ x ≤ x1 , y0 ≤ y ≤ y1 ; x, x1 ∈ I1 , y, y1 ∈ I2 , u (x, y) ≤ a (x, y) + b (x, y) g G−1 [G (e (x, y)) 

α(x) β(y) Z Z

 M (σ, τ, a (σ, τ )) b (σ, τ ) dτ dσ  ,

+

(3.4.41)

α(x0 ) β(y0 )

where e(x, y) is given by (3.4.34) and x1 ∈ I1 , y1 ∈ I2 are chosen so that α(x) β(y) Z Z

G (e (x, y)) +

M (σ, τ, a (σ, τ )) b (σ, τ ) dτ dσ ∈ Dom G−1 ,

α(x0 ) β(y0 )

for all x and y lying in [x0 , x1 ] and [y0 , y1 ] respectively. Proof. (c1 ) Define a function z(x, y) by α(x) β(y) Z Z

L (s, t, u (s, t)) dtds.

z (x, y) = α(x0 ) β(y0 )

(3.4.42)

164


Then (3.4.32) can be restated as u (x, y) ≤ a (x, y) + b (x, y) z (x, y) ,

(3.4.43)

for (x, y) ∈ ∆. From (3.4.42) it is easy to see that D2 D1 z (x, y) = L (α (x) , β (y) , u (α (x) , β (y))) α0 (x) β 0 (y) .

(3.4.44)

From (3.4.44), (3.4.31) and following the idea of the proof of Theorem 3.3.3 part (c1 ) it follows that D2 D1 z (x, y) ≤ L (α (x) , β (y) , a (α (x) , β (y))) α0 (x) β 0 (y) +M (α (x) , β (y) , a (α (x) , β (y))) b (α (x) , β (y)) z (α (x) , β (y)) α0 (x) β 0 (y) , which implies Zx Zy z (x, y) ≤

L (α (s) , β (t) , a (α (s) , β (t))) α0 (s) β 0 (t) dtds

x0 y0

Zx Zy +

M (α (s) , β (t) , a (α (s) , β (t))) x0 y0

×b (α (s) , β (t)) z (s, t) α0 (s) β 0 (t) dtds.

(3.4.45)

Clearly the first integral on the right hand side in (3.4.45) is nonnegative and nondecreasing in both the variables x and y. Now a suitable application of Theorem 4.2.2 given in [34, p. 325] yields  x y  Z Z z (x, y) ≤  L (α (s) , β (t) , a (α (s) , β (t))) α0 (s) β 0 (t) dtds x0 y0

 x y Z Z M (α (s) , β (t) , a (α (s) , β (t))) × exp  x0 y0

×b (α (s) , β (t)) b (α (s) , β (t)) α0 (s) β 0 (t) dtds) .

(3.4.46)

Now by making the change of variables on the right hand side of (3.4.46) and substituting the resulting estimate on z(x, y) in (3.4.43) we get (3.4.33). The proofs of (c2 ) − (c4 ) can be completed by following the proof of (c1 ) given above and closely looking at the proof of Theorem 1.4.4, parts (d2 ) − (d4 ). Here we leave the details to the reader. Remark 3.4.3. We note that from Theorem 3.4.4, one can very easily obtain the corollaries similar to those of given in [12] (see [34]) with suitable changes.

Chapter 3

165

The following theorem offer another useful inequality established in [58]. Theorem 3.4.5. Let I1 = [x0 , M ] I2 = [y0 , N ] , ∆ = I1 × I2 and D = (x, y, s, t) ∈ ∆2 : x0 ≤ s ≤ x ≤ M, y0 ≤ t ≤ y ≤ N . Let u (x, y) ∈ C (∆, R+ ) and a (x, y, s, t) , b (x, y, s, t) ∈ C (D, R+ ) be nondecreasing in x and y for (s, t) ∈ ∆. Let α (x) ∈ C 1 (I1 , I1 ) , β (y) ∈ C 1 (I2 , I2 ) be nondecreasing with α (x) ≤ x on I1 , β (y) ≤ y on I2 and suppose that α(x) β(y) Z Z

u (x, y) ≤ c +

a (x, y, s, t) u (s, t) dtds

α(x0 ) β(y0 ) α(M Z ) β(N Z )

+

b (x, y, s, t) u (s, t) dtds,

(3.4.47)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, where c ≥ 0 is a real constant.If α(M Z ) β(N Z )

p (x, y) =

b (x, y, s, t) α(x0 ) β(y0 )





α(x) β(y) Z Z

 × exp 

 a (x, y, σ, τ ) dτ dσ  dtds < 1,

(3.4.48)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, then  u (x, y) ≤

c  exp  1 − p (x, y)



α(x) β(y) Z Z

 a (x, y, s, t) dtds ,

(3.4.49)

α(x0 ) β(y0 )

for (x, y) ∈ ∆. Proof. Fix any arbitrary element (X, Y ) ∈ ∆. Then for x0 ≤ x ≤ X, y0 ≤ y ≤ Y we have α(x) β(y) Z Z

u (x, y) ≤ c +

a (X, Y, s, t) u (s, t) dtds

α(x0 ) β(y0 ) α(M Z ) β(N Z )

+ α(x0 ) β(y0 )

b (X, Y, s, t) u (s, t) dtds.

(3.4.50)

166


Let α(M Z ) β(N Z )

b (X, Y, s, t) u (s, t) dtds,

k(X, Y ) = c +

(3.4.51)

α(x0 ) β(y0 )

then (3.4.50) can be restated as α(x) β(y) Z Z

u (x, y) ≤ k(X, Y ) +

a (X, Y, s, t) u (s, t) dtds

(3.4.52)

α(x0 ) β(y0 )

for x0 ≤ x ≤ X, y0 ≤ y ≤ Y . Now a suitable application of the inequality given in Theorem 3.4.1, part (a1 ) to (3.4.52) yields   α(x) β(y) Z Z   a (X, Y, σ, τ ) dσdτ  , (3.4.53) u (x, y) ≤ k(X, Y ) exp  α(x0 ) β(y0 )

for x0 ≤ x ≤ X, y0 ≤ y ≤ Y . Since (X, Y ) ∈ ∆ is arbitrary, from (3.4.53) and (3.4.51) with X and Y replaced by x and y we have   α(x) β(y) Z Z   a (x, y, σ, τ ) dσdτ  , (3.4.54) u (x, y) ≤ k(x, y) exp  α(x0 ) β(y0 )

where α(M Z ) β(N Z )

k(x, y) = c +

b (x, y, s, t) u (s, t) dtds,

(3.4.55)

α(x0 ) β(y0 )

for all (x, y) ∈ ∆. Using (3.4.54) on the right hand side of (3.4.55) and in view of (3.4.48) we have k(x, y) ≤

c , 1 − p (x, y)

(3.4.56)

for (x, y) ∈ ∆. Using (3.4.56) in (3.4.54) we get the desired inequality in (3.4.49). Remark 3.4.4. If we take in Theorem 3.4.5, (i) b(x, y, s, t) = 0, (ii) α (x) = x, β (y) = y, then we get new inequalities which can also be used as tools in certain applications.

Chapter 3

167

3.5 More retarded integral inequalities in two variables In [47,59,60,74] Pachpatte has investigated a number of integral inequalities in two independent variables, which play a vital role in the study of various classes of retarded partial differential and integral equations. This section is devoted to some retarded integral inequalities established in the above cited references, which can be used as basic tools in variety of applications. In what follows, we shall use the notations and definitions as given in section 3.4. First we give the following theorem which deals with the integral inequality proved in [74]. Theorem 3.5.1. Let u (x, y) , a (x, y) , b (x, y) ∈ C (∆, R+ ) and α (x) ∈ C 1 (I1 , I1 ) , β (y) ∈ C 1 (I2 , I2 ) be nondecreasing with α (x) ≤ x on I1 , β (y) ≤ y on I2 . If α(x) β(y) Z Z

u (x, y) ≤ k +

a (s, t) [u (s, t)

α(x0 ) β(y0 )

Zs



Zt

 b (σ, η) u (σ, η)dηdσ  dtds,

+

(3.5.1)

α(x0 ) β(y0 )

for (x, y) ∈ ∆,where k ≥ 0 is a real constant, then 

α(x) β(y) Z Z

 u (x, y) ≤ k 1 +

a (m, n)

α(x0 ) β(y0 )



Zm

Zn

 × exp  α(x0 ) β(y0 )

for (x, y) ∈ ∆.





  [a (σ, η) + b (σ, η)]dηdσ  dndm ,

(3.5.2)

168


Proof. From the hypotheses we observe that α0 (x) ≥ 0 for x ∈ I1 , β 0 (y) ≥ 0 for y ∈ I2 . Let k > 0 and define a function z(x, y) by the right hand side of (3.5.1). Then z (x0 , y) = z (x, y0 ) = k, u (x, y) ≤ z (x, y) , z(x, y) is positive and nondecreasing for (x, y) ∈ ∆ and D2 D1 z (x, y) = a (α (x) , β (y)) [u (α (x) , β (y)) α(x) β(y) Z Z

+

  b (σ, η)u (σ, η) dηdσ  β 0 (y) α0 (x)

α(x0 ) β(y0 )



α(x) β(y) Z Z

 ≤ a (α (x) , β (y)) z (α (x) , β (y)) +

  b (σ, η) z (σ, η) dηdσ  β 0 (y) α0 (x)

α(x0 ) β(y0 )



α(x) β(y) Z Z

 ≤ a (α (x) , β (y)) z (x, y) +

  b (σ, η) z (σ, η) dηdσ  β 0 (y) α0 (x) .

α(x0 ) β(y0 )

Let α(x) β(y) Z Z

v (x, y) = z (x, y) +

b (σ, η) z (σ, η) dηdσ.

(3.5.3)

α(x0 ) β(y0 )

Then v (x0 , y) = z (x0 , y) = k, v (x, y0 ) = z (x, y0 ) = k, z (x, y) ≤ v (x, y), v(x, y) is positive and nondecreasing for (x, y) ∈ ∆, D2 D1 z (x, y) ≤ a (α (x) , β (y)) v (x, y) β 0 (y) α0 (x) ,

(3.5.4)

and D2 D1 v (x, y) = D2 D1 z (x, y) + b (α (x) , β (y)) z (α (x) , β (y)) β 0 (y) α0 (x) ≤ a (α (x) , β (y)) v (x, y) β 0 (y) α0 (x)+b (α (x) , β (y)) v (α (x) , β (y)) β 0 (y) α0 (x) ≤ [a (α (x) , β (y)) + b (α (x) , β (y))] v (x, y) β 0 (y) α0 (x) .

(3.5.5)

Now by following the proof of Theorem 4.2.1 given in [34] with suitable changes, from (3.5.5) we obtain  x y Z Z [a (α (s) , β (t)) + b (α (s) , β (t))] v (x, y) ≤ k exp  x0 y0

×β 0 (t) α0 (s) dtds) .

(3.5.6)

Chapter 3

169

Making the change of variables on the right hand side of (3.5.6) yields 



α(x) β(y) Z Z

 v (x, y) ≤ k exp 

 [a (σ, η) + b (σ, η)] dηdσ  .

(3.5.7)

α(x0 ) β(y0 )

Using (3.5.7) in (3.5.4) we have D2 D1 z (x, y) ≤ ka (α (x) , β (y)) 

α(x) β(y) Z Z

 × exp 

  [a (σ, η) + b (σ, η)]dηdσ  β 0 (y) α0 (x)) .

(3.5.8)

α(x0 ) β(y0 )

Keeping x fixed in (3.5.8), set y = t and integrate with respect to t from y0 to y for y ∈ I2 , then keeping y fixed in the resulting inequality, set x = s and integrate with respect to s from x0 to x for x ∈ I1 to obtain the estimate 

Zx

Zy

 z (x, y) ≤ k 1 +

a (α (s) , β (t))

α(x0 ) β(y0 )





α(x) β(y) Z Z

 × exp 

 [a (σ, η) + b (σ, η)]dηdσ 

α(x0 ) β(y0 )

× β 0 (t) α0 (s)) dtds] .

(3.5.9)

By making the change of variables on the right hand side of (3.5.9) and using the fact that u (x, y) ≤ z (x, y) we obtain the desired inequality in (3.5.2). The case k ≥ 0 follows as mentioned in the proof of Theorem 3.2.1, part (a1 ) . Remark 3.5.1. In the special case when α (x) = x, β (y) = y the inequality given in Theorem 3.5.1 reduces to the inequality given in [34, p. 336]. Next we shall give the following theorem which contains the inequalities established in [47]. Theorem 3.5.2. Let u (x, y) , a (x, y) ∈ C (∆, R+ ) and b (x, y, s, t) ∈ C ∆2 , R+ for x0 ≤ s ≤ x < X, y0 ≤ t ≤ y < Y. Let α (x) ∈ C 1 (I1 , I1 ), β (y) ∈ C 1 (I2 , I2 ) be nondecreasing with α (x) ≤ x on I1 , β (y) ≤ y on I2 and k ≥ 0 be a real constant.

170


(a1 ) If α(x) β(y) Z Z

u (x, y) ≤ k +

[a (s, t) u (s, t)

α(x0 ) β(y0 )

Zs



Zt

 b (s, t, σ, η) u (σ, η)dηdσ  dtds,

+

(3.5.10)

α(x0 ) β(y0 )

for (x, y) ∈ ∆, then u (x, y) ≤ k exp (A (x, y)) ,

(3.5.11)

for (x, y) ∈ ∆, where α(x) β(y) Z Z

A (x, y) =



Zs

 b (s, t, σ, η) dηdσ  dtds,

 a (s, t) + α(x0 ) β(y0 )



Zt

(3.5.12)

α(x0 ) β(y0 )

for (x, y) ∈ ∆. (a2 ) Let g(u) be as in Theorem 3.3.2, part(b1 ). If for (x, y) ∈ ∆, α(x) β(y) Z Z

u (x, y) ≤ k +

[a (s, t) g (u (s, t))

α(x0 ) β(y0 )

Zs



Zt

+

 b (s, t, σ, η) g (u (σ, η))dηdσ  dtds,

(3.5.13)

α(x0 ) β(y0 )

then for x0 ≤ x ≤ x1 , y0 ≤ y ≤ y1 ; x, x1 ∈ I1 , y, y1 ∈ I2 , u (x, y) ≤ G−1 [G (k) + A (x, y)] ,

(3.5.14)

where A(x, y) is given by (3.5.12), G, G−1 are as given in Theorem 3.3.2, part (b1 ) and x1 ∈ I1 , y1 ∈ I2 are chosen so that G (k) + A (x, y) ∈ Dom G−1 , for all x and y lying in [x0 , x1 ] and [y0 , y1 ] respectively.

(3.5.15)

Chapter 3

171

Proof. (a1 ) From the hypotheses we observe that α0 (x) ≥ 0 for x ∈ I1 , β 0 (y) ≥ 0 for y ∈ I2 . Let k > 0 and define a function z(x, y) by the right hand side of (3.5.10). Then z (x0 , y) = z (x, y0 ) = k, u (x, y) ≤ z (x, y) , z(x, y) is positive and nondecreasing for (x, y) ∈ ∆ and  β(y) Z  D1 z (x, y) =  [a (α (x) , t) u (α (x) , t) β(y0 ) α(x) Z

Zt

+





  b (α (x) , t, σ, η) u (σ, η)dηdσ  dt α0 (x)

α(x0 ) β(y0 )



β(y) Z

 ≤

[a (α (x) , t) z (α (x) , t)

β(y0 ) α(x) Z

Zt

+





  b (α (x) , t, σ, η) z (σ, η)dηdσ  dt α0 (x) .

(3.5.16)

α(x0 ) β(y0 )

From (3.5.16) it is easy to observe that  β(y) Z D1 z (x, y)  ≤ [a (α (x) , t) z (x, y) β(y0 ) α(x) Z

Zt

+





  b (α (x) , t, σ, η)dηdσ  dt α0 (x) .

(3.5.17)

α(x0 ) β(y0 )

Keeping y fixed in (3.5.17), setting x = ξ and integrating it with respect to ξ from x0 to x for x ∈ I1 and making the change of variables we get z (x, y) ≤ k exp (A (x, y)) .

(3.5.18)

Using (3.5.18) in u (x, y) ≤ z (x, y) we get the required inequality in (3.5.11). The case k ≥ 0 follows as mentioned in the proof of Theorem 3.4.1, part (a1 ). (a2 ) The proof can be completed by following the proof of (a1 ) given above and closely looking at the proof of Theorem 3.4.2. Here we omit the details. In the following theorems we present the inequalities investigated in [59]. Theorem 3.5.3. Let u (x, y) , a (x, y) , bi (x, y) ∈ C (∆, R+ ) and αi (x) ∈ C 1 (I1 , I1 ) , βi (y) ∈ C 1 (I2 , I2 ) be nondecreasing with αi (x) ≤ x on I1 , βi (y) ≤ y on I2 for i = 1, ..., n and k ≥ 0 be a real constant.

172


(b1 ) If Zx u (x, y) ≤ k+

αZi (x) βZ i (y0 ) n X a (s, y) u (s, y) ds + bi (s, t) u (s, t) dtds, (3.5.19) i=1

x0

αi (x0 ) βi (y0 )

for (x, y) ∈ ∆, then   αZi (x) βZ i (y0 ) n  X bi (s, t) q (s, t) dtds , u (x, y) ≤ kq (x, y) exp  i=1

(3.5.20)

αi (x0 ) βi (y0 )

for (x, y) ∈ ∆, where  x  Z q (x, y) = exp  a (ξ, y) dξ  ,

(3.5.21)

x0

for (x, y) ∈ ∆. (b2 ) Let g ∈ C (R+ , R+ ) be nondecreasing and submultiplicative function with g(u) > 0 for u > 0. If for (x, y) ∈ ∆, Zx u (x, y) ≤ k +

a (s, y) u (s, y) ds x0

+

αZi (x) βZi (y) n X i=1

bi (s, t) g (u (s, t)) dtds,

(3.5.22)

αi (x0 ) βi (y0 )

then for x0 ≤ x ≤ x2 , y0 ≤ y ≤ y2 ; x, x2 ∈ I1 , y, y2 ∈ I2 , u (x, y) ≤ q (x, y) G−1 [G (k) +


  bi (s, t) g (q (s, t)) dtds ,

(3.5.23)

αi (x0 ) βi (y0 )

where q(x, y) is given by (3.5.21) and G−1 is the inverse function of Zr G (r) =

ds , r > 0, g (s)

(3.5.24)

r0

r0 > 0 is arbitrary and x2 ∈ I1 , y2 ∈ I2 are chosen so that G (k) +


bi (s, t) g (q (s, t)) dtds ∈ Dom G−1 ,

αi (x0 ) βi (y0 )

for all x and y lying in [x0 , x2 ] and [y0 , y2 ] respectively.

Chapter 3

173

Proof. From the hypotheses we observe that α0 (x) ≥ 0 for x ∈ I1 , β 0 (y) ≥ 0 for y ∈ I2 . (b1 ) Let k > 0 and define a function z(x, y) by z (x, y) = k +


bi (s, t) u (s, t) dtds.

(3.5.25)

αi (x0 ) βi (y0 )


a (s, y) u (s, y) ds.

(3.5.26)

x0

It is easy to observe that z(x, y) is positive, continuous and nondecreasing function for (x, y) ∈ ∆. Treating y fixed in (3.5.26) and using Theorem 1.3.1 given in [34] to (3.5.26) we get u (x, y) ≤ q (x, y) z (x, y) ,

(3.5.27)

for (x, y) ∈ ∆, where q(x, y) is given by (3.5.21). From (3.5.25)and (3.5.27) we have z (x, y) ≤ k +


bi (s, t) q (s, t) z (s, t) dtds.

(3.5.28)

αi (x0 ) βi (y0 )

Define a function v(x, y) by the right hand side of (3.5.28). Then v (x0 , y) = z (x0 , y) = k, z (x, y) ≤ v (x, y) , v(x, y) is positive and nondecreasing for (x, y) ∈ ∆ and   βZi (y) n X  D1 v (x, y) = bi (αi (x) , t) q (αi (x) , t)z (αi (x) , t) dt αi0 (x)  i=1

βi (y0 )

 βZi (y) n X   ≤ bi (αi (x) , t) q (αi (x) , t)v (αi (x) , t) dt αi0 (x)  

i=1

βi (y0 )

  βZi (y) n X   bi (αi (x) , t) q (αi (x) , t)dt αi0 (x) ≤ v (x, y)  i=1

βi (y0 )

i.e.,   βZi (y) n X D1 v (x, y)   ≤ bi (αi (x) , t) q (αi (x) , t)dt αi0 (x).  v (x, y) i=1 βi (y0 )

(3.5.29)

174


Keeping y fixed in (2.5.29), setting x = σ and integrating it with respect to σ from x0 to x for x ∈ I1 , making the change of variables and using the fact that z (x, y) ≤ v (x, y) we get   αZi (x) β(y) Z n X   bi (s, t) q (s, t) dtds , (3.5.30) z (x, y) ≤ k exp  i=1

αi (x0 ) βi (y0 )

for (x, y) ∈ ∆. Using (3.5.30) in (3.5.27) we get the required inequality in (3.5.20). The case k ≥ 0 follows as noted in the proof of Theorem 3.2.1, part (a1 ). (b2 ) Let k > 0 and define a function z(x, y) by

z (x, y) = k +

αZi (x) β(y) Z n X i=1

bi (s, t) g (u (s, t)) dtds.

(3.5.31)

αi (x0 ) βi (y0 )


a (s, y) u (s, y) ds.

(3.5.32)

x0

As in the proof of part (b1 ), using Theorem 1.3.1 given in [34] to (3.5.32) we have u (x, y) ≤ q (x, y) z (x, y) ,

(3.5.33)

for (x, y) ∈ ∆ , where q(x, y) and z(x, y) are given by (3.5.21) and (3.5.31). From (3.5.31), (3.5.33) and the hypotheses on g we have

z (x, y) ≤ k +


≤k+


bi (s, t) g (q (s, t) z (s, t)) dtds

αi (x0 ) βi (y0 )

bi (s, t) g (q (s, t)) g (z (s, t)) dtds.

(3.5.34)

αi (x0 ) βi (y0 )

Define a function v(x, y) by the right hand side of (3.5.34). Then v (x0 , y) = v (x, y0 ) = k, z (x, y) ≤ v (x, y) , v(x, y) is positive and nondecreasing for (x, y) ∈ ∆ and   βZi (y) n X   bi (αi (x) , t) g (q (αi (x) , t)) g (z (αi (x) , t)) dt αi0 (x) D1 v (x, y) =  i=1

βi (y0 )

Chapter 3

≤

n X i=1



βZi (y)

 

175 

 bi (αi (x) , t) g (q (αi (x) , t)) g (v (αi (x) , t)) dt αi0 (x)

βi (y0 )

≤ g (v (x, y))

n X i=1



βZi (y)

 

  bi (αi (x) , t) g (q (αi (x) , t)) dt αi0 (x).

(3.5.35)

βi (y0 )

From (3.5.24) and (3.5.35) we have D1 G (v (x, y)) =

≤

n X i=1



βZi (y)

 

D1 v (x, y) g (v (x, y)) 

 bi (αi (x) , t) g (q (αi (x) , t)) dt αi0 (x).

(3.5.36)

βi (y0 )

Keeping y fixed in (3.5.36), setting x = σ and integrating it with respect to σ from x0 to x for x ∈ I1 and making the change of variables we get

G (v (x, y)) ≤ G (k) +


bi (s, t) g (q (s, t)) dtds.

(3.5.37)

αi (x0 ) βi (y0 )

From (3.5.37) and (3.5.33) we get the required inequality in (3.5.23). The case k ≥ 0 follows as mentioned in the proof of Theorem 3.2.1,part (a1 ). The subdomain for x, y is obvious. Theorem 3.5.4. Let u (x, y) , a (x, y) , bi (x, y) , αi (x) , βi (y) , k be as in Theorem 3.5.3 and c (x, y) ∈ C (∆, R+ ) . (c1 ) If Zx u (x, y) ≤ k +

 a (s, y) u (s, y) +

x0

+




Zs

c (σ, y) u (σ, y) dσ ds x0

bi (s, t) u (s, t) dtds,

(3.5.38)

αi (x0 ) βi (y0 )

for (x, y) ∈ ∆,then  αZi (x) βZi (y) n X   bi (s, t) p (s, t) dtds , u (x, y) ≤ kp (x, y) exp  

i=1

αi (x0 ) βi (y0 )

(3.5.39)

176


for (x, y) ∈ ∆, where 

Zx

Zξ

a (ξ, y) exp 

p (x, y) = 1 + x0

 [a (σ, y) + b (σ, y)]dσ  dξ,

(3.5.40)

x0

for (x, y) ∈ ∆. (c2 ) Let g be as in Theorem 3.5.3, part (b2 ). If for (x, y) ∈ ∆,   Zx Zs u (x, y) ≤ k + a (s, y) u (s, y) + c (σ, y) u (σ, y) dσ ds x0

+


x0

bi (s, t) g (u (s, t)) dtds,

(3.5.41)

αi (x0 ) βi (y0 )

then for x0 ≤ x ≤ x3 , y0 ≤ y ≤ y3 ; x, x3 ∈ I1 , y, y3 ∈ I2 , u (x, y) ≤ p (x, y) G−1 [G (k)

+

n X i=1



αZi (x) βZi (y)

 bi (s, t) g (p (s, t)) dtds ,

(3.5.42)

αi (x0 ) βi (y0 )

where p(x, y) is given by (3.5.40), G, G−1 are given as in Theorem 3.5.3, part (b2 ) and x3 ∈ I1 , y3 ∈ I2 are chosen so that G (k) +


bi (s, t) g (p (s, t)) dtds ∈ Dom G−1 ,

αi (x0 ) βi (y0 )

for all x and y lying in [x0 , x3 ] and [y0 , y3 ] respectively. Proof. From the hypotheses we have αi0 (x) ≥ 0 for x ∈ I1 , βi0 (x) ≥ 0 for y ∈ I2 . (c1 ) Let k > 0 and define a function z(x, y) by (3.5.25). Then (3.5.38) can be restated as   Zx Zs u (x, y) ≤ z (x, y) + a (s, y) u (s, y) + c (σ, y) u (σ, y) dσ ds. (3.5.43) x0

x0

Clearly, z(x, y) is positive, continuous and nondecreasing function for (x, y) ∈ ∆. Treating y for y ∈ I2 fixed in (3.5.43) and applying Theorem 1.7.4 given in [34] to (3.5.43) yields u (x, y) ≤ p (x, y) z (x, y) ,

(3.5.44)

Chapter 3

177

where p(x, y) and z(x, y) are given by (3.5.40) and (3.5.25). Now by following the proof of Theorem 3.5.3, part (b1 ) with suitable changes we get the desired inequality in (3.5.39). (c2 ) The proof can be completed by following the proof of part (c1 ) given above and the proof of Theorem 3.5.3, part (b2 ). Here we omit the details. Remark 3.5.2. If we take a(x, y) = 0 in Theorems 3.5.3 and 3.5.4, then we recapture the inequalities established in Theorem 3, part (C1 ) and Theorem 4, part (D1 ) in a recent paper [74]. We also note that, if we take in (3.5.19) a(x, y) = 0 and replace the constant k by a function r (x, y) ∈ C (∆, R+ ), which is nondecreasing for (x, y) ∈ ∆, then the bound obtained in (3.5.20) takes the form   αZi (x) βZi (y) n  X bi (s, t) dtds , u (x, y) ≤ r (x, y) exp  i=1

αi (x0 ) βi (y0 )

for (x, y) ∈ ∆, which is the inequality given in Theorem 3, part (C2 ) in [74]. These inequalities can be used as basic tools in some applications. Finally we give the following theorem which deals with the inequalities proved in [60]. Theorem 3.5.5. Let u (x, y) , ai (x, y) , bi (x, y) ∈ C (∆, R+ ) and αi (x) ∈ C 1 (I1 , I1 ) , βi (y) ∈ C 1 (I2 , I2 ) be nondecreasing with αi (x) ≤ x on I1 , βi (y) ≤ y on I2 for i = 1, ..., n. Let p > 1 and c ≥ 0 be real constants. (d1 ) If p

u (x, y) ≤ c+p


[ai (s, t) up (s, t) + bi (s, t) u (s, t)] dtds, (3.5.45)

αi (x0 ) βi (y0 )

for (x, y) ∈ ∆, then 1   p−1  αZi (x) βZi (y)   n   X   ai (σ, τ ) dτ dσ  , (3.5.46) u (x, y) ≤ B (x, y) exp (p − 1)     i=1 αi (x0 ) βi (y0 )

for (x, y) ∈ ∆, where B (x, y) = {c}

p−1 p

+ (p − 1)


for (x, y) ∈ ∆.

αi (x0 ) βi (y0 )

bi (σ, τ ) dτ dσ,

(3.5.47)

178


(d2 ) Let w(u) be as in Theorem 3.2.6, part (q2 ).If for (x, y) ∈ ∆, p

u (x, y) ≤ c + p


[ai (s, t) u (s, t) w (u (s, t))

αi (x0 ) βi (y0 )

+bi (s, t) u (s, t)] dtds,

(3.5.48)

then for x0 ≤ x ≤ x4 , y0 ≤ y ≤ y4 ; x, x4 ∈ I1 , y, y4 ∈ I2 , u (x, y) ≤ F −1 [F (B (x, y)) + (p − 1)

×


αi (x0 ) βi (y0 )

1  p−1    ai (σ, τ )dτ dσ  ,  

(3.5.49)

where B(x, y) is given by (3.5.47), F , F −1 are as in Theorem 3.2.6, part (q2 ) and x4 ∈ I1 , y4 ∈ I2 are chosen so that

F (B (x, y)) + (p − 1)


ai (σ, τ ) dτ dσ ∈ Dom F −1 ,

αi (x0 ) βi (y0 )

for all x and y lying in [x0 , x4 ] and [y0 , y4 ] respectively. Proof. From the hypotheses we have αi0 (x) ≥ 0 for x ∈ I1 , βi0 (y) ≥ 0 for y ∈ I2 . We give the details of the proof of (d2 ) only; the proof of (d1 ) can be completed by following the proof of (d2 ) with suitable modifications. (d2 ) Let c > 0 and define a function z(x, y) by the right hand side of (3.5.48).Then z (x0 , y) = z (x, y0 ) = c, z(x, y) is positive and nondecreasing for (x, y) ∈ ∆, 1 u (x, y) ≤ {z (x, y)} p and D2 D1 z (x, y) = p

n X

[ai (αi (x) , βi (y)) u (αi (x) , βi (y)) w (u (αi (x) , βi (y)))

i=1

+bi (αi (x) , βi (y)) u (αi (x) , βi (y))] βi0 (y) αi0 (x) ≤p

n h X 1 1 ai (αi (x) , βi (y)) {z (αi (x) , βi (y))} p w {z (αi (x) , βi (y))} p i=1

i 1 +bi (αi (x) , βi (y)) {z (αi (x) , βi (y))} p βi0 (y) αi0 (x) ≤p

n h X 1 ai (αi (x) , βi (y)) w {z (αi (x) , βi (y))} p i=1

Chapter 3

179 1

+bi (αi (x) , βi (y))] {z (x, y)} p βi0 (y) αi0 (x) .

(3.5.50)

From (3.5.50) and the facts that D1 z (x, y) , D2 z (x, y) are nonnegative, we observe that (see [34]) D2 D1 z (x, y) {z (x, y)}

1 p

≤p

n h X

1 ai (αi (x) , βi (y)) w {z (αi (x) , βi (y))} p

i=1

i h 1 D1 z (x, y) D2 {z (x, y)} p +bi (αi (x) , βi (y))] βi0 (y) αi0 (x) + , h i 1 2 {z (x, y)} p i.e., D2

!

D1 z (x, y) {z (x, y)}

≤p

1 p

n h X

1 ai (αi (x) , βi (y)) w {z (αi (x) , βi (y))} p

i=1

+bi (αi (x) , βi (y))] βi0 (y) αi0 (x) ,

(3.5.51)

for (x, y) ∈ ∆. By keeping x fixed in (3.5.51), we set y = t and then, by integrating with respect to t from y0 to y and using the fact that D1 z (x, y0 ) = 0, we have D1 z (x, y) 1

≤p

{z (x, y)} p

Zy X n h

1 ai (αi (x) , βi (t)) w {z (αi (x) , βi (t))} p

y0 i=1

+bi (αi (x) , βi (t))] βi0 (t) αi0 (x) dt.

(3.5.52)

Now keeping y fixed in (3.5.52) and setting x = s and integrating with respect to s from x0 to x we have {z (x, y)}

p−1 p

≤ {c}

p−1 p

+ (p − 1)

Zx Zy X n

[ai (αi (s) , βi (t))

x0 y0 i=1

i 1 ×w {z (αi (s) , βi (t))} p + bi (αi (s) , βi (t)) ×βi0 (t) αi0 (s) dtds.

(3.5.53)

By making the change of variables on the right hand side of (3.5.53) and rewriting we have {z (x, y)}

×

p−1 p

≤ B (x, y) + (p − 1)


αi (x0 ) βi (y0 )

1 ai (σ, τ ) w {z (σ, τ )} p dτ dσ.

(3.5.54)

180


Now fix (λ, µ) ∈ ∆ such that x0 ≤ x ≤ λ ≤ x4 , y0 ≤ y ≤ µ ≤ y4 . Then from (3.5.54) we observe that {z (x, y)}

×

p−1 p

≤ B (λ, µ) + (p − 1)


1 ai (σ, τ ) w {z (σ, τ )} p dτ dσ,

(3.5.55)

αi (x0 ) βi (y0 )

for x0 ≤ x ≤ λ, y0 ≤ y ≤ µ. Define a function v(x, y) by the right hand side of (3.5.55). Then v (x0 , y) = v (x, y0 ) = B (λ, µ) , v(x, y) is positive and nondecreasing for x0 ≤ x ≤ λ, y0 ≤ y ≤ µ, {z (x, y)} v (x, y) ≤ B (λ, µ) + (p − 1)


p−1 p

≤ v (x, y) and

1 ai (σ, τ ) w {v (σ, τ )} p−1 dτ dσ,

αi (x0 ) βi (y0 )

for x0 ≤ x ≤ λ, y0 ≤ y ≤ µ. Now by following the proof of Theorem 3.5.3, part (b2 ) (see also [34]) we get   αZi (x) βZi (y) n X   v (x, y) ≤ F −1 F (B (λ, µ)) + (p − 1) ai (σ, τ )dτ dσ  , (3.5.56) i=1

αi (x0 ) βi (y0 )

for x0 ≤ x ≤ λ ≤ x4 , y0 ≤ y ≤ µ ≤ y4 . Since (λ, µ) ∈ ∆ is arbitrary, we get the desired inequality in (3.5.49) from (3.5.56) and the fact that o p1 n p 1 1 u (x, y) ≤ {z (x, y)} p ≤ [v (x, y)] p−1 = {v (x, y)} p−1 . The proof of the case when c ≥ 0 can be completed as mentioned in the proof of Theorem 3.2.1, part (a1 ). The subdomain x0 ≤ x ≤ x4 , y0 ≤ y ≤ y4 is obvious. Remark 3.5.3. If we take p = 2, n = 1 α1 = α, β1 = β, a1 = f, b1 = g in Theorem 3.5.5, then we get the two independent variable generalizations of the inequalities given in [22, see Corollary 2 and Theorem 1].

3.6 Applications In the literature, a number of new methods and tools are developed by different investigators to study various types of differential and integral equations. In this section we present applications of some of the inequalities given in earlier sections and it is hoped that these inequalities will assure greater importance in the near future. In what follows we shall use the notations and definitions as given in sections 3.2 and 3.4 and explained if necessary at appropriate places.

Chapter 3

181

3.6.1 Differential equations with many retarded arguments Consider the following differential equations involving several retarded arguments x0 (t) = f (t, x (t − h1 (t)) , ..., x (t − hn (t))) ,

(3.6.1)

xp−1 (t) x0 (t) = f (t, x (t − h1 (t)) , ..., x (t − hn (t))) ,

(3.6.2)

and

for t ∈ I, with the given initial condition x (t0 ) = x0 ,

(3.6.3)

where p > 1 and x0 are constants, f ∈ C (I × Rn , R) and for i = 1, ..., n, hi (t) ∈ C (I, R+ ) be nonincreasing and such that t − hi (t) ≥ 0, t − hi (t) ∈ C 1 (I, I) , h0i (t) < 1, hi (t0 ) = 0. For the theory and applications of differential equations with deviating arguments, see [7,13,18]. The following theorems deals with the estimates on the solutions of equations (3.6.1), (3.6.2) with the given initial condition (3.6.3), see Pachpatte [60,74]. Theorem 3.6.1. Suppose that |f (t, u1 , ..., un )| ≤

n X

bi (t) |ui | ,

(3.6.4)

i=1

where bi (t) are as in Theorem 3.2.4, and let Mi =

1 max , i = 1, ..., n. t ∈ I 1 − h0i (t)

(3.6.5)

182


If x(t) is any solution of the initial value problem (3.6.1)-(3.6.3), then   t−h i (t) Z n X ¯bi (σ) dσ  |x (t)| ≤ |x0 | exp  , i=1

(3.6.6)

t0

for t ∈ I, where ¯bi (σ) = Mi bi (σ + hi (s)) , σ, s ∈ I. Proof. The solution x(t) of the initial value problem (3.6.1)-(3.6.3) can be written as Zt f (s, x (s − h1 (s)) , ..., x (s − hn (s)))ds.

x (t) = x0 +

(3.6.7)

t0

Using (3.6.4) in (3.6.7) and making the change of variables, then using (3.6.5) we have |x (t)| ≤ |x0 | +

n Z X

t

bi (s) |x (s − hi (s))| ds

i=1 t

0

t−h Z i (t) n X ¯bi (σ) |x (σ)| dσ, ≤ |x0 | + i=1

(3.6.8)

t0

for t ∈ I. Now a suitable application of the inequality given in Theorem 3.2.4, part (c1 ) to (3.6.8) yields the required estimate in (3.6.6). Theorem 3.6.2. Suppose that the function f in (3.6.2) satisfies the condition (3.6.4). Let Mi and ¯bi (σ) be as given in Theorem 3.6.1. If x(t) is any solution of the initial value problem (3.6.2)-(3.6.3), then 1  p−1 t−h  Z i (t) n  X p−1 ¯bi (σ) dσ + (p − 1) , |x (t)| ≤ |x0 |     i=1

  

(3.6.9)

t0

for t ∈ I. Proof. The solution x(t) of the initial value problem (3.6.2)-(3.6.3) can be written as p

x (t) =

xp0

Zt f (s, x (s − h1 (s)) , ..., x (s − hn (s)))ds.

+p t0

(3.6.10)

Chapter 3

183

From (3.6.10), (3.6.4), (3.6.5) and making the change of variables we have p

p

|x (t)| ≤ |x0 | + p

n Z X

t

bi (s) |x (s − hi (s))| ds

i=1 t

0

p

≤ |x0 | + p

n Z X

t

¯bi (σ) |x (σ)| dσ,

(3.6.11)

i=1 t

0

for t ∈ I. Now a suitable application of the inequality given in Theorem 3.2.6,part (q1 ) (when ai (t) = 0) to (3.6.11) yields the required estimate in (3.6.9).

3.6.2 Retarded differential and integrodifferential equations First we consider the initial value problem (IVP for short) for higher order retarded differential equation of the form y (n) (t) = f (t, y (t) , y (t − h (t))) ,

(3.6.12)

y (k) (t0 ) = ck , k = 0, 1, 2, ..., n − 1,

(3.6.13)

for t ∈ J = [t0 , T ] , where f ∈ C J × R2 , R and h ∈ C (J, R+ ) be nonincreasing with h (t) ≤ t on J, t − h (t) ∈ C 1 (J, J) , h0 (t) < 1, h (t0 ) = 0 and n ≥ 2 is a natural number and ck are real constants. As an application of the inequality given in Theorem 3.2.1, part (a1 ) we present the following theorem which deals with certain properties of solutions of IVP (3.6.12)-(3.6.13), see [63]. Theorem 3.6.3.

(i) Assume that

|f (t, y, z)| ≤ a (t) |y| + b (t) |z| ,

(3.6.14)

where a (t) , b (t) ∈ C (J, R+ ) and let L=

1 max . t ∈ J 1 − h0 (t)

(3.6.15)

If y(t) is any solution of IVP (3.6.12)-(3.6.13), then   φ(t) Zt Z  ¯b (s) ds |y (t)| ≤ M exp  a ¯ (s) ds + , t0

t0

(3.6.16)

184


for t ∈ J, where a ¯ (t) = N a (t) , ¯b (t) = N Lb (t + h (s)) , t, s ∈ J, φ (t) = t − h (t),

M=

n−1 X i=0

i

|ci | (T − t0 ) , i!

(3.6.17)

and n−1

N=

(T − t0 ) . (n − 1)!

(3.6.18)

(ii) Suppose that |f (t, y, z) − f (t, y¯, z¯)| ≤ a (t) |y − y¯| + b (t) |z − z¯| ,

(3.6.19)

where a (t) , b (t) ∈ C (J, R+ ). Let L, M, N , a ¯ (t) , ¯b (t) , φ (t) be as in part (i). Then the IVP (3.6.12)-(3.6.13) has at most one solution on J. Proof. (i) It is easy to see that the solution y(t) of IVP (3.6.12)-(3.6.13) satisfies the equivalent integral equation

y (t) =

n−1 X i=1

i

ci (t − t0 ) + i!

Zt

n−1

(t − s) f (s, y (s) , y (s − h (s))) ds. (3.6.20) (n − 1)!

t0

From (3.6.20), (3.6.14), (3.6.17), (3.6.18) we have

|y (t)| ≤

n−1 X i=1

i

|ci | (t − t0 ) + i!

Zt

n−1

(t − s) |f (s, y (s) , y (s − h (s)))|ds (n − 1)!

t0

 t  Z Zt ≤ M + N  a (s) |y (s)| ds + b (s) |y (s − h (s))| ds . t0

(3.6.21)

t0

By making the change of variable in the second integral in (3.6.21) and using (3.6.15) we have Zt

φ(t) Z ¯b (σ) |y (σ)|dσ. a ¯ (s) |y (s)| ds +

t0

t0

|y (t)| ≤ M +

(3.6.22)

Now a suitable application of the inequality in Theorem 3.2.1, part (a1 ) to (3.6.22) yields the required estimate in (3.6.16).

Chapter 3

185

(ii) Let y1 (t) and y2 (t) be two solutions of IVP (3.6.12)-(3.6.13) on J, then we have Zt y1 (t) − y2 (t) =

n

(t − s) {f (s, y1 (s) , y1 (s − h (s))) (n − 1)!

t0

−f (s, y2 (s) , y2 (s − h (s)))} ds.

(3.6.23)

From (3.6.23), (3.6.19), (3.6.18) we have Zt |y1 (t) − y2 (t)| ≤

N a (s) |y1 (s) − y2 (s)| ds t0

Zt N b (s) |y1 (s − h (s)) − y2 (s − h (s))| ds.

+

(3.6.24)

t0

Making the change of variable in the second integral on the right side in (3.6.24) we get Zt |y1 (t) − y2 (t)| ≤

a ¯ (s) |y1 (s) − y2 (s)|ds t0

φ(t) Z ¯b (σ) |y1 (σ) − y2 (σ)|dσ. +

(3.6.25)

t0

A suitable application of the inequality in Theorem 3.2.1, part (a1 ) to (3.6.25) yields |y1 (t) − y2 (t)| ≤ 0 .Therefore y1 (t) = y2 (t) i.e., there is at most one solution of IVP (3.6.12)-(3.6.13). Next, we apply the inequality given in Theorem 3.3.5, part (d1 ) to study certain properties of solutions of the retarded integrodifferential equation   Zt (3.6.26) x0 (t) = F t, x (t − h (t)) , f (t, σ, x (σ − h (σ))) dσ, t0

with the given initial condition x (t0 ) = x0 ,

(3.6.27)

for t ∈ I, where f ∈ C I 2 × R, R , F ∈ C I × R2 , R , x0 is a real constant and h (t) ∈ C (I, R+ ) be nonincreasing with h (t) ≤ t on I, t − h (t) ∈ C 1 (I, I), h0 (t) < 1, h (t0 ) = 0, see [47].

186


Theorem 3.6.4.

(i) Suppose that

|f (t, s, x)| ≤ b (t, s) |x| ,

(3.6.28)

|F (t, z, w)| ≤ a (t) |z| + |w| ,

(3.6.29)

where a(t), b(t, s) are as given in Theorem 3.3.5 and let M=

1 max . t ∈ I 1 − h0 (t)

(3.6.30)

If x(t) is any solution of (3.6.26)-(3.6.27), then  t−h(t) Z  |x (t)| ≤ |x0 | exp  [M a (s + h (η)) t0

Zs +





M 2 b (s + h (η) , σ + h (τ )) dσ  ds ,

(3.6.31)

t0

for t, η, τ ∈ I. (ii) Suppose that the functions f, F in (3.6.26) satisfy the conditions |f (t, s, x) − f (t, s, y)| ≤ b (t, s) |x − y| ,

(3.6.32)

|F (t, x, x ¯) − F (t, y, y¯)| ≤ a (t) |x − y| + |¯ x − y¯| ,

(3.6.33)

where a(t), b(t, s) are as given in Theorem 3.3.5 and let M be given by (3.6.30). Then the problem (3.6.26)-(3.6.27) has at most one solution on I. Proof.

(i) The solution x(t) of (3.6.26)-(3.6.27) can be written as   Zt Zs x (t) = x0 + F s, x (s − h (s)) , f (s, σ, x (σ − h (σ))) dσ ds. (3.6.34) t0

t0

Using (3.6.28)-(3.6.30) in (3.6.34) and making the change of variables we have t−h(t) Z

|x (t)| ≤ |x0 | +

[M a (s + h (η)) |x (s)| t0

Zs +

 M 2 b (s + h (η) , σ + h (τ )) |x (σ)|dσ  ds,

(3.6.35)

t0

for t, η, τ ∈ I. Now a suitable application of the inequality given in Theorem 3.3.5,part (d1 ) to (3.6.35) yields the required estimate in (3.6.31).

Chapter 3

187

(ii) Let x(t) and x ¯ (t) be two solutions of (3.6.26)-(3.6.27) on I, then we have    Zt  Zs F s, x (s − h (s)) , f (s, σ, x (σ − h (σ))) dσ  x (t) − x ¯ (t) =  t0

t0



Zs

−F s, x ¯ (s − h (s)) , t0

  f (s, σ, x ¯ (σ − h (σ))) dσ  ds. 

(3.6.36)

Using (3.6.32), (3.6.33) in (3.6.36) and making the change of variables, we have t−h(t) Z

[M a (s + h (η)) |x (s) − x ¯ (s)|

|x (t) − x ¯ (t)| ≤ t0

Zs +

 M 2 b (s + h (η) , σ + h (τ )) |x (σ) − x ¯ (σ)|dσ  ds,

(3.6.37)

t0

for t, η, τ ∈ I. A suitable application of the inequality given in Theorem 3.3.5, part (d1 ) to (3.6.37) yields |x (t) − x ¯ (t)| ≤ 0. Therefore x (t) = x ¯ (t) i.e., there is at most one solution of (3.6.26)-(3.6.27).

3.6.3 Retarded partial differential equations in two variables Consider the following retarded non-self-adjoint hyperbolic partial differential equation zxy (x, y) =

∂ (a (x, y) z (x, y)) ∂y

+f (x, y, z (x − h1 (x) , y − g1 (y)) , ..., z (x − hn (x) , y − gn (y))) , (3.6.38) with the given initial boundary conditions z (x, y0 ) = a1 (x) , z (x0 , y) = a2 (y) , a1 (x0 ) = a2 (y0 ) = 0,

(3.6.39)

where a ∈ C (∆, R) is differentiable with respect to y , f ∈ C (∆ × Rn , R) , a1 ∈ C 1 (I1 , R) , a2 ∈ C 1 (I2 , R) ,; hi ∈ C (I1 , R+ ) , gi ∈ C (I2 , R+ ) are nonincreasing and such that x − hi (x) ≥ 0, x − hi (x) ∈ C 1 (I1 , I1 ) , y − gi (y) ≥ 0, y − hi (y) ∈ C 1 (I2 , I2 ) , h0i (x) < 1, gi0 (y) < 1, hi (x0 ) = gi (y0 ) = 0 for i = 1, ..., n; x ∈ I1 , y ∈ I2 . Let Mi =

1 1 max max ,N = , x ∈ I1 1 − h0i (x) i y ∈ I2 1 − gi0 (y)

for i = 1, ..., n.

(3.6.40)

188


The following theorem deals with the estimate and uniqueness of solutions of (3.6.38)-(3.6.39), see [59]. Theorem 3.6.5.

(i) Suppose that

|f (x, y, u1 , ..., un )| ≤

n X

bi (x, y) |ui | ,

(3.6.41)

i=1

|e (x, y)| ≤ k,

(3.6.42)

where bi (x, y), k are as in Theorem 3.5.3 and Zx e (x, y) = a1 (x) + a2 (y) −

a (s, yo ) a1 (s) ds.

(3.6.43)

x0

If z(x, y) is any solution of (3.6.38)-(3.6.39), then   φZi (x) ψZi (y) n X  ¯bi (σ, τ )¯ |z (x, y)| ≤ k q¯ (x, y) exp  qi (σ, τ ) dτ dσ  , (3.6.44) i=1

φi (x0 ) ψi (y0 )

for (x, y) ∈ ∆,where φi (x) = x − hi (x) , x ∈ I1 , ψi (y) = y − gi (y) , y ∈ I2 , ¯bi (σ, τ ) = Mi Ni bi (σ + hi (s) , τ + gi (t)) for σ, s ∈ I1 , τ, t ∈ I2 and  x  Z q¯ (x, y) = exp  |a (ξ, y)| dξ  , (3.6.45) x0

for (x, y) ∈ ∆ and Mi , Ni are given by (3.6.40). (ii) Suppose that the function f in (3.6.38) satisfies the condition |f (x, y, u1 , ..., un ) − f (x, y, v1 , ..., vn )| ≤

n X

bi (x, y) |ui − vi | ,

(3.6.46)

i=1

where bi (x, y) are as in Theorem 3.5.3. Let φi , ψi , ¯bi , Mi , Ni be as in part (i). Then the problem (3.6.38)-(3.6.39) has at most one solution on ∆. Proof. (i) It is easy to see that the solution z(x, y) of the problem (3.6.38)(3.6.39) satisfies the equivalent integral equation Zx z (x, y) = e (x, y) +

a (s, y) z (s, y) ds x0

Chapter 3

189

Zx Zy f (s, t, z (s − h1 (s) , t − g1 (t)) , ..., z (s − hn (s) , t − gn (t)))dtds,

+ x0 y0

(3.6.47) where e(x, y) is given by (3.6.43). From (3.6.47), (3.6.41), (3.6.42), (3.6.40) and making the change of variables we have Zx |a (s, y)| |z (s, y)| ds

|z (x, y)| ≤ k + x0

+

Zx Zy X n

bi (s, t) |z (s − hi (s) , t − gi (t))| dtds

i=1

x0 y0

Zx |a (s, y)| |z (s, y)| ds

≤k+ x0

+

φZi (x) ψ(y) Z n X i=1

¯bi (σ, τ ) |z (σ, τ )| dτ dσ.

(3.6.48)

φi (x0 ) ψ(y0 )

Now a suitable application of the inequality given in Theorem 3.5.3, part (b1 ) to (3.6.48) yields (3.6.44). (ii) Let u(x, y) and v(x, y) be two solutions of the problem (3.6.38)-(3.6.39) on ∆, then Zx u (x, y) − v (x, y) =

a (s, y) {u (s, y) − v (s, y)} ds x0

Zx Zy {f (s, t, u (s − h1 (s) , t − g1 (t)) , ..., u (s − hn (s) , t − gn (t)))

+ x0 y0

−f (s, t, v (s − h1 (s) , t − g1 (t)) , ..., v (s − hn (s) , t − gn (t)))} dtds. (3.6.49) From (3.6.49), (3.6.46), making the change of variables and in view of (3.6.40) we have Zx |u (x, y) − v (x, y)| ≤

|a (s, y)| |u (s, y) − v (s, y)| ds x0

+

Zx Zy X n x0 y0

i=1

bi (s, t) |u (s − hi (s) , t − gi (t)) − v (s − hi (s) , t − gi (t))|dtds

190

Retarded integral inequalities Zx ≤

|a (s, y)| |u (s, y) − v (s, y)| ds x0

+

φZi (x) ψZi (y) n X i=1

¯bi (σ, τ ) |u (σ, τ ) − v (σ, τ )|dτ dσ.

(3.6.50)

φi (x0 ) ψi (y0 )

A suitable application of the inequality given in Theorem 3.5.3, part (b1 ) to (3.6.50) yields |u (x, y) − v (x, y)| ≤ 0. Therefore u(x, y) = v(x, y) i.e., there is at most one solution of the problem (3.6.38)-(3.6.39) on ∆. Next, as an application of Theorem 3.5.5, part (d1 ) we obtain the explict bound on the solution of retarded partial differential equation of the form ∂ ∂ z p−1 (x, y) z (x, y) ∂y ∂x = f (x, y, z (x − h1 (x) , y − g1 (y)) , ..., z (x − hn (x) , y − gn (y))) , (3.5.51) with the given initial boundary conditions (3.6.39), where p > 1 is a constant and the functions involved in the problem (3.6.51)-(3.6.39) are as given in the problem (3.6.38)-(3.6.39), see [60]. Theorem 3.6.6.

Suppose that

|f (x, y, u1 , ..., un )| ≤

n X

bi (x, y) |ui | ,

(3.6.52)

i=1

|ap1 (x)| + |ap2 (y)| ≤ c,

(3.6.53)

where bi (x, y) and c are as in Theorem 3.5.5. Let Mi , Ni for i = 1, ..., n be as in (3.6.40). If z(x, y) is any solution of the problem (3.6.51)-(3.6.39), then 1   p−1 φZi (x) ψZi (y)   n   X p−1 ¯bi (σ, τ ) dτ dσ |z (x, y)| ≤ {c} p + (p − 1) , (3.6.54)     i=1

φi (x0 ) ψi (y0 )

for (x, y) ∈ ∆,where φi (x) , ψi (y) , ¯bi (σ, τ ) be as in Theorem 3.6.5, part (i). Proof. It is easy to see that the solution z(x, y) of the problem (3.6.51)-(3.6.39) satisfies the equivalent integral equation z p (x, y) = ap1 (x) + ap2 (y) p

z (x, y) =

ap1

(x) +

ap2

Zx Zy (y) + p x0 y0

Chapter 3

191

×f (s, t, z (xs − h1 (s) , t − g1 (t)) , ..., z (s − hn (s) , t − gn (t))) dtds. (3.6.55) From (3.6.55), (3.6.52), (3.6.53), (3.6.40) and making the change of variables we have p

|z (x, y)| ≤ c + p

Zx Zy X n

bi (s, t) |z (s − hi (s) , t − gi (t))| dtds

x0 y0 i=1

≤c+p

φZi (x) ψZi (y) n X i=1

¯bi (σ, τ ) |z (σ, τ )|dτ ds.

(3.6.56)

φi (x0 ) ψi (y0 )

Now a suitable application of the inequality given in Theorem 3.3.5, part (d1 ) to (3.6.56) yields (3.6.54).

3.6.4 Retarded Volterra-Fredholm integral equation in two variables In this section, we present applications of Theorem 3.4.5 given in [58] to study certain properties of solutions of the retarded Volterra-Fredholm integral equation in two independent variables of the form Zx Zy A (x, y, s, t, z (s − h1 (s) , t − h2 (t))) dtds

z (x, y) = f (x, y) + x0 y0

ZM ZN B (x, y, s, t, z (s − h1 (s) , t − h2 (t))) dtds,

+

(3.6.57)

x0 y0

for (x, y) ∈ ∆, where f ∈ C (∆, R) , A, B ∈ C (D × R, R) and h1 ∈ C (I1 , R+ ) , h2 ∈ C (I2 , R+ ) are nonincreasing, x − h1 (x) ≥ 0, x ∈ I1 ; y − h2 (y) ≥ 0, y ∈ I2 ; x − h1 (x) ∈ C 1 (I1 , I1 ) , y − h2 (y) ∈ C 1 (I2 , I2 ) , h01 (x) < 1, h02 (y) < 1, h1 (x0 ) = h2 (y0 ) = 0, in which I1 = [x0 , M ] , I2 = [y0 , N ] are the given subsets of R , ∆ = I1 × I2 and D = (x, y, s, t) ∈ ∆2 : x0 ≤ s ≤ x ≤ M, y0 ≤ t ≤ y ≤ N . Theorem 3.6.7. (i) Suppose that the functions f, A, B in equation (3.6.57) satisfy the conditions |f (x, y)| ≤ c,

(3.6.58)

|A (x, y, s, t, z)| ≤ a (x, y, s, t) |z| ,

(3.6.59)

|B (x, y, s, t, z)| ≤ b (x, y, s, t) |z| ,

(3.6.60)

192


where c, a(x, y, s, t), b(x, y, s, t) are as in Theorem 3.4.5. Let M1 =

1 1 max max , M2 = , x ∈ I1 1 − h01 (x) y ∈ I2 1 − h01 (y)

(3.6.61)

and φ(M Z ) ψ(N Z )



¯b (x, y, s, t) exp  

p¯ (x, y) = φ(x0 ) ψ(y0 )



φ(s) ψ(t) Z Z

 a ¯ (s, t, σ, τ ) dτ dσ 

φ(x0 ) ψ(y0 )

×dtds < 1,

(3.6.62)

where φ (x) = x − h1 (x) , x ∈ I1 , ψ (y) = y − h2 (y) , y ∈ I2 and a ¯ (x, y, σ, τ ) = M1 M2 a (x, y, σ + h1 (s) , τ + h2 (t)) , ¯b (x, y, σ, τ ) = M1 M2 b (x, y, σ + h1 (s) , τ + h2 (t)) . If z(x, y) is a solution of equation (3.6.57) on ∆, then   φ(x) Z ψ(y) Z c   exp  |z (x, y)| ≤ a ¯ (x, y, σ, τ ) dτ dσ  , 1 − p¯ (x, y)

(3.6.63)

φ(x0 ) ψ(y0 )

for (x, y) ∈ ∆. (ii) Suppose that the functions A, B in equation (3.6.57) satisfy the conditions |A (x, y, s, t, z) − A (x, y, s, t, z¯)| ≤ a (x, y, s, t) |z − z¯| ,

(3.6.64)

|B (x, y, s, t, z) − B (x, y, s, t, z¯)| ≤ b (x, y, s, t) |z − z¯| ,

(3.6.65)

where a(x, y, s, t), b(x, y, s, t) are as in Theorem 3.4.5. Let M1 , M2 , φ, ψ, a ¯, ¯b, p¯ be as in part (i). Then the equation (3.6.47) has at most one solution on ∆. Proof. Since z(x, y) is a solution of equation (3.6.57), from (3.6.57)-(3.6.60) we have Zx Zy |z (x, y)| ≤ c +

a (x, y, s, t) |z (s − h1 (s) , t − h2 (t))|dtds x0 y0

ZM ZN b (x, y, s, t) |z (s − h1 (s) , t − h2 (t))| dtds.

+ x0 y0

(3.6.66)

Chapter 3

193

Now by making the change of variables on the right hand side of (3.6.66) and using (3.6.61) we have φ(x) Z ψ(y) Z

a ¯ (x, y, s, t) |z (σ, τ )|dτ dσ

|z (x, y)| ≤ c + φ(x0 ) ψ(y0 ) φ(M Z ) ψ(N Z )

¯b (x, y, s, t) |z (σ, τ )| dτ dσ.

+

(3.6.67)

φ(x0 ) ψ(y0 )

A suitable application of Theorem 3.4.5 to (3.6.67) yields (3.6.63). (ii) Let z(x, y) and z¯ (x, y) be two solutions of equation (3.6.57) on ∆. From (3.6.57), (3.6.64), (3.6.65) we have |z (x, y) − z¯ (x, y)| Zx Zy a (x, y, s, t) |z (s − h1 (s) , t − h2 (t))

≤ x0 y0

−¯ z (s − h1 (s) , t − h2 (t))| dtds ZM ZN b (x, y, s, t) |z (s − h1 (s) , t − h2 (t))

+ x0 y0

−¯ z (s − h1 (s) , t − h2 (t))| dtds.

(3.6.68)

By making the change of variables on the right hand side of (3.6.68) and using (3.6.61) we have φ(x) Z ψ(y) Z

|z (x, y) − z¯ (x, y)| ≤

a ¯ (x, y, s, t) |z (σ, τ ) − z¯ (σ, τ )|dτ dσ φ(x0 ) ψ(y0 )

φ(M Z ) ψ(N Z )

+

(x, y, s, t) |z (σ, τ ) − z¯ (σ, τ )|dτ dσ.

(3.6.69)

φ(x0 ) ψ(y0 )

Now a suitable application of Theorem 3.4.5 to (3.6.69) yields |z (x, y) − z¯ (x, y)| ≤ 0.Therefore z (x, y) = z¯ (x, y) i.e., there is at most one solution to the equation (3.6.57).

194


We next consider the following retarded Volterra-Fredholm integral equations Zx Zy A (x, y, s, t, z (s − h1 (s) , t − h2 (t)) , µ)dtds

z (x, y) = f (x, y) + x0 y0

ZM ZN B (x, y, s, t, z (s − h1 (s) , t − h2 (t)) , µ)dtds,

+

(3.6.70)

x0 y0

Zx Zy A (x, y, s, t, z (s − h1 (s) , t − h2 (t)) , µ0 )dtds

z (x, y) = f (x, y) + x0 y0

ZM ZN B (x, y, s, t, z (s − h1 (s) , t − h2 (t)) , µ0 )dtds,

+

(3.6.71)

x0 y0

for (x, y) ∈ ∆, where f ∈ C (∆, R) , A, B ∈ C (D × R × R, R) and µ, µ0 are real parameters. The following theorem shows the dependency of solutions of equations (3.6.70) and (3.6.71) on parameters. Theorem 3.6.8 . Suppose that |A (x, y, s, t, z, µ) − A (x, y, s, t, z¯, µ)| ≤ a (x, y, s, t) |z − z¯| ,

(3.6.72)

|A (x, y, s, t, z, µ) − A (x, y, s, t, z, µ0 )| ≤ r (x, y, s, t) |µ − µ0 | ,

(3.6.73)

|B (x, y, s, t, z, µ) − B (x, y, s, t, z¯, µ)| ≤ b (x, y, s, t) |z − z¯| ,

(3.6.74)

|B (x, y, s, t, z, µ) − B (x, y, s, t, z, µ0 )| ≤ e (x, y, s, t) |µ − µ0 | ,

(3.6.75)

where a(x, y, s, t), b(x, y, s, t) are as in Theorem 3.4.5 and r, e ∈ C (D, R+ ) are such that Zx Zy r (x, y, s, t) dtds ≤ k1 ,

(3.6.76)

e (x, y, s, t) dtds ≤ k2 ,

(3.6.77)

x0 y0

ZM ZN x0 y0

for (x, y) ∈ ∆, where k1 , k2 are positive constants. Let M1 , M2 , φ, ψ, a ¯, ¯b, p¯ be as in Theorem 3.6.7, part (i). Let z1 (x, y) and z2 (x, y) for (x, y) ∈ ∆ be the solutions of (3.6.70) and (3.6.71) respectively. Then |z1 (x, y) − z2 (x, y)| ≤

(k1 + k2 ) |µ − µ0 | 1 − p¯ (x, y)

Chapter 3 

195 

φ(x) Z ψ(y) Z

 × exp 

 a ¯ (x, y, s, t) dtds ,

(3.6.78)

φ(x0 ) ψ(y0 )

for (x, y) ∈ ∆. Proof.

Let z (x, y) = z1 (x, y) − z2 (x, y) , (x, y) ∈ ∆. Then Zx Zy {A (x, y, s, t, z1 (s − h1 (s) , t − h2 (t)) , µ)

z (x, y) = x0 y0

−A (x, y, s, t, z2 (s − h1 (s) , t − h2 (t)) , µ)} dtds Zx Zy {A (x, y, s, t, z2 (s − h1 (s) , t − h2 (t)) , µ)

+ x0 y0

−A (x, y, s, t, z2 (s − h1 (s) , t − h2 (t)) , µ0 )} dtds ZM ZN {B (x, y, s, t, z1 (s − h2 (s) , t − h2 (t)) , µ)

+ x0 y0

−B (x, y, s, t, z2 (s − h1 (s) , t − h2 (t)) , µ)} dtds ZM ZN {B (x, y, s, t, z2 (s − h2 (s) , t − h2 (t)) , µ)

+ x0 y0

−B (x, y, s, t, z2 (s − h1 (s) , t − h2 (t)) , µ0 )} dtds.

(3.6.79)

Using (3.6.72)-(3.6.77) in (3.6.79) we get |z (x, y)| ≤ |µ − µ0 | k1 + |µ − µ0 | k2 Zx Zy a (x, y, s, t) |z (s − h1 (s) , t − h2 (t))| dtds

+ x0 y0

ZM ZN b (x, y, s, t) |z (s − h1 (s) , t − h2 (t))| dtds.

+

(3.6.80)

x0 y0

By making the change of variables on the right hand side of (3.6.80) and using (3.6.61) we get φ(x) Z ψ(y) Z

|z (x, y)| ≤ (k1 + k2 ) |µ − µ0 | + φ(x0 ) ψ(y0 )

a ¯ (x, y, σ, τ ) |z (σ, τ )|dτ dσ

196

Retarded integral inequalities φ(M Z ) ψ(N Z )

+

¯b (x, y, σ, τ ) |z (σ, τ )|dτ dσ.

(3.6.81)

φ(x0 ) ψ(y0 )

Now a suitable application of Theorem 3.4.5 to (3.6.81) yields (3.6.78) which shows the dependency of solutions of (3.6.70) and (3.6.71) on parameters. In conclusion, we note that the inequalities given in earlier sections are recently established and still admit various generalizations and extensions in different directions. Here we have given some basic and immediate applications of few of the inequalities which will encourage to widen the scope of their applications.

3.7 Notes The search for more efficient methods to study certain retarded differential and integral equations has recently led to the discoveries of some basic retarded integral inequalities with explicit estimates. The main advantage of obtaining such results lies in the fact that they can serve as effective tools when the earlier results do not apply directly and certainly a good source to further development.Sections 3.2 and 3.3 are devoted to some basic retarded integral inequalities in one independent variable, recently investigated and used by Pachpatte in [43,58,60,61,64,69,77]. For some earlier results on such inequalities, we refer the reader to the book by Bainov and Simeonov [3, pp. 142-145]. The results given in sections 3.4 and 3.5 deals with a number of new retarded integral inequalities involving functions of two independent variables, recently investigated by Pachpatte in [43,47,58,59, 60,69,74,77]. Section 3.6 contains applications of some of the inequalities given in earlier sections.

Chapter 4

Finite difference inequalities in one variable 4.1 Introduction The theory of finite difference equations has gained increasing significance in the last decades as is apparent from the large number of publications on the subject. A great variety of methods and tools are available for handling such equations. In the study of many finite difference and sum-difference equations, one often needs some new and specific type of finite difference inequalities for proving various theorems or approximating functions. The desire to widen the scope of applications of such inequalities resulted in the necessity of discovering new finite difference inequalities which are directly applicable in the new situations. In this chapter, we offer various basic finite difference inequalities recently investigated in [35,37,39,44,45,53,55,57,67,68,70,73,75] which can be used as powerful tools in certain applications. Some fundamental applications are given to illustrate the usefulness of certain inequalities.

4.2 Fundamental finite difference inequalities In this section, we focus our attention on some basic inequalities established by Pachpatte in [57] (see also [42]) which provide explicit bounds on unknown functions and can be used as an effective tool in the development of the theory of finite difference equations and numerical analysis. We start with the following theorems which deals with the finite difference inequalities proved in [57]. 197

198

Finite difference inequalities in one variable

Theorem 4.2.1. 0 for n ∈ N0 ., If

Let u (n) , a (n) , b (n) , c (n) , p (n) ∈ D (N0 , R+ ) and ∆c (n) ≥

u (n) ≤ a (n) + b (n) c (n) +

n−1 X

! p (s) u (s) ,

(4.2.1)

s=0

for n ∈ N0 , then u (n) ≤ a (n) + b (n) c (0)

n−1 Y

[1 + b (s) p (s)]

s=0

+

n−1 X

n−1 Y

[∆c (s) + a (s) p (s)]

s=0

! [1 + b (σ) p (σ)] ,

(4.2.2)

σ=s+1

for n ∈ N0 . Proof. Define a function z(n) by z (n) = c (n) +

n−1 X

p (s) u (s).

(4.2.3)

s=0

Then z(0) = c(0) and (4.2.1) can be restated as u (n) ≤ a (n) + b (n) z (n) .

(4.2.4)

From (4.2.3) and (4.2.4) we observe that ∆z (n) = ∆c (n) + p (n) u (n) ≤ b (n) p (n) z (n) + [∆c (n) + a (n) p (n)] .

(4.2.5)

Now by applying Theorem 1.2.1 given in [42, p. 11] to (4.2.5) we get z (n) ≤ c (0)

n−1 Y

[1 + b (σ) p (σ)]

s=0

+

n−1 X

[∆c (s) + a (s) p (s)]

s=0

n−1 Y

[1 + b (σ) p (σ)] .

(4.2.6)

σ=s+1

Using (4.2.6) in (4.2.4) we get the required inequality in (4.2.2). Remark 4.2.1. We note that in the special case when c(n) = 0 , the inequality given in Theorem 4.2.1 reduces to the inequality given by Pachpatte, see [42, Theorem 1.2.3, p. 13]. Theorem 4.2.2.

Let u (n) , a (n) , b (n) , c (n) , ∆c (n) be as in Theorem 4.2.1.

Chapter 4

199

(a1 ) Let L : N0 × R+ → R+ be a function such that 0 ≤ L (n, x) − L (n, y) ≤ M (n, y) (x − y) ,

(4.2.7)

for n ∈ N0 , x ≥ y ≥ 0, where M (n, y) is a real-valued nonnegative function defined for n ∈ N0 , y ∈ R+ . If u (n) ≤ a (n) + b (n) c (n) +

n−1 X

! L (s, u (s)) ,

(4.2.8)

s=0

for n ∈ N0 , then u (n) ≤ a (n) + b (n) c (0)

n−1 Y

[1 + M (s, a (s)) b (s)]

s=0

+

n−1 X

[∆c (s) + L (s, a (s))]

s=0

!

n−1 Y

[1 + M (σ, a (σ)) b (σ)] ,

(4.2.9)

σ=s+1

for n ∈ N0 . (a2 ) Let L : N0 × R+ → R+ be a function which satisfies the condition 0 ≤ L (n, x) − L (n, y) ≤ M (n, y) φ−1 (x − y) ,

(4.2.10)

for n ∈ N0 , x ≥ y ≥ 0, where M (n, y) is as in (a1 ), φ : R+ → R+ is a continuous and strictly increasing function with φ (0) = 0, φ−1 is the inverse function of φ and φ−1 (xy) ≤ φ−1 (x) φ−1 (y) ,

(4.2.11)

for x, y ∈ R+ . If u (n) ≤ a (n) + b (n) φ c (n) +

n−1 X

! L (s, u (s)) ,

(4.2.12)

s=0

for n ∈ N0 , then u (n) ≤ a (n) + b (n) φ c (0)

n−1 Y

1 + M (s, a (s)) φ−1 (b (s))

s=0

+

n−1 X s=0

for n ∈ N0 .

[∆c (s) + L (s, a (s))]

n−1 Y σ=s+1

! −1 1 + M (σ, a (σ)) φ (b (σ)) , (4.2.13)

200


Proof.

(a1 ) Define a function z(n) by

z (n) = c (n) +

n−1 X

L (s, u (s)).

(4.2.14)

s=0

Then z(0) = c(0) and (4.2.8) can be restated as u (n) ≤ a (n) + b (n) z (n) .

(4.2.15)

From (4.2.14), (4.2.15) and (4.2.7) we have ∆z (n) = ∆c (n) + L (n, u (n)) ≤ ∆c (n) + L (n, a (n) + b (n) z (n)) − L (n, a (n)) + L (n, a (n)) ≤ M (n, a (n)) b (n) z (n) + [∆c (n) + L (n, a (n))] .

(4.3.16)

Now by applying Theorem 1.2.1 given in [42] to (4.2.16) we get z (n) ≤ c (0)

n−1 Y

[1 + M (s, a (s)) b (s)]

s=0

+

n−1 X

[∆c (s) + L (s, a (s))]

s=0

n−1 Y

[1 + M (σ, a (σ)) b (σ)].

(4.2.17)

σ=s+1

Using (4.2.17) in (4.2.15) we get the desired inequality in (4.2.9). (a2 ) Define a function z(n) by (4.2.14). Then z(0) = c(0) and (4.2.12) can be restated as u (n) ≤ a (n) + b (n) φ (z (n)) .

(4.2.18)

From (4.2.14), (4.2.18), (4.2.10) and (4.2.11) we have ∆z (n) = ∆c (n) + L (n, u (n)) ≤ ∆c (n) + L (n, a (n) + b (n) φ (z (n))) − L (n, a (n)) + L (n, a (n)) ≤ M (n, a (n)) φ−1 (b (n) φ (z (n))) + [∆c (n) + L (n, a (n))] ≤ M (n, a (n)) φ−1 (b (n)) z (n) + [∆c (n) + L (n, a (n))] .

(4.2.19)

Now an application of Theorem 1.2.1 given in [42] to (4.2.19) yields z (n) ≤ c (0)

n−1 Y

1 + M (s, a (s)) φ−1 (b (s))

s=0

+

n−1 X s=0

[∆c (s) + L (s, a (s))]

n−1 Y

1 + M (σ, a (σ)) φ−1 (b (σ)) .

σ=s+1

Using (4.2.20) in (4.2.18) we get (4.2.13).

(4.2.20)

Chapter 4

201

Remark 4.2.2. If we take c(n) = 0 in Theorem 4.2.2, part (a1 ), then we recapture the inequality given by Dragomir in [11] (see also [10]). We note that from Theorem 4.2.2, part (a1 ), one can easily obtain the corollaries similar to that of given in [10] (see also [11]) which can also be used in certain applications. In the following theorems we present some useful generalizations of the inequalities given in [42, Theorem 2.3.1, Corollary 3.3.1]. Theorem 4.2.3.

Let u (n) , a (n) , b (n) , c (n) , p (n) ∈ D (N0 , R+ ) .

(b1 ) Let ∆a (n) ≥ 0 for n ∈ N0 ; g ∈ C (R+ , R+ ) be a nondecreasing function with g(u) > 0 for u > 0. If u (n) ≤ a (n) +

n−1 X

p (s) g (u (s)) ,

(4.2.21)

s=0

for n ∈ N0 , then for 0 ≤ n ≤ n1 ; n, n1 ∈ N0 , " # n−1 X ∆a (s) −1 + p (s) , u (n) ≤ G G (a (0)) + g (a (s)) s=0

(4.2.22)

where Zr G (r) =

ds , r > 0, g (s)

(4.2.23)

r0

r0 > 0 is arbitrary and G−1 is the inverse of G and n1 ∈ N0 is chosen so that G (a (0)) +

n−1 X s=0

∆a (s) + p (s) ∈ Dom G−1 g (a (s))

for all n ∈ N0 lying in 0 ≤ n ≤ n1 .. (b2 ) Let ∆c (n) ≥ 0 for n ∈ N0 ; g, G, G−1 be as in part (b1 ) and suppose in addition, g(u) is subadditive and submultiplicative. If ! n−1 X p (s) g (u (s)) , (4.2.24) u (n) ≤ a (n) + b (n) c (n) + s=0

for n ∈ N0 , then for 0 ≤ n ≤ n2 ; n, n2 ∈ N0 , u (n) ≤ a (n) + b (n) G−1 [G (c (0)) +

n−1 X s=0

∆c (s) + p (s) g (a (s)) g (c (s))

# + p (s) g (b (s)) ,

(4.2.25)

202


and n2 ∈ N0 is chosen so that G (c (0)) +

n−1 X s=0

∆c (s) + p (s) g (a (s)) + p (s) g (b (s)) ∈ Dom G−1 , g (c (s))

for all n ∈ N0 lying in 0 ≤ n ≤ n2 . Proof. (b1 ) Let a(n) > 0 for n ∈ N0 and define a function z(n) by the right hand side of (4.2.21). Then z(0) = a(0), u (n) ≤ z (n) , z(n) > 0 and ∆z (n) = ∆a (n) + p (n) g (u (n)) ≤ ∆a (n) + p (n) g (z (n)) .

(4.2.26)

From (4.2.23), (4.2.26) and the fact that a (n) ≤ z (n) we observe that z(n+1) Z

G (z (n + 1)) − G (z (n)) =

ds g (s)

z(n)

≤

∆z (n) g (z (n))

≤

∆a (n) + p (n) g (z (n)) g (z (n))

≤

∆a (n) + p (n) . g (a (n))

(4.2.27)

By taking n = s in (4.2.27) and summing up over s from 0 to n − 1 we get G (z (n)) ≤ G (z (0)) +

n−1 X s=0

∆a (s) + p (s) , g (a (s))

which implies " z (n) ≤ G−1 G (a (0)) +

n−1 X s=0

# ∆a (s) + p (s) . g (a (s))

(4.2.28)

Using (4.2.28) in u (n) ≤ z (n) we get the required inequality in (4.2.22). If a (n) ≥ 0 for n ∈ N0 , we carry out the above procedure with a (n) + ε instead of a (n), where ε > 0 is an arbitrary small constant, and subsequently pass to the limit as ε → 0 to obtain (4.2.22). The subdomain 0 ≤ n ≤ n1 is obvious.

Chapter 4

203

(b2 ) Let c(n) > 0 for n ∈ N0 and define a function z(n) by z (n) = c (n) +

n−1 X

p (s) g (u (s)).

(4.2.29)

s=0

Then z(0) = c(0), z(n) > 0 for n ∈ N0 and (4.2.24) can be restated as u (n) ≤ a (n) + b (n) z (n) .

(4.2.30)

From (4.2.29) and (4.2.30) we have ∆z (n) = ∆c (n) + p (n) g (u (n)) ≤ ∆c (n) + p (n) g (a (n) + b (n) z (n)) ≤ (∆c (n) + p (n) g (a (n))) + p (n) g (b (n)) g (z (n)) .

(4.2.31)

From (4.2.23), (4.2.31) the fact that c (n) ≤ z (n) and following the proof of (b1 ) we obtain z (n) ≤ G−1 [G (c (0)) +

n−1 X s=0

∆c (s) + p (s) g (a (s)) g (c (s))

#

+ p (s) g (b (s)) ,

(4.2.32)

Using (4.2.32) in (4.2.30) we get (4.2.25). The proof of the case when c (n) ≥ 0 can be completed as mentioned in the proof of (b1 ).The subdomain 0 ≤ n ≤ n2 is obvious. Remark 4.2.3. If we take a(n) = k, a nonnegative constant, then the inequality given in Theorem 4.2.3, part (b1 ) reduces to the discrete version of the well known Bihar’s inequality, see [42, p. 103]. For a detailed account on such inequalities, see [42] and also [85]. Theorem 4.2.4.

Let u (n) , a (n) , b (n) ∈ D (N0 , R+ ).

(c1 ) Let ∆a (n) ≥ 0 for n ∈ N0 . If u2 (n) ≤ a (n) + 2

n−1 X

b (s) u (s) ,

(4.2.33)

s=0

for n ∈ N0 , then n−1 X p u (n) ≤ a (0) + s=0

for n ∈ N0 .

! ∆a (s) p + b (s) , 2 a (s)

(4.2.34)

204


(c2 ) Let h ∈ C (R+ , R+ ) be a nondecreasing function with h(u) > 0 for u > 0. If u2 (n) ≤ a (n) + 2

n−1 X

b (s) h (u (s)) ,

(4.2.35)

s=0

for n ∈ N0 , then for 0 ≤ n ≤ n3 ; n, n3 ∈ N0 ,   12   n−1   X ∆a (s)  p + 2b (s) u (n) ≤ H −1 H (a (0)) + ,   h a (s)

(4.2.36)

s=0

where Zr H (r) =

ds √ , r > 0, h ( s)

(4.2.37)

r0

r0 > 0 is arbitrary and H −1 is the inverse of H and n3 ∈ N0 is chosen so that   n−1 X ∆a (s)  p + 2b (s) ∈ Dom H −1 , H (a (0)) + h a (s) s=0 for all n ∈ N0 lying in 0 ≤ n ≤ n3 . Proof. (c1 ) Let a(n) > 0 for n ∈ N0 and definepa function z(n) by the right hand side of (4.2.33). Then z (0) = a (0) , u (n) ≤ z (n) and ∆z (n) = ∆a (n) + 2b (n) u (n) p (4.2.38) ≤ ∆a (n) + 2b (n) z (n). p p p Using the facts that z (n) > 0, ∆z (n) ≥ 0, z (n) ≤ z (n + 1), a (n) ≤ z (n) for n ∈ N0 and (4.2.40) we observe that (see [42, p. 212]) ∆

p z (n + 1) − z (n) p z (n) = p z (n + 1) + z (n)

∆z (n) ≤ p 2 z (n) ∆a (n) + 2b (n) p ≤ 2 z (n)

p z (n)

∆a (n) + b (n) , ≤ p 2 a (n)

Chapter 4

205

which implies p

n−1 X p z (n) ≤ a (0) + s=0

! ∆a (s) p + b (s) . 2 a (s)

(4.2.39)

p Using (4.2.39) in u (n) ≤ z (n) we get the required inequality in (4.2.34). The proof of the case when a (n) ≥ 0 for n ∈ N0 can be completed as in the proof of Theorem 4.2.3, part (b1 ). (c2 ) Let a(n) > 0 for n ∈ N0 and define a function p z(n) by the right hand side of (4.2.35). Then z(0) = a(0), z(n) > 0, u (n) ≤ z (n) and p z (n) . (4.2.40) ∆z (n) ≤ ∆a (n) + 2b (n) h As in the proof of Theorem 4.2.3, part (b1 ), from (4.2.37), (4.2.40) and the fact that a (n) ≤ z (n) we observe that ∆H (z (n)) ≤

≤

∆z (n) p h z (n)

∆a (n) p + 2b (n) . h a (n)

The rest of the proof can be completed by following the proof of Theorem 4.2.3, part (b1 ).We omit the details. Remark 4.2.4. We note that the inequality given in Theorem 4.2.4, part (c1 ) can be considered as a generalization of the inequality in Corollary 3.3.1 given in [42], while the inequality in part (c2 ) is a slight variant of the special version of the inequality in Theorem 3.3.5 given in [42].

4.3 Some more finite difference inequalities Due to various motivations, several new finite difference inequalities which yield explicit estimates on unknown functions have been investigated and used extensively in the literature, see [42]. In this section, we offer some more finite difference inequalities recently established by Pachpatte in [35,45,55,68] which can be used as tool in certain new applications. Our first theorem deals with the finite difference inequalities proved in [68]. Theorem 4.3.1. Let u (n) , a (n) ∈ D (N0 , R+ ); k (n, σ) , ∆1 k (n, σ) ∈ D (E, R+ ) , where E = (m, n) ∈ N02 : 0 ≤ n ≤ m < ∞ .

206


(a1 ) Let g ∈ C (R+ , R+ ) be a nondecreasing function with g(u) > 0 for u > 0. If n−1 X

u (n) ≤ c +

k (n, σ)g (u (σ)) ,

(4.3.1)

σ=0

for n ∈ N0 , where c ≥ 0 is a real constant, then for 0 ≤ n ≤ n1 ; n, n1 ∈ N0 , # " n−1 X −1 H (s) , (4.3.2) G (c) + u (n) ≤ G s=0

where H (n) = k (n + 1, n) +

n−1 X

∆1 k (n, σ) ,

(4.3.3)

σ=0

Zr G (r) =

ds , r > 0, g (s)

(4.3.4)

r0

r0 > 0 is arbitrary, G−1 is the inverse of G and n1 ∈ N0 is chosen so that G (c) +

n−1 X

H (s) ∈ Dom G−1

s=0

for all n ∈ N0 lying in 0 ≤ n ≤ n1 . (a2 ) Let g, G, G−1 be as in (a1 ) and suppose in addition g(u) is subadditive. If u (n) ≤ a (n) +

n−1 X

k (n, σ)g (u (σ)) ,

(4.3.5)

σ=0

for n ∈ N0 , then for 0 ≤ n ≤ n2 ; n, n2 ∈ N0 , # " n−1 X H (s) , u (n) ≤ a (n) + G−1 G (B (n)) +

(4.3.6)

s=0

where H(n) is given by (4.3.3), B (n) =

n−1 X

k (n, σ)g (a (σ)) ,

σ=0

for n ∈ N0 and n2 ∈ N0 is chosen so that G (B (n)) +

n−1 X

H (s) ∈ Dom G−1 ,

s=0

for all n ∈ N0 lying in 0 ≤ n ≤ n2 .

(4.3.7)

Chapter 4

207

Proof. (a1 ) Let c > 0 and define a function z(n) by the right hand side of (4.3.1). Then z(0) = c, u (n) ≤ z (n), z(n) > 0 and ∆z (n) = k (n + 1, n) g (u (n)) +

n−1 X

∆1 k (n, σ) g (u (σ))

σ=0

≤ H (n) g (z (n)) , where H(n) is given by (4.3.3), see [42, p. 22]. The rest of the proof can be completed by following the similar arguments as in the proof of Theorem 4.2.3, part (b1 ). We omit the details. (a2 ) The proof follows by closely looking at the proof of (a1 ) and the proof of Theorem 4.2.3, part (b2 ). Here we leave the details to the reader. The next theorem contains the inequalities established in [55]. Theorem 4.3.2.

Let u (n) , k (n, σ) , ∆1 k (n, σ) and c be as in Theorem 4.3.1.

(b1 ) If u2 (n) ≤ c +

n−1 X

k (n, σ)u (σ) ,

(4.3.8)

σ=0

for n ∈ N0 , then u (n) ≤

n−1 √ 1X c+ H (s) , 2 s=0

(4.3.9)

for n ∈ N0 , where H(n) is given by (4.3.3). (b2 ) Let g(u) be as in Theorem 4.3.1, part (a1 ).If u2 (n) ≤ c +

n−1 X

k (n, σ)u (σ) g (u (σ)) ,

(4.3.10)

σ=0

for n ∈ N0 , then for 0 ≤ n ≤ n3 ; n, n3 ∈ N0 , " # X √ 1 n−1 −1 G c + H (s) , u (n) ≤ G 2 s=0

(4.3.11)

where H(n) is given by (4.3.3), G, G−1 are as defined in Theorem 4.3.1, part (a1 ) and n3 ∈ N0 is chosen so that G

X √ 1 n−1 c + H (s) ∈ Dom G−1 , 2 s=0

for all n ∈ N0 lying in 0 ≤ n ≤ n3 .

208


Proof. (b1 ) Let c > 0 and define p a function z(n) by the right hand side of (4.3.8). Then z(0) = c, u (n) ≤ z (n), z(n) is positive and nondecreasing for n ∈ N0 and ∆z (n) =

n X

k (n + 1, σ) u (σ) −

σ=0

+

n−1 X

n−1 X

k (n + 1, σ) u (σ)

σ=0

k (n + 1, σ) u (σ) −

σ=0

n−1 X

k (n, σ) u (σ)

σ=0

= k (n + 1, n) u (n) +

n−1 X

∆1 k (n, σ)u (σ)

σ=0 n−1 X p p ∆1 k (n, σ) z (σ) ≤ k (n + 1, n) z (n) + σ=0

p ≤ H (n) z (n).

(4.3.12)

The rest of the proof follows by using the similar arguments as in the proof of Theorem 4.2.4, part (c1 ) below (4.2.40) with suitable changes. We omit the details. (b2 ) The proof follows by closely looking at the proof of part (b1 ) given above and the proof of Theorem 3.3.5 given in [42]. We omit it here to avoid repetition. The discrete inequalities established in [35,45] are embodied in the following theorems. Theorem 4.3.3. Let u (n) , a (n) , b (n) , g (n) , h (n) ∈ D (N0 , R+ ) and p > 1 be a real constant. (c1 ) If up (n) ≤ a (n) + b (n)

n−1 X

[g (s) up (s) + h (s) u (s)],

(4.3.13)

s=0

for n ∈ N0 , then ( u (n) ≤

a (n) + b (n)

n−1 X

g (s) a (s) + h (s)

s=0

) p1 h (σ) × , 1 + b (σ) g (σ) + p σ=s+1 n−1 Y

for n ∈ N0 .

p − 1 a (s) + p p

(4.3.14)

Chapter 4

209

(c2 ) Let c(n) be a real-valued positive and nondecreasing function defined on N0 . If p

p

u (n) ≤ c (n) + b (n)

n−1 X

[g (s) up (s) + h (s) u (s)],

(4.3.15)

s=0

for n ∈ N0 , then ( u (n) ≤ c (n) 1 + b (n)

n−1 X

g (s) + h (s) c1−p (s)

s=0

) p1 h (σ) 1−p c × 1 + b (σ) g (σ) + (σ) , p σ=s+1 n−1 Y

(4.3.16)

for n ∈ N0 . (c3 ) Let k (n, σ) , ∆1 k (n, σ) be as in Theorem 4.3.1. If up (n) ≤ a (n) + b (n)

n−1 X

k (n, s) [g (s) up (s) + h (s) u (s)],

(4.3.17)

s=0


a (n) + b (n)

n−1 X σ=0

¯ (σ) B

) p1 , 1 + A¯ (τ )

n−1 Y

(4.3.18)

τ =σ+1

for n ∈ N0 , where h (n) ¯ A (n) = k (n + 1, n) b (n) g (n) + p n−1 X

h (s) , ∆1 k (n, s) b (s) g (s) + + p s=0

(4.3.19)

p − 1 a (n) ¯ + B (n) = k (n + 1, n) g (n) a (n) + h (n) p p +

n−1 X s=0

for n ∈ N0 .

∆1 k (n, s) g (s) a (s) + h (s)

p − 1 a (s) + p p

,

(4.3.20)

210


Proof.

(c1 ) Define a function z(n) by

z (n) =

n−1 X

[g (s) up (s) + h (s) u (s)] .

(4.3.21)

s=0

Then z(0) = 0 and (4.3.13) can be written as up (n) ≤ a (n) + b (n) z (n) .

(4.3.22)

From (4.3.22), as in the proof of Theorem 1.3.2, part (a1 ) we obtain b (n) a (n) p−1 u (n) ≤ + z (n) . p + p p

(4.3.23)

From (4.3.21) and using (4.3.22), (4.3.23) we get (see [42, p. 13]) h (n) ∆z (n) ≤ b (n) g (n) + z (n) p p − 1 a (n) + g (n) a (n) + h (n) + . p p

(4.3.24)

Now a suitable application of Theorem 1.2.1 given in [42, p.11] to (4.3.24) yields z (n) ≤

n−1 X

g (s) a (s) + h (s)

s=0

p − 1 a (s) + p p

n−1 Y

h (σ) . × 1 + b (σ) g (σ) + p σ=s+1

(4.3.25)

Using (4.3.25) in (4.3.22) we get the required inequality in (4.3.14). (c2 ) Since c(n) is positive and nondecreasing function for n ∈ N0 , from (4.3.15) we observe that

u (n) c (n)

p ≤ 1 + b (n)

n−1 X

g (s)

s=0

u (s) c (s)

p

+ h (s) c1−p (s)

u (s) c (s)

. (4.3.26)

Now an application of the inequality given in (c1 ) to (4.3.26) yields the desired inequality in (4.3.16). (c3 ) Define a function z(n) by z (n) =

n−1 X s=0

k (n, s) [g (s) up (s) + h (s) u(s)] .

(4.3.27)

Chapter 4

211

Then z(0) = 0 and as in the proof of part (c1 ), from (4.3.17) we see that the inequalities (4.3.22) and (4.3.23) hold. From (4.3.27) and using (4.3.22), (4.3.23) and the fact that the function z(n) is nondecreasing in n, we observe that ∆z (n) = k (n + 1, n)) [g (n) up (n) + h (n) u(n)] +

n−1 X

∆1 k (n, s) [g (s) up (s) + h (s) u(s)]

s=0

≤ k (n + 1, n) [g (n) (a (n) + b (n) z (n)) p − 1 a (n) b (n) + + z (n) +h (n) p p p +

n−1 X

∆1 k (n, s) [g (s) (a (s) + b (s) z (s))

s=0

p − 1 a (s) b (s) + + z (s) p p p ¯ (n) . ≤ A¯ (n) z (n) + B

+h (s)

(4.3.28)

Now a suitable application of Theorem 1.2.1 given in [42, p. 11] to (4.3.28) yields z (n) ≤

n−1 X

¯ (σ) B

σ=0

n−1 Y

1 + A¯ (τ ) .

(4.3.29)

τ =σ+1

From (4.3.29) and (4.3.22) the desired inequality in (4.3.18) follows. Theorem 4.3.4. real constant.

Let u (n) , a (n) , b (n) , g (n) ∈ D (N0 , R+ ) and p > 1 be a

(d1 ) Let L : N0 × R+ → R+ be a function such that 0 ≤ L (n, x) − L (n, y) ≤ M (n, y) (x − y) ,

(4.3.30)

for n ∈ N0 , x ≥ y ≥ 0, where M : N0 × R+ → R+ .If p

u (n) ≤ a (n) + b (n)

n−1 X

L (s, u (s)) ,

(4.3.31)

s=0


a (n) + b (n)

n−1 X

p − 1 a (s) + L s, p p s=0

) p1 p − 1 a (σ) b (σ) + , 1 + M σ, × p p p σ=s+1 n−1 Y

for n ∈ N0 .

(4.3.32)

212


(d2 ) Let L : N0 × R+ → R+ be a function which satisfies the condition 0 ≤ L (n, x) − L (n, y) ≤ M (n, y) ψ −1 (x − y) ,

(4.3.33)

for n ∈ N0 , x ≥ y ≥ 0,where M : N0 × R+ → R+ , ψ : R+ → R+ is a continuous and strictly increasing function with ψ (0) = 0, ψ −1 is the inverse function of ψ and ψ −1 (xy) ≤ ψ −1 (x) ψ −1 (y) for x, y ∈ R+ . If ! n−1 X p L (s, u (s)) , (4.3.34) u (n) ≤ a (n) + b (n) ψ s=0


n−1 X

p − 1 a (s) + L s, p p s=0

a (n) + b (n) ψ

!) p1 p − 1 a (σ) b (σ) −1 × + ψ 1 + M σ, , p p p σ=s+1 n−1 Y

(4.3.35)

for n ∈ N0 . (d3 ) Let W (r) , G, G−1 be as in Theorem 1.3.2, part (b3 ). If up (n) ≤ a (n) + b (n)

n−1 X

g (s) W (u (s)) ,

(4.3.36)

s=0

for n ∈ N0 , then for 0 ≤ n ≤ n4 ; n, n4 ∈ N0 , "

( u (n) ≤

−1

a (n) + b (n) G

¯ (n) + G D

n−1 X

g (s) W

s=0

b (s) p

#) p1 , (4.3.37)

where ¯ (n) = D

n−1 X

g (s) W

s=0

p − 1 a (s) + p p

,

and n4 ∈ N0 is chosen so that X n−1 ¯ (n) + g (s) W G D s=0

b (s) p

∈ Dom G−1 ,

for all n ∈ N0 lying in 0 ≤ n ≤ n4 . The proof follows by closely looking at the proofs of Theorem 1.3.2 and 4.3.3, see also [42]. Here we omit the details.

Chapter 4

213

Theorem 4.3.5. Let u (n) , f (n) ∈ D (N0 , R+ ) , h (n, σ) ∈ D (E, R+ ) and c ≥ 0, p > 1 are real constants and E is defined as in Theorem 4.3.1. (e1 ) Let g, H, H −1 be as in Theorem 1.3.3. If # " n−1 s−1 X X p u (n) ≤ c + h (s, σ) g (u (σ)) , f (s) g (u (s)) + s=0

(4.3.38)

σ=0

for n ∈ N0 , then for 0 ≤ n ≤ n5 ; n, n5 ∈ N0 , 1 u (n) ≤ H −1 [H (c) + F (n)] p ,

(4.3.39)

where F (n) =

n−1 X

" f (s) +

s=0

s−1 X

# h (s, σ) ,

(4.3.40)

σ=0

and n5 ∈ N0 is chosen so that H (c) + F (n) ∈ Dom H −1

for all n ∈ N0 lying in 0 ≤ n ≤ n5 . (e2 ) If p

u (n) ≤ c +

n−1 X

" f (s) u (s) +

s=0

s−1 X

# h (s, σ) u (s) ,

(4.3.41)

σ=0

for n ∈ N0 , then 1 p−1 p−1 p−1 u (n) ≤ c p + F (n) , p

(4.3.42)

for n ∈ N0 , where F (n) is given by (4.3.40). Proof. (e1 ) Let c > 0 and define a function z(n) by the right hand side of 1 (4.3.38). Then z(0) = c, u (n) ≤ {z (n)} p , z(n) is positive and nondecreasing for n ∈ N0 and ∆z (n) = f (n) g (u (n)) +

n−1 X

h (n, σ) g (u (σ))

σ=0

≤ g {z (n)}

1 p

" f (n) +

n−1 X σ=0

# h (n, σ) .

(4.3.43)

214


From (1.3.41) and (4.3.43) we observe that z(n+1) Z

H (z (n + 1)) − H (z (n)) = z(n)

≤

ds 1 g sp

∆z (n) 1 g {z (n)} p

≤ f (n) +

s−1 X

h (n, σ).

(4.3.44)

σ=0

The rest of the proof follows as in the proof of Theorem 4.3.2, part (b1 ) with suitable changes. We omit the details. (e2 ) The proof is similar to that of Theorem 1.3.4. We omit it here to avoid repetition.

4.4 Finite difference inequalities with iterated sums The main concern of this section is to present some finite difference inequalities involving iterated sums, investigated by Pachpatte in [53, 67,73] which can be used as tools in the study of general classes of finite difference and sum-difference equations. Our first theorem deals with the inequalities proved in [53]. Theorem 4.4.1. Let u (n) , f (n) , a (n) ∈ D (N0 , R+ ) , k (n, σ) , ∆1 k (n, σ) ∈ D (E, R+ ) and c ≥ 0 be a real constant, where E = (m, n) ∈ N02 : 0 ≤ n ≤ m 0 for u > 0. If u (n) ≤ c +

n−1 X

k (n, s) g (u (s)) +

s=0

n−1 X

s−1 X

s=0

σ=0

! h (n, s, σ) g (u (σ)) , (4.4.17)

for n ∈ N0 , then for 0 ≤ n ≤ n1 ; n, n1 ∈ N0 , " # n−1 X −1 u (n) ≤ G G (c) + [P (s) + Q (s)] ,

(4.4.18)

s=0

where P (n), Q(n) are given by (4.4.15), (4.4.16), Zr G (r) =

dt , r > 0, g (t)

(4.4.19)

r0

r0 > 0 is arbitrary, G−1 is the inverse of G and n1 ∈ N0 be chosen so that G (c) +

n−1 X

[P (s) + Q (s)] ∈ Dom G−1 ,

s=0

for all n ∈ N0 lying in 0 ≤ n ≤ n1 . Proof. (b1 ) Define a function z(n) by the right hand side of (4.4.13), then z(0) = c and u (n) ≤ z (n). From the hypotheses, we observe that z(n) is nondecreasing for n ∈ N0 and ! n n s−1 X X X ∆z (n) = k (n + 1, s) u (s) + h (n + 1, s, σ) u (σ) s=0

−

n−1 X s=0

k (n, s) u (s) −

s=0 n−1 X

s−1 X

s=0

σ=0

= k (n + 1, n) u (n) +

n−1 X s=0

σ=0

! h (n, s, σ) u (σ)

k (n + 1, s) u (s) −

n−1 X s=0

k (n, s) u (s)

218


+

n−1 X

h (n + 1, n, σ) u (σ) +

σ=0

−

n−1 X

s−1 X

s=0

σ=0

n−1 X

s−1 X

s=0

σ=0

! h (n + 1, s, σ) u (σ)

! h (n, s, σ) u (σ)

= k (n + 1, n) u (n) +

n−1 X

∆1 k (n, s) u (s)

s=0

+

n−1 X

h (n + 1, n, σ)u (σ) +

σ=0

≤ k (n + 1, n) z (n) +

n−1 X

n−1 X

s−1 X

s=0

σ=0

! ∆1 h (n, s, σ) u (σ)

∆1 k (n, s) z (s)

s=0

+

n−1 X

h (n + 1, n, σ)z (σ) +

σ=0

n−1 X

s−1 X

s=0

σ=0

≤ [P (n) + Q (n)] z (n) .

! ∆1 h (n, s, σ) z (σ)

(4.4.20)

Now a suitable application of the Corollary 1.2.2 given in [42, p. 12] to (4.4.20) yields z (n) ≤ c

n−1 Y

[1 + P (s) + Q (s)] .

(4.4.21)

s=0

Using (4.4.21) in u (n) ≤ z (n) we get the required inequality in (4.4.13). (b2 ) Let c > 0 and define a function z(n) by the right hand side of (4.4.17). Then z(0) = c, u (n) ≤ z (n), z(n) is positive and nondecreasing for n ∈ N0 and by following the proof of (b1 ) with suitable modifications we get ∆z (n) ≤ [P (n) + Q (n)] g (z (n)) .

(4.4.22)

The rest of the proof can be completed by following the proof of Theorem 4.2.3, part (b1 ). Here we omit the details. Theorem 4.4.3. Let u(n), k(n, s) , h (n, s, σ), c be as in Theorem 4.4.2 and b (n) ∈ D (N0 , R+ ).

Chapter 4

219

(c1 ) If u (n) ≤ c +

n−1 X

b (s) u (s) +

s=0

+

n−1 X

s−1 τ −1 X X

s=0

τ =0

!

n−1 X

s−1 X

s=0

τ =0

k (s, τ ) u (τ )

!! h (s, τ, σ) u (σ)

,

(4.4.23)

σ=0

for n ∈ N0 , then u (n) ≤ c

n−1 Y

" 1 + b (s) +

s=0

s−1 X

s−1 τ −1 X X

k (s, τ ) +

τ =0

τ =0

!# h (s, τ, σ)

,

(4.4.24)

σ=0

for n ∈ N0 . (c2 ) Let g(u) be as in Theorem 4.4.2, part (b2 ). If u (n) ≤ c +

n−1 X

b (s) g (u (s)) +

s=0

+

n−1 X

s−1 τ −1 X X

s=0

τ =0

n−1 X

s−1 X

s=0

τ =0

! k (s, τ )g (u (τ ))

!! h (s, τ, σ) g (u (σ))

,

(4.4.25)

σ=0

for n ∈ N0 , then for 0 ≤ n ≤ n2 ; n, n2 ∈ N0 , u (n) ≤ G−1 [G (c) !## " n−1 s−1 s−1 τ −1 X X X X k (s, τ ) + h (s, τ, σ) , b (s) + + s=0

τ =0

τ =0

(4.4.26)

σ=0

where G, G−1 are as in Theorem 4.4.2, part (b2 ) and n2 ∈ N0 be chosen so that !# " n−1 s−1 s−1 τ −1 X X X X k (s, τ ) + h (s, τ, σ) ∈ Dom G−1 , b (s) + G (c) + s=0

τ =0

τ =0

σ=0

for all n ∈ N0 lying in 0 ≤ n ≤ n2 . Proof. (c1 ) Define a function z(n) by the right hand side of (4.4.25). Then z(0) = c, u (n) ≤ z (n), z(n) is nondecreasing for n ∈ N0 and ! n−1 n−1 −1 X X τX k (n, τ )u (τ ) + h (n, τ, σ) u (σ) ∆z (n) = b (n) u (n) + τ =0

≤ b (n) z (n) +

n−1 X τ =0

k (n, τ )z (τ ) +

τ =0 n−1 X

τ −1 X

τ =0

σ=0

σ=0

! h (n, τ, σ) z (σ)

220

Finite difference inequalities in one variable " ≤ b (n) +

n−1 X

k (n, τ ) +

τ =0

n−1 X

τ −1 X

τ =0

σ=0

!# h (n, τ, σ)

z (n) .

(4.4.27)

Now a suitable application of Corollary 1.2.2 given in [42, p. 12] to (4.4.27) yields !# " n−1 s−1 s−1 τ −1 Y X X X k (s, τ ) + h (s, τ, σ) . (4.4.28) 1 + b (s) + z (n) ≤ c s=0

τ =0

τ =0

σ=0

Using (4.4.28) in u (n) ≤ z (n) we get the desired inequality in (4.4.24). (c2 ) The proof can be completed by following the proof of (c1 ) and closely looking at the proof of Theorem 4.4.2, part (b2 ). Here we omit the details. Remark 4.4.2. We note that the inequalities in Theorems 4.4.2 and 4.4.3 parts (b1 ) and (c1 ) provides the growth estimates on the discrete versions of the integral inequalities due to Bykov and Salpagarov [9] given in Theorem 1.4.2, while the inequalities in (b2 ) and (c2 ) provides the growth estimates on the general versions of the inequalities given in [9], which can be used conveniently in certain applications. The inequalities established in [73] are embodied in the following theorems. In what follows, let Ji = (n1 , ..., ni ) : (n1 , ..., ni ) ∈ N0i for i = 1, ..., m . For any functions w (n) ∈ D (N0 , R+ ) , ki (n1 , ..., ni ) ∈ D (Ji , R+ ) for i = 1, ..., m; first we give the following notations used to simplify the details of presentation: ! ! ni−1 −1 n−1 1 −1 X nX X Bi [w] (n) = ... ki (n1 , ..., ni ) ... , n1 =0

n2 =0

G [w] (n) = k1 (n) w (n)+

n−1 X

ni =0

k2 (n, n2 ) w (n2 ) +

n2 =0

+... +

n−1 X

nX 2 −1

n2 =0

n3 =0

nm−1 −1

...

X

n−1 X

nX 2 −1

n2 =0

n3 =0

! k3 (n, n2 , n3 ) w (n3 ) ! !

km (n, n2 , ..., nm ) w (nm ) ... .

nm =0

Theorem 4.4.4. Let u (n) , a (n) ∈ D (N0 , R+ ) , ki (n1 , ..., ni ) ∈ D (Ji , R+ ) for i = 1, ..., m and c ≥ 0 is a real constant. (d1 ) If u (n) ≤ c +

m X i=1

Bi [u] (n) ,

(4.4.29)

Chapter 4

221

for n ∈ N0 , then u (n) ≤ c

n−1 Y

[1 + G [1] (n1 )],

(4.4.30)

n1 =0

for n ∈ N0 . (d2 ) Let a(n) be nondecreasing for n ∈ N0 . If u (n) ≤ a (n) +

m X

Bi [u] (n) ,

(4.4.31)

i=1

for n ∈ N0 , then n−1 Y

u (n) ≤ a (n)

[1 + G [1] (n1 )],

(4.4.32)

n1 =0

for n ∈ N0 . Proof. (d1 ) Define a function z(n) by the right hand side of (4.4.29) i.e., ! n−1 n−1 1 −1 X X nX k1 (n1 ) u (n1 ) + k2 (n1 , n2 ) u (n2 ) z (n) = c + n1 =0

+

+

n1 =0

n−1 X

nX 1 −1

nX 2 −1

n1 =0

n2 =0

n3 =0

n−1 X

nX 1 −1

nX 2 −1

n1 =0

n2 =0

n3 =0

n2 =0

!! k3 (n1 , n2 , n3 ) u (n3 )

+ ...

nm−1 −1

X

...

! !! km (n1 , n2 , n3 , ..., nm ) u (nm ) ...

.

nm =0

Then z(0) = c, u (n) ≤ z (n), z(n) is nondecreasing for n ∈ N0 and ∆z (n) = k1 (n) u (n)+

n−1 X

k2 (n, n2 ) u (n2 ) +

n2 =0

+... +

n−1 X

nX 2 −1

n2 =0

n3 =0

" ≤ k1 (n) +

n−1 X

+... +

n2 =0

n3 =0

n2 =0

n3 =0

! k3 (n, n2 , n3 ) u (n3 )

...

! !

X

km (n, n2 , n3 , ..., nm ) u (nm ) ...

nm =0 n−1 X

nX 2 −1

n2 =0

n3 =0

k2 (n, n2 ) +

nX 2 −1

nX 2 −1

nm−1 −1

n2 =0 n−1 X

n−1 X

nm−1 −1

...

X nm =0

! k3 (n, n2 , n3 ) ! !#

km (n, n2 , n3 , ..., nm ) ...

z (n)

222


i.e., ∆z (n) ≤ G [1] (n) z (n) .

(4.4.33)

Now a suitable application of Theorem 1.2.1 given in [42] to (4.4.33) yields z (n) ≤ c

n−1 Y

[1 + G [1] (n1 )] .

(4.4.34)

n1 =0

Using (4.4.34) in u (n) ≤ z (n) we get the desired inequality in (4.4.30). (d2 ) The proof can be completed by closely looking at the proof of Theorem 1.2.4 given in [42] and by making use of the inequality established in (d1 ) . We omit the details. Theorem 4.4.5. 4.4.4.

Let u(n), ki (n1 , ..., ni ) for i = 1, ..., m be as in Theorem

(e1 ) Let φ (n) ∈ D (N0 , R+ ) and ∆φ (n) ≥ 0 for n ∈ N0 . If u (n) ≤ φ (n) +

m X

Bi [u] (n) ,

(4.4.35)

i=1

for n ∈ N0 , then u (n) ≤ φ (0)

n−1 Y

[1 + G [1] (n1 )]+

n1 =0

n−1 X

∆φ (n1 )

n1 =0

n−1 Y

[1 + G [1] (σ)], (4.4.36)

σ=n1 +1

for n ∈ N0 . (e2 ) Let a (n) , b (n) ∈ D (N0 , R+ ). If u (n) ≤ a (n) + b (n)

m X

Bi [u] (n) ,

(4.4.37)

n1 =0

for n ∈ N0 , then u (n) ≤ a (n) + b (n)

n−1 X n1 =0

for n ∈ N0 .

G [a] (n1 )

n−1 Y σ=n1 +1

[1 + G [b] (σ)],

(4.4.38)

Chapter 4

223

Proof. (e1 ) From the hypotheses on φ (n) we observe that φ (n) is nondecreasing for n ∈ N0 . Define a function z(n) by the right hand side of (4.4.35). Then z (0) = φ (0), u (n) ≤ z (n), z (n) is nondecreasing for n ∈ N0 and as in the proof of Theorem 4.4.4, part (d1 ) we have ∆z (n) ≤ ∆φ (n) + G [1] (n) z (n) .

(4.4.39)

Now a suitable application of Theorem 1.2.1 given in [42] to (4.4.39) yields z (n) ≤ φ (0)

n−1 Y

[1 + G [1] (n1 )]+

n1 =0

n−1 X

∆φ (n1 )

n1 =0

n−1 Y

[1 + G [1] (σ)]. (4.4.40)

σ=n1 +1

Using (4.4.40) in u (n) ≤ z (n) we get the required inequality in (4.4.36). (e2 ) Define a function z(n) by z (n) =

m X

Bi [u] (n) .

(4.4.41)

i=0

Then as in the proof of Theorem 4.4.4, part (d1 ), z(0) = 0, z(n) is nondecreasing for n ∈ N0 ; (4.4.37) can be restated as u (n) ≤ a (n) + b (n) z (n) ,

(4.4.42)

and ∆z (n) = k1 (n) u (n)+

n−1 X

k2 (n, n2 ) u (n2 ) +

n2 =0

+... +

n−1 X

nX 2 −1

n2 =0

n3 =0

n−1 X

nX 2 −1

n2 =0

n3 =0

nm−1 −1

...

X

! k3 (n, n2 , n3 ) u (n3 ) ! !

km (n, n2 , n3 , ..., nm ) u (nm ) ...

nm =0

≤ G [a] (n) + G [b] (n) z (n) .

(4.4.43)

Now an application of Theorem 1.2.1 given in [42] to (4.4.43) yields z (n) ≤

n−1 X n1 =0

G [a] (n1 )

n−1 Y

[1 + G [b] (σ)].

(4.4.44)

σ=n1 +1

Using (4.4.44) in (4.4.42) we get the required inequality in (4.4.38). Remark 4.4.3. The inequalities in Theorem 4.4.4 and 4.4.5 are motivated by the integral inequalities established by various investigators and given in [3, pp. 100-108]. For some useful singular finite difference inequalities, we refer the ˇ [27] and some of the references interested readers to the recent paper by Medved cited therein.

224


4.5 Bounds on certain finite difference inequalities The main goal of this section is to present some specific type of finite difference ineualities investigated by Pachpatte in [37,39,44,54,70,75]. The inequalities given here can be used in the analysis of certain finite difference and sumdifference equations. Our first theorem deals with the finite difference inequalities proved in [70]. Theorem 4.5.1.

Let u (n) , a (n) , b (n) , c (n) , f (n) , g (n) ∈ D (Nα,β , R+ ) .

(a1 ) Suppose that ∆a (n) ≥ 0 for n ∈ Nα,β and u (n) ≤ a (n) +

n−1 X

b (s) u (s) +

s=α

β X

c (s) u (s) ,

(4.5.1)

s=α

for n ∈ Nα,β . If q1 =

β X

c (s)

s=α

s−1 Y

[1 + b (τ )] < 1,

(4.5.2)

τ =α

then u (n) ≤ N1

n−1 Y

[1 + b (s)] +

s=α

n−1 X

∆a (s)

s=α

n−1 Y

[1 + b (σ)] ,

(4.5.3)

σ=s+1

for n ∈ Nα,β , where # " β s−1 s−1 X X Y 1 N1 = c (s) ∆a (τ ) [1 + b (σ)] . a (α) + 1 − q1 s=α τ =α σ=τ +1

(4.5.4)

(a2 ) Suppose that u (n) ≤ a (n) + b (n)

n−1 X

f (s) u (s) +

s=α

β X

g (s) u (s) ,

(4.5.5)

s=α


β X s=α

g (s) L2 (s) < 1,

(4.5.6)

Chapter 4

225

then u (n) ≤ L1 (n) + N2 L2 (n) ,

(4.5.7)

for n ∈ Nα,β , where L1 (n) = a (n) + b (n)

n−1 X

f (s) a (s)

s=α

L2 (n) = c (n) + b (n)

n−1 X

n−1 Y

[1 + f (σ) b (σ)],

(4.5.8)

[1 + f (σ) b (σ)],

(4.5.9)

σ=s+1

f (s) c (s)

s=α

n−1 Y σ=s+1

and β 1 X g (s) L1 (s) . N2 = 1 − q2 s=α

(4.5.10)

2 , R+ for α ≤ s ≤ n ≤ β and (a3 ) Let r (n, s) , ∆r (n, s) ∈ D Nα,β u (n) ≤ a (n) +

n−1 X

r (n, s) u (s) +

s=α

β X

c (s) u (s) ,

(4.5.11)

s=α


β X s=α

c (s)

s−1 Y

¯ (τ ) < 1, 1+B

(4.5.12)

τ =α

then u (n) ≤ a (n) + N3

n−1 Y

n−1 X Y n−1 ¯ (s) + ¯ (σ) , (4.5.13) 1+B 1+B A¯ (s)

s=α

s=α

σ=s+1

for n ∈ Nα,β , where A¯ (n) = r (n + 1, n) a (n) +

n−1 X

∆1 r (n, s) a (s) ,

(4.5.14)

s=α

¯ (n) = r (n + 1, n) + B

n−1 X

∆1 r (n, s) ,

(4.5.15)

s=α

and " # β s−1 s−1 X Y 1 X ¯ (σ) . c (s) a (s) + 1+B N3 = A¯ (τ ) 1 − q3 s=α τ =α σ=τ +1

(4.5.16)

226


(a1 ) Define a function z(n) by the right hand side of (4.5.1). Then u (n) ≤ z (n), z (α) = a (α) +

β X

c (s) u (s) ,

(4.5.17)

s=α

and ∆z (n) = ∆a (n) + b (n) u (n) ≤ ∆a (n) + b (n) z (n) .

(4.5.18)

Now a suitable applicarion of Theorem 1.2.1 given in [42] to (4.5.18) and using the fact that u (n) ≤ z (n) we have u (n) ≤ z (α)

n−1 Y

[1 + b (s)] +

s=α

n−1 X s=α

n−1 Y

∆a (s)

[1 + b (σ)].

(4.5.19)

σ=s+1

From (4.5.17),(4.5.19) and in view of (4.5.2) we have z (α) ≤ N1 .

(4.4.20)

Using (4.5.20) in (4.5.19) we get the required inequality in (4.5.3). The proofs of (a2 ) and (a3 ) follows by closely looking at the proof of (a1 ) and the proofs of Theorem 1.5.1, part (a2 ) and Theorem 1.5.2, part (b1 ) . Here we omit the details. Remark 4.5.1. By taking c(n) = 0 in (a1 ) and Nα,β is replaced by N0 , we get the inequality given in Theorem 1.2.6 in [42]. The inequalities in (a2 ) and (a3 ) can be considered as the useful variants of the inequalities in Theorems 1.2.3 and 1.3.4 given in [42]. The next theorem contains the inequalities investigated in [54,75]. Theorem 4.5.2.

Let u (n) ∈ D (Nα,β , R+ ) and k ≥ 0 be a real constant.

(b1 ) Let a (n, s) , b (n, s) , c (n, s) ∈ Dn(E, R+ ) ; a(n, s), b(n, s) be nondecreaso 2 : α ≤ s ≤ n ≤ β and ing in n for each s ∈ Nα,β where E = (n, s) ∈ Nα,β u (n) ≤ k +

n−1 X

" a (n, s) u (s) +

s=α

s−1 X

# c (s, σ) u (σ) +

σ=α

β X

b (n, s) u (s) , (4.5.21)

s=α

for n ∈ Nα,β . If q (n) =

β X s=α

b (n, s)

n−1 Y ξ=α

[1 + B (n, ξ)] < 1,

(4.5.22)

Chapter 4

227

for n ∈ Nα,β , where " B (n, ξ) = a (n, ξ) 1 +

ξ−1 X

# c (ξ, σ) ,

(4.5.23)

σ=α

for (n, ξ) ∈ E, then u (n) ≤

n−1 Y k [1 + B (n, ξ)], 1 − q (n)

(4.5.24)

ξ=α

for n ∈ Nα,β . (b2 ) Let f (n) , g (n) , h (n) ∈ D (Nα,β , R+ ) and u (n) ≤ k +

n−1 X

" f (s) u (s) +

s=α

s−1 X

g (σ) u (σ) +

σ=α

β X

# h (σ) u (σ) ,

(4.5.25)

σ=α

for n ∈ Nα,β . If r=

β X

h (σ)

σ=α

σ−1 Y

[1 + f (τ ) + g (τ )] < 1,

(4.5.26)

τ =α

then u (n) ≤

n−1 k Y [1 + f (s) + g (s)], 1 − r s=α

(4.5.27)

for n ∈ Nα,β . Proof.

(b1 ) Fix any m ∈ Nα,β , then for α ≤ n ≤ m, from (4.5.21) we have

u (n) ≤ k+

n−1 X

" a (m, s) u (s) +

s=α

s−1 X

β X

# c (m, σ) u (σ) +

σ=α

b (m, s) u (s). (4.5.28)

s=α

Define a function z(n, m), α ≤ n ≤ m by the right hand side of (4.5.28). Then for α ≤ n ≤ m, u (n) ≤ z (n, m) , z(n, m) is nondecreasing in n, z (α, m) = k +

β X

b (m, s) u (s),

(4.5.29)

s=α

and " ∆1 z (n, m) = a (m, n) u (n) +

n−1 X σ=α

# c (n, σ) u (σ)

228

Finite difference inequalities in one variable " ≤ a (m, n) 1 +

n−1 X

# c (n, σ) z (n, m) ,

σ=α

i.e., "

"

z (n + 1, m) ≤ 1 + a (m, n) 1 +

##

n−1 X

c (n, σ)

z (n, m) ,

(4.5.30)

σ=α

for α ≤ n ≤ m. By setting n = ξ in (4.5.30) and subsituting ξ = α, α+1, ..., m−1 successively, we obtain ## " " ξ−1 m−1 Y X z (m, m) ≤ z (α, m) c (ξ, σ) . (4.5.31]) 1 + a (m, ξ) 1 + σ=α

ξ=α

Since m is arbitrary, from (4.5.31) and (4.5.29) with m replaced by n and using u (n) ≤ z (n, n) we have ## " " ξ−1 n−1 Y X c (ξ, σ) , (4.5.32) 1 + a (n, ξ) 1 + u (n) ≤ z (α, n) σ=α

ξ=α

where z (α, n) = k +

β X

b (n, s) u (s),

(4.5.33)

s=α

Using (4.5.32) on the right hand side of (4.5.33) and in view of (4.5.22) it is easy to observe that z (α, n) ≤

k . 1 − q (n)

(4.5.34)

Using (4.5.34) in (4.5.32) and (4.5.23) we get (4.5.24). (b2 ) Define a function z(n) by the right hand side of (4.5.25). Then z (α) = k,, u (n) ≤ z (n) and # " β n−1 X X g (σ) u (σ) + h (σ) u (σ) , ∆z (n) = f (n) u (n) + σ=α

" ≤ f (n) z (n) +

n−1 X

σ=α

g (σ) z (σ) +

σ=α

β X

# h (σ) z (σ) ,

σ=α

for n ∈ Nα,β . Define a function v(n) by v (n) = z (n) +

n−1 X σ=α

g (σ) z (σ) +

β X σ=α

h (σ) z (σ).

(4.5.35)

Chapter 4

229

Then z (n) ≤ v (n) , ∆z (n) ≤ f (n) v (n) , v (α) = k +

β X

h (σ) z (σ),

(4.5.36)

σ=α

and ∆v (n) = ∆z (n) + g (n) z (n) ≤ [f (n) + g (n)] v (n) .

(4.5.37)

Now a suitable application of Theorem 1.2.1 given in [42] to (4.5.37) yields v (n) ≤ v (α)

n−1 Y

[1 + f (s) + g (s)] .

(4.5.38)

s=α

Using (4.5.38) in z (n) ≤ v (n) we get z (n) ≤ v (α)

n−1 Y

[1 + f (s) + g (s)] ,

(4.5.39)

s=α

for n ∈ Nα,β . Using (4.5.39) on the right hand side of (4.5.36) and in view of (4.5.26) we observe that v (α) ≤

k . 1−r

(4.5.40)

Using (4.5.40) in (4.5.39) and the fact that u (n) ≤ z (n) we get the required inequality in (4.5.27). Remark 4.5.2. We note that, if we take in Theorem 4.5.2, part (b1 ), c(n, s) = 0, then we get the inequality established in [52, Theorem 2]. Furthermore, in the various special cases of Theorem 4.5.2, we get new inequalities which can be used conveniently in certain situations. In the following theorem, we present some of the inequalities established in [39,44]. Theorem 4.5.3.

Let u (n) , a (n) , b (n) ∈ D (N0 , R+ ) .

(c1 ) Let a(n) be nonincreasing for n ∈ N0 . If u (n) ≤ a (n) +

∞ X

b (s) u (s) ,

(4.5.41)

s=n+1

for n ∈ N0 , then u (n) ≤ a (n)

∞ Y s=n+1

for n ∈ N0 .

[1 + b (s)] ,

(4.5.42)

230


(c2 ) Let c (n) ∈ D (N0 , R+ ) . If u (n) ≤ a (n) + b (n)

∞ X

c (s) u (s) ,

(4.5.43)

s=n+1

for n ∈ N0 , then ∞ Y

u (n) ≤ a (n) + b (n) d (n)

[1 + c (s) b (s)],

(4.5.44)

s=n+1

for n ∈ N0 , where d (n) =

∞ X

c (s) a (s) ,

(4.5.45)

s=n+1

for n ∈ N0 . (c3 ) Let L : N0 × R+ → R+ be a function which satisfies the condition 0 ≤ L (n, u) − L (n, v) ≤ M (n, v) (u − v) ,

(4.5.46)

for n ∈ N0 , u ≥ v ≥ 0, where M : N0 × R+ → R+ . If u (n) ≤ a (n) + b (n)

∞ X

L (s, u (s)) ,

(4.5.47)

s=n+1

for n ∈ N0 , then u (n) ≤ a (n) + b (n) e (n)

∞ Y

[1 + M (s, a (s)) b (s)],

(4.5.48)

s=n+1

for n ∈ N0 , where e (n) =

∞ X

L (s, a (s)) ,

(4.5.49)

s=n+1

for n ∈ N0 Proof. that

(c1 ) Let a(n) > 0 for n ∈ N0 , then from (4.5.41) it is easy to observe

∞ X u (n) u (s) ≤1+ . b (s) a (n) a (s) s=n+1

Define a function z(n) by the right hand side of (4.5.50), then z (n) − z (n + 1) = b (n + 1)

u (n + 1) a (n + 1)

(4.5.50) u(n) a(n)

≤ z (n) and

Chapter 4 ≤ b (n + 1) z (n + 1) .

231 (4.5.51)

From (4.5.51) we observe that z (n) ≤ [1 + b (n + 1)] z (n + 1) .

(4.5.52)

By setting n = s in (4.5.52) and then substituting s = n, n + 1, ..., m − 1 (m ≥ n + 1 is arbitrary in N0 ) successively, we obtain the estimate m Y

z (n) ≤ z (m)

[1 + b (s)] .

(4.5.53)

s=n+1

Noting that

z (n) ≤

lim z (m) = 1 and by letting m → ∞ in (4.5.53) we get m→∞ ∞ Y

[1 + b (s)] .

(4.5.54)

s=n+1

Using (4.5.54) in u(n) a(n) ≤ z (n) we get the desired inequality in (4.5.42). The proof of the case when a (n) ≥ 0 can be completed as mentioned in the proof of Theorem 4.2.3, part (b1 ). (c2 ) Define a function z(n) by z (n) =

∞ X

c (s) u (s) ,

(4.5.55)

s=n+1

for n ∈ N0 Then (4.5.43) can be written as u (n) ≤ a (n) + b (n) z (n) .

(4.5.56)

From (4.5.55) and (4.5.56) we have z (n) ≤ d (n) +

∞ X

c (s) b (s) z (s) ,

(4.5.57)

s=n+1

where d(n) is given by (4.5.45). Clearly d(n) is real-valued, nonnegative and nonincreasing function for n ∈ N0 . Now a suitable application of the inequality in part (c1 ) to (4.5.57) yields z (n) ≤ d (n)

∞ Y

[1 + c (s) b (s)] .

s=n+1

Using (4.5.58) in (4.5.56) we get the required inequality in (4.5.44).

(4.5.58)

232


(c3 ) Define a function z(n) by z (n) =

∞ X

L (s, u (s)) ,

(4.5.59)

s=n+1

then from (4.4.47) we have u (n) ≤ a (n) + b (n) z (n) .

(4.5.60)

From (4.5.59), (4.5.60) and the hypotheses on L, we observe that z (n) ≤

∞ X

[L (s, a (s) + b (s) z (s)) − L (s, a (s)) + L (s, a (s))]

s=n+1 ∞ X

≤ e (n) +

M (s, a (s)) b (s) z (s) ,

(4.5.61)

s=n+1

where e(n) is given by (4.5.49). Clearly e(n) is real-valued, nonnegative and nonincreasing function for n ∈ N0 . Now an application of the inequality in part (c1 ) to (4.5.61) yields z (n) ≤ e (n)

∞ Y

[1 + M (s, a (s)) b (s)] .

(4.5.62)

s=n+1

The desired inequality in (4.5.48) follows from (4.5.60) and (4.5.62). Our last theorem in this section gives the inequalities proved in [37]. Theorem 4.5.4. constant.

Let u (n) , a (n) , b (n) ∈ D (N0 , R+ ) and p > 1 be a real

(d1 ) Let f (n) , g (n) ∈ D (N0 , R+ ). If up (n) ≤ a (n) + b (n)

∞ X

[f (s) u (s) + g (s)] ,

(4.5.63)

s=n+1

for n ∈ N0 , then "

# p1 ∞ Y b (s) f (s) , 1+ u (n) ≤ a (n) + b (n) A (n) p s=n+1

(4.5.64)

for n ∈ N0 , where ∞ X p − 1 a (s) A (n) = + + g (s) , f (s) p p s=n+1 for n ∈ N0 .

(4.5.65)

Chapter 4

233

(d2 ) Let L, M be as in Theorem 4.5.3, part (c3 ) and the condition (4.5.46) holds. If up (n) ≤ a (n) + b (n)

∞ X

L (s, u (s)) ,

(4.5.66)

s=n+1

for n ∈ N0 , then u (n) ≤ [a (n) + b (n) B (n) # p1 ∞ Y p − 1 a (s) b (s) + , 1 + M s, × p p p s=n+1

(4.5.67)

for n ∈ N0 , where ∞ X

p − 1 a (s) + L s, B (n) = p p s=n+1

,

(4.5.68)

for n ∈ N0 . Proof. (d1 ) Define a function z(n) by z (n) =

∞ X

[f (s) u (s) + g (s)] ,

(4.5.69)

s=n+1

for n ∈ N0 . Then (4.5.63) can be written as up (n) ≤ a (n) + b (n) z (n) .

(4.5.70)

From (4.5.70) as in the proof of Theorem 1.3.1, part (a1 ) we obtain u (n) ≤

p − 1 a (n) b (n) + + z (n) . p p p

(4.5.71)

From (4.5.69) and (4.5.71) we have ∞ X p − 1 a (s) b (s) z (n) ≤ + + z (s) + g (s) f (s) p p p s=n+1 = A (n) +

∞ X s=n+1

f (s)

b (s) z (s) , p

(4.5.72)

where A(n) is given by (4.5.65). Clearly A(n) is real-valued, nonnegative and nonincreasing function for n ∈ N0 . Now an application of Theorem 4.5.3, part (c3 ) to (4.5.72) yields ∞ Y b (s) z (n) ≤ A (n) . (4.5.73) 1 + f (s) p s=n+1 The desired inequality in (4.5.64) follows from (4.5.70) and (4.5.73).

234


(d2 ) The proof can be completed by closely looking at the proof of (d1 ) and the proof of Theorem 4.5.3, part (c3 ). We omit the details.

4.6 Applications The inequalities given in earlier sections are recently investigated and used in various contexts. In this section we present applications of some of the inequalities to study basic properties of solutions of certain finite difference and sum-difference equations, which we hope will be a source for future work.

4.6.1 Perturbed difference equations Consider a system of finite difference equations x (n + 1) = A (n) x (n) + f (n, x (n)) + r (n) , x (0) = x0 ,

(4.6.1)

as a perturbation of the linear system y (n + 1) = A (n) y (n) , y (0) = x0

(4.6.2)

where n ∈ N0 , x, y, f, r are the elements of Rm , the m dimensional Euclidean space, A(n) is an m × m matrix with det A (n) 6= 0, the functions r and f are defined on N0 and N0 × Rm respectively and x0 is a given vector in Rm . The symbol |.| will denote some convenient norm on Rm as well as a corresponding consistent matrix norm. We denote by Y (n) the fundamental solution matrix of the system (4.6.2) such that Y (0) = I, the identity matrix. It is known that the solution x(n) of (4.6.1) is equivalent to the sum-difference equation (see [42, p. 55]) x (n) = Y (n) Y −1 (0) x0 +

n−1 X

Y (n) Y −1 (s + 1) {f (s, x (s)) + r (s)} . (4.6.3)

s=0

We assume that the fundamental solution matrix Y (n) of (4.6.2) satisfies Y (n) Y −1 (s) ≤ M, 0 ≤ s ≤ n; s, n ∈ N0 ,

(4.6.4)

where M is a positive constant. The following theorems illustrate the applications of Theorem 4.2.1 (see [57]).

Chapter 4

235

Theorem 4.6.1. Suppose that the function f in (4.6.1) satisfies |f (n, x)| ≤ p (n) |x| ,

(4.6.5)

for n ∈ N0 , x ∈ Rm , where p (n) ∈ D (N0 , R+ ).If x(n) is any solution of equation (4.6.1) for n ∈ N0 , then ) ( n−1 n−1 X Y (|r (s)| + |x0 | M p (s)) [1 + M p (σ)] , (4.6.6) |x (n)| ≤ M |x0 | + s=0

σ=s+1

for n ∈ N0 , where M is given as in (4.6.4). Proof. By using the variation of constants formula any solution x(n) of (4.6.1) is represented by (4.6.3). Using (4.6.4), (4.6.5) in (4.6.3) we obtain ! n−1 n−1 X X |r (s)| + p (s) |x (s)| . (4.6.7) |x (n)| ≤ M |x0 | + M s=0

s=0

Now a suitable application of Theorem 4.2.1 to (4.6.7) yields the required estimation in (4.6.6). Theorem 4.6.2.

Suppose that the function f in (4.6.1) satisfies

|f (n, x) − f (n, y)| ≤ p (n) |x − y| ,

(4.6.8)

for n ∈ N0 , x, y ∈ Rm , where p (n) ∈ D (N0 , R+ ). Then the equation (4.6.1) has at most one solution on N0 . Proof.

Let x1 (n) and x2 (n) be two solutions of (4.6.1) on N0 , then we have

x1 (n) − x2 (n) =

n−1 X

Y (n) Y −1 (s + 1) {f (s, x1 (s)) − f (s, x2 (s))}. (4.6.9)

s=0

From (4.6.9), (4.6.4), (4.6.8) we obtain |x1 (n) − x2 (n)| ≤

n−1 X

Y (n) Y −1 (s + 1) |f (s, x1 (s)) − f (s, x2 (s))|

s=0

≤M

n−1 X

p (s) |x1 (s) − x2 (s)|.

(4.6.10)

s=0

By a suitable application of Theorem 4.2.1 to (4.6.10) we have |x1 (n) − x2 (n)| ≤ 0.Therefore x1 (n) = x2 (n) i.e., there is at most one solution of the equation (4.6.1) on N0 .

236


4.6.2 Volterra type difference equations involving iterated sums In this section we present applications of the inequality in Theorem 4.4.2, part (b1 ) (see [67]) to study certain properties of solutions of nonlinear sum-difference equation of the form ! n−1 n−1 s−1 X X X y (n) = f (n) + F (n, s, y (s)) + H (n, s, σ, y (σ)) , (4.6.11) s=0

s=0

σ=0

function, f ∈ D (N0 , R) ; for n ∈ N0 , where y (n) ∈ D (N0 , R) is an unknown = (n, s) ∈ N02 : 0 ≤ s ≤ n < ∞ , F : E1×R → R, H : E2 ×R → R in which E 1 E2 = (n, s, σ) ∈ N03 : 0 ≤ σ ≤ s ≤ n < ∞ . Theorem 4.6.3. Suppose that the functions f, F, H in equation (4.6.11) satisfy the conditions |f (n)| ≤ c,

(4.6.12)

|F (n, s, y)| ≤ k (n, s) |y| ,

(4.6.13)

|H (n, s, σ, y)| ≤ h (n, s, σ) |y| ,

(4.6.14)

where c ≥ 0 is a real constant and k (n, s) ∈ D (E1 , R+ ) , h (n, s, σ) ∈ D (E2 , R+ ) . If y(n) is any solution of equation (4.6.11) on N0 , then |y (n)| ≤ c

n−1 Y

[1 + P (s) + Q (s)] ,

(4.6.15)

s=0

where P (n), Q(n) are given by (4.4.15), (4.4.16) in which ∆1 k (n, s) ∈ D (E1 , R+ ) , ∆1 h (n, s, σ) ∈ D (E2 , R+ ) . Proof. Let y(n) be a solution of equation (4.6.11). Using (4.6.12)-(4.6.14) in (4.6.11) we have ! n−1 n−1 s−1 X X X |y (n)| ≤ c + k (n, s) |y (s)| + h (n, s, σ) |y (σ)| . (4.6.16) s=0

s=0

σ=0

Now an application of Theorem 4.4.2, part (b1 ) to (4.6.16) yields the required estimate in (4.6.15). Theorem 4.6.4. Suppose that the functions F, H in equation (4.6.11) satisfy the conditions |F (n, s, y) − F (n, s, y¯)| ≤ k (n, s) |y − y¯| ,

(4.6.17)

|H (n, s, σ, y) − H (n, s, σ, y¯)| ≤ h (n, s, σ) |y − y¯| ,

(4.6.18)

where k(n, s), h (n, s, σ) are as in Theorem 4.6.3. Let P (n), Q(n) be as in Theorem 4.6.3. Then the equation (4.6.11) has at most one solution on N0 .

Chapter 4

237

Proof. Let u(n) and v(n) be two solutions of equation (4.6.11) on N0 . Using this fact and the conditions (4.6.17), (4.6.18) we have |u (n) − v (n)| ≤

n−1 X

k (n, s) |u (s) − v (s)|

s=0

+

n−1 X

s−1 X

s=0

σ=0

! h (n, s, σ) |u (σ) − v (σ)| .

(4.6.19)

Now a suitable application of Theorem 4.4.2, part (b1 ) (when c = 0) to (4.6.19) yields u(n) = v(n) i.e., there is at most one solution of equation (4.6.11) on N0

4.6.3 Volterra-Fredholm type sum-difference equa tions In this section we present applications of the inequality in Theorem 4.5.1, part (a2 ) to study certain properties of solutions of Volterra-Fredholm type sum-difference equation of the form z (n) = e (n) +

n−1 X

F (n, s, z (s)) +

s=α

β X

G (n, s, z (s)),

(4.6.20)

s=α

for n ∈ Nα,β , where z (n) ∈ D (Nα,β , R) isnan unknown function, e (n) o∈ 2 D (Nα,β , R); F, G : E × R → R in which E = (n, s) ∈ Nα,β :α≤s≤n≤β , see [70]. Theorem 4.6.5. Suppose that the functions e, F, G in equation (4.6.20) satisfy the conditions |e (n)| ≤ a (n) ,

(4.6.21)

|F (n, s, z)| ≤ b (n) f (s) |z| ,

(4.6.22)

|G (n, s, z)| ≤ c (n) g (s) |z| ,

(4.6.23)

where a (n) , b (n) , c (n) , f (n) , g (n) ∈ D (Nα,β , R+ ) . Let q2 be as in (4.5.6), Theorem 4.5.1, part (a2 ).If z(n) is a solution of equation (4.6.20) on Nα,β , then |z (n)| ≤ L1 (n) + N2 L2 (n) ,

(4.6.24)

for n ∈ Nα,β ,where L1 (n), L2 (n), N2 are as in Theorem 4.5.1, part (a2 )

238


Proof. Let z(n) be a solution of equation (4.6.20) on Nα,β . Using the fact that z(n) is a solution of equation (4.6.20) and (4.6.21)-(4.6.23) we have |z (n)| ≤ a (n) + b (n)

n−1 X

f (s) |z (s)| + c (n)

s=α

β X

g (s) |z (s)| .

(4.6.25)

s=α

Now an application of the inequality in Theorem 4.5.1, part (a2 ) to (4.6.25) yields the required estimate in (4.6.24). Theorem 4.6.6. the conditions

Suppose that the funcrions F, G in equation (4.6.20) satisfy

|F (n, s, z) − F (n, s, z¯)| ≤ b (n) f (s) |z − z¯| ,

(4.6.26)

|G (n, s, z) − G (n, s, z¯)| ≤ c (n) g (s) |z − z¯| ,

(4.6.27)

where b (n) , c (n) , f (n) , g (n) ∈ D (Nα,β , R+ ) . Let q2 , L1 (n) , L2 (n) , N2 be as in Theorem 4.5.1, part (a2 ) . Then the equation (4.6.20) has at most one solution on Nα,β . Proof. Let u(n) and v(n) be two solutions of equation (4.6.20) on Nα,β .Using the facts that u(n) and v(n) are the solutions of equation (4.6.20) and (4.6.26), (4.6.27) we have

|u (n) − v (n)| ≤ b (n)

n−1 X

f (s) |u (s) − v (s)| + c (n)

s=α

β X

g (s) |u (s) − v (s)|.

s=α

(4.6.28) Now an application of the inequality given in Theorem 4.5.1, part (a2 ) (with a(n) = 0 which in fact implies L1 (n) = 0, N2 = 0 ) to (4.6.28) yields u(n) = v(n) i.e., there is at most one solution of equation (4.6.20) on Nα,β .

4.6.4 Fredholm type sum-difference equations In this section we present applications given in [75] of the special version of the inequality in Theorem 4.5.2, part (b2 ) to study the properties of solutions of the Fredholm type sum-difference equation ! β X ∆x (n) = F n, x (n) , k (n, σ, x (σ)) , (4.6.29) σ=α

with the given initial condition x (α) = x0

(4.6.30)

Chapter 4

239

where x, k, F are the elements of Rm an m-dimensional Euclidean space with normn|.| and k : E × Rm → Rm ,oF : Nα,β × Rm × Rm → Rm , in which 2 E = (n, s) ∈ Nα,β :α≤s≤n≤β . Theorem 4.6.7. Assume that |k (n, s, x)| ≤ e (n) h (s) |x| ,

(4.6.31)

|F (n, x, y)| ≤ f (n) (|x| + |y|) ,

(4.6.32)

where e (n) , h (n) , f (n) ∈ D (Nα,β , R+ ) and e (n) ≥ 1. Let r0 =

β X

h (σ)

σ=α

σ−1 Y

[1 + e (τ ) f (τ )] < 1.

(4.6.33)

τ =α

If x(n) is any solution of (4.6.29)-(4.6.30), then n−1 |x0 | Y |x (n)| ≤ [1 + e (s) f (s)] , 1 − r0 s=α

(4.6.34)

for n ∈ Nα,β . Proof. The solution x(n) of (4.6.29)-(4.6.30) satisfies the following equivalent sum-difference equation ! β n−1 X X x (n) = x0 + F s, x (s) , k (s, σ, x (σ)) . (3.6.35)) s=α

σ=α

Using (4.6.31), (4.6.32) in (4.6.35) we observe that |x (n)| ≤ |x0 | +

n−1 X

f (s) |x (s)| +

s=α

≤ |x0 | +

n−1 X s=α

f (s) e (s) |x (s)| +

β X

! e (s) h (σ) |x (σ)|

σ=α β X

! h (σ) |x (σ)| .

(4.6.36)

σ=α

Now a suitable application of Theorem 4.5.2, part (b2 ) (when g(n) = 0) to (4.6.36) yields (4.6.34). Theorem 4.6.8. initial conditions

Let x(n), y(n), n ∈ Nα,β be the solutions of (4.6.29) with

x (α) = x0 ,

(4.6.37)

y (α) = y0 ,

(4.6.38)

240


respectively.Suppose that the functions k and F in equation (4.6.29) satisfy the conditions |k (n, s, x) − k (n, s, y)| ≤ e (n) h (s) |x − y| ,

(4.6.39)

|F (n, x, y) − F (n, x ¯, y¯)| ≤ f (n) (|x − x ¯| + |y − y¯|) ,

(4.6.40)

where e(n), h(n), f (n) are given as in Theorem 4.6.7. Let r0 be as given in (4.6.33). Then |x (n) − y (n)| ≤

n−1 |x0 − y0 | Y [1 + e (s) f (s)] , 1 − r0 s=α

(4.6.41)

for n ∈ Nα,β . Proof. Using the facts that x(n), y(n) are the solutions of (4.6.29)-(4.6.37), (4.6.29)-(4.6.38) respectively, we have x (n) − y (n) = x0 − y0 +

n−1 X

( F

s, x (s) ,

s=α

−F

s, y (s) ,

β X

β X

! k (s, σ, x (σ))

σ=α

!) k (s, σ, y (σ))

.

(4.6.42)

σ=α

Using (4.6.39), (4.6.40), (4.6.42) we observe that n−1 X

|x (n) − y (n)| ≤ |x0 − y0 |+

f (s) e (s) |x (s) − y (s)|

s=α

+

β X

! h (σ) |x (σ) − y (σ)| .

(4.6.43)

σ=α

Now a suitable application of Theorem 4.5.2, part (b2 ) (when g(n) = 0) to (4.6.43) yields the desired estimate in (4.6.41), which shows the continuous dependence of solutions of equation (4.6.29) on given initial data. Finally, we note that a variety of new methods and tools are developed by various investigators to study different types of finite difference equations. The inequalities and applications given above are recently investigated and further progress is expected.

Chapter 4

241

4.7 Notes Owing to the considerable applications,recently some new finite difference inequalities are developed to widen the scope of their applications. This chapter presents some basic finite difference inequalities recently developed in the literature. Sections 4.2-4.5 are devoted to the variety of new finite difference inequalities investigated by Pachpatte in [35,37,39,44,45,53,54,55,57,67,68,70,73 ,75]. I think that these inequalities places a new stepping stone to the vast literature on the subject and inspire further work in this area.In section 4.6,some applications are discussed to illustrate,how some of these inequalities can be used to study various types of finite and sum-difference equations.The number of applications of the inequalities given here is considerable and those presented in section 1.6 are taken from some of the above noted references.


Chapter 5

Finite difference inequalities in two variables 5.1 Introduction The study of dynamics of physical systems governed by partial finite difference equations is equally important. Inspite of the great possibilities for applications, the theory of partial finite difference equations is developing rather slowely. Indeed, one need new theory and efficient techniques for its significant developments. Finite difference inequalities in two and more independent variables which provide explicit estimates on unknown functions have become very effective and powerful tools for studying qualitative behavior of solutions of partial finite difference equations. In the past few years a large number of new finite difference inequalities involving functions of two independent variables have been discovered and used in various applications, see [36,38,40,41,45,48,49,53,55,56,62,66,68,71,76]. In this chapter, our goal is to present some basic finite difference inequalities recently discovered and which can be used as handy tools in the study of different classes of partial finite and sum-difference equations. Applications of some of the inequalities are also presented.

5.2 Some basic finite difference inequalities During the past few years some new finite difference inequalities have been developed in order to widen the scope of their applications. In this section we present some fundamental finite difference inequalities involving functions of two independent variables, recently investigated by Pachpatte in [56,68,55,40,45]. 243

244

Finite difference inequalities in two variables

Our first theorem deals with the comparison inequalities related to certain partial finite difference equations proved in [56]. ¯ 0 = {m0 , m0 + 1, ...} , N ¯0 = {n0 , n0 + 1, ...} where Theorem 5.2.1. Let M ¯ ¯ m0 , n0 are integers and ∆0 = M0 × N0 . (a1 ) Let f (m, n, r) be a function defined for (m, n) ∈ ∆0 . 0 ≤ r < ∞ and nondecreasing with respect to r for fixed (m, n) ∈ ∆0 . Let u(m, n) and v(m, n) be two functions defined for (m, n) ∈ ∆0 and u (m0 , n0 ) ≤ v (m0 , n0 ) . Assume further that u (m + 1, n + 1) ≤ f (m, n, u (m, n)) ,

(5.2.1)

v (m + 1, n + 1) ≥ f (m, n, v (m, n)) ,

(5.2.2)

for (m, n) ∈ ∆0 . Then u (m, n) ≤ v (m, n) ,

(5.2.3)

for (m, n) ∈ ∆0 . (a2 ) Suppose that the functions W1 (m, n, r) , W2 (m, n, r) be nonnegative and defined for (m, n) ∈ ∆0 , 0 ≤ r < ∞ and nondecreasing with respect to r for fixed (m, n) ∈ ∆0 . Let z(m, n) be a function defined for (m, n) ∈ ∆0 and W2 (m, n, z (m, n)) ≤ z (m + 1, n + 1) ≤ W1 (m, n, z (m, n)) ,

(5.2.4)

for (m, n) ∈ ∆0 . Let u(m, n) and v(m, n) be solutions of the difference equations u (m + 1, n + 1) = W1 (m, n, u (m, n)) , u (m0 , n0 ) = u0 ,

(5.2.5)

v (m + 1, n + 1) = W2 (m, n, v (m, n)) , v (m0 , n0 ) = v0 ,

(5.2.6)

and suppose that v0 ≤ z (m0 , n0 ) ≤ u0 . Then v (m, n) ≤ z (m, n) ≤ u (m, n) ,

(5.2.7)

for (m, n) ∈ ∆0 . (a3 ) Let x(m, n) and y(m, n) be solutions of the difference equations x (m + 1, n + 1) = g (m, n, x (m, n)) , x (m0 , n0 ) = x0 ,

(5.2.8)

y (m + 1, n + 1) = h (m, n, y (m, n)) , y (m0 , n0 ) = y0 ,

(5.2.9)

and

where x(m, n), y(m, n), g(m, n, r), h(m, n, r) are defined for (m, n) ∈ ∆0 , 0 ≤ r < ∞. Let the functions W1 (m, n, r) and W2 (m, n, r) be as in (a2 ). Suppose that the functions g and h in (5.2.8) and (5.2.9) satisfy the condition W2 (m, n, |x − y|) ≤ |g (m, n, x) − h (m, n, y)| ≤ W1 (m, n, |x − y|) , (5.2.10)

Chapter 5

245

for (m, n) ∈ ∆0 . Let u(m, n) and v(m, n) be solutions of the equations (5.2.5) and (5.2.6) for (m, n) ∈ ∆0 and assume that v0 ≤ |x0 − y0 | ≤ u0 . Then v (m, n) ≤ |x (m, n) − y (m, n)| ≤ u (m, n) ,

(5.2.11)

for (m, n) ∈ ∆0 . Proof. (a1 ) Since u (m0 , n0 ) ≤ v (m0 , n0 ) , from the nondecreasing character of f we obtain u (m0 + 1, n0 + 1) ≤ f (m0, n0 , u (m0 , n0 )) ≤ f (m0, n0 , v (m0 , n0 )) ≤ v (m0 + 1, n0 + 1) . If the inequality (5.2.3) is fulfilled for m = m0 + i, n = n0 + i (i = 2, 3, ..., k), it follows by the nondecreasing character of f that u (m0 + k + 1, n0 + k + 1) ≤ f (m0 + k, n0 + k, u (m0 + k, n0 + k)) ≤ f (m0 + k, n0 + k, v (m0 + k, n0 + k)) ≤ v (m0 + k + 1, n0 + k + 1) . Hence by mathematical induction we obtain (5.2.3). (a2 ) Applying the inequality in part (a1 ) to the second part of (5.2.4) and (5.2.5) we obtain the right half of the inequality (5.2.7). A similar argument yields the left half of the inequality (5.2.7). (a3 ) Let z (m, n) = |x (m, n) − y (m, n)| . Then z (m0 , n0 ) = |x (m0 , n0 ) − y (m0 , n0 )| ≤ u (m0 , n0 ) . On account of the nondecreasing nature of W1 (m, n, r) we obtain z (m0 + 1, n0 + 1) = |x (m0 + 1, n0 + 1) − y (m0 + 1, n0 + 1)| = |g (m0 , n0 , x (m0 , n0 )) − h (m0 , n0 , y (m0 , n0 ))| ≤ W1 (m0 , n0 , |x (m0 , n0 ) − y (m0 , n0 )|) ≤ W1 (m0 , n0 , u (m0 , n0 )) = u (m0 + 1, n0 + 1) . If the inequality z (m, n) ≤ u (m, n) is fulfilled for m = m0 + i, n = n0 + i(i = 2, 3, ...k), then it follows by the nondecreasing nature of W1 (m, n, r) that z (m0 + k + 1, n0 + k + 1) = |x (m0 + k + 1, n0 + k + 1) − y (m0 + k + 1, n0 + k + 1)| = |g (m0 + k, n0 + k, x (m0 + k, n0 + k)) − h (m0 + k, n0 + k, y (m0 + k, n0 + k))| ≤ W1 (m0 + k, n0 + k, |x (m0 + k, n0 + k) − y (m0 + k, n0 + k)|) ≤ W1 (m0 + k, n0 + k, u (m0 + k, n0 + k)) = u (m0 + k + 1, n0 + k + 1) . Hence by mathematical induction we obtain |x (m, n) − y (m, n)| ≤ u (m, n) for (m, n) ∈ ∆0 . The proof of the left half of the inequality (5.2.11) is similar.

246


Explicit representation of the solution u(m, n) (or v(m, n)) of a comparision equation of the form (5.2.5) (or (5.2.6)) is not always possible. Therefore in applications this solution is often replaced by an upper (or lower) bound for it. The following theorems deals with some such inequalities proved in [40,45,55,68]. Theorem 5.2.2. Let u (m, n) , a (m, n) ∈ D N02 , R+ , k (m, n, σ, τ ) , ∆1 k (m , n, σ, τ ) , ∆2 k (m, n, σ, τ ),∆2 ∆1 k (m, n, σ, τ ) ∈ D (E, R+ ) where E = {(m, n, σ, τ ) ∈ N04 : 0 ≤ σ ≤ m < ∞, 0 ≤ τ ≤ n < ∞} . (b1 ) Let g ∈ C (R+ , R+ ) be a nondecreasing function with g(u) > 0 for u > 0 . If u (m, n) ≤ c +

m−1 X n−1 X

k (m, n, σ, τ )g (u (σ, τ )) ,

(5.2.12)

σ=0 τ =0

for m, n ∈ N0 , where c ≥ 0 is a real constant, then for 0 ≤ m ≤ m1 , 0 ≤ n ≤ n1 ; m, m1 , n, n1 ∈ N0 , # " m−1 X n−1 X −1 Q (s, t) , (5.2.13) G (c) + u (m, n) ≤ G s=0 t=0

where Q (m, n) = k (m + 1, n + 1, m, n) +

m−1 X

∆1 k (m, n + 1, σ, n)

σ=0

+

n−1 X

∆2 k (m + 1, n, m, τ ) +

τ =0

m−1 X n−1 X

∆2 ∆1 k (m, n, σ, τ ),

(5.2.14)

σ=0 τ =0

Zr G (r) =

ds , r > 0, g (s)

(5.2.15)

r0

r0 > 0 is arbitrary, G−1 is the inverse of G and m1 , n1 ∈ N0 are chosen so that G (c) +

m−1 X n−1 X

Q (s, t) ∈ Dom G−1 ,

s=0 t=0

for all m and n lying in 0 ≤ m ≤ m1 and 0 ≤ n ≤ n1 . (b2 ) Let g, G, G−1 be as in (b1 ) and suppose in addition g(u) is subadditive. If u (m, n) ≤ a (m, n) +

m−1 X n−1 X σ=0 τ =0

k (m, n, σ, τ )g (u (σ, τ )) ,

(5.2.16)

Chapter 5

247

for m, n ∈ N0 , then for 0 ≤ m ≤ m2 , 0 ≤ n ≤ n2 ; m, m2 , n, n2 ∈ N0 , # " m−1 X n−1 X −1 u (m, n) ≤ a (m, n) + G Q (s, t) , G (A (m, n)) +

(5.2.17)

s=0 t=0

where Q(m, n) is given by (5.2.14), A (m, n) =

m−1 X n−1 X

k (m, n, σ, τ )g (a (σ, τ )) ,

(5.2.18)

σ=0 τ =0

m2 , n2 ∈ N0 are chosen so that G (A (m, n)) +

m−1 X n−1 X

Q (s, t) ∈ Dom G−1 ,

s=0 t=0

for all m and n lying in 0 ≤ m ≤ m2 , 0 ≤ n ≤ n2 . Proof. (b1 ) Let c > 0 and define a function z(m, n) by the right hand side of (5.2.12). Then z(0, n) = z(m, 0) = c, u (m, n) ≤ z (m, n) , z(m, n) is positive and nondecreasing for m, n ∈ N0 and ∆1 z (m, n) = z (m + 1, n) − z (m, n) =

m n−1 X X

k (m + 1, n, σ, τ )g (u (σ, τ ))

σ=0 τ =0

−

m−1 X n−1 X

k (m + 1, n, σ, τ )g (u (σ, τ ))

σ=0 τ =0

+

m−1 X n−1 X

k (m + 1, n, σ, τ )g (u (σ, τ ))

σ=0 τ =0

−

m−1 X n−1 X

k (m, n, σ, τ )g (u (σ, τ ))

σ=0 τ =0

=

n−1 X

k (m + 1, n, m, τ )g (u (m, τ ))

τ =0

+

m−1 X n−1 X

∆1 k (m, n, σ, τ )g (u (σ, τ )) .

σ=0 τ =0

From (5.2.19) we have ∆2 ∆1 z (m, n) = ∆1 z (m, n + 1) − ∆1 z (m, n)

(5.2.19)

248


=

n X

k (m + 1, n + 1, m, τ )g (u (m, τ ))

τ =0

+

n m−1 XX

∆1 k (m, n + 1, σ, τ ) g (u (σ, τ ))

σ=0 τ =0

−

n−1 X

k (m + 1, n, m, τ ) g (u (m, τ ))

τ =0

−

m−1 X n−1 X

∆1 k (m, n, σ, τ ) g (u (σ, τ ))

σ=0 τ =0

=

n X

k (m + 1, n + 1, m, τ )g (u (m, τ ))

τ =0

−

n−1 X

k (m + 1, n + 1, m, τ ) g (u (m, τ ))

τ =0

+

n−1 X

k (m + 1, n + 1, m, τ ) g (u (m, τ ))

τ =0

−

n−1 X

k (m + 1, n, m, τ ) g (u (m, τ ))

τ =0

+

n m−1 XX

∆1 k (m, n + 1, σ, τ ) g (u (σ, τ ))

σ=0 τ =0

−

m−1 X n−1 X

∆1 k (m, n, σ, τ ) g (u (σ, τ ))

σ=0 τ =0

= k (m + 1, n + 1, m, n) g (u (m, n)) +

n−1 X

∆2 k (m + 1, n, m, τ )g (u (m, τ ))

τ =0

+

m−1 X σ=0

(

n X

∆1 k (m, n + 1, σ, τ ) g (u (σ, τ )) −

τ =0

= k (m + 1, n + 1, m, n) g (u (m, n)) +

n−1 X

) ∆1 k (m, n, σ, τ ) g (u (σ, τ ))

τ =0 n−1 X

∆2 k (m + 1, n, m, τ )g (u (m, τ ))

τ =0

+

m−1 X

(

σ=0

+

n X

∆1 k (m, n + 1, σ, τ ) g (u (σ, τ )) −

n−1 X

τ =0

τ =0

n−1 X

n−1 X

τ =0

∆1 k (m, n + 1, σ, τ ) g (u (σ, τ )) −

τ =0

∆1 k (m, n + 1, σ, τ ) g (u (σ, τ )) ) ∆1 k (m, n, σ, τ ) g (u (σ, τ ))

Chapter 5

= k (m + 1, n + 1, m, n) g (u (m, n)) +

249 n−1 X

∆2 k (m + 1, n, m, τ )g (u (m, τ ))

τ =0

+

n−1 X

∆1 k (m, n + 1, σ, n) g (u (σ, n))

σ=0

+

m−1 X n−1 X

∆2 ∆1 k (m, n, σ, τ )g (u (σ, τ ))

σ=0 τ =0

≤ k (m + 1, n + 1, m, n) g (z (m, n)) +

n−1 X

∆2 k (m + 1, n, m, τ )g (z (m, τ ))

τ =0

+

n−1 X

∆1 k (m, n + 1, σ, n) g (z (σ, n))

σ=0

+

m−1 X n−1 X

∆2 ∆1 k (m, n, σ, τ )g (z (σ, τ ))

σ=0 τ =0

≤ Q (m, n) g (z (m, n)) .

(5.2.20)

The rest of the proof can be completed by following the proof of Theorem 5.2.1 given in [42, p. 388]. (b2 ) Define a function z(m, n) by z (m, n) =

m−1 X n−1 X

k (m, n, σ, τ ) g (u (σ, τ )).

(5.2.21)

σ=0 τ =0

From (5.2.21) and using the fact that u (m, n) ≤ a (m, n) + z (m, n) and hypotheses on g we have z (m, n) ≤

m−1 X n−1 X

k (m, n, σ, τ ) g (a (σ, τ ) + z (σ, τ ))

σ=0 τ =0

≤ A (m, n) +

m−1 X n−1 X

k (m, n, σ, τ ) g (z (σ, τ )),

(5.2.22)

σ=0 τ =0

where A(m, n) is given by (5.2.18). The remaining proof can be completed by closely looking at the proof of Theorem 5.2.2 given in [42]. Remark 5.2.1. We note that the inequalities in (b1 ) and (b2 ) are the further generalizations of the inequality given in Theorem 5.2.1 in [42], which can be used in more general situations. Theorem 5.2.3. Let u(m, n), k(m, n, σ, τ ), ∆1 k(m, n, σ, τ ), ∆2 k (m, n, σ, τ ) , ∆2 ∆1 k (m, n, σ, τ ) and c be as in Theorem 5.2.2.

250


(c1 ) If u2 (m, n) ≤ c +

m−1 X n−1 X

k (m, n, σ, τ )u (σ, τ ) ,

(5.2.23)

σ=0 τ =0

for m, n ∈ N0 , then u (m, n) ≤

m−1 n−1 √ 1 XX c+ Q (s, t) , 2 s=0 t=0

(5.2.24)

for m, n ∈ N0 , where Q(m, n) is given by (5.2.14) (c2 ) Let g(u) be as in Theorem 5.2.2, part (b1 ). If u2 (m, n) ≤ c +

m−1 X n−1 X

k (m, n, σ, τ )u (σ, τ ) g (u (σ, τ )) ,

(5.2.25)

σ=0 τ =0

for m, n ∈ N0 , then for 0 ≤ m ≤ m3 , 0 ≤ n ≤ n3 ; m, m3 , n, n3 ∈ N0 , # " X n−1 X √ 1 m−1 −1 u (m, n) ≤ G Q (s, t) , G c + 2 s=0 t=0

(5.2.26)

where Q(m, n) is given by (5.2.14), G, G−1 are as defined in Theorem 5.2.2, part (b1 ) and m3 , n3 are chosen so that G

X n−1 X √ 1 m−1 c + Q (s, t) ∈ Dom G−1 , 2 s=0 t=0

for all m, n ∈ N0 lying in 0 ≤ m ≤ m3 , 0 ≤ n ≤ n3 . Proof. Let c > 0 and define a function z(m, p n) by the right hand side of (5.2.23). Then z(0, n) = z(m, 0) = c, u (m, n) ≤ z (m, n), z(m, n) is positive and nondecreasing for m, n ∈ N0 and following the proof of Theorem 5.2.2, part (b1 ) we get p (5.2.27) ∆2 ∆1 z (m, n) ≤ Q (m, n) z (m, n). The rest of the proof follows by using the arguments as in the proof of Theorem 5.4.1 given in [42]. (c2 ) The proof can be completed by following the proof of (c1 ) given above and the proof of Theorem 5.4.3 in [42]. We omit the details. Remark 5.2.2. In the special case when k(m, n, σ, τ ) = a (σ, τ ) , the inequalities in (c1 ) and (c2 ) reduces to the corresponding inequalities in Theorem 5.4.1 and Theorem 5.4.3 given in [42].

Chapter 5

251

Theorem 5.2.4. Let u (m, n) , a (m, n) , b (m, n) , g (m, n) , h (m, n) ∈ D N02 , R+ and p > 1 is a real constant. (d1 ) If up (m, n) ≤ a (m, n)+b (m, n)

m−1 X n−1 X

[g (s, t) up (s, t) + h (s, t) u (s, t)] , (5.2.28)

σ=0 τ =0

for m, n ∈ N0 , then u (m, n) ≤ {a (m, n) + b (m, n) e (m, n)

×

m−1 Y

" 1+

s=0

n−1 X t=0

h (s, t) g (s, t) + p

#) p1

b (s, t)

,

(5.2.29)

for m, n ∈ N0 , where e (m, n) =

m−1 X n−1 X

g (s, t) a (s, t) + h (s, t)

s=0 t=0

p − 1 a (s, t) + p p

, (5.2.30)

for m, n ∈ N0 . (d2 ) Let L : N02 × R+ → R+ be a function which satisfies the condition 0 ≤ L (m, n, u) − L (m, n, v) ≤ M (m, n, v) (u − v) , for u ≥ v ≥ 0, where M : N02 × R+ → R+ . If up (m, n) ≤ a (m, n) + b (m, n)

m−1 X n−1 X

L (s, t, u (s, t)) ,

(5.2.31)

σ=0 τ =0

for m, n ∈ N0 , then u (m, n) ≤ {a (m, n) + b (m, n) e¯ (m, n)

×

m−1 Y

" 1+

s=0

n−1 X

M

t=0

p − 1 a (s, t) + s, t, p p

b (s, t) p

#) p1 ,

(5.2.32)

for m, n ∈ N0 , where e¯ (m, n) =

m−1 X n−1 X s=0

for m, n ∈ N0 .

p − 1 a (s, t) + , L s, t, p p t=0

(5.2.33)

252


Proof.

(d1 ) Define a function z(m, n) by

z (m, n) =

m−1 X n−1 X

[g (s, t) up (s, t) + h (s, t) u (s, t)] ,

(5.2.34)

s=0 t=0

then z(m, 0) = z(0, n) = 0 and (5.2.28) can be written as up (m, n) ≤ a (m, n) + b (m, n) z (m, n) .

(5.2.35)

From (5.2.35) as in the proof of Theorem 2.3.3, part (c1 ) we obtain u (m, n) ≤

p − 1 a (m, n) b (m, n) + + z (m, n) . p p p

(5.2.36)

From (5.2.34)-(5.2.36) we observe that z (m, n) ≤

m−1 X n−1 X

[g (s, t) (a (s, t) + b (s, t) z (s, t))

s=0 t=0

+h (s, t)

p − 1 a (s, t) b (s, t) + + z (s, t) p p p

= e (m, n) +

m−1 X n−1 X s=0

h (s, t) z (s, t) , b (s, t) g (s, t) + p t=0

(5.2.37)

where e(m, n) is given by (5.2.30). Clearly e(m, n) is nonnegative and nondecreasing function for m, n ∈ N0 . Now an application of Theorem 4.2.2 given in [42] to (5.2.37) yields " # m−1 n−1 Y X h (s, t) . (5.2.38) b (s, t) g (s, t) + 1+ z (m, n) ≤ e (m, n) p s=0 t=0 The required inequality in (5.2.29) follows from (5.2.35) and (5.2.38). (d2 ) Define a function z(m, n) by z (m, n) =

m−1 X n−1 X

L (s, t, u (s, t)) ,

(5.2.39)

s=0 t=0

then as in the proof of Part (d1 ) above, from (5.2.31) we see that the inequalities (5.2.35), (5.2.36) hold.From (5.2.39),(5.2.36) and the assumptions on L it follows that z (m, n) ≤

m−1 X n−1 X s=0 t=0

p − 1 a (s, t) b (s, t) + + z (s, t) L s, t, p p p

Chapter 5

253

p − 1 a (s, t) p − 1 a (s, t) + + L s, t, + −L s, t, p p p p m−1 X n−1 X p − 1 a (s, t) b (s, t) ≤ e¯ (m, n) + + z (s, t) , M s, t, p p p s=0 t=0

(5.2.40)

where e¯ (m, n) is given by (5.2.33).Clearly e¯ (m, n) is nonnegative and nondecreasing function for m, n ∈ N0 . An application of Theorem 4.2.2 given in [42] to (5.2.40) yields # " m−1 n−1 Y X p − 1 a (s, t) b (s, t) + . (5.2.41) M s, t, 1+ z (m, n) ≤ e¯ (m, n) p p p s=0 t=0 From (5.2.35) and (5.2.41) the desired inequality in (5.2.32) follows. Remark 5.2.3. We note that the inequalities given in (d1 ) and (d2 ) are of more general type and in the various special cases, one can obtain new inequalities which can also be used as tools in certain applications. Theorem 5.2.5. Let u (m, n) , f (m, n) ∈ D N02 ,R+ , h (m, n, σ, τ ) ∈ D (E, R+ ) and c ≥ 0, p > 1 be real constants, where E = (m, n, σ, τ ) ∈ N04 : 0 ≤ σ ≤ m < ∞, 0 ≤ τ ≤ n < ∞} (e1 ) If up (m, n) ≤ c +

m−1 X n−1 X

[f (s, t) g (u (s, t))

s=0 t=0

+

t−1 s−1 X X

# h (s, t, σ, τ ) g (u (σ, τ )) ,

(5.2.42)

σ=0 τ =0

for m, n ∈ N0 , then for 0 ≤ m ≤ m4 , 0 ≤ n ≤ n4 ; m, m4 , n, n4 ∈ N0 , 1 u (m, n) ≤ H −1 [H (c) + B (m, n)] p ,

(5.2.43)

where B (m, n) =

m−1 X n−1 X

" f (s, t) +

s=0 t=0

Zr H (r) = r0

t−1 s−1 X X

# h (s, t, σ, τ ) ,

(5.2.44)

σ=0 τ =0

ds 1 , r > 0, g sp

(5.2.45)

r0 > 0 is arbitrary, H −1 is the inverse of H and m4 , n4 ∈ N0 are chosen so that H (c) + B (m, n) ∈ Dom H −1 , for all m, n lying in 0 ≤ m ≤ m4 , 0 ≤ n ≤ n4 .

254


(e2 ) If up (m, n) ≤ c+

m−1 X n−1 X

" f (s, t) u (s, t) +

s=0 t=0

t−1 s−1 X X

# h (s, t, σ, τ )u (σ, τ ) , (5.2.46)

σ=0 τ =0

for m, n ∈ N0 , then 1 p−1 p−1 p−1 p B (m, n) u (m, n) ≤ c + , p

(5.2.47)

for m, n ∈ N0 , where B(m, n) is given by (5.2.44). Proof. (e1 ) Let c > 0 and define a function z(m, n) by the right hand side of 1 (5.2.42).Then z(0, n) = z(m, 0) = c, u (m, n) ≤ {z (m, n)} p , z(m, n) is positive and nondecreasing for m, n ∈ N0 and z (m + 1, n) − z (m, n) " # t−1 n−1 m−1 X XX f (m, t) g (u (m, t)) + h (m, t, σ, τ ) g (u (σ, τ )) = t=0

≤

n−1 X

σ=0 τ =0

"

# t−1 m−1 XX 1 1 h (m, t, σ, τ ) g {z (σ, τ )} p f (m, t) g {z (m, t)} p +

t=0

σ=0 τ =0

" # t−1 m−1 n−1 X XX 1 ≤ g {z (m, n)} p f (m, t) + h (m, t, σ, τ ) . t=0

(5.2.48)

σ=0 τ =0

From (5.2.45), (5.2.48) we observe that z(m+1,n) Z

H (z (m + 1, n)) − H (z (m, n)) = z(m,n)

z (m + 1, n) − z (m, n) 1 g {z (m, n)} p # " t−1 n−1 m−1 X XX h (m, t, σ, τ ) . f (m, t) + ≤

ds 1 g sp

≤

t=0

(5.2.49)

σ=0 τ =0

Keeping n fixed in (5.2.49), setting m = s and summing over s from 0 to m − 1 we obtain H (z (m, n)) ≤ H (c) + B (m, n) .

(5.2.50) 1

Now substituting the bound on z(m, n) from (5.2.50) in u (m, n) ≤ {z (m, n)} p , we obtain the required inequality in (5.2.43). The proof of the case when c ≥ 0 can be completed as mentioned in the proof of Theorem 4.2.3, part (b1 ). The domain 0 ≤ m ≤ m4 , 0 ≤ n ≤ n4 is obvious.

Chapter 5

255

(e2 ) The proof is similar to that of Theorem 1.3.4. We omit the details. Remark 5.2.4. We note that the inequality in (e1 ) is a Bihari type discrete inequality in two independent variables and if we take p = 2, h = 0 in (e2 ), then we get a slight variant of the inequality in Theorem 5.4.1 given in [42].

5.3 Further finite difference inequalities In view of the important applications,a great deal of attention has been given to establish finite difference inequalities which provide explicit bounds on unknown functions. In this section, we offer some more finite difference inequalities investigated by Pachpatte in [38,53,66] which provide a natural and effective means in certain applications. We begin with the following theorem which contains the inequalities proved in [38]. Theorem5.3.1. Let u (m, n) , a (m, n) , b (m, n) , p (m, n) , g (m, n) , h (m, n) ∈ D N02 , R+ . Let L : N02 × R+ → R+ be a function which satisfies the condition 0 ≤ L (m, n, u) − L (m, n, v) ≤ M (m, n, v) (u − v) ,

(5.3.1)

for u ≥ v ≥ 0, where M : N02 × R+ → R+ . (a1 ) Let a(m, n) be nondecreasing in m. If u (m, n) ≤ a (m, n) + p (m, n)

m−1 X

b (s, n) u (s, n)

s=0

+

m−1 X n−1 X

L (s, t, u (s, t)) ,

(5.3.2)

s=0 t=0

for m, n ∈ N0 , then u (m, n) ≤ f (m, n) [a (m, n) + e (m, n) ## " m−1 n−1 Y X × M (s, t, f (s, t) a (s, t)) f (s, t) , 1+ s=0

(5.3.3)

t=0

for m, n ∈ N0 , where f (m, n) = 1 + p (m, n)

m−1 X s=0

b (s, n)

m−1 Y σ=s+1

[1 + b (σ, n) p (σ, n)],

(5.3.4)

256


e (m, n) =

m−1 X n−1 X

L (s, t, f (s, t) a (s, t)) ,

(5.3.5)

s=0 t=0

for m, n ∈ N0 . (a2 ) Let a(m, n) be as in (a1 ). If u (m, n) ≤ a (m, n) +

m−1 X

g (s, n) u (s, n) +

s=0

+

m−1 X n−1 X

s−1 X

! h (σ, n) u (σ, n)

σ=0

L (s, t, u (s, t)) ,

(5.3.6)

s=0 t=0

for m, n ∈ N0 , then u (m, n) ≤ k (m, n) [a (m, n) + e¯ (m, n) " ## m−1 n−1 Y X × 1+ M (s, t, k (s, t) a (s, t)) k (s, t) , s=0

(5.3.7)

t=0

for m, n ∈ N0 , where k (m, n) = 1 +

m−1 X

g (s, n)

s=0

e¯ (m, n) =

m−1 X n−1 X

s−1 Y

[1 + g (σ, n) + h (σ, n)],

(5.3.8)

σ=0

L (s, t, k (s, t) a (s, t)) ,

(5.3.9)

s=0 t=0

for m, n ∈ N0 . Proof.

(a1 ) Define a function z(m, n) by

z (m, n) = a (m, n) +

m−1 X n−1 X

L (s, t, u (s, t)) .

(5.3.10)

s=0 t=0

Then (5.3.2) can be restated as u (m, n) ≤ z (m, n) + p (m, n)

m−1 X

b (s, n) u (s, n) .

(5.3.11)

s=0

Clearly z(m, n) is nonnegative and nondecreasing function for m ∈ N0 . Treating (5.3.11) as an one dimensional inequality for any fixed n ∈ N0 and a suitable application of Theorem 1.2.4 given in [42] to (5.3.11) yields u (m, n) ≤ z (m, n) f (m, n) ,

(5.3.12)

Chapter 5

257

where f (m, n) is defined by (5.3.4). From (5.3.10) and (5.3.12) we have u (m, n) ≤ f (m, n) [a (m, n) + r (m, n)] ,

(5.3.13)

where r (m, n) =

m−1 X n−1 X

L (s, t, u (s, t)) .

(5.3.14)

s=0 t=0

Using (5.3.13),(5.3.1) in (5.3.14) we observe that r (m, n) ≤

m−1 X n−1 X

{L (s, t, f (s, t) [a (s, t) + r (s, t)])

s=0 t=0

−L (s, t, f (s, t) a (s, t)) + L (s, t, f (s, t) a (s, t))} ≤ e (m, n) +

m−1 X n−1 X

M (s, t, f (s, t) a (s, t)) f (s, t) r (s, t) ,

(5.3.15)

s=0 t=0

where e(m, n) is defined by (5.3.5). It is easy to observe that e(m, n) is nonnegative and nondecreasing for m, n ∈ N0 . Now a suitable application of Theorem 4.2.2 given in [42] to (5.3.15) yields # " m−1 n−1 Y X r (m, n) ≤ e (m, n) M (s, t, f (s, t) a (s, t)) f (s, t) . (5.3.16) 1+ s=0

t=0

Now using (5.3.16) in (5.3.13) we get the desired inequality in (5.3.3). (a2 ) Define a function z(m, n) by (5.3.10), then (5.3.6) can be written as ! m−1 s−1 X X u (m, n) ≤ z (m, n) + g (s, n) u (s, n) + h (σ, n) u (σ, n) . (5.3.17) s=0

σ=0

Clearly z(m, n) is nonnegative and nondecreasing function for m ∈ N0 . Treating (5.3.17) as one-dimensional inequality for any fixed n ∈ N0 and a suitable application of Theorem 1.4.2 given in [42] to (5.3.17) yields u (m, n) ≤ z (m, n) k (m, n) ,

(5.3.18)

where k(m, n) is defined by (5.3.8). Now by following the proof of (a1 ) we obtain the desired inequality in (5.3.7). Remark 5.3.1.

If we take p(m.n) = 0 in (a1 ), g(m, n) = 0 in (a2 ), then m−1 P n−1 P f (m, n) = 1 = k(m, n), e (m, n) = e¯ (m, n) = L (s, t, a (s, t)) = e0 (m, n) s=0 t=0

(say) and the bounds obtained in (5.3.3) and (5.3.7) reduces to # " m−1 n−1 Y X M (s, t, a (s, t)) . 1+ u (m, n) ≤ a (m, n) + e0 (m, n) s=0

t=0

For some such inequaliies and their applications, see [42].

(5.3.19)

258


The inequalities embodied in the following theorem are established in [53]. Theorem 5.3.2. Let u (m, n) , f (m, n) , a (m, n) ∈ D N02 , R+ , k (m, n, σ, τ ) , ∆1 k (m, n, σ, τ ) , ∆2 k (m, n,σ, τ ) , ∆2 ∆1 k (m, n, σ, τ ) ∈ D (E, R+ ) and c ≥ 0 be a real constant, where E = (m, n, σ, τ ) ∈ N04 : 0 ≤ σ ≤ m < ∞, 0 ≤ τ ≤ n < ∞ . (b1 ) If u (m, n) ≤ c +

m−1 X n−1 X

" f (s, t) u (s, t) +

s=0 t=0

t−1 s−1 X X

# k (s, t, σ, τ )u (σ, τ ) , (5.3.20)

σ=0 τ =0

for m, n ∈ N0 , then  u (m, n) ≤ c 1 +

m−1 X n−1 X

f (s, t)

s=0 t=0

s−1 Y

" 1+

t−1 X

# [f (ξ, η) + Q (ξ, η)]  , (5.3.21)

η=0

ξ=0

for m, n ∈ N0 , where Q(m, n) is defined by (5.2.14). (b2 ) If u (m, n) ≤ a (m, n) +

m−1 X n−1 X

[u (s, t)

s=0 t=0

+

t−1 s−1 X X

# k (s, t, σ, τ ) u (σ, τ ) ,

(5.3.22)

σ=0 τ =0

for m, n ∈ N0 , then " u (m, n) ≤ a (m, n) + H (m, n) 1 +

m−1 X n−1 X

f (s, t)

s=0 t=0

×

s−1 Y

" 1+

ξ=0

t−1 X

# [f (ξ, η) + Q (ξ, η)]  ,

(5.3.23)

η=0

for m, n ∈ N0 , where H (m, n) =

m−1 X n−1 X s=0 t=0

" f (s, t) a (s, t) +

t−1 s−1 X X σ=0 τ =0

for m, n ∈ N0 and Q(m, n) is defined by (5.2.14).

# k (s, t, σ, τ )a (σ, τ ) , (5.3.24)

Chapter 5

259

Proof. (b1 ) Let c > 0 and define a function z(m, n) by the right hand side of (5.3.20). Then z(0, n) = z(m, 0) = c, u (m, n) ≤ z (m, n) and " ∆2 ∆1 z (m, n) = f (m, n) u (m, n) +

m−1 X n−1 X

# k (m, n, σ, τ )u (σ, τ )

σ=0 τ =0

" ≤ f (m, n) z (m, n) +

m−1 X n−1 X

# k (m, n, σ, τ )z (σ, τ ) .

(5.3.25)

σ=0 τ =0

Define a function v(m, n) by

v (m, n) = z (m, n) +

m−1 X n−1 X

k (m, n, σ, τ )z (σ, τ ).

(5.3.26)

σ=0 τ =0

Then v(m, 0) = z(m, 0) = c, v(0, n) = z(0, n) = c, ∆2 ∆1 z (m, n) ≤ f (m, n) v (m, n) , z (m, n) ≤ v (m, n) and following the proof of Theorem 5.2.2, part (b1 ) and using the fact that z(m, n) is nondecreasing for m, n ∈ N0 we observe that ∆2 ∆1 v (m, n) ≤ ∆2 ∆1 z (m, n) + Q (m, n) z (m, n) ≤ [f (m, n) + Q (m, n)] v (m, n) ,

(5.3.27)

where Q(m, n) is defined by (5.2.14). The rest of the proof can be completed as in the proof of Theorem 4.3.1 given in [42]. (b2 ) The proof can be completed by following the proof of Theorem 4.3.3, part (a4 ) given in [42]. We omit the details. Remark 5.3.2. By taking k (m, n, σ, τ ) = k (σ, τ ) , the inequality in (b1 ) reduces to the inequality in Theorem 4.3.1 given in [42]. The inequality in (b2 ) is of more general type and can be used conveniently in certain situations. In the following theorems we present the inequalities investigated in [66] which can be used in some applications. Theorem5.3.3. Let E1 = (m, n, s, t) ∈ N04 : 0 ≤ s ≤ m < ∞, 0 ≤ t ≤ n < ∞ and E2 = (m, n, s, t, σ, τ ) ∈ N06 : 0 ≤ σ ≤ s ≤ m < ∞, 0 ≤ τ ≤ t ≤ n < ∞ . Let u (m, n) ∈ D N02 , R+ ; k (m, n, s, t) , ∆1 k (m, n, s, t) , ∆2 k (m, n, s, t) , ∆2 ∆1 k (m, n, s, t) ∈ D (E1 , R+ ); h (m, n, s, t, σ, τ ) , ∆1 h (m, n, s, t, σ, τ ) , ∆2 h (m, n, s, t, σ, τ ) , ∆2 ∆1 h (m, n, s, t, σ, τ ) ∈ D (E2 , R+ ) and c ≥ 0 be a real constant.

260


(c1 ) If u (m, n) ≤ c +

m−1 X n−1 X

k (m, n, s, t) u (s, t)

s=0 t=0

+

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! h (m, n, s, t, σ, τ ) u (σ, τ ) ,

(5.3.28)

for m, n ∈ N0 , then u (m, n) ≤ c

m−1 Y

" 1+

x=0

n−1 X

# [A (x, y) + B (x, y)] ,

(5.3.29)

y=0

for m, n ∈ N0 , where A (x, y) = k (x + 1, y + 1, x, y) +

x−1 X

∆1 k (x, y + 1, s, y)

s=0

+

y−1 X

∆2 k (x + 1, y, x, t) +

t=0

x−1 X y−1 X

∆2 ∆1 k (x, y, s, t) ,

(5.3.30)

s=0 t=0

B (x, y) =

x−1 X y−1 X

h (x + 1, y + 1, x, y, σ, τ )

σ=0 τ =0

+

+

+

x−1 X

s−1 y−1 X X

s=0

σ=0 τ =0

y−1 X

t−1 x−1 XX

t=0

σ=0 τ =0

! ∆1 h (x, y + 1, s, y, σ, τ ) ! ∆2 h (x + 1, y, x, t, σ, τ )

x−1 X y−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! ∆2 ∆1 h (x, y, s, t, σ, τ ) .

(5.3.31)

(c2 ) Ler g ∈ C (R+ , R+ ) be a nondecreasing function with g(u) > 0 for u > 0. If u (m, n) ≤ c +

m−1 X n−1 X

k (m, n, s, t) g (u (s, t))

s=0 t=0

+

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! h (m, n, s, t, σ, τ ) g (u (σ, τ )) ,

(5.3.32)

Chapter 5

261

for m, n ∈ N0 , then for 0 ≤ m ≤ m1 , 0 ≤ n ≤ n1 ; m, m1 , n, n1 ∈ N0 , # " m−1 X n−1 X −1 [A (x, y) + B (x, y)] , G (c) + u (m, n) ≤ G

(5.3.33)

x=0 y=0

where A(x, y), B(x, y) are given by (5.3.30), (5.3.31), Zr G (r) =

dw , r > o, g (w)

(5.3.34)

r0

r0 > o is arbitrary, G−1 is the inverse of G and m1 , n1 ∈ N0 be chosen so that G (c) +

m−1 X n−1 X

[A (x, y) + B (x, y)] ∈ Dom G−1 ,

x=0 y=0

for all m, n ∈ N0 such that 0 ≤ m ≤ m1 , 0 ≤ n ≤ n1 . Theorem 5.3.4. Let u(m, n), k(m,n, s, t) , h (m, n, s, t, σ, τ ) , c be as in Theorem 5.3.3 and b (m, n) ∈ D N02 , R+ . (d1 ) If u (m, n) ≤ c +

m−1 X n−1 X

b (s, t) u (s, t) +

s=0 t=0

+

m−1 X n−1 X



t−1 s−1 X X

 s=0 t=0

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! k (s, t, σ, τ ) u (σ, τ )







h (s, t, σ, τ, ξ, η) u (ξ, η),

−1 σ−1 X τX

σ=0 τ =0

(5.3.35)

ξ=0 η=0

for m, n ∈ N0 , then u (m, n) ≤ c

m−1 Y

" 1+

s=0

n−1 X

# Q (s, t) ,

(5.3.36)

t=0

for m, n ∈ N0 , where Q (m, n) = b (m, n) +

m−1 X n−1 X

k (m, n, σ, τ )

σ=0 τ =0

+

m−1 X n−1 X



−1 σ−1 X τX

 σ=0 τ =0

ξ=0 η=0

 h (m, n, σ, τ, ξ, η).

(5.3.37)

262


(d2 ) Let g(u) be as in Theorem 5.3.3, part (c2 ). If m−1 X n−1 X

u (m, n) ≤ c+

b (s, t) g (u (s, t)) +

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

s=0 t=0

+

m−1 X n−1 X



t−1 s−1 X X

 s=0 t=0

 σ=0 τ =0

k (s, t, σ, τ ) g (u (σ, τ )) 



−1 σ−1 X τX

!

h (s, t, σ, τ, ξ, η) g (u (ξ, η)),

(5.3.38)

ξ=0 η=0

for m, n ∈ N0 , then for 0 ≤ m ≤ m2 , 0 ≤ n ≤ n2 ; m, m2 , n, n2 ∈ N0 , # " m−1 X n−1 X −1 u (m, n) ≤ G Q (s, t) , G (c) +

(5.3.39)

s=0 t=0

where Q(x, y) is given by (5.3.37), G, G−1 are as in Theorem 5.3.3, part (c2 ) and m2 , n2 ∈ N0 be chosen so that G (c) +

m−1 X n−1 X

Q (s, t) ∈ Dom G−1 ,

s=0 t=0

for all m, n ∈ N0 such that 0 ≤ m ≤ m2 , 0 ≤ n ≤ n2 . Proofs of Theorems 5.3.3 and 5.3.4. (c1 ) Let c > 0 and define a function z(m, n) by the right hand side of (5.3.28). Then z(m, n) > 0, z(0, n) = z(m, 0) = c and ∆1 z (m, n) = z (m + 1, n) − z(m, n) =

m n−1 X X

k (m + 1, n, s, t) u (s, t) +

s=0 t=0

−

s=0 t=0

m−1 X n−1 X

k (m, n, s, t) u (s, t) −

s=0 t=0

=

n−1 X

! h (m + 1, n, s, t, σ, τ ) u (σ, τ )

σ=0 τ =0

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

k (m + 1, n, m, t) u (m, t) +

t=0

−

t−1 m n−1 s−1 X X X X

m−1 X n−1 X

! h (m, n, s, t, σ, τ ) u (σ, τ )

k (m + 1, n, s, t) u (s, t)

s=0 t=0

m−1 X n−1 X

k (m, n, s, t) u (s, t)

s=0 t=0

+

+

n−1 X

t−1 m−1 XX

t=0

σ=0 τ =0

! h (m + 1, n, s, t, σ, τ ) u (σ, τ )

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! h (m + 1, n, s, t, σ, τ ) u (σ, τ )

Chapter 5

−

=

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

n−1 X

! h (m, n, s, t, σ, τ ) u (σ, τ )

k (m + 1, n, m, t) u (m, t) +

t=0

+

+

263

m−1 X n−1 X

∆1 k (m, n, s, t) u (s, t)

s=0 t=0

n−1 X

t−1 m−1 XX

t=0

σ=0 τ =0

! h (m + 1, n, m, t, σ, τ ) u (σ, τ )

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! ∆1 h (m, n, s, t, σ, τ ) u (σ, τ ) .

(5.3.40)

From (5.3.40) and using the facts that u (m, n) ≤ z(m, n), z(m, n) is nondecreasing for m, n ∈ N0 , we have ∆2 ∆1 z (m, n) = ∆1 z (m, n + 1) − ∆1 z (m, n) =

n X

k (m + 1, n + 1, m, t) u (m, t)

t=0

+

n m−1 XX

∆1 k (m, n + 1, s, t) u (s, t)

s=0 t=0

+

+

−

n X

t−1 m−1 XX

t=0

σ=0 τ =0

! h (m + 1, n + 1, m, t, σ, τ ) u (σ, τ )

n m−1 XX

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

n−1 X

! ∆1 h (m, n + 1, s, t, σ, τ )u (σ, τ )

k (m + 1, n, m, t) u (m, t)

t=0

−

m−1 X n−1 X

∆1 k (m, n, s, t) u (s, t)

s=0 t=0

−

−

n−1 X

t−1 m−1 XX

t=0

σ=0 τ =0

! h (m + 1, n, m, t, σ, τ ) u (σ, τ )

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! ∆1 h (m, n, s, t, σ, τ )u (σ, τ )

= k (m + 1, n + 1, m, n) u (m, n) +

n−1 X t=0

k (m + 1, n + 1, m, t) u (m, t)

264


+

m−1 X

∆1 k (m, n + 1, s, n) u (s, n)

s=0

+

m−1 X n−1 X

∆1 k (m, n + 1, s, t) u (s, t)

s=0 t=0

−

n−1 X

k (m + 1, n, m, t) u (m, t)

t=0

−

m−1 X n−1 X

∆1 k (m, n, s, t) u (s, t)

s=0 t=0

+

m−1 X n−1 X

h (m + 1, n + 1, m, n, σ, τ )u (σ, τ )

σ=0 τ =0

+

+

+

−

−

n−1 X

t−1 m−1 XX

t=0

σ=0 τ =0

m−1 X

s−1 n−1 X X

s=0

σ=0 τ =0

! h (m + 1, n + 1, m, t, σ, τ ) u (σ, τ ) ! ∆1 h (m, n + 1, s, n, σ, τ ) u (σ, τ )

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

n−1 X

t−1 m−1 XX

t=0

σ=0 τ =0

! ∆1 h (m, n + 1, s, t, σ, τ ) u (σ, τ ) !

h (m + 1, n, m, t, σ, τ ) u (σ, τ )

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! ∆1 h (m, n, s, t, σ, τ ) u (σ, τ )

= k (m + 1, n + 1, m, n) u (m, n) +

m−1 X

∆1 k (m, n + 1, s, n) u (s, n)

s=0

+

n−1 X

∆2 k (m + 1, n, m, t) u (m, t)

t=0

+

m−1 X n−1 X

∆2 ∆1 k (m, n, s, t) u (s, t)

s=0 t=0

+

m−1 X n−1 X σ=0 τ =0

h (m + 1, n + 1, m, n, σ, τ )u (σ, τ )

Chapter 5

+

+

+

m−1 X

s−1 n−1 X X

s=0

σ=0 τ =0

n−1 X

t−1 m−1 XX

t=0

σ=0 τ =0

265 !

∆1 h (m, n + 1, s, n, σ, τ ) u (σ, τ ) ! ∆2 h (m + 1, n, m, t, σ, τ ) u (σ, τ )

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! ∆2 ∆1 h (m, n, s, t, σ, τ ) u (σ, τ )

≤ [A (m, n) + B (m, n)] z (m, n) .

(5.3.41)

Now by following the proof of Theorem 4.2.1 given in [42] we get " # m−1 n−1 Y X 1+ [A (x, y) + B (x, y)] , z (m, n) ≤ c x=0

(5.3.42)

y=0

for m, n ∈ N0 . Using (5.3.42) in u (m, n) ≤ z (m, n) we get the required inequality in (5.3.29). If c ≥ 0, we carry out the above procedure with c + ε instead of c, where ε > 0 is an arbitrary small constant, and subsequently pass to the limit as ε → 0 to obtain (5.3.29). (c2 ) Let c > 0 and define a function z(m, n) by the right hand side of (5.3.32). Then z(m, n) > 0, z(m, 0) = z(0, n) = c, u (m, n) ≤ z (m, n) and z(m, n) is nondecreasing for m, n ∈ N0 . By following the arguments as in the proof of (c1 ) upto (5.3.41) with suitable modifications we get ∆2 ∆1 z (m, n) ≤ [A (m, n) + B (m, n)] g (z (m, n)) .

(5.3.43)

The remaining proof can be completed as in the proof of Theorem 5.2.1 given in [42]. (d1 ) Let c > 0 and define a function z(m, n) by the right hand side of (5.3.35). Then z(m, n) > 0, z(m, 0) = z(0, n) = c, u (m, n) ≤ z (m, n) and z(m, n) is nondecreasing for m, n ∈ N0 and ∆2 ∆1 z (m, n) = b (m, n) u (m, n) +

m−1 X n−1 X

k (m, n, σ, τ ) u (σ, τ )

σ=0 τ =0

+

m−1 X n−1 X σ=0 τ =0







h (m, n, σ, τ, ξ, η) u (ξ, η)

−1 σ−1 X τX ξ=0 η=0

≤ Q (m, n) z (m, n) .

(5.3.44)

The rest of the proof can be completed by following the proof of Theorem 4.2.1 given in [42].

266


(d2 ) The proof can be completed by following the proof of (d1 ) and closely looking at the proof of Theorem 5.2.1 given in [42]. Here we leave the details to the reader. Remark 5.3.3. We note that the inequalities in Theorems 5.3.3 and 5.3.4 can be considered as two independent variable discrete generalizations of the integral inequalities established by Bykov and Salpagarov in [9] (see also [12]). The important feature of these inequalities lies in their successful utilizations to the situations for which the other available inequalities do not apply directly.

5.4 Estimates on certain finite difference inequalities I In [36,41,48,49] Pachpatte has investigated a number of new finite difference inequalities involving functions of two independent variables. In this section we shall give some of the inequalities established in the above papers which find applications in the study of some specific types of finite difference equations. We start with the following theorem which deals with the inequalities proved in [36]. Theorem 5.4.1.

Let u (m, n) , a (m, n) , b (m, n) ∈ D N02 , R+ .

(a1 ) Let a(m, n) be nondecreasing in m and nonincreasing in n . If u (m, n) ≤ a (m, n) +

m−1 X

∞ X

b (s, t) u (s, t) ,

(5.4.1)

s=0 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ a (m, n)

m−1 Y

" 1+

s=0

∞ X

# b (s, t) ,

(5.4.2)

t=n+1

for m, n ∈ N0 . (a2 ) Let a(m, n) be nonincreasing in each variable m and n. If u (m, n) ≤ a (m, n) +

∞ X

∞ X

s=m+1 t=n+1

b (s, t) u (s, t) ,

(5.4.3)

Chapter 5

267

for m, n ∈ N0 , then u (m, n) ≤ a (m, n)

∞ Y

∞ X

" 1+

s=m+1

# b (s, t) ,

(5.4.4)

t=n+1

for m, n ∈ N0 . Proof. (a1 ) First we assume that a(m, n) > 0 for m, n ∈ N0 . From (5.4.1) it is easy to observe that ∞ m−1 X X u (m, n) u (s, t) ≤1+ . b (s, t) a (m, n) a (s, t) s=0 t=n+1

(5.4.5)

Define a function z(m, n) by z (m, n) = 1 +

m−1 X

∞ X

b (s, t)

s=0 t=n+1

then

u(m,n) a(m,n)

u (s, t) , a (s, t)

(5.4.6)

≤ z (m, n) and

[z (m + 1, n) − z (m, n)] − [z (m + 1, n + 1) − z(m, n + 1] = b (m, n + 1)

u (m, n + 1) a (m, n + 1)

≤ b (m, n + 1) z (m, n + 1) .

(5.4.7)

From (5.4.7) and using the facts that z(m, n) > 0, z (m, n + 1) ≤ z (m, n) for m, n ∈ N0 , we observe that [z (m + 1, n) − z (m, n)] [z (m + 1, n + 1) − z (m, n + 1)] − z (m, n) z (m, n + 1) ≤ b (m, n + 1) .

(5.4.8)

Keeping m fixed in (5.4.8), set n = t and sum over t = n, n+1, ..., r−1 (r ≥ n + 1 is arbitrary in N0 ) to obtain [z (m + 1, n) − z (m, n)] [z (m + 1, r) − z (m, r)] − z (m, n) z (m, r) ≤

r X

b (m, t) .

(5.4.9)

t=n+1

lim lim z (m, r) = z (m + 1, r) = 1 and by letting r → ∞ r→∞ r→∞ in (5.4.9) we get

Noting that

∞ X [z (m + 1, n) − z (m, n)] ≤ b (m, t) , z (m, n) t=n+1

268


i.e., ∞ X

" z (m + 1, n) ≤ 1 +

# b (m, t) z (m, n) .

(5.4.10)

t=n+1

Now keeping n fixed in (5.4.10) and setting m = s and substituting s = 0, 1, 2, ..., m − 1 successively and using the fact that z(0, n) = 1 we get # " m−1 ∞ Y X b (s, t) . (5.4.11) 1+ z (m, n) ≤ s=0

t=n+1

Using (5.4.11) in (5.4.5) we get the required inequality in (5.4.2). If a(m, n) is nonnegative, we carry out the above procedure with a (m, n) + ε instead of a(m, n), where ε > 0 is an arbitrary small constant , and subsequently pass to the limit as ε → 0 to obtain (5.4.2). (a2 ) We first assume that a(m, n) > 0 for m, n ∈ N0 . From (5.4.3) it is easy to observe that ∞ ∞ X X u (s, t) u (m, n) ≤1+ . b (s, t) a (m, n) a (s, t) s=m+1 t=n+1

Define a function z(m, n) by the right hand side of (5.4.12), then z (m, n) and

(5.4.12) u(m,n) a(m,n)

≤

[z (m, n) − z (m + 1, n)] − [z (m, n + 1) − z(m + 1, n + 1] = b (m + 1, n + 1)

u (m + 1, n + 1) a (m + 1, n + 1)

≤ b (m + 1, n + 1) z (m + 1, n + 1) .

(5.4.13)

From (5.4.13) and using the facts that z(m, n) > 0, z (m + 1, n + 1) ≤ z (m + 1, n) for m, n ∈ N0 , we observe that [z (m, n) − z (m + 1, n)] [z (m, n + 1) − z (m + 1, n + 1)] − z (m + 1, n) z (m + 1, n + 1) ≤ b (m + 1, n + 1) .

(5.4.14)

Keeping m fixed in (5.4.14), set n = t and sum over t = n, n + 1, ..., q − 1 (q ≥ n + 1 is arbitrary in N0 ) to obtain [z (m, n) − z (m + 1, n)] [z (m, q) − z (m + 1, q)] − z (m + 1, n) z (m + 1, q) ≤

q X t=n+1

b (m + 1, t) .

(5.4.15)

Chapter 5

269

lim lim z (m, q) = z (m + 1, q) = 1 and by letting q → ∞ q→∞ q→∞ in (5.4.15) we get

Noting that

∞ X [z (m, n) − z (m + 1, n)] ≤ b (m + 1, t) , z (m + 1, n) t=n+1

i.e. ∞ X

" z (m, n) ≤ 1 +

# b (m + 1, t) z (m + 1, n) .

(5.4.16)

t=n+1

Now keeping n fixed in (5.4.16) and by setting m = s and by substituting s = m, m + 1, ..., p − 1 (p ≥ m + 1 is arbitrary in N0 ) successively, we obtain " # p ∞ Y X 1+ b (s, t) . (5.4.17) z (m, n) ≤ z (p, n) s=m+1

Noting that

t=n+1

lim z (p, n) = 1, and letting p → ∞ in (5.4.17) we get p→∞

z (m, n) ≤

∞ Y

∞ X

"

s=m+1

1+

# b (s, t) .

(5.4.18)

t=n+1

Using (5.4.18) in (5.4.12) we get the required inequality in (5.4.4). The case, when a(m, n) is nonnegative can be completed as mentioned in the proof of part (a1 ). In the following theorems we present the inequalities investigated in [36]. Theorem 5.4.2. Let u (m, n) , b (m, n) ∈ D N02 , R+ and c ≥ 0 be a real constant. Let g ∈ C (R+ , R+ ) be a nondecreasing function with g(u) > 0 for u > 0. (b1 ) If u (m, n) ≤ c +

m−1 X

∞ X

b (s, t) g (u (s, t)) ,

(5.4.19)

s=0 t=n+1

for m, n ∈ N0 , then for 0 ≤ m ≤ m1 , 0 ≤ n ≤ n1 ; m, m1 , n, n1 ∈ N0 , # " ∞ m−1 X X −1 u (m, n) ≤ G b (s, t) , G (c) + s=0 t=n+1

(5.4.20)

270


where Zr G (r) =

ds , r > 0, g (s)

(5.4.21)

r0

r0 > 0 is arbitrary, G−1 is the inverse of G and m1 , n1 ∈ N0 are chosen so that G (c) +

m−1 X

∞ X

b (s, t) ∈ Dom G−1 ,

s=0 t=n+1

for all m, n ∈ N0 such that 0 ≤ m ≤ m1 , 0 ≤ n ≤ n1 . (b2 ) If u (m, n) ≤ c +

∞ X

∞ X

b (s, t) g (u (s, t)) ,

(5.4.22)

s=m+1 t=n+1

for m, n ∈ N0 , then for 0 ≤ m ≤ m2 , 0 ≤ n ≤ n2 ; m, m2 , n, n2 ∈ N0 , # " ∞ ∞ X X u (m, n) ≤ G−1 G (c) + b (s, t) ,

(5.4.23)

s=m+1 t=n+1

where G, G−1 are as in (b1 ) and m2 , n2 are chosen so that G (c) +

∞ X

∞ X

b (s, t) ∈ Dom G−1 ,

s=m+1 t=n+1

for all m, n ∈ N0 such that 0 ≤ m ≤ m2 , 0 ≤ n ≤ n2 . Theorem 5.4.3. Let u (m, n) , a (m, n) , b (m, n) ∈ D N02 , R+ and L : N02 × R+ → R+ be a function which satisfies the condition 0 ≤ L (m, n, u) − L (m, n, v) ≤ M (m, n, v) (u − v) ,

(5.4.24)

for u ≥ v ≥ 0,, where M : N02 × R+ → R+ . (c1 ) If u (m, n) ≤ a (m, n) + b (m, n)

m−1 X

∞ X

s=0 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ a (m, n) + b (m, n) e (m, n)

L (s, t, u (s, t)) ,

(5.4.25)

Chapter 5

×

m−1 Y

" 1+

s=0

∞ X

271 #

M (s, t, a (s, t)) b (s, t) ,

(5.4.26)

t=n+1

for m, n ∈ N0 , where e (m, n) =

m−1 X

∞ X

L (s, t, a (s, t)) ,

(5.4.27)

s=0 t=n+1

for m, n ∈ N0 . (c2 ) If u (m, n) ≤ a (m, n) + b (m, n)

∞ X

∞ X

L (s, t, u (s, t)) ,

(5.4.28)

s=m+1 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ a (m, n) + b (m, n) e¯ (m, n) # " ∞ ∞ Y X M (s, t, a (s, t)) b (s, t) , 1+ × s=m+1

(5.4.29)

t=n+1

for m, n ∈ N0 , where e¯ (m, n) =

∞ X

∞ X

L (s, t, a (s, t)) ,

(5.4.30)

s=m+1 t=n+1

for m, n ∈ N0 . Theorem 5.4.4. Let u (m, n) , a (m, n) , b (m, n) ∈ D N02 , R+ and L : N02 × R+ → R+ be a function which satisfies the condition 0 ≤ L (m, n, u) − L (m, n, v) ≤ M (m, n, v) ψ −1 (u − v) ,

(5.4.31)

N02

× R+ → R+ and ψ : R+ → R+ be a continuous for u ≥ v ≥ 0, where M : and strictly increasing function with ψ (0) = 0, ψ −1 is the inverse function of ψ and ψ −1 (xy) ≤ ψ −1 (x) ψ −1 (y) for x, y ∈ R+ . (d1 ) If u (m, n) ≤ a (m, n) + b (m, n) ψ

m−1 X

∞ X

! L (s, t, u (s, t)) ,

(5.4.32)

s=0 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ a (m, n) + b (m, n) " #! m−1 ∞ Y X 1+ M (s, t, a (s, t)) ψ −1 (b (s, t)) , ×ψ e (m, n) s=0

t=n+1

for m, n ∈ N0 where e(m, n) is defined by (5.4.27).

(5.4.33)

272


(d2 ) If u (m, n) ≤ a (m, n) + b (m, n) ψ

∞ X

∞ X

! L (s, t, u (s, t)) ,

(5.4.34)

s=m+1 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ a (m, n) + b (m, n) #! " ∞ ∞ Y X −1 M (s, t, a (s, t)) ψ (b (s, t)) , 1+ ×ψ e¯ (m, n) s=m+1

(5.4.35)

t=n+1

for m, n ∈ N0 , where e¯ (m, n) is defined by (5.4.30). Proofs of Theorems 5.4.2-5.4.4. We give the details of the proofs of (b1 ) , (c1 ) , (d1 ) only. The proofs of (b2 ) , (c2 ) , (d2 ) can be completed similarly with suitable modifications. (b1 ) Let c > 0 and define a function z(m, n) by the right hand side of (5.4.19). Then u (m, n) ≤ z (m, n) and [z (m + 1, n) − z (m, n)] − [z (m + 1, n + 1) − z(m, n + 1] = b (m, n + 1) g (u (m, n + 1)) ≤ b (m, n + 1) g (z (m, n + 1)) .

(5.4.36)

From (5.4.36) and using the facts that z(m, n) > 0, z (m, n + 1) ≤ z (m, n) for m, n ∈ N0 , we observe that [z (m + 1, n) − z (m, n)] [z (m + 1, n + 1) − z(m, n + 1] − g (z (m, n)) g (z (m, n + 1)) ≤ b (m, n + 1) .

(5.4.37)

Now by following the similar arguments as in the proof of Theorem 5.4.1, part (a1 ) below (5.4.8) upto (5.4.10) we have ∞ X [z (m + 1, n) − z (m, n)] ≤ b (m, t). g (z (m, n)) t=n+1

(5.4.38)

From (5.4.21) and (5.4.38) we have z(m+1,n) Z

G (z (m + 1, n)) − G (z (m, n)) = z(m,n)

≤

1 [z (m + 1, n) − z (m, n)] g (z (m, n))

ds g (s)

Chapter 5

≤

∞ X

273

b (m, t) .

(5.4.39)

t=n+1

Keeping n fixed in (5.4.39), setting m = s and taking the sum over s = 0, 1, 2, ..., m − 1 and using the fact that z(0, n) = c we obtain G (z (m, n)) − G (c) ≤

m−1 X

∞ X

b (s, t) .

(5.4.40)

s=0 t=n+1

The required inequality in (5.4.20) follows from (5.4.40) and the fact that u (m, n) ≤ z (m, n). The proof of the case when c ≥ 0 can be completed as mentioned in the proof of Theorem 5.4.1, part (a1 ). The subdomain 0 ≤ m ≤ m1 , 0 ≤ n ≤ n1 is obvious. (c1 ) Define a function z(m, n) by z (m, n) =

m−1 X

∞ X

L (s, t, u (s, t)) .

(5.4.41)

s=0 t=n+1

Then (5.4.25) can be restated as u (m, n) ≤ a (m, n) + b (m, n) z (m, n) .

(5.4.42)

From (5.4.41), (5.4.42) and (5.4.24) we observe that u (m, n) ≤

m−1 X

∞ X

{L (s, t, a (s, t) + b (s, t) z (s, t))

s=0 t=n+1

−L (s, t, a (s, t)) + L (s, t, a (s, t))}

≤ e (m, n) +

m−1 X

∞ X

M (s, t, a (s, t)) b (s, t) z (s, t) ,

(5.4.43)

s=0 t=n+1

where e(m, n) is defined by (5.4.27). Clearly e(m, n) is real-valued, nonnegative,nondecreasing in m and nonincreasing in n for m, n ∈ N0 . Now an application of Theorem 5.4.1, part (a1 ) to (5.4.43) yields z (m, n) ≤ e (m, n)

m−1 Y s=0

" 1+

∞ X

# M (s, t, a (s, t)) b (s, t) .

t=n+1

The desired inequality in (5.4.26) follows from (5.4.42) and (5.4.44).

(5.4.44)

274


(d1 ) Define a function z(m, n) by (5.4.41), then from (5.4.32) we have u (m, n) ≤ a (m, n) + b (m, n) ψ (z (m, n)) .

(5.4.45)

From (5.4.41), (5.4.45), (5.4.31) and the hypotheses on ψ we observe that z (m, n) ≤

m−1 X

∞ X

{L (s, t, a (s, t) + b (s, t) ψ (z (s, t)))

s=0 t=n+1

−L (s, t, a (s, t)) + L (s, t, a (s, t))} ≤ e (m, n) +

m−1 X

∞ X

M (s, t, a (s, t)) ψ −1 (b (s, t))z (s, t) ,

s=0 t=n+1

where e(m, n) is defined by (5.4.27). Now, by following the last arguments as in the proof of (c1 ) given above we get the desired inequality in (5.4.33). Remark 5.4.1. We note that the inequalities in Theorem5.4.2 are the useful versions of the more general inequalities given in [36, Theorem 2] and in the various special cases the inequalities in Theorems 5.4.3 and 5.4.4 can also be useful in certain applications. The discrete analogues of Theorems 2.5.3-2.5.5 established in [41] are embodied in the following theorems. Theorem 5.4.5.

Let u (m, n) , a (m, n) , b (m, n) , c (m, n) ∈ D N02 , R+ .

(e1 ) If u (m, n) ≤ a (m, n) + b (m, n)

m−1 X

∞ X

c (s, t) u (s, t) ,

(5.4.46)

s=0 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ a (m, n) + b (m, n) f (m, n)

m−1 Y s=0

" 1+

∞ X

# c (s, t) b (s, t) , (5.4.47)

t=n+1

for m, n ∈ N0 , where f (m, n) =

m−1 X

∞ X

s=0 t=n+1

for m, n ∈ N0 .

c (s, t) a (s, t) ,

(5.4.48)

Chapter 5

275

(e2 ) If ∞ X

u (m, n) ≤ a (m, n) + b (m, n)

∞ X

c (s, t) u (s, t) ,

(5.4.49)

s=m+1 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ a (m, n) + b (m, n) f¯ (m, n)

×

∞ Y

∞ X

" 1+

s=m+1

# c (s, t) b (s, t) ,

(5.4.50)

t=n+1

for m, n ∈ N0 , where ∞ X

∞ X

f¯ (m, n) =

c (s, t) a (s, t) ,

(5.4.51)

s=m+1 t=n+1

for m, n ∈ N0 . Let u (m, n) , a (m, n) , b (m, n) , c (m, n) ∈ D N02 , R+ .

Theorem 5.4.6.

(p1 ) Assume that a(m, n) is nondecreasing in m for m ∈ N0 . If u (m, n) ≤ a (m, n) +

m−1 X

b (s, n) u (s, n) +

s=0

m−1 X

∞ X

c (s, t) u (s, t) , (5.4.52)

s=0 t=n+1

for m, n ∈ N0 , then z (m, n) ≤ q (m, n) [a (m, n) + F (m, n)

×

m−1 Y

" 1+

s=0

∞ X

## c (s, t) q (s, t)

,

(5.4.53)

t=n+1

for m, n ∈ N0 , where q (m, n) =

m−1 Y

[1 + b (s, n)] ,

(5.4.54)

s=0

F (m, n) =

m−1 X

∞ X

s=0 t=n+1

for m, n ∈ N0 .

c (s, t) q (s, t) a (s, t) ,

(5.4.55)

276


(p2 ) Assume that a(m, n) is nonincreasing in m for m ∈ N0 . If ∞ X

u (m, n) ≤ a (m, n) +

b (s, n) u (s, n)

s=m+1

+

∞ X

∞ X

c (s, t) u (s, t) ,

(5.4.56)

s=m+1 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ q¯ (m, n) a (m, n) + F¯ (m, n) " ## m−1 ∞ Y X × 1+ c (s, t) q¯ (s, t) , s=0

(5.4.57)

t=n+1

for m, n ∈ N0 , where ∞ Y

q¯ (m, n) =

[1 + b (s, n)] ,

(5.4.58)

s=m+1

F¯ (m, n) =

∞ X

∞ X

c (s, t) q¯ (s, t) a (s, t) ,

(5.4.59)

s=m+1 t=n+1

for m, n ∈ N0 . Theorem 5.4.7. Let u (m, n) , a (m, n) , b (m, n) ∈ D N02 , R+ . Let L, M be as in Theorem 5.4.3 and the condition (5.4.24) holds. (q1 ) Assume that a(m, n) is nondecreasing in m for m ∈ N0 . If u (m, n) ≤ a (m, n) +

m−1 X s=0

b (s, n) u (s, n) +

m−1 X

∞ X

L (s, t, u (s, t)) , (5.4.60)

s=0 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ q (m, n) [a (m, n) + H (m, n) ## " m−1 ∞ Y X × M (s, t, q (s, t) a (s, t)) q (s, t) , 1+ s=0

(5.4.61)

t=n+1

for m, n ∈ N0 , where q(m, n) is defined by (5.4.54) and H (m, n) =

m−1 X

∞ X

s=0 t=n+1

for m, n ∈ N0 .

L (s, t, q (s, t) a (s, t)) ,

(5.4.62)

Chapter 5

277

(q2 ) Assume that a(m, n) is nonincreasing in m for m ∈ N0 . If ∞ X

u (m, n) ≤ a (m, n) +

b (s, n) u (s, n)

s=m+1

+

∞ X

∞ X

L (s, t, u (s, t)) ,

(5.4.63)

s=m+1 t=n+1

for m, n ∈ N0 , then ¯ (m, n) u (m, n) ≤ q¯ (m, n) a (m, n) + H ## " ∞ ∞ Y X × M (s, t, q¯ (s, t) a (s, t)) q¯ (s, t) , 1+ s=m+1

(5.4.64)

t=n+1

for m, n ∈ N0 , where q¯ (m, n) is defined by (5.4.58) and ∞ X

¯ (m, n) = H

∞ X

L (s, t, q¯ (s, t) a (s, t)) ,

(5.4.65)

s=m+1 t=n+1

for m, n ∈ N0 . Proofs of Theorems 5.4.5-5.4.7. We give the proofs of (e1 ) , (p2 ) , (q1 ); the proofs of (e2 ) , (p1 ) , (q2 ) can be completed similarly. (e1 ) Define a function z(m, n) by z (m, n) =

m−1 X

∞ X

c (s, t) u (s, t) ,

(5.4.66)

s=0 t=n+1

then (5.4.46) can be restated as u (m, n) ≤ a (m, n) + b (m, n) z (m, n) .

(5.4.67)

From (5.4.66) and (5.4.67) we have z (m, n) ≤

m−1 X

∞ X

c (s, t) [a (s, t) + b (s, t) z (s, t)]

s=0 t=n+1

≤ f (m, n) +

m−1 X

∞ X

c (s, t) b (s, t) z (s, t) ,

(5.4.68)

s=0 t=n+1

where f (m, n) is defined by (5.4.48). Clearly, f (m, n) is real-valued, nonnegative function, nondecreasing in m and nonincreasing in n for m, n ∈ N0 . Now, an application of Theorem 5.4.1, part (a1 ) to (5.4.68) yields " # m−1 ∞ Y X 1+ c (s, t) b (s, t) . (5.4.69) z (m, n) ≤ f (m, n) s=0

t=n+1

The required inequality in (5.4.47) follows from (5.4.67) and (5.4.69).

278


(p2 ) Define a function w(m, n) by ∞ X

∞ X

w (m, n) = a (m, n) +

c (s, t) u (s, t) ,

(5.4.70)

s=m+1 t=n+1

then (5.4.56) can be restated as ∞ X

u (m, n) ≤ w (m, n) +

b (s, n) u (s, n) .

(5.4.71)

s=m+1

Clearly, w(m, n) is real-valued, nonnegative and nonincreasing in m for m ∈ N0 . Keeping n fixed in (5.4.71) and applying Theorem 4.5.3, part (c1 ) to (5.4.71), we obtain u (m, n) ≤ w (m, n) q¯ (m, n) ,

(5.4.72)

where q¯ (m, n) is defined by (5.4.58). From (5.4.72) and (5.4.70) we have u (m, n) ≤ q¯ (m, n) [a (m, n) + v (m, n)] ,

(5.4.73)

where v (m, n) =

∞ X

∞ X

c (s, t) u (s, t) .

(5.4.74)

s=m+1 t=n+1

From (5.4.74) and (5.4.73), it is easy to see that v (m, n) ≤ F¯ (m, n) +

∞ X

∞ X

c (s, t) q¯ (s, t) v (s, t) ,

(5.4.75)

s=m+1 t=n+1

where F¯ (m, n) is defined by (5.4.59). Clearly, F¯ (m, n) is real-valued nonnegative function, nonincreasing in each variable m and n for m, n ∈ N0 . An application of Theorem 5.4.1, part (a2 ) to (5.4.75) yields " # ∞ ∞ Y X ¯ 1+ c (s, t) q¯ (s, t) . (5.4.76) v (m, n) ≤ F (m, n) s=m+1

t=n+1

Using (5.4.76) in (5.4.73) we get the required inequality in (5.4.57). (q1 ) Define a function z(m, n) by z (m, n) = a (m, n) +

∞ X

m−1 X

L (s, t, u (s, t)) ,

(5.4.77)

s=0 t=n+1

then (5.4.60) can be restated as u (m, n) ≤ z (m, n) +

m−1 X s=0

b (s, n) u (s, n) .

(5.4.78)

Chapter 5

279

Clearly, z(m, n) is real-valued, nonnegative and nondecreasing function in m for m ∈ N0 . Keeping n fixed in (5.4.78) and applying Corollary 1.2.5 given in [42, p. 15] to (5.4.78) we get u (m, n) ≤ z (m, n) q (m, n) ,

(5.4.79)

where q(m, n) is defined by (5.4.54). From (5.4.79) and (5.4.77) we have u (m, n) ≤ q (m, n) [a (m, n) + v (m, n)] ,

(5.4.80)

where v (m, n) =

∞ X

m−1 X

L (s, t, u (s, t)) .

(5.4.81)

s=0 t=n+1

From (5.4.81), (5.4.80) and the hypotheses on L we observe that v (m, n) ≤

m−1 X

∞ X

{L (s, t, q (s, t) [a (s, t) + v (s, t)]) − L (s, t, q (s, t) a (s, t))

s=0 t=n+1

+L (s, t, q (s, t) a (s, t))} ≤ H (m, n) +

m−1 X

∞ X

M (s, t, q (s, t) a (s, t)) q (s, t) v (s, t) ,

(5.4.82)

s=0 t=n+1

where H(m, n) is defined by (5.4.62). Clearly, H(m, n) is real-valued, nonnegative, nondecreasing function in m and nonincreasing in n for m, n ∈ N0 . Now, applying Theorem 5.4.1, part (a1 ) to (5.4.82) and substituting the bound on v(m, n) in (5.4.80), we get the required inequality in (5.4.61). The next theorem contains the inequalities obtained in [49]. Theorem 5.4.8. Let u (m, n) , a (m, n) ∈ D N02 , R+ and c ≥ 0 be a real constant. (r1 ) If u2 (m, n) ≤ c +

m−1 X

∞ X

a (s, t) u (s, t) ,

(5.4.83)

s=0 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ for m, n ∈ N0 .

m−1 ∞ √ 1 X X c+ a (s, t) , 2 s=0 t=n+1

(5.4.84)

280


(r2 ) Let g, G, G−1 be as in Theorem 5.4.2, part (b1 ).If u2 (m, n) ≤ c +

m−1 X

∞ X

a (s, t) u (s, t) g (u (s, t)) ,

(5.4.85)

s=0 t=n+1

for m, n ∈ N0 , then for 0 ≤ m ≤ m3 , 0 ≤ n ≤ n3 ; m, m3 , n, n3 ∈ N0 , # " ∞ X X √ 1 m−1 −1 u (m, n) ≤ G a (s, t) , G c + 2 s=0 t=n+1

(5.4.86)

and m3 , n3 ∈ N0 are chosen so that G

∞ X X √ 1 m−1 c + a (s, t) ∈ Dom G−1 , 2 s=0 t=n+1

for all m, n ∈ N0 such that 0 ≤ m ≤ m3 , 0 ≤ n ≤ n3 . (r3 ) Let L, M be as in Theorem 5.4.3 and the condition (5.4.24) holds. If u2 (m, n) ≤ c +

m−1 X

∞ X

a (s, t) u (s, t) L (s, t, u (s, t)) ,

(5.4.87)

s=0 t=n+1

for m, n ∈ N0 , then # " m−1 ∞ Y √ √ 1 X u (m, n) ≤ c + h (m, n) a (s, t) M s, t, c , 1+ 2 t=n+1 s=0

(5.4.88)

for m, n ∈ N0 , where h (m, n) =

m−1 ∞ √ 1 X X a (s, t) L s, t, c , 2 s=0 t=n+1

(5.4.89)

for m, n ∈ N0 . Proof. (r1 ) Let c > 0 and p define a function z(m, n) by the right hand side of (5.4.83), then u (m, n) ≤ z (m, n) and [z (m + 1, n) − z (m, n)] − [z (m + 1, n + 1) − z(m, n + 1)] = a (m, n + 1) u (m, n + 1) p ≤ a (m, n + 1) z (m, n + 1). (5.4.90) p p p p By z (m, n + 1) ≤ z (m, n), z (m, n + 1) ≤ p z (m, n) > 0, p p using the facts that z (m + 1, n + 1), z (m + 1, n + 1) ≤ z (m + 1, n), we observe that i hp i hp p p z (m + 1, n) − z (m, n) − z (m + 1, n + 1) − z (m, n + 1)

Chapter 5

281

[z (m + 1, n + 1) − z (m, n + 1)] [z (m + 1, n) − z (m, n)] p p =p −p z (m + 1, n) + z (m, n) z (m + 1, n + 1) + z (m, n + 1) [z (m + 1, n) − z (m, n)] [z (m + 1, n + 1) − z (m, n + 1)] p p −p z (m + 1, n + 1) + z (m, n + 1) z (m + 1, n + 1) + z (m, n + 1)

≤p =

[z (m + 1, n) − z (m, n)] − [z (m + 1, n + 1) − z (m, n + 1)] p p z (m + 1, n + 1) + z (m, n + 1)

≤

[z (m + 1, n) − z (m, n)] − [z (m + 1, n + 1) − z (m, n + 1)] p p z (m, n + 1) + z (m, n + 1)

1 a (m, n + 1) . (5.4.91) 2 Here, we have used (5.4.90) to get (5.4.91). Now, keeping m fixed in (5.4.91), set n = t and sum over t = n, n + 1, ..., q − 1 (q ≥ n + 1 is arbitrary in N0 ) to obtain hp i hp i p p z (m + 1, n) − z (m, n) − z (m + 1, q) − z (m, q) ≤

≤

q 1 X a (m, t) . 2 t=n+1

(5.4.92)

p √ lim p z (m + 1, q) = z (m, q) = c, and by letting q → ∞ q→∞ in (5.4.92) we get

Noting that

∞ p p 1 X z (m + 1, n) − z (m, n) ≤ a (m, t) . 2 t=n+1

(5.4.93)

Keeping n fixed in (5.4.93), set m = s and sum over s = 0, 1, 2, ..., m − 1 and use the fact that z(0, n) = c, to obtain p

z (m, n) ≤

m−1 ∞ √ 1 X X c+ a (s, t) . 2 s=0 t=n+1

(5.4.94)

The p desired inequality in (5.4.84) follows by using the fact that u (m, n) ≤ z (m, n). If c ≥ 0, we carry out the above procedure with c + ε instead of c, where ε > 0 is an arbitrary small constant, and subsequently pass to the limit as ε → 0 to obtain (5.4.84). (r2 ) Let c > 0 and define a function z(m, n) by the right hand side of (5.4.85). Then by following the same arguments as in the proof of (r1 ) upto (5.4.91) with suitable changes we get i hp i hp p p z (m + 1, n) − z (m, n) − z (m + 1, n + 1) − z (m, n + 1)

282


p 1 a (m, n + 1) g z (m, n + 1) . (5.4.95) 2 p p From (5.4.95) and using the fact that g z (m, n + 1) ≤ g z (m, n) we observe that hp i hp i p p z (m + 1, n) − z (m, n) z (m + 1, n + 1) − z (m, n + 1) p p − g z (m, n) g z (m, n + 1) ≤

1 a (m, n + 1) . (5.4.96) 2 Keeping m fixed in (5.4.96), set n = t and sum over t = n, n + 1, ..., q − 1 ( q ≥ n + 1 is arbitrary in N0 ) to obtain the estimate hp i hp i p p z (m + 1, n) − z (m, n) z (m + 1, q) − z (m, q) p p − g z (m, n) g z (m, q) ≤

≤

q 1 X a (m, t) 2 t=n+1

(5.4.97)

p √ lim p z (m + 1, q) = z (m, q) = c and by letting q → ∞ in q→∞ (5.4.97) we get hp i p ∞ z (m + 1, n) − z (m, n) 1 X p ≤ a (m, t) . (5.4.98) 2 t=n+1 g z (m, n)

Noting that

From (5.4.21) and (5.4.98) we have √ G

p

z(m+1,n)

Z

p z (m + 1, n) − G z (m, n) = √

ds g (s)

z(m,n)

hp i p z (m + 1, n) − z (m, n) p ≤ g z (m, n) ≤

∞ 1 X a (m, t) . 2 t=n+1

(5.4.99)

Now keeping n fixed in (5.4.99), set m = s and sum both sides over s = 0, 1, 2, ..., m − 1 and use the fact that z(0, n) = c to obtain G

p

∞ X X √ 1 m−1 z (m, n) ≤ G c + a (s, t) . 2 s=0 t=n+1

(5.4.100))

Chapter 5

283

p The required inequality in (5.4.86) follows from (5.4.100) and u (m, n) ≤ z (m, n). The case c ≥ 0 can be completed as mentioned in the proof of part (r1 ). The subdomain 0 ≤ m ≤ m3 , 0 ≤ n ≤ n3 is obvious. (r3 ) Let c > 0 and p define a function z(m, n) by the right hand side of (5.4.87). Then u (m, n) ≤ z (m, n) and by following the proof of (r1 ) upto (5.4.91) with suitable changes we get i hp i hp p p z (m + 1, n) − z (m, n) − z (m + 1, n + 1) − z (m, n + 1) ≤

p 1 a (m, n + 1) L m, n + 1, z (m, n + 1) . 2

(5.4.101)

Further by following the arguments as in the proof of (r1 ) below (5.4.91) upto (5.4.94) with suitable changes we get p

z (m, n) ≤

m−1 ∞ p √ 1 X X c+ a (s, t) L s, t, z (s, t) . 2 s=0 t=n+1

(5.4.102)

Define a function v(m, n) by v (m, n) =

m−1 ∞ p 1 X X a (s, t) L s, t, z (s, t) . 2 s=0 t=n+1

(5.4.103)

From (5.4.103), (5.4.102) and the hypotheses on L we observe that v (m, n) ≤

m−1 ∞ √ √ √ 1 X X a (s, t) L s, t, c + v (s, t) −L s, t, c + L s, t, c 2 s=0 t=n+1

≤ h (m, n) +

m−1 ∞ √ 1 X X a (s, t) M s, t, c v (s, t) , 2 s=0 t=n+1

(5.4.104)

where h(m, n) is defined by (5.4.89). Clearly, h(m, n) is a real-valued nonnegative function, nondecreasing in m and nonincreasing in n for m, n ∈ N0 . An application of Theorem 5.4.1, part (a1 ) to (5.4.104) yields " # m−1 ∞ Y √ 1 X v (m, n) ≤ h (m, n) 1+ a (s, t) M s, t, c . (5.4.105) 2 t=n+1 s=0 The p required inequality in (5.4.88) follows by using the fact that u (m, n) ≤ z (m, n) and (5.4.102). The proof of the case when c ≥ 0 can be completed as mentioned in the proof of (r1 ). Our final theorem in this section deals with the inequalities proved in [48].

284


Theorem 5.4.9. Let u (m, n) , a (m, n) , b (m, n) , c (m, n) ∈ D N02 , R+ and p > 1 be a real constant. (s1 ) If up (m, n) ≤ a (m, n) + b (m, n)

m−1 X

∞ X

c (s, t) u (s, t) ,

(5.4.106)

s=0 t=n+1

for m, n ∈ N0 , then u (m, n) ≤ {a (m, n) + b (m, n) E (m, n)

×

m−1 Y s=0

"

∞ X

b (s, t) c (s, t) 1+ p t=n+1

#) p1 ,

(5.4.107)

for m, n ∈ N0 , where E (m, n) =

∞ X

m−1 X

c (s, t)

s=0 t=n+1

p − 1 a (s, t) + p p

,

(5.4.108)

for m, n ∈ N0 . (s2 ) Let L, M be as in Theorem 5.4.3 and the condition (5.4.24) holds. If up (m, n) ≤ a (m, n) + b (m, n)

m−1 X

∞ X

L (s, t, u (s, t)) ,

(5.4.109)

s=0 t=n+1

for m, n ∈ N0 , then ¯ (m, n) u (m, n) ≤ a (m, n) + b (m, n) E

×

m−1 Y

" 1+

s=0

∞ X

M

t=n+1

p − 1 a (s, t) + s, t, p p

b (s, t) p

#) p1 ,

(5.4.110)

for m, n ∈ N0 , where ¯ (m, n) = E

m−1 X s=0

for m, n ∈ N0 .

∞ X

p − 1 a (s, t) + L s, t, p p t=n+1

,

(5.4.111)

Chapter 5

285

Proof. (s1 ) Define a function z(m, n) by z (m, n) =

m−1 X

∞ X

c (s, t) u (s, t) .

(5.4.112)

s=0 t=n+1

Then (5.4.106) can be written as up (m, n) ≤ a (m, n) + b (m, n) z (m, n) .

(5.4.113)

From (5.4.113) as in the proof of Theorem 2.3.3, part (c1 ) we get u (m, n) ≤

p − 1 a (m, n) b (m, n) + + z (m, n) . p p p

(5.4.114)

From (5.4.112) and (5.4.114) we have z (m, n) ≤

m−1 X

∞ X

c (s, t)

s=0 t=n+1

≤ E (m, n) +

m−1 X

∞ X

s=0 t=n+1

p − 1 a (s, t) b (s, t) + + z (s, t) p p p

c (s, t)

b (s, t) z (s, t) , p

(5.4.115)

where E(m, n)is defined by (5.4.108). Clearly, E(m, n) is real-valued, nonnegative function, nondecreasing in m and nonincreasing in n for m, n ∈ N0 . An application of Theorem 5.4.1, part (a1 ) to (5.4.115) yields # " m−1 ∞ Y X b (s, t) z (m, n) ≤ E (m, n) . (5.4.116) c (s, t) 1+ p s=0 t=n+1 The required inequality in (5.4.107) follows from (5.4.113) and (5.4.116). (s2 ) The proof follows by closely looking at the proof of (s1 ) given above and the proof ofTheorem 5.4.3, part (c1 ). Here we omit the details.

Remark 5.4.2.

We note that one can very easily obtain explicit bounds on the

inequalities given in (5.4.83), (5.4.85), (5.4.87), (5.4.106), (5.4.109) by replacing ∞ ∞ m−1 ∞ P P P P by . Here we leave the details of such the double sum s=0 t=n+1

s=m+1 t=n+1

results to the readers to fill in where neede

286


5.5 Estimates on certain finite difference inequalities II In this section we shall give some more finite difference inequalities, recently established by Pachpatte in [62,71,76], which can be used conveniently in certain new applications for which the inequalities given earlier do not apply directly. Our first theorem deals with the inequalities investigated in [76]. Theorem 5.5.1. D N02 , R+ .

Let u (m, n) , a (m, n) , b (m, n) , c (m, n) , f (m, n) , g (m, n) ∈

(a1 ) Suppose that u (m, n) ≤ a (m, n) + b (m, n)

m−1 X n−1 X

f (s, t) u (s, t)

s=0 t=0

+c (m, n)

∞ ∞ X X

g (s, t) u (s, t),

(5.5.1)

s=0 t=0

for m, n ∈ N0 . If q1 =

∞ ∞ X X

g (s, t) Q1 (s, t) < 1,

(5.5.2)

s=0 t=0

then u (m, n) ≤ P1 (m, n) + N1 Q1 (m, n) ,

(5.5.3)

for m, n ∈ N0 , where P1 (m, n) = a (m, n) + b (m, n) L1 (m, n)

m−1 X n−1 X

f (s, t) a (s, t) ,

(5.5.4)

f (s, t) c (s, t) ,

(5.5.5)

s=0 t=0

Q1 (m, n) = c (m, n) + b (m, n) L1 (m, n)

m−1 X n−1 X s=0 t=0

L1 (m, n) =

m−1 Y s=0

" 1+

n−1 X

# f (s, t) b (s, t) ,

(5.5.6)

t=0

and N1 =

∞ ∞ 1 XX g (s, t) P1 (s, t) . 1 − q1 s=0 t=0

(5.5.7)

Chapter 5

287

(a2 ) Suppose that ∞ X

∞ X

u (m, n) ≤ a (m, n) + b (m, n)

f (s, t) u (s, t)

s=m+1 t=n+1

+c (m, n)

∞ ∞ X X

g (s, t) u (s, t),

(5.5.8)

s=0 t=0

for m, n ∈ N0 . If q2 =

∞ ∞ X X

g (s, t) Q2 (s, t) < 1,

(5.5.9)

s=0 t=0

then u (m, n) ≤ P2 (m, n) + N2 Q2 (m, n) ,

(5.5.10)

for m, n ∈ N0 , where ∞ X

∞ X

P2 (m, n) = a (m, n) + b (m, n) L2 (m, n)

f (s, t) a (s, t) , (5.5.11)

s=m+1 t=n+1 ∞ X

∞ X

Q2 (m, n) = c (m, n) + b (m, n) L2 (m, n)

f (s, t) c (s, t) , (5.5.12)

s=m+1 t=n+1

L2 (m, n) =

∞ Y

" 1+

s=m+1

∞ X

# f (s, t) b (s, t) ,

(5.5.13)

t=n+1

and N2 =

∞ ∞ 1 XX g (s, t) P2 (s, t) . 1 − q2 s=0 t=0

(5.5.14)

(a3 ) Suppose that u (m, n) ≤ a (m, n) + b (m, n)

m−1 X

∞ X

f (s, t) u (s, t)

s=0 t=n+1

+c (m, n)

∞ ∞ X X

g (s, t) u (s, t),

(5.5.15)

s=0 t=0

for m, n ∈ N0 . If q3 =

∞ ∞ X X s=0 t=0

g (s, t) Q3 (s, t) < 1,

(5.5.16)

288


then u (m, n) ≤ P3 (m, n) + N3 Q3 (m, n) ,

(5.5.17)

for m, n ∈ N0 , where P3 (m, n) = a (m, n) + b (m, n) L3 (m, n)

m−1 X

∞ X

f (s, t) a (s, t) , (5.5.18)

s=0 t=n+1

Q3 (m, n) = c (m, n) + b (m, n) L3 (m, n)

m−1 X

∞ X

f (s, t) c (s, t) , (5.5.19)

s=0 t=n+1

L3 (m, n) =

m−1 Y

" 1+

s=0

∞ X

# f (s, t) b (s, t) ,

(5.5.20)

t=n+1

and N3 =

Proof.

∞ ∞ 1 XX g (s, t) P3 (s, t) . 1 − q3 s=0 t=0

(5.5.21)

(a1 ) Let

v (m, n) =

m−1 X n−1 X

f (s, t) u (s, t) ,

(5.5.22)

s=0 t=0

r=

∞ ∞ X X

g (s, t) u (s, t) .

(5.5.23)

s=0 t=0

Then (5.5.1) can be restated as u (m, n) ≤ a (m, n) + b (m, n) v (m, n) + c (m, n) r.

(5.5.24)

From (5.5.22) and (5.5.24) we have v (m, n) ≤ d (m, n) +

m−1 X n−1 X

f (s, t) b (s, t) v (s, t) ,

(5.5.25)

s=0 t=0

where d (m, n) =

m−1 X n−1 X

[f (s, t) a (s, t) + r f (s, t) c (s, t)].

(5.5.26)

s=0 t=0

Clearly, d(m, n) is real-valued,nonnegative function and nondecreasing in both the variables m and n for m, n ∈ N0 . Now an application of Theorem 4.2.2 given in [42] to (5.5.25) yields v (m, n) ≤ d (m, n) L1 (m, n) .

(5.5.27)

Chapter 5

289

Using (5.5.27) in (5.5.24) we have u (m, n) ≤ a (m, n) + r c (m, n) + b (m, n) d (m, n) L1 (m, n) = P1 (m, n) + r Q1 (m, n) .

(5.5.28)

Now from (5.5.28), (5.5.23) and (5.5.2) we have r≤

∞ ∞ X X

g (s, t) {P1 (s, t) + r Q1 (s, t)}

s=0 t=0

i.e., ( r 1−

∞ ∞ X X

) g (s, t) Q1 (s, t)

s=0 t=0

≤

∞ ∞ X X

g (s, t) P1 (s, t),

s=0 t=0

which implies r ≤ N1 .

(5.5.29)

Using (5.5.29) in (5.5.28) we get (5.5.3). (a2 ) Let v (m, n) =

∞ X

∞ X

f (s, t) u (s, t) ,

(5.5.30)

s=m+1 t=n+1

and r be as in (5.5.23). The proof can be completed by following the proof of (a1 ) and using the inequality in Theorem 5.4.1, part (a2 ). (a3 ) Let v (m, n) =

m−1 X

∞ X

f (s, t) u (s, t) ,

(5.5.31)

s=0 t=n+1

and r be as in (5.5.23). The proof follows by the similar arguments as in (a1 ) and using the inequality in Theorem 5.4.1, part (a1 ). The next theorem contains the inequality established in [71]. Theorem 5.5.2. Let u (m, n) ∈ D N02 , R+ and a (m, n, s, t) , b (m, n, s, t) ∈ D (E, R+ ) be nondecreasing in m, n for each s, t ∈ N0 , where E = {(m, n, s, t) ∈ N04 : 0 ≤ s ≤ m < ∞, 0 ≤ t ≤ n < ∞ . 0 ≤ s ≤ m < ∞, 0 ≤ t ≤ n < ∞}. Suppose that u (m, n) ≤ c+

m−1 X n−1 X s=0 t=0

a (m, n, s, t) u (s, t)+

∞ ∞ X X s=0 t=0

b (m, n, s, t) u (s, t), (5.5.32)

290


for m, n ∈ N0 , where c ≥ 0 is a real constant. If # " ∞ ∞ X s−1 t−1 X Y X r (m, n) = b (m, n, s, t) a (s, t, σ, τ ) < 1, 1+ s=0 t=0

σ=0

(5.5.33)

τ =0

for m, n ∈ N0 , then # " m−1 n−1 Y X c u (m, n) ≤ a (m, n, s, t) , 1+ 1 − r (m, n) s=0 t=0

(5.5.34)

for m, n ∈ N0 . Proof.

Fix (x, y) ∈ N02 . Then for 0 ≤ m ≤ x, 0 ≤ n ≤ y; (m, n) ∈ N02 we have

u (m, n) ≤ c+

m−1 X n−1 X

a (x, y, s, t) u (s, t) +

s=0 t=0

∞ ∞ X X

b (x, y, s, t) u (s, t). (5.5.35)

s=0 t=0

Let k(x, y) = c +

∞ ∞ X X

b (x, y, s, t) u (s, t),

(5.5.36)

s=0 t=0

then (5.5.35) can be restated as u (m, n) ≤ k(x, y) +

m−1 X n−1 X

a (x, y, s, t) u (s, t),

(5.5.37)

s=0 t=0

for 0 ≤ m ≤ x, 0 ≤ n ≤ y. Now an application of Theorem 4.2.1 given in [42] to (5.5.37) yields # " m−1 n−1 Y X a (x, y, σ, τ ) , (5.5.38) 1+ u (m, n) ≤ k(x, y) σ=0

τ =0

for 0 ≤ m ≤ x, 0 ≤ n ≤ y.Since (x, y) ∈ N02 is arbitrary, from (5.5.38) and (5.5.36) with (x, y) replaced by (m, n) we have # " m−1 n−1 Y X a (m, n, σ, τ ) , (5.5.39) 1+ u (m, n) ≤ k(m, n) σ=0

τ =0

where k(m, n) = c +

∞ ∞ X X

b (m, n, s, t) u (s, t),

(5.5.40)

s=0 t=0

for all (m, n) ∈ N02 . Using (5.5.39) on the right hand side of (5.5.40) we have ( #) " ∞ ∞ X m−1 n−1 X Y X b (m, n, s, t) k(m, n) a (s, t, σ, τ ) , k(m, n) ≤ c + 1+ s=0 t=0

σ=0

τ =0

Chapter 5

291

which in view of (5.5.33) implies c . 1 − r (m, n)

k(m, n) ≤

(5.5.41)

Using (5.5.41) in (5.5.39) we get the required inequality in (5.5.34). Remark 5.5.1. We note that the inequality given in Theorem 5.5.2 is of more general type and in the special cases when (i)b(m, n, s, t) = 0, (ii)a(m, n, s, t) = 0, it can also be used more effectively in the situations for which the other available inequalities do not apply directly. Tn the following theorem we present the inequality proved in [62]. Theorem 5.2.3. Let u (m, n) , p (m, n) , f (m, n) , g (m, n) , h (m, n) ∈ D N02 , R+ ) , and c ≥ 0 be a real constant and suppose that m−1 X

u (m, n) ≤ c +

p (s, n) u (s, n)

s=0

+

m−1 X n−1 X

f (s, t) [u (s, t)

s=0 t=0

+

t−1 s−1 X X

g (σ, τ )u (σ, τ ) +

σ=0 τ =0

∞ ∞ X X

# h (σ, τ )u (σ, τ ) ,

(5.5.42)

σ=0 τ =0

for (m, n) ∈ N02 . If r=

∞ ∞ X X

h (σ, τ )B (σ, τ )

σ=0 τ =0

×

σ−1 Y

" 1+

ξ=0

τ −1 X

# B (ξ, η) [f (ξ, η) + g (ξ, η)] < 1,

(5.5.43)

[1 + p (s, τ )],

(5.5.44)

η=0

where B (σ, τ ) =

σ−1 Y s=0

for (σ, τ ) ∈ N02 , then # " m−1 n−1 Y X c u (m, n) ≤ B (m, n) B (s, t) [f (s, t) + g (s, t)] , (5.5.45) 1+ 1−r s=0 t=0 for (m, n) ∈ N02 .

292


Proof.

Let c > 0 and define a function z(m, n) by

z (m, n) = c +

m−1 X n−1 X

f (s, t) [u (s, t)

s=0 t=0

+

t−1 s−1 X X

g (σ, τ )u (σ, τ ) +

σ=0 τ =0

∞ ∞ X X

# h (σ, τ )u (σ, τ ) .

(5.5.46)

σ=0 τ =0

Then (5.5.42) can be restated as u (m, n) ≤ z (m, n) +

m−1 X

p (s, n) u (s, n) .

(5.5.47)

s=0

It is easy to observe that the function z(m, n) is real-valued, positive and nondecreasing for (m, n) ∈ N02 . Now treating n fixed in (5.5.47) and applying the inequality given in Corollary 1.2.5 in [42] to (5.5.47) we get u (m, n) ≤ B (m, n) z(m, n),

(5.5.48)

for (m, n) ∈ N02 , where B(m, n) is defined by (5.5.44). From (5.5.46), (5.5.48) and the fact that B (m, n) ≥ 1, we observe that " t−1 m−1 s−1 X X n−1 X X f (s, t) B (s, t) z (s, t) + g (σ, τ ) B (σ, τ ) z (σ, τ ) z (m, n) ≤ c + s=0 t=0

+

∞ ∞ X X

σ=0 τ =0

# h (σ, τ )B (σ, τ ) z (σ, τ )

σ=0 τ =0

≤c+

m−1 X n−1 X

" f (s, t) B (s, t) z (s, t) +

s=0 t=0

+

∞ ∞ X X

t−1 s−1 X X

g (σ, τ ) B (σ, τ ) z (σ, τ )

σ=0 τ =0

# h (σ, τ )B (σ, τ ) z (σ, τ ) .

(5.5.49)

σ=0 τ =0

Define a function v(m, n) by the right hand side of (5.5.49). Then v(m, n) > 0, v(0, n) = v(m, 0) = c, z (m, n) ≤ v (m, n) and " m−1 X n−1 X g (σ, τ ) B (σ, τ ) z (σ, τ ) ∆2 ∆1 v (m, n) = f (m, n) B (m, n) z (m, n) + σ=0 τ =0

+

∞ ∞ X X

# h (σ, τ ) B (σ, τ ) z (σ, τ )

σ=0 τ =0

" ≤ f (m, n) B (m, n) v (m, n) +

m−1 X n−1 X σ=0 τ =0

g (σ, τ ) B (σ, τ ) v (σ, τ )

Chapter 5

+

∞ ∞ X X

293 #

h (σ, τ ) B (σ, τ ) v (σ, τ ) .

(5.5.50)

σ=0 τ =0

Define a function w(m, n) by w (m, n) = v (m, n) +

m−1 X n−1 X

g (σ, τ ) B (σ, τ ) v (σ, τ )

σ=0 τ =0

+

∞ ∞ X X

h (σ, τ ) B (σ, τ ) v (σ, τ ) ,

σ=0 τ =0

then w(m, n) > 0, v (m, n) ≤ w (m, n) , ∆2 ∆1 v (m, n) ≤ f (m, n) B (m, n) w (m, n) , w (0, n) = w (m, 0) = c +

∞ ∞ X X

¯ (say), (5.5.51) h (σ, τ ) B (σ, τ ) v (σ, τ ) = L

σ=0 τ =0

and ∆2 ∆1 w (m, n) = ∆2 ∆1 v (m, n) + g (m, n) B (m, n) v (m, n) ≤ f (m, n) B (m, n) w (m, n) + g (m, n) B (m, n) v (m, n) ≤ B (m, n) [f (m, n) + g (m, n)] w (m, n) .

(5.5.52)

Now, by following the proof of Theorem 4.2.1 given in [42], the inequality (5.5.52) implies the estimate # " m−1 n−1 Y X ¯ B (s, t) [f (s, t) + g (s, t)] . (5.5.53) 1+ w (m, n) ≤ L s=0

t=0

From (5.5.51), (5.5.53) and (5.5.43) we observe that ¯≤ L

c . 1−r

(5.5.54)

Using (5.5.54) in (5.5.53) and the facts that z (m, n) ≤ v (m, n) , u (m, n) ≤ B (m, n) z (m, n) we get the required inequality in (5.5.45). The proof of the case when c ≥ 0 can be completed as mentioned in the proof of Theorem 5.4.8, part (r1 ). Remark 5.5.2. We note that,in the special cases when (i)p(m, n) = 0, (ii)g(m, n) = 0, (iii)h(m, n) = 0, the inequality in Theorem 5.5.3 reduces to the new inequalities which can be used as tools in different applications.

294


5.6 Applications In this section we present applications of some of the inequalities given in earlier sections which deals with some fundamental properties of solutions of various types of finite difference equations in two independent variables. The inequalities given above are recently developed and hope will provide a fruitful source for future research.

5.6.1 Partial finite difference equations First, consider the following partial finite difference equation z (m + 1, n + 1) = F (m, n, z (m, n)) ,

(5.6.1)

with the given initial condition z (m0 , n0 ) = z0 ,

(5.6.2)

¯0 × N ¯0 , F : ∆0 × R → R, where M ¯ 0, N ¯0 are as defined in for (m, n) ∈ ∆0 = M Theorem 5.2.1. As an application of the inequality given in Theorem 5.2.1, part (a2 ) we present the following theorem which deals with the dependency of solutions of equation (5.6.1) on given initial values (see [56]). Theorem 5.6.1.

Suppose that the finction F in (5.6.1) satisfies

|F (m, n, x) − F (m, n, y)| ≤ w (m, n, |x − y|) ,

(5.6.3)

for (m, n) ∈ ∆0 , x, y ∈ R, where w (m, n, r) : ∆0 × R+ → R+ is a nondecreasing function with respect to r for fixed (m, n) ∈ ∆0 . Let z (m, n, m0 , n0 , zi ) (i = 1, 2) be solutions of (5.6.1) with the given initial conditions z (m0 , n0 , m0 , n0 , zi ) = zi ,

(5.6.4)

for i = 1, 2. Let r(m, n) be a solution of the equation r (m + 1, n + 1) = w (m, n, r (m, n)) , r(m0 , n0 ) = r0 ,

(5.6.5)

for (m, n) ∈ ∆0 and |z1 − z2 | ≤ r0 . Then |z (m, n, m0 , n0 , z1 ) − z (m, n, m0 , n0 , z2 )| ≤ r (m, n) , for (m, n) ∈ ∆0 .

(5.6.6)

Chapter 5

295

Proof. Let p(m, n) = |z (m, n, m0 , n0 , z1 ) − z (m, n, m0 , n0 , z2 )|. Then p (m + 1, n + 1) = |z (m + 1, n + 1, m0 , n0 , z1 ) − z (m + 1, n + 1, m0 , n0 , z2 )| = |F (m, n, z (m, n, m0 , n0 , z1 )) − F (m, n, z (m, n, m0 , n0 , z2 ))| ≤ w (m, n, |z (m, n, m0 , n0 , z1 ) − z (m, n, m0 , n0 , z2 )|) = w (m, n, p (m, n)) .

(5.6.7)

Now a suitable application of Theorem 5.2.1, part (a2 ) to (5.6.7) and (5.6.5) we get (5.6.6), which shows the dependency of solutions of (5.6.1) on initial values. Next, we apply the inequality given in Theorem 5.2.3, part (c1 ) to obtain a bound on the solution of sum-difference equation of the form z 2 (m, n) = h (m, n) +

m−1 X n−1 X

F (m, n, σ, τ, z (σ, τ )),

(5.6.8)

σ=0 τ =0 2 2 for (m, n) ∈ N04, where h : N0 → R,, F : E × R → R, in which E = (m, n, σ, τ ) ∈ N0 : 0 ≤ σ ≤ m < ∞, 0 ≤ τ ≤ n < ∞ .

Theorem 5.6.2. Suppose that the functions h, F in equation (5.6.8) satisfy the conditions |h (m, n)| ≤ c,

(5.6.9)

|F (m, n, σ, τ, z)| ≤ k (m, n, σ, τ ) |z| ,

(5.6.10)

where c and k (m, n, σ, τ ) are as in Theorem 5.2.3. Let ∆1 k (m, n, σ, τ ) , ∆2 k (m, n, σ, τ ), ∆2 ∆1 k (m, n, σ, τ ) be as in Theorem 5.2.3 and Q(m, n) is defined by (5.4.14). If z(m, n) is a solution of equation (5.6.8) for (m, n) ∈ N02 , then |z (m, n)| ≤

√

c+

m−1 n−1 1 XX Q (s, t) , 2 s=0 t=0

(5.6.11)

for (m, n) ∈ N02 . Proof. Using the fact that z(m, n) is a solution of equation (5.6.8), the conditions (5.6.9), (5.6.10) and making use of the inequality in Theorem 5.2.3, part (c1 ) we get the required inequality in (5.6.11).

296


5.6.2 Volterra type sum-difference equation In this section we present applications of the inequality in Theorem 5.5.2, part (b2 ), which provide estimates on the solutions of sum-difference equation of the form z (m, n) = h (m, n) +

m−1 X n−1 X

F (m, n, σ, τ, z (σ, τ )),

(5.6.12)

σ=0 τ =0 2 2 for (m, n) ∈ N04 ,where h : N0 → R, F : E × R → R, in which E = (m, n, σ, τ ) ∈ N0 : 0 ≤ σ ≤ m < ∞, 0 ≤ τ ≤ n < ∞ .

The following theorem deals with the estimate on the solution of equation (5.6.12). Theorem 5.6.3.

Suppose that

|h (m, n)| ≤ a (m, n) ,

(5.6.13)

|F (m, n, σ, τ, z)| ≤ k (m, n, σ, τ ) g (|z|) ,

(5.6.14)

where a (m, n) , k (m, n, σ, τ ) , g (u) are as in Theorem 5.2.2, part (b2 ). Let G, G−1 , ∆1 k (m, n, σ, τ ) , ∆2 k (m, n, σ, τ ) , ∆2 ∆1 k (m, n, σ, τ ) be as in Theorem 5.2.2, part (b2 ) and A(m, n) and Q(m, n) are defined by (5.2.18) and (5.2.14) respectively. If z(m, n) is any solution of (5.6.12) for (m, n) ∈ N02 , then for 0 ≤ m ≤ m1 , 0 ≤ n ≤ n1 ; m, m1 , n, n1 ∈ N0 , " # m−1 X n−1 X −1 |z (m, n)| ≤ a (m, n) + G G (A (m, n)) + Q (s, t,) , (5.6.15) σ=0 τ =0

and m1 , n1 ∈ N0 are chosen so that G (A (m, n)) +

m−1 X n−1 X

Q (s, t,) ∈ Dom G−1 ,

σ=0 τ =0

for all m, n lying in 0 ≤ m ≤ m1 , 0 ≤ n ≤ n1 . Proof. Let z (m, n) ∈ D N02 , R be a solution of equation (5.6.12). Using the fact that z(m, n) is a solution of (5.6.12) and the conditions (5.6.13), (5.6.14) we have |z (m, n)| ≤ a (m, n) +

m−1 X n−1 X

k (m, n, σ, τ ) g (|z (σ, τ )|).

(5.6.16)

σ=0 τ =0

Now an application of the inequality in Theorem 5.2.2, part (b2 ) to (5.6.16) yields the desired estimate in (5.6.15).

Chapter 5

297

In the following theorem we obtain estimate on the solution of equation (5.6.12) by assuming that the function F satisfies the Lipschitz type condition. Theorem 5.6.4. Suppose that |F (m, n, σ, τ, z) − F (m, n, σ, τ, z¯)| ≤ k (m, n, σ, τ ) g (|z − z¯|) ,

(5.6.17)

where k (m, n, σ, τ ) and g(u) are as in Theorem 5.2.2, part (b2 ). Let G, G−1 , ∆1 k (m, n, σ, τ ) , ∆2 k (m, n, σ, τ ) , ∆2 ∆1 k (m, n, σ, τ ) and Q(m, n) be as in Theorem 5.2.2, part (b2 ) and e (m, n) =

m−1 X n−1 X

|F (m, n, σ, τ, h (σ, τ ))|,

(5.6.18)

σ=0 τ =0

A¯ (m, n) =

m−1 X n−1 X

k (m, n, σ, τ ) g (e (σ, τ )).

(5.6.19)

σ=0 τ =0

If z(m,n) is a solution of equation (5.6.12) for (m, n) ∈ N02 , then for 0 ≤ m ≤ m2 , 0 ≤ n ≤ n2 ; m, m2 , n, n2 ∈ N0 , |z (m, n) − h (m, n)| ≤ e (m, n) + G−1 "

# X n−1 X m−1 ¯ × G A (m, n) + Q (s, t) ,

(5.6.20)

s=0 t=0

and m2 , n2 ∈ N0 are chosen so that X n−1 X m−1 G A¯ (m, n) + Q (s, t) ∈ Dom G−1 , s=0 t=0

for all m, n lying in 0 ≤ m ≤ m2 , 0 ≤ n ≤ n2 . Proof. Let z(m, n) be a solution of equation (5.6.12). Using the fact that z(m, n) is a solution of (5.6.12) and (5.6.17) we observe that m−1 n−1 X X {F (m, n, σ, τ, z (σ, τ )) |z (m, n) − h (m, n)| = σ=0 τ =0

−F (m, n, σ, τ, h (σ, τ )) + F (m, n, σ, τ, h (σ, τ ))}| ≤ e (m, n) +

m−1 X n−1 X

k (m, n, σ, τ )g (|z (σ, τ ) − h (σ, τ )|) .

(5.6.21)

σ=0 τ =0

Now a suitable application of the inequality in Theorem 5.2.2, part (b2 ) to (5.6.21) yields (5.6.20).

298


5.6.3 Partial finite sum-difference equation In this section we present applications of the inequality in Theorem 5.3.4, part(d1 ) to study certain properties of solutions of partial finite sum-difference equation of the form ∆2 ∆1 z (m, n) = F

m, n, z (m, n) ,

m−1 X n−1 X

P (m, n, σ, τ, z (σ, τ )) ,

σ=0 τ =0 m−1 X n−1 X

−1 σ−1 X τX

σ=0 τ =0

x=0 y=0

!! H (m, n, σ, τ, x, y, z (x, y))

,

(5.6.22)

with the given initial conditions at m = 0, n = 0 as z (m, 0) = d (m) , z (0, n) = e (n) , z (0, 0) = 0,

(5.6.23)

where d, e : N0 → R, P : E1 × R → R, H : E2 × R → R, F : N02 × R3 → n, s, t) ∈ N04 : 0 ≤ s ≤ m < ∞, 0 ≤ t ≤ n < ∞ , E2 = R in which E1 = (m, 6 (m, n, s, t, σ, τ ) ∈ N0 : 0 ≤ σ ≤ s ≤ m < ∞, 0 ≤ τ ≤ t ≤ n < ∞ . The following theorem deals with the uniqueness of solutions of the problem (5.6.22)-(5.6.23). Theorem 5.6.5. conditions

Suppose that the functions F, P, H in (5.6.22) satisfy the

|F (m, n, u, v, w) − F (m, n, u ¯, v¯, w)| ¯ ≤ b (m, n) |u − u ¯| + |v − v¯| + |w − w| ¯ ,

(5.6.24)

|P (m, n, σ, τ, u) − P (m, n, σ, τ, u ¯)| ≤ k (m, n, σ, τ ) |u − u ¯| ,

(5.6.25)

|H (m, n, σ, τ, x, y, u) − H (m, n, σ, τ, x, y, u ¯)| ≤ h (m, n, σ, τ, x, y) |u − u ¯| ,

(5.6.26)

where b(m, n), k (m, n, σ, τ ), h (m, n, σ, τ, x, y) are as in Theorem 5.3.4, part (d1 ). Then the problem (5.6.22)-(5.6.23) has at most one solution on N02 . Proof. It is easy to observe that the problem (5.6.22)-(5.6.23) is equivalent to the following sum-difference equation z (m, n) = d (m)+e (n)+

m−1 X n−1 X

F

s, t, z (s, t) ,

s=0 t=0 t−1 s−1 X X

−1 σ−1 X τX

σ=0 τ =0

x=0 y=0

t−1 s−1 X X

P (s, t, σ, τ, z (σ, τ )) ,

σ=0 τ =0

!! H (s, t, σ, τ, x, y, z (x, y))

.

(5.6.27)

Chapter 5

299

Let u(m, n) and v(m, n) be two solutions of problem (5.6.22)-(5.6.23) for (m, n) ∈ N02 . Using the facts that u(m, n) and v(m, n) are the solutions of (5.6.27) and the conditions (5.6.24)-(5.6.26) we have |u (m, n) − v (m, n)| ≤

m−1 X n−1 X

b (s, t) |u (s, t) − v (s, t)|

s=0 t=0

+

+

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! k (s, t, σ, τ ) |u (σ, τ ) − v (σ, τ )|

m−1 X n−1 X

t−1 s−1 X X

−1 σ−1 X τX

s=0 t=0

σ=0 τ =0

x=0 y=0

!! h (s, t, σ, τ, x, y) |u (x, y) − v (x, y)|

. (5.6.28)

Now a suitable application of Theorem 5.3.4, part (d1 ) (when c = 0) to (5.6.28) yields u(m, n) = v(m, n), i.e., there is at most one solution to the problem (5.6.22)-(5.6.23) on N02 . The next theorem shows the dependency of solutions of equation (5.6.22) on given initial values. Theorem 5.6.6. Let z1 (m, n) and z2 (m, n) be the solutions of equation (5.6.22) with rhe given initial conditions at m = 0, n = 0 as z1 (m, 0) = d1 (m) , z1 (0, n) = e1 (n) , z1 (0, 0) = 0,

(5.6.29)

z2 (m, 0) = d2 (m) , z2 (0, n) = e2 (n) , z2 (0, 0) = 0,

(5.6.30)

and

respectively, where d1 , d2 , e1 , e2 : N0 → R and |d1 (m) + e1 (n) − d2 (m) − e2 (n)| ≤ c,

(5.6.31)

where c ≥ 0 is a real constant.Suppose that the functions F, P, H in (5.6.22) satisfy the conditions (5.6.24), (5.6.25), (5.6.26).Then " # m−1 n−1 Y X ¯ (s, t) , |z1 (m, n) − z2 (m, n)| ≤ c 1+ Q (5.6.32) s=0

t=0

for (m, n) ∈ N02 ,where ¯ (m, n) = b (m, n) + Q

m−1 X n−1 X

k (m, n, σ, τ )

σ=0 τ =0

+

m−1 X n−1 X

−1 σ−1 X τX

σ=0 τ =0

x=0 y=0

! h (m, n, σ, τ, x, y) .

(5.6.33)

300


Proof.

From the hypotheses, it is easy to observe that

|z1 (m, n) − z2 (m, n)| ≤ |d1 (m) + e1 (n) − d2 (m) − e2 (n)| m−1 m−1 X n−1 X X n−1 X + P (s, t, σ, τ, z1 (σ, τ )) , F s, t, z1 (s, t) , s=0 t=0 σ=0 τ =0 !! t−1 σ−1 −1 s−1 X X X τX H (s, t, σ, τ, x, y, z1 (x, y)) σ=0 τ =0

−F

x=0 y=0

s, t, z2 (s, t) ,

m−1 X n−1 X

P (s, t, σ, τ, z2 (σ, τ )) ,

σ=0 τ =0 t−1 s−1 X X

−1 σ−1 X τX

σ=0 τ =0

x=0 y=0

≤c+

m−1 X n−1 X

!! H (s, t, σ, τ, x, y, z2 (x, y))

b (s, t) |z1 (s, t) − z2 (s, t)|

s=0 t=0

+

+

m−1 X n−1 X

t−1 s−1 X X

s=0 t=0

σ=0 τ =0

! k (s, t, σ, τ ) |z1 (σ, τ ) − z2 (σ, τ )|

m−1 X n−1 X

t−1 s−1 X X

−1 σ−1 X τX

s=0 t=0

σ=0 τ =0

x=0 y=0

!! h (s, t, σ, τ, x, y) |z1 (x, y) − z2 (x, y)|

. (5.6.34)

Now an application of Theorem 5.3.4, part (d1 ) to (5.6.34) yields the estimate (5.6.32), which shows the dependency of solutions of (5.6.22) on given initial values.

5.6.4 Sum-difference equations of VolterraFredholm type First we present an application of Theorem 5.5.2 to obtain a bound on the solution of sum-difference equation of the form z (m, n) = f (m, n) +

m−1 X n−1 X

A (m, n, s, t, z (s, t))

s=0 t=0

+

∞ ∞ X X

B (m, n, s, t, z (s, t)),

(5.6.35)

s=0 t=0

for (m, n)∈ N02 , where f : N02 → R, A, B : E × R → R are the given functions and E = (m, n, s, t) ∈ N04 : 0 ≤ s ≤ m < ∞, 0 ≤ t ≤ n < ∞ .

Chapter 5

301

Theorem 5.6.7. Suppose that the functions f, A, B in equation (5.6.35) satisfy the conditions |f (m, n)| ≤ c,

(5.6.36)

|A (m, n, s, t, z)| ≤ a (m, n, s, t) |z| ,

(5.6.37)

|B (m, n, s, t, z)| ≤ b (m, n, s, t) |z| ,

(5.6.38)

where c, a(m, n, s, t), b(m, n, s, t) are as in Theorem 5.2.2. Let r(m, n) be as in (5.5.33). If z(m, n) is a solution of (5.6.35) for (m, n) ∈ N02 ,then # " m−1 n−1 Y X c |z (m, n)| ≤ a (m, n, s, t) , (5.6.39) 1+ 1 − r (m, n) s=0 t=0 for (m, n) ∈ N02 . Proof. Using the fact that z(m, n) is a solution of (5.6.35) and the conditions (5.6.36)-(5.6.38) we have |z (m, n)| ≤ c +

m−1 X n−1 X

a (m, n, s, t) |z (s, t)|

s=0 t=0

+

∞ ∞ X X

b (m, n, s, t) |z (s, t)|.

(5.6.40)

s=0 t=0

Now an application of Theorem 5.5.2 to (5.6.40) yields the required estimate in (5.6.39). We next consider the following sum-difference equations ∆2 ∆1 z (m, n) = F

m, n, z (m, n) ,

∞ ∞ X X

! r (m, n, σ, τ, z (σ, τ )) , µ , (5.6.41)

σ=0 τ =0

∆2 ∆1 z (m, n) = F (m, n, z (m, n) , ! ∞ ∞ X X r (m, n, σ, τ, z (σ, τ )), µ0 ,

(5.6.42)

σ=0 τ =0

with the given initial conditions at m = 0, n = 0 as z (m, 0) = β1 (m) , z (0, n) = β2 (n) , β1 (0) = β2 (0) = 0,

(5.6.43)

where β1 , β2 : N0 → R, r : E × R → R, F : N02 × R3 → R and µ, µ0 are real parameters,in which E = (m, n, σ, τ ) ∈ N04 : 0 ≤ σ ≤ m < ∞, 0 ≤ τ ≤ n < ∞ . The following theorem shows the dependency of solutions of problems (5.6.41)(5.6.43) and (5.6.42)-(5.6.43) on parameters.

302


Theorem 5.6.8.

Suppose that

|r (m, n, σ, τ, z) − r (m, n, σ, τ, z¯)| ≤ e (m, n) h (σ, τ ) |z − z¯| ,

(5.6.44)

|F (m, n, z, w, µ) − F (m, n, z¯, w, ¯ µ)| ≤ f (m, n) (|z − z¯| + |w − w|) ¯ , (5.6.45) (5.6.46) |F (m, n, z, w, µ) − F (m, n, z, w, µ0 )| ≤ d (m, n) |µ − µ0 | , where f (m, n) , h (m, n) , e (m, n) , d (m, n) ∈ D N02 , R+ and e (m, n) ≥ 1, m−1 X n−1 X

d (s, t) ≤ M,

(5.6.47)

s=0 t=0

M ≥ 0 is a real constant. Let r0 =

∞ ∞ X X

h (σ, τ )

σ=0 τ =0

σ−1 Y

" 1+

ξ=0

τ −1 X

# f (ξ, η)e (ξ, η) < 1.

(5.6.48)

η=0

If z1 (m, n) and z2 (m, n) are the solutions of problems (5.6.41)-(5.6.43) and (5.6.42)-(5.6.43) , then # " m−1 n−1 Y X k f (s, t) e (s, t) , (5.6.49) 1+ |z1 (m, n) − z2 (m, n)| ≤ 1 − r0 s=0 t=0 for (m, n) ∈ N02 , where k = |µ − µ0 | M. Proof. Let z (m, n) = z1 (m, n) − z2 (m, n) for (m, n) ∈ N02 . As in the proof of Theorem 5.6.5 we observe that ! ( ∞ m−1 ∞ X X n−1 X X r (s, t, σ, τ, z1 (σ, τ )) , µ F s, t, z1 (s, t) , z (m, n) = s=0 t=0

−F

s, t, z2 (s, t) ,

σ=0 τ =0

∞ ∞ X X

! r (s, t, σ, τ, z2 (σ, τ )) , µ

σ=0 τ =0

+F

s, t, z2 (s, t) ,

∞ ∞ X X

! r (s, t, σ, τ, z2 (σ, τ )) , µ

σ=0 τ =0

−F

s, t, z2 (s, t) ,

∞ ∞ X X

!) r (s, t, σ, τ, z2 (σ, τ )) , µ0

.

(5.6.50)

σ=0 τ =0

Using (5.6.44)-(5.6.47) in (5.6.50) we observe that |z (m, n)| ≤

m−1 X n−1 X s=0 t=0

f (s, t) |z (s, t)| +

∞ ∞ X X σ=0 τ =0

! e (s, t) h (σ, τ ) |z (σ, τ )|

Chapter 5

+

m−1 X n−1 X

303

d (s, t) |µ − µ0 |

s=0 t=0

≤ k+

m−1 X n−1 X s=0 t=0

f (s, t) e (s, t) |z (s, t)| +

∞ ∞ X X

! h (σ, τ ) |z (σ, τ )| . (5.6.51)

σ=0 τ =0

Now a suitable application of Theorem 5.2.3 to (5.6.51) yields (5.6.49), which shows the dependency of solutions of problems (5.6.41)-(5.6.43) and (5.6.42)(5.6.43) on parameters µ and µ0

5.7 Notes The study of partial finite difference equations has gained noticable importance during the past few years. Such equations arise frequently in combinatorics and in the approximation of solutions of partial differential equations by finite difference methods. In fact, we need new theory and methods for the study of various types of partial finite difference equations. The material in sections 5.2-5.5 contains a number of new finite difference inequalities involving functions of two independent variables recently developed by Pachpatte [36,40,41,45,48,49,53,55,56,62,66,68,71,76]. These inequalities can be used in the theory of partial finite difference equations in essentially the same capacity as the finite difference inequaliies with explicit estimates are used in the theory of ordinary finite difference equations. Section 5.6 is devoted to applications of some of the inequalities given in earlier sections.

References 1. Agarwal, R.P., Difference Equations and Inequalities, Marcel Dekker, Inc., New York, 1992. 2. Akhmedov, K.T., A.M.Yakubov and I.A.Veisov, Some integral inequalities, Izv.Akad.Nauk UzSSR 1(1972), 18-24 (in Russian). 3. Bainov, D. and P.Simeonov, Integral Inequalities and Applications, Kluwer Academic Publishers, Dordrecht, 1992. 4. Beckenbach, E.F. and R.Bellman, Inequalities, Springer-Verlag, Berlin, New York, 1965. 5. Beesack, P.R., Gronwall Inequalities, Carleton Mathematical Lecture Notes, No.11, 1975. 6. Bellman, R., Stability Theory of Differential Equations, McGraw-Hill, New York, 1953. 7. Bellman, R. and K.L.Cooke, Differential-Difference Equations, Academic Press, New York, 1963. 8. Bihari, I., A generalization of a lemma of Bellman and its application to uniqueness of differential equations, Acta Math.Acad.Sci.Hunger.7(1956),71-94. 9. Bykov, Ya.V. and Kh.M.Salpagarov, On the theory of integro-differential equations, in, Investigations in Integro-Differential Equations, Khirghizia 2, Izd.Akad.Nauk.Khirghizia SSR, 1962 (in Russian). 10. Dafermos, C.M., The second law of Thermodynamics and stability, Arch.Rat.Mech.Anal.70(1979), 167-179. 11. Dragomir, S.S., On discrete generalization of Pachpatte’s inequality and applications, Bull.Math.Soc.Math.Roumanie 36(1992), 45-58. 12. Dragomir, S.S., Some Gronwall Type Inequalities and Applications, Nova Science Publishers, Inc., New York, 2003. 13. El’sgol’ts, L.F. and S.B.Norkin, Introduction to the theory and applications of differential equations with deviating arguments, Academic Press, New York, 1973. 14. Filatov, A.N. and L.V.Sharov, Integral inequalities and the theory of nonlinear oscillations, Moscow, Nauka, 1976 (in Russian). 15. Gamidov, Sh.G., Integral inequalities for boundary value problems for differential equations, Diff.Eqs. 5(1969), 463-475 16. Gronwall, T.H., Note on the derivatives with respect to a parameter of the solutions of a system of differential equations, Ann. of Math. 20(1919), 292-296. 17. Henry, D., Geometric Theory of Semilinear Parabolic Equations, Springer-Verlag, Berlin, New York, 1981. 18. Kung, Y., Delay differential equations with Applications in Population Dynamics, Academic Press, New York, 1993. 19. Lakshmikantham, V. and S.Leela, Differential and Integral Inequalities, Vols. I,II, Academic Press, New York, 1969. 20. LaSalle, J.P., Uniqueness theorems and successive approximations, Ann. of Math. 50(1949), 722-730. 304

References

305

21. Lipovan, O., A retarded Gronwall-like inequality and applications, J.Math.Anal.Appl. 252(2000), 389-401. 22. Lipovan, O., A retarded integral inequality and its applications, J.Math.Anal.Appl. 285(3003), 436-443. 23. Martynyuk, A.A. and R.Gutowski, Integral Inequalities and stability of motion, Naukov Dumka, Kiev, 1979 (in Russian). ˇ M., A new approach to an analysis of Henry type integral 24. Medved, inequalities and their Bihari type versions, J. Math.Anal.Appl. 214(1997), 349-366. ˇ M., Singular integral inequalities and stability of semilinear 25. Medved, parabolic equations, Archivum Mathematicum (Brno) 34(1998), 183-190. ˇ M., Nonlinear singular integral inequalities for functions of two 26. Medved, and n independent variables, J.Inequal.Appl. 5(2000), 287-308. ˇ Nonlinear singular difference inequalities suitable for 27. Medved, discretizations of Parabolic equations, Demonstratio Mathematica 33(2000), 517-525. ˇ M., Integral inequalities and global solutions of semilinear 28. Medved, evolution equations, J.Math.Anal.Appl. 267(2002), 643-650. 29. Mikeladze, Sh.E., De la résolution numéique des équations intégrales, Bull.Acad.Sci.URSS VII (1935), 255-257 (in Russian). 30. Mitrinović, D.S., Analytic Inequalities, Springer-Verlag, Berlin, New York, 1970. 31. Mitrinović, D.S., J.E.Peˇcarić and A.M.Fink, Classical and new inequalities in analysis, Kluwer Academic Publishers,Dordrecht, 1993. 32. Mitrinović, D.S., J.E.Peˇcarić and A.M.Fink, Inequalities for functions and their integrals and derivatives, Kluwer Academic Publishers, Dordrecht, 1994. 33. Ou-Iang, L., The boundedness of solutions of linear differential equations y 00 + A (t) y = 0, Shuxue Jinzhan 3(1957), 409-415. 34. Pachpatte, B.G., Inequalities for Differential and Integral Equations, Academic Press, New York, 1998. 35. Pachpatte, B.G., On some new inequalities related to a certain inequality arising in the theory of differential equations, J.Math.Anal.Appl. 251(2000), 736-751. 36. Pachpatte, B.G., On some finite difference inequalities in two independent variables, J.Math.Anal.Appl. 254(2001), 587-598. 37. Pachpatte, B.G., Inequalities for certain finite difference and sum-difference equations, Math.Ineq.Appl. 4(2001), 499-506. 38. Pachpatte, B.G., Inequalities applicable in the theory of partial finite difference equations, Tamkang J.Math. 32(2001), 155-166. 39. Pachpatte, B.G., On some fundamental finite difference inequalities, Tamkang J.Math. 32(2001), 217-223. 40. Pachpatte, B.G., Inequalities useful for certain partial differential and difference equations, Radovi Math. 10(2001), 5-15. 41. Pachpatte, B.G., On some fundamental integral inequalities and their discrete analogues, J.Inequal.Pure and Appl.Math. 2(2)Art.15, 2001. 42. Pachpatte, B.G., Inequalities for Finite Difference Equations, Marcel

306

References

Dekker, Inc., New York, 2002. 43. Pachpatte, B.G., Explicit bounds on certain integral inequalities, J.Math. Anal.Appl. 267(2002), 48-61. 44. Pachpatte, B.G., A note on certain integral and discrete inequalities, An.Sti.Univ.Al.I.Cuza Iasi XLVIII(2002), 221-228. 45. Pachpatte, B.G., Integral inequalities of Bihari type, Math.Inequal.Appl. 5(2002), 649-657. 46. Pachpatte, B.G., Inequalities useful in the theory of certain partial differential equations, Fasc.Math. Nr.33(2002), 49-56. 47. Pachpatte, B.G., On some retarded integral inequalities and applications, J.Inequal.Pure and Appl.Math. 3(2)Art.18, 2002. 48. Pachpatte, B.G., On certain integral inequalities and their discrete analogues, Demonstratio Mathematica 35(2002), 243-250. 49. Pachpatte, B.G., On nonlinear finite difference inequalities in two independent variables, Tamkang J.Math. 33(2002), 67-75. 50. Pachpatte, S.B. and B.G.Pachpatte, On some useful integral inequalities and their discrete analogues, Tamkang J.Math. 33(2002), 139-148. 51. Pachpatte, S.B. and B.G.Pachpatte, Inequalities for terminal value problems for differential equations, Tamkang J.Math.33(2002), 199-208. 52. Pachpatte, B.G., A note on certain integral inequality, Tamkang J.Math. 33(2002), 353-358. 53. Pachpatte, B.G., Bounds on certain integral inequalities, J.Inequal.Pure and Appl.Math. 3(3)Art.47, 2002. 54. Pachpatte, B.G., On an inequality to general Volterra-Fredholm integral equation, An.Sti.Univ.Al.I.Cuza Iasi XLIX(2003), 221-228. 55. Pachpatte, B.G., Explicit bounds on Volterra type integral inequalities, Tamsui Oxford J.Math.Sci. 19(2003), 13-25. 56. Pachpatte, B.G., Comparison inequalities for partial finite difference equations, Math.Inequal.Appl. 6(2003), 393-396. 57. Pachpatte, B.G., On some basic finite difference inequalities, Fasc. Math., Nr.34 (2004), 65-71. 58. Pachpatte, B.G., On a certain retarded integral inequality and its applications, J.Inequal.Pure and Appl.Math. 5(1)Art.19, 2004. 59. Pachpatte, B.G., Inequalities applicable to certain partial differential equations, J.Inequal.Pure and Appl.Math.5(2)Art.27, 2004. 60. Pachpatte, B.G., On some new nonlinear retarded integral inequalities, J.Inequal.Pure and Appl.Math. 5(3)Art.80, 2004. 61. Pachpatte, B.G., Inequalities applicable to retarded Volterra integral equations, Tamkang J.Math. 35(2004), 285-291. 62. Pachpatte, B.G., On a new integral inequality applicable to certain partial integrodifferential equations, in, Inequality theory and Applications, Nova Science Publishers, New York, Vol.4, 2004. 63. Pachpatte, B.G., On higher order differential equation with retarded argument, in, Differential Equations and Applications, Nova Science Publishers, New York, Vol.4, 2004. 64. Pachpatte, B.G., Explicit bound on a retarded integral inequality, Math

References

307

Inequal.Appl. 7(2004), 7-11. 65. Pachpatte, B.G., Mathematical Inequalities, (North-Holland Mathematical Library) Elsevier Science B.V. 2005. 66. Pachpatte, B.G., Inequalities applicable to certain partial finite sum-difference equations, Demonstratio Mathematica 38(2005), 291-302. 67. Pachpatte, B.G., Growth estimates on certain discrete inequalities involving iterated sums, An.Sti.Univ.Al.I.Cuza, Iasi , LI, s.I, Matematicˇa (2005), 65-73. 68. Pachpatte, B.G., On generalizations of Bihari’s inequality, Soochow J.Math. 31(2005), 261-271. 69. Pachpatte, B.G., A note on certain retarded inequality, Tamkang J.Math. 36(4)(2005), to appear. 70. Pachpatte, B.G., Explicit bounds on Gamidov type integral inequalities, Tamkang J.Math.37(1)(2006), to appear. 71. Pachpatte, B.G., Explicit bound on a certain finite difference inequality, Bul.Inst.Polit.Iasi L(LIV)(1-2)(2004), 61-66. 72. Pachpatte, B.G., Growth estimates on certain integral inequalities in two variables involving iterated integrals, Tamkang J.Math. , 36(3)(2005), 179-191. 73. Pachpatte, B.G., A note on some discrete inequalities involving iterated sums, Tamusi Oxford J.Math.Sci., to appear. 74. Pachpatte, B.G., Explicit bounds on some retarded integral inequalities, Fasc.Math. 35(2005), 85-98. 75. Pachpatte, B.G., Inequalities applicable to Volterra-Fredholm integrodifferential equations, submitted 76. Pachpatte, B.G., On Gamidov type inequalities in two variables, submitted. 77. Pachpatte, B.G., On retarded integral inequalities for kernels of (L)-type, submitted. 78. Pachpatte, B.G., On iterated integral inequalities involving kernels of (L)-type, submitted. 79. Pachpatte, B.G., On certain nonlinear integral inequalities involving iterated integrals, Tamkang J.Math. , to appear. 80. Peano, G.,Sull’integrabilitˇ a delle equazioni differenziali del primo odine, Atti.R.Acad.Sc.Toriao,Vol.21(1885-86), 677-685. 81. Schr¨ oder, J., Operator Inequalities, Academic Press, New York, 1980. 82. Sugiyama, S., On some problems of functional-differential equations with advanced argument, Proc.U.S.Japan Sem.on Diff.Funct.Eqs., Benjamin, 1967, pp. 367-382. 83.Szarski, J., Differential Inequalities, PWN, Warsaw, 1965. 84. Walter, W., Differential and Integral Inequalities, Springer-Verlag, Berlin, New York, 1970. 85. Yang, E.H., Generalizations of Pachpatte’s integral and discrete inequalities, Ann.Diff.Eqs. 13 *1997), 180-188.

Index Gronwall-Bellman inequality 9, 11, 130 Gronwall’s inequality 2, 3, 4, 5, 61

A advanced type of differential equations 4 applicable analysis 1 approximation theory 1 of solutions 303

H H¨ older’s inequality 2 integral inequality 16 hyperbolic partial differential equations 117

B Bihari type inequality 27 Bihari’s inequality 2, 4, 9, 11, 13, 61 boundedness 54

I inequalities in one varible 9 with explicit estimates 4 initial boundary value problem 119 boundary conditions 187 value problems 5,183 integral equations 3, 4, 6, 9, 115, 127 inequalities 1, 4, 9, 29, 40, 61, 63, 73, 95, 127, 155, 167 iterated integrals 29, 84 sums 214, 236

C Cauchy-Schawarz inequality 2, 15 D differential and integral inequalities 1 equations 2, 6, 127 and integral equations 1, 5, 9, 40, 53, 127, 128,167, 180 discrete variable methods 5 E existence of solutions 1 explicit bound 3, 40, 127 estimates 1, 3, 4, 5, 9, 243, 303

J Jensen inequality 15 L linear integral inequality 3, 61

F finite difference analogues 5 difference equations 5, 6, 197, 224, 243, 294, 303 difference methods 303 difference inequalities 5, 6, 197, 205, 214, 224, 243, 255, 303 fixed point theorems 1

M mathematical analysis 1 analysis and application 6 Minkowski inequality 2 N nonlinear analysis 1, 197

G

308

Index dynamical systems 1 functions 13 integral inequalities 9, 13, 19, 61, 63, 73 partial differential equation 115 problems 2 non-self adjoint hyperbolic partial differential equation 187 hyperbolic partial Fredholm integrodifferential equation 119 numerical analysis 1 techniques 5 O ordinary differential equations 4 P parabolic partial differential equations 3, 19 partial differential equations 2, 187, 303 finite difference equations 5, 243, 294 finite sum-difference equations 298 physical systems 243 perturbed difference equations 234 Q qualitative properties 1, 53 R retarded differential equations 4, 183, 190 differential and integral equations 4 integral inequalities 4, 6, 127 Volterra-Fredholm integral equation 191 S several retarded arguments 181 singular kernals 13 sum-difference equations 197, 214, 224, 234, 243, 296, 300 T terminal values 117 value problem 58

309 V Volterra type difference equations 236 sum-difference equaitons 296 Volterra-Fredholm integral equation 57, 123 type 300 type sum-difference equations 237 W weakly singular kernals 3, 61 Wendroff’s ineqaulity 84


Integral and finite difference inequalities and applications

Integral and Finite Difference Inequalities and Applications

Integral inequalities and applications

Integral Inequalities and Applications (Mathematics and its Applications)

Multidimensional Integral Equations and Inequalities

Multidimensional Integral Equations and Inequalities

Inequalities and Applications

Integral Equations and Applications

Opial inequalities with applications in differential and difference equations

Integral Representations and Applications

Integral equations and applications

Opial inequalities with applications in differential and difference equations

Inequalities for differential and integral equations

Differential and integral inequalities: - Ordinary differential equations

Applications of nonstandard finite difference schemes

Finite Dimensional Variational Inequalities and Complementarity Problems

Finite-dimensional Variational Inequalities and Complementarity Problems

Finite-Dimensional Variational Inequalities and Complementarity Problems

Finite-dimensional Variational Inequalities and Complementarity Problems

Difference Algebra (Algebra and Applications)

Integral Transforms and their Applications

Nonlinear integral operators and applications

Integral Equations and their Applications

Integral Transforms and Their Applications

Integral Transforms and Their Applications

Integral equations and their applications

Nonlinear Integral Operators and Applications

Integral Transforms and Their Applications

Integral transforms and their applications

Applications of Lie Groups to Difference Equations (Differential and Integral Equations and Their Applications)

Applications of Lie Groups to Difference Equations (Differential and Integral Equations and Their Applications)

Integral and finite difference inequalities and applications