• Nem Talált Eredményt

Admissibility and general dichotomies for evolution families

N/A
N/A
Protected

Academic year: 2022

Ossza meg "Admissibility and general dichotomies for evolution families"

Copied!
19
0
0

Teljes szövegt

(1)

Admissibility and general dichotomies for evolution families

Davor Dragiˇcevi´c

B1

, Nevena Jurˇcevi´c Peˇcek

1

and Nicolae Lupa

2

1Department of Mathematics, University of Rijeka, Radmile Matejˇci´c 2, Rijeka, 51000, Croatia

2Department of Mathematics, Politehnica University of Timis,oara, Piat,a Victoriei 2, Timis,oara, 300006, Romania

Received 9 March 2020, appeared 21 October 2020 Communicated by Christian Pötzsche

Abstract. For an arbitrary noninvertible evolution family on the half-line and for ρ: [0,) → [0,) in a large class of rate functions, we consider the notion of a ρ- dichotomy with respect to a family of norms and characterize it in terms of two ad- missibility conditions. In particular, our results are applicable to exponential as well as polynomial dichotomies with respect to a family of norms. As a nontrivial application of our work, we establish the robustness of general nonuniform dichotomies.

Keywords: admissibility, dichotomies with growth rates, robustness.

2020 Mathematics Subject Classification: 34D09.

1 Introduction

Among many methods used to study the asymptotic behavior of nonautonomous systems, one of the most famous is the so-called admissibility method. This line of research in the context of differential equations has a long history that goes back to the pioneering work of Perron [26]. The main idea of Perron’s work was to characterize the asymptotic properties of the linear differential equation

x˙(t) =A(t)x(t), t∈J, in terms of the (unique) solvability inO(J,X)of the equation

˙

x(t) = A(t)x(t) + f(t), t ∈J,

for each test function f ∈ I(J,X), where J ∈ {[0,∞),R}. Here X is a Banach space, while I(J,X) – the input-space and O(J,X) – the output space are suitably constructed function spaces. The milestones of this theory were grounded in the sixtieth in the remarkable works of Massera and Schäffer [18–20] and respectively in the seventies in the outstanding monographs of Coppel [10] and Daleck˘ıi and Kre˘ın [11].

BCorresponding author. Email: ddragicevic@math.uniri.hr

(2)

Since then various authors obtained valuable contributions to this line of the research.

For the results dealing with characterizations of uniform exponential behavior in terms of appropriate admissibility properties, we refer to the works of Huy [15], Latushkin, Randolph and Schnaubelt [16], Van Minh, Räbiger and Schnaubelt [22], Van Minh and Huy [23], Preda, Pogan and Preda [28,29] as well as Sasu and Sasu [31–35]. For contributions dealing with various concepts of nonuniform exponential behavior, we refer to [4,5,17,21,27,30,36] and references therein. For a detailed description of this line of the research, we refer to [6].

We point out that all the above works deal withexponential behavior. Although this type of behavior has a somewhat privileged role due to its connections with the hyperbolic smooth dynamics, it is certainly not the only type of behavior that appears in the qualitative study of nonautonomous differential equations. To the best of our knowledge, the study of di- chotomies with not necessarily exponential rates of expansion and contraction was initiated by Muldowney [24] and Naulin and Pinto [25]. More recently, in the context of nonuniform asymptotic behavior such dichotomies have been studied by Barreira and Valls [1,3] and Bento and Silva [8,9]. A special emphasis was devoted to the so-called polynomial dichotomies [2,7].

A complete characterization of polynomial dichotomies in terms of admissibility for evolution families was obtained by Dragiˇcevi´c [12] (see also [13] for related results in the case of discrete time) by building on the work of Hai [14], who considered polynomial stability.

The main objective of the present paper is to obtain similar results to that in [12] but for a much wider class of dichotomies. More precisely, for a large class of rate functions ρ: [0,∞) → [0,∞), we introduce the notion of a ρ-dichotomy with respect to a family of norms. We then obtain a complete characterization of this concept in terms of appropriate admissibility conditions. We point out that our results are new even in the particular case of uniformρ-dichotomies. Indeed, although the proofs use the somewhat standard techniques, the major task accomplished in the present paper was to formulate appropriate admissibility conditions for the general dichotomies we study. In addition, the obtained results are new even for the class of polynomial dichotomies since in comparison to [12], we do not require that our evolution family exhibits polynomial bounded growth property. Consequently, we need to impose two admissibility conditions (rather than just one as in [12]) to characterize polynomial dichotomies. We stress that in the present paper we also use different admissibility spaces from those in [12].

The paper is organized as follows. In Section2 we introduce the class of dichotomies we study as well as input and output spaces we are going to use. In Section3, we show that the existence ofρ-dichotomies yields two types of admissibility properties. Then, in Section4we obtain a converse result by showing that those admissibility properties imply the existence of aρ-dichotomy. Finally, in Section 5 we apply those results to establish the robustness of ρ-dichotomies.

2 Preliminaries

