This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

11institutetext: Louisa F. Barnsley and Michael F. Barnsley 22institutetext: Australian National University, Canberra, ACT, Australia 22email: [email protected]

Blowups and Tops of Overlapping Iterated Function Systems

Louisa F. Barnsley and Michael F. Barnsley
Abstract

We review aspects of an important paper by Robert Strichartz concerning reverse iterated function systems (i.f.s.) and fractal blowups. We compare the invariant sets of reverse i.f.s. with those of more standard i.f.s. and with those of inverse i.f.s. We describe Strichartz’ fractal blowups and explain how they may be used to construct tilings of n\mathbb{R}^{n} even in the case where the i.f.s. is overlapping. We introduce and establish the notion of “tops” of blowups. Our motives are not pure: we seek to show that a simple i.f.s. and an idea of Strichartz, can be used to create complicated tilings that may model natural structures.

Dedicated to Robert Strichartz

Refer to caption
Figure 1: Small ferns growing wildly: can fractal geometry model such images?

1 Introduction

In “Fractals in the large” strichartz Robert Strichartz observes that fractal structure is characterized by repetition of detail at all small scales. He asks “Why not large scales as well?” He proposes two ways to study large scaling structures using developments of iterated function systems. Here we review geometrical aspects of his paper and make a contribution in the area of tiling theory.

In his first approach, Strichartz defines a reverse iterated function system (r.i.f.s.) to be a set of m>1m>1 expansive maps

T={ti:MM|i=1,2,,m}T=\{t_{i}:M\rightarrow M|i=1,2,\dots,m\}

acting on a locally compact discrete metric space MM, where every point of MM is isolated. Here the large scaling structures are the invariant sets of TT, sets SMS\subset M which obey

S=i=1mti(S).S=\bigcup\limits_{i=1}^{m}t_{i}\left(S\right).

Why does does Strichartz restrict his definition to functions acting on discrete metric spaces? (i) He establishes that there are interesting nontrivial examples. (ii) He shows that such objects (act as a kind of skeleton to) play a role in his second kind of large scale fractal structure that he calls a fractal blowup. Probably he had other reasons related to situations where his approach to analysis on fractals could be explored.

In Section 2 we present notation for iterated function systems (i.f.s.) acting on n\mathbb{R}^{n}. We are particularly concerned with notation for chains of compositions of functions and properties of addresses of points on fractals. In Section 3 we review Strichartz’ definition and basic theorem concerning invariant sets of reverse iterated function systems, and we compare them to the corresponding situation for contractive i.f.s. We describe some kinds of invariant sets of contractive i.f.s. and consider how they compare to Strichartz’ large scaling structures. It is a notable feature of Strichartz’ definition that he restricts attention to functions acting on compact discrete metric spaces. We mention that, if this restriction is lifted, sometimes very interesting structures, characterized by repetition of structure at large scales, may be obtained. See for example Figure 2.

In Section 4 we define fractal blowups, Strichartz’ second kind of large scale fractal structure, and present his characterization of them, when the open set condition (OSC) is obeyed, as unions of scaled copies of an i.f.s. attractor, with the scaling restricted to a finite range. We outline the proof of his characterization theorem using different notation, anticipating fractal tops. We recall Strichartz’ final theorem on the topic, where he restricts attention to blowups of an i.f.s. all of the same scaling factor. Here he combines his two ideas: he reveals that the fractal blowup is in fact a copy of the original fractal translated by all the points on an invariant set of a r.i.f.s.

In Section 5 we discuss how tilings of blowups can be extended to overlapping i.f.s. In tilings it was shown how, in the overlapping (OSC not obeyed) case, tilings of blowups can be defined using an artificial recursive system of “masks”. Here the approach is more natural, but we pay a price–sequences of tilings are not necessarily nested. Here tilings are defined by using “fractal tops”, namely attractors with their points labelled by lexicographically highest addresses. The needed theory of fractal tops is developed in Subsection 5.1. Then in Subsection 5.2 we use these top addresses to define and establish the existence of tilings of some blowups for overlapping i.f.s. The main theorem concerns the relationship between the successive tilings that may be used to define a tiling of a blowup. In Subsection 5.3 we present an example involving a tile that resembles a leaf.

Strichartz’ paper has overlap with bandt2 , published about the same time by Christoph Bandt. Both papers consider the relationship between i.f.s. theory and self-similar tiling theory. Current work in tiling theory does not typically use the mapping point of view, but both Bandt and Stricharz do. Bandt is particularly focused on the open set condition and the algebraic structure of tilings, but also has a clear understanding of tilings of blowups when the OSC is obeyed.

Strichartz’ paper also contains measure theory aspects that we do not discuss. But from the little we have focused on here, much has been learned concerning the subtlety, the depth, and the elegant simplicity of the mathematical thinking of Robert Strichartz.

2 Preliminaries

Let ={1,2,}.\mathbb{N=\{}1,2,\dots\}. An iterated function system (i.f.s.) is a set of functions

F={fi:𝕏𝕏|i=1,2,,m}F=\{f_{i}:\mathbb{X\rightarrow X}|i=1,2,\dots,m\}

mapping a space 𝕏\mathbb{X} into itself, with mm\in\mathbb{N}. An invariant set of FF is S𝕏S\subset\mathbb{X} such that

S=F(S):=i=1mfi(S) where fi(S)={fi(s)|sS}.S=F(S):=\bigcup\limits_{i=1}^{m}f_{i}(S)\text{ where }f_{i}(S)=\{f_{i}(s)|s\in S\}.

We use the same symbol FF for the i.f.s. and for its action on SS, as defined here.

The i.f.s. FF is said to be contractive when 𝕏\mathbb{X} is equipped with a metric dd such that d(fix,fiy)λd(x,y)d(f_{i}x,f_{i}y)\leq\lambda d(x,y) for some 0<λ<10<\lambda<1 and all x,y𝕏x,y\in\mathbb{X}. If 𝕏=n,\mathbb{X=R}^{n},\ we take dd to be the Euclidean metric. A contractive i.f.s. on n\mathbb{R}^{n} is associated with its attractor AA, the unique non-empty closed and bounded invariant set of FF hutchinson . But Strichartz is also interested in the case where the underlying space is discrete and the maps are expansive.

We use addresses to describe compositions of maps. Addresses are defined in terms of the indices of the maps of FF. Let Σ={1,2,,m}\Sigma=\left\{1,2,\dots,m\right\}^{\mathbb{N}}, the set of strings of the form 𝐣=j1j2\mathbf{j}=j_{1}j_{2}\dots where each jij_{i} belongs to {1,2,,m}\left\{1,2,\dots,m\right\}. We write Σn={1,2,,m}n\Sigma_{n}=\left\{1,2,\dots,m\right\}^{n} and let Σ=n=1Σn.\Sigma_{\mathbb{N}}=\cup_{n=1}^{\infty}\Sigma_{n}. The address 𝐣Σ\mathbf{j}\in\Sigma truncated to length nn is denoted by 𝐣|n=j1j2jnΣ,\mathbf{j}|n=j_{1}j_{2}\dots j_{n}\in\Sigma_{\mathbb{N}}, and we define

