Preprint
Article

This version is not peer-reviewed.

Lyapunov and Comparison Methods for Nonlinear Distributed-Delay Equations with Variable Delay and Perturbations

Submitted:

10 October 2026

Posted:

13 October 2026

You are already at the latest version

Abstract
We study boundedness, stability, asymptotic stability, and robustness for the nonlinear distributed-delay equation \( x'(t) = -\int_{t-r(t)}^{t}a(t,s)g(x(s))\,ds +p(t,x(t))+f(t), \) where the delay is bounded and may vary with time. The analysis is based on a direct dissipative decomposition of the distributed-delay term together with Lyapunov and Halanay-type comparison estimates. In contrast with fixed-point approaches based on a uniform contraction condition, the present method separates the instantaneous dissipative contribution from a memory remainder controlled by the first absolute moment of the kernel. No derivative of the delay is used. We first obtain a priori bounds under an integrable growth majorant and then establish exponential asymptotic stability under a uniform dissipation-versus-memory gap. A variable-coefficient Halanay inequality is developed to treat nonuniform dissipation and yields explicit decay estimates of the form \( |x(t)| \leq \norm{\phi}_\infty \exp\left( -\eta\int_0^t\lambda(s)\,ds \right). \) State-dependent perturbations and external forcing are also included, yielding ultimate bounds and convergence under vanishing forcing. For the elementary equation \( x'(t)=-c\int_{t-r}^{t}x(s)\,ds, \) our criterion gives exponential asymptotic stability whenever \( cr^{2}<2 \), whereas the contraction condition in Burton's fixed-point result requires \( cr^{2}<1 \). Thus the Lyapunov/comparison method applies on the nonempty parameter range \( 1\leq cr^{2}<2 \) where that contraction criterion fails. The exact characteristic stability boundary for this example is \( cr^{2}=\pi^{2}/2 \), indicating the remaining gap between the present sufficient condition and the sharp linear threshold.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Functional and delay differential equations arise naturally in mathematical models in which the present evolution of a system depends not only on its current state but also on its past history. Such equations occur in population dynamics, control theory, viscoelasticity, neural networks, epidemiology, engineering, and other areas in which aftereffects and hereditary mechanisms cannot be neglected. The qualitative theory of functional differential equations, including existence, boundedness, stability, and asymptotic behavior, has therefore developed into a substantial area of research; see, for example, [5,11,12,13] and the references therein. Closely related ideas occur in the theory of Volterra integral and integro-differential equations, where memory is represented through integral terms; see [4,14].
An important class of hereditary equations consists of equations with distributed delay. In contrast with a discrete-delay equation, in which the dynamics depend on one or several particular past states, a distributed-delay equation incorporates an aggregate of the past over an interval. A representative scalar model, studied in particular by Burton [1], is
x ′ ( t ) = − ∫ t − r t a ( t , s ) g ( x ( s ) ) d s ,
where r > 0 is constant. Of particular relevance to the present paper is Burton’s fixed-point treatment of (1) in the classical paper [1]. Burton considered (1) with a nonconvolution kernel and developed a fixed-point approach to the stability and asymptotic stability of its solutions. The kernel a ( t , s ) describes the relative influence of the past state at time s on the present dynamics, while the nonlinear function g represents the response of the system. Depending on the assumptions imposed on the kernel and the nonlinearity, one may seek boundedness of solutions, stability or asymptotic stability of the zero solution, decay estimates, or more general asymptotic properties.
A variety of methods have been developed for the stability analysis of delay and functional differential equations. Among the classical tools are Lyapunov functions, Lyapunov–Krasovskii functionals, Razumikhin techniques, comparison principles, limiting-equation methods, and differential inequalities; see [5,11,12,13]. Lyapunov functionals are particularly attractive because they permit the geometry of the memory term to be incorporated directly into an energy-like quantity. Nevertheless, the construction of a suitable functional can be technically demanding, particularly when the kernel is nonconvolution, the delay depends on time, or the equation contains nonlinear perturbations.
A closely related and especially useful comparison device is the Halanay inequality. In its classical form, a nonnegative function satisfying an inequality of the type
D + V ( t ) ≤ − α V ( t ) + β sup t − r ≤ s ≤ t V ( s ) , α > β > 0 ,
decays exponentially. Since its introduction by Halanay [12], this principle has become an important tool in the stability theory of equations with delay. Numerous extensions have been developed for nonlinear, nonautonomous, neutral, and time-varying delay equations; see, for example, [15,16,17] and the references therein. The importance of such inequalities for the present work is that they naturally separate an instantaneous dissipative contribution from the destabilizing effect of the delayed terms. This separation is precisely the mechanism that we exploit below.
Another approach to stability, particularly influential in the work of Burton and collaborators, is based on fixed-point theory. Fixed-point methods have proved useful for ordinary, functional, integral, and integro-differential equations because they can sometimes establish stability without constructing a classical Lyapunov functional; see [1,2,3] and the references therein. The underlying idea is to rewrite the differential equation as an equivalent integral equation and then study the associated solution operator on a suitable complete metric space. Banach’s contraction principle, Krasnosel’skii-type fixed-point theorems, and related compactness arguments have consequently provided useful alternatives to direct Lyapunov methods.
Of particular relevance to the present paper is Burton’s treatment of the nonconvolution equation (1) in [1]. In that approach an integrated kernel A ( t , s ) is introduced and the differential equation is transformed into an integral equation. Stability is then obtained by requiring the resulting operator to be contractive. A central smallness condition can be expressed in the form
2 sup t ≥ 0 ∫ t − r t | A ( t , u ) | d u < 1 .
An important advantage of the fixed-point formulation is that it avoids some of the sign and differentiability requirements appearing in certain classical Lyapunov-functional arguments. On the other hand, condition (2) requires the memory contribution to be uniformly small enough for the complete solution operator to be a contraction. Thus, an equation may possess substantial intrinsic dissipation and nevertheless fail the contraction criterion simply because the memory operator is too large when considered independently.
This observation motivates the present work. Rather than asking that the complete memory contribution be small in an absolute sense, we ask whether its size can be measured relative to the instantaneous dissipation available in the equation. This point of view is closer in spirit to Lyapunov and Halanay comparison methods, where stability results from a balance between a negative instantaneous contribution and a delayed contribution. It also suggests that one may treat equations for which the associated fixed-point operator is not a contraction.
We consider the nonlinear perturbed distributed-delay equation
x ′ ( t ) = − ∫ t − r ( t ) t a ( t , s ) g ( x ( s ) ) d s + p ( t , x ( t ) ) + f ( t ) ,
where r ( t ) is a bounded time-dependent delay, a ( t , s ) is a possibly nonconvolution kernel, g is a nonlinear restoring term, p ( t , x ) represents a state-dependent perturbation, and f ( t ) is an external forcing term. Equation (3) therefore extends the classical equation (1) in several directions simultaneously. Our principal objectives are to obtain boundedness, stability of the zero solution, asymptotic and exponential stability, and robustness estimates in the presence of perturbations and forcing.
The starting point of our analysis is a simple decomposition which reveals the dissipative structure hidden in the distributed-delay term. Define
B ( t ) = ∫ t − r ( t ) t a ( t , s ) d s .
Adding and subtracting B ( t ) g ( x ( t ) ) in (3) gives
x ′ ( t ) = − B ( t ) g ( x ( t ) ) + R ( t ) + p ( t , x ( t ) ) + f ( t ) ,
where
R ( t ) = ∫ t − r ( t ) t a ( t , s ) g ( x ( t ) ) − g ( x ( s ) ) d s .
The significance of (5) is that the original distributed memory term has been separated into two qualitatively different parts. The term
− B ( t ) g ( x ( t ) )
acts instantaneously and is dissipative when B ( t ) > 0 and x g ( x ) > 0 , whereas R ( t ) measures the error generated by replacing the past values g ( x ( s ) ) by the present value g ( x ( t ) ) .
When g is Lipschitz, the remainder R ( t ) can be estimated through the difference x ( t ) − x ( s ) . Since
| x ( t ) − x ( s ) | ≤ ∫ s t | x ′ ( u ) | d u ,
the resulting estimate involves the first moment of the kernel,
∫ t − r ( t ) t ( t − s ) | a ( t , s ) | d s .
This quantity measures not merely the total magnitude of the memory kernel but also the temporal distance over which the past acts on the present state. The resulting differential inequality has the general form
D + V ( t ) ≤ − α ( t ) V ( t ) + β ( t ) sup t − τ ≤ s ≤ t V ( s ) + q ( t ) ,
and is therefore naturally suited to Lyapunov–Halanay comparison. The essential stability requirement becomes a dissipation-versus-memory condition: the effective instantaneous dissipation must dominate the contribution generated by the memory remainder. This differs fundamentally from requiring the entire solution operator to be contractive.
A further advantage of the decomposition is particularly important for time-dependent delays. We do not differentiate an integral having the moving lower endpoint t − r ( t ) . Consequently, no derivative r ′ ( t ) is produced in the estimates. The method can therefore be formulated for bounded continuous delays without imposing the frequently used differentiability restriction on r. This permits delays whose derivatives are unavailable or poorly behaved and separates the stability mechanism from unnecessary regularity of the delay itself. The treatment of time-varying delays by comparison and generalized Halanay inequalities has received considerable attention in the literature; see, for example, [16,17]. The present approach combines this comparison philosophy with the special structure of distributed memory.
The results developed below may be viewed as providing a bridge between two classical philosophies. The fixed-point approach controls the memory term by requiring a suitable integral operator to be a contraction, whereas the Lyapunov–Halanay approach permits a larger memory contribution provided that it is compensated by sufficiently strong dissipation. Our aim is not to replace the fixed-point method, which remains useful under assumptions where Lyapunov constructions may be difficult, but rather to identify a complementary regime in which dissipation can be exploited explicitly.
The distinction can already be seen in a simple linear example. Consider
x ′ ( t ) = − c ∫ t − r t x ( s ) d s , c > 0 .
For this equation, Burton’s contraction hypothesis (2) reduces to
c r 2 < 1 .
In contrast, the dissipation-versus-memory criterion developed in this paper yields
c r 2 < 2 .
Consequently, the interval
1 ≤ c r 2 < 2
provides an explicit class of equations for which the stability theorem proved here applies while Burton’s contraction criterion does not, see [1]. Thus the gain is not merely methodological: separating dissipation from memory produces a strictly larger admissible parameter region.
The paper is organized around several broad stages. We first establish the fundamental estimates associated with decomposition (5) and identify the kernel quantities governing the memory remainder. We then obtain boundedness results under integrable growth conditions and develop stability criteria based on the competition between dissipation and memory. Halanay-type comparison arguments yield exponential asymptotic stability under a uniform dissipative gap, while more general time-dependent conditions lead to asymptotic results under nonuniform dissipation. The theory is then extended to state-dependent perturbations and external forcing, including ultimate boundedness and convergence under vanishing forcing. Finally, explicit examples are presented to compare the new conditions with the contraction criterion and to illustrate the role played by variable delay, nonlinear damping, and perturbations.
The principal contribution of the paper is therefore a Lyapunov–comparison framework for nonlinear distributed-delay equations with bounded variable delay in which stability is governed by the balance between instantaneous dissipation and effective memory. The approach avoids differentiation of the delay, accommodates perturbations and forcing, and, even in the elementary linear case, produces stability conditions beyond the range obtained from the corresponding contraction argument.

