The Doorways Problem and Sturmian Words
Jason Siefken

TL;DR
This paper explores the geometric properties of lines passing through doorways in hallways, linking these configurations to Sturmian words, classifying line slopes, and establishing a complete metric space structure for Sturmian sequences.
Contribution
It classifies slopes of lines passing through doorways in finite and infinite hallways and introduces a complete metric on Sturmian sequences, connecting geometric and combinatorial properties.
Findings
Classified slopes of lines passing through doorways for finite and infinite hallways.
Established a metric on configurations that preserves line-of-sight properties under limits.
Proved the set of Sturmian sequences is complete under the induced metric.
Abstract
The doorways problem considers adjacent parallel hallways of unit width each with a single doorway (aligned with integer lattice points) of unit width. It then asks, what are the properties of lines that pass through each doorway? Configurations of doorways closely correspond to Sturmian words, and so properties of these configurations may be lifted to properties of Sturmian words. This paper classifies the slopes of lines of sight, lines that pass through each doorway, for both the case of a finite number of parallel hallways and an infinite number and their consequences for Sturmian words. We then produce a metric on configurations with an infinite number of hallways that preserves the property of admitting a line of sight under limits. Pulling back this metric to , we produce the Baire metric under which the irrational numbers form a complete metric space. Pulling back…
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
TopicsHistory and Theory of Mathematics
The Doorways Problem and Sturmian Words
Jason Siefken
Northwestern University, Evanston, IL 60208 USA
Abstract.
The doorways problem considers adjacent parallel hallways of unit width each with a single doorway (aligned with integer lattice points) of unit width. It then asks, what are the properties of lines that pass through each doorway? Configurations of doorways closely correspond to Sturmian words, and so properties of these configurations may be lifted to properties of Sturmian words. This paper classifies the slopes of lines of sight, lines that pass through each doorway, for both the case of a finite number of parallel hallways and an infinite number and their consequences for Sturmian words. We then produce a metric on configurations with an infinite number of hallways that preserves the property of admitting a line of sight under limits. Pulling back this metric to , we produce the Baire metric under which the irrational numbers form a complete metric space. Pulling back this metric to the set of all Sturmian sequences, we show that the set of all Sturmian sequences is complete with this metric (unlike with the standard metric).
1. The Doorways Problem
Imagine a series of infinitely long parallel walls spaced one unit apart, creating hallways. Further imagine that each wall has infinitely many doors of unit width, but that only one door per wall is open.
Standing to one side of the hallways, you could imagine certain arrangements of open doors you could see through and certain arrangements you could not. This is precisely stated in the following definitions.
Definition 1** (Hallway).**
An -hallway is the set defined by
[TABLE]
where is an open interval of width one and left point . The set is called the th doorway.
Definition 2** (Line of Sight).**
Given an -hallway , we can see through if there exists some line with slope and -intercept so that . If , we call a line of sight and we say admits the line of sight . If is a line of sight and , we call a rational line of sight.
Note that Definition 2 captures the idea that “no light is blocked” by a hallway. This could be equivalently phrased as an -hallway with doorways admits the line of sight if for all , which would capture the idea that “light passed through every doorway.” However, upon the introduction of infinite hallways, the “no light is blocked” definition will be more useful.
The doorways problem in general asks what types of -hallways can be seen through, and what are the properties of lines of sight. This question is closely related to rotation sequences, balanced sequences, and Sturmian sequences [2, 4], and it is from this context that the following motivating question arises.
Question 3**.**
For an -hallway that can be seen through, is there always a line of sight with slope where ?
1.1. Connection to Sturmians
Sturmian sequences and Sturmian words have many equivalent definitions in terms of rotation sequences, billiard sequences, balanced words, complexity, and invariant measures [2, 3, 4]. For the sake of brevity, we provide only two equivalent definitions.
Definition 4** (Complexity).**
For a sequence , the complexity function is
[TABLE]
Definition 5** (Periodic and Eventually Periodic).**
For a sequence , let be the th coordinate of . The sequence is called periodic if there exists so that for all and is called aperiodic otherwise. The sequence is called eventually periodic if there exists and some so that for all .
Definition 6** (Sturmian Sequence).**
Let . The sequence is a Sturmian sequence if it is periodic and satisfies for all or if it satisfies for all . A Sturmian word is a subword of a Sturmian sequence.
A sequence satisfying is always aperiodic and never eventually periodic. Thus, an eventually periodic Sturmian sequence must be periodic. Hedlund and Morse [5] proved that for any , is eventually periodic if and only if there exists an such that . Viewed this way, aperiodic Sturmian sequences are the aperiodic sequences of the lowest possible complexity.
Definition 7** (Rotation Sequence).**
For a pair , the rotation sequences and are the sequences whose th coordinates are given by
[TABLE]
and
[TABLE]
where and are the floor and ceiling functions, respectively. A sequence is called a rotation sequence if or for some .
As shown in [2, 4], a sequence is Sturmian if and only if it is a rotation sequence. Further, every Sturmian word appears as the starting word of a rotation sequence (equivalently Sturmian sequence).
Given an -hallway with doorways , there is a natural correspondence between and elements in . Namely, associate with the -word given by the differences between positions of consecutive doorways. Let denote this correspondence.
The question of whether a hallway admits a line of sight only depends on the relative placement of each doorway and is therefore translation invariant. Thus admits a line of sight if and only if every hallway in admits a line of sight.
Fix an -hallway with initial doorway and suppose is a Sturmian word. Further suppose appears as the initial word for the rotation sequence and that for . We can now conclude that
[TABLE]
and admits the line of sight . The converse of this statement also holds, and with the technical assumptions minimized, we get Theorem 8.
Theorem 8**.**
Let be the map that sends and . The -hallway admits a line of sight if and only if for some and is a Sturmian word.
We will not prove Theorem 8 in the context of Sturmian sequences, however, studying the hallway problem directly we will arrive at equivalent results. Theorem 8 also gives context as to why Question 3 might be interesting.
Consider the following: given a finite Sturmian word , is always contained in a periodic Sturmian word? If so, what is the minimum period of such a word? Translating from hallways to rotation sequences to Sturmian sequences, Question 3 asks, “Is a finite Sturmian word always contained in a periodic Sturmian sequence with period bounded by the length of ?”
Studying -hallways will provide a geometric way to answer this question. Further, the extension of -hallways to infinite hallways will allow us to arrive at several results without the subtleties of working with Sturmian sequences or rotation sequences directly. In particular, the distinction between aperiodic and not eventually periodic and the need to include both and (as in the definition of rotation sequences) is avoided.
2. Answering the Question
As discussed earlier, the question of whether an -hallway admits a line of sight is translation invariant. Thus, we will assume that all -hallways satisfy . Now, we will tackle the question of whether or not there exists lines of sight.
Definition 9**.**
Let be parallel projection onto the -axis along a line of slope . That is,
[TABLE]
Proposition 10**.**
If is an -hallway that admits a line of sight, then there is an interval of slopes corresponding to lines of sight for .
Proof. Fix , an -hallway, and let be a line of sight. We now have .
Let be the th doorway of , and let
[TABLE]
Since is a line of sight, . Since is a finite intersection of open intervals, is an open interval. It directly follows that the “tube” safely passes through every doorway in , and as a consequence any line contained in will be a line of sight. See Figure 1 for an example.
Since the width of is and the height of is , we know there must be lines of sight for every slope in the interval .
Corollary 11**.**
If is an -hallway that admits a line of sight, then admits a rational line of sight.
Since every interval of real numbers contains a rational number, Corollary 11 follows immediately.
The proof of Proposition 10 gives some insight into what types of hallways admit lines of sight. In particular, a hallway admits a line of sight if and only if is non-empty for some .
Suppose , and consider -hallways. Recall that we always assume is the first doorway. Now, if is a line of sight for a -hallway , because , there are only two possibilities for . Namely, or . Since we are assuming is a line of sight for , we can completely determine what is by the following procedure: Let . If , the -intercept of , satisfies , then . If then . See Figure 2 for an illustration.
Inductively, we may determine all possible hallways corresponding to lines of sight with a particular slope. For illustration, consider -hallways and assume we have a line of sight . If , we know or . To find out which, let . If , , and if , . Similarly, if , the options for are or . Now letting , implies and implies .
If we continue this process, we will notice that we always consider as a bifurcation point. That is, allows us to decide which doorway must be open if we presuppose a certain line of sight.
Definition 12**.**
Let and let be the partition of consisting of its connected components.
As the next proposition shows, exactly classifies which sequence of doors must be open for a given line of sight. In this respect, can be seen as generating an equivalence relation on intercepts of lines of sight with slope .
Proposition 13**.**
Fix and suppose is a line of sight for the -hallway and is a line of sight for the -hallway . Then, for some if and only if .
Proof. Notice that if and only if the sequences of doorways for and are the same.
Suppose and that and are lines of sight for and , respectively. By construction , and we must have .
Now suppose that for some . We will proceed by induction.
The base case is clear. , since precisely partitions the -intercepts for lines of sight through (D_{0},D_{1})=\Big{(}(0,1),(0,1)\Big{)} and (D_{0},D_{1})=\Big{(}(0,1),(1,2)\Big{)}.
Assume the proposition holds for . This means that for . Fix so that . Since , there can only be two possibilities for or . Namely, or . Let and suppose is a line of sight for . If , and if , .
We complete the proof by noticing that lies on the boundary of a partition element of (or completely outside the interval ). Thus, if , we have or , and so .
Propositions like Proposition 13 can be extended to handle lines of sights with slopes in without too much trouble, so we will mainly focus on lines of sights with slopes in to make our arguments simpler.
Corollary 14**.**
For a fixed line , there is at most one -hallway such that is a line of sight.
Proof. This follows directly from an application of Proposition 13 with .
Proposition 15**.**
For a fixed , the number of elements in the partition is at most .
Proof. First, notice that since , for a fixed , contains at most one point. This follows from the fact that integers are one unit apart and is an open interval of width one.
Now, we may proceed by induction. Clearly consists of one interval. Suppose consists of no more than intervals. can be obtained from by slicing the partition elements of by the points in . But, there is at most one point in and so at most one interval in could be sliced into two intervals. Thus the number of elements in cannot exceed .
Corollary 16**.**
For a fixed , the number of distinct -hallways having and admitting a line of sight of slope is at most .
Proof. From Proposition 13, is in one-to-one correspondence with -hallways having lines of sight of slope . Applying Proposition 15 shows , which completes the proof.
Recalling the correspondence between -hallways and finite words, Corollary 16 can be applied to show that rotation sequences satisfy the complexity conditions required of Sturmian sequences. We might also ask the total number of -hallways admitting lines of slope of any .
Theorem 17** (Mignosi [6]).**
Let be the number of distinct -hallways with and admitting a line of sight with slope in . Then,
[TABLE]
where is Euler’s totient function, which counts the number of integers in that are relatively prime to .
In [6], Mignosi uses combinatoric properties to count subwords of Sturmian sequences, In [1], Berstel and Pocchiola use geometric arguments to arrive at the same conclusion.
Let’s get a slightly better idea of what the set of all -hallways looks like.
Definition 18**.**
Let be the set of pairs such that is a line of sight for some -hallway. Let be the partition of where and are in the same partition element if and are lines of sight for the same -hallway.
Corollary 14 ensures that is well defined. Drawing as a subset of , we see that the vertical fiber of with -coordinate is precisely .
Looking at as a function of , we wee that must be split at the point
[TABLE]
for every . In other words, looks like cut by the lines (mod 1) of slope for . See Figure 3.
Using this description of , we can answer our question about rational lines of sight.
Theorem 19**.**
Given an -hallway admitting a line of sight, there is a rational line of sight with and .
Proof. Fix an -hallway admitting a line of sight at let be the corresponding partition element. That is, for every , is a line of sight for .
Our proof would be complete if we could show that contained a point where with . To this end, consider the corners of , when is interpreted as a polygon. Since is formed by cutting by lines of slope , the edges of are segments of lines of the same slope and so the corners are intersections of such lines.
We will now compute the intersection of two lines of the form . Notice that any connected segment of the graph of such a line is identical to the graph of the line restricted to for some .
Let be a line with slope and -intercept . Then, the intersection of the graphs of and occurs at
[TABLE]
Now, if , . This shows that the -coordinate of every corner of is of the form with .
To complete the proof, notice that either is one of the two extreme cases—the triangles with corners , , or , , —or has a corner directly above or below its interior (see Figure 3). If is the left extremal triangle, then there is a line of sight for some and if is the right extremal triangle, there is a line of sight for some .
Finally, if has a corner with coordinates above or below its interior, then there must be some point . Thus is a line of sight and as shown, with .
3. Infinite Hallways
Diagrams like Figure 3 show that if an -hallway admits a line of sight , then it admits lines of sign for a host of real numbers and . However, things become a bit more restricted when we pass to infinite hallways.
An infinite hallway is defined analogously to a finite hallway and can be thought of as the union of finite hallways that get longer and longer. It would now seem natural to say that an infinite hallway has a line of sight if and only if for some and . However, this definition rules out a very desirable property.
Desirable Property:
If is an infinite hallway admitting a line of sight, then there exists a doorway such that the infinite hallway admits a line of sight.
That is, if a hallway admits a line of sight, we should be able to add a doorway to it and have it still admit a line of sight. In the finite hallway case, this is always true and there are always infinitely many lines of sight. However, for infinite hallways, there may be a unique line of sight and the naïve formulation of infinite hallways does not always allow a door to be added while preserving visibility. For example, consider the infinite hallway whose th doorway is for and where is undefined. As will be shown in Theorem 27, is the only line such that . However, contains the point on the integer lattice and so there is no acceptable choice of if we would like to admit a line of sight (since every doorway excludes every lattice point).
We will solve this issue by introducing infinitesimals.
Definition 20** (Infinitesimals).**
Let represent a positive infinitesimal. Formally, let be the two-dimensional vector space with basis over the field endowed with the following total order:
[TABLE]
and
[TABLE]
A number is called real if .
This all amounts to saying that satisfies for all positive real numbers and that addition of infinitesimals and multiplication of infinitesimals by real numbers makes sense. We define open and closed intervals in the usual way: the open interval is defined as and the closed interval is defined as and in general we endow with the order topology.
Now we will precisely define what it means to be an infinite hallway, systematically replacing (in the finite case) with (in the infinite case).
Definition 21** (Infinite Hallway).**
Let for be a sequence of open unit intervals and define the corresponding infinite hallway as
[TABLE]
We will notate the restriction of to the first hallways it contains by
[TABLE]
Definition 22** (Infinite Lines).**
For , define the infinite line by
[TABLE]
Given a subset , for any , we define . In this notation, we can alternatively define .
Infinite lines are “fattened up” lines. As such, we need to slightly modify how we define a line of sight. Whereas, captures the idea “no light is blocked,” we would like to capture the idea “not all light is blocked.”
Notation 23**.**
Given a line or infinite line and a hallway or infinite hallway , the visibility operator is defined as
[TABLE]
Definition 24** (Infinite Line of Sight).**
The infinite line is a line of sight for the infinite hallway if .
Notice that infinite lines of sight are still defined by real parameters, they are just infinitesimally “fattened up.” To see this, consider the following example. Let be the infinite hallway with doorways . has infinite lines of sight for every . In particular, and are infinite lines of sight, but we would not consider the real lines and to be lines of sight.
From now on we will refer to infinite lines of sight simply as lines of sight and use the term real line of sight if we need to draw a careful distinction between infinite and non-infinite lines of sight.
Proposition 25**.**
If is an infinite hallway with line of sight , then either or .
Proof. Observe that if , then for some we have . If , then we must have and if we must have .
Next we will show that the using infinite lines of sight gives us our desired property. In fact, it gives us something slightly stronger.
Proposition 26**.**
Suppose is an infinite hallway missing its first door and admitting a line of sight . If for are the doorways for , then there exists a doorway such that the infinite hallway with doorways for admits the line of sight .
Proof. Suppose for and are as in the statement of the proposition. Given a definition for , let be the infinite hallway with doorways for . Let . From Proposition 25 we know either or .
Suppose . In this case, define . We now have , and so . It immediately follows that is a line of sight for .
If , a similar argument shows that if , then admits the line of sight .
Theorem 27**.**
Let be an infinite hallway. If and are both lines of sight for , then . In other words, all lines of sight for have the same slope.
Proof. Let be an infinite hallway with doorways and suppose is a line of sight for . Let and notice that must pass through and . From this, we conclude
[TABLE]
since a line with any slope outside of that range would not pass through and .
Now, if is a line of sight for , it is a line of sight for every . Thus for any and ,
[TABLE]
and so exists. Since exists and is unique, there can only be one slope for lines of sight for .
Definition 28** (Periodic Hallways).**
An infinite hallway with doors is called periodic with period if there exists some such that
[TABLE]
If there exists an such that is periodic with period , is called periodic, otherwise is called aperiodic.
If is periodic, the minimum period is the smallest such that is periodic with period .
Theorem 29**.**
An infinite hallway which admits a line of sight is periodic if and only if it admits a rational line of sight.
Proof. Suppose is an aperiodic infinite hallway with doorways and line of sight .
If is periodic, then there is some such that . Now,
[TABLE]
where and so .
Conversely, suppose . Now, or , and so in particular, is the unique integer such that
[TABLE]
Letting , we additionally have
[TABLE]
and so is the unique integer such that , which shows is periodic with period .
The proof of Theorem 29 actually gives us an additional result.
Theorem 30**.**
An infinite hallway admitting a line of sight has period if and only if it admits a rational line of sight with slope for some .
Corollary 31**.**
Suppose is an infinite periodic hallway with minimal period . If is a line of sight for , then is in lowest terms.
Proof. We will prove the contrapositive. Suppose is an infinite hallway admitting a line of sight . If is not in lowest terms, then where . Since is a period for , we know is not a minimal period.
We now know quite a bit about the slopes of lines of sight for infinite hallways. Let us introduce a lemma dealing with the intercepts.
Lemma 32**.**
Suppose is an infinite hallway with doorways and admitting a line of sight . Let be an enumeration of the points in satisfying . Let and let . Then is a (possibly degenerate) interval such that for all , for some .
Proof. Suppose is a line of sight for an infinite hallway with doorways . Let . If is a line of sight for , then must intersect for every . By Proposition 25, or must intersect for each and so intersects for each . Thus, we have the equality
[TABLE]
Since can be written as an intersection of intervals, it is an interval. Lastly, since for all , we know that for every , for some .
From Lemma 32 we can get a bound on the size of .
Theorem 33**.**
Let be an infinite hallway. If is periodic with minimal period and and are lines of sight for , then .
Proof. This follows quickly from Lemma 32. If is a line of sight for an infinite periodic hallway with minimal period , then for some . This means, for all ,
[TABLE]
and so where is defined as in the statement of Lemma 32. Since must be in lowest terms, a quick calculation shows every interval in for has width no greater than , which completes the proof.
Theorem 34**.**
Let be an infinite hallway. If is aperiodic, then there is at most one line of sight for .
Proof. Suppose is an aperiodic infinite hallway with doorways and line of sight . Necessarily we have , and by Theorem 27 is unique.
Let . Since , is a non-empty (but possibly degenerate) interval. Further, for every we have that for some where is as in the statement of Lemma 32. But, since , is dense the diameter if every interval in tends towards zero as . We conclude that must be a singleton and so there is only one line of sight for .
The converse to Theorem 34 is also true. If there is a unique line of sight for an infinite hallway, it must be aperiodic.
3.1. Metrics on Hallways
The theorems in the preceding section, taken together, show a correspondence between infinite hallways and a symbolic shift space. Consider the map where the th coordinate of is . is an extension of the identically-named map between -hallways and -words from earlier. Under the assumption that the initial doorway of every infinite hallway is , is a bijection between hallways and sequences.
Let be the shift map. That is deletes the first coordinate of a sequence. Let be the image under of all infinite hallways admitting a line of sight. Now, is immediate, and Proposition 26 (the proposition that gives us our desirable property) shows that . Thus, is -invariant. The word closed is almost always used in conjunction with the word invariant, so we might ask if is also closed.
The shift space is typically endowed with the product topology on where has the discrete topology. This is the same topology arising from the standard metric on sequences, . Namely, if , where is the index of the first coordinate where and differ.
Using , the standard metric on sequences induces a metric on infinite hallways.
Definition 35** (Standard Metric on Infinite Hallways).**
Let be infinite hallways. The standard metric on infinite hallways, notated , is defined as
[TABLE]
with the convention and .
Standard arguments now show that the set of all infinite hallways is complete with respect to .
Let be the visibility function. That is, if admits a line of sight and [math] otherwise. Now, suppose is an infinite hallway that admits a line of sight and let be with a single doorway changed. Since and , we cannot hope that is continuous. However, we might hope that would be upper-semicontinuous. That is, we might hope that if is a convergent sequence of infinite hallways and , then . Alas, this is not so with the standard metric.
Proposition 36**.**
The visibility function is not upper-semicontinuous with respect to the standard metric on infinite hallways, .
Proof. Let be the periodic infinite hallway admitting a line of sight with slope and with doorways , , and . Geometrically, has a jump of size 1 between and , then has identical doorways in a row before another jump of size 1.
Now, for all , we have
[TABLE]
and for every and ,
[TABLE]
From this description, we see which has doorways and for all . But and , so is not semi-continuous.
Since , Proposition 36 shows that is not closed with respect to the standard metric. Similarly, the set of all Sturmian sequences is not closed under the standard metric (because, as in Proposition 36, limits of periodic points may be aperiodic but eventually periodic) and the property of being a rotation sequence is not closed under limits.
All hope is not lost, though. There may be a different metric that is upper-semicontinuous with respect to. The counterexample used in Proposition 36 relied on a sequence of periodic infinite hallways. In particular, the lines of sight had slope converging to a rational number, so we might seek to prevent hallways from doing this.
Definition 37** (Common Initial Segment).**
Given two infinite hallways and , their common initial segment is
[TABLE]
If , we consider . Otherwise, is always a finite hallway or empty.
Definition 38** (Unframed Hallway).**
Given a hallway with th doorway , the corresponding unframed hallway is the hallway whose th doorway is the closed interval .
Definition 39** (Rational Metric on Infinite Hallways).**
Let be infinite hallways. The rational metric on infinite hallways, notated , is defined as follows.
If , then ; if admits a line of sight,
[TABLE]
and if admits no line of sight and , then .
Proposition 40**.**
The rational metric, , is a metric on infinite hallways.
Proof. By definition if . Suppose . If admits no line of sight, . If admits a line of sight, because it is a finite hallway, it admits a rational line of sight and so . Further, since , and so conditions (i) and (ii) are satisfied.
Now we consider condition (iii). Let be infinite hallways and notice that either
[TABLE]
To see this, let be the number of doorways that hallways and agree for, and consider the three choices: (a) , (b) , or (c) .
In case (a), and so ; in case (b), we must have and so ; and, in case (c), we must have which means and so .
Now, for finite hallways where , the set of lines of sight for is a superset of the set of lines of sight for . Thus, the above set inclusions give us either
[TABLE]
and so certainly .
Notation 41**.**
Let be the set of all infinite hallways; let be the set of all infinite periodic hallways that admit lines of sight; let be the closure of under the metric ; and let .
It is not immediately obvious that contains anything at all, but we will show that is precisely the set of all aperiodic hallways admitting lines of sight. Not only that, but we will show that is a closed set with respect to , from which it will follow that , the visibility function, is upper-semicontinuous.
Proposition 42**.**
The set is closed with respect to .
Proof. By definition is closed with respect to . Thus, if we can show is open with respect to , the proof will be complete.
To that end, suppose admits a line of sight . We necessarily have that is a line of sight for for all . Thus, for all , and so the singleton is open with respect to (it is the only element in the -ball of radius with center ). We conclude that is the union of open sets and is therefore open.
Lemma 43**.**
If is an infinite hallway that admits a unique line of sight , then the unframed infinite hallway admits as its unique line of sight.
Proof. Let be an infinite hallway with unique line of sight and the corresponding unframed infinite hallway. Notice that the proof of Theorem 27 applies equally well to unframed infinite hallways, and so the slope of any line of sight for must be .
Let be the th doorway for . Similarly to the proof of Lemma 32,
[TABLE]
is the complete set of intercepts for the infinite hallway and is also the complete set of intercepts for the unframed infinite hallway . Thus is unique.
Proposition 44**.**
Suppose is an aperiodic infinite hallway admitting a line of sight. Then .
Proof. Since is an aperiodic infinite hallway, . To show , we must show that there is a sequence of periodic infinite hallways such that with respect to .
Let be the unique line of sight for and let be the th doorway of . Without loss of generality, assume . By Theorem 29, . By Lemma 43, the unframed infinite hallway admits the unique line of sight .
Recall that is the restriction of to the first doorways. Fix . Now, since there are only a finite number of rationals of the form , it must be the case that for large enough , admits no line of sight of the form , lest . Similarly, for large enough , admits no line of sight of the form .
To complete the proof, notice that since is a finite hallway that admits a line of sight, it admits a rational line of sight . Thus, there exists a periodic infinite hallway admitting the line of sight and satisfying
[TABLE]
Further, by construction .
An immediate corollary of Proposition 44 is that is non-empty. Next, we will show that every hallway in admits a line of sight.
Lemma 45**.**
Let be an infinte hallway and be the restriction of to the first doorways. If admits a line of sight for every , then the unframed hallway admits a line of sight.
Proof. For a hallway , let
[TABLE]
By assumption, , and for all . Further notice that Let be the unframed hallway corresponding to . Since is closed and bounded and satisfies the finite intersection property, , and so admits a line of sight.
Proposition 46**.**
If , then admits a line of sight.
Proof. Let and suppose the sequence satisfies with respect to . Let be the th doorway of .
Let denote the number of doorways in . Since admits a line of sight and is necessarily a finite hallway, must admit a rational line of sight with slope where . Since , we must have that .
Now, by Lemma 45, the unframed hallway must admit a line of sight since for large enough . Further, and so must be unique.
If we can show that is a line of sight for , regardless of , then will be a line of sight for . Suppose this is not the case, and let be the smallest number such that is not a line of sight for . Trivially, , and since with respect to and for large enough , we must have that is a line of sight for .
Since is a line of sight for but not for , we must have either or .
Assume . Since is not a line of sight for , we have that is not a line of sight for . Since , this means is not a line of sight for . So, by Proposition 25, must be a line of sight for . We conclude that for some , we must have . Thus, , which is a contradiction.
Assuming , the proof follows similarly.
Corollary 47**.**
If then admits a line of sight.
Proof. By definition . If , then by definition it admits a line of sight and by Proposition 46, if , admits a line of sight.
We are almost ready to prove the semi-continuity of . But first, let us completely characterize the set of hallways that admit lines of sight.
Theorem 48**.**
Let be the set of infinite hallways that admit lines of sight. Then, .
Proof. By Corollary 47, . Now, suppose . If is a periodic hallway, then .
Suppose is an aperiodic hallway. Since admits a line of sight, so does the finite hallway . Thus admits a rational line of sight where by Theorem 29. Let be the infinite periodic hallway admitting the line of sight . We will now show with respect to .
Since , we have with respect to . Let be a line of sight for such that is as small as possible. If , we are done. Suppose is bounded and let and be the first two doorways of . Since and there are only finitely many , there exists such that for infinitely many . It follows that is a non-empty closed interval for all and so is non-empty. Thus, admits a rational line of sight with slope , which is a contradiction.
Theorem 49**.**
* is upper-semicontinuous with respect to .*
Proof. Let with respect to and suppose . By Theorem 48, , and so by definition . Now, by Corollary 47, .
4. Applications of
Theorem 27 states that if an infinite hallway admits a line of sight, its slope is unique. Thus, we may define a function by
[TABLE]
Let be the set-valued right-inverse to . That is
[TABLE]
and we have the equality . Now, any metric on infinite hallways induces a metric on via
[TABLE]
Two metrics and are said to be equivalent if their convergent sequences are the same. That is, if and only if for all sequences .
Proposition 50**.**
The metric on induced by the metric is equivalent to the standard metric on given by .
Proof. We will first show that convergence in implies convergence in . Let be a sequence and suppose . Fix and let be a finite hallway with doorways admitting a line of sight for some . Now, for any , define
[TABLE]
and note that is always an open interval or the empty set. Further, in the sense that and . Necessarily we have , but we also see that since , for all large enough , we have . Thus, for large enough , and are lines of sight for and so . But was arbitrary, so .
Now, suppose . Fix . Now for all sufficiently large , . Supposing is sufficiently large, we necessarily have that for some , there exists a -hallway, , for which and are both lines of sight. In particular, and both pass through the th doorway of and so
[TABLE]
By the reverse triangle inequality we have
[TABLE]
Since and both pass through the initial doorway of , we know and so . Thus, and so, since was arbitrary, .
The metric is equivalent to what we are used to in a metric on , but the metric is much stranger.
Proposition 51**.**
The set of irrational numbers is closed with respect to .
Proof. Suppose is a sequence of irrational real numbers and . Further, suppose . This implies the existence of hallways so that with respect to . However, since , is a periodic infinite hallway, and so by Proposition 42, , a contradiction.
The set is clearly not closed under . We now have an unusual situation. The set is dense in (its closure is ) under both and , however is dense in under , but not . Stranger still, according to the following proposition, does not change very much.
Proposition 52**.**
The metrics and are equivalent when restricted to the set of irrational numbers.
Proof. First note that convergence in implies convergence in since implies . Thus convergence in implies convergence in .
Now, fix and and choose so that the interval
[TABLE]
contains no rational points with denominator less than . Since is equivalent to the standard metric on , there exists a so that implies .
Now, if is an infinite hallway admitting a line of sight of slope , then implies . Since was arbitrary, if sequence of hallways converges to with respect to , the same sequence converges to with respect to . Thus, a sequence converging to with respect to converges to with respect to . This holds on all of so long as , and therefore it holds on all of .
We can also use to induce a metric on the set of sequences, , and in particular, the set of Sturmian sequences.
Theorem 53**.**
For an infinite hallway , is a Sturmian sequence if and only if admits an infinite line of sight with .
Proof. Suppose is an infinite hallway with doorways . Further, suppose is a Sturmian sequence. Then or for some . If then, because we assume the initial doorway of is , we have
[TABLE]
Similarly, if ,
[TABLE]
In either case, admits the infinite line of sight where .
Now suppose that admits the infinite line of sight . By Proposition 25, or . Suppose . Then
[TABLE]
and so . Alternatively, suppose . Then
[TABLE]
and so . In either case, is a rotation sequence and therefore a Sturmian sequence.
Recall that . In light of Theorem 53, is the set of all Sturmian sequences. is -invariant (), but it is not closed with respect to the standard metric. Let be the metric on sequences induced by . Again, induces the same topology on as , the standard metric on sequences, however under , is closed, and the set of periodic Sturmian sequences is dense.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. Berstel and M. Pocchiola. A geometric proof of the enumeration formula for Sturmian words. Internat. J. Algebra Comput. , 3(3):349–355, 1993.
- 2[2] N. P. Fogg. Substitutions in dynamics, arithmetics and combinatorics , volume 1794 of Lecture Notes in Mathematics . Springer-Verlag, Berlin, 2002. Edited by V. Berthé, S. Ferenczi, C. Mauduit and A. Siegel.
- 3[3] J.-M. Gambaudo, O. Lanford, III, and C. Tresser. Dynamique symbolique des rotations. C. R. Acad. Sci. Paris Sér. I Math. , 299(16):823–826, 1984.
- 4[4] M. Lothaire. Algebraic combinatorics on words , volume 90 of Encyclopedia of Mathematics and its Applications . A collective work by Jean Berstel, et al.
- 5[5] G. A. H. Marston Morse. Symbolic dynamics. American Journal of Mathematics , 60(4):815–866, 1938.
- 6[6] F. Mignosi. On the number of factors of Sturmian words. Theoret. Comput. Sci. , 82(1, Algorithms Automat. Complexity Games):71–84, 1991.