2.1 Generalized dichotomies

Let X = (X,k·k) be an arbitrary Banach space and let B(X) be the Banach algebra of all bounded linear operators onX. A family T = {T(t,s)}ts0 of operators in B(X)is said to be anevolution familyonXif the following properties hold:

• T(t,t) =Id, fort≥0;

(3)

• T(t,s)T(s,τ) =T(t,τ), fort ≥s≥τ≥0;

• for all s ≥ 0 and x ∈ X the mapping t 7→ T(t,s)x is continuous on [s,∞) and the mappingt7→ T(s,t)x is continuous on[0,s].

In this paper we always assume thatT = {T(t,s)}ts0 is an evolution family on X and letρ: [0,∞)→[0,∞)be a strictly increasing function of classC1such that

ρ(0) =0 and lim

tρ(t) =∞.

In particular, observe that ρ is bijective. Furthermore, assume that {k·kt}t0 is a family of norms onXsuch that:

• there existC>0 andε≥0 with

kxk ≤ kxkt ≤Ceερ(t)kxk, forx ∈Xandt≥0; (2.1)

• the mappingt 7→ kxkt is continuous for eachx ∈X.

We say that the evolution family T admits a ρ-dichotomy with respect to the family of normsk·kt,t≥0, if there exists a family{P(t)}t0 of projections onXsatisfying

T(t,s)P(s) =P(t)T(t,s), fort≥s ≥0, (2.2) such that

T(t,s)|KerP(s): KerP(s)→KerP(t)is invertible for all t≥s ≥0, (2.3) and there exist constantsλ,D>0 such that:

• forx ∈Xandt≥ s≥0,

kT(t,s)P(s)xkt≤ Deλ(ρ(t)−ρ(s))kxks; (2.4)

• forx ∈Xand 0≤t≤ s,

kT(t,s)(Id−P(s))xkt ≤ Deλ(ρ(s)−ρ(t))kxks, (2.5) where

T(t,s):=

T(s,t)|KerP(t) 1

: KerP(s)→KerP(t), for 0≤t≤ s.

In the following we recall the concept ofρ-nonuniform exponential dichotomy for evolution families (see [1,3]) and establish its connection with the notion ofρ-dichotomy with respect to a family of norms. An evolution familyT is said to admit aρ-nonuniform exponential dichotomy if there exists a family {P(t)}t0of projections on X satisfying (2.2) and (2.3), and there exist constantsλ,D>0 andε≥0 such that

kT(t,s)P(s)k ≤Deλ(ρ(t)−ρ(s))+ερ(s), fort≥ s≥0, (2.6) and

kT(t,s)(Id−P(s))k ≤Deλ(ρ(s)−ρ(t))+ερ(s), for 0≤ t≤s. (2.7)

(4)

The concept ofρ-nonuniform exponential dichotomy includes as a special case the usual exponential behaviorwhenρ(t) = t. Also, forρ(t) =ln(t+1)we obtain the concept ofnonuni- form polynomial dichotomyintroduced independently by Barreira and Valls [2] and Bento and Silva [7], and more general for ρ(t) = Rt

0 µ(t)dt, where µ : [0,∞) → (0,∞) is a continuous function such that limtRt

0µ(t)dt= ∞, we obtain the nonuniform version of thegeneralized dichotomyin the sense of Muldowney [24].

Proposition 2.1. The following statements are equivalent:

1. T admits aρ-nonuniform exponential dichotomy;

2. T admits a ρ-dichotomy with respect to a family of normsk · kt, t ≥ 0 such that t 7→ kxkt is continuous for each x∈X.

Proof. Assume that T admits a ρ-nonuniform exponential dichotomy. For t ≥ 0 and x ∈ X, set

kxkt =sup

τt

eλ(ρ(τ)−ρ(t))kT(τ,t)P(t)xk+ sup

τ∈[0,t]

eλ(ρ(t)−ρ(τ))kT(τ,t)(Id−P(t))xk.

A simple computation shows that (2.1) holds for C = 2D. Moreover, by repeating the argu- ments in the proof of [6, Proposition 5.6], one can show thatt 7→ kxkt is continuous for each x∈ X. Furthermore, fort ≥s≥0 andx ∈Xwe have

kT(t,s)P(s)xkt =sup

τt

eλ(ρ(τ)−ρ(t))kT(τ,s)P(s)xk

=sup

τt

eλ(ρ(t)−ρ(s))eλ(ρ(τ)−ρ(s))kT(τ,s)P(s)xk

≤eλ(ρ(t)−ρ(s))sup

τs

eλ(ρ(τ)−ρ(s))kT(τ,s)P(s)xk

≤eλ(ρ(t)−ρ(s))kxks,

and thus (2.4) holds. Similarly, one can prove (2.5). Hence, the evolution familyT admits a ρ-dichotomy with respect to the family of norms k · kt,t≥0, defined above.

Conversely, assume that T admits a ρ-dichotomy with respect to a family of normsk · kt onXsatisfying (2.1) for someC>0 andε≥0. Fort ≥s≥0 andx ∈Xwe have