f𝐣|n\displaystyle f_{\mathbf{j}|n} =fj1fj2fjn=fj1fj2fjn,\displaystyle=f_{j_{1}}f_{j_{2}}\dots f_{j_{n}}=f_{j_{1}}\circ f_{j_{2}}\circ\dots\circ f_{j_{n}},
f𝐣|n\displaystyle f_{-\mathbf{j}|n} =fj11fj21fjn1=fj11fj21fjn1.\displaystyle=f_{j_{1}}^{-1}f_{j_{2}}^{-1}\dots f_{j_{n}}^{-1}=f_{j_{1}}^{-1}\circ f_{j_{2}}^{-1}\circ\dots\circ f_{j_{n}}^{-1}.

Define a metric dd on Σ\Sigma by d(𝐣,𝐤)=2max{n|jm=km,m=1,2,,n}d(\mathbf{j},\mathbf{k})=2^{-\max\{n|j_{m}=k_{m},m=1,2,...,n\}} for 𝐣𝐤\mathbf{j}\neq\mathbf{k}, so that (Σ,d)\left(\Sigma,d\right) is a compact metric space.

The forward orbit of a point xx under (the semigroup generated by) FF is

{f𝐣|n(x)|𝐣Σ,n}.\{f_{\mathbf{j}|n}(x)|\mathbf{j}\in\Sigma,n\in\mathbb{N\}}\text{.}

Here we do not allow 𝐣|n\mathbf{j}|n to be the empty set, so xx is not necessarily an element of its forward orbit under the i.f.s. Indeed, xx is a member of its forward orbit if and only if xx is a fixed point of one of the composite maps f𝐣|nf_{\mathbf{j}|n}.

Now let FF be a contractive IFS of invertible maps on n\mathbb{R}^{n}. Then a continuous surjection π:ΣA\pi:\Sigma\rightarrow A is defined by

π(𝐣)=limNf𝐣|N(x)=limNfj1fj2fjN(x).\pi(\mathbf{j})=\lim_{N\rightarrow\infty}f_{\mathbf{j}|N}(x)=\lim_{N\rightarrow\infty}f_{j_{1}}f_{j_{2}}\dots f_{j_{N}}(x).

The limit is independent of xx. The convergence is uniform in 𝐣\mathbf{j} over Σ,\Sigma, and uniform in xx over any compact subset of n\mathbb{R}^{n}. We say 𝐣Σ\mathbf{j}\in\Sigma is an address of the point π(𝐣)A\pi(\mathbf{j})\in A.

We define i:ΣΣi:\Sigma\rightarrow\Sigma by i(𝐣)=ij1j2i(\mathbf{j)=}ij_{1}j_{2}\dots But we may also write k1k2kl𝐣k_{1}k_{2}...k_{l}\mathbf{j} to mean the address k1k2klj1j2Σ.k_{1}k_{2}\dots k_{l}j_{1}j_{2}\dots\in\Sigma. Let σ:ΣΣ\sigma:\Sigma\rightarrow\Sigma be the shift operator defined by σ(𝐣)=j2j3\sigma(\mathbf{j)=}j_{2}j_{3}\dots . It is well-known that

fiπ=πiand πσ(𝐣)=fj11π(𝐣)f_{i}\circ\pi=\pi\circ i\mathbf{\ }\text{and }\pi\circ\sigma\left(\mathbf{j}\right)=f_{j_{1}}^{-1}\circ\pi\left(\mathbf{j}\right)

for all i{1,2,m},𝐣Σi\in\{1,2,...m\},\mathbf{j\in}\Sigma.

A notable shift invariant subset of Σ\Sigma is the set of disjunctive addresses Σdis\Sigma_{dis}. An address 𝐣Σ\mathbf{j}\in\Sigma is disjunctive when, for each finite address i1i2i3ik{1,2,,m}ki_{1}i_{2}i_{3}\dots i_{k}\in\left\{1,2,\dots,m\right\}^{k}, there is ll\in\mathbb{N} so that jl+1jl+k=i1i2i3ikj_{l+1}...j_{l+k}=i_{1}i_{2}i_{3}\dots i_{k}. The set of disjunctive addresses ΣdisΣ\Sigma_{dis}\subset\Sigma is totally invariant under the shift, according to σ(Σdis)=Σdis.\sigma\left(\Sigma_{dis}\right)=\Sigma_{dis}. A point aAa\in A is disjunctive if there is a disjunctive address 𝐣Σ\mathbf{j}\in\Sigma such that π(𝐣)=a\pi(\mathbf{j})=a. Disjunctive points play a role in the structure of attractors. For example, if the i.f.s. obeys the open set condition (OSC) and its attractor has non-empty interior, then all the disjunctive points belong to the interior of the attractor bandt . Recall that FF obeys the OSC when there exists a nonempty open set OO such that fi(O)O\cup f_{i}(O)\subset O and fi(O)fj(O)=f_{i}(O)\cap f_{j}(O)=\emptyset whenever ij.i\neq j.

3 Reverse iterated function systems

In his first approach to large scaling structures, Strichartz defines a reverse iterated function system (r.i.f.s.) to be a set of m>1m>1 expansive maps

T:={ti:MM|i=1,2,,m}T:=\{t_{i}:M\rightarrow M|i=1,2,\dots,m\}

acting on a locally compact discrete (i.e. every point is isolated) metric space MM. We write TT and tit_{i} in place of FF and fif_{i} to distinguish this special kind of i.f.s. A mapping ti:MMt_{i}:M\rightarrow M is said to be expansive if there is a constant r>1r>1 such that d(tix,tiy)rd(x,y)d(t_{i}x,t_{i}y)\geq rd(x,y) for all xx\neq yy in M.M. An expansive mapping is necessarily one-to-one and has at most one fixed point.

In this case Strichartz’s large scaling structures are the invariant sets of r.i.f.s.; that is, sets SMS\subset M which obey

S=T(S)=i=1mti(S).S=T(S)=\bigcup\limits_{i=1}^{m}t_{i}\left(S\right).

By requiring that MM is discrete, Strichartz restricts the possible invariant sets to be discrete.

Let PP be the fixed points of {t𝐢|k:MM|k,𝐢Σ}\{t_{\mathbf{i}|k}:M\rightarrow M|k\in\mathbb{N},\mathbf{i}\in\Sigma\}. Contrast Theorem 3.1 with Theorem 3.2.

Theorem 3.1 (Strichartz)

A set is invariant for a r.i.f.s. if and only if it is a finite union of forward orbits of points in PP. In particular, invariant sets exist if and only if PP is nonempty, and there are at most a finite number of invariant sets.

EXAMPLE 1 Let M=M=\mathbb{Z}, T={ti:MM;t1(x)=2x,t2(x)=2x1}.T=\{t_{i}:M\rightarrow M;t_{1}(x)=2x,t_{2}(x)=2x-1\}. It is readily verified that MM is invariant for this r.i.f.s, T.T. It consists of the forward orbits of the fixed points of t1t_{1} and t2.t_{2}.

EXAMPLE 2 Strichartz presents the following example of a r.i.f.s. Let MM be the set of integer lattice points 2\mathbb{Z}^{2} in the plane, lying between or on the lines y=ρxy=\rho x and y=ρx+1y=\rho x+1 where ρ+ρ2=1,\rho+\rho^{2}=1, ρ=(51)/2.\rho=\left(\sqrt{5}-1\right)/2. The r.i.f.s. comprises the two maps

t1(x,y)=(xy,x),t2(x,y)=(1xy,1x).t_{1}(x,y)=(-x-y,-x),t_{2}(x,y)=(1-x-y,1-x).

These maps are expansive on MM, even though when viewed as transformations acting on 2,\mathbb{R}^{2}, they contract pairs of points that lie on any straight line with slope 1/ρ-1/\rho. The fixed point of t1t_{1} is (0,0)(0,0) and of t2t_{2} is (0,1),(0,1), both of which lie in M.M. The union of the forward orbits of these two points is MM. So this unlikely looking set of discrete points is invariant under the r.i.f.s.

