The Lagrange and Markov spectra from the dynamical point of view
Carlos Matheus

TL;DR
This paper explores the structure of the Lagrange and Markov spectra from a dynamical systems perspective, emphasizing recent developments and theorems in the field, particularly those by C. G. Moreira.
Contribution
It provides a dynamical viewpoint on the Lagrange and Markov spectra, highlighting recent theorems and structural insights in the context of ergodic theory and number theory.
Findings
Analysis of the structure of Lagrange and Markov spectra
Discussion of recent theorems by C. G. Moreira
Connection between spectra and dynamical systems
Abstract
This text grew out of my lecture notes for a 4-hours minicourse delivered on October 17 \& 19, 2016 during the research school "Applications of Ergodic Theory in Number Theory" -- an activity related to the Jean-Molet Chair project of Mariusz Lema\'nczyk and S\'ebastien Ferenczi -- realized at CIRM, Marseille, France. The subject of this text is the same of my minicourse, namely, the structure of the so-called Lagrange and Markov spectra (with an special emphasis on a recent theorem of C. G. Moreira).
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
The Lagrange and Markov spectra from the dynamical point of view
Carlos Matheus
Carlos Matheus: Université Paris 13, Sorbonne Paris Cité, LAGA, CNRS (UMR 7539), F-93439, Villetaneuse, France.
Abstract.
This text grew out of my lecture notes for a 4-hours minicourse delivered on October 17 & 19, 2016 during the research school “Applications of Ergodic Theory in Number Theory” – an activity related to the Jean-Molet Chair project of Mariusz Lemańczyk and Sébastien Ferenczi – realized at CIRM, Marseille, France. The subject of this text is the same of my minicourse, namely, the structure of the so-called Lagrange and Markov spectra (with an special emphasis on a recent theorem of C. G. Moreira).
Contents
-
1.4 Perron’s characterization of Lagrange and Markov spectra
-
1.5 Digression: Lagrange spectrum and cusp excursions on the modular surface
-
2.6 First step towards Moreira’s theorem 37: projections of Gauss-Cantor sets
-
2.7 Second step towards Moreira’s theorem 37: upper semi-continuity
-
2.8 Third step towards Moreira’s theorem 37: lower semi-continuity
1. Diophantine approximations & Lagrange and Markov spectra
1.1. Rational approximations of real numbers
Given a real number , it is natural to compare the quality of a rational approximation and the size of its denominator.
Since any real number lies between two consecutive integers, for every and , there exists such that , i.e.
[TABLE]
In 1842, Dirichlet [4] used his famous pigeonhole principle to improve (1.1).
Theorem 1** (Dirichlet).**
For any , the inequality
[TABLE]
has infinitely many rational solutions .
Proof.
Given , we decompose the interval into disjoint subintervals as follows:
[TABLE]
Next, we consider the distinct111 is used here numbers , , where denotes the fractional part222 and is the integer part of . of . By the pigeonhole principle, some interval must contain two such numbers, say and , . It follows that
[TABLE]
i.e., where and . Therefore,
[TABLE]
This completes the proof of the theorem. ∎
In 1891, Hurwitz [12] showed that Dirichlet’s theorem is essentially optimal:
Theorem 2** (Hurwitz).**
For any , the inequality
[TABLE]
has infinitely many rational solutions .
Moreover, for all , the inequality
[TABLE]
has only finitely many rational solutions .
The first part of Hurwitz theorem is proved in Appendix A, while the second part of Hurwitz theorem is left as an exercise to the reader:
Exercise 3**.**
Show the second part of Hurwitz theorem. (Hint: use the identity relating and its Galois conjugate ).
Moreover, use your argument to give a bound on
[TABLE]
in terms of .
Note that Hurwitz theorem does not forbid an improvement of “ has infinitely many rational solutions ” for certain . This motivates the following definition:
Definition 4**.**
The constant
[TABLE]
is called the best constant of Diophantine approximation of .
Intuitively, is the best constant such that has infinitely many rational solutions .
Remark 5*.*
By Hurwitz theorem, for all and .
The collection of finite best constants of Diophantine approximations is the Lagrange spectrum:
Definition 6**.**
The Lagrange spectrum is
[TABLE]
Remark 7*.*
Khinchin proved in 1926 a famous theorem implying that for Lebesgue almost every (see, e.g., Khinchin’s book [15] for more details).
1.2. Integral values of binary quadratic forms
Let be a binary quadratic form with real coefficients . Suppose that is indefinite333I.e., takes both positive and negative values. with positive discriminant . What is the smallest value of at non-trivial integral vectors ?
Definition 8**.**
The Markov spectrum is
[TABLE]
Remark 9*.*
A similar Diophantine problem for ternary (and -ary, ) quadratic forms was proposed by Oppenheim in 1929. Oppenheim’s conjecture was famously solved in 1987 by Margulis using dynamics on homogeneous spaces: the reader is invited to consult Witte Morris book [28] for more details about this beautiful portion of Mathematics.
In 1880, Markov [17] noticed a relationship between certain binary quadratic forms and rational approximations of certain irrational numbers. This allowed him to prove the following result:
Theorem 10** (Markov).**
* where , , , , is an explicit increasing sequence of quadratic surds444I.e., for all . accumulating at .*
In fact, where is the -th Markov number, and a Markov number is the largest coordinate of a Markov triple , i.e., an integral solution of .
Remark 11*.*
All Markov triples can be deduced from by applying the so-called Vieta involutions given by
[TABLE]
where is the other solution of the second degree equation , etc. In other terms, all Markov triples appear in Markov tree555Namely, the tree where Markov triples are displayed after applying permutations to put them in normalized form , and two normalized Markov triples are connected if we can obtain one from the other by applying Vieta involutions.:
Remark 12*.*
For more informations on Markov numbers, the reader might consult Zagier’s paper [29] on this subject. Among many conjectures and results mentioned in this paper, we have:
- •
Conjecturally, each Markov number determines uniquely Markov triples with ;
- •
If , then for an explicit constant ; conjecturally, , i.e., if is the -th Markov number (counted with multiplicity), then with
1.3. Best rational approximations and continued fractions
The constant was defined in terms of rational approximations of . In particular,
[TABLE]
where is the sequence of best rational approximations of . Here, is called a best rational approximation666This nomenclature will be justified later by Propositions 18 and 19 below. whenever
[TABLE]
The sequence of best rational approximations of is produced by the so-called continued fraction algorithm.
Given , we define recursively and for all . We can write as a continued fraction
[TABLE]
and we denote
[TABLE]
Remark 13*.*
Lévy’s theorem [16] (from 1936) says that for Lebesgue almost every . By elementary properties of continued fractions (recalled below), it follows from Lévy’s theorem that for Lebesgue almost every .
Proposition 14**.**
* and are recursively given by*
[TABLE]
Proof.
Exercise777Hint: Use induction and the fact that .. ∎
In other words, we have
[TABLE]
or, equivalently,
[TABLE]
Corollary 15**.**
* for all .*
Proof.
This follows from (1.3) because the matrix \left(\begin{array}[]{cc}\ast&1\\ 1&0\end{array}\right) has determinant . ∎
Corollary 16**.**
* and .*
Proof.
This is a consequence of (1.2) and the fact that . ∎
The relationship between and the sequence of best rational approximations is explained by the following two propositions:
Proposition 17**.**
* and, moreover, for all ,*
[TABLE]
Proof.
Note that belongs to the interval with extremities and (by Corollary 16). Since this interval has size
[TABLE]
(by Corollary 15), we conclude that .
Furthermore, . Thus, if
[TABLE]
then
[TABLE]
i.e., , i.e., , a contradiction. ∎
In other terms, the sequence produced by the continued fraction algorithm contains best rational approximations with frequency at least .
Conversely, the continued fraction algorithm detects all best rational approximations:
Proposition 18**.**
If , then for some .
Proof.
Exercise888Hint: Take , suppose that and derive a contradiction in each case , and by analysing and like in the proof of Proposition 19.. ∎
The terminology “best rational approximation” is motivated by the previous proposition and the following result:
Proposition 19**.**
For all , we have .
Proof.
If and , then
[TABLE]
Hence, does not belong to the interval with extremities and , and so
[TABLE]
because lies between and . ∎
In fact, the approximations of are usually quite impressive:
Example 20**.**
* so that*
[TABLE]
The approximations and are called Yuelü and Milü (after Wikipedia) and they are somewhat spectacular:
[TABLE]
1.4. Perron’s characterization of Lagrange and Markov spectra
In 1921, Perron interpreted in terms of Dynamical Systems as follows.
Proposition 21**.**
* where .*
Proof.
Recall that (cf. Corollary 16). Hence, (by Corollary 15). This proves the proposition. ∎
Therefore, the proposition says that . From the dynamical point of view, we consider the symbolic space equipped with the left shift dynamics , and the height function , . Then, the proposition above implies that
[TABLE]
where and . In particular,
[TABLE]
where .
Also, the Markov spectrum has a similar description:
[TABLE]
where .
Remark 22*.*
A geometrical interpretation of is provided by the so-called Gauss map999From Number Theory rather than Differential Geometry.:
[TABLE]
for .
Indeed, , so that is a symbolic version of the natural extension of .
Furthermore, the identification allows us to write the height function as .
Perron’s dynamical interpretation of the Lagrange and Markov spectra is the starting point of many results about and which are not so easy to guess from their definitions:
Exercise 23**.**
Show that are closed subsets of .
Remark 24*.*
: for example, Freiman [6] proved in 1968 that
[TABLE]
has the property that . (Here means infinite repetition of the block .)
Also, Freiman [7] showed in 1973 that and where
[TABLE]
for , and
[TABLE]
1.5. Digression: Lagrange spectrum and cusp excursions on the modular surface
The Lagrange spectrum is related to the values of a certain height function along the orbits of the geodesic flow on the (unit cotangent bundle to) the modular surface: indeed, we will show that
[TABLE]
Remark 25*.*
This fact is not surprising to experts: the Gauss map appears naturally by quotienting out the weak-stable manifolds of as observed by Artin, Series, Arnoux, … (see, e.g., [1]).
An unimodular lattice in has the form , , and the stabilizer in of the standard lattice is . In particular, the space of unimodular lattices in is .
As it turns out, is the unit cotangent bundle to the modular surface (where is the hyperbolic upper-half plane and \left(\begin{array}[]{cc}a&b\\ c&d\end{array}\right)\in SL(2,\mathbb{R}) acts on via \left(\begin{array}[]{cc}a&b\\ c&d\end{array}\right)\cdot z=\frac{az+b}{cz+d}).
The geodesic flow of the modular surface is the action of g_{t}=\left(\begin{array}[]{cc}e^{t}&0\\ 0&e^{-t}\end{array}\right) on . The stable and unstable manifolds of are the orbits of the stable and unstable horocycle flows h_{s}=\left(\begin{array}[]{cc}1&0\\ s&1\end{array}\right) and u_{s}=\left(\begin{array}[]{cc}1&s\\ 0&1\end{array}\right): indeed, this follows from the facts that and .
The set of holonomy (or primitive) vectors of is
[TABLE]
In general, the set of holonomy vectors of , , is
[TABLE]
The systole of is
[TABLE]
Remark 26*.*
By Mahler’s compactness criterion [19], is a proper function on .
Remark 27*.*
For later reference, we write for the area of the rectangle in with diagonal .
Proposition 28**.**
The forward geodesic flow orbit of does not go straight to infinity (i.e., as ) if and only if there is no vertical vector in . In this case, there are (unique) parameters such that
[TABLE]
Proof.
By unimodularity, any has a single short holonomy vector. Since contracts vertical vectors and expands horizontal vectors for , we have that as if and only if contains a vertical vector.
By Iwasawa decomposition, there are (unique) parameters such that , where r_{\theta}=\left(\begin{array}[]{cc}\cos\theta&-\sin\theta\\ \sin\theta&\cos\theta\end{array}\right). Since when contains no vertical vector and, in this situation,
[TABLE]
we see that (because ). This ends the proof of the proposition. ∎
Proposition 29**.**
Let be an unimodular lattice without vertical holonomy vectors. Then,
[TABLE]
Remark 30*.*
This proposition says that the dynamical quantity does not depend on the “weak-stable part” (but only on ) and it can be computed without dynamics by simply studying almost vertical holonomy vectors in .
Proof.
Note that for all and . Since for , the equality follows.
The relation and the continuity of the systole function imply that depends only on . Because any has the form with , the equality . ∎
In summary, the previous proposition says that the Lagrange spectrum coincides with
[TABLE]
where is a (proper) height function and is the geodesic flow on .
Remark 31*.*
Several number-theoretical problems translate into dynamical questions on the modular surface: for example, Zagier [30] showed that the Riemann hypothesis is equivalent to a certain speed of equidistribution of -orbits on .
1.6. Hall’s ray and Freiman’s constant
In 1947, M. Hall [9] proved that:
Theorem 32** (Hall).**
The half-line is contained in .
This result motivates the following nomenclature: the biggest half-line is called Hall’s ray.
In 1975, G. Freiman [8] determined Hall’s ray:
Theorem 33** (Freiman).**
**
The constant is called Freiman’s constant.
Let us sketch the proof of Hall’s theorem based on the following lemma:
Lemma 34** (Hall).**
Denote by . Then,
[TABLE]
Remark 35*.*
The reader can find a proof of this lemma in Cusick-Flahive’s book [3]. Interestingly enough, some of the techniques in the proof of Hall’s lemma were rediscovered much later (in 1979) in the context of Dynamical Systems by Newhouse [26] (in the proof of his gap lemma).
Remark 36*.*
is a dynamical Cantor set101010See Subsections 2.2 and 2.3 below. whose Hausdorff dimension is (see Remark 48 below). In particular, is a planar Cantor set of Hausdorff dimension and Hall’s lemma says that its image under the the projection contains an interval. Hence, Hall’s lemma can be thought as a sort of “particular case” of Marstrand’s theorem [18] (ensuring that typical projections of planar sets with Hausdorff dimension has positive Lebesgue measure).
For our purposes, the specific form is not important: the key point is that is an interval of length .
Indeed, given , Hall’s lemma guarantees the existence of , such that . Thus,
[TABLE]
with for all .
Define
[TABLE]
Since for all , Perron’s characterization of implies that
[TABLE]
This proves Theorem 32.
1.7. Statement of Moreira’s theorem
Our discussion so far can be summarized as follows:
- •
is an explicit discrete set;
- •
is an explicit ray.
Moreira’s theorem [21] says that the intermediate parts and of the Lagrange and Markov spectra have an intricate structure:
Theorem 37** (Moreira).**
For each , the sets and have the same Hausdorff dimension, say .
Moreover, the function is continuous, for all and (even though ).
Remark 38*.*
Many results about and are dynamical111111I.e., they involve Perron’s characterization of and , the study of Gauss map and/or the geodesic flow on the modular surface, etc.. In particular, it is not surprising that many facts about and have counterparts for dynamical Lagrange and Markov spectra121212I.e., the collections of “records” of height functions along orbits of dynamical systems.: for example, Hall ray or intervals in dynamical Lagrange spectra were found by Parkkonen-Paulin [27], Hubert-Marchese-Ulcigrai [11] and Moreira-Romaña [23], and the continuity result in Moreira’s theorem 37 was recently extended by Cerqueira, Moreira and the author in [2].
Before entering into the proof of Moreira’s theorem, let us close this section by briefly recalling the notion of Hausdorff dimension.
1.8. Hausdorff dimension
The -Hausdorff measure of a subset is
[TABLE]
The Hausdorff dimension of is
[TABLE]
Remark 39*.*
There are many notions of dimension in the literature: for example, the box-counting dimension of is where is the smallest number of boxes of side lengths needed to cover . As an exercise, the reader is invited to show that the Hausdorff dimension is always smaller than or equal to the box-counting dimension.
The following exercise (whose solution can be found in Falconer’s book [5]) describes several elementary properties of the Hausdorff dimension:
Exercise 40**.**
Show that:
- (a)
if , then ;
- (b)
; in particular, whenever is a countable set (such as or );
- (c)
if is -Hölder continuous131313I.e., for some constant , one has for all ., then ;
- (d)
* and, more generally, when is a smooth -dimensional submanifold.*
Example 41**.**
Cantor’s middle-third set has Hausdorff dimension : see Falconer’s book [5] for more details.
Using item (c) of Exercise 40 above, we have the following corollary of Moreira’s theorem 37:
Corollary 42** (Moreira).**
The function is not -Hölder continuous for any .
Proof.
By Theorem 37, maps to the non-trivial interval for any . By item (c) of Exercise 40, if were -Hölder continuous for some , then it would follow that
[TABLE]
for all . On the other hand, Theorem 37 (and item (b) of Exercise 40) also says that
[TABLE]
In summary, , a contradiction. ∎
2. Proof of Moreira’s theorem
2.1. Strategy of proof of Moreira’s theorem
Roughly speaking, the continuity of is proved in four steps:
- •
if , then for all there exists such that can be “approximated from inside” by where and are Gauss-Cantor sets with (and );
- •
by Moreira’s dimension formula (derived from profound works of Moreira and Yoccoz on the geometry of Cantor sets), we have that
[TABLE]
- •
thus, if , then for all there exists such that
[TABLE]
hence, is lower semicontinuous;
- •
finally, an elementary compactness argument shows the upper semicontinuity of .
Remark 43*.*
This strategy is purely dynamical because the particular forms of the height function and the Gauss map are not used. Instead, we just need the transversality of the gradient of to the stable and unstable manifolds (vertical and horizontal axis) and the non-essential affinity of Gauss-Cantor sets. (See [2] for more explanations.)
In the remainder of this section, we will implement (a version of) this strategy in order to deduce the continuity result in Theorem 37.
2.2. Dynamical Cantor sets
A dynamically defined Cantor set is
[TABLE]
where are pairwise disjoint compact intervals, and is a -map from to its convex hull such that:
- •
is uniformly expanding: for all ;
- •
is a (full) Markov map: for all .
Remark 44*.*
Dynamical Cantor sets are usually defined with a weaker Markov condition, but we stick to this definition for simplicity.
Example 45**.**
Cantor’s middle-third set is
[TABLE]
where is given by
[TABLE]
Remark 46*.*
A dynamical Cantor set is called affine when is affine for all . In this language, Cantor’s middle-third set is an affine dynamical Cantor set.
Example 47**.**
Given , let . This is a dynamical Cantor set associated to Gauss map: for example,
[TABLE]
where and are the intervals depicted below.
Remark 48*.*
Hensley [10] showed that
[TABLE]
and Jenkinson-Pollicott [13], [14] used thermodynamical formalism methods to obtain that
[TABLE]
[TABLE]
2.3. Gauss-Cantor sets
The set above is a particular case of Gauss-Cantor set:
Definition 49**.**
Given , , a finite, primitive141414I.e., doesn’t begin by for all . alphabet of finite words , the Gauss-Cantor set associated to is
[TABLE]
Example 50**.**
.
Exercise 51**.**
Show that any Gauss-Cantor set is dynamically defined.151515Hint: For each word , let and where is the Gauss map.
From the symbolic point of view, as above induces a subshift
[TABLE]
Also, the corresponding Gauss-Cantor is where and is the natural projection (related to local unstable manifolds of the left shift map on ).
For later use, denote by the transpose of , where for .
The following proposition (due to Euler) is proved in Appendix B:
Proposition 52** (Euler).**
If , then .
A striking consequence of this proposition is:
Corollary 53**.**
.
Sketch of proof.
The lengths of the intervals in the construction of depend only on the denominators of the partial quotients of . Therefore, we have from Proposition 52 that and are Cantor sets constructed from intervals with same lengths, and, a fortiori, they have the Hausdorff dimension. ∎
Remark 54*.*
This corollary is closely related to the existence of area-preserving natural extensions of Gauss map (see [1]) and the coincidence of stable and unstable dimensions of a horseshoe of an area-preserving surface diffeomorphism (see [20]).
2.4. Non-essentially affine Cantor sets
We say that
[TABLE]
is non-essentially affine if there is no global conjugation such that all branches
[TABLE]
are affine maps of the real line.
Equivalently, if is a periodic point of of period and is a diffeomorphism of the convex hull of such that is affine161616Such a diffeomorphism linearizing one branch of always exists by Poincaré’s linearization theorem. on where is the connected component of the domain of containing , then is non-essentially affine if and only if for some .
Proposition 55**.**
Gauss-Cantor sets are non-essentially affine.
Proof.
The basic idea is to explore the fact that the second derivative of a non-affine Möbius transformation never vanishes.
More concretely, let , , . For each , let
[TABLE]
be the fixed point of the branch of the expanding map naturally171717Cf. Exercise 51. defining the Gauss-Cantor set .
By Corollary 16, where and .
Note that the fixed point of is the positive solution of the second degree equation
[TABLE]
In particular, is a quadratic surd.
For each , the Möbius transformation has a hyperbolic fixed point . It follows (from Poincaré linearization theorem) that there exists a Möbius transformation
[TABLE]
linearizing , i.e., , and is an affine map.
Since non-affine Möbius transformations have non-vanishing second derivative, the proof of the proposition will be complete once we show that is not affine. So, let us suppose by contradiction that is affine. In this case, is a common fixed point of the (affine) maps and , and, a fortiori, is a common fixed point of and . Thus, the second degree equations
[TABLE]
would have a common root. This implies that these polynomials coincide (because they are polynomials in which are irreducible181818Thanks to the fact that their roots .) and, hence, their other roots , must coincide, a contradiction. ∎
2.5. Moreira’s dimension formula
The Hausdorff dimension of projections of products of non-essentially affine Cantor sets is given by the following formula:
Theorem 56** (Moreira).**
Let and be two dynamical Cantor sets. If is non-essentially affine, then the projection of under has Hausdorff dimension
[TABLE]
Remark 57*.*
This statement is a particular case of Moreira’s dimension formula (which is sufficient for our current purposes because Gauss-Cantor sets are non-essentially affine).
The proof of this result is out of the scope of these notes: indeed, it depends on the techniques introduced in two works (from 2001 and 2010) by Moreira and Yoccoz [24], [25] such as fine analysis of limit geometries and renormalization operators, “recurrence on scales”, “compact recurrent sets of relative configurations”, and Marstrand’s theorem. We refer the reader to [22] for more details.
Remark 58*.*
Moreira’s dimension formula is coherent with Hall’s Lemma 34: in fact, since , it is natural that .
2.6. First step towards Moreira’s theorem 37: projections of Gauss-Cantor sets
Let be a complete shift of finite type. Denote by , resp. , the pieces of the Lagrange, resp. Markov, spectrum generated by , i.e.,
[TABLE]
where , , and is the shift map.
The following proposition relates the Hausdorff dimensions of the pieces of the Langrange and Markov spectra associated to and the projection :
Proposition 59**.**
One has .
Sketch of proof.
By definition,
[TABLE]
where is the largest entry among all words of .
Thus, . By Corollary 53, it follows that
[TABLE]
By Moreira’s dimension formula (cf. Theorem 56), our task is now reduced to show that for all , there are “replicas” and of Gauss-Cantor sets such that
[TABLE]
In this direction, let us order and by declaring that if and only if .
Given , we can replace if necessary and/or by and/or for some large in such a way that
[TABLE]
where . Indeed, this holds because the Hausdorff dimension of a Gauss-Cantor set associated to an alphabet with a large number of words does not decrease too much after removing only two words from .
We expect the values of on to decrease because we removed the minimal and maximal elements of and (and, in general, if and only if where is the smallest integer with ).
In particular, this gives some control on the values of on , but this does not mean that .
We overcome this problem by studying replicas of and . More precisely, let , for all , such that
[TABLE]
is attained at a position in the block .
By compactness, there exists and such that any
[TABLE]
with for all and for all satisfies:
- •
is attained in a position in the central block ;
- •
for any non-central position .
By exploring these properties, it is possible to enlarge the central block to get a word called in Moreira’s paper [21] such that the replicas
[TABLE]
and
[TABLE]
of and have the desired properties that
[TABLE]
and
[TABLE]
This completes our sketch of proof of the proposition. ∎
2.7. Second step towards Moreira’s theorem 37: upper semi-continuity
Let for .
Our long term goal is to compare with its projection on the unstable part (where is the natural projection).
Given , its unstable scale is
[TABLE]
where is the interval with extremities and .
Denote by
[TABLE]
and
[TABLE]
Remark 60*.*
By symmetry (i.e., replacing ’s by ’s), we can define , , etc.
For later use, we observe that the unstable scales have the following behaviour under concatenations of words:
Exercise 61**.**
Show that for all , finite words and for all .
In particular, since the family of intervals
[TABLE]
covers , it follows from Exercise 61 that
[TABLE]
for all and, hence, the sequence is submultiplicative.
So, the box-counting dimension (cf. Remark 39) of is
[TABLE]
An elementary compactness argument shows that the upper-semicontinuity of :
Proposition 62**.**
The function is upper-semicontinuous.
Proof.
For the sake of contradiction, assume that there exist and such that for all .
By definition, this means that there exists such that
[TABLE]
for all and .
On the other hand, for all and, by compactness, . Thus, if and , the inequality of the previous paragraph would imply that
[TABLE]
a contradiction. ∎
2.8. Third step towards Moreira’s theorem 37: lower semi-continuity
The main result of this subsection is the following theorem allowing us to “approximate from inside” by Gauss-Cantor sets.
Theorem 63**.**
Given and with , we can find and a Gauss-Cantor set associated to such that
[TABLE]
This theorem allows us to derive the continuity statement in Moreira’s theorem 37:
Corollary 64**.**
* is a continuous function of and .*
Proof.
By Corollary 53 and Theorem 63, we have that
[TABLE]
Also, a “symmetric” estimate holds after exchanging the roles of and . Hence, . Moreover, the inequality above says that is a lower-semicontinuous function of . Since we already know that is an upper-semicontinuous function of thanks to Proposition 62, we conclude that is continuous. Finally, by Proposition 59, from , we also have that
[TABLE]
Since (because ), the proof is complete. ∎
Let us now sketch the construction of the Gauss-Cantor sets approaching from inside.
Sketch of proof of Theorem 63.
Fix large enough so that
[TABLE]
for all .
Set , and
[TABLE]
It is not hard to show that has a significant cardinality in the sense that
[TABLE]
In particular, one can use this information to prove that is not far from , i.e.
[TABLE]
Unfortunately, since we have no control on the values of on , there is no guarantee that for some .
We can overcome this issue with the aid of the notion of left-good and right-good positions. More concretely, we say that is a right-good position of whenever there are two elements , such that
[TABLE]
Similarly, is a left-good position whenever there are two elements , such that
[TABLE]
Furthermore, we say that is a good position of when it is both a left-good and a right-good position.
Since there are at most two choices of when are fixed and is a right-good position, one has that the subset
[TABLE]
of excellent words in has cardinality
[TABLE]
We expect the values of on to decrease because excellent words have many good positions. Also, the Hausdorff dimension of is not far from thanks to the estimate above on the cardinality of . However, there is no reason for for some because an arbitrary concatenation of words in might not belong to .
At this point, the idea is to build a complete shift from with the following combinatorial argument. Since has good positions, we can find good positions such that for all and are also good positions for all . Because , the pigeonhole principle reveals that we can choose positions and words such that for all and the subset
[TABLE]
of excellent words with prescribed subwords , at the good positions , has cardinality
[TABLE]
Next, we convert into the alphabet of an appropriate complete shift with the help of the projections , . More precisely, an elementary counting argument shows that we can take such that , , and the image of some projection has a significant cardinality
[TABLE]
From these properties, we get an alphabet whose words concatenate in an appropriate way (because , ), the Hausdorff dimension of is (because and ), and for some (because the features of good positions forces the values of on to decrease). This completes our sketch of proof. ∎
2.9. End of proof of Moreira’s theorem 37
By Corollary 64, the function
[TABLE]
is continuous. Moreover, an inspection of the proof of Corollary 64 shows that we have also proved the equality .
Therefore, our task is reduced to prove that for all and .
The fact that for any uses explicit sequences such that in order to exhibit non-trivial Cantor sets in . More precisely, consider191919This choice of is motivated by the discussion in Chapter 1 of Cusick-Flahive book [3]. the periodic sequences
[TABLE]
where . Since the sequence has the property that , and in general202020See Lemma 2 in Chapter 1 of [3]., we have that the alphabet consisting of the two words and satisfies
[TABLE]
Thus, for all .
Finally, the fact that follows from Corollary 64 and Remark 48. Indeed, Perron showed that if and only if (see the proof of Lemma 7 in Chapter 1 of Cusick-Flahive book [3]). Thus, . By Corollary 64, it follows that
[TABLE]
Since Remark 48 tells us that , we conclude that .
Appendix A Proof of Hurwitz theorem
Given , we want to show that the inequality
[TABLE]
has infinitely many rational solutions.
In this direction, let be the continued fraction expansion of and denote by . We affirm that, for every and every , we have
[TABLE]
for some .
Remark 65*.*
Of course, this last statement provides infinitely many solutions to the inequality . So, our task is reduced to prove the affirmation above.
The proof of the claim starts by recalling Perron’s Proposition 21:
[TABLE]
where and .
For the sake of contradiction, suppose that the claim is false, i.e., there exists such that
[TABLE]
Since and for all , it follows from (A.1) that
[TABLE]
If for some , then (A.2) would imply that , a contradiction with our assumption (A.1).
So, our hypothesis (A.1) forces
[TABLE]
Denoting by and , we have from (A.3) that
[TABLE]
By plugging this into (A.1), we obtain
[TABLE]
On one hand, (A.4) implies that
[TABLE]
Thus,
[TABLE]
and, a fortiori, , i.e.,
[TABLE]
On the other hand, (A.4) implies that
[TABLE]
Hence,
[TABLE]
and, a fortiori, , i.e.,
[TABLE]
It follows from (A.5) and (A.6) that , a contradiction because . This completes the argument.
Appendix B Proof of Euler’s remark
Denote by . It is not hard to see that
[TABLE]
From this formula, we see that is a sum of the following products of elements of . First, we take the product of all ’s. Secondly, we take all products obtained by removing any pair of adjacent elements. Then, we iterate this procedure until no pairs can be omitted (with the convention that if is even, then the empty product gives ). This rule to describe was discovered by Euler.
It follows immediately from Euler’s rule that . This proves Proposition 52.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] P. Arnoux , Le codage du flot géodésique sur la surface modulaire , Enseign. Math. (2) 40 (1994), no. 1-2, 29–48.
- 2[2] A. Cerqueira, C. Matheus and C. G. Moreira , Continuity of Hausdorff dimension across generic dynamical Lagrange and Markov spectra , Preprint (2016) available at ar Xiv:1602.04649.
- 3[3] T. Cusick and M. Flahive , The Markoff and Lagrange spectra , Mathematical Surveys and Monographs, 30. American Mathematical Society, Providence, RI, 1989. x+97 pp.
- 4[4] P. G. Dirichlet , Verallgemeinerung eines Satzes aus der Lehre von den Kettenbrüchen nebst einigen Anwendungen auf die Theorie der Zahlen , p.633-638 Bericht über die Verhandlungen der Königlich Preussischen Akademie der Wissenschaften. Jahrg. 1842, S. 93-95
- 5[5] K. Falconer , The geometry of fractal sets , Cambridge Tracts in Mathematics, 85. Cambridge University Press, Cambridge, 1986. xiv+162 pp.
- 6[6] G. Freiman , Non-coincidence of the spectra of Markov and of Lagrange , Mat. Zametki 3 1968 195–200.
- 7[7] G. Freiman , Non-coincidence of the spectra of Markov and of Lagrange , Number-theoretic studies in the Markov spectrum and in the structural theory of set addition (Russian), pp. 10–15, 121–125. Kalinin. Gos. Univ., Moscow, 1973.
- 8[8] G. Freiman , Diophantine approximations and the geometry of numbers (Markov’s problem) , Kalinin. Gosudarstv. Univ., Kalinin, 1975. 144 pp.