2. Preliminaries and the Fundamental Decomposition

Let r : [ 0 , ∞ ) → [ 0 , r 0 ] be continuous, where r 0 > 0 . For simplicity of notation we assume that an initial function
ϕ ∈ C ( [ − r 0 , 0 ] , R )
is prescribed and that solutions of (3) satisfy x ( t ) = ϕ ( t ) for − r 0 ≤ t ≤ 0 . When necessary one may begin at an arbitrary initial time t 0 with the usual translation of the history interval. We assume throughout that the hypotheses imposed on a, g, p, and f guarantee local existence of solutions. The estimates below then provide continuation whenever they give an a priori bound.
We impose the following basic assumptions, locally or globally according to the theorem under consideration.
(H1)
a ( t , s ) is continuous on the region t ≥ 0 , t − r ( t ) ≤ s ≤ t , and
K ( t ) : = ∫ t − r ( t ) t | a ( t , s ) | d s < ∞ .
(H2)
The averaged coefficient
B ( t ) : = ∫ t − r ( t ) t a ( t , s ) d s
is nonnegative. For stability results we shall usually assume B ( t ) ≥ B 0 > 0 .
(H3)
g ( 0 ) = 0 and, on the region under consideration, there are constants m > 0 and L > 0 such that
x g ( x ) ≥ m x 2 , | g ( x ) − g ( y ) | ≤ L | x − y | .
In particular, | g ( x ) | ≤ L | x | .
(H4)
The perturbation satisfies p ( t , 0 ) = 0 and
| p ( t , x ) | ≤ ρ ( t ) | x | ,
where ρ is nonnegative and continuous.
The quantity that naturally measures the memory remainder is the first absolute moment
J ( t ) : = ∫ t − r ( t ) t ( t − s ) | a ( t , s ) | d s .
Notice that
0 ≤ J ( t ) ≤ r 0 K ( t ) .
The first moment J ( t ) contains more information than the mass K ( t ) : memory located very near the present time is less costly than memory concentrated near the far end of the delay interval.
For t ≥ 0 define
M 2 ( t ) : = sup max { − r 0 , t − 2 r 0 } ≤ u ≤ t | x ( u ) | .
The appearance of 2 r 0 in the definition of M 2 ( t ) is essential. Indeed, if s ∈ [ t − r ( t ) , t ] , then s ≥ t − r 0 , and in estimating x ( t ) − x ( s ) we integrate x ′ ( u ) over u ∈ [ s , t ] . Since x ′ ( u ) contains delayed states x ( v ) with
u − r ( u ) ≤ v ≤ u ,
and since u ≥ t − r 0 and r ( u ) ≤ r 0 , it follows that
v ≥ u − r ( u ) ≥ t − 2 r 0 .
Taking into account the prescribed initial interval [ − r 0 , 0 ] , the appropriate envelope is therefore M 2 ( t ) as defined above. Thus the subscript 2 reflects the effective history length 2 r 0 generated by estimating the memory remainder.
Lemma 1.
Assume (H1)–(H4) Let
K ^ ( t ) = sup max { 0 , t − r 0 } ≤ u ≤ t K ( u ) , ρ ^ ( t ) = sup max { 0 , t − r 0 } ≤ u ≤ t ρ ( u ) ,
and
F 1 ( t ) = sup max { 0 , t − r 0 } ≤ u ≤ t | f ( u ) | .
Then the remainder (6) satisfies
| R ( t ) | ≤ L J ( t ) L K ^ ( t ) + ρ ^ ( t ) M 2 ( t ) + L J ( t ) F 1 ( t ) .
Proof. 
By the Lipschitz property of g,
| R ( t ) | ≤ L ∫ t − r ( t ) t | a ( t , s ) | | x ( t ) − x ( s ) | d s ≤ L ∫ t − r ( t ) t | a ( t , s ) | ∫ s t | x ′ ( u ) | d u d s .
For u ∈ [ t − r 0 , t ] , equation (3) gives
| x ′ ( u ) | ≤ ∫ u − r ( u ) u | a ( u , v ) | | g ( x ( v ) ) | d v + | p ( u , x ( u ) ) | + | f ( u ) | ≤ L K ( u ) M 2 ( t ) + ρ ( u ) M 2 ( t ) + F 1 ( t ) ≤ L K ^ ( t ) + ρ ^ ( t ) M 2 ( t ) + F 1 ( t ) .
Substitution into the preceding estimate yields
| R ( t ) | ≤ L [ L K ^ ( t ) + ρ ^ ( t ) ] M 2 ( t ) + F 1 ( t ) ∫ t − r ( t ) t ( t − s ) | a ( t , s ) | d s ,
which is (11). □
It is convenient to introduce
Γ ( t ) : = L J ( t ) L K ^ ( t ) + ρ ^ ( t ) .
Then (5) and Lemma 1 imply, whenever x ( t ) ≠ 0 ,
D + | x ( t ) | ≤ − m B ( t ) | x ( t ) | + ρ ( t ) | x ( t ) | + Γ ( t ) M 2 ( t ) + 1 + L J ( t ) F 1 ( t ) .
The same inequality holds in the upper Dini sense at x ( t ) = 0 . Thus, with
α ( t ) : = m B ( t ) − ρ ( t ) , q ( t ) : = 1 + L J ( t ) F 1 ( t ) ,
we obtain the fundamental comparison inequality
D + | x ( t ) | ≤ − α ( t ) | x ( t ) | + Γ ( t ) M 2 ( t ) + q ( t ) .
This inequality is the basis of all subsequent results.
We shall use the following standard form of Halanay’s inequality.
Lemma 2
(Halanay comparison). Let h > 0 and let u : [ − h , ∞ ) → [ 0 , ∞ ) be continuous. Suppose
D + u ( t ) ≤ − α u ( t ) + β sup t − h ≤ s ≤ t u ( s ) , t ≥ 0 ,
where α > β ≥ 0 . Then there exists a unique η > 0 satisfying
η = α − β e η h ,
and
u ( t ) ≤ sup − h ≤ s ≤ 0 u ( s ) e − η t , t ≥ 0 .
We also use an envelope observation for estimates without a negative instantaneous term.
Lemma 3
(Envelope estimate). Let h > 0 and let
u : [ − h , ∞ ) ⟶ [ 0 , ∞ )
be continuous. Suppose that
D + u ( t ) ≤ ν ( t ) sup t − h ≤ s ≤ t u ( s ) , t ≥ 0 ,
where ν ≥ 0 is locally integrable. Then
sup − h ≤ s ≤ t u ( s ) ≤ sup − h ≤ s ≤ 0 u ( s ) exp ∫ 0 t ν ( s ) d s , t ≥ 0 .
In particular, if ν ∈ L 1 ( 0 , ∞ ) , then u is uniformly bounded on [ − h , ∞ ) .
Proof. 
Define the running envelope
U ( t ) : = sup − h ≤ s ≤ t u ( s ) , t ≥ 0 ,
and put
U ( 0 ) = sup − h ≤ s ≤ 0 u ( s ) .
Since u is continuous, U is finite, continuous, and nondecreasing. Moreover,
u ( t ) ≤ U ( t )
and
sup t − h ≤ s ≤ t u ( s ) ≤ U ( t ) .
Consequently, the assumed differential inequality implies
D + u ( t ) ≤ ν ( t ) U ( t ) .
We claim that
D + U ( t ) ≤ ν ( t ) U ( t ) , t ≥ 0 .
To establish this claim, fix t ≥ 0 . There are two cases.
First suppose that
u ( t ) < U ( t ) .
By continuity of u, there exist δ > 0 and η > 0 such that
u ( s ) ≤ U ( t ) − η , t ≤ s ≤ t + δ .
Indeed, since u ( t ) < U ( t ) , one may choose
0 < η < U ( t ) − u ( t ) 2
and then use continuity at t.
For 0 < q < δ , the values of u on [ t , t + q ] therefore remain strictly below U ( t ) . Since the interval [ − h , t ] is contained in [ − h , t + q ] , we have
U ( t + q ) = max U ( t ) , sup t ≤ s ≤ t + q u ( s ) = U ( t ) .
Hence
D + U ( t ) = 0 .
Since ν ( t ) U ( t ) ≥ 0 , it follows immediately that
D + U ( t ) ≤ ν ( t ) U ( t ) .
Now suppose that
u ( t ) = U ( t ) .
For q > 0 ,
U ( t + q ) = max U ( t ) , sup t ≤ s ≤ t + q u ( s ) .
Therefore
U ( t + q ) − U ( t ) ≤ sup t ≤ s ≤ t + q u ( s ) − u ( t ) + ,
where
z + : = max { z , 0 } .
Taking the upper right Dini derivative gives
D + U ( t ) ≤ max { 0 , D + u ( t ) } .
Using (20) and the fact that ν ( t ) U ( t ) ≥ 0 , we obtain
D + U ( t ) ≤ max { 0 , D + u ( t ) } ≤ ν ( t ) U ( t ) .
Thus (21) holds in both cases.
We may now apply the Dini-derivative form of Gronwall’s inequality. For completeness, this step can also be seen directly. Define
N ( t ) : = ∫ 0 t ν ( s ) d s
and
W ( t ) : = e − N ( t ) U ( t ) .
The inequality (21) implies, in the Dini sense,
D + W ( t ) ≤ e − N ( t ) D + U ( t ) − ν ( t ) U ( t ) ≤ 0 .
Hence W is nonincreasing, and consequently
e − N ( t ) U ( t ) ≤ U ( 0 ) .
Equivalently,
U ( t ) ≤ U ( 0 ) e N ( t ) = U ( 0 ) exp ∫ 0 t ν ( s ) d s .
Recalling the definition of U, we obtain
sup − h ≤ s ≤ t u ( s ) ≤ sup − h ≤ s ≤ 0 u ( s ) exp ∫ 0 t ν ( s ) d s ,
which proves (19).
Finally, if ν ∈ L 1 ( 0 , ∞ ) , then
∫ 0 t ν ( s ) d s ≤ ∫ 0 ∞ ν ( s ) d s = : N ∞ < ∞ .
Therefore
U ( t ) ≤ U ( 0 ) e N ∞ , t ≥ 0 .
Since u ( t ) ≤ U ( t ) , we conclude that
u ( t ) ≤ sup − h ≤ s ≤ 0 u ( s ) exp ∫ 0 ∞ ν ( s ) d s , t ≥ 0 ,
and hence u is uniformly bounded on [ − h , ∞ ) . □

