• Aucun résultat trouvé

Convergence of iterates of a transfer operator, application to dynamical systems and to Markov chains

N/A
N/A
Protected

Academic year: 2022

Partager "Convergence of iterates of a transfer operator, application to dynamical systems and to Markov chains"

Copied!
32
0
0

Texte intégral

(1)

DOI: 10.1051/ps:2003003

CONVERGENCE OF ITERATES OF A TRANSFER OPERATOR, APPLICATION TO DYNAMICAL SYSTEMS AND TO MARKOV CHAINS

Jean-Pierre Conze

1

and Albert Raugi

1

Abstract. We present a spectral theory for a class of operators satisfying a weak “Doeblin–Fortet”

condition and apply it to a class of transition operators. This gives the convergence of the series

P

k≥0krPkf, r N, under some regularity assumptions and implies the central limit theorem with a rate in n12 for the corresponding Markov chain. An application to a non uniformly hyperbolic transformation on the interval is also given.

Mathematics Subject Classification. 60J10, 37A05, 37A25.

Received January 28, 2002.

Introduction

Given a metric compact spaceE, we consider operatorsP of the following form:

P f(x) =X

sS

us(x)f(sx), (∗)

where{us, s∈S}is a family of non negative functions satisfying a condition of regularity and{x→sx, s∈S} a family of contracting applications ofE into itself.

These operators arise in the theory of Markov chains as transition operators and in ergodic theory as transfer operators associated to Gibbs measures. They are related to dynamical systems of hyperbolic type through the coding given by Markovian partitions [2, 24] (see [1] for a general reference for transfer operators and decay of correlations).

In the Markovian case, when the functionsusare H¨olderian, the spectral theory of quasi-compact operators is the main tool in the study of the asymptotic behavior of the corresponding Markov chains (cf.[11]). For less regular functions{us:s∈S}, cones methods [15,16] can be applied (see also [19,26]). We follow here a method introduced in [21] and [6], in which the weightsus are not supposed to be strictly positive.

Under weaker regularity assumptions on the functionsus, we have established in [6] results on the convergence of the potential series, with applications to the central limit theorem, the rate of mixing and a Borel–Cantelli type property for the corresponding Gibbs measures.

In the present paper, we give several improvements of these results. In Section 1 a general spectral theory for a class of operators satisfying a weak “Doeblin–Fortet” condition is presented. In Section 2 we establish the

Keywords and phrases: Transfer operator, convergence of iterates, Markov chains, rate in the TCL for dynamical systems, Borel-Cantelli property, non uniformly hyperbolic map.

1 IRMAR, Universit´e de Rennes I, Campus de Beaulieu, 35042 Rennes Cedex, France; e-mail: [email protected] c EDP Sciences, SMAI 2003

(2)

inequalities for a class of transfer operatorsP of the form (*). In Sections 3 and 4 we apply these results to get the convergence of the seriesP

k≥0krPkf,r∈N, under some regularity assumptions. Using a result of Rio, this gives in Section 5 the optimal rate in the CLT for the Markov chains associated to these operators, under weak regularity assumptions. An other application, the Borel–Cantelli property for a class of dynamical systems, is also considered in Section 6. In the last section we consider an example of a non uniformly hyperbolic system close to models which have been studied by several authors [12,17,20] and show how our method can be applied.

1. Spectral theory under a weak Doeblin–Fortet condition

In this section, we consider an operatorP acting on a normed C-linear space (B,k k). We assume thatP is power bounded,i.e. such that:

sup

n≥0,kfk≤1kPnfk=M <∞.

We denote byK the set of complex numbers of modulus 1 and bythe convolution on the space of sequences defined onZwith support inZ+.

1.1. Hypotheses and notations

We suppose that there exists a sequence of semi-norms (| |k)k≥0 onB such that:

H1) the ball{f ∈B:|f|0+kfk ≤1}is relatively compact in (B,k k);

H2) for everyf ∈B, lim

k→+∞|f|k = 0;

H3) there exist a realC >0 and a positive convergent seriesP

k≥0ak such that

∀f ∈B,∀n≥1, |Pnf|0≤C|f|n+

nX−1 j=0

an−1−j kPjfk.

We set ρ =P

n≥0an and, forf B, N(f) = kfk+P

n≥0|f|n. The semi-norm | |0 will be simply denoted by| |.

Remark thatH3 is satisfied (withC= 1) if there exists a positive convergent seriesP

k≥0ak such that

