Iteration of Ruelle-Perron-Frobenius Operator/One-Sided Shift Space of Finite Type

Theorem

Let $\struct {X_\mathbf A ^+, \sigma}$ be a one-sided shift of finite type.

Let $\map C {X _\mathbf A ^+}$ be the complex-valued continuous mapping space.

Let $f \in \map C {X _\mathbf A ^+}$.

Let $\LL_f$ be the Ruelle-Perron-Frobenius operator.

For all $w \in \map C {X _\mathbf A ^+}$, $n \in \N$ and $x \in X _\mathbf A ^+$, we have:

$\ds \map {\LL_f^n w} x = \sum_{y \mathop \in \map {\sigma^{-n} } x} e^{\map {f_n} y} \map w y $

where

$f_n := f + f \circ \sigma + \cdots + f \circ \sigma ^{n-1}$

$\map {\sigma ^{-n} } x$ denotes the preimage of $x$ under $\sigma^n$, i.e.:

$\map {\sigma^{-n} } x = \set {\sequence {i_1, i_2, \ldots , i_n, x_0, x_1, \ldots} : \map {\mathbf A} {i_1, i_2} = \cdots = \map {\mathbf A} {i_{n-1}, i_n} = \map {\mathbf A} {i_n, x_0} = 1}$

Proof

This theorem requires a proof. You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.