kT(t,s)P(s)xk ≤ kT(t,s)P(s)xkt

≤Deλ(ρ(t)−ρ(s))kxks

≤DCeερ(s)eλ(ρ(t)−ρ(s))kxk,

and thus (2.6) holds. Similarly, one can show (2.7). Therefore, the evolution familyT admits aρ-nonuniform exponential dichotomy.

2.2 Admissible spaces

LetY1 be the space of all Bochner measurable functionsx: [0,∞)→X such that kxk1:=

Z

0

kx(t)ktdt<∞,

(5)

identifying functions that are equal Lebesque-almost everywhere. It is easy to show that (Y1,k·k1) is a Banach space (see [4, Theorem 1]). Moreover, consider the space Y of all continuous functions x: [0,∞)→ Xsuch that

kxk :=sup

t0

kx(t)kt <∞.

One can easily prove that (Y,k·k)is a Banach space. For a closed subspace Z ⊂ X, YZ is the space of allx∈Ysuch thatx(0)∈Z. Obviously,YZis a closed subspace ofY, therefore it is also a Banach space.

We consider another Banach function space(Y0 ,k·k0), which consists of all Bochner mea- surable functions x: [0,∞)→Xsuch that

kxk0 :=ess sup

t0

kx(t)kt <∞,

where ess sup is taken with respect to the Lebesgue measure on[0,∞).

3 From dichotomy to admissibility

In this section we show that the existence of aρ-dichotomy with respect to a family of norms for an evolution family T = {T(t,s)}ts0 yields the admissibility of the pairs YZ,Y1

, YZ,Y0

for a certain closed subspace Z⊂X.

Proposition 3.1. Assume that the evolution family T admits aρ-dichotomy with respect to a family of normsk·kt, t ≥0, and set Z= KerP(0). Then, for each y∈Y1there exists a unique x ∈YZsuch that

x(t) =T(t,s)x(s) +

Z t

s T(t,τ)y(τ)dτ, for t≥s ≥0. (3.1) Proof. Take an arbitraryy∈Y1. For t≥0, set

x(t) =

Z t

0 T(t,s)P(s)y(s)ds−

Z

t T(t,s)(Id−P(s))y(s)ds.

It follows from (2.4) and (2.5) that kx(t)kt

Z t

0

kT(t,s)P(s)y(s)ktds+

Z

t

kT(t,s)(Id−P(s))y(s)ktds

≤D Z t

0 eλ(ρ(t)−ρ(s))ky(s)ksds+D Z

t eλ(ρ(s)−ρ(t))ky(s)ksds

≤D Z t

0

ky(s)ksds+D Z

t

ky(s)ksds=Dkyk1,

for every t ≥ 0, and thus x ∈ Y. On the other hand, it is easy to check that x(0) ∈ Z.

Therefore, x∈YZ. Moreover, fort ≥s≥0 we have x(t)−T(t,s)x(s) =

Z t

0 T(t,τ)P(τ)y(τ)dτ−T(t,s)

Z s

0 T(s,τ)P(τ)y(τ)dτ

Z

t T(t,τ)(Id−P(τ))y(τ)dτ +T(t,s)

Z

s T(s,τ)(Id−P(τ))y(τ)dτ

=

Z t

s T(t,τ)P(τ)y(τ)dτ+

Z t

s T(t,τ)(Id−P(τ))y(τ)dτ

=

Z t

s T(t,τ)y(τ)dτ,

(6)

and therefore we conclude that (3.1) holds. In order to establish the uniqueness, it is sufficient to consider the case wheny=0. Let x∈YZ such that

x(t) =T(t,s)x(s), fort ≥s≥0.

Then, from (2.5) we have

kx(0)k0 =k(Id−P(0))x(0)k0 =kT(0,t)(Id−P(t))x(t)k0

≤Deλρ(t)kx(t)kt

≤Deλρ(t)kxk,

for everyt ≥ 0. Passing to the limit when t → ∞, we conclude that x(0) =0, which implies thatx =0.

Proposition 3.2. Assume that the evolution familyT admits a ρ-dichotomy with respect to a family of normsk·kt, t≥0, and set Z=KerP(0). Then, for each y∈Y0 there exists a unique x∈YZ such that

x(t) =T(t,s)x(s) +

Z t

s ρ0(τ)T(t,τ)y(τ)dτ, for t ≥s≥0. (3.2) Proof. Takey∈Y0 . Fort ≥0, set

x(t) =

Z t

0 ρ0(s)T(t,s)P(s)y(s)ds−

Z

t ρ0(s)T(t,s)(Id−P(s))y(s)ds.

It follows from (2.4) and (2.5) that kx(t)kt

Z t

0 ρ0(s)kT(t,s)P(s)y(s)ktds+

Z

t ρ0(s)kT(t,s)(Id−P(s))y(s)ktds

≤ D Z t

0 ρ0(s)eλ(ρ(t)−ρ(s))ky(s)ksds+D Z

