The Ergodic Theorem for a new kind of attractor of a GIFS
Abstract
In 1987, J. H. Elton, has proved the first fundamental result in convergence of IFS, the Elton's Ergodic Theorem. In this work we prove the natural extension of this theorem to the projected Hutchinson measure μα associated to a GIFSpdp S=(X, (φj:Xm X)j=0,1, ..., n-1, (pj)j=0,1, ..., n-1), in a compact metric space (X,d). More precisely, the average along of the trajectories xn(a) of the GIFS, starting in any initial points x0, ..., xm-1 ∈ X satisfies, for any f ∈ C(X , R), N +∞ 1NΣn=0 N-1 f(xn(a)) = ∫X f(t) dμα(t), for almost all a ∈ =\0,1, ..., n-1\N, the symbolic space. Additionally, we give some examples and applications to Chaos Games and Nonautonomous Dynamical Systems defined by finite difference equations.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.