∀f ∈B,∀k≥0, |P f|k≤ |f|k+1+akkfk, since this condition implies the inequalities:

|Pnf|k≤ |f|k+n+

n−1

X

j=0

an−1−j+k kPjfk,∀n≥1, k0.

Remark also that we can suppose that the sequence of semi-norms (| |)n≥0 is decreasing, replacing if necessary

|f|n with sup{|f|p, p≥n}forn≥0.

In the following, we denote by W1 the subspace ofB generated by the eigenvectors of P corresponding to eigenvalues of modulus 1 and byW2 the subspaceW2={f ∈B : lim

n→+∞kPnfk= 0}.

Theorem 1.1. Under the hypotheses (1.1) we have:

1) the subspace W1 is finite dimensional and B =W1⊕W2. If λ is a complex number of modulus 1 and f ∈B, the sequence 1

n

n−1

X

k=0

λkPkf

!

n≥1

converges in normk keither to zero or to aλ-eigenvector ofP;

(3)

2) for every ε >0, there exists an integerq=q(ε)≥0 such that, for everyf inW2and every integern≥0,

|Pnf|+εkPnfk ≤X

p≥0

qp∗βq,f)(n); (1)

whereγq andβq,f are the sequences defined by:

γq(n) = 1 2(ρ+ε M)



anq−1, if n≥q+ 2 a0+ε M, if n=q+ 1

0, if n≤q

and βq,f(n) =







C |f|n+M Pn

j=nq+1aj−1 kfk, if n≥q C|f|n+M Pn

j=1aj−1kfk, if 1≤n≤q−1

|f|, if n= 0

0, if n≤0.

If f is in W2, we have limn|Pnf|= 0;

3) for every integer r≥0, there are positive constantsAr andBr,q such that, for everyf ∈W2, X

n≥0

nr (|Pnf|+εkPnfk)≤Ar

X

n≥0

nr |f|n+Br,q N(f) X

n≥0

nr an.

When there exists a real A > 0 such that kfk ≤ A |f|, ∀f W2, we can take ε = 0 in the previous assertions.

1.2. Remark

Power bounded operators satisfying H1, H2, H3 are not in general quasi-compact and do not satisfy the

“spectral gap property”, but they are close to the following class of quasi-compact operatorsP which has been considered by Ionescu–Tulcea and Marinescu (cf. for example [11]).

LetP be a power bounded operator acting on a normed linear space (B,k k) and let| |be a norm onBsuch that:

i) the unit ball{f ∈B:|f| ≤1} is relatively compact in (B,k k);

ii) there existθ∈]0,1[ andc >0 such that,

|P f| ≤θ |f|+c kfk,∀f ∈B). (2)

Let us show how to get for this class of operators the spectral gap from Theorem 1.1. Considering on B the decreasing sequence of norms defined by|f|n =θn|f|,n≥0, we have, for everyf ∈B and every integer n≥0,

|P f|n≤ |f|n+1+c θn kfk.

In that case, the sequences γq(0) andβq(0),f are bounded respectively by the sequences:

γ(n) =

( 1−θ

2 θnq−1, if n≥q+ 1

0, if n≤q

(4)

and βf(n) =

Bf θn, if n≥0 0, if n <0, for some strictly positive realBf.

For every integersp≥0 and everyt >0 such thatθt <1, we have:

X

p≥0

X

n≥0

p∗β)(n)tn = X

p≥0

X

n≥0

γ(n)tn

p

X

n≥0

β(n)tn

= X

p≥0

Bf

1−θ 2

p

tp(q+1) 1

1−θt p+1

= Bf

1−θt−1−2θtq+1·

Consider the polynomial R(t) = 1−θt−(1−2θ)tq+1. For q = 0 the root of R is t0 = 1+2θ. For q 1 the polynomialRadmits a unique positive real roott0, which is simple and strictly between 1 and 1 +q+11 and the other roots have a modulus> t0. Therefore there exists a realCf >0 such that

X

p≥0

p∗β)(n)≤Cft0n, ∀n∈N.

We can apply Theorem 1.1: iff is in the corresponding subspaceW2, we have that|Pnf|is bounded byCft0n. Example. Explicit examples of applications are given in Sections 6 and 7. We give here a simple example to illustrate Theorem 1.1 and the Remark. We consider the transformation defined onTbyx→2xmod 1. The dual operator (for the Lebesgue measure) isP defined byP f(x) =12(f(x2) +f(x+12 )),f ∈L2(T).

Let Φ :R+R+ be a strictly increasing continuous function such that Φ(0) = 0. Forf ∈C(T), we set:

mΦ(f) = sup

x6=y

|f(x)−f(y)|

Φ(d(x, y)) , kfk = sup

x∈T|f(x)|, |f|Φ=kfk+mΦ(f).

LetBΦ={f ∈C(T) :|f|Φ<+∞}. For Φ(x) =xα, 0< α≤1, the operatorPacting on the triple (BΦ,k k,| |Φ) satisfies (2) with θ= 2α. On the other hand, if we take Φ(x) = 1+|ln1x|α,α >0, then (2) is not satisfied, but we can apply Theorem 1.1.

1.3. Proof of Theorem 1.1

Proof. The proof is given in several steps.

Step 1a. Lethbe a non zero vector inW1. There exist an integerp≥1 and, for 1≤j≤p, complex numbers zj and eigenvectorsfj forP corresponding to eigenvaluesλj inK such thath=Pp

j=1zj fj. FromH3, it results|Pp

j=1zj λnj fj| ≤C|h|n+ρMkhk,∀n≥1.

Taking a strictly increasing sequence of integers (ϕ(n))n≥0 for which the sequences λϕj(n)

n≥0, 1 ≤j ≤p, converge simultaneously to 1, we get, taking into account the condition H2,|h| ≤ρMkhk.

H1 implies that the set{khhk :h∈W1, h 6= 0} is relatively compact in (B,k k) and therefore the subspace W1 is finite dimensional.

(5)

Step 1b. Let us show that, for allλinKand allf inB, the sequence Sn,λf = 1 n

n−1

X

k=0

λkPkf

!

n≥1

converges in (B,k k) either to zero or to aλ-eigenvector Πλ(f) ofP.

Letf ∈B. From H3, we deduce|Pnf| ≤C|f|n+ρMkfk,∀n≥1, and therefore|Sn,λf| ≤C|f|n+ρMkfk.

From H1, it follows that the family {Sn,λf :n≥1}is relatively compact in (B,k k). It is clear that any non null cluster value of the sequence Sn,λf

n≥1is a λ-eigenvector forP.

On an other hand, for every integer p 1 and everyλ-eigenvector hof P, writingn =`p+r (Euclidean division), we get:

Sn,λf−h= 1 n

p

`−1

X

j=0

λj Pj(Sp,λf −h) +rλ` P`(Sr,λ(f−h))

and therefore

lim sup

n→+∞kSn,λf−hk ≤MkSp,λf−hk.

This inequality shows that the sequence Sn,λf

n≥1 can have only one cluster value; hence the convergence.

Considerf ∈B. Since W1 is finite dimensional, there are only finitely many complex numbers λ in K for which Πλfis non zero. Letj: 1≤j≤p}be the set of these complex numbers. The vectorg=f−Pp

j=1Πλjf satisfies then lim

n→+∞Sn,λ g= 0, for allλinK.

Step 1c. We show now that if gis a vector inB such that lim

n→+∞Sn,λg= 0, for allλinK, theng belongs to W2. This will complete the proof of the first assertion of Theorem 1.1.

Letgbe a vector inB satisfying the previous property. Leth0 be a cluster value of the sequence (Png)n≥0. There exists a strictly increasing sequence of integers (ϕ(n))n≥0 such that Pϕ(n)g

n≥0 converges in (B,k k) to h0. Using the diagonal process and taking a subsequence still denoted by (ϕ(n))n≥0, we may assume that, for all integersk≥0, the sequence Pϕ(n)−kf

n≥0 converges in (B,k k) to a vector denoted byhk.

The sequence (hk)k≥0 satisfiesP hk+1 =hk,∀k≥0. This relation can be extended toZby setting, for every k≥1,hk=Pkh0. It is clear that the family{hk:k∈Z}is relatively compact in (B,k k). For allλin Kand all integersp∈Z, we have in (B,k k) lim

n→+∞

1 n

nX−1 k=0

λk hpk= 0.

One shows easily that, for any linear continuous formψon (B,k k), the sequenceu= ψ(hk)

k∈Z in`(Z) is almost periodic (i.e. the set of sequences{up = ψ(hpk)

k∈Z : p N} is relatively compact in `(Z)).

Moreover, we have lim

n→+∞

1 n

nX−1 k=0

λk uk = 0,∀λ∈ K. This implies thatuk= 0,∀k∈Z.

We deduce from it that zero is the only cluster value of the sequence (Png)n≥0, which therefore converges to zero.

Step 2. Letε >0. H1 implies that the setB2={g ∈W2:|g|+εkgk= 1} is relatively compact in (B,k k).

As we have limnkPngk= 0,∀g∈W2, andP is power bounded, the convergence is uniform onB2. Therefore there exists an integerq=q(ε)≥0 such that, for everyf ∈W2,

kPqfk ≤ |f|+εkfk 2(ρ+εM)·

(6)

Forf ∈W2, we have:

- forn≥q+ 1,

|Pnf|+εkPnfk ≤C |f|n+M

q−1

X

j=0

an−1−j kfk+ 1 2(ρ+εM)

nX−1 j=q

bn−1−j (|Pjqf|+εkPjqfk), withb0=a0+εM and∀n≥1, bn=an;

- for 1≤n≤q,

|Pnf| ≤C |f|n+M

n−1

X

j=0

an−1−j kfk.

Letαf be the sequence defined by

αf(n) =

|Pnf|, if n≥0, 0, if n <0.

We have

αf(n)≤βq,f(n) + (γq∗αf)(n), ∀n∈Z, and therefore, for every integer`≥1,

αf(n)

`−1

X

p=0

qp∗βq,f)(n) + (γq`∗αf)(n), ∀n∈Z.

As we have (γq`∗αf)(n) = 0, for`such that `(q+ 1)> n, this implies inequality (1) of Theorem 1.1.

Step 3. For simplicity, we denote respectively byγandβ the sequencesγq andβq,f. We haveP

n≥0γ(n) = 12 andP

n≥0p∗β)(n) = 2p β, whereβ =P

n≥0β(n), and therefore X

n≥0

(|Pnf|+εkPnfk)≤2 β≤2 max{1, C}X

n≥0

|f|n+ 2qMkfkX

n≥0

bn.

Letpbe an integer1 and letX1, . . . , Xp, Y be independent integer random variables such that:

∀k∈N, P[{X1=k}] =. . .=P[{Xp=k}] = 2γ(k) andP[{Y =k}] =β(k)/β.

For every integerr≥1, we have β−12pX

n≥1

nrp∗β)(n) = E[(X1+. . .+Xp+Y)r]

(p+ 1)r−1 (pE[X1r] +E[Yr])

(p+ 1)r−1

2pX

n≥1

nrγ(n) + 1 β

X

n≥1

nrβ(n)

.

It follows that X

n≥1

nr(|Pnf|+εkPnfk)≤X

p≥1

p(p+ 1)r−1 2p−1 β X

n≥1

nrγ(n) +X

p≥0

(p+ 1)r−1 2p

X

n≥1

nrβ(n).

From this, one deduces easily the last assertion.

(7)

Notation. Under the hypotheses (1.1), we denote by Π1 and Π2 the projectors from B respectively ontoW1 andW2, and byQthe operatorP◦Π2.

The following lemma will be useful in Sections 5 and 6.

Lemma 1.2. Under the hypotheses (1.1), let us assume that (B,k k)is a normed algebra and that the semi- norms| |k are decreasing and satisfy the inequalities

|f g|k≤ kfk|g|k+kgk|f|k, ∀f, g∈B, ∀k≥0.

Moreover, let us assume satisfied the following condition (which extends to the family of semi-norms (| |k)the inequalities H3 satisfied by the semi-norm| |):

there existC >0 and a sequence of positive convergent series(P

n≥0a(nk))k≥0 such that

∀f ∈B,∀n≥1,∀k≥0, |Pnf|k ≤C|f|n+k+

n−1

X

j=0

a(nk−1−) j kPjfk.

Consider the sequence defined by

∀n≥0, δ(n) = (

supj≥0a(jn) if ∀f ∈B,|f|n=2f|n

P

j≥0a(jn) else.

Let ζ=ζf1,... ,fm andψq be the sequences defined by

ζf1,... ,fm(n) =kf1k Xm i=2

(i1)



 Ym

j=2 j6=i

kfjk



N(fi)δ(n) + Xm i=1



 Ym

j=1 j6=i

kfjk



|fi|n,

ψq(n) =



 Pn

j=nq+1aj−1 if n≥q Pn

j=1aj−1 if 1≤n≤q−1

0 if n= 0.

If P

n≥0δ(n) < +∞, there exists a real E1 > 0 such that, for all integers m 2, for all m-uples of vectors f1, . . . , fm inB and all natural integersk2, . . . , km,

|Qnf1Qk1f2· · ·Qkmfm|+kQnf1Qk2f2· · ·Qkmfmk ≤X

p≥0

q(1)p ∗ξ)(n), ∀n≥0,

whereξ=ξf1,... ,fm is the sequence defined by

E1mξ(n) =ζ(n) + Ym j=1

kfjk C δ(n) +ψq(n) .

(8)

Proof. There exists a realD >max{M, C} such that, for every integersk≥1 and n≥0 and every functions f inW2,

|Pkf|n C|f|n+k+

k−1

X

j=0

a(kn)j−1kPjfk

C|f|n+δ(n)X

j≥0

kPjfk

D(|f|n+δ(n)N(f)).

It follows that, for every integersk≥1 andn≥0, every functions f andgin W2,

|f Pkg|n = kfk|Pkg|n+kPkgk|f|n

D(kfk|g|n+kgk|f|n+δ(n)kfkN(g)) and therefore there exists E1> D such that

N(f Pkg)≤D

1 +X

n≥0

δ(n)

(kfkN(g) +kgkN(f))≤E1(kfkN(g) +kgkN(f)).

This implies:

ζf1,... ,fm−2,fm−1Qkfm(n)≤E1 ζf1,... ,fm−1,fm(n), ∀k∈N.

We have then that|f1Qk2f2| ≤E1ζf1,f2(n). Suppose that

|f1Qk2f2. . . Qkmfm|n ≤Em1−1 ζf1,... ,fm(n), (3) then we have

|f1Qk2f2. . . QkmfmQkm+1fm+1|n Em1−1 ζf1,... ,fm−1,fmQkm+1fm+1(n)

Em1 ζf1,... ,fm−1,fm,fm+1(n).

So we have proved recursively (3).

On an other hand, we have:

1f1Qk2f2. . . Qkmfm|n M δ(n)kΠ1f1Qk2f2. . . Qkmfmk

Mmδ(n)kf1k. . .kfmk.

The desired result follows from the second assertion of Theorem 1.1 and the inequality

βq,Π2f1Qk2f2...Qkmfm ≤E1m

ζ(n) +Ym

j=1

kfjk C δ(n) +ψq(n)

.

2. Inequalities for transfer operators

We describe now a class of operators to which the results of Section 1 will be applied.

(9)

2.1. Hypotheses

Let (E, d) be a compact metric space. We consider a finite or countable familyS of continuous applications s:x→sxfromE into itself. The following contraction hypothesis will be assumed afterwards (except in the last section where a case of non uniform contraction will be discussed):

there exists a sequence of positive real numbersn)n≥0 decreasing to 0 such that:

d(x, y)≤ηn ⇒d(sx, sy)≤ηn+1, ∀x, y∈E, ∀s∈S. (4) Frequently in the examples, the applications x→ sxsatisfy a uniform condition of contraction: there exists c <1 such thatd(sx, sy)< cd(x, y),∀x, y ∈E, x6=y. In that case, one can takeηn =cnη0, for n≥1, where η0= diam(E) is the diameter ofE.

Moreover let be given a family of continuous non-negative functions{us:s∈S} defined onE such that sup

xE

X

sS

us(x)<+∞.

We define a positive kernelP onE by

P f(x) =X

sS

us(x)f(sx). (5)

This kernel acts on the space of bounded functions onE, on the cone of positive functions and on the coneM+ of positive measures defined on the Borelσ-algebra ofE.

When the family{us:s∈S} satisfies the condition X

sS

us(x) = 1, ∀x∈E, (6)

P is aMarkovianoperator. We can define aMarkov chainwith values inEsuch that, at each step, the transition are possible from a pointy to the pointssy,s∈S, with probabilityus(y).

2.2. Notations

Let C(E) be the space of continuous real or complex functions onE. For every integer k 0 and every function g∈ C(E), we define:

v(g, k) = sup

{(x,y)∈E2:d(x,y)≤ηk}

g(x)−g(y).

We measure theregularityof the family {us, s∈S} by the sequence (w(k,0))k≥0 defined by:

w(k,0) = sup

{(x,y)∈E2:d(x,y)≤ηk}

X

sS

us(x)−us(y),

and its “mean regularity” by the following sequences defined forn≥1:

w(k, n) = sup

{(x,y)∈E2:d(x,y)≤ηk}

X

(s1,...sn)∈Sn

usn(sn−1· · ·s1x). . . us1(x)X

sS

us(sn· · ·s1x)−us(sn· · ·s1y).

(10)

2.3. Inequalities

1) For all natural integersk, n, we have:

w(k, n)≤ kPn1k w(k+n,0)≤ kPn1kX

sS

v(us, k+n).

Note that, when P is a power bounded operator on the space of bounded functions on E (i.e. M = supn≥0 kPn1k<∞), we have:

w(k, n)≤M w(k+n,0), ∀k≥0.

2) Fora,b >0, we have: a−b= 1eln a

b

max{a, b} ≤ln ab a+b

. When the functionsusare strictly positive, we have therefore, fork, n∈N:

X

sS

v(us, n) 2kP1k sup

sS

v(lnus, n), (7)

w(k, n) 2 kPn1k kP1k sup

sS

v(ln us, k+n). (8)

3) For any bounded functionf onE, any integern≥1, we have forx, y in E:

Pnf(x)−Pnf(y) = X

(s1,... ,sn)∈Sn

usn(sn−1· · ·s1x). . . us1(x) f(sn· · ·s1x)−f(sn· · ·s1y)

+ Xn j=2

X

(s1,... ,sj)∈Sj

usj−1(sj−2· · ·s1x). . . us1(x) usj(sj−1· · ·s1x)−usj(sj−1· · ·s1y)

Pnjf (sj· · ·s1y)

+X

s1S

us1(x)−us1(y)

Pn−1f (s1y).

From the last equality, we deduce:

Lemma 2.1. If f is a bounded function onE andk, nnatural integers, we have:

v(Pnf, k)≤ kPn1kv(f, k+n) +

nX−1 j=0

w(k, n−1−j)kPjfk. (9)

2.4. An example

