Next Article in Journal
Locally Nearly Uniformly Convex Points in Orlicz Spaces Equipped with the Luxemburg Norm
Previous Article in Journal
Color Image Storage and Retrieval via Sliding Mode Control of Quaternion-Valued Neural Networks
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Poisson Stable Solutions and Their Exponential Attractiveness for Difference Equations

Department of Mathematics, Guangdong University of Education, Guangzhou 510303, China
*
Author to whom correspondence should be addressed.
Axioms 2026, 15(1), 73; https://doi.org/10.3390/axioms15010073
Submission received: 22 December 2025 / Revised: 13 January 2026 / Accepted: 18 January 2026 / Published: 20 January 2026
(This article belongs to the Section Mathematical Analysis)

Abstract

We consider the Poisson stable solutions and their exponential attractiveness for the linear difference equation z ( n + 1 ) = A z ( n ) + g ( n ) and semi-linear difference equation z ( n + 1 ) = A z ( n ) + G ( n , z ( n ) ) . Via Shcherbakov’s comparability principle, we show that if the forcing g (respectively, G) has some Poisson stable property, there is precisely one bounded solution that shares the same recurrence character as g ( respectively ,   G ) under appropriate assumptions. Moreover, the unique Poisson stable solution exponentially attracts every other solution.

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 Z -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
z ( n + 1 ) = A z ( n ) + g ( n )
and semi-linear difference equation
z ( n + 1 ) = A z ( n ) + G ( n , z ( n ) ) ,
where the linear operator A satisfies an exponential stability condition, and the nonlinear term g ( respectively ,   G ) 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 g ( respectively ,   G ) , the equation has a unique bounded solution whose recurrent properties align with those of g ( respectively ,   G ) . Furthermore, such a solution exponentially attracts every other solution of the equation.

2. Preliminaries