This example yields, by projection onto the line y=ρx,y=\rho x, an example of a quasi-periodic linear tiling using tiles of lengths ρ\rho and 1+ρ.1+\rho. Strichartz also points out that by projection onto the perpendicular line y=x/ρy=-x/\rho of a natural measure on MM one obtains, after renormalizing, the unique self-similar measure on [0,1][0,1] associated with the overlapping i.f.s. f1(x)=ρxf_{1}(x)=\rho x, f2(x)=ρx+1f_{2}(x)=\rho x+1 with equal probabilities.

Theorem 3.1 leads one to wonder: What are the invariant sets of an i.f.s.? Usually the focus is on compact invariant sets, namely attractors. The following Theorem is simply a list of some of the invariant sets of a contractive i.f.s. The wealth of such invariants here stands in sharp contrast to Theorem 3.1.

Theorem 3.2 (Some Invariant Sets of an i.f.s.)

Let FF be a contractive i.f.s. of invertible maps on n.\mathbb{R}^{n}. If SnS\subset\mathbb{R}^{n} is invariant and bounded, then either S¯=,\overline{S}=\emptyset, or S¯=A.\overline{S}=A. The followings sets are invariant.

  1. 1.

    The attractor A,A, and the whole space n.\mathbb{R}^{n}.

  2. 2.

    The forward orbit under FF of any periodic point pP.p\in P.

  3. 3.

    The set of disjunctive points of AA.

  4. 4.

    The orbit of any xnx\in\mathbb{R}^{n} under the free group generated by the maps of FF and their inverses.

  5. 5.

    The union of any collection of invariant sets.

There are other invariant sets. For example, let AA be a Sierpinski triangle, the attractor of an i.f.s. FsierpF_{sierp} in the usual way. Let BB be the union of the sides of all triangles in A.A. Then BB is an invariant set for FsierpF_{sierp}. It is not covered by Theorem 3.2.

We note that the invariant set in (4) is also invariant under the inverse i.f.s.

F1:={fi1:nn|i=1,,m}.F^{-1}:=\left\{f_{i}^{-1}:\mathbb{R}^{n}\rightarrow\mathbb{R}^{n}|i=1,\dots,m\right\}.

The orbit under F1F^{-1} of the attractor AA is invariant under F1.F^{-1}. This set may be referred to as the fast basin of AA with respect to FF, see fastbasin . It is an example of a set which is “invariant in the large”, admitted when Strichartz’ constraint, that the underlying space is discrete and locally compact, is lifted.

Figure 2 illustrates the fast basin associated with (left) a Sierpinski triangle i.f.s. and (right) a different i.f.s. of three similitudes of scaling factor 1/2.1/2. Fast basins are interesting from a computational point of view, because they comprise the points xx in n\mathbb{R}^{n} for which there is an address 𝐣Σ\mathbf{j\in}\Sigma_{\mathbb{N}} such that f𝐣(x)Af_{\mathbf{j}}(x)\in A.

Refer to caption
Figure 2: Two examples of invariant sets of inverse iterated function systems. The left image illustrates part of the fast basin of a Sierpinski triangle i.f.s. The right image illustrates the fast basin of an i.f.s. whose attractor is illustrated in red. These unbounded sets are ”invariant in the large” but are not discrete.

4 Strichartz’ fractal blowups

Strichartz uses r.i.f.s. to analyze the structure of what he christened “fractal blowups”. These structures have been used to develop differential operators on unbounded fractals, see for example strichartz2 ; teplyaev .

Let FF be an i.f.s. of similitudes. The maps take the form

fj(x)=rjUjx+bjf_{j}\left(x\right)=r_{j}U_{j}x+b_{j}

where 0<rj<1,0<r_{j}<1, bjnb_{j}\in\mathbb{R}^{n} and UjU_{j} is an orthogonal transformation. It is convenient to write rj=rajr_{j}=r^{a_{j}} where r=max{rj}r=\max\left\{r_{j}\right\}, so that 1aj<amax1\leq a_{j}<a_{\max} . A blowup 𝒜\mathcal{A} of AA is the union of an increasing sequence of sets

A=A0A1A2A=A_{0}\subset A_{1}\subset A_{2}\subset\dots (1)

where Aj=f𝐤|j(A)A_{j}=f_{-\mathbf{k}|j}\left(A\right) for some fixed 𝐤Σ\mathbf{k}\in\Sigma and all jj\in\mathbb{N}. We have

𝒜=𝒜(𝐤)=j=1f𝐤|j(A).\mathcal{A=A}\left(\mathbf{k}\right)=\bigcup\limits_{j=1}^{\infty}f_{-\mathbf{k}|j}\left(A\right). (2)

Strichartz starts with a more general definition of a blowup, but restricts consideration to the one given here.

Theorem 4.1 (Strichartz)

Let 𝒜(𝐤)\mathcal{A}\left(\mathbf{k}\right) be a blowup of AA of the form in Equation (2) and assume FF satisfies the OSC. Then 𝒜(𝐤)\mathcal{A}\left(\mathbf{k}\right) is the union of sets 𝒢n\mathcal{G}_{n} which are similar to AA with the contraction ratios bounded from above and below, and the number of sets 𝒢n\mathcal{G}_{n} that intersect any ball of radius RR is at most a multiple of Rn.R^{n}. In particular the union 𝒜(𝐤)=n=1𝒢n\mathcal{A}\left(\mathbf{k}\right)=\cup_{n=1}^{\infty}\mathcal{G}_{n} is locally finite, and the intersection of 𝒜(𝐤)\mathcal{A}\left(\mathbf{k}\right) with any compact set is equal to the intersection of n=1N𝒢n\cup_{n=1}^{N}\mathcal{G}_{n} with that compact set for large NN.

Proof

We outline a proof for the case of a single scaling factor 0<r<10<r<1\ with fi(x)=rUix+bif_{i}(x)=rU_{i}x+b_{i}. At heart, our proof is the same as Strichartz, but we introduce notation that helps with our generalization to overlapping i.f.s. in Section 5.

Since FF satisfies the OSC, there is a bounded open set 𝒪\mathcal{O} such that AA\subset 𝒪¯,\overline{\mathcal{O}}, fi(𝒪)𝒪f_{i}(\mathcal{O)\subset O} for all i,i, fi(𝒪)f_{i}(\mathcal{O)\cap} fj(𝒪)=f_{j}(\mathcal{O)=\emptyset} for all ij.i\neq j. Note that the latter condition implies that the sets in {fj1j2jl(𝒪)|j1j2jlΣl}\left\{f_{j_{1}j_{2}...j_{l}}(\mathcal{O)}|j_{1}j_{2}...j_{l}\in\Sigma_{l}\right\} are disjoint.

Define a collection of sets

ΠS(𝐤|n):={f𝐤|nf𝐦|n(S)|𝐦Σ}\Pi_{S}(\mathbf{k|}n):=\left\{f_{-\mathbf{k}|n}f_{\mathbf{m|}n}(S)|\mathbf{m}\in\Sigma\right\}

where SS may be 𝒪\mathcal{O}, 𝒪¯,\overline{\mathcal{O}}, or A.A. Observe that

ΠA(𝐤|1)ΠA(𝐤|2)\Pi_{A}(\mathbf{k|}1)\subset\Pi_{A}(\mathbf{k|}2)\subset...

