In Massopoust's Interpolation and approximation with splines and fractals, one can read this theorem:
Given an hyperbolic IFS $(X,\{f_i:i=1,\ldots,N\})$ and denoting its code space by $\Sigma_N$ and the generated fractal set by $\mathcal{A}$. We have that:
There is a continuous and surjective mapping $\gamma: \Sigma_N \to \mathcal{A}$ given by $\gamma(\sigma) = \lim\limits_{n \to \infty} f_{\sigma(n)}(x)$ where $x$ can be chosen arbitrarily in $X$.
Denoting for $f:X \to X$ by $\overline{f}:H(X) \to H(X)$ the function $\overline{f}(A) = \{f(a):a \in A\}$ where $H()$ is the hyperspace of compact subsets of $X$, the author makes the following remark:
Suppose that $\sigma \in \Sigma_N$ and let $A_{\sigma(n)} = \overline{f}_{\sigma(n)}(A)$ for $A \in H(X)$. Then the above theorem states that $\gamma(\sigma) = \bigcap\limits_{n \in \mathbb{N}} A_{\sigma(n)}$
How can I show this remark is true?
My try
We know that for $A \in H(X)$, we have that $\mathcal{A} = \lim\limits_{n \to \infty} F^n(A) = \lim\limits_{n \to \infty} \bigcup\limits_{i_1,\ldots,i_n = 1}^n \overline{f}_{i_1,\ldots,i_n}(A)$. So one could understand that restricting to a specific code leads to point in $A$. This is what is done above. But why is the intersection non-empty?
Graphically, one can interpret that we are contracting the set $A$ in successive iterations, so at each step in the sequence we are building a decreasing sequence of compact sets. This decreasing sequence will have a non-empty intersection (provided none of the intermediate steps is compact).
I need to still improve this formalization.
Note: I can clarify any doubt on notation you may have. This lecture notes might be useful anyways.