t ρ0(s)eλ(ρ(s)−ρ(t))ky(s)ksds

≤ Dkyk0 Z t

0 ρ0(s)eλ(ρ(t)−ρ(s))ds+

Z

t ρ0(s)eλ(ρ(s)−ρ(t))ds

2D

λ kyk0, for every t≥0.

Sincex(0)∈ Z, we conclude that x ∈ YZ. A simple computation shows that (3.2) holds. The uniqueness part can be established as in the proof of Proposition3.1.

4 From admissibility to dichotomy

The aim of this section is to prove that the admissibility of the pairs YZ,Y1

, YZ,Y0 for a closed subspaceZ ⊂ X yields the existence of aρ-dichotomy with respect to the family of norms{k·kt}t0. More precisely, our goal is to establish the following result.

Theorem 4.1. Assume that there exists a closed subspace Z⊂ X such that:

(i) for each y∈Y1 there exists a unique x∈YZ satisfying(3.1);

(ii) for each y ∈Y0 there exists a unique x∈YZ satisfying(3.2).

Then, the evolution familyT admits aρ-dichotomy with respect to the family of normsk·kt, t≥0.

(7)

Proof. Let

TZ :D(TZ)⊂YZ →Y1, TZx =y, where

D(TZ) =nx∈YZ : there existsy∈Y1satisfying (3.1)o . Furthermore, let

TZ0 :D(TZ0)⊂YZ →Y0 , TZ0x=y, where

D(TZ0) =nx∈YZ: there exists y∈Y0 satisfying (3.2) o

.

Lemma 4.2. The operators TZ: D(TZ)→Y1, TZ0 : D(TZ0)→Y0 are well-defined, linear and closed.

Proof of the lemma. Assume thatx∈YZ andy1,y2 ∈Y1 such that x(t) =T(t,τ)x(τ) +

Z t

τ

T(t,s)yi(s)ds, fort ≥τ≥0 andi∈ {1, 2}. Hence,

Z t

τ

T(t,s)(y1(s)−y2(s))ds=0, fort> τ≥0.

Dividing by t−τand letting t−τ→0, it follows from the Lebesgue differentiation theorem that

y1(t) =y2(t) for almost everyt≥0.

We conclude thaty1=y2inY1. Thus,TZ is well-defined and, by definition it is linear.

We now show thatTZis closed. Let(xn)nNbe a sequence inD(TZ)converging tox ∈YZ such thatyn=TZxnconverges toy∈Y1. Then, fort ≥τ≥0 we have that

x(t)−T(t,τ)x(τ) = lim

n(xn(t)−T(t,τ)xn(τ)) = lim

n Z t

τ

T(t,s)yn(s)ds.

On the other hand, we have

Z t

τ

T(t,s)yn(s)ds−

Z t

τ

T(t,s)y(s)ds

≤ M Z t

τ

kyn(s)−y(s)kds

≤ M Z t

τ

kyn(s)−y(s)ksds

≤ Mkyn−yk1,

where M = M(t,τ) = sup{kT(t,s)k : s ∈ [τ,t]}is finite by the Banach–Steinhaus theorem.

Sinceyn→yinY1, we conclude that

nlim Z t

τ

T(t,s)yn(s)ds=

Z t

τ

T(t,s)y(s)ds,

and therefore (3.1) holds. We conclude that x∈ D(TZ)andTZx= y. Therefore,TZis a closed linear operator. Similarly, one can show that TZ0 is well-defined, linear and closed.

(8)

By the assumption in Theorem 4.1, the linear operators TZ, TZ0 are bijective, and by pre- vious lemma and the Closed Graph Theorem they have bounded inverse GZ: Y1 → YZ and G0Z: Y0 →YZ, respectively.

Forτ≥0, set S(τ) =

v∈ X: sup

tτ

kT(t,τ)vkt <

and U(τ) =T(τ, 0)Z.

Clearly,S(τ)andU(τ)are subspaces ofX for eachτ≥0.

Lemma 4.3. Forτ≥0, we have that

X =S(τ)⊕U(τ). (4.1)

Proof of the lemma. Letτ≥0 and takev∈ X. Set

g(s) =χ[τ,τ+1](s)T(s,τ)v, s ≥0.

Clearly, g ∈ Y1. Since TZ is invertible, there exists h ∈ D(TZ) ⊂ YZ such that TZh = g. It follows from (3.1) that

h(t) =T(t,τ)(h(τ) +v) fort ≥τ+1.

Sinceh∈Y, we conclude thath(τ) +v∈S(τ). Similarly, it follows from (3.1) that h(τ) =T(τ, 0)h(0).

Sinceh(0)∈ Z, we have thath(τ)∈U(τ)and thus

v= (h(τ) +v) + (−h(τ))∈S(τ) +U(τ). We have proved thatX=S(τ) +U(τ).

Take nowv ∈S(τ)∩U(τ). Then, there existsz ∈Z such thatv=T(τ, 0)z. We consider a functionh: [0,∞)→X, defined by