and

f𝐤|l(A)=n=1łΠA(𝐤|n).f_{-\mathbf{k}|l}\left(A\right)=\bigcup\limits_{n=1}^{\l}\Pi_{A}(\mathbf{k|}n).

Also

Π𝒪(𝐤|(n+1))\Π𝒪(𝐤|n)={f𝐤|n+1f𝐦|(n+1)(𝒪)|𝐦Σn+1,kn+1m1}\Pi_{\mathcal{O}}(\mathbf{k|}\left(n+1\right))\backslash\Pi_{\mathcal{O}}(\mathbf{k|}n)=\left\{f_{-\mathbf{k}|n+1}f_{\mathbf{m|}\left(n+1\right)}(\mathcal{O})|\mathbf{m}\in\Sigma_{n+1},k_{n+1}\neq m_{1}\right\}

consists of mn(m1)m^{n}(m-1) disjoint open sets. It follows that {Π𝒪(𝐤|n)|n=1,2,}\left\{\Pi_{\mathcal{O}}(\mathbf{k|}n)|n=1,2,\dots\right\} is a nested increasing sequence of disjoint open sets, whose closed union contains 𝒜(𝐤)\mathcal{A}\left(\mathbf{k}\right). The closure of each open set contains a copy of A.A. Since each open set has volume bounded below by a positive constant, local finiteness is assured.

A general case of a Strichartz style blowup is captured by defining

ΠS(𝐤|j)\displaystyle\Pi_{S}\left(\mathbf{k|}j\right) =f𝐤|l({f𝐦(S)|η(𝐦)<η(𝐤|l)η(𝐦),𝐦Σ})\displaystyle=f_{-\mathbf{k}|l}(\{f_{\mathbf{m}}(S)|\eta^{-}(\mathbf{m})<\eta(\mathbf{k}|l)\leq\eta(\mathbf{m}),\mathbf{m}\in\Sigma_{\mathbb{N}}\})
ΠS(𝐤)\displaystyle\Pi_{S}\left(\mathbf{k}\right) =jΠS(𝐤|j)\displaystyle=\bigcup\limits_{j\in\mathbb{N}}\Pi_{S}\left(\mathbf{k|}j\right)

where

η(m1m2mn)\displaystyle\eta^{-}(m_{1}m_{2}\dots m_{n}) =am1+am2++an1\displaystyle=a_{m_{1}}+a_{m_{2}}+\dots+a_{n-1}
η(m1m2mn)\displaystyle\eta(m_{1}m_{2}\dots m_{n}) =am1+am2++an\displaystyle=a_{m_{1}}+a_{m_{2}}+\dots+a_{n}

These formulas provide a specific form to Strichartz’ stopping time argument. Using these more general expressions one obtains, for fixed 𝐤\mathbf{k}, an increasing union of copies of AA scaled by factors that lie between ramaxr^{a_{\max}} and r.r. See for example tilings ; polygon . The argument concerning local finiteness is essentially the same as above.

Strichartz unites his two ideas, reverse i.f.s. and blowups, by considering the case where fj(x)=rx+bjf_{j}\left(x\right)=rx+b_{j} for all j,j, and studying the blowup 𝒜(𝟏¯)\mathcal{A}\left(\overline{\mathbf{1}}\right) where 𝟏¯=\overline{\mathbf{1}}\mathbf{=} 111,111\dots, that is

𝒜(𝟏¯)=n=1(f11)nA\mathcal{A}\left(\overline{\mathbf{1}}\right)=\cup_{n=1}^{\infty}(f_{1}^{-1})^{n}A
Theorem 4.2 (Strichartz combines r.i.f.s. and blowups)

Let fjx=rx+bj.f_{j}x=rx+b_{j}. Then 𝒜(𝟏¯)=A+D\mathcal{A}\left(\overline{\mathbf{1}}\right)=A+D where DD is an invariant set for the r.i.f.s.

tj(x)=r1(x+bjb1),j=1,2,,mt_{j}\left(x\right)=r^{-1}(x+b_{j}-b_{1}),j=1,2,...,m

Specifically, DD is the forward orbit of 0, the fixed point of t1.t_{1}.

That is, 𝒜(𝟏¯)\mathcal{A}\left(\overline{\mathbf{1}}\right) is the Minkowski sum of the attractor of the i.f.s. and an invariant set of a r.i.f.s.

5 Tops tilings

In this Section we study tilings of fractal blowups in the case of overlapping i.f.s. attractors. First, in Subsection 5.1 we give relevant theory of fractal tops. In Subsection 5.2 we show how fractal tops may be used to generate tilings of fractal blowups for overlapping i.f.s. The approach here is distinct from the one in tilings . In Subsection 5.3 we illustrate fractal tops for an i.f.s. of two maps, with overlapping attractor that looks like a leaf, suggesting applications to modelling of complicated real-world images.

5.1 Fractal tops

Let FF be a strictly contractive i.f.s. acting on a complete metric space 𝕏\mathbb{X}, with maps fif_{i} and attractor A.A. We assume that there are two or more maps, at least two of which have different fixed points. Also all of the maps are invertible.

Lemma 1

Let CC be a closed subset of Σ.\Sigma. Let 𝐣=\mathbf{j=} max{𝐤C}.\max\{\mathbf{k}\in C\}. Then 𝐣=j1max{𝐦Σ|(j1𝐦)C}.\mathbf{j}=j_{1}\max\{\mathbf{m}\in\Sigma|(j_{1}\mathbf{m)\in}C\}.

Proof

CC is the union of the three closed sets {𝐤C|k1>j1}\{\mathbf{k}\in C|k_{1}>j_{1}\},{𝐤C|k1=j1},\{\mathbf{k}\in C|k_{1}=j_{1}\}, and {𝐤C|k1<j1}.\{\mathbf{k}\in C|k_{1}<j_{1}\}. The maximum over CC is the maximum of the maxima over these three sets. But the set {𝐤C|k1>j1}\{\mathbf{k}\in C|k_{1}>j_{1}\} is empty, because if not then max{𝐤C}max{𝐤C|k1>j1}>𝐣\max\{\mathbf{k}\in C\}\geq\max\{\mathbf{k}\in C|k_{1}>j_{1}\}>\mathbf{j} which is a contradiction. If max{𝐤C}=max{𝐤C|k1<j1}\max\{\mathbf{k}\in C\}=\max\{\mathbf{k}\in C|k_{1}<j_{1}\} then 𝐣>𝐣\mathbf{j>j}, again a contradiction.

Since π:ΣA\pi:\Sigma\rightarrow A is continuous and onto, it follows that π1(x)\pi^{-1}(x) is closed for all xA.x\in A. Lemma 1 tells us that a map τ:AΣ\tau:A\rightarrow\Sigma and subset ΣtopΣ\Sigma_{top}\subset\Sigma are well-defined by

τ(x):=max{𝐤Σ|π(𝐤)=x},Σtop:=τ(A).\tau(x):=\max\{\mathbf{k\in}\Sigma|\pi(\mathbf{k)=}x\},\Sigma_{top}:=\tau(A).

Conventionally the maximum here is with respect to lexicographical ordering. We refer loosely to these objects and the ideas around them as relating to the top of A.A. Formally, the top of AA is the graph of τ,\tau, namely {(x,τ(x))|xA}\left\{(x,\tau(x))|x\in A\right\}.

