A variation of Gronwall's lemma
Quang-Cuong Pham (LPPA, College de France)

TL;DR
This paper presents a modified version of Gronwall's lemma, providing a new mathematical inequality useful for analyzing differential equations and related fields.
Contribution
It introduces a novel variation of Gronwall's lemma, expanding the toolkit for mathematical analysis in differential equations.
Findings
Proves a new form of Gronwall's inequality
Provides potential applications in differential equations
Enhances existing mathematical analysis methods
Abstract
We prove a variation of Gronwall's lemma.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications
A variation of Gronwall’s lemma
Quang-Cuong Pham
LPPA, Collège de France
Paris, France
Abstract
We prove a variation of Gronwall’s lemma.
The formulation and proof of the classical Gronwall’s lemma can be found in [1]. We prove here a variation of this lemma, which we were not able to find in the literature. The main difference from usual versions of Gronwall’s lemma is that is negative.
Lemma 1
Let be a continuous function, a real number and a positive real number. Assume that
[TABLE]
Then
[TABLE]
where .
Proof
Case 1 : , .
Define by
[TABLE]
Remark that is positive with , and satisfies (1) where the inequality has been replaced by an equality
[TABLE]
Consider now the set . If then the lemma holds true. Assume by contradiction that . In this case, consider an element . One has by definition . Since , one also has . Consider now
[TABLE]
By continuity of and and by the fact that , one has . One thus also has and
[TABLE]
Consider now . Equation (1) implies that
[TABLE]
In order to compare and for , let us differentiate the ratio .
[TABLE]
Thus is increasing for . Since , one can conclude that
[TABLE]
which implies, by definition of and , that
[TABLE]
Choose now a . Then one has by (3)
[TABLE]
which clearly contradicts (4).
Case 2 : ,
Consider the set . If then the lemma holds true. Assume by contradiction that . In this case, consider an element . One has by definition . Since , one also has . Consider now
[TABLE]
By continuity of and by the fact that , one has . One thus also has and
[TABLE]
Choose now a . Equation (1) implies that
[TABLE]
which clearly contradicts (5).
Case 3 :
Define . One has
[TABLE]
Thus satisfies the conditions of Case 1 or Case 2, and as a consequence
[TABLE]
The conclusion of the lemma follows by replacing by in the above equation.
Acknowledgments
The author would like to thank N. Tabareau and J.-J. Slotine for their helpful comments and V. Valmorin for having pointed out an error in an earlier version of the manuscript.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] I. Gikhman, A. Skorokhod. Introduction to the theory of random processes . WB Saunders Company, Philadelphia, 1969.