h(t) =T(t, 0)z fort≥0.

Clearly, h ∈ YZ. Since h(t) = T(t,s)h(s)for all t ≥ s ≥ 0, it follows that TZh = 0 and thus h = 0. We conclude that v = h(τ) = 0, and hence S(τ)∩U(τ) = {0}. This completes the proof of the lemma.

Let P(τ): X → S(τ)and Q(τ): X →U(τ)be the projections associated with the decom- position (4.1), withP(τ) +Q(τ) =Id. Observe that (2.2) holds. Indeed, observe that

T(t,τ)S(τ)⊂ S(t) and T(t,τ)U(τ)⊂U(t), fort ≥τ≥0.

Hence, we have that for everyx ∈Xandt≥τ≥0,

P(t)T(t,τ)x =P(t)T(t,τ)P(τ)x+P(t)T(t,τ)Q(τ)x=T(t,τ)P(τ)x.

We conclude that (2.2) holds.

Lemma 4.4. For t≥τ≥0, the restriction T(t,τ)|U(τ): U(τ)→U(t)is invertible.

(9)

Proof of the lemma. Let t ≥ τ ≥ 0 and take x ∈ U(t). Then, there exists z ∈ Z such that x = T(t, 0)z. Since T(τ, 0)z ∈ U(τ) and x = T(t,τ)T(τ, 0)z, we conclude that T(t,τ)|U(τ) is surjective.

Let now x ∈ U(τ) such thatT(t,τ)x = 0. Take z ∈ Z such that x = T(τ, 0)z. We define u: [0,∞)→ X byu(s) = T(s, 0)z, s ≥ 0. Since u(s) = 0 for s ≥ t, we have that u ∈ YZ and TZu=0. Consequently,u=0 andx= u(τ) =0. This proves that T(t,τ)|U(τ) is also injective.

The proof of the lemma is completed.

Lemma 4.5. There exists M>0such that

kP(τ)vkτ ≤ Mkvkτ, for all v∈X and τ≥0. (4.2) Proof of the lemma. Take v ∈ X and τ ≥ 0 . Moreover, given h > 0, we define a function gh: [0,∞)→X by

gh(t) = 1

hχ[τ,τ+h](t)T(t,τ)v.

Clearly, gh ∈Y1 and thus there existsxh ∈ D(TZ)such thatTZxh =gh. We have kP(τ)vkτ =kxh(τ) +vkτ ≤ kxh(τ)kτ+kvkτ ≤ kGZghk+kvkτ. Moreover,

kGZghk ≤ kGZk · kghk1=kGZk1 h

Z τ+h τ

kT(t,τ)vktdt.

Lettingh→0, we obtain

kP(τ)vkτ ≤(1+kGZk)kvkτ, and we conclude that (4.2) holds forM =1+kGZk.

Lemma 4.6. There exist constantsλ,D>0such that

kT(t,τ)vkt ≤ Deλ(ρ(t)−ρ(τ))kvkτ, for t ≥τ≥0and v∈S(τ). (4.3) Proof of the lemma. Fixτ≥0 and letv∈ S(τ). We consider the function

u: [0,)→ X, u(t) =χ[τ,)(t)T(t,τ)v.

Moreover, for any fixedh >0, we define two functionsϕh: [0,∞)→Randgh: [0,∞)→Xby

ϕh(t) =





0, 0≤t≤τ,

1

h(t−τ), τ≤t≤ τ+h, 1, t≥ τ+h, and

gh(t) = 1

hχ[τ,τ+h](t)T(t,τ)v, t≥0.

It is easy to show thatgh∈Y1, ϕhu∈ D(TZ)andTZ(ϕhu) =gh. We have sup

tτ+h

ku(t)kt = sup

tτ+h

kϕh(t)u(t)kt ≤ kϕhuk= kGZghk

≤ kGZk · kghk1

=kGZk1 h

Z τ+h

τ

ku(s)ksds.

(10)

Hence, lettingh→0 we obtain the inequality

ku(t)kt≤ kGZk · kvkτ, for every t≥τ.

Thus,

kT(t,τ)vkt≤ kGZk · kvkτ, for every t≥τ. (4.4) Let us take t ≥ τand v ∈ S(τ)such that T(t,τ)v 6= 0, thusT(s,τ)v 6= 0 for alls ∈ [τ,t]. Let us considerx,y: [0,∞)→Xdefined by

y(s) =χ[τ,t](s) T(s,τ)v

kT(s,τ)vks, s≥0, and

x(s) =





0, 0≤s≤τ,

Rs

τ ρ0(r)kT(s,τ)v

T(r,τ)vkr dr, τ<s≤t, Rt

τρ0(r)kTT((r,τs,τ))vvk

r dr, s>t.

Note thaty ∈Y0 andkyk0 =1. Furthermore, sincev∈S(τ)we get that kx(s)ks

Z t

τ

ρ0(r)

kT(r,τ)vkrdrkT(s,τ)vks≤at,τ,v sup

rτ