Top addresses of points in A,A, namely points in Σtop,\Sigma_{top}, can be calculated by following the orbits of the shift map σ:ΣtopΣtop.\sigma:\Sigma_{top}\rightarrow\Sigma_{top}. Simply partition AA into A1=f1(A),A_{1}=f_{1}(A), A2=f2(A)\A1,A_{2}=f_{2}(A)\backslash A_{1}, A3=f3(A)\(A1A_{3}=f_{3}(A)\backslash(A_{1} A2),,Am=fm(A)\nmAn\cup A_{2}),\dots,A_{m}=f_{m}(A)\backslash\cup_{n\neq m}A_{n}. Define the orbit {xn}n=1\left\{x_{n}\right\}_{n=1}^{\infty} of x=x1A,x=x_{1}\in A, under the tops dynamical system, by xn+1=fin1(xn)x_{n+1}=f_{i_{n}}^{-1}(x_{n}) where ini_{n} is the unique index such that xnAinx_{n}\in A_{i_{n}}.

A version of the following observation can be found in tops . See also bandt .

Theorem 5.1

The set of top addresses is shift invariant, according to Σtop=σ(Σtop)\Sigma_{top}=\sigma\left(\Sigma_{top}\right) where σ\sigma is the left shift.

Proof

First we show that σ(τ(A))τ(A).\sigma\left(\tau(A)\right)\subset\tau(A). If 𝐣τ(A),\mathbf{j}\in\tau(A), then

𝐣\displaystyle\mathbf{j} =max{𝐤Σ|π(𝐤)=π(𝐣)}(by definition)\displaystyle=\max\{\mathbf{k}\in\Sigma|\pi(\mathbf{k})=\pi(\mathbf{j})\}\text{(by definition)}
=max{j1𝐥Σ|π(j1𝐥)=π(𝐣)} (by Lemma 1)\displaystyle=\max\{j_{1}\mathbf{l}\in\Sigma|\pi(j_{1}\mathbf{l})=\pi(\mathbf{j})\}\text{ (by Lemma \ref{lemma1})}
=j1max{𝐥Σ|fj1(π(𝐥))=fj1(π(σ𝐣))}\displaystyle=j_{1}\max\{\mathbf{l}\in\Sigma|f_{j_{1}}(\pi(\mathbf{l}))=f_{j_{1}}(\pi(\sigma\mathbf{j}))\}
=j1max{𝐥Σ|π(𝐥)=π(σ(𝐣))} (since fj1 is invertible)\displaystyle=j_{1}\max\{\mathbf{l}\in\Sigma|\pi(\mathbf{l})=\pi(\sigma\left(\mathbf{j}\right))\}\text{ (since }f_{j_{1}}\text{ is invertible)}
=j1τ(π(σ(𝐣))).\displaystyle=j_{1}\tau(\pi(\sigma\left(\mathbf{j}\right))).

Hence σ(𝐣)=τ(π(σ(𝐣))).\sigma(\mathbf{j})=\tau(\pi(\sigma\left(\mathbf{j}\right))). Hence {σ(𝐣)|𝐣τ(A)}={τ(π(σ(𝐣)))|𝐣τ(A)}\left\{\sigma\left(\mathbf{j}\right)\mathbf{|j}\in\tau(A)\right\}=\left\{\tau(\pi(\sigma\left(\mathbf{j}\right)))\mathbf{|j}\in\tau(A)\right\} which implies σ(τ(A))τ(A).\sigma\left(\tau(A)\right)\subset\tau(A).

We also have 1(Σ)Σ1\left(\Sigma\right)\subset\Sigma so τ(π(1(Σ)))τ(π(Σ))=τ(A).\tau(\pi(1\left(\Sigma\right)))\subset\tau(\pi(\Sigma))=\tau(A). But τ(π(1(Σ))))=1(τ(π(Σ)))\tau(\pi(1\left(\Sigma\right))))=1\left(\tau(\pi(\Sigma))\right) by a similar argument to the proof of Lemma 1, so 1τ(A)τ(A).1\tau(A)\subset\tau(A). Applying σ\sigma to both sides, we obtain τ(A)σ(τ(A)).\tau(A)\subset\sigma\left(\tau(A)\right).

It appears that the shift space Σtop\Sigma_{top} is not of finite type in general, and graph directed constructions cannot be used in general. This is a topic of ongoing research.

Define Σtop,n\Sigma_{top,n} to be the elements of Σtop\Sigma_{top} truncated to the first nn elements. That is,

Σtop,n={(𝐤|n)|𝐤Σtop}.\Sigma_{top,n}=\{\left(\mathbf{k}|n\right)|\mathbf{k\in}\Sigma_{top}\}.

Define πtop:\pi_{top}: ΣtopA\Sigma_{top}\rightarrow A to be the restriction of π:ΣA\pi:\Sigma\rightarrow A to Σtop.\Sigma_{top}. Extend the definition of πtop\pi_{top} so that it acts on truncated top addresses according to:

πtop(𝐤|n)={xf𝐤|n(A)|xf𝐜|n(A) for all 𝐜|n>𝐤|n}\pi_{top}\left(\mathbf{k|}n\right)=\{x\in f_{\mathbf{k}|n}(A)|x\notin f_{\mathbf{c}|n}(A)\text{ for all }\mathbf{c}|n>\mathbf{k}|n\}

for all 𝐤Σtop\mathbf{k\in}\Sigma_{top} and all nn\in\mathbb{N}. We will make use of the following observation.

Lemma 2

If 𝐤Σtop,\mathbf{k}\in\Sigma_{top}, then fk1(πtop,n1(σ(𝐤|n)))f_{k_{1}}\left(\pi_{top,n-1}(\sigma\left(\mathbf{k|}n\right))\right)\supset πtop,n(𝐤|n)\pi_{top,n}(\mathbf{k|}n) for all nn\in\mathbb{N}.

Proof

We need to compare the sets

{fk1kn(x)|fk1kn(x)fl1l2ln(A) for all l1ln>k1kn}\{f_{k_{1}...k_{n}}(x)|f_{k_{1}...k_{n}}(x)\notin f_{l_{1}l_{2}...l_{n}}(A)\text{ for all }l_{1}...l_{n}>k_{1}...k_{n}\}

and

{fk1kn(x)|fk1fk2kn(x)fk1fl2ln(A) for all l2ln>k2kn}.\{f_{k_{1}...k_{n}}(x)|f_{k_{1}}f_{k_{2}...k_{n}}(x)\notin f_{k_{1}}f_{l_{2}...l_{n}}(A)\text{ for all }l_{2}...l_{n}>k_{2}...k_{n}\}.

The condition in the latter expression is less restrictive.

The sets of truncated top addresses Σtop,n\Sigma_{top,n} have an interesting structure. Any addresses in Σtop,n\Sigma_{top,n} can be truncated on the left or on the right to obtain an address in Σtop,n1.\Sigma_{top,n-1}. The following Lemma is readily verified.

Lemma 3

Let n>1.n>1. If i1i2in1inΣtop,ni_{1}i_{2}\dots i_{n-1}i_{n}\in\Sigma_{top,n}, then both i2in1ini_{2}\dots i_{n-1}i_{n}\ and i1i2in1i_{1}i_{2}\dots i_{n-1}\ belong to Σtop,n1.\Sigma_{top,n-1}.

5.2 Top blowups and tilings

Here we are particularly interested in the overlapping case, where the OSC  does not hold. We show that natural partitions of fractal blowups, that we call tilings, may still be obtained.

Throughout this subsection, FF is an i.f.s. with