3. Boundedness Under an Integrable Growth Majorant

We begin with a result whose purpose is different from asymptotic stability. The negative term in (15) may be discarded, and the remaining growth can still be controlled if its coefficient is integrable. This is useful when the available dissipation is not uniformly strong enough to dominate the memory at every time.
Theorem 1
(Boundedness). Assume (H1)–(H4), let f ≡ 0 , and suppose
α ( t ) ≥ 0 , Γ ∈ L 1 ( 0 , ∞ ) .
Then every solution that remains in the region where the hypotheses hold satisfies
| x ( t ) | ≤ ϕ ∞ exp ∫ 0 t Γ ( s ) d s ≤ e Γ 1 ϕ ∞ .
If the hypotheses are global, every local solution is bounded on its interval of existence; under the usual continuation property it is therefore global.
Proof. 
With f ≡ 0 , (15) and α ( t ) ≥ 0 give
D + | x ( t ) | ≤ Γ ( t ) M 2 ( t ) .
Apply Lemma 3 with h = 2 r 0 and u ( t ) = | x ( t ) | . This gives
sup − 2 r 0 ≤ s ≤ t | x ( s ) | ≤ ϕ ∞ exp ∫ 0 t Γ ( s ) d s ,
where the history may be extended harmlessly on [ − 2 r 0 , − r 0 ] by its endpoint bound if only [ − r 0 , 0 ] is prescribed. The stated estimate follows. □
Remark 1.
Theorem 1 illustrates the difference between an integrable-growth condition and a contraction condition. No number is required to be uniformly less than one. A coefficient may be large on finite intervals, or on a sparse collection of intervals, provided that its total destabilizing contribution measured by Γ is integrable.
A useful local version follows immediately.
Corollary 1.
Suppose (H1)–(H4) hold for | x | ≤ R , f ≡ 0 , (22) holds, and
e Γ 1 ϕ ∞ < R .
Then the solution cannot leave the ball | x | < R . Consequently, the estimate (23) is valid for all t ≥ 0 for which the standard continuation theorem applies.