kT(r,τ)vkr <∞, for alls≥τ, where

at,τ,v=

Z t

τ

ρ0(r)

kT(r,τ)vkr dr<,

and thusx∈YZ. It is straightforward to show thatTZ0x= y. Consequently, kxk =kGZ0 yk ≤ kGZ0k · kyk0 =kGZ0k.

Therefore,

kGZ0k ≥ kxk ≥ kx(t)kt= kT(t,τ)vkt

Z t

τ

ρ0(r)

kT(r,τ)vkrdr. (4.5) From (4.4) it follows that

1

kT(r,τ)vkr1

kGZk · kvkτ, for allr∈ [τ,t], and thus, from (4.5) we get

kG0Zk · kGZk · kvkτ ≥ kT(t,τ)vkt(ρ(t)−ρ(τ)), for t≥τandv∈S(τ). Consequently,

(t−τ)T

ρ1(t),ρ1(τ)v

ρ1(t)≤ kG0Zk · kGZk · kvkρ1(τ),

fort ≥τ andv∈ S ρ1(τ). Let N0N such that N0 > ekG0Zk · kGZk, and lett ≥ τ+N0. Then,

N0

T

ρ1(t),ρ1(τ)v

ρ1(t)≤(t−τ) T

ρ1(t),ρ1(τ)v ρ1(t)

≤ kG0Zk · kGZk · kvkρ1(τ),

(11)

which implies that there existsN0N such that

kT(ρ1(t),ρ1(τ))vkρ1(t)1

ekvkρ1(τ), (4.6) for t ≥ τwith t−τ ≥ N0 andv ∈ S ρ1(τ). Take an arbitraryt ≥ τwith t−τ ≥ N0 and writet−τin the form

t−τ=kN0+r, k=k(t,τ)∈N and r=r(t,τ)∈[0,N0). Observing that

T

ρ1(t),ρ1(τ)

=T

ρ1(t),ρ1(τ+kN0)

k1

j=0

T

ρ1(τ+ (k−j)N0),ρ1(τ+ (k−j−1)N0), it follows from (4.4) and (4.6) that

kT

ρ1(t),ρ1(τ)vkρ1(t) ≤ kGZkekkvkρ1(τ)

≤ekGZkeN10(tτ)kvkρ1(τ),

and thus (4.3) holds withλ=1/N0andD= ekGZk. The proof of the lemma is completed.

Lemma 4.7. There existλ,D>0such that

kT(t,τ)vkt ≤ Deλ(ρ(τ)−ρ(t))kvkτ, for0≤t ≤τand v∈U(τ). (4.7) Proof of the lemma. Takeτ>0 andz∈ Z. We define a functionu: [0,∞)→ Xby

u(t) =T(t, 0)z, fort ≥0.

For sufficiently smallh>0, we defineψh: [0,∞)→R,

ψh(t) =





1, 0≤t ≤τ−h,

thτ, τ−h≤t ≤τ, 0, t ≥τ.

Finally, we consider

gh: [0,∞)→X, gh =−1

hχ[τh,τ]u.

It is easy to check that gh ∈Y1,ψhu∈ D(TZ)andTZ(ψhu) =gh. Hence, sup

t∈[0,τh]

ku(t)kt = sup

t∈[0,τh]

kψh(t)u(t)kt≤ kψhuk =kGZghk

≤ kGZk · kghk1

=kGZk · 1 h

Z τ

τh

ku(s)ksds.

Lettingh→0, we get

ku(t)kt ≤ kGZk · ku(τ)kτ, for 0≤ t≤τ,

(12)

which implies

kT(t, 0)zkt ≤ kGZk · kT(τ, 0)zkτ, forz ∈Zand 0≤t≤τ. (4.8) Take nowz∈Z\ {0}and 0≤t ≤τ. We definex,y: [0,∞)→Xby

y(s) =