Denote Z ( R ) as the set of integers (real numbers) and Z + ( R + ) as the positive integers (reals). Given a Banach space ( E , · ) , we write I ( Z , E ) for the space of all sequences u : Z E . Equipped with
d ( u 1 , u 2 ) = sup m Z + min max | l | m u 1 ( l ) u 2 ( l ) , m 1 , u 1 , u 2 I ( Z , E ) ,
I ( Z , E ) becomes a complete metric space.
The following two lemmas provide a characterization of the metric d.
Lemma 1.
For any ϵ > 0 ,
d ( u 1 , u 2 ) < ϵ max | l | [ ϵ 1 ] u 1 ( l ) u 2 ( l ) < ϵ ,
where [ ϵ 1 ] is the integer part of the real number ϵ 1 .
Proof. 
Let
a ( m ) = max | l | m u 1 ( l ) u 2 ( l ) , m 0 = [ ϵ 1 ] .
Obviously, a ( m ) is nondecreasing and m 0 1 ϵ .
If d ( u 1 , u 2 ) < ϵ , then for every m Z + ,
min a ( m ) , m 1 < ϵ .
In particular, a ( m 0 ) < ϵ .
Conversely, if a ( m 0 ) < ϵ , then for m > m 0 ,
min a ( m ) , m 1 m 1 < ϵ
and for m m 0 ,
min a ( m ) , m 1 a ( m ) a ( m 0 ) < ϵ .
Thus d ( u 1 , u 2 ) < ϵ . □
Lemma 2.
The following are equivalent:
(i) lim n d u n , u = 0 ;
(ii) lim n max | l | k u n ( l ) u ( l ) = 0 , k Z + ;
(iii) There exists a sequence { k n } Z + with k n + such that lim n max | l | k n u n ( l ) u ( l ) = 0 .
Proof. 
(i)⇒(ii). Fix k Z + and ϵ > 0 . We may assume that ϵ < 1 / k . By the convergence of d ( u n , u ) , there exists N Z + such that
d ( u n , u ) = sup m Z + min max | l | m u n ( l ) u ( l ) , m 1 < ϵ , n > N .
Specializing to m = k , we have for every n > N ,
min max | l | k u n ( l ) u ( l ) , k 1 < ϵ .
Since ϵ < 1 / k ,
max | l | k u n ( l ) u ( l ) < ϵ .
for every n > N . As ϵ > 0 is arbitrary, it follows that
lim n max | l | k u n ( l ) u ( l ) = 0 , k Z + .
Thus, condition (ii) is established.
(ii)⇒(iii). For any k Z + , let
lim n max | l | k u n ( l ) u ( l ) = 0 .
For every m Z + one can pick N ( m ) Z + so that
max | l | m u n ( l ) u ( l ) < 1 m , n > N ( m ) .
Assume N ( m ) is strictly increasing. If not, redefine N ( m ) as
N ( m ) = max { N ( 1 ) , N ( 2 ) , , N ( m ) } + 1
to ensure monotonicity.
Define the sequence k n as
k n = 1 , n N ( 1 ) , m , N ( m ) < n N ( m + 1 ) .
For any ϵ > 0 , choose M Z + such that 1 / M < ϵ . If n > N ( M ) , then N ( m ) < n N ( m + 1 ) for some m M . In this case,
max | l | k n u n ( l ) u ( l ) = max | l | m u n ( l ) u ( l ) < 1 m 1 M < ϵ .
Thus,
lim n max | l | k n u n ( l ) u ( l ) = 0 .
This establishes condition (iii).
(iii)⇒(i). Assume there exists a sequence k n + such that
max | l | k n u n ( l ) u ( l ) 0 .
Then for any ϵ > 0 , choose N 1 Z + such that
max | l | k n u n ( l ) u ( l ) < ϵ , n > N 1 ,
and choose N 2 Z + such that
k n > 1 / ϵ , n > N 2 ( sin ce k n + ) .
Let N = max { N 1 , N 2 } . For any n > N , if m k n , then
min max | l | m u n ( l ) u ( l ) , m 1 max | l | m u n ( l ) u ( l ) < ϵ .
If m > k n , by the choice of N 2 , then m 1 < ϵ , which implies
min max | l | m u n ( l ) u ( l ) , m 1 m 1 < ϵ .
Thus, for all m Z + ,
min max | l | m u n ( l ) u ( l ) , m 1 < ϵ .
Taking the supremum over m, we obtain:
d ( u n , u ) = sup m Z + min max | l | m u n ( l ) u ( l ) , m 1 ϵ .
Since ϵ > 0 is arbitrary, d ( u n , u ) 0 , proving (i). □
For u I ( Z , E ) and k Z , let u k ( n ) = u ( n + k ) ( n Z ) , and let
H ( u ) = v I ( Z , E ) : v = lim m u k m for some sequence k m Z .
Consider the subset
I ( Z , E ) = { u I ( Z , E ) : u is bounded } .
This is a Banach space under the infinite norm
u = sup { u ( n ) : n Z } .
Remark 1.
Let u I ( Z , E ) , then
v ( n ) u , n Z
for any v H ( u ) .
In the following, we recall the Poisson stable sequences. We refer to [3,13,14] for details.
Definition 1.
A sequence u I ( Z , E ) is called k-periodic ( k Z ) if u k = u , and it is stationary if u is a constant sequence.
Definition 2.
A sequence u I ( Z , E ) is Bohr almost periodic if, for every ϵ > 0 ,
T ( u , ϵ ) = { k Z : u k ( n ) u ( n ) < ϵ , n Z } ,
the set of ϵ almost periods is relatively dense: some block of p = p ( ϵ ) Z + consecutive integers contains at least one such k.
Definition 3.
A sequence u I ( Z , E ) is termed positively (negatively) pseudo-periodic if, for every ϵ > 0 and any integer p > 0 , there exists an ϵ−almost period k with k > p ( k < p ). The sequence is pseudo-periodic whenever this property holds in both directions.
Definition 4.
A sequence u I ( Z , E ) is almost recurrent if, for every ϵ > 0 ,
S ( u , ϵ ) = { k Z : d ( u k , u ) < ϵ }
the set of ϵ shifts is relatively dense in Z .
Definition 5.
A sequence u I ( Z , E ) is Lagrange stable whenever the orbit u k : k Z is relatively compact in I ( Z , E ) .
Definition 6.
An almost recurrent sequence u I ( Z , E ) is termed Birkhoff recurrent provided it is Lagrange stable.
Definition 7.
A sequence u I ( Z , E ) is termed positively (respectively, negatively) Poisson stable if, for any ϵ > 0 and any integer p > 0 , there exists an integer k > p (respectively, k < p ) such that d u k , u < ϵ . It is called Poisson stable when this property holds in both directions.
Definition 8.
Let E 1 be another Banach space. A sequence u I ( Z , E ) is Levitan almost periodic if one can find a Bohr almost periodic sequence v I ( Z , E 1 ) with the following property: for every ϵ > 0 , there exists δ = δ ( ϵ ) > 0 , such that d u k , u < ϵ whenever k is a δ-almost period of v.
Definition 9.
A Levitan almost periodic sequence u I ( Z , E ) is Bohr, almost automorphic, provided it is Lagrange stable.
Definition 10.
A sequence u I ( Z , E ) is termed quasi-periodic with frequency spectrum ω 1 , ω 2 , , ω k if
(i) ω 1 , ω 2 , , ω k are rationally independent;
(ii) there is a 2 π -periodic continuous function Ψ : R k E
Ψ s 1 + 2 π , s 2 + 2 π , , s k + 2 π = Ψ s 1 , s 2 , , s k for all s 1 , s 2 , , s k R k ;
(iii) u ( n ) = Ψ ω 1 n , ω 2 n , , ω k n for all n Z .
Definition 11.
A sequence u I ( Z , E ) is termed pseudo-recurrent if, for any ϵ > 0 and any p R , there exists q p and, for any m Z , an integer k [ p , q ] satisfying
sup | n | 1 / ϵ u k n + m u n + m < ϵ .
Finally, we recall the definition of comparability and strong comparability and list several key properties that are crucial for our main results.
Let u I ( Z , E ) . Denote N u (respectively, M u ) as the set of integer sequences k m , such that u k m u (respectively, u k m converges) in I ( Z , E ) as m . We write N u u (respectively, M u u ) for the collection of sequences k m N u , such that u k m ( n ) tends to u ( n ) (respectively, u k m ( n ) converges) uniformly in n Z as m .
Definition 12.
Let E 1 be another Banach space. A sequence u I ( Z , E ) is said to be comparable (respectively, strongly comparable) by character of recurrence with v I ( Z , E 1 ) if N v N u (respectively, M v M u ).
Lemma 3
([1]). The following assertions hold:
(i) M v M u implies N v N u .
(ii) If N v N u and v is stationary (respectively, k-periodic, Levitan almost periodic, almost recurrent, Poisson stable), then the same property holds for u.
(iii) If M v M u and v is quasi-periodic with frequencies ω 1 , ω 2 , , ω k (respectively, Bohr almost periodic, Bohr almost automorphic, Birkhoff recurrent, Lagrange stable), then u shares that property.
(iv) Suppose u I ( Z , E ) is strongly comparable with a Lagrange stable v I ( Z , Y ) . 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
z ( n + 1 ) = A z ( n ) + g ( n ) ,
where A generates an exponentially stable semigroup of operators { U ( n ) } n Z + acting on E and g I ( Z , E ) is a Poisson stable sequence. We call { U ( n ) } n Z + as exponentially stable if there exist constants c 1 , 0 < λ < 1 , such that
U ( n ) c λ n , n Z + .
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 g I ( Z , E ) , and A generate an exponentially stable semigroup of operators { U ( n ) } n Z + , which satisfies (2). Then there exists a unique bounded solution ϕ for Equation (1) given by
ϕ ( n ) = l = n 1 U ( n 1 l ) g ( l ) .
Moreover,
ϕ c 1 λ g ,
and
max | n | q ϕ ( n ) c λ p q 1 λ g + c 1 λ max | n | p g ( n ) ,
where p > q are positive integers.
Proof. 
We first verify that ϕ given by (3) is indeed a solution for Equation (1). In fact, for any n Z , we have
ϕ ( n + 1 ) = l = n U ( n l ) g ( l ) = l = n 1 U ( n l ) g ( l ) + U ( 0 ) g ( n ) = A l = n 1 U ( n 1 l ) g ( l ) + g ( n ) = A ϕ ( n ) + g ( n ) .
Thus, ϕ ( n + 1 ) = A ϕ ( n ) + g ( n ) , which implies ϕ solves (1).
Next, we prove the boundedness of the solution. Observe that
ϕ ( n ) = l = n 1 U ( n 1 l ) g ( l ) l = n 1 U ( n 1 l ) g ( l ) l = n 1 c λ n 1 l g ( l ) c 1 λ g .
This implies that
ϕ c 1 λ g .
Thirdly, we prove the uniqueness of the solution. Suppose ψ I ( Z , E ) is another bounded solution for Equation (1). Define e ( n ) = ϕ ( n ) ψ ( n ) . Then e ( n ) satisfies the homogeneous equation
z ( n + 1 ) = A z ( n ) .
Since { U ( n ) } n Z + is exponentially stable, the only bounded solution to this equation in I ( Z , E ) is the trivial solution e ( n ) = 0 for all n Z . Therefore, ϕ ( n ) = ψ ( n ) for all n Z , which implies the uniqueness of the solution.
Finally, we prove the solution ϕ given by (3) satisfies (5). Let p > q > 0 ( p , q Z ) , n { q , q + 1 , , q } and g I ( Z , E ) . Then, from (6) we have
ϕ ( n ) l = n 1 c λ n 1 l g ( l ) = l = p 1 c λ n 1 l g ( l ) + l = l n 1 c λ n 1 l g ( l ) c λ p q 1 λ g + c 1 λ max | l | p g ( l ) .
Thus,
max | n | q ϕ ( n ) c λ p q 1 λ g + c 1 λ max | n | p g ( n ) .
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 M g M ϕ . Moreover, M g u M ϕ u .
Let k m M g . Then g k m g ˜ in the space I ( Z , E ) as m for some g ˜ H ( g ) , that is, for any integer q > 0 ,
max | n | q g k m n g ˜ ( n ) 0 as m .
Since g I ( Z , E ) , it follows from Remark 1 that g k m , g ˜ I ( Z , E ) . Denote ϕ m and ϕ ˜ as the unique bounded solution of equations
z ( n + 1 ) = A z ( n ) + g k m ( n )
and
z ( n + 1 ) = A z ( n ) + g ˜ ( n )
respectively. Define
h m ( n ) = g k m ( n ) g ˜ ( n )
and
ψ m ( n ) = ϕ m ( n ) ϕ ˜ ( n )
for any n Z . It can be checked that h m I ( Z , E ) and ψ m is the unique bounded solution of equation
z ( n + 1 ) = A z ( n ) + h m ( n ) .
Let now p m be a sequence of positive integers satisfying p m > q and p m as m . According to inequality (5) we obtain
max | n | q ψ m ( n ) c λ p m q 1 λ h m + c 1 λ max | n | p m h m ( n )
for every m Z + . Passing to limit in (7) as m and taking into consideration Lemma 2, we have
lim m max | n | q ψ m ( n ) = 0
for any q > 0 , that is, ϕ m ϕ ˜ in I ( Z , E ) as m . Note that ϕ m = ϕ k m , thus we have k m M ϕ . That is, ϕ is strongly comparable with g.
Now, let k m M g u . Then, there exists g ˜ H ( g ) such that g k m ( n ) g ˜ ( n ) uniformly in n Z as m , that is,
max n Z g k m ( n ) g ˜ ( n ) 0 as m .
As in the first part of this proof, we denote h m ( n ) = g k m ( n ) g ˜ ( n ) for n Z . Let ϕ m and ϕ ˜ be the unique bounded solution of equation z ( n + 1 ) = A z ( n ) + f k m ( n ) and z ( n + 1 ) = A z ( n ) + g ˜ ( n ) , respectively, and ψ m = ϕ m ϕ ˜ . According to inequality (4) we obtain
ψ m c 1 λ h m .
Passing the limit in (8), we obtain ϕ m ( n ) ϕ ˜ ( n ) uniformly in n Z as m . Thus k m M ϕ u .
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 φ ( n 0 ) = x 0 . Then
φ ( n ) = U ( n n 0 ) x 0 + l = n 0 n 1 U ( n 1 l ) g ( l ) .
Thus,
φ ( n ) ϕ ( n ) = l = n 0 1 U ( n 1 l ) g ( l ) U ( n n 0 ) x 0 l = n 0 1 U ( n 1 l ) g ( l ) + U ( n n 0 ) x 0 c λ n n 0 1 λ g + c λ n n 0 x 0 0 ( with an exponential rate as n )
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
z ( n + 1 ) = A z ( n ) + G ( n , z ( n ) ) ( n Z ) ,
where A generates an exponentially stable semigroup of operators { U ( n ) } n Z + on E and G : Z × E E fulfils:
Hypothesis 1 (H1).
G ( n , 0 ) A 0 for all n Z with some constant A 0 0 .
Hypothesis 2 (H2).
G ( n , e 1 ) G ( n , e 2 ) L e 1 e 2 for all n Z and e 1 , e 2 E , where L 0 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 A 0 and L, every translate G ˜ in the hull H ( G ) = G k : k Z ¯ inherits the same bounds A 0 and L.
Here, we state a lemma that will be invoked in establishing our main results.
Lemma 5.
Let ϕ , g I Z , R + , 0 α < 1 λ , and
ϕ ( n ) l = n 1 λ n 1 l ( α ϕ ( l ) + g ( l ) )
for any n Z . Then,
(i)
ϕ ( n ) l = n 1 ( λ + α ) n 1 l g ( l ) ;
(ii) for integers p > q > 0 ,
max | n | q ϕ ( n ) ( λ + α ) p q 1 λ α sup k Z g ( k ) + 1 1 λ α max | k | p g ( k ) .
Proof. 
(i). Consider the equation
φ ( n ) = l = n 1 λ n 1 l ( α φ ( l ) + g ( l ) ) .
Note that the operator Φ : I ( Z , R ) I ( Z , R ) , defined by
( Φ φ ) ( n ) = l = n 1 λ n 1 l ( α φ ( l ) + g ( l ) ) ,
is a contraction since Φ α 1 λ < 1 . Hence, by the Banach contraction principle, there is a unique φ I Z , R with Φ ( φ ) = φ , given explicitly by
φ ( n ) = l = n 1 ( λ + α ) n 1 l g ( l ) .
Since ϕ ( n ) Φ ϕ ( n ) , the comparison principle for contractions implies ϕ ( n ) φ ( n ) . Thus,
ϕ ( n ) l = n 1 ( λ + α ) n 1 l g ( l ) .
(ii). Fix integers p > q > 0 and let | n | q . Splitting the sum at p gives
ϕ ( n ) l = p 1 ( λ + α ) n 1 l g ( l ) + l = p n 1 ( λ + α ) n 1 l g ( l ) ( λ + α ) p q 1 λ α sup l Z g ( l ) + 1 1 λ α max | l | p g ( l ) .
Thus,
max | n | q ϕ ( n ) ( λ + α ) p q 1 λ α sup k Z g ( k ) + 1 1 λ α max | k | p g ( k ) .
Theorem 3.
Assume (H1) and (H2) with L < 1 λ c . Then Equation (9) possesses exactly one bounded solution ξ satisfying
ξ ( n ) = l = n 1 U ( n 1 l ) G ( l , ξ ( l ) ) ,
and
ξ r : = c A 0 1 λ c L .
Moreover, ξ attracts every other solutions of Equation (9) exponentially fast.
Proof. 
Owing to the exponential stability of { U ( n ) } , a sequence ξ I ( Z , E ) solves Equation (9) if and only if it satisfies
ξ ( n ) = l = n 1 U ( n 1 l ) G ( l , ξ ( l ) ) .
Define an operator S on I ( Z , E ) as
( S ξ ) ( n ) = l = n 1 U ( n 1 l ) G l , ξ ( l ) .
Hypotheses (H1) and (H2) ensure that S is well-defined.
Let ξ 1 , ξ 2 I ( Z , E ) and n Z ,
( S ξ 1 ) ( n ) ( S ξ 2 ) ( n ) = l = n 1 U ( n 1 l ) ( G l , ξ 1 ( l ) G l , ξ 2 ( l ) ) l = n 1 c λ n 1 l L ξ 1 ( l ) ξ 2 ( l ) c L 1 λ sup l Z ξ 1 ( l ) ξ 2 ( l ) .
Therefore,
sup n Z ( S ξ 1 ) ( n ) ( S ξ 2 ) ( n ) c L 1 λ sup n Z ξ 1 ( n ) ξ 2 ( n ) .
Since c L 1 λ < 1 , S is a strict contraction, it possesses a unique fixed point ξ I ( Z , E ) , the desired bounded solution.
Denote B ¯ ( 0 ; r ) : = { e E : e r } . Introduce in the complete metric space I ( Z , B ¯ ( 0 ; r ) ) the operator
T : I ( Z , B ¯ ( 0 ; r ) ) I ( Z , B ¯ ( 0 ; r ) )
as follows.
Let g ( n ) = G ( n , u ( n ) ) for u I ( Z , B ¯ ( 0 ; r ) ) . It follows from (H1) and (H2) that
g ( n ) = G ( n , ξ ( n ) ) G ( n , 0 ) + L u ( n ) A 0 + L r
for any n Z . According to Theorem 1, the equation
z ( n + 1 ) = A z ( n ) + g ( n ) , n Z
admits a unique solution v I ( Z , E ) . Additionally, it obeys the estimate
v c 1 λ g .
From (11) and (12) we have
v c 1 λ A 0 + L r = r .
So v l ( Z , B ¯ ( 0 ; r ) ) . Let T ( u ) = v . The above discussion ensures that T is well defined.
We now verify that T is a contraction. Observe that v 1 v 2 = T u 1 T u 2 is the unique bounded solution of
z ( n + 1 ) = A z ( n ) + G ( n , u 1 ( n ) ) G ( n , u 2 ( n ) ) , n Z .
By Theorem 1, we have
T u 1 T u 2 c 1 λ sup n Z G n , u 1 ( n ) G n , u 2 ( n ) c L 1 λ u 1 u 2 .
From c L 1 λ < 1 , it follows that T is a contraction. Consequently, ξ is the unique solution with ξ r .
Let η ( n ) be any solution of Equation (9), and define the error e ( n ) = η ( n ) ξ ( n ) . Thus, e ( n ) satisfies
e ( n + 1 ) = A e ( n ) + [ G ( n , η ( n ) ) G ( n , ξ ( n ) ) ] .
Using the exponential stability of { U ( n ) } and the Lipschitz condition of G, we have
e ( n ) c λ n m e ( m ) + c L k = m n 1 λ n 1 k e ( k ) .
Applying the discrete Grönwall’s inequality, we have
e ( n ) ( c L + λ ) n m e ( m ) .
It follows from c L + λ < 1 that any solution η ( n ) must converge to ξ ( n ) as n with an exponential rate, confirming ξ exponentially attracts every other solutions. □
Theorem 4.
Let (H1) and (H2) hold and L < 1 λ c . 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 M G M ξ . Moreover, M G u M ξ u .
Take k m M G u . Then, there exists G ˜ H ( G ) such that, for every R > 0
sup n Z , e R G ( n + k m , e ) G ˜ ( n , e ) 0
as m . Consider the equations
z ( n + 1 ) = A z ( n ) + G k m ( n , z ( n ) ) , ( m Z + )
and
z ( n + 1 ) = A z ( n ) + G ˜ ( n , z ( n ) ) .
Since G k m ( m Z + ) and G ˜ satisfy (H1) and (H2) (see Lemma 4), by Theorem 3, Equation (15) (respectively, Equation (16)) yields a unique solution ξ m I ( Z , B ¯ ( 0 ; r ) ) (respectively, ξ ˜ I ( Z , B ¯ ( 0 ; r ) ) ) with r = c A 0 1 λ c L .
We claim that ξ m ξ ˜ uniformly on Z . Indeed, ξ m is the unique solution from I ( Z , B ¯ ( 0 ; r ) ) of
z ( n + 1 ) = A z ( n ) + h m ( n ) , h m ( n ) = G k m n , ξ m ( n )
while ξ ˜ I ( Z , B ¯ ( 0 ; r ) ) solves
z ( n + 1 ) = A z ( n ) + h ˜ ( n ) ,
where h ˜ ( n ) = G ˜ ( n , ξ ˜ ( n ) ) for n Z . Hence v m = ξ m ξ ˜ I ( Z , B ( 0 ; 2 r ) ) satisfies
z ( n + 1 ) = A z ( n ) + h m ( n ) h ˜ ( n ) ,
where h m h ˜ I ( Z , E ) . In virtu of Theorem 1 we have
v m C 1 λ h m h ˜ .
Taking into consideration that G k m and G ˜ satisfy (H1) and (H2), and ξ m , ξ ˜ l ( Z , B ¯ ( 0 ; r ) ) we have
h m ( n ) h ˜ ( n ) = G k m n , ξ m ( n ) G k m ( n , ξ ˜ ( n ) ) + G k m ( n , ξ ˜ ( n ) ) G ˜ ( n , ξ ˜ ( n ) ) G k m n , ξ m ( n ) G k m ( n , ξ ˜ ( n ) ) + G k m ( n , ξ ˜ ( n ) ) G ˜ ( n , ξ ˜ ( n ) ) L ξ m ( n ) ξ ˜ ( n ) + sup n Z G k m ( n , ξ ˜ ( n ) ) G ˜ ( n , ξ ˜ ( n ) ) L v m + sup n Z a m , n ,
where
a m , n = G k m ( n , ξ ˜ ( n ) ) G ˜ ( n , ξ ˜ ( n ) ) .
From (18) and (19) we obtain
v m c 1 λ L v m + sup n Z a m , n .
Consequently,
1 c L 1 λ v m c 1 λ sup n Z a m , n .
As c L 1 λ < 1 , taking limit in (20), we obtain ξ m ( n ) ξ ˜ ( n ) as m uniformly in n Z . Note that ξ m = ξ k m , thus k m M ξ u .
Now, let k m M G . Then, there exists G ˜ H ( G ) , such that for any l , R > 0
sup | n | l , e R G ( n + k m , e ) G ˜ ( n , e ) 0
as m . Similarly, let ξ m and ξ ˜ be the unique bounded solutions of the shift equation
z ( n + 1 ) = A z ( n ) + h m ( n ) ,
and the limit equation
z ( n + 1 ) = A z ( n ) + h ˜ ( n ) ,
respectively, and still denote v m = ξ m ξ ˜ . To finish the proof, it suffices to show v m 0 in I ( Z , E ) , i.e.,
lim m max | n | L v m ( n ) = 0 for any L > 0 .
Since v m is the unique bounded solution of Equation (17),
v m ( n ) C i = n 1 λ n 1 i h m ( i ) h ˜ ( i ) .
By (19) we have
h m ( n ) h ˜ ( n ) L v m ( n ) + a m , n .
Similar to (11), we have
h m ( n ) h ˜ ( n ) = G k m n , ξ m ( n ) G ˜ ( n , ξ ˜ ( n ) ) G k m n , ξ m ( n ) + G ˜ ( n , ξ ˜ ( n ) ) 2 ( A 0 + L r )
for any n Z , and consequently,
h m h ˜ 2 ( A 0 + L r ) .
From (22) and (23), we obtain
v m ( n ) i = n 1 c L λ n 1 i v m ( i ) + i = n 1 c λ n 1 i a m , i .
By Lemma 5 we have
max | n | L v m ( n ) ( λ + c L ) l L 1 λ c L sup n Z a m , n + c 1 λ c L max | n | l a m , n .
Now, let l m be a sequence of positive integers satisfying l m > L and l m + as m . According to (24) and (25) we obtain
max | n | L v m ( n ) 2 ( λ + c L ) l m L 1 λ c L ( A 0 + L r ) + c 1 λ c L max | n | l m a m , n .
By Lemma 2 and (21), passing to limit in (26) as m we obtain for any L > 0
lim m max | n | L v m ( n ) = 0 .
That is, ξ m ξ ˜ as m in I ( Z , E ) . Note that ξ m = ξ k m , thus k m M ξ , and hence ξ is strongly comparable with G. We then complete the proof by Lemma 3. □