fj(x)=rUjx+bjf_{j}\left(x\right)=rU_{j}x+b_{j} (3)

where bjnb_{j}\in\mathbb{R}^{n} and UjU_{j} is an orthogonal transformation. We assume that there are two or more maps, at least two of which have distinct fixed points. We have in mind the situation where AA is homeomorphic to a ball, although this is not required by Theorems 5.2 and 5.3.

As in Section 4, but restricted to 𝐢Σtop,\mathbf{i}\in\Sigma_{top}, fractal blowups are well defined by

𝒜n=𝒜(𝐢|n)=l=1nf𝐢|l(A) and 𝒜=𝒜(𝐢)=l=1f𝐢|l(A).\mathcal{A}_{n}=\mathcal{A}\left(\mathbf{i|}n\right)=\bigcup\limits_{l=1}^{n}f_{-\mathbf{i}|l}\left(A\right)\text{ and }\mathcal{A=A}\left(\mathbf{i}\right)=\bigcup\limits_{l=1}^{\infty}f_{-\mathbf{i}|l}\left(A\right).

The unions are of increasing nested sequences of sets so 𝒜n=f𝐢|n1(A)\mathcal{A}_{n}=f_{\mathbf{i}|n}^{-1}\left(A\right) and 𝒜=𝒜n.\mathcal{A}=\cup\mathcal{A}_{n}. Note that 𝒜(𝐢|n)\mathcal{A}\left(\mathbf{i|}n\right) is related to 𝒜(𝐣|n)\mathcal{A}\left(\mathbf{j|}n\right) by the isometry (f𝐣|n)(f𝐢|n)1\left(f_{-\mathbf{j}|n}\right)\left(f_{-\mathbf{i}|n}\right)^{-1}. But possible relationships between 𝒜(𝐢)\mathcal{A}\left(\mathbf{i}\right) and 𝒜(𝐣)\mathcal{A}\left(\mathbf{j}\right) are quite subtle because inverse limits are involved.

Under conditions on FF and 𝐢\mathbf{i}, stated in Theorems 5.2 and 5.3, we can define a generalized tilings of 𝒜(𝐢)\mathcal{A}\left(\mathbf{i}\right) with the aid of the following two definitions:

Πtop(𝐢|k)\displaystyle\Pi_{top}(\mathbf{i}|k) :={f𝐢|k({xπtop(𝐭|(k+1))})|𝐭Σtop},\displaystyle:=\left\{f_{-\mathbf{i}|k}\left(\left\{x\in\pi_{top}\left(\mathbf{t}|\left(k+1\right)\right)\right\}\right)|\mathbf{t\in}\Sigma_{top}\right\},
Πtop(𝐢)\displaystyle\Pi_{top}(\mathbf{i}) :=limkΠtop(𝐢|k), when this limit is well defined.\displaystyle:=\lim_{k\rightarrow\infty}\Pi_{top}(\mathbf{i}|k),\text{ when this limit is well defined.}

For example, the limit is well defined when Πtop(𝐢|k)Πtop(𝐢|k+1)\Pi_{top}(\mathbf{i}|k)\subset\Pi_{top}(\mathbf{i}|k+1) for all k,k, as occurs when the OSC holds. As we will show, it is also well defined in some more complicated situations.

We call each set f𝐢|k({xπtop(𝐭|k)})f_{-\mathbf{i}|k}\left(\left\{x\in\pi_{top}\left(\mathbf{t}|k\right)\right\}\right) a tile, and we call the collection of disjoint sets {f𝐢|k({xπtop(𝐭|k)})|𝐭Σtop}\left\{f_{-\mathbf{i}|k}\left(\left\{x\in\pi_{top}\left(\mathbf{t}|k\right)\right\}\right)|\mathbf{t\in}\Sigma_{top}\right\} a partial tiling. The partial tilings {f𝐢|k({xπtop(𝐭|k)})|𝐭Σtop}\left\{f_{-\mathbf{i}|k}\left(\left\{x\in\pi_{top}\left(\mathbf{t}|k\right)\right\}\right)|\mathbf{t\in}\Sigma_{top}\right\} are well defined. However, Πtop(𝐢)\Pi_{top}(\mathbf{i}) may not be well defined, because there may not be any simple relationship between successive partial tilings. But when it is well defined, we call it a tiling.

The tiles in the partial tiling {f𝐢|k({xπtop(𝐭|k)})|𝐭Σtop}\left\{f_{-\mathbf{i}|k}\left(\left\{x\in\pi_{top}\left(\mathbf{t}|k\right)\right\}\right)|\mathbf{t\in}\Sigma_{top}\right\} may be referred to by their addresses. It is convenient to define

tile(i1i2ik.t1t2tk)=f𝐢|k({xπtop(𝐭|k)})tile(i_{1}i_{2}...i_{k}.t_{1}t_{2}...t_{k})=f_{-\mathbf{i}|k}\left(\left\{x\in\pi_{top}\left(\mathbf{t}|k\right)\right\}\right)

for all 𝐢|k\mathbf{i}|k and all 𝐭|kΣtop.\mathbf{t}|k\in\Sigma_{top}. We also define tile()=A,tile(\varnothing)=A, corresponding to k=0.k=0.

Lemma 4

This concerns the sequence of tilings Πtop(𝐢|n).\Pi_{top}(\mathbf{i}|n). If inp1p2pn1i_{n}p_{1}p_{2}...p_{n-1} Σtop,n,\in\Sigma_{top,n}, then tile(i1i2in1.p1p2pn1)tile(i1i2in.j1j2jn)tile(i_{1}i_{2}...i_{n-1}.p_{1}p_{2}...p_{n-1})\subset tile(i_{1}i_{2}...i_{n}.j_{1}j_{2}...j_{n}) implies inp1p2pn1=j1j2j3..jni_{n}p_{1}p_{2}...p_{n-1}=j_{1}j_{2}j_{3}..j_{n}.

Proof

Suppose tile(i1i2in1.p1p2pn1)tile(i1i2in.j1j2jn).tile(i_{1}i_{2}...i_{n-1}.p_{1}p_{2}...p_{n-1})\subset tile(i_{1}i_{2}...i_{n}.j_{1}j_{2}...j_{n}). Then applying (f𝐢|(n1))1\left(f_{-\mathbf{i}|\left(n-1\right)}\right)^{-1} to both sides we obtain πtop,n1(p1p2pn1)fin1(πtop,n(j1j2jn))\pi_{top,n-1}(p_{1}p_{2}...p_{n-1})\subset f_{i_{n}}^{-1}(\pi_{top,n}(j_{1}j_{2}...j_{n})) which is equivalent to

finπtop,n1(p1p2pn1)πtop,n(j1j2jn).f_{i_{n}}\pi_{top,n-1}(p_{1}p_{2}...p_{n-1})\subset\pi_{top,n}(j_{1}j_{2}...j_{n}).

But πtop,n(inp1p2pn1)finπtop,n1(p1p2pn1)\pi_{top,n}(i_{n}p_{1}p_{2}...p_{n-1})\subset f_{i_{n}}\pi_{top,n-1}(p_{1}p_{2}...p_{n-1}) by Lemma 2, so

πtop,n(inp1p2pn1)πtop,n(j1j2jn).\pi_{top,n}(i_{n}p_{1}p_{2}...p_{n-1})\subset\pi_{top,n}(j_{1}j_{2}...j_{n}).

