Intersections of Cantor sets derived from Complex Radix Expansions
Abstract.
Let be the attractor of the IFS , and let denote the box-counting dimension. It is known that for all , that the set of complex numbers for which is dense in the set of for which when for all and for all . We show that this result still holds when we replace with . In fact, for sufficiently large , the result even holds when we remove the assumption and replace by . Additionally, we make similar statements where denotes the Hausdorff dimension or packing dimension. Our insights also find application in classifying the self-similarity of . Namely we connect the occurrence of self-similarity to the notion of strongly eventually periodic sequences seen for analogous objects on the real line. We also provide a new proof of a result of W. Gilbert that inspired this work.
1. Introduction
Given a metric space , a function is a contraction if there exists a real number such that
(1) |
for all . We call the contraction factor. Given a finite collection of contractions on a complete metric space , called an iterated function system (IFS), there exists a unique compact set that satisfies [9]. The set is called the attractor of the IFS. A contraction is called a similarity if we have equality in (1). The attractor of an IFS is called self-similar when all the contractions are similarities. Many examples of self-similar sets are fractals. That is, they exhibit non-integer Hausdorff dimension. For example, the middle third Cantor set is the attractor of the IFS and has Hausdorff dimension .
The intersection of a self-similar set and one of its translates has been studied extensively on the unit interval. The literature includes, but is surely not limited to, [1], [2], [8], [13], [14], [15], [16], [17], [18], [19], [20], [21], [24], and [25]. These papers consider the intersection’s cardinality, Hausdorff and box-counting dimensions, and classify when the intersection is also a self-similar set. The structure of these intersections in higher dimensions has received less attention. This paper presents results similar to those that hold on the unit interval for subsets of the complex plane.
Consider the following property of the middle third Cantor set proved by Davis and Hu in [1]. Let denote Hausdorff dimension of a set . See Definition 2.1 to recall how Hausdorff dimension is formulated. Let be the set of real numbers for which is nonempty. The level sets of the function from to given by is dense in . Pedersen and Shaw proved a result similar to that of Davis and Hu for the attractor of a set of similarities defined on the complex plane using the box-counting dimension instead of the Hausdorff dimension [22]. To describe the IFS, fix a positive integer , let and let . The IFS studied by Pedersen and Shaw in [22] is the collection of functions given by where .
The choices of factor and digits are special. The properties of this pairing have been studied in several papers ([5], [6], [10], [11], [12]). We state a theorem of Katai and Szabo which captures why it is of interest ([11]).
Theorem 1.1 (I. Katai, J. Szabo, [11], theorem 1).
Given a Gaussian integer , every Gaussian integer can be uniquely written as
(2) |
with if and only if and .
In other words, the base must be of the form where is a positive integer and the set of digits is . This result can be used to prove a result about complex radix expansions, found in [11].
Definition 1.2.
Let be a Gaussian integer and . We call any infinite series of the form
(3) |
where is some integer and for all a radix expansion in base .
Theorem 1.3 (I. Katai, J. Szabo, [11], theorem 2).
Suppose is a positive integer and set . Every complex number has a radix expansion in base .
The radix expansions in base featured in Theorem 1.3 are not always unique. In fact, complex numbers can have up to three distinct radix expansions in base [6]. The rules for when two distinct radix expansions in base evaluate to the same complex number are significantly more complicated and present challenges that are not present when working with real numbers. Pedersen and Shaw grappled with some of these challenges in [22].
To state the theorem proved by Pedersen and Shaw in [22], we define a function analogous to the function studied by Davis and Hu in [1]. We provide several supporting definitions that are also used in later sections of this paper.
Definition 1.4.
Fix an integer , let and suppose . We call the attractor of the IFS given by , the restricted digit set generated by and denote it by . In the special case that , then we call the th fundamental tile and denote it by .
Definition 1.5.
Fix an integer and suppose . We call the set of such that is nonempty the fundamental set of translations generated by and denote it by .
Let us recall the definition of the box-counting dimension for subsets of Euclidean space.
Definition 1.6.
Let be a bounded subset of . Given , we let denote the smallest number of sets of diameter needed to cover . The upper box-counting dimension and the lower box-counting dimension of are
(4) | ||||
(5) |
respectively. If these quantities are equal, then that value is the box-counting dimension of and is denoted by .
The box-counting dimension may not always exist. For any positive integer and subset , is self-similar by definition and thus its box-counting dimension exists (see corollary 3.3 in [4]).
Definition 1.7.
Fix an integer and suppose . Let for . We define the function
(6) | |||
(7) |
We can now state the theorem in [22] and our own theorem.
Theorem 1.8 (S. Pedersen, V. Shaw, [22], corollary 7.5).
Fix an integer . Suppose satisfies the condition for all in . Then the level sets of are dense in .
In this paper, we demonstrate that the condition for all in can be significantly relaxed. In fact, it is possible to achieve the result with a lower bound that does not depend on . We state our theorem using the same notation as in Theorem 1.8.
Theorem 1.9.
Suppose one of the following holds
-
(i)
is a positive integer greater than or equal to and satisfies for all .
-
(ii)
is a positive integer greater than or equal to and satisfies for all .
-
(iii)
is one of or and satisfies for all .
Then the level sets of are dense in .
If any of (i), (ii), or (iii) hold, then the level sets of the maps obtained by replacing the box-counting dimension in Definition 1.7 by Hausdorff dimension or packing dimension are also dense in . This is because is of Moran type. We discuss this in Section 4. We provide definitions of Hausdorff dimension and packing dimension in Section 2.
The conditions present in (ii) and (iii) are paired frequently enough that it is convenient to package them as a single definition.
Definition 1.10.
Fix a positive integer and let be a subset of . The set is called sparse if for all either when or when or .
Recall that for a fixed integer and , we use to denote the attractor of the IFS containing all the maps where and . The conditions on the distance between elements of controls the overlaps among the images . If is empty for all , then the IFS defined by is said to satisfy the strong separation condition (SSC). Once a lower bound on the differences is found to imply the SSC, we can employ a technique present in [22] to conclude that the level sets of are dense. The original condition for all in was achieved without leveraging the properties of radix expansions in base . Those properties are intimately connected to the structure of . We achieved (i) by applying the following result of Gilbert [6]. A similar statement can be made for the special case .
Theorem 1.11 (W. Gilbert, [6], proposition 1).
Fix an integer . Let be the attractor of the IFS where . The intersection is nonempty when is a Gaussian integer if and only if .
Theorem 1.11 is used in [6] to derive a graph that describes when two distinct radix expansions in base evaluate to the same complex number. Suppose that for a fixed integer , and are distinct sequences in and is the first index at which the sequences differ. If we have where , then is a consequence of Theorem 1.11. Hence the separation condition of present in (i) of Theorem 1.9.We take this further by determining the upper bound on when for all . This investigation revealed the conditions (ii) and (iii) in Theorem 1.9. In producing this work, we also give a new proof of Theorem 1.11 that differs from Gilbert’s approach.
The results underpinning Theorem 1.9 can also be used to partially address when is self-similar. This is of interest because self-similarity can somtimes be leveraged to make the computation of Hausdorff and box-counting dimension significantly easier (see Theorem 2.5). A sizeable body of work has been produced to determine when is self-similar if it is a subset of the unit interval, ([2], [13], [14], [16], [21], [24], [25]). The existing results connect the self-similarity of to a property called strong eventual periodicity.
Definition 1.12.
A sequence of integers is strongly eventually periodic (SEP) if there exists a finite sequence and a nonnegative sequence , where is a positive integer, such that
(8) |
where denotes the infinite repetition of the finite sequence .
Suppose is the middle third Cantor set () and that is chosen such that is nonempty. It must be the case that where . It is known that is self-similar if and only if is SEP [2].
We establish analogous results for the self-similar sets implicit in Theorem 1.9.
Definition 1.13.
Fix an integer , let , and suppose . We call the attractor of the IFS given by the extended restricted digit set generated by and denote it by . In the special case that , then we call the th extended tile and denote it by .
Definition 1.14.
Let be a Gaussian integer. We call the function given by the -coding map.
We will drop the subscript when it is clear from context.
Theorem 1.15.
Fix an integer and let . Suppose where and that is chosen such that has a unique radix expansion in base . Let , where for each .
If is self-similar and is the attractor of an IFS containing the similarity , then is SEP. Conversely, if is SEP, then is self-similar.
We can also discuss when contains more than two elements. We first introduce a version of strong eventual periodicity for sequences of sets.
Definition 1.16.
A sequence of nonempty subsets of the integers is called strongly eventually periodic (SEP) if there exist two finite sequences of sets and , where is a positive integer, such that
(9) |
where and denotes the infinite repetition of the finite sequence of sets .
Theorem 1.17.
Fix an integer , let , and suppose is such that is sparse. Let where . The set is self similar and is the attractor of an IFS containing a contraction of the form where is a positive integer and is a complex number if and only if the sequence of sets is SEP for some .
We outline the remaining sections of this paper.
-
(1)
In Section 2 we set our notation and recall some definitions and results.
- (2)
-
(3)
In Section 4 we prove Theorem 1.9.
- (4)
2. Background
We recall definitions and facts from fractal geometry. There are multiple kinds of fractal dimensions used to measure the complexity of irregular geometric objects. This paper features two of the most popular, the Hausdorff dimension and the box-counting dimension, and also packing dimension. The definition of the box-couting dimension was given in Definition 1.6. We recall the definitions of Hausdorff dimension and packing dimension in Euclidean space. All three dimensions could be defined for more general metric spaces.
Definition 2.1.
Let be a subset of . Given , the -dimensional Hausdorff content of is the quantity
(10) |
where the infimum is taken over all countable covers of by any subsets of . We call the Hausdorff dimension of .
Definition 2.2.
Let . For , we call a countable (possibly finite) collection of disjoint balls, each with radius less than or equal to and with their center in , a -packing of .
Definition 2.3.
Let be a subset of . Given positive numbers and , and any subset , define the quantity
(11) |
where the supremum is taken over all -packings of . Let . The -dimensional packing measure of is the quantity
(12) |
We call the packing dimension of .
For all bounded subsets of , we have
(13) |
See section 3.4 of [3] for details. For self-similar sets, such as the middle third Cantor set, all four notions of dimension agree (corollary 3.3 in [4]). In particular, if a self-similar set is the attractor of an IFS that satisfies a type of separation condition, then not only do all the dimensions agree but they are easily computable. We recall one of those separation conditions.
Definition 2.4.
Suppose is the attractor of an IFS given by . We say that satisfies the strong separation condition (SSC) if the images and are disjoint for every distinct pair .
Theorem 2.5 (K. Falconer, [4], corollary 3.3).
Suppose is the attractor of the set of similarities . For each , let be the contraction ratio of . If satisfies the SSC, then where is the unique positive solution to .
It is common to state a stronger version of this theorem (see theorem 9.3 of [3]). It replaces the SSC with a weaker notion called the open set condition (OSC). An IFS given by satisfies the OSC if there exists an open set such that . We also remark that the cited statements in [3] and [4] do not mention the packing dimension, but the first inequality in (13) implies the assertion immediately.
3. Neighbouring Tiles
In this section we derive the bounds present in Theorem 1.9 and Theorem 1.17. We begin with two definitions.
Definition 3.1.
Let . We call any Gaussian integer that satisfies
(14) |
a neighbour of .
Definition 3.2.
Fix an integer and set . We call the attractor of the IFS given by the th fundamental tile and denote it by . Similarly, we call the attractor of the IFS given by the th extended tile and denote it by .
Our goal is to find the real neighbours of and for . To this end, we prove the following lemma.
Lemma 3.3.
Fix an integer . Suppose is a neighbour of . Then
(15) |
Moreover for .
Proof.
Let be a neighbour of . For convenience, we set and . By definition there exist sequences and with entries in such that
(16) |
Isolating for yields
(17) |
where for each .
We wish to estimate the difference between the real part of and times its imaginary part. We explicitly compute the first few terms of in terms of . Observe that
(18) |
where denotes the tail .
Explicit computation yields
(19) |
and
(20) |
Subtracting times (20) from (19) yields
(21) |
Recall that range from to . In order to bound with an expression that is only in terms of , we maximize the sum of the first three terms of (21) by choosing and and estimate the absolute value of the last two terms using the bound . This results in the inequality
(22) |
Direct computation with yields bounds less than and . For , observe that we can respectively bound each term of (22) by the following sequences.
(23) | ||||
(24) | ||||
(25) | ||||
(26) |
Consider the sum of all the sequences on the right hand side of a “” sign from (23) to (26). The sum is a strictly decreasing sequence and at is less than . This completes the proof. ∎
Corollary 3.4.
Fix an integer . The set of real neighbours of is
-
(i)
when or .
-
(ii)
when or .
Additionally, the set of real neighbours of is for all .
Proof.
The set of neighbours of when and the set of neighbours of when or can be explicitly computed using the neighbour finding algorithm found in [23]. We prove the remaining cases.
It follows immediately from Lemma 3.3 that the real neighbours of must be in . To see the converse, it can be verified by direct computation that
(27) | ||||
(28) |
where the bar indicates infinite repetition of those digits in the order presented. We include the verification of (27).
Let
(29) | |||
(30) |
Since the sequences of digits are periodic with period two and letting ,
(31) | ||||
(32) |
From these equations it is possible to solve for and explicitly in terms of . We obtain
(33) | ||||
(34) |
We wish to show that
(35) |
Observe that on the left hand side of (35), after bringing it under a common denominator, the numerator is
(36) |
It now can be seen from the right hand side of (35) that it is sufficient to show that
(37) |
We conclude with
(38) | |||
(39) | |||
(40) | |||
(41) |
Now we consider the th extended tile. If is a neighbour of , then where . It follows that the function bounding in (22) merely needs to be doubled in order to bound . Therefore and the real neighbours of are contained in . To see that and are neighbours of for , it can be verified directly that . ∎
We end this section by demonstrating a further application of Lemma 3.3. Gilbert gave a proof of the following result in [6].
Theorem 3.5 (W. Gilbert, [6], proposition 1).
A Gaussian integer is a neighbour of if and only if
-
(i)
and .
-
(ii)
and .
Gilbert used this result to derive the rules governing radix expansions in base (see theorem 5 and theorem 8 of [6]). Our proof, by way of Lemma 3.3, uses a different approach than that of Gilbert.
We first point out the following simple observation.
Lemma 3.6.
Fix an integer . If is a neighbour of , then is a neighbour of for some .
Proof.
Again, there exist sequences and with entries in such that
(42) |
This equation holds if and only if
(43) |
This completes the proof. ∎
We are now in position to prove Theorem 3.5.
Proof of Theorem 3.5.
These case can be computed explicitly using the neighbour finding algorithm in [23]. We proceed assuming . Suppose is a neighbour of .
By Lemma 3.3, if is real, then . That lemma also implies that cannot be purely imaginary. If that were the case, where . This is impossible.
We now claim that cannot be larger than . Let us denote by . Lemma 3.3 implies that is one of , , or . Let us assume is greater than or equal to . The magnitude of is therefore bounded below by . On the otherhand, . We will argue that this quantity is strictly less for . Observe that for
(44) | ||||
(45) | ||||
(46) |
The second inequality holds since . This shows that when , the number is not a neighbour of . The case when is less than or equal to is similar.
The only remaining cases to consider are or . Lemma 3.3 implies that is one of , and .
By Lemma 3.6, if is a neighbour of , there must exist such that is also a neighbour of . The set of neighbours of is a subset of . We observe that . We see that adding an element of (a real number) to this expression cannot result in any of , , and . To see that not a single neighbour is obtainable, we compute using the remaining potential neighbours of .
(47) | ||||
(48) | ||||
(49) | ||||
(50) | ||||
(51) | ||||
(52) |
All of these are either larger than or are not real and therefore are not in . We conclude that is not a neighbour of . Similarly, it can be shown that is not a neighbour of .
We have shown that a neighbour of is an element of the set . To see that the converse also holds, we show that there exists for each . It can be verified explicitly that
(53) | ||||
(54) | ||||
(55) | ||||
(56) | ||||
(57) | ||||
(58) |
The verification can be performed in the same way as in the proof of Corollary 3.4.
∎
4. An Application to Box-Counting Dimension
In this section we prove Theorem 1.9. Let us recall the definition of the box-counting dimension.
Definition 4.1.
Let be a bounded subset of . Given , we let denote the smallest number of sets of diameter needed to cover . The upper box-counting dimension and the lower box-counting dimension of are
(59) | ||||
(60) |
respectively. If these quantities are equal, then that value is the box-counting dimension of and is denoted by .
It is known that we can replace the function with the function that counts the number of -mesh cubes that intersect and still capture the upper and lower box-counting dimensions (see 3.1 in [3]). This is the collection of cubes . In the plane, it is a collection of squares. For our purposes, we wish to count translations of scalings of the th fundamental tile (see Definition 3.2).
Definition 4.2.
Let be the attractor of an iterated function system and let be a positive integer. A -tile of is any set of the form .
For , the -tiles of are the sets , where . The following lemma, Lemma 4.3, allows us to trade counting boxes with counting -tiles in order to compute the upper and lower box-counting dimensions.
Lemma 4.3.
Fix an integer . Let be a nonempty subset of . For a fixed integer , let denote the number of -tiles of that intersect . Then
(61) | ||||
(62) |
The proof of this result can be found in [22]. Computing can be made easier if -tiles are disjoint. We provide a sufficient condition.
Lemma 4.4.
Fix an integer . Let satisfy for all . The -tiles and of are disjoint whenever for some and for each .
Proof.
Suppose that and are distinct tuples with for each . Let be the smallest index in the set at which the specified digits differ. Suppose that the intersection of the two tiles is nonempty. By definition, there exists sequences and with for each such that . Multiplying by and then subtracting on both sides yields and thus is a neighbour of where . This contradicts Corollary 3.4. ∎
Theorem 4.5 and Theorem 4.9 are extensions of theorem 7.4 in [22]. Recall that denotes the restricted digit set generatedy by (see Definition 1.4).
Theorem 4.5.
Fix and suppose is such that for all . If such that , then
(63) |
where .
Remark 4.6.
The result in [22], theorem 7.4, requires that for all as opposed to the separation condition of . We also mention that the lower box-counting dimension could be replaced with the upper box-counting dimension.
Proof.
Let . According to Lemma 4.3, it suffices to prove that for contants . This will hold if we show that the collection of -tiles , where covers and each -tile in the cover intersects .
Let be a -tile with for . For each , there exists such that equation holds. In general, with for each . Consider the number such that for all and for all . Immediately we see that is an element of . Since the number given by is also an element of , it follows that . Therefore intersects . We conclude that .
Now we argue that for any positive integer the is covered by the -tiles which specifiy digits in for each . Let . This means there exists sequences and such that
(64) |
Recall that for each . Adding to both sides of (64) yields
(65) |
Since for all , and , and are all elements of for all , their pairwise sums are in . Furthermore, any separation condition on the elements of holds if and only the same condition holds for elements of . This is because for any collection of integers . It follows from Lemma 4.4 that . In particular, and we conclude that for any where . It follows from Theorem 3.5 that each of these -tiles intersects at most -tiles of . This yields . ∎
The following example is an application of Theorem 4.5 to a case that is not covered by theorem 7.4 in [22].
Example 4.7.
Let . The subsets of for which are subsets of . The constraint that every pair of elements satisfies yields the following subsets of that are not singletons: , , , , , , and . If is a singleton, then so is . The box-counting dimension of , and consequently for any , is zero in that case.
Suppose we choose . Therefore is equal to . The intersection of and its translation by is nonempty. We compute its box-counting dimension. Since and , it follows that
(66) |
Therefore for all . In particular,
(67) |
By Theorem 4.5, we conclude that .
It is possible to remove the bound of when the elements of satisfy a larger separation condition.
Fix a positive integer and let be a subset of . Recall that the set is called sparse if for all either when or when or .
The following lemma is analogous to Lemma 4.4, but addresses the th extended tile (see Definition 3.2) rather than the th fundamental tile .
Lemma 4.8.
Fix an integer and suppose is chosen such that is sparse. The -tiles and are disjoint whenever for some index where for each .
Proof.
Suppose and for all distinct . Suppose is not empty. We can deduce in the same way as in the proof of Lemma 4.4 that an integer with magnitude greater than is a neighbour of . This contradicts Corollarly 3.4. Similarly, if or and and we assume that the intersection is nonempty, we also obtain a contradiction with Corollary 3.4. ∎
Theorem 4.9.
Fix and integer and suppose is chosen such that is sparse. If such that , then
(68) |
where .
This extends the application of the formula to sets that are not covered by Theorem 4.5. For example, for those sets defined using and . Theorem 4.5 does apply to some cases that Theorem 4.9 does not. For example, and .
Proof.
Let . The same argument used in the proof of Theorem 4.5 can be used to show that and so we omit it. Let us skip to showing that every is contained in a -tile for any positive integer whose defining digits are in for each .
For , there exists sequences and such that
(69) |
Substracting from the equation and obtain
(70) |
The conclusions present in Theorem 1.9 now follow as corollaries of Theorem 4.5 and Theorem 4.9. We include the proof from [22] for completeness. For a fixed integer and a subset , set . Recall that denotes the fundamental set of translations . Recall the function given by
Corollary 4.10.
Fix an integer . Suppose either that satisfies for all or that is chosen such that is sparse. The level sets of are dense in .
Proof.
Let be given. We construct in the domain of such that where . The where . For any radius , there exists an index at which any complex number of the form with is within distance of . We now describe how to choose the such that satisfies the desired properties.
Suppose . There exists a sequence of integers such that . Since we see that . It follows that either or . Let and denote the maximum and minimum of respectively. For all , let
(71) |
It follows that is equal to either or for . The key observation here is that in either case this is .
It immediately follows that the function is discontinuous everywhere on its domain.
We end this section by establishing versions of Corollary 4.10 for Hausdorff dimension and packing dimension. See Definition 2.1 and Definition 2.3 for details.
Definition 4.11.
Fix an integer and suppose . Let for . We define the functions
(77) |
Under the conditions of Corollary 4.10, we can show that the level sets of these functions are also dense in .
Definition 4.12.
Let be a sequence of positive integers, and let be a sequence of vectors such that for all and . Let be a compact set with nonempty interior. Let denote a set of subsets of indexed by where . Given two words and , we denote their concatenation by .
The set is said to satisfy the Moran structure given by if it satisfies the following four conditions:
-
(i)
.
-
(ii)
For any , there exists a similarity such that .
-
(iii)
For any and , the interiors of and are disjoint for all such that .
-
(iv)
For any and , , .
For satisfying the Moran structure, set and . We call the Moran set associated with the collection .
It is known that the Hausdorff dimension and packing dimension of a Moran set can be expressed in terms of a sequence derived from the “contraction coefficients” .
Theorem 4.13 (Hua S., Rao H., Wen Z., Wu J., [7], theorem 1.1).
Suppose is the Moran set associated with a collection satisfying the Moran structure given by . For each , let be the solution to the equation where for . If , then
(78) | ||||
(79) |
This is useful because the sets of the form are Moran sets under conditions on and . This allows us to state the following result.
Theorem 4.14.
Fix an integer . Suppose either that satisfies for all or that is chosen such that is sparse. The level sets of and are respectively dense in .
Proof.
Let . We begin by arguing that the set is a Moran set whenever . It follows from the definition of that where for each . Choose , such that the entries of every vector are , and . Let denote the set of cylinders of the form where for . The set is then the Moran set associated with the collection . Additionally, since the entries of the vector are the constant for every , the infimum across all entries of vectors in the sequence is greater than zero.
5. Applications to Self-Similarity
In this section we prove Theorem 1.15 and Theorem 1.17. Let us recall the notion of strong eventual periodicity for sequences of sets from the introduction.
Definition 5.1.
A sequence of integers is strongly eventually periodic (SEP) if there exists a finite sequence and a nonnegative sequence , where is a positive integer, such that
(80) |
where denotes the infinite repetition of the finite sequence .
The following is a convenient sufficient condition for the SEP property.
Lemma 5.2.
Let be a bounded sequence of nonnegative integers. If there exists a positive integer such that for all , then is SEP.
Proof.
Since is bounded for all , there exists a positive integer such that is constant for all and . It follows that there exists a positive integer such that .
For each , there exist non-negative integers where such that
(81) | ||||
(82) | ||||
(83) | ||||
(84) |
By choosing for and , we obtain . ∎
The following fact about self-similar sets is also useful.
Lemma 5.3.
Let be an element of . If is self-similar and is the attractor of the IFS given by where is a linear transformation from to and , then the translation is also a self-similar set and is the attractor of the IFS .
Proof.
Since is a nonempty compact set, so is . Since attractors are unique we need only observe that . ∎
Fix an integer and suppose . Given with , we wish to relate the self-similarity of to the condition that is SEP. The first step is to express in terms of the sequence of sets . Recall that denotes the extended restricted digit set generated by (see Definition 1.13).
Lemma 5.4.
Fix an integer and suppose . If has a unique radix expansion in base , then .
Proof.
Assume that where for all and is unique. Let denote . If , then and . On one hand, with for all . On the other, there exists such that . Similarly, where for all . We conclude that where for all . Since the radix expansion in base of is unique, we conclude that and, in particular, for all . This means that for all . We leave the inclusion for the reader. ∎
Lemma 5.4 will be used in the proofs of Theorem 1.15 and Theorem 1.17. In the case of Theorem 1.15, we transform the set once more.
Definition 5.5.
Fix an integer , , , and choose such that has a unique radix expansion in base . We call , where for each , the minimal element of .
Lemma 5.6.
Fix an integer and suppose where . If has a unique radix expansion in base and is the minimal element of . Then and is a subset of .
Proof.
By Lemma 5.4, we can equate and . It follows that is equal to .
It is sufficient to show that for any , the condition and , holds if and only if is an element of . There are three possible values for for each . If , and and it is now clear that the bi-implication holds. If , we obtain the same equations. When , and . Since is equal to , the bi-implication holds for this case too.
Lastly, from these calculations we see that is a subset of for all , no matter the value . ∎
We state an extended version of Theorem 1.15.
Theorem 5.7.
Fix an integer and let . Suppose where and that is chosen such that has a unique radix expansion in base . Let be the minimal element of .
If is self-similar and is the attractor of an IFS containing the similarity , then is SEP.
Conversely, if is SEP and so by definition can be written as , then is self-similar and is the attractor of the IFS containing all maps of the form
where for each , such that and .
We follow the proof strategy for theorem 1.2 in [16].
Proof.
Assume that is an SEP sequence of integers. By definition there exist integers and such that .
By Lemma 5.6, is equal to .
Suppose is an element of . Therefore with , for each . Let us organize the expansion as
(85) |
where and for and integers . It follows that can be decomposed into a sum where . Let us relabel as for . After making this substitution we can rearrange the terms to obtain
(86) |
We now see that is an element of the attractor of the IFS , . We leave the other inclusion to the reader. By Lemma 5.3, is self-similar because is self-similar.
Now let us assume is self-similar and is generated by an IFS containing the map . It follows from Lemma 5.3 that is self similar and is generated by an IFS containing the map . Observe that is trivially SEP. Suppose at least one of the entries of is non-zero.
For the sake of simple notation, let . It follows from Lemma 5.6 that contains for some positive integer . Therefore is an element of and, in particular, can be expressed as where . Isolating for yields
(87) |
For every , we have that
(88) | ||||
(89) |
is an element of . By Lemma 5.6, it is also an element of . Therefore where . We now argue that the expansion in (89) is . If , the desired result immediately follows from Lemma 4.4. Suppose . The number is equal to and is also an element of . It follows from Lemma 4.4 that and for all . We obtain the desired result by multiplying back by .
Observe that implies that for some . In particular, since , it must be that we can choose . Otherwise, is a nonzero Gaussian integer and thus has magnitude greater than one. Fix such a . It follows from the discussion above that for all . Since is an element of , it follows from Lemma 5.6 that for all . Therefore for all where is a positive integer. We conclude that the sequence is SEP by Lemma 5.2. ∎
Recall that for a fixed integer and a set , the set is called sparse if for all either when or when or . In the statement of Theorem 5.7, if , then would be sparse and it would follow from Lemma 4.8 that a radix expansion in base of any is unique. The condition that be sparse is stronger than the assumption that is chosen to have a unique radix expansion. This stronger assumption does let us treat sets of digits that contain more than two elements. To state that the theorem, we recall the strong eventual periodicity of sequences of sets.
Definition 5.8.
A sequence of nonempty subsets of the integers is called strongly eventually periodic (SEP) if there exist two finite sequences of sets and , where is a positive integer, such that
(90) |
where and denotes the infinite repetition of the finite sequence of sets .
Remark 5.9.
There is a connection between the SEP property for sequences of sets and the SEP property of sequences of integers. If the sequence is SEP, then so is . For each , . It can be shown that if is SEP and that each is an arithmetic progression with a common step size for all , then is SEP where . In the context of Theorem 5.7, it follows that is an SEP sequence of sets.
The following is a convenient sufficient condition for the SEP property that is analogous to lemma 5.2.
Lemma 5.10.
Let be a sequence of subsets of such that there exists such that and a bound, for all , on the cardinality of . If there exists a sequence of subsets of such that , then is SEP.
Proof.
The uniform bound on the cardinality of for all together with the assumption implies that the existence of a postive integer , such that for all and . It follows that for ,
(91) | ||||
(92) | ||||
(93) | ||||
(94) |
By choosing for and , we obtain . ∎
Theorem 5.11.
Fix an integer and suppose is such that is sparse. Let where . The set is self similar and is the attractor of an IFS containing a contraction of the form where is a positive integer and is a complex number if and only if the sequence of sets is SEP for some .
Moreover, since is SEP and by definition can be written as , the set is the attractor of the IFS containing all maps of the form
where and for each .
We follow the proof strategy for theorem 1.2 in [21].
Proof.
Suppose is such that is an SEP sequence of sets. By definition there exist sets and such that .
Since is sparse it follows from Lemma 4.8 that has a unique radix expansion in base . Therefore, by Lemma 5.4, we have . It follows that is equal to .
Suppose is an element of . Therefore with . By assumption, we can write
(95) |
where and . We can rearrange the terms to obtain
(96) |
We now see that is an element of the attractor of the IFS . We leave the other inclusion to the reader. By Lemma 5.3, is self-similar because is self-similar.
Conversely, assume that is generated by the IFS of the form . Let . By Lemma 5.3, is generated by the IFS where . Therefore . It follows that contains the origin. Therefore is an element of and has the expansion where . The presence of the origin also means is an element of for . It follows that each can be expanded into where .
Define . We now argue that for all .
Let . There exists and , for some , such that . Choose such that its th digit is . Then is an element of . Therefore it also has an expansion where for each . It follows that
(97) |
We deduce that by applying Lemma 4.8. Therefore . Observe now that if , then
(98) | ||||
(99) |
This is a contradiction. Therefore for all .
Since is among the contractions generating , it follows that for all . We also recall that for all . By Lemma 5.10, it follows that is SEP. ∎
Remark 5.12.
The assumption that is the linear factor of one of the contractions, while sufficient, may be unnecessary.
Let us now recall the significance of self-similarity by recalling Theorem 2.5. A finite collection of similarities satisfies the strong separation condition (see Definition 2.4), then the attractor of the IFS has box-counting dimension, Hausdorff dimension, and packing dimension equal to the unique that satisfies where each is the contraction factor of the similarity . We can use this fact from fractal geometry to find the fractal dimension of for a suitable pair and , and choice of . We present two results, one aligned with Theorem 5.7 and another with Theorem 5.11.
Corollary 5.13.
Fix an integer and let . Suppose where and that is chosen such that has a unique radix expansion in base . Let the finite collections of integers and be such that . Then the following equation holds.
(100) |
where .
Proof.
Let denote the minimal element of . By Theorem 5.7, is self-similar and in particular, is the attractor of the collection of similarities of the form where such that and for each .
Suppose and are functions of that form and suppose there exist , such that . Let us denote parameters of and by and respectively. By Lemma 5.6, for with such that for each . It follows that
(101) | ||||
(102) |
where we recall that for , for and for . It follows that both (101) and (102) are radix expansions in base . Since , it follows from Lemma 4.4 that and for each . Suppose for some , we have . Without loss of generality, suppose . It follows that . Therefore . This is contradiction because , which can never be . We conclude that . We conclude that . If , then and are disjoint.
By Theorem 2.5, the box-counting, Hausdorff, and packing dimensions of , and thus are both equal to the value satisfying . ∎
Corollary 5.14.
Fix an integer and suppose is such that is sparse. Let where .
Let the finite collections of sets and be such that for some sequence of . If for each , then
(103) |
where .
We know that the sets and exist by the definition of SEP. We remark that the condition is equivalent to the condition that every element of has a unique decomposition of the form where and .
Proof.
By Theorem 5.11, is self-similar and in particular, is the attractor of the collection of similarities of the form where and can be any of the elements in and respectively.
Suppose and are functions of that form and suppose there exist , such that . Let us denote the parameters of and by and respectively. By for where . It follows that
(104) | ||||
(105) |
where we recall that for , is an element of for and of for . It follows that both (104) and (105) are radix expansions in base . Since is sparse, it follows from Lemma 4.8 that and for each . The assumption implies that and, in particular, . We conclude that . If , then and are disjoint.
By Theorem 2.5, the box-counting, Hausdorff, and packing dimensions of , and thus are both equal to the value satisfying . ∎
We end by computing the dimension of the set given in Example 4.7 a second time.
Example 5.15.
Let . Suppose we choose . Therefore we have . The intersection of and its translation by is nonempty. We compute its box-counting, Hausdorff, and packing dimensions.
Not only is , but by Lemma 4.8, the radix expansion of in base is unique. Therefore we can apply Corollary 5.13. The sequence is equal to . Matching the notation of Corollary 5.13, we have , , and . Therefore
(106) |
Acknowledgement
The author would like to thank Professor Derong Kong at Chongqing University for his observations that improved the strength of some of the results and the quality of the manuscript. The author is also grateful for the continued support of his doctoral advisors, Francesco Cellarosi and James Mingo, whose comments improved the readability of the manuscript.
References
- [1] G.J. Davis and T.-Y. Hu. On the intersection of two middle third Cantor sets. Pub. Math., 39:43–60, 1995.
- [2] G-T. Deng, X-G. He, and Z-X. Wen. Self-similar structure on intersection of triadic Cantor sets. J. Math. Anal. Appl., 337:617–631, 2008.
- [3] K. Falconer. Fractal Geometry:Mathematical Foundations and Applications. John Wiley and Sons, 1990.
- [4] K. Falconer. Techniques in Fractal Geometry. John Wiley and Sons, 1997.
- [5] W. J. Gilbert. Radix representations of quadratic fields. J. Math. Anal. Appl., 83:264–274, 1981.
- [6] W. J. Gilbert. Complex numbers with three radix expansions. Can. J. Math., 34:1335–1348, 1982.
- [7] S. Hua, H. Rao, Z. Wen, and J. Wu. On the structures and dimensions of Moran sets. Science in China, 43:836–852, 2000.
- [8] Y. Huang and D. Kong. Intersections of middle- Cantor sets with a fixed translation. Nonlinearity, 36:1461–1490, 2023.
- [9] J. E. Hutchinson. Fractals and self similarity. Indiana University Mathematics Journal, 30:713–747, 1981.
- [10] I. Katai and B. Kovács. Canonical number systems in imaginary quadratic systems. Acta Math. Acad. Sci. Hungar., 39:159–164, 1981.
- [11] I. Katai and J. Szabo. Canonical number systems for complex integers. Acta Sci. Math, 37:255–260, 1975.
- [12] D. Knuth. An imaginary number system. Comm. ACM, 3:245–247, 1960.
- [13] D. Kong. On the self similarity of generalized Cantor sets. Sci. Sin. Math, 44:945–956, 2014.
- [14] D. Kong, W. Li, and M. Dekking. Intersections of homogeneous Cantor sets and beta-expansions. Nonlinearity, 23:2815–2834, 2010.
- [15] W. Li and X. Dongmei. Self-similar structure on intersection of homogeneous symmetric Cantor sets. Acta Math. Scientia, 19:214–219, 1999.
- [16] W. Li, Y. Yao, and Y. Zhang. Self-similar structure on intersection of homogeneous symmetric Cantor sets. Math. Nachr., 284:298–316, 2011.
- [17] F. Nekka and J. Li. Intersections of triadic Cantor sets with their rational translates. Chaos Solitons Fractals, 13:1807–1817, 2002.
- [18] F. Nekka and J. Li. Intersections of triadic Cantor sets with their translates. ii Hausdorff measure spectrum function and its introduction for the classification of Cantors sets. Chaos Solitons Fractals, 19:35–46, 2004.
- [19] S. Pedersen and J. D. Philips. Intersections of certain deleted digit sets. Fractals, 20:105–115, 2012.
- [20] S. Pedersen and J. D. Philips. On intersections of Cantor sets: Hausdorff measure. Opuscula Math., 33:575–598, 2013.
- [21] S. Pedersen and J. D. Philips. On intersections of Cantor sets: self-similarity. Commun. Math. Anal., 16:1–30, 2014.
- [22] S. Pedersen and V. T. Shaw. Dimension of the intersection of certain Cantor sets in the plane. Opuscula Math, 41:227–244, 2021.
- [23] K. Scheicher and J. M. Thuswaldner. Neighbours of self-affine tiles in lattice tilings. In Fractals in Graz 2001, pages 241–262. Birkhäuser Basel, 2003.
- [24] Y. Zou, W. Li, and C. Yan. Intersecting nonhomogeneous Cantor sets with their translations. Nonlinear Analysis, 74:4660–4670, 2011.
- [25] Y. Zou, J. Lu, and W. Li. Self-similar structure on the intersection of middle- Cantor sets with . Nonlinearity, 21:2899–2910, 2008.