The Borel Structure of the Collections of Sub-Self-Similar Sets and Super-Self-Similar Sets Mark McClure and Robert W. Vallin

Abstract

We show that the sets of sub-self-similar sets and super-self-similar sets are both dense, rst category, F subsets of K(Rd ), the Hausdor metric space of non-empty compact, subsets of Rd . We also investigate the set of self-similar sets as a subset of the sub-self-similar sets and the super-self-similar sets.

1 Introduction In [Fal1], Falconer introduced the notion of sub-self-similarity as a generalization of self-similarity and showed that sub-self-similar sets retain many of the nice properties of self-similar sets. Later in [Fal2] we nd the notion of a superself-similar set. The question arises as to how strong a generalization are these new concepts. In this paper, we quantify this question using topological notions in K(Rd ), the Hausdor metric space of non-empty compact subsets of Rd . In particular, we show that the sets of sub-self-similar sets and super-self-similar sets are both dense, rst category, F subsets of K(Rd ). The fact that these sets are dense could be interpreted as meaning that we have an understanding of many compact subsets of Rd . The fact that these sets are rst category indicates that most compact sets are not encompassed in these de nitions. We also consider the set of self-similar sets as a subset of the sub-self-similar sets and the super-self-similar sets. In particular, we show that the sub-self-similar sets which are not self-similar are dense in the set of sub-self-similar sets, and similarly for the super-self-similar sets. This indicates that Falconer's new concepts are a considerable generalization over the self-similar sets.

2 De nitions

We work in a xed Euclidean space Rd . Let K(Rd ) be the set of non-empty, compact subsets of Rd . The Hausdor metric  on K(Rd ) is de ned by (A; B) = maxf sup fdist(x; B)g; sup fdist(y; A)gg: x2A

y2B

A discussion of the Hausdor metric may be found in [Ed] section 2.4. Of particular interest is theorem 2.4.4., which states that K(Rd ) is complete. This 1