We give now an example to illustrate the different conditions of regularity (see [6] for details). We consider the intervalE= [0,1], an integerq≥1 and a realβ in ]0,1[. Lettbe the application from [0,+∞[ into [0,+∞[

defined by:

∀x∈E, t(x) = x 1 +q xβ· We have,∀x, y∈[0,+∞[,t(x+y)≤t(x) +t(y) and therefore:

t(x)−t(y)≤t(|x−y|)≤ |x−y|. (10) The applicationtsends the interval [0,1] on the interval [0,1+1q].

(11)

LetS be the family of continuous transformations ofE into itself defined by:

S=

tk :x→t(x) + k

1 +q : 0≤k≤q

·

From (10), we have:

∀s1, . . . , sn ∈S, s1· · ·sn x−s1· · ·sn y≤tn(|x−y])≤tn(1).

For the sequence (ηk)k≥0 onE defined byηk =tk(1), the contraction hypothesis (4) is then satisfied.

Let{us:s∈S} be a family of functions such thatP

sSus(x) = 1, ∀x∈E. We assume that there exists a continuous increasing function Φ from [0,1] to [0,1] such that Φ(0) = 0 and

X

sS

|us(x)−us(y)| ≤Φ(|x−y|), ∀x, y∈[0,1].

We have:

w(n,0)Φ ηn

, ∀n∈N.

The sequence (ηn=tn(1))n≥0 decreases to zero and satisfiesηn = (1 +o(1))(n q β)β1. For Φ(x) =xα, with 0< α≤1, the conditionP

k≥0w(k,0)<+∞is satisfied if αβ >1. For Φ(x) =1+|ln1x|α, withα >0, the conditionP

k≥0w(k,0)<+∞is not necessarily satisfied.

The convergence of the seriesP

n≥0w(0, n) can be established under less restrictive conditions:

- for Φ(x) =xα, with 0< α≤1, we haveP

n≥0w(0, n)<+∞;

- for Φ(x) = 1+|ln1x|α, we haveP

n≥0w(0, n)<+∞, forα >1.

3. Convergence of P

kP

n

f k

3.1. Hypothesis

In this section we make the following assumptions:

P

n≥0w(0, n)<+∞, limk↓w(k,0) = 0. (11) P is power bounded:M = supn≥1 kPn1k<+∞. (12) Remark that, by continuity of the weightsus, the second condition in (11) is always satisfied when the family of applicationsS is finite. WhenP is Markovian, equation (12) is clearly satisfied. This is true as well, up to a multiplicative constant, when the weightsus are strictly positive (cf. Lem. 3.4).

We will make use of the following elementary lemma:

Lemma 3.1. If (uk)k≥1 is a sequence of real numbers decreasing to 0, there exists a sequencek)k≥1 such

that: X

k≥0

ϕk = +∞ and X

k≥0

ϕk uk<+∞.

Proof. We may take for instance, for someα∈[1,2[,

ϕk=ukα(uk−uk+1), k 1.

(12)

From the inequalities∀k∈N, w(k, n)≤M w(0, n), it follows that

k→+∞lim X

n≥0

w(k, n) =X

n≥0

k→+∞lim ↓w(k, n) = 0.

Consider a function ϕfrom Nto ]0,+∞[ such that (cf. Lem. 3.1):

X

k≥0

ϕ(k) = +∞ and X

k≥0

ϕ(k) X

n≥0

w(k, n)<+∞.

Notations. Forn, `non negative integers, we set a(`, n) = X

k≥0

ϕ(k)w(k+`, n), (13)

ρ(`) = X

n≥0

a(`, n). (14)

We define semi-norms by setting for a functionf onE:

|f|ϕ,n = X

k≥0

ϕ(k)v(f, k+n), n≥0,

|f|ϕ = |f|ϕ,0=X

k≥0

ϕ(k)v(f, k).

LetBϕ be the subspace ofC(E) defined byBϕ={f ∈C(E) :|f|ϕ<∞}.

By Lemma 2.1, the semi-norms (| |ϕ,n)n≥0 onBϕ satisfy the following inequalities:

∀n≥1, ∀k≥0, |Pnf|ϕ,k≤M|f|ϕ,n+k+

nX−1 j=0

a(k, n−j−1)kPjfk.

The inequalities

∀N∈N, XN k=0

ϕ(k)

!

v(f, N) XN k=0

ϕ(k)v(f, k)≤ |f|ϕ

imply that the set of functions{f ∈C(E) : |f|ϕ+kfk 1} is equicontinuous. By Ascoli–Arzela theorem, this set is relatively compact in (C(E),k k). It is easy to see that this set is closed and therefore is a compact subset of (C(E),k k).

It follows that the operatorP satisfies the hypotheses of Theorem 1.1 and we have the following theorem, whereW1 is the subspace ofC(E) generated by the eigenvectors ofP corresponding to eigenvalues of modulus 1 andW2={f ∈C(E) : limn→+∞kPnfk= 0}.

Theorem 3.2. If (3.1) is satisfied, W1 is finite dimensional and C(E) =W1⊕W2. Moreover, forr≥0, if the condition P

n≥0nr w(0, n)<+ is satisfied, we haveP

n≥0nr kPnfk<+ for allf ∈W2 such thatP

n≥0nr v(f, n)<+∞.

(13)

Proof. Ifh∈C(E) is an eigenvector ofP of modulus 1, then from (9) we have∀k≥0, v(h, k)P

j≥0w(k, j) khkand thereforehbelongs toBϕ for allϕ:N→]0,+∞[ such that

X

k≥0

ϕ(k) = +∞and X

k≥0

ϕ(k)X

j≥0

w(k, j)<∞. (15)

Let f ∈C(E). As lim

n→+∞v(f, n) = 0, we can apply Lemma 3.1, with u(n) = max{P

j≥0w(n, j), v(f, n)}, and choose a function ϕfrom Nto ]0,+∞[ such thatf ∈Bϕ and the conditions (15) are satisfied.

Then the first assertion results from Theorem 1.1.

Letf such thatP

n≥0nrv(f, n)<+∞.

Applying Lemma 3.1 with u(n) = max{P

k≥0w(n, k),P

knkr v(f, k)}, n≥1, we can choose a functionϕ fromNto ]0,+∞[ such that

X

k≥0

ϕ(k) = +∞;X

k≥0

ϕ(k)X

j≥0

w(k, j)<∞and X

k≥0

ϕ(k)X

jk

jr v(f, j)<∞.

From Theorem 1.1, we have then

X

n≥0

nr |Pnf|ϕ+kPnfk

<+∞

and the result follows.

3.2. Peripheral spectrum of P

To apply the previous results, we need information onW1and on the peripheral spectrum ofP. In particular it is important to give conditions which ensure that dim(W1) = 1. We refer to [21] and [6] for a description of the subspaceW1 ofC(E) in terms of ergodic classes for a Markov chain associated toP.

The following notion of proximality is useful to give a criterium for dim(W1) = 1 (cf. [5]). The family of transitions x→sx(allowed ifus(x)>0), defines a “topological Markov chain” on the spaceE. We denote it by (S,(us)sS).

3.3. Definitions

We say that a compact setF ofEisp-invariant(orinvariantforp= 1) if, for allx∈F and all (s1, . . . , sp)

∈Sp such thatusp(sp−1· · ·s1x)· · ·us2(s1x)us1(x)>0, we havesp· · ·s1x∈F.

We say that (S,(us)sS) isp-proximalif any twop-invariant non-empty compact sets intersect. It isstrongly proximalif it isp-proximal for any integerp≥1.

Theorem 3.3. (cf. [6, 21]): if P is Markovian and if (3.1) is satisfied, we have:

i) the eigenvalues of modulus 1 of P are roots of unity. There exists a finite set{E1, . . . , Em} of disjoint invariant compact sets (ergodic classes) such that

Px

lim sup

n→+∞d(Xn, Ej) = 0

; 1≤j≤m

is a basis of the eigenspace of P corresponding to the eigenvalue 1;

ii) each invariant compact set Ej supports a uniqueP-invariant probability measure and splits into a finite number {Cj,1, . . . , Cj,dj} of dj-invariant compact sets (cyclic classes);

(14)

iii) the set of functions



dXj−1

`=0

ω`jPx

lim sup

n→+∞d(Xndj, Cj,`) = 0

; 1≤j≤m, ωj is adj-root of unity



is a basis of W1;

iv) if(S,(us)sS)is strongly proximal, there exists a unique ergodic class (without cyclic subclasses) supporting the unique P-invariant probability measure ν on E and we have, uniformly on E, for all f C(E):

limnPnf =ν(f).

3.4. Existence of an invariant function

In the general case, we can reduce P (by “relativisation”) to a Markovian operator if there exists a strictly positive eigenfunction. The existence of such a function can be shown classically, when the weightsusare>0 (cf. [2, 25]), under a regularity condition which slightly stronger then (11) (in the following lemma P is not supposed to be power bounded):

Lemma 3.4. If the functions us,s∈S, are strictly positive and satisfy the condition X

k≥0

sup

sS

v(lnus, k)<+∞, (16)

the operator P has a strictly positive proper function hsatisfying:

v(lnh, k)≤X

nk

sup

sS

v(lnus, n).

Proof. For every integer k 0, set εk = P

nksupsSv(lnus, n). Consider the cone C of strictly positive continuous functionsfsuch thatv(lnf, k)< εk. Forx0∈E, the sectionC∩{f :f(x0) = 1}is an equicontinuous and bounded set of continuous functions. Therefore, the coneC has a compact base.

This cone is left invariant byP, since we have, for everyx, y∈Esatisfyingd(x, y)≤ηk: P f(y) = X

sS

us(y)f(sy) =X

sS

us(y) us(x)

f(sy)

f(sx) us(x)f(sx)

X

sS

esups∈S v(lnus,k) eεk+1 us(x)f(sx) = eεk P f(x).

This gives the inequality;

v(lnP f, k)≤v(lnf, k+ 1) +w(k). (17)

From Schauder–Tychonov theorem, we deduce the existence of a proper functionhforP in the coneC.

Assuming (16) and the functionsusstrictly positive, lethgiven by the previous lemma such thatP h=λ h.

The conditions (11) and (12) are satisfied byλ−1P (see inequality (8)). The relativised operator is defined by

hP f(x) = 1

λh(x)P(hf)(x).

Références

Documents relatifs

In his paper [T2] Terras obtained a central limit theorem for rotation- invariant random variables on the space of n x n real positive definite (symmetric) matrices in the case n =

The mapping h with c = 1 can be based on a space-filling curve: Wächter and Keller [2008] use a Lebesgue Z-curve and mention others; Gerber and Chopin [2015] use a Hilbert curve

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

Closely linked to these works, we also mention the paper [Log04] which studies the characteristic function of the stationary pdf p for a threshold AR(1) model with noise process

Thus, we do not consider here the decay parameter or the convergence rate of ergodic Markov chains in the usual Hilbert space L 2 (π) which is related to spectral properties of

Proposition 5.1 of Section 5 (which is the main ingredient for proving Theorem 2.1), com- bined with a suitable martingale approximation, can also be used to derive upper bounds for

The quantities g a (i, j), which appear in Theorem 1, involve both the state of the system at time n and the first return time to a fixed state a. We can further analyze them and get

In other words, no optimal rates of convergence in Wasserstein distance are available under moment assumptions, and they seem out of reach if based on current available