1. Introduction
In dynamical systems, the recurrence and attractiveness of solutions remain a central topic. Especially for the discrete dynamical systems, these properties not only reflect the intrinsic dynamical characteristics of systems but also provide theoretical foundations for practical applications such as signal processing and discretized ecological models.
In early studies, Shcherbakov’s comparability principle [
1,
2,
3,
4] provided a unified framework for constructing recurrent solutions of differential equations. Its core idea lies in establishing that if the coefficients of an equation possess certain recurrent features (e.g., almost periodicity), the solutions can inherit these features under appropriate conditions. This methodology was extended and widely applied in differential equations [
5,
6,
7,
8,
9,
10] and stochastic differential equations [
11].
Especially in [
12], by extending Shcherbakov’s principle to uniform spaces, the authors study the recurrence of solutions for stochastic partial differential equations under weaker conditions. This advancement highlights the potential of the comparability method in addressing the complexities of difference equations with nonlinear perturbations, yet its extension and application to difference equations remain underexplored.
This work aims to systematically adapt Shcherbakov’s comparability principle to difference equations, focusing on the recurrence and attractiveness of solutions, thereby bridging theoretical gaps in the recursive analysis of discrete systems. To embed the above results into the architecture of recurrence theory, we regard the discrete semi-dynamical system as a metric -flow and treat the inhomogeneous part g (respectively G) as a recurrent forcing. Shcherbakov’s comparability principle, formerly a continuous-time axiom, is shown to be conservative and complete when translated to the discrete category, parallel to the already known continuous and stochastic entries.
Specifically, we investigate a linear difference equation
and semi-linear difference equation
where the linear operator
A satisfies an exponential stability condition, and the nonlinear term
exhibits specific recurrent behavior (e.g., stationarity, periodicity, quasi-periodicity, Bohr/Levitan almost periodicity, Birkhoff recurrence, almost recurrence, pseudo-periodicity, pseudo-recurrence, and Poisson stability). We prove that under suitable smallness conditions on
, the equation has a unique bounded solution whose recurrent properties align with those of
. Furthermore, such a solution exponentially attracts every other solution of the equation.
2. Preliminaries
Denote
(
) as the set of integers (real numbers) and
(
) as the positive integers (reals). Given a Banach space
, we write
for the space of all sequences
. Equipped with
becomes a complete metric space.
The following two lemmas provide a characterization of the metric d.
Lemma 1. For any ,where is the integer part of the real number . Proof. Let
Obviously,
is nondecreasing and
.
If
, then for every
,
In particular,
.
Conversely, if
, then for
,
and for
,
Thus
. □
Lemma 2. The following are equivalent:
(i) ;
(ii);
(iii) There exists a sequence with such that .
Proof. (i)⇒(ii). Fix
and
. We may assume that
. By the convergence of
, there exists
such that
Specializing to
, we have for every
,
Since
,
for every
. As
is arbitrary, it follows that
Thus, condition (ii) is established.
(ii)⇒(iii). For any
, let
For every
one can pick
so that
Assume
is strictly increasing. If not, redefine
as
to ensure monotonicity.
Define the sequence
as
For any
, choose
such that
. If
, then
for some
. In this case,
Thus,
This establishes condition (iii).
(iii)⇒(i). Assume there exists a sequence
such that
Then for any
, choose
such that
and choose
such that
Let
. For any
, if
, then
If
, by the choice of
, then
, which implies
Thus, for all
,
Taking the supremum over
m, we obtain:
Since
is arbitrary,
, proving (i). □
For
and
, let
, and let
Consider the subset
This is a Banach space under the infinite norm
Remark 1. Let , thenfor any . In the following, we recall the Poisson stable sequences. We refer to [
3,
13,
14] for details.
Definition 1. A sequence is called k-periodic if , and it is stationary if u is a constant sequence.
Definition 2. A sequence is Bohr almost periodic if, for every ,the set of almost periods is relatively dense: some block of consecutive integers contains at least one such k. Definition 3. A sequence is termed positively (negatively) pseudo-periodic if, for every and any integer , there exists an ϵ−almost period k with ( ). The sequence is pseudo-periodic whenever this property holds in both directions.
Definition 4. A sequence is almost recurrent if, for every ,the set of shifts is relatively dense in . Definition 5. A sequence is Lagrange stable whenever the orbit is relatively compact in .
Definition 6. An almost recurrent sequence is termed Birkhoff recurrent provided it is Lagrange stable.
Definition 7. A sequence is termed positively (respectively, negatively) Poisson stable if, for any and any integer , there exists an integer (respectively, ) such that . It is called Poisson stable when this property holds in both directions.
Definition 8. Let be another Banach space. A sequence is Levitan almost periodic if one can find a Bohr almost periodic sequence with the following property: for every , there exists , such that whenever k is a δ-almost period of v.
Definition 9. A Levitan almost periodic sequence is Bohr, almost automorphic, provided it is Lagrange stable.
Definition 10. A sequence is termed quasi-periodic with frequency spectrum if
(i) are rationally independent;
(ii) there is a -periodic continuous function (iii) for all .
Definition 11. A sequence is termed pseudo-recurrent if, for any and any , there exists and, for any , an integer satisfying Finally, we recall the definition of comparability and strong comparability and list several key properties that are crucial for our main results.
Let . Denote (respectively, ) as the set of integer sequences , such that (respectively, converges) in as . We write (respectively, ) for the collection of sequences , such that tends to (respectively, converges) uniformly in as .
Definition 12. Let be another Banach space. A sequence is said to be comparable (respectively, strongly comparable) by character of recurrence with if (respectively, ).
Lemma 3 ([
1]).
The following assertions hold:(i) implies .
(ii) If and v is stationary (respectively, k-periodic, Levitan almost periodic, almost recurrent, Poisson stable), then the same property holds for u.
(iii) If and v is quasi-periodic with frequencies (respectively, Bohr almost periodic, Bohr almost automorphic, Birkhoff recurrent, Lagrange stable), then u shares that property.
(iv) Suppose is strongly comparable with a Lagrange stable . If v is pseudo-periodic (respectively, pseudo-recurrent), then u is as well.
3. Linear Difference Equations
In this section, we prove the existence, uniqueness, and exponential attractiveness of Poisson stable solutions for the linear difference equation
where
A generates an exponentially stable semigroup of operators
acting on
E and
is a Poisson stable sequence. We call
as exponentially stable if there exist constants
, such that
Theorem 1 gives the existence and uniqueness of bounded solutions for Equation (
1), and Theorem 2 gives the exponential attractiveness and Poisson stability.
Theorem 1. Let , and A generate an exponentially stable semigroup of operators , which satisfies (2). Then there exists a unique bounded solution ϕ for Equation (1) given byMoreover,andwhere are positive integers. Proof. We first verify that
given by (
3) is indeed a solution for Equation (
1). In fact, for any
, we have
Thus,
, which implies
solves (
1).
Next, we prove the boundedness of the solution. Observe that
This implies that
Thirdly, we prove the uniqueness of the solution. Suppose
is another bounded solution for Equation (
1). Define
. Then
satisfies the homogeneous equation
Since
is exponentially stable, the only bounded solution to this equation in
is the trivial solution
for all
. Therefore,
for all
, which implies the uniqueness of the solution.
Finally, we prove the solution
given by (
3) satisfies (
5). Let
and
. Then, from (
6) we have
Thus,
□
Theorem 2. Whenever the forcing g is stationary, k-periodic, quasi-periodic, Levitan/Bohr almost periodic, Bohr almost automorphic, Birkhoff recurrent, almost recurrent, and Poisson stable, the unique bounded solution ϕ supplied by (3) inherits the same property. If g is Lagrange stable and pseudo-periodic (respectively, pseudo-recurrent), then ϕ is likewise pseudo-periodic (respectively, pseudo-recurrent). Moreover, ϕ draws all other solutions at an exponential rate. Proof. Firstly, we prove that the unique solution obtained in Theorem 1 is strongly comparable with g, that is . Moreover, .
Let
. Then
in the space
as
for some
, that is, for any integer
,
Since
, it follows from Remark 1 that
. Denote
and
as the unique bounded solution of equations
and
respectively. Define
and
for any
. It can be checked that
and
is the unique bounded solution of equation
Let now
be a sequence of positive integers satisfying
and
as
. According to inequality (
5) we obtain
for every
. Passing to limit in (
7) as
and taking into consideration Lemma 2, we have
for any
, that is,
in
as
. Note that
, thus we have
. That is,
is strongly comparable with
g.
Now, let
. Then, there exists
such that
uniformly in
as
, that is,
As in the first part of this proof, we denote
. Let
and
be the unique bounded solution of equation
and
, respectively, and
. According to inequality (
4) we obtain
Passing the limit in (
8), we obtain
uniformly in
as
. Thus
.
Secondly, it follows from Lemma 3 that if g is stationary, k-periodic, quasi-periodic, Levitan/Bohr almost periodic, Bohr almost automorphic, Birkhoff recurrent, almost recurrent, and Poisson stable, inherits the same property. If g is Lagrange stable and pseudo-periodic (respectively, pseudo-recurrent), then is likewise pseudo-periodic (respectively, pseudo-recurrent).
Finally, we prove the unique bounded solution
given by (
3) exponentially attracts every other solution of Equation (
1). Let
be any solution of Equation (
1) satisfying the initial condition
. Then
Thus,
That is,
exponentially attracts every other solutions. □
4. Semi-Linear Difference Equations
This section investigates Poisson stable solutions and their exponential attractiveness for the semi-linear difference equation
where
A generates an exponentially stable semigroup of operators
on
E and
fulfils:
Hypothesis 1 (H1). for all with some constant .
Hypothesis 2 (H2). for all and , where is independent of n.
Note that conditions (H1) and (H2) are preserved under limits, as stated in the next lemma.
Lemma 4. Whenever G satisfies (H1) and (H2) with constants and L, every translate in the hull inherits the same bounds and L.
Here, we state a lemma that will be invoked in establishing our main results.
Lemma 5. Let , andfor any . Then, (ii) for integers , Proof. (i). Consider the equation
Note that the operator
, defined by
is a contraction since
. Hence, by the Banach contraction principle, there is a unique
with
, given explicitly by
Since
, the comparison principle for contractions implies
. Thus,
(ii). Fix integers
and let
. Splitting the sum at
gives
Thus,
□
Theorem 3. Assume (H1) and (H2) with . Then Equation (9) possesses exactly one bounded solution ξ satisfyingandMoreover, ξ attracts every other solutions of Equation (9) exponentially fast. Proof. Owing to the exponential stability of
, a sequence
solves Equation (
9) if and only if it satisfies
Define an operator
on
as
Hypotheses (H1) and (H2) ensure that
is well-defined.
Let
and
,
Therefore,
Since
,
is a strict contraction, it possesses a unique fixed point
, the desired bounded solution.
Denote
. Introduce in the complete metric space
the operator
as follows.
Let
for
. It follows from (H1) and (H2) that
for any
. According to Theorem 1, the equation
admits a unique solution
. Additionally, it obeys the estimate
From (
11) and (
12) we have
So
. Let
. The above discussion ensures that
is well defined.
We now verify that
is a contraction. Observe that
is the unique bounded solution of
By Theorem 1, we have
From
, it follows that
is a contraction. Consequently,
is the unique solution with
.
Let
be any solution of Equation (
9), and define the error
. Thus,
satisfies
Using the exponential stability of
and the Lipschitz condition of
G, we have
Applying the discrete Grönwall’s inequality, we have
It follows from
that any solution
must converge to
as
with an exponential rate, confirming
exponentially attracts every other solutions. □
Theorem 4. Let (H1) and (H2) hold and . Then the unique bounded solution ξ given by (10) inherits every recurrence property of the forcing G: if G is stationary, k-periodic, Levitan almost periodic, almost recurrent, Poisson stable, quasi-periodic, Bohr almost periodic, Bohr almost automorphic, or Birkhoff recurrent, then so is ξ. Likewise, whenever G is Lagrange stable and pseudo-periodic (resp. pseudo-recurrent), ξ is pseudo-periodic (resp. pseudo-recurrent).
Proof. We first show that
given by (
10) is strongly comparable with
G, that is
. Moreover,
.
Take
. Then, there exists
such that, for every
as
. Consider the equations
and
Since
and
satisfy (H1) and (H2) (see Lemma 4), by Theorem 3, Equation (
15) (respectively, Equation (
16)) yields a unique solution
(respectively,
) with
.
We claim that
uniformly on
. Indeed,
is the unique solution from
of
while
solves
where
for
. Hence
satisfies
where
. In virtu of Theorem 1 we have
Taking into consideration that
and
satisfy (H1) and (H2), and
we have
where
From (
18) and (
19) we obtain
Consequently,
As
, taking limit in (
20), we obtain
as
uniformly in
. Note that
, thus
.
Now, let
. Then, there exists
, such that for any
as
. Similarly, let
and
be the unique bounded solutions of the shift equation
and the limit equation
respectively, and still denote
. To finish the proof, it suffices to show
in
, i.e.,
Since
is the unique bounded solution of Equation (
17),
By (
19) we have
Similar to (
11), we have
for any
, and consequently,
From (
22) and (
23), we obtain
By Lemma 5 we have
Now, let
be a sequence of positive integers satisfying
and
as
. According to (
24) and (
25) we obtain
By Lemma 2 and (
21), passing to limit in (
26) as
we obtain for any
That is,
as
in
. Note that
, thus
, and hence
is strongly comparable with
G. We then complete the proof by Lemma 3. □