5. Applications

In this section, two examples, as well as their numerical simulations, are provided to illustrate our results.
Example 1.
The discrete Keynesian cross economic model was widely studied in [15,16,17]. This model with lagged income is given by
D ( n ) = C ( n ) + I ( n 1 ) + G ( n 1 ) C ( n ) = c x ( n ) x ( n + 1 ) = δ D ( n + 1 ) + ( 1 δ ) x ( n ) ,
where c 0 is a constant, D ( n ) is aggregate demand, x ( n ) is aggregate income, C ( n ) is aggregate consumption, I ( n ) is aggregate investment, G ( n ) is government spending, and δ < 1 is speed of adjustment term. Let δ c 1 , then one can obtain the implicit form of the model as
x ( n + 1 ) = 1 δ 1 δ c x ( n ) + δ 1 δ c ( I ( n ) + G ( n ) ) .
Set
A = 1 δ 1 δ c , f ( n ) = δ 1 δ c ( I ( n ) + G ( n ) ) .
Let δ > 0 , c < 1 , I ( n ) and G ( n ) be jointly quasi-periodic sequences. Then A ( 0 , 1 ) satisfies the exponentially stability condition, and f ( n ) = δ 1 δ c ( I ( n ) + G ( n ) ) is quasi-periodic. It follows from Theorem 1 that system (27) admits a unique bounded solution which is given by
x ( n ) = i = n 1 ( 1 δ 1 δ c ) n 1 i δ 1 δ c ( I ( i ) + G ( i ) ) .
Moreover, by Theorem 2, this unique bounded solution is quasi-periodic and exponentially attracts any other solutions of Equation (27).
We perform numerical calculations via matlab for the case δ = 3 5 , c = 2 3 and I ( n ) + G ( n ) = sin n (Figure 1a).
Example 2.
The following biological system models a single artificial effective neuron by dissipation and has been widely studied in [18,19,20]. The model is given by
x ( n + 1 ) = a x ( n ) + b ( n ) tanh ( x ( n ) ) + c ( n ) , n Z .
Set
A = a , F ( n , x ) = b ( n ) tanh ( x ( n ) ) + c ( n ) .
Let a ( 0 , 1 ) , b ( n ) and c ( n ) be jointly Bohr almost periodic sequences with | b ( n ) | < 1 a for all n Z . Then, the system (28) can be written as a discrete system of the form (9). It follows from Theorem 3 that the Equation (28) admits a unique bounded solution given by
x ( n + 1 ) = i = n 1 a n 1 i ( b ( i ) tanh x ( i ) + c ( i ) ) ,
which exponentially attracts every other solution of Equation (28). Furthermore, by Theorem 4, the unique bounded solution is Bohr almost periodic.
We perform numerical calculations via matlab for the case a = 1 2 , b ( n ) = sin n 4 , c ( n ) = cos n (Figure 1b).
Figure 1. (a) The numerical calculation for the case δ = 3 5 , c = 2 3 and I ( n ) + G ( n ) = sin n ; (b) The numerical calculation for the case a = 1 2 , b ( n ) = sin n 4 , c ( n ) = cos n .
Figure 1. (a) The numerical calculation for the case δ = 3 5 , c = 2 3 and I ( n ) + G ( n ) = sin n ; (b) The numerical calculation for the case a = 1 2 , b ( n ) = sin n 4 , c ( n ) = cos n .
Axioms 15 00073 g001