(−kT(s,0)z

T(s,0)zks, 0≤s ≤τ, 0, s >τ, and

x(s) = (Rτ

s ρ0(r)kTT((r,0s,0))zzk

r dr, 0≤s≤τ,

0, s>τ.

Observe thaty ∈ Y0 andkyk0 = 1. Moreover, x ∈ YZ and it is easy to check that TZ0x = y.

Hence,

kxk =kG0Zyk≤ kG0Zk. Consequently, for each 0≤s ≤τwe have

kG0Zk ≥ kT(s, 0)zks

Z τ

s ρ0(r) 1

kT(r, 0)zkrdr.

Lettingτ→∞, we conclude that kG0Zk ≥ kT(s, 0)zks

Z

s ρ0(r) 1

kT(r, 0)zkrdr fors ≥0 andz ∈Z\ {0}. (4.9) Take now 0≤ t≤τandz∈ Z\ {0}. It follows from (4.8) and (4.9) that

1

kT(ρ1(t), 0)zkρ1(t)

1 kG0Zk

Z

ρ1(t)ρ0(r) 1

kT(r, 0)zkrdr

1 kG0Zk

Z ρ1(τ)

ρ1(t) ρ0(r) 1

kT(r, 0)zkrdr

1 kG0Zk

Z ρ1(τ)

ρ1(t) ρ0(r) 1

kGZk · kT(ρ1(τ), 0)zkρ1(τ)

dr

= τ−t

kG0Zk · kGZ1

kT(ρ1(τ), 0)zkρ1(τ)

and thus

(τ−t)kT(ρ1(t), 0)zkρ1(t)≤ kGZk · kG0Zk · kT(ρ1(τ), 0)zkρ1(τ). We conclude that there existsN0N such that

kT(ρ1(t), 0)zkρ1(t)1

ekT(ρ1(τ), 0)zkρ1(τ), forz ∈Zand 0≤t≤τsuch thatτ−t≥ N0. Hence,

kT(ρ1(t),ρ1(τ))vkρ1(t)1

ekvkρ1(τ),

for v ∈ U(ρ1(τ)) and 0 ≤ t ≤ τ such that τ−t ≥ N0. By arguing as in the proof of Lemma4.6, we find that there existλ,D>0 such that

kT(ρ1(t),ρ1(τ))vkρ1(t) ≤Deλ(τt)kvkρ1(τ),

forv ∈U(ρ1(τ))and 0≤t ≤τ, which readily implies the conclusion of the lemma.

(13)

In order to complete the proof of the theorem, it is sufficient to observe that (4.2), (4.3) and (4.7) imply that (2.4) and (2.5) hold.

Remark 4.8. It is worth observing that in order to deduce the existence of a ρ-dichotomy we imposed two admissibility conditions. In the following two examples we will illustrate that this was necessary.

Example 4.9. We consider an evolution familyT = {T(t,s)}ts0given by T(t,s) =Id, t≥s ≥0.

Furthermore, take Z = {0} and let k·kt = k·k for t ≥ 0. Then for each y ∈ Y1, the unique x∈YZ satisfying (3.1) is given by

x(t) =

Z t

0

T(t,s)y(s)ds=

Z t

0

y(s)ds, t≥0.

Thus, the first assumption of Theorem4.1is fulfilled. On the other hand,T obviously doesn’t admit aρ-dichotomy with respect to the family of norms k·kt,t≥0.

The following example is a simple modification of [12, Example 1].

Example 4.10. LetX=Rwith the standard Euclidean norm|·|. Furthermore, letk·kt=|·|for t≥0 and takeZ={0}. Furthermore, letρ(t) =ln(1+t)fort≥0. We consider the sequence (An)nNof operators onX(which can of course be identified with numbers) given by

An =

(n ifn=2l for somel∈N, 0 otherwise.

Furthermore, fort ≥s≥0 we define T(t,s) =

(Abtc−1· · ·Absc, btc ≥ bsc+1, 1, btc=bsc.

Then, T = {T(t,s)}ts0 is an evolution family. By arguing as in [12, Example 1], it is easy to check that the second assumption of Theorem 4.1 is satisfied and T doesn’t admit a ρ- dichotomy with respect to the family of normsk·kt,t ≥0.

5 Robustness of generalized dichotomies

In this section we apply our main results to prove that the concept ofρ-dichotomy with respect to a family{k·kt}t0of norms on Xpersist under sufficiently small linear perturbations. As a consequence, we establish the robustness property ofρ-nonuniform exponential dichotomy.

Theorem 5.1. Assume that the evolution family{T(t,s)}ts0admits aρ-dichotomy with respect to a family{k·kt}t0of norms on X satisfying

kxk ≤ kxkt≤Ceερ(t)kxk, for x∈ X and t≥0,

for some C > 0 and ε ≥ 0, such that the mapping t 7→ kxkt is continuous for each x ∈ X. If B:[0,∞)→ B(X)is a strongly continuous operator-valued function such that

kB(t)k ≤δe−(ε+a)ρ(t)ρ0(t), t≥0, (5.1)

(14)

for some a > 0 and sufficiently small δ > 0, then the perturbed evolution family {U(t,s)}ts0 satisfying

U(t,s) =T(t,s) +

Z t

s T(t,τ)B(τ)U(τ,s)dτ, t ≥s≥0, (5.2) admits aρ-dichotomy with respect to the family of normsk·kt, t≥0.

Proof. Since {T(t,s)}ts0 admits a ρ-dichotomy with respect to the family of norms k·kt, t ≥ 0, it follows from Proposition 3.1 and Proposition3.2 that there exists a closed subspace Z⊂ Xsuch that the operators

TZ: D(TZ)⊂YZ →Y1 and TZ0 : D(TZ0)⊂YZ →Y0 ,

defined in the proof of Theorem4.1, are invertible and closed. We consider the graph norms:

kxkTZ :=kxk+kTZxk1, x∈ D(TZ), and

kxkT0

Z :=kxk+kTZ0xk0, x∈ D(TZ0). SinceTZ, TZ0 are closed, it follows that(D(TZ),k · kTZ), D(TZ0),k · kT0

Z

are Banach spaces.

Furthermore,

TZ:(D(TZ),k · kTZ)→(Y1,k · k1) and

TZ0 :

D(TZ0),k · kT0

Z

→ Y0 ,k · k0

are bounded linear operators, denoted simply byTZ andTZ0, respectively.

We consider the linear operatorsD:D(TZ)→Y1, D0 :D(TZ0)→Y0 defined by (Dx)(t) = B(t)x(t)and(D0x)(t) = 1

ρ0(t)B(t)x(t), fort ≥0.

One can easy check that these operators are well-defined. Furthermore, for each x ∈ D(TZ) we have

kDxk1 =

Z

0

kB(t)x(t)ktdt

≤C Z

0 eερ(t)kB(t)x(t)kdt

δC Z

0

e(t)ρ0(t)kx(t)kdt

δC a kxk, and thus

kDxk1δC

a kxkTZ, x∈ D(TZ). (5.3) On the other hand, forx ∈ D(TZ0)we get

k(D0x)(t)kt = 1

ρ0(t)kB(t)x(t)kt

1 ρ0(t)Ce

ερ(t)kB(t)x(t)k

δCe(t)kx(t)k

δCkxkT0

Z,

(15)

for all t≥0, hence

kD0xk0δCkxkT0

Z, x∈ D(TZ0). (5.4)

We define now the linear operators

UZ :D(UZ)→Y1, UZx =y,

whereD(UZ)is the set of all functionsx∈YZ such that there existsy ∈Y1 satisfying x(t) =U(t,s)x(s) +

Z t

s U(t,τ)y(τ)dτ, fort≥s ≥0, and respectively,

UZ0 :D(UZ0 )→Y0 , UZ0 x=y,

whereD(UZ0)is the set of all functionsx∈YZ such that there existsy ∈Y0 satisfying x(t) =U(t,s)x(s) +

Z t

s ρ0(τ)U(t,τ)y(τ)dτ, fort≥s ≥0.

Lemma 5.2. We have:

D(TZ) =D(UZ) and TZ =UZ+D, (5.5) and respectively,

D(TZ0) =D(UZ0) and TZ0 =U0Z+D0. (5.6) Proof of the lemma. Takex∈ D(UZ), that isx ∈YZsuch that there existsy∈Y1withUZx=y.

Then, fort≥s ≥0 we have x(t) =U(t,s)x(s) +

Z t

s U(t,τ)y(τ)dτ

= T(t,s)x(s) +

Z t

s T(t,τ)B(τ)U(τ,s)x(s)dτ+

Z t

s T(t,τ)y(τ)dτ +

Z t

s

Z t

τ

T(t,r)B(r)U(r,τ)y(τ)dr dτ

= T(t,s)x(s) +

Z t

s T(t,r)y(r)dr+

Z t

s T(t,r)B(r)U(r,s)x(s)dr +

Z t

s

Z r

s T(t,r)B(r)U(r,τ)y(τ)dτdr

= T(t,s)x(s) +

Z t

s T(t,r) (y(r) +B(r)x(r))dr, thusx ∈ D(TZ)and

TZx= y+Dx= (UZ+D)x.

Reversing the arguments, we conclude that (5.5) holds. Similarly, one can prove (5.6).

Now, we continue the proof of the theorem. From (5.5) and (5.3) we have k(UZ−TZ)xk1 =kDxk1δC

a kxkTZ, for all x∈ D(TZ) =D(UZ),

which implies that UZ : D(UZ) → Y1 is bounded. Since TZ is invertible, we obtain that UZ is also invertible for sufficiently small δ > 0. Similarly, one can show that UZ0 is invertible for sufficiently small δ >0. By Theorem4.1 we conclude that the perturbed evolution family {U(t,s)}ts0 admits aρ-dichotomy with respect to the family of normsk · kt,t ≥0.

Hivatkozások

KAPCSOLÓDÓ DOKUMENTUMOK

For a dynamics with continuous time, we consider the notion of a strong exponential dichotomy with respect to a family of norms and we characterize it in terms of the admissibility

The main theme of the results we have presented is that the properties of the forcing sequence H are reflected in the solution x of equation (2.5). So far, we have concentrated on

In the first part of the paper we consider a nonautonomous dynamics with discrete time obtained from a sequence of linear operators on a Banach space and we characterize the notion

We first determine the dichotomy (Sacker–Sell) spectrum for certain nonau- tonomous linear evolutionary equations induced by a class of parabolic PDE systems.. Having this

In this work, using discontinuous almost periodic type functions, exponential dichotomy and the notion of Bi-almost automorphicity we give sufficient conditions to obtain a

By using the exponential dichotomy theory and fixed point theorem, some sufficient conditions are given to ensure that all solutions of this model converge exponentially to the

Key words and phrases: Power-exponential function, Convex function, Bernoulli’s inequality, Conjecture.. 2000 Mathematics

Analyse/regression/Curve estimation/ PCSK9 -&gt;Independent, lnLDLapoBPR -&gt; Dependent, Models: linear,. ; Display