This implies inp1p2pn1=j1j2j3..jni_{n}p_{1}p_{2}...p_{n-1}=j_{1}j_{2}j_{3}..j_{n} because otherwise πtop,n(inp1p2pn1)\pi_{top,n}(i_{n}p_{1}p_{2}...p_{n-1}) and πtop,n(j1j2jn)\pi_{top,n}(j_{1}j_{2}...j_{n}) are disjoint subsets of AA.

We say that 𝐢Σtop\mathbf{i\in}\Sigma_{top} is reversible when, for each nn\in\mathbb{N} there exists 𝐣=𝐣nΣtop\mathbf{j=j}_{n}\mathbf{\in}\Sigma_{top} such that j1=in,j2=in1,,jn=i1.j_{1}=i_{n},j_{2}=i_{n-1},...,j_{n}=i_{1}. Note that 𝐣\mathbf{j} depends on n.n. The address 1¯=11111\overline{1}=11111\dots is reversible and belongs to Σtop\Sigma_{top} in all cases.

EXAMPLE 3 For the i.f.s. {;f1(x)=2x/3;f2(x)=2x/3+1/3},\left\{\mathbb{R};f_{1}(x)=2x/3;f_{2}(x)=2x/3+1/3\right\}, the strings 1¯\overline{1} and 2¯\overline{2} both belong to Σtop\Sigma_{top} and are reversible. Figure 3 and Figure 4 illustrate two ways of looking at the development of top addresses. Figure 5 (a) illustrates the sets in Σtop,n\Sigma_{top,n} for n=0,1,2,3,4,5n=0,1,2,3,4,5. We usually use lexicographic ordering to define top addresses, but Figure 4 uses standard ordering.

Refer to caption
Figure 3: This compares the development of the top addresses for an i.f.s. of two maps in the cases (a) where each scaling is 1/3 (b) each scaling is 1/2 (c) each scaling is 2/3.
Refer to caption
Figure 4: One way of illustrating the top of the attractor of an i.f.s. See Example 3. The ordering here is not lexicographical, so 2 is greater than 1.

EXAMPLE 4 For the i.f.s. {;f1(x)=2x/3;f2(x)=12x/3},\left\{\mathbb{R};f_{1}(x)=2x/3;f_{2}(x)=1-2x/3\right\}, each of the strings 1¯,2¯,12¯,21¯\overline{1},\overline{2},\overline{12},\overline{21} belongs to Σtop\Sigma_{top} and is reversible. Figure 5(b) illustrates the sets in Σtop,n\Sigma_{top,n} for n=0,1,2,3,4,5n=0,1,2,3,4,5. Here it appears that all addresses are reversible.

Refer to caption
Figure 5: See Examples 3 and 4.

Let us define a new tile to be a tile at level n+1n+1 that is not contained in any tile at level n.n. Also, a child or child tile, is a tile at level n+1n+1 that is contained in a tile, its parent at level n.n.

Theorem 5.2

Let FF be an invertible contractive i.f.s. on n\mathbb{R}^{n}, as defined in Equation 3. Let 𝐢Σtop\mathbf{i\in}\Sigma_{top} be reversible. Each tile in Πtop(𝐢|k+1)\Pi_{top}(\mathbf{i}|k+1) is either (i) a nonempty subset, the child of a tile in Πtop(𝐢|k),\Pi_{top}(\mathbf{i}|k), of the form tile(i1ik+1.ik+1p1pk),tile(i_{1}...i_{k+1}.i_{k+1}p_{1}...p_{k}), or (ii) a nonempty set of the form tile(i1ik+1.q1q2qkqk+1)tile(i_{1}...i_{k+1}.q_{1}q_{2}...q_{k}q_{k+1}) where q1ik+1,q_{1}\neq i_{k+1}, a new tile. Each tile in Πtop(𝐢|k)\Pi_{top}(\mathbf{i}|k) contains exactly one child in Πtop(𝐢|k+1)\Pi_{top}(\mathbf{i}|k+1).

Proof

We can write

Πtop(𝐢|k+1)\displaystyle\Pi_{top}(\mathbf{i}|k+1) ={tile(i1i2ik+1.ik+1p2pk+1)|ik+1p2pk+1Σtop,k+1}\displaystyle=\left\{tile(i_{1}i_{2}...i_{k+1}.i_{k+1}p_{2}...p_{k+1})|i_{k+1}p_{2}...p_{k+1}\in\Sigma_{top,k+1}\right\}
{tile(i1i2ik+1.j1j2jk+1)|j1j2jk+1Σtop,k+1,j1ik+1}\displaystyle\cup\left\{tile(i_{1}i_{2}...i_{k+1}.j_{1}j_{2}...j_{k+1})|j_{1}j_{2}...j_{k+1}\in\Sigma_{top,k+1},j_{1}\neq i_{k+1}\right\}

Each tile in the first set is a subset of a tile in Πtop(𝐢|k),\Pi_{top}(\mathbf{i}|k), and it is non-empty because 𝐢\mathbf{i} is reversible. (By reversibility, the set of top addresses {ik+1p1p2pkΣtop,k+1|p1p2pkΣtop,k}\{i_{k+1}p_{1}p_{2}...p_{k}\in\Sigma_{top,k+1}|p_{1}p_{2}...p_{k}\in\Sigma_{top,k}\} is nonempty.)

Consider any tile tile(i1i2ik+1.p1p2pk+1)tile(i_{1}i_{2}...i_{k+1}.p_{1}p_{2}...p_{k+1}) in the second set. By Lemma 4: if tile(i1i2ik.p1p2pk)tile(i_{1}i_{2}...i_{k}.p_{1}p_{2}...p_{k})\subset tile(i1i2ik+1.ik+1p2pk+1),tile(i_{1}i_{2}...i_{k+1}.i_{k+1}p_{2}...p_{k+1}), then ik+1p1p2pk=j1j2j3..jk+1i_{k+1}p_{1}p_{2}...p_{k}=j_{1}j_{2}j_{3}..j_{k+1} which is not possible because j1ik+1j_{1}\neq i_{k+1}. So no tile in the second set is contained in a tile in the first set. That is to say, the tiles in the second set, which have non-cancelling addresses, are “new” and do not contain any tile in the first set.

This says that every tile at level kk has a unique child at level k+1,k+1, either equal to its parent, or smaller but not empty; also, there are new tiles at level k+1k+1 which do not have predecessors at level kk, because 𝒜k+1𝒜k.\mathcal{A}_{k+1}\neq\mathcal{A}_{k}. Each tile in Πtop(𝐢|k)\Pi_{top}(\mathbf{i}|k) contains a child in Πtop(𝐢|k+1)\Pi_{top}(\mathbf{i}|k+1). One deduces that 𝒜k+1\{children of tiles at level k}\mathcal{A}_{k+1}\backslash\cup\left\{\text{children of tiles at level }k\right\} is tiled by new tiles.

In the special case 𝐢=𝟏¯,\mathbf{i=}\overline{\mathbf{1}}, also considered by Strichartz in Theorem 4.2, we have:

Theorem 5.3

Let FF be an invertible contractive i.f.s. on n\mathbb{R}^{n}, as defined in Equation 3. Then Πtop(𝟏¯)\Pi_{top}(\overline{\mathbf{1}}) is a well defined tiling of 𝒜(𝟏¯):\mathcal{A}(\overline{\mathbf{1}}): specifically Πtop(𝟏¯|k)Πtop(𝟏¯|k+1),\Pi_{top}(\overline{\mathbf{1}}|k)\subset\Pi_{top}(\overline{\mathbf{1}}|k+1), and

Πtop(𝟏¯)=k=1Πtop(𝟏¯|k).\Pi_{top}(\overline{\mathbf{1}})=\bigcup\limits_{k=1}^{\infty}\Pi_{top}(\overline{\mathbf{1}}|k).

Each tile Πtop(𝟏¯|k)\Pi_{top}(\overline{\mathbf{1}}|k) (for all kk\in\mathbb{N}) in Πtop(𝟏¯)\Pi_{top}(\overline{\mathbf{1}}) can be written tile((1¯|k)|t1t2tk)tile((\overline{1}|k)|t_{1}t_{2}...t_{k}) for some t1t2tkΣtop,kt_{1}t_{2}...t_{k}\in\Sigma_{top,k} for some k,k, with t11.t_{1}\neq 1. The tile AA corresponds to k=0.k=0.

Proof

The result follows from the observation that in this case all children are exact copies of their parents. To see this simply note that f11πtop(1t1t2tk)=πtop(t1t2tk)f_{1}^{-1}\pi_{top}(1t_{1}t_{2}\dots t_{k})=\pi_{top}(t_{1}t_{2}\dots t_{k}) for all 1t1t2tkΣtop,k+1.1t_{1}t_{2}\dots t_{k}\in\Sigma_{top,k+1}.

For future work, one can consider the case where AA is homeomorphic to a ball. By introducing a stronger notion of reversibility (see also tilings ), that requires the tops dynamical system orbit of a reversible point 𝐢Σtop\mathbf{i}\in\Sigma_{top} to be contained in a compact set AA^{\prime} contained in the interior of A,A, one can ensure that new tiles are located further and further away from A.A. This means that new tiles have only finitely many successive generations of children (one child at each subsequent generation) before children are identical to their parents. Hence, given any ball BB of finite radius, the set of tiles in Πtop(𝐢|k)\Pi_{top}(\mathbf{i}|k) that have nonempty intersection with BB remains constant for all large enough k.k. In such cases one Πtop(𝐢|k)B\Pi_{top}(\mathbf{i}|k)\cap B is constant for all kk sufficiently large, and so the tiling Πtop(𝐢)\Pi_{top}(\mathbf{i}) is well defined. We note that if 𝐢\mathbf{i} is disjunctive then 𝒜(𝐢)=n,\mathcal{A}(\mathbf{i})=\mathbb{R}^{n}, see tilings .

We conjecture that if AA is homeomorphic to a ball and if 𝐢𝚺top\mathbf{i\in\Sigma}_{top} is both reversible and disjunctive (relative to the top), then Πtop(𝐢)\Pi_{top}(\mathbf{i}) is a well defined tiling of n.\mathbb{R}^{n}.

5.3 A leafy example of a two-dimensional top tiling

For a two-dimensional affine transformation f:22f:\mathbb{R}^{2}\rightarrow\mathbb{R}^{2} we write

 f=[abecdg] for f(x,y)=(ax+by+e,cx+dy+g) \text{ }f=\begin{bmatrix}a&b&e\\ c&d&g\end{bmatrix}\text{ for }f(x,y)=(ax+by+e,cx+dy+g)\text{ }

where a,b,c,d,e,ga,b,c,d,e,g\in\mathbb{R}. We consider the i.f.s. defined by the two similitudes

f1=[0.7526.2190.24740.21900.7526.0726],f2=[0.75260.21901.03490.21900.75260.0678]f_{1}=\begin{bmatrix}0.7526&-.2190&.2474\\ 0.2190&0.7526&-.0726\end{bmatrix},f_{2}=\begin{bmatrix}-0.7526&0.2190&1.0349\\ 0.2190&0.7526&0.0678\end{bmatrix} (4)

The attractor, LL=leaf, illustrated in Figure 6, is made of two overlapping copies of itself. The copy illustrated in black is associated with f1.f_{1}. The point with top address 𝟏¯=111\overline{\mathbf{1}}=111\dots is represented by the tip of the stem of the leaf. The stem is actually arranged in an infinite spiral, not visible in the picture. In all tiling pictures, the colors of the tiles were obtained by overlaying the tiling on a colorful photograph: the color of each tile is the color of a point beneath it. In this way, if the tiles were very small, the tiling would look like a mozaic representation of the underlying picture.

Refer to caption
Figure 6: The overlapping attractor of an i.f.s. of two similitudes, each with the same scaling factor.

Figure 7 illustrates the top of LL at depths n{1,2,,6}n\in\{1,2,\dots,6\} labelled by the addresses in Σn,top\Sigma_{n,top} .

Refer to caption
Figure 7: Successsive fractal tops.

Figure 8 illustrates the successive blowups Πtop,n(1¯|n)\Pi_{top,n}(\overline{1}|n) for n=1,2,,6n=1,2,\dots,6 for the i.f.s. in Equation (5.2). See also Figure 9 where the successive images are illustrated in their correct relative positions.

Refer to caption
Figure 8: This shows the sequence of tops Π(111|n)\Pi(111...|n) for n=0,1,,6n=0,1,\dots,6 for the leaf i.f.s. In each case the tip of the stem is at the origin.
Refer to caption
Figure 9: This illustrates the relationship between the successive partial tilings in Figure 8.

Figure 10 shows a patch of a leaf tiling, illustrating its complexity. Figure 11 illustrates a patch of a top tiling obtained using an i.f.s. of four maps.

Refer to caption
Figure 10: Patch of a leaf tiling.
Refer to caption
Figure 11: Fractal top for an i.f.s of three maps looks both random and somewhat natural, but is not the real thing, compare with Figure 1.

ACKNOWLEDGEMENTS: We thank both Brendan Harding and Giorgio Mantica for careful reading and corrections.

References

  • (1) C. Bandt, S.Graf, Self-similar sets VII. A characterization of self-similar fractals with positive Hausdorff measure, Proc. Amer. Math. Soc. 114 (1992), 995-1001.
  • (2) C. Bandt, Self-similar tilings and patterns described by mappings, Mathematics of Aperiodic Order (ed. R. Moody) Proc. NATO Advanced Study Institute C489, Kluwer, (1997) 45-83.
  • (3) C. Bandt, M. F. Barnsley, M. Hegland, A. Vince, Old wine in fractal bottles I: Orthogonal expansions on self-referential spaces via fractal transformations, Chaos, Solitons and Fractals, 91 (2016), 478-489.
  • (4) M. F. Barnsley, A. Vince, Fractal tilings from iterated function systems, Discrete and Computational Geometry, 51 (2014), 729-752.
  • (5) M. F. Barnsley, A. Vince, Self-similar polygonal tilings, Amer. Math. Monthly, 124 (2017), 905-921.
  • (6) M. F. Barnsley, K. Leśniak, M. Rypka, Basic topological structure of fast basins, Fractals 26 (2018), no. 1, 1850011.
  • (7) M. F. Barnsley, M. F., Theory and Applications of Fractal Tops, in: Levy-Vehel, J., Lutton, E., (eds.)Fractals in Engineering: New Trends in Theory and Applications. Springer, London (2005).
  • (8) J. Hutchinson, Fractals and self-similarity, Indiana Univ. Math. J. 30 (1981), 713-747.
  • (9) R. S. Strichartz, Fractals in the large, Canad. J. Math., 50 (1998), 638-657.
  • (10) R. S. Strichartz, Differential Equations on Fractals, Princeton University Press, Princeton, New Jersey (2006).
  • (11) A. Teplyaev, Spectral analysis on infinite Sierpinski gaskets, J. Funct. Anal. 129 (1998), 357-567.