Author Contributions

Methodology, H.X., J.C., and B.H.; validation, J.C. and B.H.; writing—original draft preparation, H.X.; writing—review and editing, H.X. and J.C. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Key Research Platforms and Projects of Universities in Guangdong Province-Special Projects in Key Fields grant number 2023ZDZX4042 and the Key Construction Discipline Scientific Research Ability Promotion Project of Guangdong Province grant number 2021ZDJS055.

Data Availability Statement

The original contributions presented in this study are included in the article. Further inquiries can be directed to the corresponding author.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Shcherbakov, B.A. Topologic Dynamics and Poisson Stability of Solutions of Differential Equations; Shtiintsa: Kishinev, Moldova, 1972. [Google Scholar]
  2. Shcherbakov, B.A. The comparability of the motions of dynamical systems with regard to the nature of their recurrence. Differ. Equ. 1975, 11, 1246–1255. [Google Scholar]
  3. Shcherbakov, B.A. Poisson Stability of Motions of Dynamical Systems and Solutions of Differential Equations; Stiinta: Chisinau, Moldova, 1985. [Google Scholar]
  4. Shcherbakov, B.A.; Cheban, D. Asymptotically Poisson stable motions of dynamical systems and comparability of their reccurence in limit. Differ. Equ. 1977, 13, 898–906. [Google Scholar]
  5. Caraballo, T.; Cheban, D. Almost periodic and almost automorphic solutions of linear differential/difference equations without Favard’s separation condition. I. J. Differ. Equ. 2009, 246, 108–128. [Google Scholar] [CrossRef]
  6. Caraballo, T.; Cheban, D. Almost periodic and almost automorphic solutions of linear differential/difference equations without Favard’s separation condition. II. J. Differ. Equ. 2009, 246, 1164–1186. [Google Scholar] [CrossRef][Green Version]
  7. Caraballo, T.; Cheban, D. Levitan/Bohr almost periodic and almost automorphic solutions of second order monotone differential equations. J. Differ. Equ. 2011, 251, 708–727. [Google Scholar] [CrossRef]
  8. Caraballo, T.; Cheban, D. Almost periodic and almost automorphic solutions of linear differential equations. Dyn. Syst. 2010, 33, 1857–1882. [Google Scholar] [CrossRef]
  9. Cheban, D. Levitan almost periodic and almost automorphic solutions of V-monotone differential equations. J. Dyn. Differ. Equ. 2008, 20, 669–697. [Google Scholar] [CrossRef]
  10. Cheban, D.; Schmalfuss, B. Invariant manifolds, global attractors, almost automorphic and almost periodic solutions of non-autonomous differential equations. J. Math. Anal. Appl. 2008, 340, 374–393. [Google Scholar] [CrossRef][Green Version]
  11. Cheban, D.; Liu, Z. Periodic, quasi-periodic, almost periodic, almost automorphic, Birkhoff recurrent and Poisson stable solutions for stochastic differential equations. J. Differ. Equ. 2020, 269, 3652–3685. [Google Scholar] [CrossRef]
  12. Cheban, D.; Liu, Z. The comparability of motions in dynamical systems and recurrent solutions of (S)PDEs. Bul. Acad. Ştiinţe Republicii Mold. Mat. 2024, 104, 53–83. [Google Scholar] [CrossRef]
  13. Sell, G.R. Lectures on Topological Dynamics and Differential Equations; Van Nostrand Reinhold Company: London, UK, 1971. [Google Scholar]
  14. Sibirsky, K.S. Introduction to Topological Dynamics; Springer: Berlin/Heidelberg, Germany, 1975. [Google Scholar]
  15. Ferguson, B.; Lim, G. Discrete Time Dynamic Economic Models: Theory and Empirical Applications; Routledge: Oxfordshire, UK, 2003. [Google Scholar]
  16. Lizama, C.; Mesquita, J. Almost automorphic solutions of dynamic equations on time scales. J. Funct. Anal. 2013, 265, 2267–2311. [Google Scholar] [CrossRef]
  17. Tisdell, C.; Zaidi, A. Basic qualitative and quantitative results for solutions to nonlinear, dynamic equations on time scales with an application to economic modelling. Nonlinear Anal. Theory Methods Appl. 2008, 68, 3504–3524. [Google Scholar] [CrossRef]
  18. Fan, M.; Ye, D. Convergence dynamics and pseudo almost periodicity of a class of nonautonomous RFDEs with applications. J. Math. Anal. Appl. 2005, 309, 598–625. [Google Scholar] [CrossRef]
  19. Gopalsamy, K.; Sariyasa, S. Time delays and stimulus dependent pattern formation in periodic environments in isolated neurons-II. Dyn. Contin. Discret. Impuls. Syst. Ser. B 2002, 9, 39–58. [Google Scholar]
  20. Zhang, J.; Fan, M. Boundedness and stability of semi-linear dynamic equations on time scales. Prog. Qual. Anal. Funct. Equ. 2012, 1786, 45–56. [Google Scholar]
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.

Share and Cite

MDPI and ACS Style

Xiao, H.; Cao, J.; He, B. Poisson Stable Solutions and Their Exponential Attractiveness for Difference Equations. Axioms 2026, 15, 73. https://doi.org/10.3390/axioms15010073

AMA Style

Xiao H, Cao J, He B. Poisson Stable Solutions and Their Exponential Attractiveness for Difference Equations. Axioms. 2026; 15(1):73. https://doi.org/10.3390/axioms15010073

Chicago/Turabian Style

Xiao, Huasong, Junfei Cao, and Bing He. 2026. "Poisson Stable Solutions and Their Exponential Attractiveness for Difference Equations" Axioms 15, no. 1: 73. https://doi.org/10.3390/axioms15010073

APA Style

Xiao, H., Cao, J., & He, B. (2026). Poisson Stable Solutions and Their Exponential Attractiveness for Difference Equations. Axioms, 15(1), 73. https://doi.org/10.3390/axioms15010073

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop