Kac’s theorem


Let f:M→M be a transformation and μ a finite invariant measure for f. Let E be a subset of M with positive measureMathworldPlanetmath. We define the first return map for E:

ρE⁢(x)=min⁡{n≥1:fn⁢(x)∈E}

If the set on the right is empty, then we define ρE⁢(x)=∞. The Poincaré recurrence theorem asserts that ρE is finite for almost every x∈R. We define the following sets:

E0={x∈E:fn⁢(x)∉E,n≥1}
E0*={x∈M:fn⁢(x)∉E,n≥0}

By Poincaré recurrence theorem, μ⁢(E0)=0. Kac’s theorem asserts that the function ρE is integrable and

∫EρE⁢𝑑μ=μ⁢(M)-μ⁢(E0*)

When the system is ergodic, then μ⁢(E0*)=0, and Kac’s theorem implies:

1μ⁢(E)⁢∫EρE⁢𝑑μ=μ⁢(M)μ⁢(E)

This equality can be interpreted as: the mean return time to E s inversely proportional to the measure of E.

Title Kac’s theorem
Canonical name KacsTheorem
Date of creation 2014-03-19 22:18:04
Last modified on 2014-03-19 22:18:04
Owner Filipe (28191)
Last modified by Filipe (28191)
Numerical id 4
Author Filipe (28191)
Entry type Theorem
Related topic Poincaré Recurrence theorem