allows us to appeal to Baire category type arguments in K(Rd ). Also of note is exercise 2.4.2, which characterizes the limit of a sequence of sets in the Hausdor metric as follows: If An ! A in the Hausdor metric, then A = fx : 9fxng1 n=1 with xn 2 An and xn ! xg: A function T : Rd ! Rd is a similarity with ratio r = r(T ) > 0 if jT (x) ; T (y)j = rjx ; yj 8x; y 2 Rd : If r < 1, then T is called contractive. A fundamental result ([Ed], Thm. 4.1.3) states that if Ti : Rd ! Rd is a contractive similarity for each i 2 f1; : : :; mg, then there is a unique, nonempty, compact set E  Rd such that E = [mi=1 Ti (E): The set E is called self-similar. Sub-self-similar sets are obtained by relaxing the equality to inclusion. Thus, the compact set E is sub-self-similar if there are contractive similarities Ti : Rd ! Rd for i 2 f1; : : :; mg such that E  [mi=1 Ti (E): Clearly any self-similar set is sub-self-similar. [Fal1] contains many other examples of sub-self-similar sets and describes their basic properties. The following lemma provides an example of a non-sub-self-similar set. Lemma 2.1 Let E = f0; 1; 12 ; 31 ; 14 ; : : :g. Then E is not a sub-self-similar set. Proof: Assume that fTi gmi=1 are contractive similarities. We will show that E 6 [mi=1Ti (E): Suppose rst that no Ti has 0 as a xed point. Then there is a neighborhood U of 0 such that Ti (0) 62 U for every i 2 f1; : : :; mg. Since 0 is the only cluster point of E, it follows that U \ [mi=1Ti (E) can contain only nitely many points. But U \ E is in nite, so E 6 [mi=1 Ti (E): Now, by reordering the set fTigmi=1 if necessary, choose n  m such that fTi gni=1 are those similarities with 0 as a xed point. We will show that E n [ni=1 Tip(E) is in nite. Note that Ti (E) \ E = f0g unless r(Ti ) is of the speci c form q where qi; pi 2 N and qi  2. Thus if p is a prime larger than qi for each i 2 f1; : : :; ng, then [ni=1Ti (E) will contain no number of the form 1 m kp , where k 2 N. Now the remaining portion [i=n+1 Ti (E) may contain only nitely many points of E for the reasons outlined above. Thus we again have E 6 [mi=1Ti (E):2 The above argument may clearly be embedded in Rd by associating R with just one of the coordinates of Rd . Furthermore, if E is the set in the lemma, we may obtain other non-sub-self-similar sets by scaling and translating E. Finally, the union of such a set with any nite set will be non-sub-self-similar. Using this fact together with the fact that the nite sets are dense in K(Rd ), we obtain the following important corollary. i i

2

Corollary 2.1 The set of non-sub-self-similar sets is dense in K(Rd ). The super-self-similar sets were introduced in [Fal2] by reversing the inclusion. Thus, the compact set E is super-self-similar if there are contractive similarities Ti : Rd ! Rd for i 2 f1; : : :; mg such that E  [mi=1 Ti (E): It again turns out that the super-self-similar sets retain some nice properties of the self-similar sets, although some additional assumption may need to be added (see [Fal2], cor. 3.4). As with the sub-self-similar sets, we will need the fact that the set of non-super-self-similar sets is dense in K(Rd ).

Lemma 2.2 No nite set with more than one element is super-self-similar. Proof: Let F be a nite set with more than one element and let fTi gmi=1 be contractive similarities. We will show that F 6 [mi=1 Ti (F ): Let x be the xed point of T1 and let y 2 F satisfy jx ; yj = dist(x; F n fxg). Then clearly T1 (y) 62 F so F 6 [mi=1 Ti (F):2 As the nite sets are dense in K(Rd ), we obtain the following corollary immediately.

Corollary 2.2 The set of non-super-self-similar sets is dense in K(Rd ). Note that the nite sets are all sub-self-similar while the set E from Lemma 2.1 is super-self-similar for the set of transformations fT1 (x) = 21 x; T2(x) = 13 xg. As a notational convenience, we will denote the set of self-similar sets by ss, the set of sub-self-similar sets by sss and the set of super-self-similar sets by Sss.

3 The Main Results In this section, we prove our main results. Theorem 3.1 states that sss is a rst category, F subset of K(Rd ).

Theorem 3.1 The set of sub-self-similar sets may be expressed as the countable union of closed, nowhere dense subsets of K(Rd ). Proof: For m; n 2 N, de ne sssm;n to be the set of all those sub-self-similar sets E such that there exists contractive similarities fTi gmi=1 with n1  r(Ti )  1 ; n1 , E  [mi=1 Ti (E), and jTi (0)j  n for every i 2 f1; : : :; mg. Clearly, 1 [1 m=1 [n=1 sssm;n is precisely the set of sub-self-similar sets. We rst prove that sssm;n is closed for every m; n 2 N. Suppose that Ek ! E in the Hausdor metric, where Ek 2 sssm;n for every k 2 N. To each Ek corresponds fTik gmi=1 such that 1=n  r(Tik )  1 ; 1=n, Ek  [mi=1Tik (Ek ), and jTik (0)j  n. Using the standard matrix, vector representation of2 an ane transformation, each Tik may be associated with a point, xki , in Rd +d . The 3

conditions on each Tik ensure that the set of all such points, K, is compact. By recursively choosing successively ner subsequences, we may assume that each sequence fxki g1 k=1 is convergent to say xi 2 K. Each point xi in turn de nes a contractive similarity Ti : Rd ! Rd satisfying n1  r(Ti )  1 ; n1 and jTi (0)j  n for every i 2 f1; : : :; mg2. The correspondence between ane transformations on Rd and points in Rd +d , along with the continuity of the algebraic operations, implies that Tik ! Ti pointwise as k ! 1. We must now show that E  [mi=1Ti (E). Let x 2 E. Then for every k 2 N, there is an xk 2 Ek m k such that the sequence fxk g1 k=1 convergeskto x. Since Ek  [i=1 Ti (Ek ), there is an ik 2 f1; : : :; mg such that xk 2 Ti (Ek ). Since there are only nitely many choices for ik , at least one must occur in nitely often. Thus we have a subsequence fkj g1 j =1 and a xed i 2 f1; : : :; mg such that ik = i for every j. Along this subsequence we have k

j

Tik (Ek ) = Tik (Ek ) ! Ti (E) j

kj

j

j

j

as j ! 1, since Tik ! Ti pointwise and Ek ! E in the Hausdor metric. Thus x 2 Ti (E) since xk ! x and xk 2 Tik (Ek ) for all j. Finally, we prove that sssm;n is nowhere dense in K(Rd ) for all m; n 2 N. Since sssm;n is closed, we must simply show that it contains no open set. But this is immediate since its complement is dense in K(Rd ) by Corollary 2.1.2 The next theorem states a similar result for Sss. j

j

j

j

j

j

Theorem 3.2 The set of super-self-similar sets may be expressed as the countable union of closed, nowhere dense subsets of K(Rd ). Proof: The proof of this theorem is very similar to the proof of Theorem 3.1. For m; n 2 N, de ne Sssm;n to be the set of all those super-self-similar sets E such that there exists contractive similarities fTi gmi=1 with n1  r(Ti )  1 ; n1 , E  [mi=1 Ti (E), and jTi(0)j  n for every i 2 f1; : : :; mg. Using the exact construction from Theorem 3.1, we obtain a sequence of sets Ek ! E and a sequence of transformations fTik g1 k=1, for each i 2 f1; : : :; mg satisfying 1=n  r(Tik )  1 ; 1=n, Ek  [mi=1Tik (Ek ), and jTik (0)j  n. As before, there are transformations fTi gmi=1 which are the pointwise limits as k ! 1 of 1 1 fTik g1 k=1, for each i 2 f1; : : :; mg and whichm satisfy n  r(Ti )  1 ; n and jTi (0)j  n. We must now show that E  [i=1 Ti (E). Suppose that x 2 Ti (E) for some i 2 f1; : : :; mg. Since Ek ! E in the Hausdor metric, Ti (Ek ) ! Ti (E) by the continuity of Ti . Thus for each k we may choose xk 2 Ek such that Ti (xk ) ! Ti (x). Thus xk ! x by the continuity of Ti;1 and x 2 E. In order to show that Sssm;n is nowhere dense in K(Rd ) it again suces to

show that it contains no open set, since it is closed. But this follows immediately from Corollary 2.2.2 The above theorems may be somewhat improved. By allowing more general ane contractions, rather than strict similarities, we obtain the notions of subself-anity and super-self-anity. The above proofs clearly apply to the larger sets of sub-self-ane sets and super-self-ane sets. 4

We now turn our attention to the set of self-similar sets. It is well known that ss is dense in K(Rd ). This is essentially the content of the collage theorem (see [Ba] section 3.10, theorem 1). This implies that sss and Sss are dense in K(Rd ) as they both contain ss. In fact, ss = sss \ Sss. This implies that ss is a rst category, F subset of K(Rd ). Finally, we are interested in the size of ss compared to sss and Sss. As sss and Sss are not G subsets of K(Rd ), it makes no sense to consider the Baire category of their subsets (see [Ox], chapter 12). Thus we content ourselves with the following theorem which states that ss is a small subset of both sss and Sss.

Theorem 3.3 sss n ss is dense in sss and Sss n ss is dense in Sss. Proof: The rst part is quite simple since any nite set is sub-self-similar. The nite sets are dense in K(Rd ) and, therefore, dense in sss n ss. The second part is slightly more dicult. It suces to nd a class of superself-similar sets which are not self-similar, but are dense in K(Rd ). Since ss is dense in K(Rd ), we show how to approximate any self-similar set with a super-self-similar set which is not self-similar. Let E be self-similar for the transformations fTi gmi=1 . Choose R > 0 such that Ti (BR (0))  BR (0) for each i 2 f1; : : :; mg. Let E1 = [mi=1 Ti (BR (0)) and for n > 1 let En = [mi=1 Ti (En;1). Then each En is super-self-similar, but not self-similar and En ! E in the Hausdor metric.2

References [Ba] Michael Barnsley, Fractals Everywhere. Academic Press, 1988. [Ed] G. A. Edgar, Measure, Topology, and Fractal Geometry. Springer-Verlag, 1990. [Fal1] K. J. Falconer, \Sub-Self-Similar Sets." Trans. Amer. Math. Soc. 347 (1995) 3121-3129. [Fal2] K. J. Falconer, Techniques in Fractal Geometry. John Wiley & Sons, 1997. [Ox] John C. Oxtoby, Measure and Category, 2nd Edition. Springer-Verlag, 1980.

5

The Borel Structure of the Collections of Sub-Self ... - Mark McClure

Abstract. We show that the sets of sub-self-similar sets and super-self-similar sets are both dense, first category, F subsets of K(Rd), the Hausdorff metric space of non-empty compact, subsets of Rd. We also investigate the set of self-similar sets as a subset of the sub-self-similar sets and the super-self-similar sets.

114KB Sizes 1 Downloads 216 Views

Recommend Documents

The Borel Structure of the Collections of Sub-Self ... - Mark McClure
|T(x) -T(y)| = r|x-y| Vx y GRd: If r < 1, then T is called contractive. A fundamental result ( Ed], Thm. 4.1.3) states that if Ti : Rd → Rd is a contractive similarity for ...

the prevalent dimension of graphs - Mark McClure
The extension of the various notions of \almost every" in Rn to infinite dimen- sional spaces is an interesting and difficult problem. Perhaps the simplest and most successful generalization has been through the use of category. Banach's application

Vibration of the Koch drum - Mark McClure
A preprint version of a “Mathematical graphics” column from .... More precisely, there are seven functions f0 , f1 , …, f6 that map the snow- flake onto the ...

the prevalent dimension of graphs - Mark McClure
An easy but important property of is that it respects closure. That is. (E) = (E). Another ( F] p. 41) is that the limsup need only be taken along any sequence fcng1n=1 where c 2 (01) and we still obtain the same value. One problem with is that it is

Vibration of the Koch drum - Mark McClure
We begin by setting up the boundary of the snowflake. The level .... Norm@interiorGrid@@#DD - KochVertices@@nDDD § stepSize к 2 &D@@1DD;.

Vibration of the Koch drum - Mark McClure
The fundamental modes of vibration of this drum can be modelled by the eigenfunctions of the .... We begin by setting up the boundary of the snowflake.

The Read-Bajraktarevic Operator - Mark McClure
0.4. 0.6. 0.8. 1. References. [1] Massopust, Peter R. Fractal functions, fractal surfaces, and wavelets. Academic Press, Inc., San Diego, CA, 1994. ReadBajPP.nb.

Generating Google™ maps - Mark McClure
complete information is presented at the Google Maps™ API reference [2]. ... and display a Google map: an HTML file for the webpage and a javascript file that ...

Generating Google™ maps - Mark McClure
If you view the HTML file in a web browser, you should see the ..... We can illustrate the algorithm using the first 360 points of the Mt. Mitchell path. dataXML ...

The connected locus for complex cubic iteration - Mark McClure
SupplementaryFiles directory, which should come with this notebook. The initialization .... 9 » a »2 +2 M, then the orbit of z0 will diverge to ¶. (See [4], page 266.) ...

The connected locus for complex cubic iteration - Mark McClure
SupplementaryFiles directory, which should come with this notebook. The initialization .... 9 » a »2 +2 M, then the orbit of z0 will diverge to ¶. (See [4], page 266.) ...

Boundary scanning and complex dynamics - Mark McClure
with this notebook. .... [2] J. Glynn and T. Gray, The Beginner's Guide to Mathematica Version 4. Cambridge University Press, NY, 2000. BoundaryScanPP.nb. 9.

Boundary scanning and complex dynamics - Mark McClure
with this notebook. .... [2] J. Glynn and T. Gray, The Beginner's Guide to Mathematica Version 4. Cambridge University Press, NY, 2000. BoundaryScanPP.nb. 9.

Generating self-affine tiles and their boundaries - Mark McClure
Now for each pair Ha, bL where a and b are chosen from , we want MHa, bL to denote the set of pairs of digits. Hd, d'L so that b = A a ..... used by the program.

ORGANIZATIONAL STRUCTURE OF THE CMU JOURNAL OF ...
ORGANIZATIONAL STRUCTURE OF THE CMU JOURNAL OF SCIENCE.pdf. ORGANIZATIONAL STRUCTURE OF THE CMU JOURNAL OF SCIENCE.pdf.

"Decremental tag systems and random trees". - Mark McClure
1. Introduction. We fix a positive natural number m and consider sequences of the form xn ... tree construction we call the use it or lose it construction. In fact, our ...

"Decremental tag systems and random trees". - Mark McClure
We fix a positive natural number m and consider sequences of the form xn. = (x1,...,xn), where each ..... Sequences, http://www.research.att.com/~njas/sequences/.

Generating self-affine tiles and their boundaries - Mark McClure
For example, the image in figure 1 is a self-affine four-tile (i.e. it consists of four parts) ... Self-similarity and iterated function systems are, by now, fairly well known concepts. .... In figure 5, we see the image of figure 4 under the mapping

coordinatewise decomposition of group-valued borel functions
Fix γ0 ∈ Γ \ {1Γ}, define f : S → Γ by f(x, y) = ¨ γ0 ... the unique G-neighbor of z in Bn, and define recursively u : X → Γ,v : Y → Γ by ... Bi and ∃w ∈ Bn ((z, w) ∈ G).

Parametric L-Systems and borderline fractals - Mark McClure
parameter and their application to borderline fractals. Note: To reduce the size of the ..... Maeder, R., The Mathematica programmer (Chapter 8). AP Professional ...

A Stochastic Cellular Automaton for Three-Coloring ... - Mark McClure
Aug 24, 2001 - of the tiling maps each tile to another tile. Figure 2 shows part of such a tiling. ... dynamic images are available on the author's web page:.

The probabilistic structure of the distance between tributaries of given ...
May 16, 2007 - Indeed if at i sites one collects the areas Ai and must enforce the con- straint ...... See color version of this figure in the HTML. Figure 2. Sample ...