124 D. Papini - F. ZanolinFigure 8: (taken from [60]). Example of oriented cells ˜R (white) and ψ(˜R) (light color)with crossings into three slabs (darker color). The [ ·] − -sets are indicated with a boldline. Among the five cells which are the connected components of the intersectionψ(R) ∩ R, only the three painted with darker color are suitable to play the role of theM’s for the application of Theorem 2.Now, given three oriented rectangles (cells) in X, which are denoted by  = (A,A − ),̂B = (B,B − ) and ̂M = (M,M − ), we say that ̂B crosses  in ̂M and writêM ∈ { ⋔ ̂B},if̂M ⊆ h  and ̂M ⊆ v ̂B.The symbol ⋔ is borrowed from the case of transversal intersections, however we pointout that in our situation (although confined to sets which are two-dimensional in nature)we don’t need any smoothness assumption. In fact, our setting is that of topologicalspaces. From the above definitions and by Theorem 1 the following result easily follows.THEOREM 2. Let  = (A,A − ) and ̂B = (B,B − ) be oriented cells in X. If(D,K,ψ) : Â⊳̂B and there is an oriented cell ̂M such that ̂M ∈ { ⋔ ̂B}, thenthere exists w ∈ K ∩ M such that ψ(w) = w.A situation like that depicted in Figure 8 in which we have more than one goodintersection between the domain and the image of a homeomorphism is typical of thehorseshoe maps and thus, as a next step, we can look for the existence of a completedynamics on m symbols, where m ≥ 2 is the number of the crossings. With thisrespect, we have to recall that a very general topological theory has been developed in
Periodic points and chaotic dynamics 125the recent years by Kennedy, Yorke and their collaborators in a series of fundamentalpapers in this area (see [33, 35, 36, 37, 38]). Our goal instead is to take advantage ofour simplified framework in which we consider only sets which are homeomorphic toa square and prove the existence of periodic points of any order. To this aim, we haveto apply Theorem 1 to the iterates of the map ψ and select carefully some subset ofthe domain D in order to find “true” periodic points (for instance those with a longminimal period). First, however, we need a further definition, taken from [39].We say that ψ : X ⊇ D ψ → X has a chaotic dynamics of coin-tossing typeon k symbols if k ≥ 2 and there is a metrizable space Z ⊆ X and k pairwise disjointcompact sets W 1 ,... , W k ⊆ Z ∩ D ψ such that, for each two-sided sequence (s n ) n∈Zwiths n ∈ {1,...,k}, ∀ n ∈ Z,there is a sequence of points (z n ) n∈Z withz n ∈ W sn and z n+1 = ψ(z n ), ∀ n ∈ Z.In other words, any possible itinerary on the sets W 1 ..., W k is followed by somepoint.As an auxiliary tool in order to obtain at the same time the existence of suchkind of chaotic trajectories and also the fact that all the periodic itineraries can befollowed by some periodic point, we have the following theorem (see [59]), which isalso reminiscent of some results in [34] and [73].THEOREM 3. Assume that there is a (double) sequence of oriented rectangles( k ) k∈Z and maps ((D k ,ψ k )) k∈Z , with D k ⊆ A k , such that (D k ,ψ k ) :  k ⊳ k+1for each k ∈ Z. Then the following conclusions hold:(a 1 ) There is a sequence (w k ) k∈Z with w k ∈ D k and ψ k (w k ) = w k+1 for all k ∈ Z;(a 2 ) For each j ∈ Z there is a compact and connected set C j ⊆ D j satisfyingC j ∩ (A j ) + b ̸= ∅, C j ∩ (A j ) + t ̸= ∅and such that for each w ∈ C j there is a sequence (y l ) l≥ j , with y l ∈ D l andy j = w, y l+1 = ψ l (y l ) for each l ≥ j;(a 3 ) If there are integers h, k with h < k such that  h =  k , then there is a finitesequence (z i ) h≤i≤k , with z i ∈ D i and ψ i (z i ) = z i+1 for each i = h,...,k − 1,such that z h = z k , that is, z h is a fixed point of ψ k−1 ◦ ··· ◦ ψ h .The proof of (a 1 ) and partially also that of (a 2 ) could be given by adapting toour setting the argument in [33, Lemma 3 and Proposition 5]. As to (a 3 ), we applyTheorem 1. The existence of the continuum (compact connected set) C j in (a 2 ) is abyproduct of the topological lemma that we employ also in the proof of Theorem 1.We give all the main details along the proof of Theorem 11 in Section 3.2 and refer to[59] for more information.