23.11.2012 Views

Discrete Holomorphic Local Dynamical Systems

Discrete Holomorphic Local Dynamical Systems

Discrete Holomorphic Local Dynamical Systems

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Dynamics in Several Complex variables 209<br />

for n ≥ 0, ϕ in L p (μ) and ψ d.s.h. Moreover, for 0 ≤ ν ≤ 2 there is a constant c > 0<br />

such that<br />

|〈μ,(ϕ ◦ f n )ψ〉−〈μ,ϕ〉〈μ,ψ〉| ≤ cd −nν/2 �ϕ� L p (μ)�ψ�C ν<br />

for n ≥ 0, ϕ in L p (μ) and ψ of class C ν .<br />

Proof. We prove the first assertion. Observe that the correlations<br />

In(ϕ,ψ) := |〈μ,(ϕ ◦ f n )ψ〉−〈μ,ϕ〉〈μ,ψ〉|<br />

vanish if ψ is constant. Therefore, we can assume that 〈μ,ψ〉 = 0. In which case,<br />

we have<br />

In(ϕ,ψ)=|〈μ,ϕΛ n (ψ)〉|,<br />

where Λ denotes the Perron-Frobenius operator associated to f .<br />

We can also assume that �ψ�DSH ≤ 1. Corollary 1.41 implies that for 1 ≤ q < ∞,<br />

�Λ n (ψ)� L q (μ) ≤ cqd −n<br />

where c > 0 is a constant independent of n,q and ψ. Now,ifq is chosen so that<br />

p −1 + q −1 = 1, we obtain using Hölder’s inequality that<br />

In(ϕ,ψ) ≤�ϕ� L p (μ)�Λ n (ψ)� L q (μ) ≤ cq�ϕ� L p (μ)d −n .<br />

This completes the proof of the first assertion. The second assertion is proved in the<br />

same way using Corollary 1.42. ⊓⊔<br />

Observe that the above estimates imply that for ψ smooth<br />

lim<br />

sup<br />

n→∞<br />

�ϕ�<br />

L2 ≤1<br />

(μ)<br />

In(ϕ,ψ)=0.<br />

Since smooth functions are dense in L 2 (μ), the convergence holds for every ψ in<br />

L 2 (μ) and gives another proof of the K-mixing. The following result [DNS] gives<br />

estimates for the exponential mixing of any order. It can be extended to Hölder<br />

continuous observables using the second assertion in Theorem 1.83.<br />

Theorem 1.84. Let f , d, μ be as in Theorem 1.83 and r ≥ 1 an integer. Then there<br />

is a constant c > 0 such that<br />

�<br />

�<br />

�〈μ,ψ0(ψ1 ◦ f n1 )...(ψr ◦ f nr )〉−<br />

r<br />

∏<br />

i=0<br />

�<br />

�<br />

〈μ,ψi〉 � ≤ cd<br />

for 0 = n0 ≤ n1 ≤···≤nr,n:= min0≤i

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!