4. Stability and Dissipation Versus Memory

We now retain the negative term in (15). The resulting criterion compares the instantaneous damping m B ( t ) − ρ ( t ) with the memory coefficient Γ ( t ) . This is the central structural condition of the paper.
Theorem 2
(Uniform exponential stability). Assume (H1)–(H4), let f ≡ 0 , and suppose there are constants α 0 > β 0 ≥ 0 such that
α ( t ) = m B ( t ) − ρ ( t ) ≥ α 0 , Γ ( t ) ≤ β 0 , t ≥ 0 .
Then the zero solution of (3) is uniformly exponentially stable. More precisely, if η > 0 is the solution of
η = α 0 − β 0 e 2 η r 0 ,
then
| x ( t ) | ≤ ϕ ∞ e − η t , t ≥ 0 .
for every solution remaining in the region on which the hypotheses hold.
Proof. 
From (15), with f = 0 ,
D + | x ( t ) | ≤ − α 0 | x ( t ) | + β 0 sup t − 2 r 0 ≤ s ≤ t | x ( s ) | .
Lemma 2, with h = 2 r 0 , yields (26). □
Remark 2.
Condition (24) does not ask that the memory operator itself be a contraction. The quantity β 0 is allowed to be positive and even substantial; what matters is that the effective instantaneous dissipation α 0 dominate it. This distinction is responsible for the improvement in the examples below.
The preceding theorem has a convenient global form when K, J, and ρ have uniform bounds.
Corollary 2.
Assume f ≡ 0 and suppose
B ( t ) ≥ B 0 > 0 , K ( t ) ≤ K 0 , J ( t ) ≤ J 0 , ρ ( t ) ≤ ρ 0 .
If
m B 0 − ρ 0 > L J 0 ( L K 0 + ρ 0 ) ,
then the zero solution is uniformly exponentially stable.
Proof. 
We have
α ( t ) ≥ m B 0 − ρ 0
and
Γ ( t ) ≤ L J 0 ( L K 0 + ρ 0 ) .
Thus (27) gives the strict gap required in Theorem 2. □
The theorem also yields local nonlinear stability under local sector conditions.
Theorem 3
(Local asymptotic stability). Suppose there is R > 0 such that (H1)–(H4) hold whenever | x | , | y | ≤ R , and suppose (24) holds on this region. Then there exists δ > 0 such that
ϕ ∞ < δ
implies that the solution exists globally, remains in | x ( t ) | < R , and satisfies x ( t ) → 0 exponentially.
Proof. 
Choose δ < R . As long as the solution remains in the ball, Theorem 2 gives
| x ( t ) | ≤ ϕ ∞ e − η t < R .
Thus a first exit from the ball is impossible. The estimate therefore continues for all time and implies convergence to zero. □

5. Asymptotic Stability with Time-Dependent Dissipation

