New fractal dimensions and some applications to arithmetic patches
Kota Saito

TL;DR
This paper introduces new fractal dimensions called upper and lower zeta dimensions to measure set roughness and applies these to prove the existence of weak arithmetic patches, solving a higher-dimensional Erdős-Turán conjecture.
Contribution
The paper defines new fractal dimensions extending existing concepts and applies them to arithmetic patches, providing a solution to a higher-dimensional Erdős-Turán conjecture.
Findings
Upper zeta dimension bounds the Assouad dimension from below.
Existence of weak arithmetic patches in specific sets like irreducible elements and prime numbers.
Affirmative solution to a higher-dimensional weak Erdős-Turán conjecture.
Abstract
In this paper, we define new fractal dimensions of a metric space in order to calculate the roughness of a set on a large scale. These fractal dimensions are called upper zeta dimension and lower zeta dimension. The upper zeta dimension is an extension of the zeta dimension introduced by Doty, Gu, Lutz, Elvira, Mayordomo, and Moser. We show that the upper zeta dimension is always a lower bound for the Assouad dimension. Moreover, we apply the upper zeta dimension to the existence of weak arithmetic patches of a given set. Arithmetic patches are higher dimensionalized arithmetic progressions. As a corollary, we get the affirmative solution to a higher dimensional weak analogue of the Erd\H{o}s-Tur\'an conjecture. Here the one dimensional case is proved by Fraser and Yu. As examples, we prove the existence of weak arithmetic patches of the set of all irreducible elements of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals · Analytic Number Theory Research · Limits and Structures in Graph Theory
New fractal dimensions and some applications to arithmetic patches
Kota Saito
Kota Saito
Graduate School of Mathematics
Nagoya University
Furocho
Chikusa-ku
Nagoya
464-8602
Japan
Abstract.
In this paper, we define new fractal dimensions of a metric space in order to calculate the roughness of a set on a large scale. These fractal dimensions are called upper zeta dimension and lower zeta dimension. The upper zeta dimension is an extension of the zeta dimension introduced by Doty, Gu, Lutz, Elvira, Mayordomo, and Moser. We show that the upper zeta dimension is always a lower bound for the Assouad dimension. Moreover, we apply the upper zeta dimension to the existence of weak arithmetic patches of a given set. Arithmetic patches are higher dimensionalized arithmetic progressions. As a corollary, we get the affirmative solution to a higher dimensional weak analogue of the Erdős-Turán conjecture. Here the one dimensional case is proved by Fraser and Yu. As examples, we prove the existence of weak arithmetic patches of the set of all irreducible elements of , and the set of all prime numbers of the form , where is an imaginary quadratic integer and denotes the -th prime number.
Key words and phrases:
Fractals, box dimensions, zeta dimensions, Assouad dimension, asymptotic dimension, arithmetic progressions, arithmetic patches, Erdős-Turán conjecture
2010 Mathematics Subject Classification:
Primary: 11B25, 28A80.
1. Introduction
Fractal dimensions are main methods to analyze the roughness of a set. In this paper, we analyze the roughness of a set on a large scale. The first goal of this paper is extending the domain of the zeta dimension to a general metric space. The second is comparing the extended zeta dimension to the Assouad dimension. The third is applying to the existence of higher dimensional ‘weak’ arithmetic progressions of given sets. The zeta dimension was introduced by Doty, Gu, Lutz, Mayordomo, and Moser [DGLMM]. For every , the zeta dimension of is defined as
[TABLE]
where the function is defined by
[TABLE]
and denotes the Euclidean norm on . Note that the domain of the zeta dimension is only the family of all subsets of . For every discrete set ,
[TABLE]
is called the exponent of [EL]. It is clear that if is a subset of . Thus can be considered as an extension of the zeta dimension. The first goal of this paper is to give another extension of the zeta dimension for a general metric space. Let us define new fractal dimensions. Let be a metric space, and fix . For every , the upper zeta dimension of is defined by
[TABLE]
and the lower zeta function of is defined by
[TABLE]
Here denotes that the closed ball centered at with radius , and denotes the smallest number of sets with diameter less than or equal to required to cover . In Section 2, we will show that the limits on the right hand sides of (1.4) and (1.5) go to infinity or converge, moreover, the upper and lower zeta dimensions do not depend on the choice of any .
Theorem 1.1**.**
For every set satisfying , we have
[TABLE]
In particular, for all , we have
[TABLE]
The upper zeta dimension can be considered as an extension of the classical zeta dimension (1.1) from Theorem 1.1.
The second goal of this paper is to find the inequalities among the upper zeta, lower zeta, and Assouad dimensions. The Assouad dimension was introduced by Assouad [As]. The precise definition of the Assouad dimension will be given in Section 3. We refer [Fr1, R] to the reader who wants to know details. For every metric space , denotes the Assouad dimension of . As a result, we get the following relations:
Theorem 1.2**.**
For all metric space , we have
[TABLE]
This theorem is an analogue of the formula
[TABLE]
where is any bounded metric space. Here we define
[TABLE]
for every metric space . We say that is the lower box dimension of , and is the upper box dimension of . The formula (1.6) can be seen in [Fr1, R]. The Assouad dimension is always an upper bound for the Hausdorff dimension. We refer the reader to [F, R] for more details on Hausdorff and box dimensions. In Appendix A, we will show that the upper and lower zeta dimensions share some properties with the upper and lower box dimensions, respectively.
Theorem 1.3** (quasi-isometric invariance).**
Let and be metric spaces. If is quasi-isometric i.e. there exist and such that for all
[TABLE]
holds, then we have
[TABLE]
The asymptotic dimension which is introduced by Gromov [G] is also a quasi-isometrically invariant dimension. Other classical dimensions such as lower, Hausdorff, packing, lower box, upper box, and Assouad dimensions are not invariant with respect to quasi-isometric since a map from a bounded open set to a singleton is quasi-isometric. We will give the precise definition of the asymptotic dimension of a metric space in Appendix B. This dimension is considered as an large-scale analogue of the topological dimension. We refer [BD] to the reader for more details. On the other hand, the lower and upper zeta dimensions can be considered as large-scale analogues of the lower and upper box dimensions, respectively, since it follows that
[TABLE]
for every , , and . Note that the zeta dimensions for a subset of do not depend on the choice of any or . We will prove the formula (1.8) in Section 2. The topological dimension of a compact set is always a lower bound for the lower box dimension of the set. Thus we might guess that the asymptotic dimension would be always a lower bound for the lower zeta dimension. However, it fails in general. In Appendix B, we will construct an example of a set of which the asymptotic dimension equals , but the lower zeta dimension equals [math]. We do not find any relations between the asymptotic dimension and the zeta dimensions in this paper. Thus we propose the following remaining question:
Question 1.4**.**
Are there any relations between the asymptotic dimension and zeta dimensions?
The third goal of this paper is to apply the upper zeta dimension to the existence of higher dimensional ‘weak’ arithmetic progressions. Here we now define an arithmetic patch which is a higher dimensionalized arithmetic progression [FY1]. Let be a linearly independent set of vectors in where . For every and we say that a set is an arithmetic patch (AP) of size and scale with respect to orientation if
[TABLE]
for some . For every , we say that is a -AP if there exists an arithmetic patch of size , and scale with respect to orientation such that
[TABLE]
and
[TABLE]
Note that -APs of real numbers are ordinary arithmetic progressions of length . Fraser and Yu gave the original notion of -APs in [FY1]. The term ‘-APs’ was firstly seen in [FSY]. The existence of -APs of a given set is strongly connected with the Assouad dimension of . Fraser and Yu showed that a subset of has Assouad dimension if and only if the set contains -APs for every , , and basis . Note that Fraser and Yu say that aymptotically contains arbitrarirly large arithemetic patches in [FY1] if contains -APs for every , where denotes some fixed basis on . Furthermore, Fraser, the author, and Yu gave the quantitative upper bound of the Assouad dimension of a subset of which does not contain -APs. We will restate this result more precisely in Section 4.
Recently, problems finding arithmetic progressions get interests from many researchers. For examples, Szemerédi showed that any subset of positive integers with positive upper density contains arbitrarily long arithmetic progressions, which is called Szemerédi’s theorem [Sz]. Furstenberg and Katznelson gave an higher dimensional extension of Szemerédi’s theorem [FK, Theorem B]. Furthermore, Green and Tao showed that the set of all prime numbers contains arbitrarily long arithmetic progressions [GT], which is called the Green-Tao theorem. Tao also gave an extension of the Green-Tao theorem for the set of all primes in . From his result, the set of all primes in contains -APs for every . One of the biggest conjectures on the existence of arithmetic progressions is the Erdős-Turán conjecture. This conjecture states that a subset of positive integers whose sum of reciprocals is divergent would contain arbitrarily long arithmetic progressions. Note that the Erdős-Turán conjecture is still open even if the length of arithmetic progressions is equal to 3.
Theorem 1.5** (Fraser and Yu [FY1]).**
Any subset of positive integers whose sum of reciprocals is divergent contains -APs for every and .
Theorem 1.5 can be considered as a weak affirmative solution to the Erdős-Turán conjecture. Fraser gave an elementary proof of Theorem 1.5 in [Fr2]. If we could replace to in Theorem 1.5, we got the affirmative solution to the Erdős-Turán conjecture. However, we do not get results on the case when in this paper. As an application, we get the following higher dimensional and quantitative extension of Theorem 1.5;
Corollary 1.6**.**
Let be a subset of satisfying . for all distinct elements . Fix , , and . If the series
[TABLE]
is divergent for some
[TABLE]
then contains -APs for every a set of orthogonal unit vectors .
Moreover, we can get the following corollary:
Corollary 1.7**.**
Let be a subset of such that
[TABLE]
holds for every . Then contains -APs for every , , and orthonormal basis .
Fraser and Yu have already given another higher dimensional extension of Theorem 1.5 [FY2]. They replace to in (1.10) where . Neither the extention by Fraser and Yu implies Corollary 1.7, nor does Corollary 1.7 imply the extension by Fraser and Yu.
As applications of Corollary 1.7, in Section 5 we will show the existence of -APs of the set of all irreducible elements of , and the set of all prime numbers of the form , where is an imaginary quadratic integer and denotes the -th prime number.
Question 1.8**.**
Let be the standard basis of . Is it true that any subset of satisfying
[TABLE]
contains -APs for every ?
This is a higher dimensional extension of the Erdős-Turán conjecture. The answer to Question 1.8 would be ‘yes’ in the view of Corollary 1.7. In particular, this was conjectured by Graham when [GO, Conjecture 11.5.7].
Notation 1.9**.**
Let be a metric space. We give the following notations:
- •
For every set , denotes the maximum of lower bounds of where we define if , and denotes the minimum of upper bounds of where we define if and if does not have any upper bounds;
- •
The diamiter of is defined by ;
- •
For every set , denotes the cardinality of ;
- •
Let be a subspace of . A finite family of sets is called an -cover of if the union of all sets in contains and the diameter of is less than or equal to for every ;
- •
We can rewrite N(E,r)=\min\{|\mathcal{U}|\colon\mathcal{U}\text{ is an rE}\}, where if there does not exist any -covers of .
2. Well-definedness of the upper and lower zeta dimensions
Let be a metric space. For every , , and , we define
[TABLE]
and
[TABLE]
We firstly show the well-definedness of the upper and lower zeta dimensions i.e. the limits
[TABLE]
exist or go to infinity. Note that the limits of and with respect are formally equal to and , respectively. Before proof, we show the following lemma:
Lemma 2.1**.**
Let be a metric space. For every , , and , we have
[TABLE]
and
[TABLE]
Proof.
Fix and let . If , then for any fixed there exist and such that holds for all . Thus by taking the logarithm on both sides, we obtain
[TABLE]
for all . Therefore we get
[TABLE]
Conversely, let
[TABLE]
If , then for every there exists such that
[TABLE]
for all . Thus it follows that , which implies from (2.1). By the above proof, is equivalent to . Therefore we have (2.3). Similarly we have (2.4). ∎
Thanks to Lemma 2.1, we can easily see that
[TABLE]
for every since it follows that
[TABLE]
from the definition. By combining (2.6) and Lemma 2.1, we obtain the inequalities (2.5). Furthermore, the inequalities (2.5) imply that
[TABLE]
exist or go to infinity. Hence the upper and lower zeta dimensions are well-defined.
We next see that the upper and lower zeta dimensions do not depend on the choice of any , that is, the following lemma holds:
Lemma 2.2**.**
Let be a metric space. We have
[TABLE]
for every , , and .
Proof.
Let . It follows that for every since if holds, then we obtain by the triangle inequality. Hence we have
[TABLE]
by definition. By Lemma 2.1, this yields that
[TABLE]
Similarly, we have the opposite inequality . Therefore holds. By the same way, we obtain . ∎
Furthermore, we will show that and do not depend on the choice of any if the Assouad dimension of is finite. Here the Assouad dimension of is defined by
[TABLE]
Lemma 2.3**.**
Let be a metric space of which the Assouad dimension is finite. Fix We have
[TABLE]
for every , and .
Proof.
Fix . Without loss of generality, we may assume that . Thus by the inequality (2.5), it is enough to show that
[TABLE]
for every . Fix real numbers and with , and fix . From the condition and the monotonicity of the Assouad dimension, it follows that . Thus we can take an -cover of , where . Each intersects with because of the minimality of . From the triangle inequality, there exists a family of closed balls centered at an element in with radius such that for all . Fix . From the finiteness of the Assouad dimension of , there exists such that
[TABLE]
where does not depend on or . Hence can be covered by at most sets with diameter less than or equal to . Hence we obtain
[TABLE]
By Lemma 2.1, we conclude (2.10). ∎
Remark 2.4**.**
Let be a metric space of which the Assouad dimension is finite. Thanks to Lemma 2.2 and Lemma 2.3, we obtain that
[TABLE]
for every , , and . In particular, if is a -dimensional Banach space, then the Assouad dimension of is equal to . Therefore by Lemma 2.1 we get the equivalent forms
[TABLE]
for every , , and . Furthermore, if satisfies that there exists such that for all with , then we have
[TABLE]
for every , which implies that
[TABLE]
for every .
3. Proof of Main Results
Proof of Theorem 1.2.
By Lemma 2.1, then it is clear that . We show that . If holds, it is clear that . Thus we may assume that . We choose any such that . From the definition of the Assouad dimension, there exists such that for all , , and we have
[TABLE]
We now fix and . Then the following inequality holds:
[TABLE]
By Lemma 2.1, we conclude . ∎
Proof of Theorem 1.3.
We write as the closed ball of centered at with radius . Fix any sufficiently large and . We take any -cover of , where let . Then
[TABLE]
can cover since it follows that
[TABLE]
Furthermore, the diameter of is less than or equal to for every . Hence we have
[TABLE]
Therefore Lemma 2.1 and (3.1) imply that
[TABLE]
We next take any -cover of , where let . Then
[TABLE]
can cover since it follows that
[TABLE]
The diameter of is less than or equal to for every . Hence we have
[TABLE]
Lemma 2.1 and (3.2) imply that
[TABLE]
∎
Before proving Theorem 1.1, we define the function and the notion -net. We say that a metric space is -discrete if holds for all , and we say that is partially finite if is finite for all and . Let be a metric space, be a partially finite and -discrete subspace of for some , and fix any . The function is defined by
[TABLE]
for every . Note that holds if the metric function is the Euclidean metric and , where the definition of is given in 1.2. Hence the function can be considered as an extension of the function to a partially finite and -discrete metric space. We next say that a set is an -net of for some fixed if we have
- (i)
is -discrete, and
- (ii)
for all there exists such that .
From the Zorn’s lemma, for every , there exists a set satisfying (i) and (ii). We will give a proof of the existence of an -net in Appendix A. We say that is a net of if is an -net of for some . The abscissa of convergence of the function has strong connection to the upper zeta dimension as follows:
Proposition 3.1**.**
Let be a non-empty metric space of which the Assouad dimension is finite. Fix a net of . Then we have
[TABLE]
Proof of Theorem 1.1 assuming Proposition 3.1.
Fix an -discrete subset of for some . Then it is clear that is a net of . Therefore we have
[TABLE]
by Proposition 3.1. In particular, for every , holds from the definitions of and . ∎
The remaining part of proving Theorem 1.1 is to show Proposition 3.1.
Proof of Proposition 3.1.
Fix . We choose a net of . By definition, there exists such that for all distinct elements , and for all there exists such that . We firstly show that
[TABLE]
By definition, we see that
[TABLE]
By the axiom of choice, there exists a surjective map such that for all . Then we have
[TABLE]
by the triangle inequality. Therefore we obtain
[TABLE]
by Theorem 1.3. From Remark 2.4 and the condition , it is enough to show that
[TABLE]
We have since for all distinct elements . Thus by Lemma 2.1, we have
[TABLE]
Let be the right hand side of (3.6). It is enough to show that
[TABLE]
The condition that implies . Therefore is partially finite by the definition of the Assouad dimension. Hence we can write
[TABLE]
for some infinite sequence . Let
[TABLE]
It is clear that because is partially finite. We fix , and choose a non-negative integer such that . Then for every , we obtain that
[TABLE]
Note that this calculation is same as the proof of Abel’s identity in [A, Theorem 4.2]. By the choice of , for every there exists a positive real number such that
[TABLE]
holds for all . Hence we find that
[TABLE]
which implies that
[TABLE]
By taking , we obtain
[TABLE]
We next show the inequality in the other direction. We take a positive real number such that is convergent. Then let . It is clear that for every non-negative integer by estimating the partial sum. Fix a real number , and choose a non-negative integer such that . Then we have
[TABLE]
which implies that
[TABLE]
Therefore we have
[TABLE]
∎
4. Proof of Corollary 1.6 and Corollary 1.7
In order to prove Corollary 1.6, we use a quantitative upper bound of the Assouad dimension of a set which does not contain -APs. This upper bound was given by Fraser, the author, and Yu [FSY].
Theorem 4.1** (Fraser, the author, and Yu [FSY]).**
Fix and . If does not contain any -APs for some a set of orthonormal vectors , then
[TABLE]
holds.
Proof of Corollary 1.6.
Fix . By the condition, we can take a real number such that
[TABLE]
and holds. Therefore we have
[TABLE]
By Theorem 1.1 and Theorem 1.2, we have
[TABLE]
By combining the inequalities (4.1) and (4.2), we obtain
[TABLE]
From Theorem 4.1, contains -APs for every set of orthonormal vectors . ∎
Proof of Corollary 1.7.
Fix any , , and . We substitute for in Corollary 1.6. We observe that
[TABLE]
Therefore there exists a real number such that
[TABLE]
and
[TABLE]
by the condition of . This yields that contains -APs for every set of orthonormal vectors from Corollary 1.6. ∎
Remark 4.2**.**
We do not have to restrict a basis to be orthonormal in Corollary 1.7. In fact, let . Thanks to the result of Fraser and Yu [FY1], it follows that if and only if contains -APs for every , , and basis of . If satisfies that
[TABLE]
for every and is -discrete for some , then we have by Theorem 1.1 and Theorem 1.2. Therefore contains -APs for every , , and basis of .
5. Examples
Lemma 5.1**.**
Let be a metric space, and let and be subspaces of . Then the following properties hold:
- (i)
If , then we have and ;
- (ii)
.
Proof.
We first show (i). Fix and . We find that for all by definition. Therefore we have and by Lemma 2.1. Let us show (ii). It is clear from (i) that
[TABLE]
The opposite inequality also holds by the inequality
[TABLE]
and Lemma 2.1. ∎
Example 5.2**.**
Let be an imaginary quadratic integer. Then the set of all irreducible elements of contains -APs for every , , and orthonormal basis for .
The following discussion is based on Seki’s proof [S]. He proved the sum of reciprocals of primes is divergent by using Roth’s theorem [Ro] which states that every subset of positive integers with positive upper density contains arithmetic progressions of length 3. This is a special case of Szmerédi’s theorem [Sz].
Proof.
By definition, we may write . Let be the set of all irreducible elements of . We may write such that . It is enough to show that
[TABLE]
from Corollary 1.7. Let . Then there exist constants and such that
[TABLE]
Assume that . Then there exists such that
[TABLE]
Here let
[TABLE]
Then we have
[TABLE]
This yields that
[TABLE]
Therefore we have , which implies that
[TABLE]
from Remark 2.4. For every let
[TABLE]
We see that
[TABLE]
and
[TABLE]
where we define for every and . By (ii) in Lemma 5.1 and (5.1), we have
[TABLE]
By the fact that the function is quasi-isometric and Theorem 1.3, we have
[TABLE]
Since we have
[TABLE]
for every , we get
[TABLE]
by (i) in Lemma 5.1. Let . By definition, holds. Thus we get
[TABLE]
by Theorem 1.2 and Proposition 3.1. Hence we have . This is a contradiction. ∎
Choose in Example 5.2. Then we can conclude that by the above discussion. In fact, we define
- (i)
;
- (ii)
;
- (iii)
.
It is known that (see [HW, Theorem 252]), where is the set of all irreducible elements of . It is clear that and . Thus we have by the proof of Example 5.2. Here let It is well-known that holds for every prime number such that [HW, Theorem 251]. Therefore we have for all
[TABLE]
which implies .
Example 5.3**.**
Let be the -th prime number. The set of all primes of the form contains -APs for every and .
Proof.
Let and . It is enough to show that from Corollary 1.7. Let . Here we have
[TABLE]
Thus by the prime number theorem, we obtain
[TABLE]
which implies that by (2.11). ∎
An element of the set is called a super prime. Note that the sum of reciprocals of all super primes is convergent by (5.2) and Abel’s identity [A, Theorem 4.2] but is divergent for all .
Appendix A Standard properties for zeta dimensions
In this appendix, we show the existence of -nets and standard properties of fractal dimensions for zeta dimensions. We find that the upper and lower zeta functions share some properties with upper and lower box dimensions, respectively.
Proposition A.1**.**
Let be a non-empty metric space For every there exists such that is an -net.
Proof.
We define a family of sets by
[TABLE]
Since is non-empty, is non-empty. Here we take a subset which is totally ordered with respect to the inclusion. Let be the union of i.e.
[TABLE]
Then is -discrete. Indeed, for all distinct elements, there exist such that and . We have either or since is totally ordered. Without loss of generality, we may assume that . Thus we have and . Since is -discrete, we have . Therefore is -discrete.
It is clear that is an upper bound of . Therefore from Zorn’s lemma, there exists a set such that is a maximal element in with respect to the inclusion. Assume that there exists such that for all . Then is clearly -discrete, and we see that , which contradicts the maximality of . Therefore is an -net of . ∎
Proposition A.2**.**
Let be a non-empty metric space. Then the following properties hold:
- (i)
For every , we have
[TABLE]
- (ii)
For every , we have
[TABLE]
- (iii)
Let be a non-empty metric space. We have
[TABLE]
and
[TABLE]
where we define the metric between elements and in as .
- (iv)
For every , we have
[TABLE]
- (v)
If be an -dimensional Banach space, then we have
[TABLE]
The upper and lower zeta dimensions can be replaced by the upper and lower box dimensions in (i) to (iv) (see [F]). Note that the upper and lower zeta dimensions of any bounded set are zero. On the other hand, the upper and lower box dimensions of any unbounded set are infinity.
Proof.
We have already proved (i) and (ii) of this proposition in Lemma 5.1. We now show that (iii) of this proposition. Fix and . Let . Fix any and . Then we have
[TABLE]
since if and are finite -covers of and , then
[TABLE]
is also a finite -cover of . By Lemma 2.1, we obtain that
[TABLE]
and
[TABLE]
Let us show that
[TABLE]
In fact, if the right hand side is infinity, then it is clear. Thus we may assume that the right hand side is finite. Let and be -nets of and , respectively. Then is also a -net of . Here there exists a quasi-invarient surjection from to . Therefore by Theorem 1.3, we have
[TABLE]
Let . We can take an -cover of such that the number of elements in is equal to . Each intersects at most one point of since the distances of all distinct two elements of are at least . Thus this implies that
[TABLE]
Here the families of sets
[TABLE]
are -covers of and , respectively. This yields that
[TABLE]
Therefore we obtain (A.2). Hence by Lemma 2.1 and (A.2), we have
[TABLE]
and
[TABLE]
Let us show (iv). By combining (A.1) and (A.2), we see that
[TABLE]
for all , where let . Hence by Lemma 2.1, we obtain (iv). At last, let us show (v). For every -dimensional Banach space there exists a quasi-isometric surjection from to . Therefore it is enough to show that
[TABLE]
from Theorem 1.3 and (iv) in this proposition. Fix any . It is obvious that
[TABLE]
for sufficiently large . Therefore we have
[TABLE]
∎
Appendix B Asymptotic dimension and zeta dimensions
In this section, we show that the asymptotic dimension is not always an upper or lower bound for the zeta dimensions. More precisely, we will construct the following examples:
Example B.1**.**
Let for every and define . Then we have
[TABLE]
Example B.2**.**
Let for every . Then we have
[TABLE]
Let be a metric space. For every , a family of subsets of is called -disjoint if for all with , we have , where we define
[TABLE]
Here we say that the asymptotic dimension of a metric space does not exceed and write if for every there exist -disjoint families of uniformly bounded subsets of such that is a cover of . We say that the asymptotic dimension of is and write if and . By definition, it is clear that for every . The asymptotic dimension is introduced by Gromov [G]. We can see several equivalent definitions of the asymptotic dimension in [BD]. From Example B.1 and Example B.2, neither nor holds for any metric space . We do not find any relations between the asymptotic dimension and the zeta dimensions in this paper.
Proof of Example B.1.
Note that are pairwise disjoint since
[TABLE]
holds for all . We firstly prove that . Fix any positive integer and choose a positive integer such that . Then we have
[TABLE]
which implies that
[TABLE]
We next show that . It is enough to show that since
[TABLE]
Assume that . Then there exists a -disjoint family of uniformly bounded subsets of such that . Choose a large positive integer such that the diameter of is at most for every . Then let , and take a set such that . By the definition of , there exists such that and . Hence we can choose with such that , which implies that
[TABLE]
This is a contradiction to the condition that is a -disjoint family. Therefore we have
[TABLE]
∎
Proof of Example B.2.
Fix any real number . It is clear that since
[TABLE]
holds for all . We show that . Fix any real number . Let , and for every . Then is a family of uniformly bounded subsets of , and
[TABLE]
Furthermore, by the mean value theorem, we find that
[TABLE]
for every . Therefore the family is -disjoint. This yields that . ∎
Acknowledgement
This work is supported by Grantin-Aid for JSPS Research Fellow (Grant Number: 19J20878). The author would like to thank Professor Kohji Mastumoto and Doctor Shin-ichiro Seki for useful comments.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[A] T. M. Apostol. Introduction to Analytic Number Theory, Springer-Verlag, New York, 1997.
- 2[As] Étude d’une dimension métrique liée à la possibilité de plongements dans Rn. C. R. Acad. Sci. Paris Sér. A-B 288 (1979), A 731–A 734.
- 3[BD] G. Bell, A. Dranishnikov. Asymptotic dimension, Topology Appl. , 155 (2008), 1265-1296.
- 4[DGLMM] D. Doty, X Gu , JH Lutz, E. Mayordomo, P Moser. Zeta-dimension, Proceedings of the thirtieth international symposium on mathematical foundations of computer science , Springer-Verlag, NY, 2005, 283–294.
- 5[EL] D. Essouabri, B. Lichtin. Zeta functions of discrete self-similar sets, Adv. Math. , 232 (2013), 142-187.
- 6[F] K. J. Falconer. Fractal Geometry: Mathematical Foundations and Applications, John Wiley & Sons, Hoboken, NJ, 2nd ed., 2003.
- 7[Fr 1] J. M. Fraser. Assouad type dimensions and homogeneity of fractals, Trans. Amer. Math. Soc. , 366 (2014), 6687–6733.
- 8[Fr 2] J. M. Fraser. Almost Arithmetic Progressions in the primes and other large sets, Amer. Math. Monthly. , 126 (2019), 553–558.
