A Weighted König Lemma for Symbolic Dynamics

The Konig Lemma for infinite trees in Graph Theory says that in an infinite rooted tree with all vertices of finite degree, there is an infinite path starting from the root. In this weighted version we shall show that there is an infinite path with weights greater than a certain average. We shall apply our result to infinite compositions of affine mappings in Rn.