Uniform domination is convenient but not always necessary. In applications the damping and memory coefficients may vary substantially with time. We therefore record a variable-coefficient comparison formulation. The preceding estimates reduce the asymptotic analysis to a variable-coefficient delay differential inequality. We therefore record the following Halanay-type comparison lemma, which provides an explicit decay estimate when the instantaneous dissipation dominates the delayed contribution by a fixed relative gap. An important feature of the result is that the coefficient of dissipation need not be bounded away from zero; it is sufficient that its cumulative effect diverges while its mass over each delay interval remains uniformly bounded.
Lemma 4
(A variable-coefficient Halanay inequality). Let h > 0 , let
u : [ − h , ∞ ) ⟶ [ 0 , ∞ )
be continuous, and suppose that
D + u ( t ) ≤ − λ ( t ) u ( t ) + θ λ ( t ) sup t − h ≤ s ≤ t u ( s ) , t ≥ 0 ,
where λ : [ 0 , ∞ ) → ( 0 , ∞ ) is continuous and 0 ≤ θ < 1 . Assume that
Λ h : = sup t ≥ 0 ∫ ( t − h ) + t λ ( s ) d s < ∞ ,
where ( t − h ) + = max { 0 , t − h } .
Let η ∈ ( 0 , 1 ] be the unique positive solution of
η + θ e η Λ h = 1 .
Then
u ( t ) ≤ sup − h ≤ s ≤ 0 u ( s ) exp − η ∫ 0 t λ ( s ) d s , t ≥ 0 .
Consequently, if
∫ 0 ∞ λ ( s ) d s = ∞ ,
then
u ( t ) ⟶ 0 as t → ∞ .
Proof. 
Set
U 0 : = sup − h ≤ s ≤ 0 u ( s )
and define
L ( t ) : = ∫ 0 t λ ( s ) d s , t ≥ 0 .
Since λ ( t ) > 0 , the function L is continuous and strictly increasing.
We first verify that the number η appearing in (30) exists and is unique. Define
F ( η ) = η + θ e η Λ h − 1 , η ≥ 0 .
If 0 ≤ θ < 1 , then
F ( 0 ) = θ − 1 < 0 .
Moreover,
F ( 1 ) = θ e Λ h ≥ 0 .
Thus, by continuity, there exists
η ∈ ( 0 , 1 ]
such that F ( η ) = 0 . Furthermore,
F ′ ( η ) = 1 + θ Λ h e η Λ h > 0 ,
so F is strictly increasing. Hence the solution is unique.
We now construct an explicit comparison function. Define
v ( t ) = U 0 , − h ≤ t ≤ 0 , U 0 e − η L ( t ) , t ≥ 0 .
Clearly,
u ( t ) ≤ v ( t ) = U 0 , − h ≤ t ≤ 0 .
For t > 0 ,
v ′ ( t ) = − η λ ( t ) v ( t ) .
We next estimate the delayed envelope of v. Since L is nondecreasing, v is nonincreasing on [ 0 , ∞ ) . We claim that
sup t − h ≤ s ≤ t v ( s ) ≤ e η Λ h v ( t ) , t ≥ 0 .
To verify this, first suppose that t ≥ h . Then t − h ≥ 0 , and since v is nonincreasing,
sup t − h ≤ s ≤ t v ( s ) = v ( t − h ) .
Therefore
v ( t − h ) v ( t ) = exp η [ L ( t ) − L ( t − h ) ] = exp η ∫ t − h t λ ( s ) d s ≤ e η Λ h .
Hence
sup t − h ≤ s ≤ t v ( s ) ≤ e η Λ h v ( t ) .
If 0 ≤ t < h , part of the delay interval lies in the initial interval [ − h , 0 ] . On that part,
v ( s ) = U 0 .
Thus
sup t − h ≤ s ≤ t v ( s ) = U 0 .
Since
v ( t ) = U 0 e − η L ( t ) ,
we obtain
U 0 v ( t ) = e η L ( t ) = exp η ∫ 0 t λ ( s ) d s ≤ e η Λ h .
Thus (33) also holds when 0 ≤ t < h .
Using (33), we have
− λ ( t ) v ( t ) + θ λ ( t ) sup t − h ≤ s ≤ t v ( s ) ≤ − λ ( t ) v ( t ) + θ λ ( t ) e η Λ h v ( t ) = − λ ( t ) 1 − θ e η Λ h v ( t ) .
By the defining equation (30),
1 − θ e η Λ h = η .
Consequently,
− λ ( t ) v ( t ) + θ λ ( t ) sup t − h ≤ s ≤ t v ( s ) ≤ − η λ ( t ) v ( t ) = v ′ ( t ) .
Thus v is a supersolution of the Halanay inequality.
We now prove that
u ( t ) ≤ v ( t ) , t ≥ 0 .
Although this follows from the standard comparison principle, we give the argument because it is central to the estimate.
Fix ε > 0 and define
v ε ( t ) = U 0 + ε , − h ≤ t ≤ 0 , ( U 0 + ε ) e − η L ( t ) , t ≥ 0 .
Then
u ( s ) < v ε ( s ) , − h ≤ s ≤ 0 .
The preceding calculation applies equally to v ε .
Suppose, contrary to the desired conclusion, that u reaches v ε at some positive time. Let t * > 0 be the first such time. Then
u ( t ) < v ε ( t ) , 0 ≤ t < t * ,
and
u ( t * ) = v ε ( t * ) .
By the first-contact property,
D + u − v ε ( t * ) ≥ 0 .
Moreover, for every
s ∈ [ t * − h , t * ] ,
we have
u ( s ) ≤ v ε ( s ) ,
where the inequality is strict whenever s < t * and equality may occur at s = t * . Hence
sup t * − h ≤ s ≤ t * u ( s ) ≤ sup t * − h ≤ s ≤ t * v ε ( s ) .
Applying (28) at t * gives
D + u ( t * ) ≤ − λ ( t * ) u ( t * ) + θ λ ( t * ) sup t * − h ≤ s ≤ t * u ( s ) ≤ − λ ( t * ) v ε ( t * ) + θ λ ( t * ) sup t * − h ≤ s ≤ t * v ε ( s ) .
By (35),
D + u ( t * ) ≤ v ε ′ ( t * ) .
Therefore
D + ( u − v ε ) ( t * ) ≤ 0 .
To obtain a strict contradiction, one may replace η temporarily by any number η ε > 0 satisfying
η ε + θ e η ε Λ h < 1
and then let η ε ↑ η . Equivalently, the standard non-strict Dini comparison principle applied to the supersolution v ε yields
u ( t ) ≤ v ε ( t ) , t ≥ 0 .
Letting ε ↓ 0 gives
u ( t ) ≤ U 0 e − η L ( t ) .
Thus
u ( t ) ≤ sup − h ≤ s ≤ 0 u ( s ) exp − η ∫ 0 t λ ( s ) d s ,
which proves (31).
Finally, if
∫ 0 ∞ λ ( s ) d s = ∞ ,
then
L ( t ) ⟶ ∞ .
Since η > 0 ,
exp [ − η L ( t ) ] ⟶ 0 .
Therefore
u ( t ) ⟶ 0 as t → ∞ .
This completes the proof. □
Before stating the weighted-gap result, we emphasize the length of the delay interval appearing in the comparison inequality. Although the original equation involves the variable delay r ( t ) ≤ r 0 , the estimate of the memory remainder requires a larger history interval. Indeed, for s ∈ [ t − r ( t ) , t ] , the difference x ( t ) − x ( s ) is estimated by integrating x ′ over [ s , t ] . For each u ∈ [ s , t ] , the term x ′ ( u ) depends in turn on values x ( v ) with
u − r ( u ) ≤ v ≤ u .
Since s ≥ t − r 0 , u ≥ s , and r ( u ) ≤ r 0 , we have
v ≥ u − r ( u ) ≥ t − 2 r 0 .
Consequently, the remainder estimate naturally involves
M 2 ( t ) = sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t | x ( s ) | .
Thus the effective delay length in the Halanay comparison is 2 r 0 , rather than r 0 . This is the same delay length used in Theorem 2. Accordingly, in the variable-coefficient comparison below we take
h = 2 r 0
and define
Λ 2 r 0 : = sup t ≥ 0 ∫ ( t − 2 r 0 ) + t λ ( s ) d s .
This choice makes the weighted Halanay comparison consistent with the fundamental estimate (15). “`latex
Theorem 4
(Asymptotic stability under a weighted gap). Let f ≡ 0 and assume (H1)–(H4). Suppose there exist a continuous function
λ : [ 0 , ∞ ) ⟶ ( 0 , ∞ )
and a constant θ ∈ [ 0 , 1 ) such that
Γ ( t ) ≤ θ λ ( t ) , α ( t ) ≥ λ ( t ) , t ≥ 0 .
Assume further that
Λ 2 r 0 : = sup t ≥ 0 ∫ ( t − 2 r 0 ) + t λ ( s ) d s < ∞
and
∫ 0 ∞ λ ( s ) d s = ∞ .
Let η ∈ ( 0 , 1 ] be the unique solution of
η + θ e η Λ 2 r 0 = 1 .
Then every solution with initial function ϕ satisfies
| x ( t ) | ≤ ϕ ∞ exp − η ∫ 0 t λ ( s ) d s , t ≥ 0 .
Consequently, the zero solution is asymptotically stable.
Proof. 
Since f ≡ 0 , the fundamental comparison inequality (15) gives
D + | x ( t ) | ≤ − α ( t ) | x ( t ) | + Γ ( t ) M 2 ( t ) ,
where
M 2 ( t ) = sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t | x ( s ) | .
Using (37), we obtain
D + | x ( t ) | ≤ − λ ( t ) | x ( t ) | + θ λ ( t ) M 2 ( t ) .
The important point is that the history appearing in (42) extends at most 2 r 0 units into the past. Hence, with u ( t ) = | x ( t ) | , the relevant variable-coefficient Halanay inequality has delay length
h = 2 r 0 .
Therefore the local accumulated dissipation appearing in Lemma 4 is precisely
Λ h = Λ 2 r 0 = sup t ≥ 0 ∫ ( t − 2 r 0 ) + t λ ( s ) d s .
Applying Lemma 4 with h = 2 r 0 yields
| x ( t ) | ≤ ϕ ∞ exp − η ∫ 0 t λ ( s ) d s ,
where η > 0 is determined by
η + θ e η Λ 2 r 0 = 1 .
This proves (41).
Since
∫ 0 ∞ λ ( s ) d s = ∞ ,
we have
exp − η ∫ 0 t λ ( s ) d s ⟶ 0 as t → ∞ .
Thus
x ( t ) ⟶ 0 .
Moreover,
exp − η ∫ 0 t λ ( s ) d s ≤ 1 ,
and therefore
| x ( t ) | ≤ ϕ ∞ , t ≥ 0 .
Hence, given ε > 0 , choosing δ = ε gives
ϕ ∞ < δ ⟹ | x ( t ) | < ε for all t ≥ 0 .
The zero solution is therefore stable and attractive, and hence asymptotically stable. □
Remark 3.
Theorem 4 does not require the effective dissipation λ ( t ) to be bounded away from zero. Thus it applies to situations not covered by the uniform exponential-stability criterion of Theorem 2. The decay rate is determined by the accumulated dissipation
∫ 0 t λ ( s ) d s .
For example, if
λ ( t ) = a 1 + t , a > 0 ,
then
∫ 0 t λ ( s ) d s = a log ( 1 + t ) ,
and (41) yields the algebraic decay estimate
| x ( t ) | ≤ ϕ ∞ ( 1 + t ) − a η .
Thus the weighted-gap theorem includes nonexponential decay as a natural part of the theory.
A particularly useful alternative is to combine a uniform gap with an integrable perturbation of that gap.
Corollary 3.
Suppose
α ( t ) ≥ α 0 − ν ( t ) , Γ ( t ) ≤ β 0 + ν ( t ) ,
where α 0 > β 0 ≥ 0 , ν ≥ 0 , and ν ∈ L 1 ( 0 , ∞ ) . Then the zero solution is stable under the associated integrable-growth comparison. If, in addition, ν ( t ) → 0 , then after a sufficiently large time the coefficients satisfy a strict uniform gap, and every sufficiently small solution converges exponentially from that time onward.
Proof. 
Since ν ∈ L 1 , the integrable-growth estimate prevents amplification by more than a finite factor. Also, for every ε > 0 the set on which ν is persistently larger than ε cannot have infinite measure without violating integrability. If one strengthens the hypothesis to ν ( t ) → 0 , then for sufficiently large T,
α ( t ) ≥ α 0 − ε , Γ ( t ) ≤ β 0 + ε , t ≥ T .
Choosing ε < ( α 0 − β 0 ) / 2 gives a uniform Halanay gap on [ T , ∞ ) . Thus, under the additional natural condition ν ( t ) → 0 , exponential convergence follows. Without pointwise decay of ν , stability remains valid but the final exponential assertion requires an averaged Halanay theorem. □

6. Perturbations, Forcing, and Robustness

We now return to the full equation (3). The perturbation p ( t , x ) has already been incorporated into the effective damping α ( t ) and the memory coefficient Γ ( t ) . The forcing enters through
q ( t ) = 1 + L J ( t ) sup max { 0 , t − r 0 } ≤ s ≤ t | f ( s ) | .
Thus the same comparison structure yields robustness estimates.
Theorem 5
(Bounded forcing and ultimate boundedness). Assume the hypotheses of Theorem 2 except that f need not vanish. Suppose
sup t ≥ 0 J ( t ) ≤ J 0 , sup t ≥ 0 | f ( t ) | ≤ F .
Let
Q = ( 1 + L J 0 ) F .
Then every solution satisfies
lim sup t → ∞ | x ( t ) | ≤ Q α 0 − β 0 .
In particular, the size of the ultimate bound tends to zero with the forcing amplitude F.
Proof. 
From (15) and the hypotheses of the theorem,
D + | x ( t ) | ≤ − α 0 | x ( t ) | + β 0 M 2 ( t ) + Q .
Set
R * : = Q α 0 − β 0
and define
z ( t ) : = | x ( t ) | − R * + .
We claim that
D + z ( t ) ≤ − α 0 z ( t ) + β 0 sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t z ( s ) .
Indeed, whenever | x ( t ) | > R * , we have
z ( t ) = | x ( t ) | − R * ,
and
M 2 ( t ) ≤ R * + sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t z ( s ) .
Consequently,
D + z ( t ) = D + | x ( t ) | ≤ − α 0 z ( t ) + R * + β 0 R * + sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t z ( s ) + Q = − α 0 z ( t ) + β 0 sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t z ( s ) − ( α 0 − β 0 ) R * + Q = − α 0 z ( t ) + β 0 sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t z ( s ) ,
where the last equality follows from
( α 0 − β 0 ) R * = Q .
At points where | x ( t ) | ≤ R * , the same inequality holds in the upper-Dini sense for the positive part z ( t ) .
Since α 0 > β 0 , the Halanay comparison theorem, with effective delay length 2 r 0 , implies that
z ( t ) ⟶ 0 as t → ∞ .
Therefore
lim sup t → ∞ | x ( t ) | ≤ R * = Q α 0 − β 0 ,
which proves (43). □
Theorem 6
(Vanishing forcing). Under the hypotheses of Theorem 5, if
f ( t ) → 0 ( t → ∞ ) ,
then
x ( t ) → 0 ( t → ∞ ) .
Proof. 
Because f ( t ) → 0 , we also have F 1 ( t ) → 0 and hence q ( t ) → 0 . Given ε > 0 , choose T so large that
q ( t ) ≤ ( α 0 − β 0 ) ε , t ≥ T .
Applying the ultimate-bound argument from time T gives
lim sup t → ∞ | x ( t ) | ≤ ε .
Since ε is arbitrary, x ( t ) → 0 . □
The preceding theorem may also be expressed in a weighted-growth form. This is useful when f is not bounded.
Theorem 7
(Growth under unbounded forcing). Assume (24) and J ( t ) ≤ J 0 . Let w : [ − 2 r 0 , ∞ ) → [ 1 , ∞ ) be locally absolutely continuous and nondecreasing, and suppose
| f ( t ) | ≤ F w ( t ) .
Then there is a constant C > 0 , depending only on α 0 , β 0 , L, J 0 , and r 0 , such that
| x ( t ) | ≤ C ϕ ∞ + F w ( t ) , t ≥ 0 .
provided the weighted Halanay comparison remains in the region where the structural hypotheses hold.
Proof. 
Since w is nondecreasing and
| f ( t ) | ≤ F w ( t ) ,
we have, for s ≤ t ,
| f ( s ) | ≤ F w ( s ) ≤ F w ( t ) .
Hence
F 1 ( t ) ≤ F w ( t ) ,
and therefore
q ( t ) ≤ ( 1 + L J 0 ) F w ( t ) .
Set
Q 0 : = ( 1 + L J 0 ) F
and define
y ( t ) : = | x ( t ) | w ( t ) .
Since w is locally absolutely continuous and nondecreasing, we have w ′ ( t ) ≥ 0 for almost every t ≥ 0 . At every point at which w is differentiable, the quotient rule and the fundamental comparison inequality give
D + y ( t ) ≤ D + | x ( t ) | w ( t ) − | x ( t ) | w ′ ( t ) w 2 ( t ) ≤ − α 0 y ( t ) + β 0 M 2 ( t ) w ( t ) + Q 0 − w ′ ( t ) w ( t ) y ( t ) .
Since w ′ ( t ) ≥ 0 , the last term is nonpositive and may be discarded. Thus
D + y ( t ) ≤ − α 0 y ( t ) + β 0 M 2 ( t ) w ( t ) + Q 0 .
Now, for
s ∈ [ max { − r 0 , t − 2 r 0 } , t ] ,
the monotonicity of w gives w ( s ) ≤ w ( t ) . Consequently,
| x ( s ) | w ( t ) = | x ( s ) | w ( s ) w ( s ) w ( t ) ≤ y ( s ) ,
and hence
M 2 ( t ) w ( t ) ≤ sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t y ( s ) .
Therefore
D + y ( t ) ≤ − α 0 y ( t ) + β 0 sup max { − r 0 , t − 2 r 0 } ≤ s ≤ t y ( s ) + Q 0 .
Thus y satisfies a forced Halanay inequality with effective delay length 2 r 0 and bounded forcing Q 0 .
Since α 0 > β 0 , the bounded-forcing comparison of Theorem 5 yields a uniform bound
y ( t ) ≤ C ϕ ∞ + F , t ≥ 0 ,
for some constant C > 0 depending only on α 0 , β 0 , L , J 0 , and r 0 . Since
| x ( t ) | = w ( t ) y ( t ) ,
we obtain
| x ( t ) | ≤ C ϕ ∞ + F w ( t ) , t ≥ 0 ,
which is (44). □

7. Examples and Comparison with the Fixed-Point Smallness Condition

We now show explicitly that the preceding theory is not merely a reformulation of a contraction argument. The first example is deliberately elementary so that every quantity can be calculated exactly.
Example 1
(A parameter range not covered by Burton’s contraction condition). Consider
x ′ ( t ) = − c ∫ t − r t x ( s ) d s , c > 0 , r > 0 .
Here
a ( t , s ) = c , g ( x ) = x , p = 0 , f = 0 .
Consequently,
B ( t ) = c r , K ( t ) = c r ,
and
J ( t ) = ∫ t − r t c ( t − s ) d s = c r 2 2 .
We may take m = L = 1 . Hence
α 0 = c r
and
β 0 = L J 0 ( L K 0 ) = c r 2 2 ( c r ) = c 2 r 3 2 .
The condition α 0 > β 0 becomes
c r > c 2 r 3 2 ,
or equivalently
c r 2 < 2 .
Therefore Theorem 2 proves exponential asymptotic stability whenever c r 2 < 2 . We next compare this with Burton’s contraction condition. For the convolution kernel a ( v ) = c , where v denotes the lag variable, Burton’s integrated kernel is
A ( t , u ) = ∫ t − u r a ( v ) d v , t − r ≤ u ≤ t .
Since a ( v ) = c , this gives
A ( t , u ) = ∫ t − u r c d v = c ( r − t + u ) .
Notice that 0 ≤ t − u ≤ r whenever t − r ≤ u ≤ t . Consequently,
A ( t , u ) ≥ 0 ,
and hence
∫ t − r t | A ( t , u ) | d u = c ∫ t − r t ( r − t + u ) d u = c r 2 2 .
Therefore Burton’s contraction requirement
2 sup t ≥ 0 ∫ t − r t | A ( t , u ) | d u < 1
reduces to
c r 2 < 1 .
For instance, take r = 1 and c = 3 / 2 . Then
c r 2 = 3 2 .
Burton’s condition fails because 3 / 2 > 1 , whereas our criterion holds because 3 / 2 < 2 . Thus the zero solution is exponentially asymptotically stable by Theorem 2.
It is instructive to compare both sufficient conditions with the exact linear boundary. Seeking a solution x ( t ) = e λ t in (45) gives
λ = − c 1 − e − λ r λ ,
or
λ 2 + c ( 1 − e − λ r ) = 0 .
At a nonzero imaginary crossing λ = i ω , separation of real and imaginary parts yields
− ω 2 + c ( 1 − cos ω r ) = 0 , c sin ω r = 0 .
The first possible crossing has ω r = π , and therefore
c = π 2 2 r 2 , c r 2 = π 2 2 .
Thus Burton’s condition c r 2 < 1 is conservative, the present condition c r 2 < 2 is strictly less conservative, and the exact linear threshold lies still farther away at π 2 / 2 . This comparison also indicates a natural direction for sharpening the Lyapunov estimate.
Example 2
(Variable delay without differentiating the delay). Consider
x ′ ( t ) = − c ∫ t − r ( t ) t x ( s ) d s , 0 < r * ≤ r ( t ) ≤ r 0 ,
where r is continuous but is not assumed differentiable. Then
B ( t ) = c r ( t ) ≥ c r * ,
K ( t ) = c r ( t ) ≤ c r 0 ,
and
J ( t ) = c r 2 ( t ) 2 ≤ c r 0 2 2 .
Corollary 2 gives exponential stability if
c r * > c r 0 2 2 ( c r 0 ) ,
that is,
c r 0 3 < 2 r * .
No derivative r ′ ( t ) occurs in this condition. When r * = r 0 = r , (49) reduces to c r 2 < 2 , as expected.
It is worth noting that the condition
c r 0 3 < 2 r *
becomes increasingly restrictive as r * → 0 + . This reflects the fact that the present uniform-gap criterion uses
B ( t ) = c r ( t ) ≥ c r *
as a uniform lower bound for the instantaneous dissipative contribution. Thus, as r * approaches zero, this lower bound degenerates and the criterion may cease to apply. This should not be interpreted as an instability result when the delay becomes small or vanishes; rather, it indicates a limitation of the uniform dissipation estimate used in this example.
Example 3
(Nonlinear damping and a state perturbation). Consider
x ′ ( t ) = − c ∫ t − r ( t ) t x ( s ) + γ tanh x ( s ) d s + ρ x ( t ) ,
where c > 0 , γ ≥ 0 , and 0 ≤ ρ < ∞ . Let
g ( x ) = x + γ tanh x .
Since
x g ( x ) = x 2 + γ x tanh x ≥ x 2 ,
we may take m = 1 . Also
g ′ ( x ) = 1 + γ sech 2 x ,
so g is globally Lipschitz with L = 1 + γ . If
0 < r * ≤ r ( t ) ≤ r 0 ,
then
B 0 = c r * , K 0 = c r 0 , J 0 = c r 0 2 2 .
Corollary 2 therefore gives global exponential stability whenever
c r * − ρ > ( 1 + γ ) c r 0 2 2 ( 1 + γ ) c r 0 + ρ .
This example illustrates how nonlinear damping, variable delay, and a destabilizing state perturbation can all be handled by the same dissipation-versus-memory inequality.
Example 4
(Vanishing external forcing). Consider
x ′ ( t ) = − c ∫ t − r t x ( s ) d s + F 0 e − σ t , σ > 0 .
If c r 2 < 2 , Theorem 6 yields
x ( t ) → 0 .
If the forcing is replaced by a bounded nonvanishing function f with | f ( t ) | ≤ F , Theorem 5 instead gives an explicit ultimate bound. Thus the same stability mechanism is robust under persistent forcing and recovers convergence when the forcing disappears asymptotically.

8. Discussion and Further Directions

The principal idea of this paper is to replace a uniform contraction requirement by a comparison between instantaneous dissipation and the effective size of the memory remainder. For the variable-delay equation (3), the decomposition
x ′ ( t ) = − B ( t ) g ( x ( t ) ) + R ( t ) + p ( t , x ( t ) ) + f ( t )
identifies the averaged coefficient B ( t ) as the source of damping and the first kernel moment J ( t ) as the quantity governing the error created by replacing past states by the present state. This leads naturally to the criterion
m B ( t ) − ρ ( t ) > L J ( t ) L K ^ ( t ) + ρ ^ ( t ) ,
in a uniform or suitably averaged form.
Several aspects of the theory are worth emphasizing. First, the delay may vary with time, and the proofs do not differentiate r ( t ) . Second, the nonlinear term need not be treated as part of a globally contractive operator. Instead, its sign supplies dissipation through x g ( x ) while its Lipschitz constant enters only in estimating the memory remainder. Third, perturbations and forcing are incorporated directly into the same differential inequality. Finally, the boundedness theorem shows that even when a uniform dissipation gap is unavailable, an integrable growth majorant can prevent solutions from becoming unbounded.
The constant-kernel example demonstrates a genuine gain over the fixed-point smallness condition. Burton’s criterion requires c r 2 < 1 , whereas the present argument gives c r 2 < 2 . Since the exact linear boundary is c r 2 = π 2 / 2 , there remains room for improvement. One possible refinement is to replace the rough estimate
| x ′ ( u ) | ≤ L K ( u ) M 2 ( t )
by an energy estimate retaining cancellation inside the distributed-delay term. Another is to introduce a Lyapunov functional containing a weighted double integral of the form
∫ t − r ( t ) t ∫ s t ω ( t , s , u ) | x ( u ) | 2 d u d s ,
chosen so that part of the memory remainder is absorbed rather than estimated absolutely. Such a refinement may move the sufficient threshold closer to the exact value π 2 / 2 .
A second direction is the extension to systems
x ′ ( t ) = − ∫ t − r ( t ) t A ( t , s ) G ( x ( s ) ) d s + P ( t , x ( t ) ) + F ( t ) , x ( t ) ∈ R n .
If there is a positive definite matrix P and constants m , L > 0 such that
〈 P x , G ( x ) 〉 ≥ m | x | 2 , | G ( x ) − G ( y ) | ≤ L | x − y | ,
then the scalar estimates developed here suggest a matrix-valued analogue based on V ( x ) = x T P x . The kernel mass and first moment would be replaced by appropriate induced matrix norms. This extension should preserve the central dissipation-versus-memory structure.
A third direction is stochastic perturbation. For a stochastic distributed-delay equation, the same deterministic decomposition can be inserted into the infinitesimal generator of a quadratic Lyapunov function. The memory remainder can then be estimated by the same first-moment argument, while the diffusion contributes the usual trace term. This would connect the present deterministic theory with Lyapunov methods for stochastic equations with bounded variable delay.
Finally, the forcing results suggest weighted asymptotic theories in which both coefficients and forcing may be unbounded but controlled relative to a common nondecreasing weight. Such results would replace ordinary boundedness by w-boundedness and ordinary convergence by weighted convergence. The advantage of the present framework is that these extensions can be developed without changing the fundamental decomposition (5).

9. Conclusion

We have developed a Lyapunov and comparison framework for nonlinear distributed-delay equations with bounded variable delay, state perturbations, and external forcing. The method begins by separating the distributed-delay term into an instantaneous dissipative component and a memory remainder. The latter is controlled by the first absolute moment of the kernel, leading to a differential inequality of Halanay type. This yields boundedness under an integrable growth majorant, stability and exponential asymptotic stability under a dissipation-versus-memory gap, ultimate boundedness for bounded forcing, convergence for vanishing forcing, and weighted growth estimates for unbounded forcing.
The approach does not require differentiation of the delay and does not require the full solution operator to be a contraction. The explicit equation
x ′ ( t ) = − c ∫ t − r t x ( s ) d s
shows the distinction clearly: the fixed-point contraction condition requires c r 2 < 1 , whereas the present theorem applies for c r 2 < 2 . The interval 1 ≤ c r 2 < 2 therefore provides a concrete class of equations covered by the Lyapunov/comparison theory but not by that contraction criterion.
The results suggest several further developments, especially sharper Lyapunov functionals, vector systems, stochastic equations, and weighted theories for unbounded perturbations. These directions retain the same central principle: stability should be determined by the balance between dissipation and memory, rather than by smallness of the entire operator.

References

  1. T. A. Burton, Fixed points and stability of a nonconvolution equation, Proceedings of the American Mathematical Society, (132), No. 12. 3679?3687, (2004).
  2. T. A. Burton and W. E. Mahfoud, Stability criteria for Volterra equations, Trans. Amer. Math. Soc. 279 (1983), 143–174.
  3. T. A. Burton, Volterra Integral and Differential Equations, 2nd ed., Mathematics in Science and Engineering, Vol. 202, Elsevier, Amsterdam, 2005.
  4. T. A. Burton and W. E. Mahfoud, Stability criteria for Volterra equations, Trans. Amer. Math. Soc. 279 (1983), 143–174.
  5. J. K. Hale, Theory of Functional Differential Equations, Springer-Verlag, New York, 1977.
  6. N. N. Krasovskii, Stability of Motion, Stanford University Press, Stanford, 1963.
  7. J. J. Levin, The asymptotic behavior of the solution of a Volterra equation, Proc. Amer. Math. Soc. 14 (1963), 534–541.
  8. J. J. Levin, A nonlinear Volterra equation not of convolution type, J. Differential Equations 4 (1968), 176–186.
  9. J. J. Levin and J. A. Nohel, On a nonlinear delay equation, J. Math. Anal. Appl. 8 (1964), 31–44.
  10. T. Yoshizawa, Stability Theory by Liapunov’s Second Method, The Mathematical Society of Japan, Tokyo, 1966.
  11. J. K. Hale and S. M. Verduyn Lunel, Introduction to Functional Differential Equations, Applied Mathematical Sciences, Vol. 99, Springer-Verlag, New York, 1993.
  12. A. Halanay, Differential Equations: Stability, Oscillations, Time Lags, Academic Press, New York, 1966.
  13. V. Kolmanovskii and A. Myshkis, Introduction to the Theory and Applications of Functional Differential Equations, Kluwer Academic Publishers, Dordrecht, 1999.
  14. G. Gripenberg, S.-O. Londen, and O. Staffans, Volterra Integral and Functional Equations, Cambridge University Press, Cambridge, 1990.
  15. E. Liz and S. Trofimchuk, Existence and stability of almost periodic solutions for quasilinear delay systems and the Halanay inequality, J. Math. Anal. Appl. 248 (2000), 625–644.
  16. W. Wang, A generalized Halanay inequality for stability of nonlinear neutral functional differential equations, J. Inequal. Appl. 2010 (2010), Article ID 475019.
  17. H. Li, B. Zhou, M. Hou, and G. Duan, On the time-varying Halanay inequality with applications to stability analysis of time-delay systems, J. Franklin Inst. 358 (2021), 5488–55.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.