Dilated floor functions having nonnegative commutator II. Negative dilations
Jeffrey C. Lagarias, D. Harry Richman

TL;DR
This paper completes the classification of parameter pairs for which dilated floor functions have a nonnegative commutator, focusing on the case where both parameters are negative, and connects the results with Beatty sequences and Frobenius problems.
Contribution
It extends previous work by classifying all negative dilation parameter pairs with nonnegative commutator, completing the characterization for all real parameters.
Findings
Classifies all negative parameter pairs with nonnegative commutator.
Establishes connections with Beatty sequences.
Links the problem to the Frobenius problem in two generators.
Abstract
This paper completes the classification of the set of all real parameter pairs such that the dilated floor functions , have a nonnegative commutator, i.e. for all real . This paper treats the case where both dilation parameters are negative. This result is equivalent to classifying all positive satisfying for all real . The classification analysis is connected with the theory of Beatty sequences and with the Diophantine Frobenius problem in two generators.
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.
Dilated floor functions having nonnegative commutator
II. Negative dilations
J. C. Lagarias
Dept. of Mathematics, University of Michigan, Ann Arbor, MI 48109–1043
and
D. H. Richman
Dept. of Mathematics, University of Michigan, Ann Arbor, MI 48109–1043
Abstract.
This paper completes the classification of the set of real parameter pairs such that the dilated floor functions and have a nonnegative commutator, i.e. for all real . This paper treats the case where both dilation parameters are negative. This result is equivalent to classifying all positive satisfying for all real . The classification analysis is connected with the theory of Beatty sequences and with the Diophantine Frobenius problem in two generators.
2010 Mathematics Subject Classification:
Primary 11A25; Secondary 11B83, 11D07, 11Z05, 26D07, 52C05
Work of the first author was partially supported by NSF grant DMS-1401224 and DMS-1701576, by MSRI as a Chern Professor and by a Simons Fellows in Mathematics grant. MSRI is partially supported by an NSF grant. Work of the second author was partially supported by NSF grant DMS-1600223 and by a Rackham Predoctoral Fellowship.
1. Introduction
The floor function rounds a real number down to the nearest integer. For a real parameter , the dilated floor function performs discretization at the length scale . Besides references noted in Part I, dilated floor functions are used in describing one-dimensional quasicrystals, see de Bruijn [2, Sect. 4], [3], Brown [1] and Mingo [7].
This paper continues the study of commutators under composition of dilated floor functions
[TABLE]
It completes the classification of the set of all pairs such that
[TABLE]
begun in Part I [4]. That is, (1.1) says for all real , which we will often abbreviate as , omitting the variable .
1.1. Classification theorem
Theorem 1.1** (Negative dilations classification).**
Given , the inequality holds for all if and only if one or more of the following conditions holds:
- (i)
There are integers , such that
[TABLE] 2. (ii)
There are coprime integers such that
[TABLE] 3.
There are coprime integers and such that
[TABLE]
In this classification, is a strictly larger set than in Theorem 1.3 stated in Part I; however the two theorems are equivalent. Case differs from in allowing value and in not imposing the side condition in . However, all members of case coming from also appear in case , and all members that have also appear in case . Condition parameterizes all negative rational solutions in , see Theorem 6.1. The parametrization in is redundant: some values arise from multiple parameter values .
Figure 1.1 pictures the solution set for negative dilations viewed in the the positive -coordinate system, letting ; the set pictured is in coordinates.
Figure 1.1 exhibits two kinds of solutions having no analogue in the positive dilation case. The first consists of vertical line segments (of variable finite length) for all rational values of , given by case of Theorem 1.1. The second consists of a countable set of isolated points having rational coordinates, which we term “sporadic rational solutions.” They appear as dots above the vertical line segments in Figure 1.1. They form a strict subset of case ; determining this subset involves removing from case the overlap shared with case and solutions, and removing further redundancy from the parametrization in . This determination is related to the Diophantine Frobenius problem in the parameters , see [8]. We treat this problem elsewhere ([5]).
1.2. The set is closed
In Part I we showed that the intersection of with each of the closed first, second and fourth quadrants of the -plane is closed. To complete the proof that is closed, we establish in this paper that the intersection with the closed third quadrant is closed.
Theorem 1.2** (Closed set property of ).**
The set of all pairs of dilation factors with satisfying the nonnegative commutator relation is a closed subset of .
The function is discontinuous in each of the variables , so the closure property is not obvious. We establish this result in Section 7 using the classification of the set in Theorem 1.1.
1.3. Symmetries of parameter set : negative dilations
We establish several symmetries of the set in the negative dilation case. There are a set of linear symmetries paralleling the positive dilation case.
Theorem 1.3** (Symmetries of : negative dilations).**
For negative dilations , the set is mapped into itself under the following symmetries:
- (i)
For any integer , if , then . 2. (ii)
For any integer , if , then .
An important new feature of the negative dilation case is the existence of additional symmetries having no positive dilation analogue. These symmetries act on vertical lines with fixed rational -coordinate. When (in lowest terms), the symmetries act on the -coordinate as special cases of the family of linear fractional transformations
[TABLE]
defined for all real , which depend on and not on .
Theorem 1.4** (Linear fractional symmetries).**
Let be a fixed negative rational. For each integer , the linear fractional transformation
[TABLE]
maps the set of which satisfy into itself. Namely, if then .
The set of transformations with fixed and integer forms a commutative semigroup under composition of functions:
[TABLE]
All elements of this semigroup have two common fixed points and . When the map is the identity.
- (1)
The map is a homeomorphism of the open interval . For this interval is exactly the values in Case . 2. (2)
The map sends the open interval to , for . For the case solutions with are the ones with , and are a discrete set. The action of on these solutions is injective, but for usually not surjective.
Theorem 1.4 is the mechanism used in this paper to show existence of all the case solutions. We start from the case rational solutions having ; these solutions correspond to in the parameterization in case . From these solutions for fixed the full infinite set of sporadic rational solutions are obtained by applying the linear fractional maps for to these solutions. We prove Theorem 1.4 in Section 4.6.
2. Outline of proofs
The negative dilation case analysis is similar to the positive dilation case, but is more complicated. Part I noted an analogy with the classification of disjoint Beatty sequences; a similar connection appears here in Lemma 4.10.
Section 3 introduces the family of strict rounding functions, whose definition parallels that of rounding functions in Part I, replacing the rescaled floor function with rescaled versions of the strict floor function. Proposition 3.3 gives a criterion for (1.1) to hold in terms of strict rounding functions.
Section 4 establishes that is closed under the linear fractional transformations given in Theorem 1.4 (for rational ). These symmetries provide a mechanism to construct all type solutions starting from type rational solutions. This proof proceeds in a new coordinate system, the -coordinates, given by , which take positive values.
Section 5 establishes the sufficiency direction of Theorem 1.1. It shows all parameters given in cases of Theorem 1.1 are solutions in . It uses -coordinates.
Section 6 establishes the necessity direction of Theorem 1.1. Its main result partitions all negative dilation solutions into two irrational cases and and the rational case which it shows enumerates all the rational points in . It uses -coordinates, with , .
Section 7 proves that the part of restricted to the region of nonpositive dilation factors is a closed set. This result completes the proof that is closed in , stated in Part I [4, Theorem 1.4].
2.1. Notational conventions
(1) The moduli space parametrizing dilations has coordinates . The proofs use different coordinate systems for this moduli space, starting with the negation of the coordinate system . Thus denotes the solution set in -coordinates. In Section 5 we use the -coordinate systems and in Section 6 the -coordinate system. These coordinate systems take positive real values.
(2) Variables and are never moduli space coordinates. They are real-valued, and are used in dilated floor functions, in commutators , and in lattices and quotient tori.
3. Strict rounding functions
In Part I, rounding functions were used for analyzing the relation in the positive dilation case. Here we use modified rounding functions, obtained by replacing the floor function with the strict floor function , which returns the largest integer strictly smaller than . Thus which also has .
Definition 3.1**.**
Given nonzero , let denote the (lower) strict rounding function defined by
[TABLE]
We additionally set .
We may also define the strict ceiling function and the (upper) strict rounding function defined by . These definitions yield a single family of strict rounding functions, because
[TABLE]
for all . The continuous function arises as the pointwise limit of the functions as .
3.1. Strict rounding functions: ordering inequalities
We classify when the graph of one strict rounding function lies (weakly) below the other.
Proposition 3.2** (Strict Rounding Function: Ordering Inequalities).**
Given positive , the strict rounding functions satisfy the inequalities
- (a)
* holds for all if and only if for some integer .* 2. (b)
* holds for all if and only if for some integer .*
Proof.
This result parallels [4, Prop. 4.2], making use of the following general observation: if functions and are both piecewise continuous and left-continuous (resp. both right-continuous), then holds identically if and only if it holds on the interior of the domain of continuity of and . Here the strict floor function (resp. ) agrees with (resp. ) on the interior of its domain of continuity. ∎
3.2. Strict rounding function criterion: negative dilations
We give a (separated variable) criterion in terms of strict rounding functions equivalent to the nonnegative commutator condition on dilated floor functions with negative dilation factors. We state it in coordinates.
Proposition 3.3** (Nonnegative commutator relation: strict rounding function criterion).**
Given , the following properties are equivalent.
- (R1’)
The nonnegative commutator relation holds. 2. (R2’)
(Lower strict rounding function) There holds
[TABLE]
where is the strict rounding function with parameter .
Proof.
The proof parallels that of Proposition 4.3 in [4, p. 284]. The fundamental observation is that
[TABLE]
We leave the details to the interested reader. ∎
3.3. Symmetries of for negative dilations: Proof of Theorem 1.3
Proof of Theorem 1.3.
We suppose and are to show:
- (i)
for any integer , if then . 2. (ii)
for any integer , if then .
These follow from Proposition 3.2 and Proposition 3.3; the proof parallels that of Theorem 2.1 in [4, p. 285]. ∎
4. Negative dilations classification: linear fractional symmetries
This section establishes the linear fractional symmetries of for negative dilations. We will use these symmetries to generate all the rational solutions in case , in particular to produce the sporadic rational solutions.
4.1. Birational coordinate change: -coordinates
The proofs use a birational change of coordinates of the parameter space describing the two negative dilations. We map -coordinates of the parameter space to -coordinates, given by
[TABLE]
Its inverse map is . The negative dilation part of the solution set is pictured in the new coordinates in Figure 4.1.
In coordinates, Theorem 1.3 says the following.
Theorem 4.1** (Linear Symmetries).**
For any integer , solutions to are preserved under the maps
[TABLE]
The linear symmetries of the set are visually apparent in Figure 4.1 after this coordinate change.
4.2. Lattice disjointness criterion: negative dilations
We reformulate the nonnegative commutator relation in terms of the new parameters as follows. The criterion involves a disjointness property of a rectangular lattice from an “enlarged diagonal set” ; see (P2’) of Proposition 4.4 below.
4.2.1. Enlarged diagonal set
The positive dilation case in Part I used an “approximate diagonal” set of the plane given by
[TABLE]
see [4, Definition 5.1]. The set is invariant under the negation map and reflection map . It is pictured in Figure 4.2(a). The negative dilation case will use instead the following set.
Definition 4.2**.**
The punctured enlarged diagonal set in is the region
[TABLE]
Here differs from in being a “punctured approximate diagonal” since it omits the exact diagonal line; it is pictured in Figure 4.2(b). It is characterized in terms of rounding functions by
[TABLE]
and in terms of strict rounding functions by
[TABLE]
The set will also be important in the arguments in Sections 5 and 6; it is pictured in Figure 4.2(c).
Remark 4.3*.*
is invariant under the negation map . However, it is not invariant under the reflection map .
Proposition 4.4** (Lattice disjointness criterion: negative dilations).**
For , the following three properties are equivalent.
- (P1’)
The nonnegative commutator relation holds:
[TABLE] 2. (P2’)
The two-dimensional rectangular lattice is disjoint from the region . That is,
[TABLE] 3. (P3’)
*The set is disjoint from , where is the union of all translates of by integer diagonal vectors . *
Proof.
(P1’) (P2’) The argument parallels the proof in [4] of (P1) (P2) in Proposition 5.2. We omit the details. The main step is that
[TABLE]
from Proposition 3.3, is equivalent to the condition
[TABLE]
(P2’) (P3’) Since , the implication (P3’) (P2’) holds. In the other direction, suppose is disjoint from . The enlarged diagonal set is sent to itself by translation by an integer diagonal vector , so the translated lattice is disjoint from . This holds for all integers , so is disjoint from . Consequently (P2’) (P3’). ∎
4.3. Extension of GCD and LCM to positive real numbers
We formulate an extension of the notion of and to pairs of positive real numbers, for use in arguments to prove the linear fractional rescaling symmetries. This extension is based on commensurability of lattices.
Definition 4.5**.**
Given real numbers , we define their extended greatest common divisor by
[TABLE]
We also define their extended least common multiple
[TABLE]
These definitions match the usual notions when are positive integers. We will frequently use the following proposition, whose proof we omit.
Proposition 4.6**.**
Suppose are positive real numbers.
- (i)
We have if and only if there are coprime positive integers such that 2. (ii)
We have if and only if there are coprime positive integers such that
4.4. Disjointness of lattices and regions: part 1
We prove several lemmas characterizing when various lattices are disjoint from , resp. , to facilitate use of Proposition 4.4. The disjointness criteria involving are needed for the necessity proofs in Section 6.
The first two lemmas will be used to show existence of the type rational solutions in the sufficiency proof in Section 5.
Lemma 4.7** (Diagonal expansion-contraction).**
Let be an integer, and suppose are real parameters satisfying . Then the following conditions are equivalent.
- (S1’)
The lattice is disjoint from . 2. (S2’)
The lattice is disjoint from . 3. (S3’)
The lattice \Lambda^{(r)}=\operatorname{row.span}_{\mathbb{Z}}\begin{pmatrix}1+\frac{1}{r}u&\frac{1}{r}v\phantom{\Big{|}}\\ \frac{1}{r}&\frac{1}{r}\phantom{\Big{|}}\end{pmatrix} is disjoint from .
Proof.
To see that (S1’) (S2’), observe that the lattice only intersects the diagonal of at integer points due to the assumption that . Thus must be disjoint from .
Next we show that (S2’) (S3’). Observe that is disjoint from if and only if the point lies below (or to the right of) the diagonal region , which holds if and only if . See the left side of Figure 4.3.
Since the lattice has as a generator, is invariant under translation by for any integer . Hence in order for to be disjoint from , it must also be disjoint with each translate , for integers . The latter fact holds if and only if the other generator of lies below the union of all translates , which is equivalent to . See the right side of Figure 4.3.
Finally, we observe that for any fixed integer , the condition on that is equivalent to . This equivalence implies the equivalence of the conditions (S2’) and (S3’). ∎
The condition (a) of the next lemma provides a recipe for producing an infinite number of new rational solutions in , starting from an initial rational solution in associated to .
Lemma 4.8**.**
Suppose are coprime integers and is a real number such that the lattice is disjoint from the set
[TABLE]
- (a)
If is rational, then for any integer , the lattice with
[TABLE]
is disjoint from . (Note that when , .) 2. (b)
If is irrational, then necessarily . Conversely, if is irrational then the lattice is disjoint from the set .
Proof.
Set , . Note that . Recall that denotes the image of for . Equivalently, is the integer row span of the diagonal matrix
[TABLE]
We first find a second basis for which is convenient for comparison with . Namely, we choose one basis vector to lie on the main diagonal. Let denote the diagonal of .
Let be integers such that .
Claim. *The lattice is equal to *
Proof. Note that
[TABLE]
The integer change of basis matrix has determinant . This proves the claim.
Now is disjoint from by hypothesis. Hence the implication (P2’) (P3’) in Proposition 4.4 implies that is disjoint from where
[TABLE]
The above claim implies that is equal to the -row span of vectors
[TABLE]
(a) Suppose first that is rational. Since the second and third rows are on the diagonal while the first row is off the diagonal, we have
[TABLE]
by definition of the extended greatest common divisor, and the assumption that is rational. Let be the positive integer such that .
Next we apply Lemma 4.7 with and , so
[TABLE]
Since is disjoint from , the implication (S3’) (S2’) of Lemma 4.7 guarantees that
[TABLE]
is disjoint from . But then (S2’) (S3’) implies that
[TABLE]
is disjoint from for any integer .
Finally, to see that the lattice is disjoint from it suffices to show that is contained in , i.e. it suffices to verify that
[TABLE]
Recall that ; this containment follows from the matrix relation
[TABLE]
Here we recall that , and that is an integer by the choice . Thus the second matrix in (4.7) has integer entries. This shows that so is disjoint from as desired.
(b) Now suppose is irrational. As above, we consider when is disjoint from
[TABLE]
When is irrational, the set is dense in . Hence the topological closure of inside contains the diagonal line of . Using this observation it is straightforward to verify that the closure of is
[TABLE]
If , then the closure intersects the interior of (at a point with ) so must also intersect . On the other hand if , then is disjoint from so is also disjoint from . ∎
4.5. Disjointness of lattices and regions: part 2
We prove two further lemmas needed for the necessity proof in Section 6.4, which are not needed in the sufficiency proof in Section 5. The first shows that every rational lattice which is associated to a solution in is associated to some rational lattice associated to a case solution in which is disjoint from . Lemma 4.10 characterizes all such lattices.
Lemma 4.9**.**
Suppose that are coprime positive integers and is rational such that the lattice is disjoint from . Then there necessarily exists some positive integer such that for
[TABLE]
the lattice is disjoint from .
Proof.
Assume the same notation as in the proof of Lemma 4.8. By the argument there, is disjoint from
[TABLE]
Let denote the positive integer which satisfies . (Recall that is rational.)
Now we apply Lemma 4.7: let so that and and (S3’) holds, i.e. is disjoint from . Then (S1’) holds, namely
[TABLE]
is disjoint from . It remains to check that where , i.e. that
[TABLE]
This amounts to the calculation
[TABLE]
where we note that is an integer by the choice . This proves the disjointness of and as desired. ∎
The next lemma shows that disjointness from requires that must lie on a rectangular hyperbola or on a horizontal line.
Lemma 4.10** (Combined lattice/diagonal disjointness classification).**
For rational parameters the following conditions are equivalent.
- (M1’)
The lattice is disjoint from . 2. (M2’)
There exist integers , such that
[TABLE]
Proof.
(M2’)(M1’) Suppose there exist integers such that . By [4, Theorem 5.4] we have the relation , and then the equivalence [4, Proposition 5.2] implies is disjoint from . The arguments used in proving [4, Theorem 5.4 and Lemma 5.5] also imply that is disjoint from . Thus (M1’) holds. In this direction, it is not necessary to assume that are rational.
(M1’)(M2’) Now suppose that is disjoint from .
Case 1. Suppose that is not an integer. By hypothesis is disjoint from , so by [4, Proposition 5.2] there exist integers such that . Since is not an integer we must have in any such relation so (M2’) holds.
Case 2. Suppose is an integer. Then set . Since are both rational, is a positive rational number. We claim that .
By definition of extended greatest common divisor, there exist integers such that . Consider the lattice point
[TABLE]
Since is an integer, the region contains the open segment
[TABLE]
Thus the hypothesis that is disjoint from implies that as claimed.
Let be the coprime integers such that , and let and . Here is an integer since is an integer, and since . Then
[TABLE]
Both and are integers, so condition (M2’) holds as desired. ∎
4.6. Proof of linear fractional symmetries: Theorem 1.4
We view Theorem 1.4 in coordinates. Recall that , . The map is conjugate under to , which acts linearly in the -coordinate. Theorem 1.4 becomes:
Theorem 4.11** (Linear fractional symmetries in -coordinates).**
If is a fixed positive rational given in lowest terms, then for any integer the set of satisfying is mapped to itself under
[TABLE]
This map sends to in coordinates.
Proof.
For integer , the map sends rational numbers to rational numbers and irrationals to irrationals. We treat these two cases separately.
Case (i). Suppose that is irrational. Lemma 4.8 (b) says if and only if . The map , which is equivalent to , sends the set to itself.
Case (ii). Suppose that is rational. Lemma 4.8 (a) and Proposition 4.4 then imply: if then also . ∎
5. Negative dilations classification: sufficiency
In this section we prove the sufficiency part of Theorem 1.1.
5.1. Sufficiency condition in -coordinates
We use the change of coordinates. We restate the sufficiency condition in Theorem 1.1 in terms of -coordinates.
Theorem 5.1** (Sufficiency condition in coordinates).**
Given parameters , the nonnegative commutator relation holds if any one of the following conditions holds.
- (i)
There are integers such that
[TABLE] 2. (ii)
There are coprime integers such that
[TABLE] 3. (iii*)
There are coprime integers and integers such that
[TABLE]
Note that in terms of extended greatest common divisor (see Section 4.3), case of Theorem 5.1 is equivalent to . The condition in case is related to disjoint Beatty sequences, see Part I [4, Prop. 2.5]. We prove Theorem 5.1 in the remainder of this section.
5.2. Sufficiency: Hyperbola and half-line cases
The next result shows existence of solutions for parameters corresponding to , to , and to . Later in the proof we will use the linear symmetries of to construct solutions for other parameters.
Lemma 5.2** (Rectangular hyperbola and half-line sufficiency).**
Suppose .
- (i)
If lies on the hyperbola , then holds. 2. (ii)
If lies on the half-line (), then holds. 3. (iii)
If lies on the half-line , then holds.
Proof.
It suffices to verify for each case that condition (P2’) of Proposition 4.4 holds, whence the Proposition (P1’) gives the result. To show that the lattice is disjoint from (resp. ), it suffices to show they are disjoint in the closed positive quadrant since both sets are preserved by and (resp. ) does not intersect the open second or fourth quadrants.
(i) This case parallels Lemma 5.5 in [4].
(ii) This case is clear from the definition of and .
(iii) Suppose that lies on the half-line , and consider the point in the lattice . Note that is contained in the open region . If then the point is contained in the diagonal of so it is not in . Next suppose . Then the lattice point has coordinates which satisfy , so again the point is not in . Thus is disjoint from . ∎
5.3. Proof of Sufficiency Theorem 5.1
Proof of Theorem 5.1.
There are three sufficient conditions to check.
Case (i). Suppose satisfy with . Let and ; these satisfy . Lemma 5.2 (i) implies that satisfies . It follows from Theorem 4.1 that .
If , then let and . We repeat the same argument with Lemma 5.2 (ii) and Theorem 4.1.
Case (ii). Suppose satisfy for coprime integers , then let and . Now Lemma 5.2 (iii) implies that , so it follows from Theorem 4.1 that . (This argument works without assuming coprimality of and , but dropping this assumption does not yield additional solutions.)
Case (iii). Suppose that satisfy
[TABLE]
for coprime integers and integers . Let
[TABLE]
so that . By case we have .
To show that , we apply Theorem 4.11. Since and , the conclusion follows. ∎
6. Negative dilations classification: necessity
This section proves the necessity for membership in of the conditions in Theorem 1.1.
6.1. Birational Coordinate change: -coordinates
We birationally transform the parameter space to a third set of coordinates, -coordinates, given by
[TABLE]
The inverse map is . The negative dilation part of the set viewed in -coordinates is pictured in Figure 6.1.
The parameters take values in the positive quadrant. The negative dilation portion of viewed in coordinates consists of line segments and isolated points.
6.2. Necessity condition in -coordinates
We reformulate the necessity condition in Theorem 1.1 in terms of -coordinates.
Theorem 6.1** (Necessity in -coordinates).**
For parameters , the nonnegative commutator relation does not hold unless one of the following conditions holds.
- (a)
If at least one of is irrational, then exactly one of the following two conditions holds.
There are integers such that
[TABLE] 2.
There are coprime integers such that
[TABLE] 2. (b)
If are both rational, then:
- (iii*)
There are coprime integers and integers , and such that
[TABLE]
The necessary conditions in Theorem 6.1 classify solutions into three disjoint cases. This classification removes all rational solutions from cases and , giving cases and respectively, with and . One sees that and are disjoint by observing that any common solution requires solving two linear equations in with integer coefficients, which either are inconsistent or else have a unique rational solution .
6.3. Torus subgroup criterion: negative dilations
To prove necessity of the classification given in Theorem 6.1 we establish a criterion for nonnegative commutator, given in terms of -coordinates. It is expressed in terms of a cyclic subgroup of the 2-dimensional torus111In the published version of Part I ([4]), was denoted .
[TABLE]
avoiding a set which also varies with the parameters. The set to be avoided, viewed in , is an open rectangular region with one corner at the origin, modified to exclude a diagonal and to include two vertical sides of its boundary. It is neither open nor closed as a subset of .
Given a real number , we let denote its image under the quotient map .
Definition 6.2**.**
We define the modified corner rectangle to be the region
[TABLE]
We define to be the image of under coordinatewise projection to the torus .
We set , so that
[TABLE]
We call the unit modified corner rectangle.
The projected modified corner rectangle consists of two connected components which are triangles, as long as . If or then some “wraparound” occurs in the projection to the torus . See Figure 6.2 for examples of the projections .
Proposition 6.3** (Torus subgroup criterion-negative dilations).**
For , the following conditions are equivalent.
- (Q1’)
The nonnegative commutator relation holds:
[TABLE] 2. (Q2’)
The cyclic torus subgroup
[TABLE]
is disjoint from the modified corner rectangle
[TABLE]
Proof.
The proof follows the same argument as that of [4, Proposition 6.2], replacing with and replacing [4, Proposition 5.2] with Proposition 4.4. ∎
6.4. Proof of Theorem 6.1
We first recall a technical result needed in the following proofs.
Theorem 6.4** (Closed subgroup theorem).**
Given a Lie group and a subgroup , the topological closure of the subspace is a Lie subgroup .
Proof.
See Lee [6, Theorem 20.12, p. 523]. Under these hypotheses, is a closed subgroup of . ∎
Proof of Theorem 6.1 (a).
Suppose that at least one of is irrational. Then the map
[TABLE]
is injective and the subgroup of the torus is infinite cyclic. Since is compact, cannot be discrete. Thus the closure of this subgroup must be a Lie subgroup of dimension 1 or 2, by the closed subgroup theorem for Lie groups [6, Theorem 20.12, p. 523].
Case 1. If is dimension then is dense in and will intersect the non-empty region . So condition (Q2’) of Proposition 6.3 is not satisfied, hence the nonnegative commutator relation (Q1’) does not hold.
Case 2. If is dimension , then the parameters must satisfy an integer relation of the form
[TABLE]
and the subgroup is the projection to of the lines . In the cases below, we will find solutions only when , giving case , or , giving case .
Case 2a-1. If the integers are nonzero and have opposite sign, then the lines in have positive slope. If in addition then the lines in will have different slope () than the punctured diagonal of (slope ), so the intersection will be non-empty in a neighborhood of . See Figure 6.3. Thus the commutator relation does not hold by Proposition 6.3.
Case 2a-2. If have opposite sign and , then the assumption implies are coprime. Set , so that coprime positive integers, with and . will not intersect in a neighborhood of , since the segment of at lies precisely in the diagonal of . See Figure 6.3.
The “modified corner rectangle” will then be disjoint from the subgroup if and only if the rectangle is contained in the open region . This containment occurs if and only if the extremal corners and lie in the closed region . (These corners are in the closure of , but not in itself.) This means , so we are in case of the classification.
Case 2b. Suppose do not have opposite sign so we may assume that are nonnegative without loss of generality. Then since .
Case 2b-1. If , then consists of vertical lines which intersect the vertical boundary segments of . Thus the commutator relation does not hold by Proposition 6.3.
Case 2b-2. Suppose and . Then the point lies in the closed subgroup , and intersects the modified corner rectangle , in any open neighborhood of this point. See Figure 6.4. Thus also intersects and the commutator relation does not hold by Proposition 6.3.
Case 2b-3. Suppose and . Then the closed subgroup does not intersect the modified corner rectangle because lies in the region ; see Figure 6.4. This subcase is case of the classification.
Theorem 6.1 (a) is established. ∎
To prove Theorem 6.1 (b), we mainly use -coordinates rather than -coordinates.
Proof of Theorem 6.1 (b).
If are both rational, then is a discrete subgroup of the torus. By Lemma 4.4 the commutator inequality means is disjoint from , where and and .
Let , so that for coprime integers . By Lemma 4.9, there exists an integer such that the lattice
[TABLE]
is disjoint from . This means must be of the form in Lemma 4.10: there exist integers such that lies on the hyperbola
[TABLE]
so we must have . The relation is equivalent to . Thus we have
[TABLE]
Finally, we recall that and so taking reciprocals of the above equalities gives
[TABLE]
Theorem 6.1 (b) is established. ∎
Theorem 1.1 is now proved, combining Theorem 5.1 and Theorem 6.1.
7. Proof of Closure Theorem 1.2 for negative dilations
Proof.
Let denote the open third quadrant, and let . Let , , and denote the subsets of corresponding to cases , , and of Theorem 1.1. It is straightforward to check that and are closed in . The set contains the “sporadic rational solutions”; by itself, does not form a closed set in .
Claim 1. If a sequence of points in has a limit point in the open third quadrant, then the values are eventually constant.
Proof of Claim 1: Suppose is a sequence in which converges to a limit in the open third quadrant. Since the coordinate is strictly negative, there is some positive integer such that . This implies for all sufficiently large . Suppose as a reduced fraction. Case of Theorem 1.1 says that
[TABLE]
for some integers , , and ; since the point is not in case , we have . From these conditions it follows that . Since eventually , these bounds imply that for sufficiently large . This means that for sufficiently large , if then Thus our assumption that the sequence converges implies that must be eventually constant, which proves Claim 1.
Claim 2. *The set of points in with fixed has all its limit points in . *
This claim is straightforward to verify using (7.1), with and fixed.
The two claims above imply that all limit points of are in or , so the union is a closed subset of . ∎
Acknowledgements
The second author thanks David Speyer and Yilin Yang for helpful conversations.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] T. Brown, Descriptions of the characteristic sequence of an irrational, Canad. Math. Bull. 36 (1993), no. 1, 15–21.
- 2[2] N. G. de Bruijn, Sequences of zeros and ones generated by special production rules, Nederl. Akad. Wetensch. Indag. Math. 43 (1981), no. 1, 27–37.
- 3[3] N. G. de Bruijn, Updown generation of Beatty sequences, Nederl. Akad. Wetensch. Indag. Math. 51 (1989), no. 4, 385–407.
- 4[4] J. C. Lagarias and D. H. Richman, Dilated floor functions with nonnegative commutators I. Positive and mixed dilations , Acta Arithmetica, 187 (2019), no. 3, 271–300.
- 5[5] J. C. Lagarias and D. H. Richman, paper in preparation.
- 6[6] J. M. Lee, Introduction to smooth manifolds , Graduate Texts in Mathematics 218, 2nd ed., Springer: New York, 2013,
- 7[7] J. A. Mingo, The classification of one-dimensional almost periodic tilings arising from the projection method, Trans. Amer. Math. Soc. 352 (2000), no. 11, 5263–5277.
- 8[8] J. L. Ramírez Alfonsín, The Diophantine Frobenius Problem, Oxford University Press: Oxford 2005.
