Developments in fractal geometry
- 2.8k Downloads
Iterated function systems have been at the heart of fractal geometry almost from its origins. The purpose of this expository article is to discuss new research trends that are at the core of the theory of iterated function systems (IFSs). The focus is on geometrically simple systems with finitely many maps, such as affine, projective and Möbius IFSs. There is an emphasis on topological and dynamical systems aspects. Particular topics include the role of contractive functions on the existence of an attractor (of an IFS), chaos game orbits for approximating an attractor, a phase transition to an attractor depending on the joint spectral radius, the classification of attractors according to fibres and according to overlap, the kneading invariant of an attractor, the Mandelbrot set of a family of IFSs, fractal transformations between pairs of attractors, tilings by copies of an attractor, a generalization of analytic continuation to fractal functions, and attractor–repeller pairs and the Conley “landscape picture” for an IFS.
KeywordsFractal Iterated function system
Mathematics Subject Classification (1991)28A80
Metric spaces such as Euclidean space, the sphere, and projective space possess rich families of simple geometrical transformations . Examples are affine transformations of Euclidean space, Möbius and quadratic conformal mappings on the sphere, and projective transformations on projective space. The space and the mappings are simple to describe explicitly, and they are smooth.
Following the publication in 1983 of Benoit Mandelbrot’s book The Fractal Geometry of Nature , there has been a steadily increasing interest in the use of non-differentiable structures to model diverse natural objects and processes. In  H. Furstenberg observes that fractals have fundamentally changed the way that geometers look at space. For some, there has been a shift in viewpoint, away from the study of smooth structures such as differentiable manifolds to the study of rough non-differentiable objects such as fractal attractors of smooth dynamical systems. The rough objects are described in terms of the smooth systems that generate them. A key example is an attractor described in terms of the IFS that generates it. Questions regarding the topology (connectedness for example), geometry (Hausdorff dimension for example), invariant measures and other properties of the fractal objects are investigated, to reveal their relationships to the smooth objects that generate them.
Using these relationships, fractal objects can be used to model or approximate rough real-world data, from stock-market traces to turbulent wakes and cloud boundaries. In physics, for example, fractal geometry has played a role in mapping the seabed and in modelling the effect of the rough surfaces of small particles on heat absorption by the atmosphere . In engineering, fractal modelling has been successfully applied to image compression . In multimedia, fractal modelling can be used for real-time image synthesis . There are many more such examples, see .
Some fractal objects are self-referential. A self-referential object is a set or measure that can be defined in terms of a finite collection of geometrical transformations applied to . For example, an attractor of is self-referential since . According to a definition by Mandelbrot [87, p. 15], a fractal is a set for which the Hausdorff–Besicovitch dimension strictly exceeds the topological dimension. Note, however, that the attractor of an IFS may not have this property and may, in fact, be a classical geometric object such as a line segment or polygon.
Although fractals receive considerable current attention, they are a newcomer to the history of geometry and to the task of describing physical objects. Fractal geometry is an area of mathematics that is under construction. In his much cited 1981 paper , John Hutchinson formulated the concept of a contractive iterated function system, although not with that name, to unify and make rigorous, using geometric measure theory, some of the key ideas in Mandelbrot’s book . Related precursors to the concept of an attractor of a contractive system can be found, for example, in the work of Nadler  and Williams , and ideas concerning associated invariant measures can be found in [52, 99].
This paper is a survey of some recent trends in the subject of iterated function systems. The focus is two-fold. First, to emphasize new structural properties of affine, projective, analytic, and even more general non-conformal IFSs, adding to older publications concentrating on similitude and conformal IFSs. Second, to concentrate on the core of the subject—the role of contractivity on the existence of an attractor, addressing the points of an attractor, transformations between attractors, dynamical properties of an IFS, and tilings by copies of an attractor. Although these notions are at the historical foundation of the subject, new and exciting concepts, such as phase transition and fractal continuation, have recently come to light.
Section 2 provides definitions and notation associated with an IFS and its attractors. Examples of similitude, affine, projective and Möbius IFSs are given. Some concepts, such as an attractor–repeller pair, are introduced informally in this section, but are defined formally in later sections. The definition of an attractor of an IFS that is used in this review is in keeping with recent work in the area, and is a generalization of the concept for contractive systems.
In Sect. 3 the notion of a contractive IFS is defined, followed by Hutchinson’s theorem stating that a contractive IFS has a unique attractor. This theorem can be viewed as a generalization of Banach’s contraction mapping theorem, generalizing from the existence of an attractive fixed point of a single function to the existence of an attractor of a finite set of functions. It is known, under quite general conditions, that if a transformation on a metrizable space possesses a unique fixed point, then there exists a metric with respect to which the transformation is contractive. When does an analogous situation hold for an IFS with a unique attractor? Recent work has shown that contractivity is a necessary condition for the existence of an attractor for some basic types of IFSs, such as affine, projective and Möbius IFSs.
Section 4 contains recent advances concerning the applicability of the chaos game, one of two main algorithms for drawing an accurate approximation to an attractor of an IFS. The two approaches are the deterministic algorithm (illustrated in Fig. 2) and the more efficient chaos game algorithm . It has recently been proved that the chaos game algorithm converges to the attractor under general conditions.
The joint spectral radius of the linear parts of an affine IFS plays a crucial role in determining whether or not possesses an attractor. This role is explained in Sect. 5. Considering as a parameter, for linear IFSs there is a dramatic phase transition at the precise value of at which the IFS changes from not having an attractor to having a trivial attractor. The fractal figure that emerges at this phase transition is the main subject of Sect. 5.
For an IFS consisting of functions, strings in the alphabet can be associated with points in an attractor of the IFS. This leads to the topic of addresses and coordinate and coding maps, which are the subject of Sect. 6. Mentioned in Sect. 6.1 is Kieninger’s classification of attractors according to their fibres and Kameyama’s fundamental question: When does the existence of a coding map ensure the existence of a contractive metric? In Sect. 6.2 we define the recently introduced notion of a section of a coordinate map, whereby each point on an attractor is assigned a unique address. Sections of coordinate maps play a key role in the construction of transformations between attractors, which is the subject of Sect. 9.
In Sect. 7, attractors of IFSs are classified according to how the images of the attractor, under the functions of the IFS, overlap. This leads to the notion of the kneading invariant and what it implies regarding the topology of an attractor.
The subject of Sect. 8 is the Mandelbrot set of a certain affine family of IFSs, an analog to the classical Mandelbrot set for . The Mandelbrot set is the set of those for which possesses a connected attractor.
While properties of classical geometrical transformations (for example affine, conformal, projective) are well known, much less is known about their rough counterparts (for example affine, conformal, and projective fractal transformations). Transformation between fractals is discussed in Sect. 9.
Tilings of the plane, and more generally Euclidean space, have been constructed from attractors of an IFS since the 1980s. Section 10 provides a new and unified approach to such tiling—generating both the classical self-similar IFS tilings and new tilings.
Fractal functions, introduced in the form considered here in 1986, have applications ranging from image compression to modeling brain waves. Fractal continuation of such functions, an analog to classical analytic continuation, is the subject of Sect. 11.
Based on the work of Conley on the dynamics of a single function and on the work of McGehee and Wiandt on iterated closed relations, a generalization of the notion of an attractor of an IFS is given in Sect. 12. This leads to the existence of attractor–repeller pairs, a characterization of the set of chain recurrent points of an IFS in terms of such pairs, and a “landscape picture” for an IFS.
This paper is not intended to be exhaustive. Many fascinating topics are omitted, and there is likely a bias towards the interests of the authors. In particular, “random fractals”, “statistically self-similar measures”, and related probabilistic entities are not discussed; our interest is in deterministic fractal geometry, where the information needed to describe the fractal object is low, and the geometrical complexity may appear to be high. Another topic not discussed is -variable fractals and superfractals [16, 26, 27, 28]. These entities serve several purposes; they provide a bridge between deterministic fractal geometry and random fractal geometry, and they enable the construction of rich simple geometrical families of fractal objects. Fractal dimensions are only touched on in this survey because there is already an ample literature of the subject.
2 IFSs and their attractors, basins, and dual repellers
In this section we define and provide examples of some fundamental notions. In so doing we introduce the concept of an attractor–repeller pair that is explained in more detail in Sect. 12, which deals with Conley’s “landscape picture” for an IFS.
An iterated function system (IFS) is a topological space together with a finite set of continuous functions .
there is an open set such that and for all with , where the limit is with respect to the Hausdorff metric on .
We remark that, since is a complete metric space, we have is continuous (w.r.t. the Hausdorff metric) see . So (1) in Definition 2.2 is superfluous. But we include (1) because it is key in more general settings, such as the one considered in Sect. 12.
The basin of an attractor of the IFS is the largest open set such that (2) in Definition 2.2 is true.
The dual repeller of an attractor of the IFS is the set where is the basin of .
Examples of attractors and their dual repellers appear below. The notion of a dual repeller arises as follows.
Under reasonable conditions described in Sect. 12, an attractor of is a dual repeller of an attractor of .
If and the functions in are affine functions of the form , where is an matrix and , then is called an affine IFS. If the functions of are similitudes (i.e. affine with where is orthogonal and ,) then is called a similitude IFS.
3 Contractive IFSs
Contractivity is not integral to the existence of an attractor.
Contractivity is integral to the existence of an attractor for affine, Möbius, and many projective IFSs.
The following theorem is a generalization of the Banach contraction mapping theorem, from one function to finitely many functions.
(Hutchinson) If is a contractive IFS on a nonempty complete metric space , then has a unique attractor and the basin of is .
There are various versions of a converse to Banach’s fixed point theorem in the literature, for example [44, 55, 67, 80]. However, the converse to Hutchinson’s theorem is false. There exist non-contractive IFSs that have a unique attractor; for example, the IFS in (2.2) has a unique attractor , but there is no metric on any complete neighborhood of , generating the same topology as that of restricted to , such that restricted to is contractive.
Theorem 3.4 below addresses the role of contractivity, not only in the affine case, but also in the projective and Möbius cases. For a proof of the theorem, see  for the affine case,  for the projective case, and  for the Möbius case. The proof of the uniqueness result, Theorem 3.3, can also be found there. In the projective case, recall that a hyperplane in -dimensional real projective space is an -dimensional subspace. A set is said to avoid a hyperplane if . In the Möbius case, recall that the extended complex plane is essentially equivalent to the Riemann sphere via stereographic projection. For the Möbius case, the metric is the round metric on the sphere. Throughout, if then and denote, respectively, the closure and the interior of .
An affine, Möbius, or projective IFS can have at most one attractor.
An affine IFS has an attractor if and only is contractive.
A Möbius IFS has an attractor if and only there is a nonempty open set such that and restricted to is contractive.
A projective IFS has an attractor that avoids some hyperplane if and only if there is a nonempty open set such that is contractive on .
The attractor of the IFS (2.2) is a union of hyperplanes (lines). Since the intersection of two lines in the projective plane is nonempty, the attractor avoids no hyperplane, and, by Remark 1, this shows that the condition in part (3) of Theorem 3.4 cannot be removed.
An IFS is said to be topologically contractive on a compact set if
An affine IFS has a attractor if and only is topologically contractive on some convex body.
A Möbius IFS on has an attractor if and only if is topologically contractive on some nonempty proper compact subset of .
A projective IFS has an attractor that avoids some hyperplane if and only if is topologically contractive on the union of a nonempty finite set of disjoint convex bodies.
4 Chaos game
Although condition (2) in Definition 2.2 can be used as the basis of an algorithm to draw arbitrarily accurate approximations to an attractor of an IFS, such a method is inefficient because the number of computations grows exponentially with . Also, it is necessary to have, a priori, an initial set that lies in the basin of the attractor, to initiate the iterative construction. More efficient is the chaos game algorithm, in which the attractor is approximated by a chaos game orbit. This has the benefits of low memory usage and more freedom in the choice of an initial set of the form .
Throughout this paper, the following notation is used. Let , and let denote the set of infinite strings on the alphabet .
An instructive example is provided by the IFS where is a circle, is an irrational rotation and is the identity. This IFS has unique attractor with basin . Let , and compute a chaos game orbit by tossing a coin at each step. As gets large the orbit approaches with probability one.
Theorems 4.2 and 4.3 below tell us how chaos game orbits reveal attractors under very general conditions. It is at first sight surprising that it was successfully used, for example, to calculate images of attractors of non-contractive IFSs such as the one in Fig. 7. Indeed, there is no contractivity assumption in either Theorem 4.2 or 4.3. The proof of Theorem 4.2 appears in . A metric space is proper if every closed ball is compact. Note that neither Definition 4.1 nor the following theorems say anything about convergence rates.
Let be a proper complete metric space and an IFS with attractor and basin . If is a random orbit of under , then with probability one this random orbit yields .
A deterministic version of Theorem 4.2 appears in [29, 31] and is stated as Theorem 4.3. A string is disjunctive if every finite string is a substring of . By a substring of we mean a string of the form for integers . In fact, if is disjunctive, then every finite string appears as a substring of infinitely many times. For example, the binary Champernowne sequence, formed by concatenating all finite binary strings in lexicographic order, is disjunctive. There are infinitely many disjunctive sequences if . Moreover, the set of disjunctive sequences is large in the sense that its complement in the natural metric space defined on is a meager set and even a -porous set. The metric space is defined formally at the beginning of Section 6. A meager set is a set of the first Baire category; the definition of -porous can be found in [93, 127] and results using porosity in fractal geometry in [46, 83]. The definition of a strongly-fibred attractor is given in Sect. 6, following Theorem 6.2.
Let be a complete metric space and an IFS with strongly-fibred attractor and basin . If and is a chaos game orbit of with respect to a disjunctive sequence, then this chaos game orbit yields .
Under certain additional conditions (see ), the initial point of the chaos game orbit is not restricted to lie in the basin of . There is a set whose complement is -porous and if , then the conclusion of Theorem 4.3 remains true.
5 Phase transition
Affine IFSs are basic to deterministic fractal geometry, perhaps because the first approximation to a non-linear map is affine, and because affine transformations, after similitudes, form a relatively simple group. Here we consider a family of affine IFSs depending on a parameter. The existence or non-existence of an attractor depends on the value of the parameter. As pointed out in Sect. 3, affine IFSs behave nicely in some ways; in particular, an affine IFS has a unique attractor if and only if is contractive. But there is an equivalent necessary and sufficient condition for to possess an attractor, a condition involving the positive real parameter called the joint spectral radius of . A dramatic geometric transition occurs at the precise value of where the IFS changes from having an attractor to not having an attractor.
5.1 Joint spectral radius
The joint spectral radius is independent of the particular norm.
For an IFS consisting of a single linear map , the generalized spectral radius is the ordinary spectral radius of , the maximum of the moduli of the eigenvalues of .
For any real we have and .
If is bounded, then the joint spectral radius equals the generalized spectral radius.
A set of linear maps is called reducible if these linear maps have a common nontrivial invariant subspace. The set is irreducible if it is not reducible. An affine IFS is reducible (irreducible) if the set of linear parts is reducible (irreducible).
An IFS, consisting of finitely or infinitely many affine functions, is compact if the set of matrices that represent the functions is compact as a subset .
The following theorem is proved in .
A compact affine IFS on has an attractor if and only if . Moreover, if , then the attractor is unique and the basin is ; if and is irreducible, then there does not exist a nonempty bounded set such that .
Theorem 5.4 states that is the transition value between having and not having an attractor. This transition is especially dramatic in the case of a linear IFS. Let be a linear IFS, an IFS all of whose functions are linear. In this case, if , then has a unique attractor , the origin. We say, in this case, that the attractor is trivial. If, on the other hand, , then by Theorem 5.4, the IFS has no attractor, in fact no invariant set, i.e., no set such that . What is surprising is that, at the transition value between the trivial invariant set and no invariant set, there is a geometric “blowup”, a non-trivial invariant set. This is the content of the following theorem .
A compact, irreducible, linear IFS with has a compact invariant set that is centrally symmetric, star-shaped, and full dimensional.
The theory outlined above can be reformulated as an analog to the eigenvalue problem in linear algebra.
When consists of a single linear function , an eigenvalue-eigenvector pair of satisfies the eigen-equation. Even for a single linear function, however, there are more interesting eigenvalue-eigenset pairs. For example, let be a linear map with no nontrivial invariant subspace, equivalently no real eigenvalue. Although has no real eigenvalue, does have an eigen-ellipse, an ellipse , centered at the origin, such that , for some real . Although easy to prove, the existence of an eigen-ellipse is not universally known.
A compact, irreducible, linear IFS has exactly one eigenvalue which is equal to the joint spectral radius of . There is a corresponding eigenset that is centrally symmetric, star-shaped, and full dimensional.
Theorem 5.7 cannot be extended to affine IFSs. It is true that, for a compact, irreducible, affine IFS, a real number is an eigenvalue if and is not an eigenvalue if . However, if is not linear, there are examples where is an eigenvalue and examples where it is not.
6 Fibres and addresses
6.1 Coordinate maps and coding maps
If is a singleton for all , then is said to be point-fibred (w.r.t. ).
If is contractive, then its attractor is point-fibred.
The coordinate map interacts with the shift map on code space. The shift map is defined by , and the inverse shift map is defined by for . Both and are continuous. A subset is called shift invariant if .
The following theorem is a simplified version of some results of Kieninger [71, Lemma 4.6.6 and Propositions 4.2.10 and 4.3.22].
This leads to the following definition.
If is a point-fibred attractor for then is a coding map for with . A point-fibred attractor is a topological self-similar set. In Definition 6.4 the nomenclature “topologically self-similar set” comes from the work of Kigami  and Kameyama , mainly in the context of analysis on fractals; it refers to the readily proved fact that is invariant for , i.e. .
Definition 6.4 leads to Kameyama’s Fundamental Question : Can a topological self-similar set be associated with a contractive IFS? This question can be reformulated: if is a coding map for an IFS on a complete metric space , then is , restricted to , contractive?
To prove that the answer to his question is “no”, Kameyama constructs an IFS where and the metric space is defined abstractly in terms of the code space . Kameyama’s IFS is non-geometrical, and his question remains open when and the transformations are geometrically simple, as described in the introduction. But for affine IFSs the answer is “yes”. Indeed, it is quite surprising that for an affine IFS, contractivity is assured solely by the existence of a coding map .
If is an affine IFS with a coding map , then is contractive when restricted to the affine hull of . In particular, if contains a non-empty open subset of , then is contractive on .
The affine hull of a subset of is the smallest affine subspace containing .
6.2 Sections of coordinate maps
If is point-fibred, then the coordinate map assigns a point in the attractor of to each infinite string. It would be convenient if, for an IFS with point fibred attractor , we had a map in the direction opposite to that of the coordinate map, assigning to each point a string in . Since the coordinate map need not be injective, the following definition is useful, for example in the construction of fractal transformations, discussed in Sect. 9.
A section of a coordinate map is a map such that is the identity. For , the string is referred to as the address of with respect to the section . The set is called the address space of the section . The section is called shift invariant when is shift invariant.
Properties of sections of coordinate maps are discussed in [21, Section 3].
Let where and . In this case the IFS possesses a unique attractor, the real interval . For , the “binary decimal expansion map” is a coding map. Note that . There are two shift invariant section maps. One is the map that sends each point of to its binary decimal expansion that contains no infinite string of consecutive zeros. The other is the map that sends each point of to its binary expansion that contains no infinite string of consecutive ones.
7 Classification of attractors
7.1 Set of overlap
In this section the attractor of an IFS is classified according to how the sets intersect. Throughout we assume that the functions are pairwise distinct when restricted to an attractor under discussion.
is non-overlapping or disjoint(w.r.t. ) if ;
is overlapping (w.r.t. ) if ;
is slightly overlapping or just-touching (w.r.t. ) if it is not disjoint and the interior of (w.r.t. the subspace topology on ) is empty;
is strongly overlapping (w.r.t. ) if it is overlapping but not slightly overlapping, i.e. if the interior of (w.r.t the subspace topology on ) is nonempty;
obeys the open set condition (w.r.t. ) if there is a nonempty open set in the basin of such that and whenever , ;
is post-critically finite (w.r.t. ) if it is connected, is a contractive similitude IFS, and is a finite set;
is finitely ramified if comprises finitely many distinct points.
When the meaning is clear from the context we omit the caveat “w.r.t. ”. The terminology in Definition 7.1 mainly follows Kieninger  and Kigami [72, 73]. Note that Strichartz  uses a less general definition of post-critically finite.
Next, some properties of attractors with each of the properties in Definition 7.1, and some relationships between these properties, are briefly outlined. For ease of exposition, it is assumed that is contractive.
If is disjoint, then it is totally disconnected. If is a disjoint attractor of an injective IFS with , then it is perfect and it is homeomorphic to the classical Cantor set (where the relative topologies are understood). In this case the coordinate map is a homeomorphism. The green spiral Cantor set in Fig. 3 illustrates a totally disconnected attractor (of an inverse IFS).
Recently, the relationship between the open set condition, the property of being p.c.f., the property of being finitely ramified, and other separation conditions, have been explored in the general setting of graph-directed IFSs ; see [51, 96].
Strongly overlapping point-fibred systems are related to -transformations , Bernoulli convolutions, and coding theory, areas which attract current attention; see for example [7, 64]. They are also related to fractal transformations as discussed in Sect. 9.
7.2 Kneading invariant
The topology of a point-fibred attractor is determined by the address structure of its critical set, a set related to the set of overlap. The definition of the critical set and the related address structure, called the kneading invariant, are defined below. The theory of kneading invariants developed from the study of the orbit of the critical point under an iterated unimodal map, by Collet and Eckman , in connection with dynamical systems and chaotic dynamics, and later substantially extended by Milnor and Thurston .
Bandt and Keller  initiated a systematic study of the topology of contractive IFS attractors based on the code space structure of the set of overlap. Here we adapt the more recent development by Kameyama  . If is a set with finitely many distinct elements then is the number of distinct elements in ; if has infinitely many distinct elements then .
From the continuity of the coordinate map in the point-fibred case, it follows that a point-fibred attractor is homeomorphic to the quotient space where if . Conversely, the equivalence relation derived from a set determines an “IFS” , but the space may not be a Hausdorff space and hence not metrizable. (If it is Hausdorff then it is metrizable with a metric constructed using the coding map.) Theorem 7.3 below tells us how the structure of is determined by the structure of the kneading invariant . It does so by characterizing the addresses of a point such that . We use the following notation: if for some and , then and , and .
If and , then there uniquely exists and for some such that .
If , for some and , then . Moreover if , then and .
Theorem 7.4, a simplified version of a theorem of Kameyama , provides sufficient conditions under which the kneading invariant determines a canonical quotient space which is homeomorphic to the given attractor.
Conversely to Theorem 7.3, suppose that has the property (ii) in Theorem 7.3 and for each . Define an equivalence relation on by if either or for some , for some for some . Let be the quotient space and let be the projection. Then there exist continuous maps for such that the diagram (6.3), with , commutes. If the critical set is finite and is compact for each , then is an IFS with point-fibred attractor and kneading invariant .
8 Mandelbrot set for pairs of linear maps
Given a family of contractive IFSs, each consisting of a pair of similitudes that depend on a single parameter , the set of points in parameter space such that the attractor of is connected has emerged over the last twenty years as an area of interest. The set , called a Mandelbrot set, is the topic of this section.
If is a contractive IFS with attractor , then is connected if and only if, for any , there exists a sequence such that for any . Also, if is connected, then it is locally connected; see for example [73, Proposition 1.6.4].
The observation (8.3) was made by Bousch , who used it to show that is both connected and locally connected. (Douady and Hubbard  proved the connectivity of the classical Mandelbrot set . Their conjecture, made in 1982, that is locally connected, remains open.) The equivalence (8.3) was also used by Bandt  as the basis of a fast algorithm for the computation of high resolution pictures of . This revealed surprising features and led to interesting questions and conjectures concerning the geometry and topology of . For example, Bandt noted that the complement of splits into many components and that is not the closure of its interior; and he conjectured that is the closure of its interior. Bandt also noted a relationship between and Bernoulli convolutions, reviewed in . Bandt’s ideas were further developed by Solomyak and Xu , who made progress on Bandt’s conjecture and studied properties of complex analogues of Bernoulli convolutions. Loci of connectedness of attractors of IFSs continues to be an active area of research; see for example .
9 Fractal transformations
A fractal transformation is defined in terms of a coordinate map, discussed in Sect. 6.1, and a section of a coordinate map, discussed in Sect. 6.2. Here it is assumed that all IFSs are point-fibred so that each possesses a coordinate map, as given by Eq. 6.2. Given two point-fibred IFSs and with respective attractors and , a fractal transformation is basically a function that sends a point in to the point in with the same address. More precisely, assume that and have the same number of functions, and let and be the respective coordinate maps.
The commuting diagram means that the homeomorphism takes each point with address to the point with the same address . Two basic questions are (1) given an IFS, how to construct a shift invariant section, and (2) when is a fractal transformation a homeomorphism.
An IFS is said to be injective if the map is injective, for .
We consider the first question in the case that is an injective IFS.
The following theorem provides an answer to the first question posed above; it states that any shift invariant section is constructed from a mask.
If is a mask, then is a shift invariant section of .
If is a shift invariant section of , then for some mask .
Question (2) involves establishing conditions under which and have related kneading invariants; see the discussion following Theorem 7.4. In the following subsection we consider two geometrically simple types of IFS, for which interesting families of fractal transformations can be established.
9.1 Bi-affine IFSs on
A bi-affine function from to is more general than an affine function but less general than a quadratic function.
horizontal and vertical lines are taken to lines, and
proportions along horizontal and vertical lines are preserved.
Let be a non-degenerate bi-affine function such that is a convex quadrilateral . If there is an , such that (1) each side of has length less than or equal to , (2) each diagonal has length less than or equal to , and (3) the vector sum of any two incident sides has length less or equal to , then is a contraction on .
Attention is now restricted to the case of a non-degenerate bi-affine function taking into itself. For such a bi-affine function, the conditions in Theorem 9.8 are not too restrictive. The intention is to form an IFS consisting of such functions, which must, according to Theorem 3.4, have a unique attractor. Given two such bi-affine IFSs with the same number of functions, fractal transformations, such as those illustrated in Fig. 11, can be produced as described below.
Next let be the tops mask for . Explicitly, is the closed quadrilateral , is the open quadrilateral together with the segments , is the open quadrilateral together with the segments , and is the open quadrilateral together with the segments .
Now consider a second bi-affine IFS of the same type with points replacing , and with mask defined exactly as it was for . The masks and induce shift invariant sections and , respectively, as guaranteed by Theorem 9.6.
For the pair of IFS described above, the maps and its inverse are homeomorphisms.
9.2 Three dimensional tri-affine fractal homeomorphisms
9.3 Special overlapping IFSs
The bi-affine and tri-affine IFSs described above are non-overlapping, in the sense that if is the attractor of the IFS , then for all distinct . To determine whether a strongly overlapping IFS (in the sense of Definition 7.1d) fractal transformation is a homeomorphism is, in general, difficult. In this section a criterion is provided for a simple family of overlapping IFSs.
The following theorem  states that, for two special overlapping IFSs, whether or not a fractal transformation is a homeomorphism depends only on these two critical itineraries.
Given two special overlapping masked IFSs and with respective mask points and , coordinate maps and , sections and , and critical itineraries and , the fractal transformations and are homeomorphisms if and only if and .
10 IFS tiling
Computer generated drawings of tilings of the plane by self-similar figures appear in papers beginning in the 1980s and 1990s, for example the lattice tiling of the plane by copies of the twindragon. Tilings constructed from an IFS often possess global symmetry and self-replicating properties. Research on such tilings include the work of Bandt, Gelbrich, Gröchenig, Hass, Kenyon, Lagarias, Madych, Radin, Solomyak, Strichartz, Thurston, Vince, and Wang and the more recent work of Akiyama and Lau; see for example [3, 5, 58, 59, 60, 70, 75, 78, 104, 113, 116, 119, 122] and the list of references in . Even aperiodic tilings can be put into the IFS context; see for example the fractal version of the Penrose tilings .
The use of the inverses of the IFS functions in the study of tilings is well-established, in particular in many of the references cited above. However, in this section we introduce a simple and yet unifying technique for constructing both the classical and new IFS tilings. Theorems 10.4 and 10.5 show that the resulting tiling very often covers the entire basin of the attractor. In the case of tilings of Euclidean space, the basin is the entire Euclidean space.
Under certain, not too restrictive conditions on , conditions given in Theorem 10.4, tiles the entire basin of the attractor .
The IFS where and has attractor . The tiling is the tiling of by unit intervals. The tiling is the tiling of by unit intervals. If , then tiles by unit intervals.
A string is periodic of period if for all . Recall from Sect. 4 that a string is disjunctive if every finite word is a substring of . The set of disjunctive sequences is a large subset of in a topological, in a measure theoretic, and in an information theoretic sense .
There are infinitely many disjunctive strings in if .
Every disjunctive string is reversible.
Every reversible string is full.
Let be a non-overlapping invertible IFS with attractor with non-empty interior and with basin . If is full, then covers .
By the above proposition and theorem (which are proved in ), full strings are plentiful. In fact, according to the next result, also proved in , any string is full with probability . Define a string to be a random string if it is chosen as follows: there is a such that, for each , is selected randomly from , where the probability that is greater than or equal to , independently of , for all . (See also Definition 4.1.)
Let , where is compact, be an invertible IFS with just-touching attractor with non-empty interior and with basin . If is a random string, then, with probability , the tiling covers .