<< Chapter < Page Chapter >> Page >

[Proof of the Lemma] Let w = u + v W be given, and assume without loss of generality that we know the j t h letter u j of u . We partition w into p q -groups (that is, p groups of q letters) and into q p -groups. Because p and q are relatively prime, the initial letter of a q -group will only coincide with the initial letter of a p -group at the first letter of w . Similarly, the final letter of a q -group will only coincide with the final letter of a p -group at the last letter of w .

Since we know u j , it follows immediately that v j = w j - u j , and in general, if we know the k t h letter of u , we also know the k t h letter of v , and vice versa.

Take n such that n q j < n + 1 q . Because u is of the form of p groups of q repeated letters, and because we know u j , we also know the letters u n q through u n + 1 q - 1 , allowing us to fill in v n q through v n + 1 q - 1 . We repeat this process now on v ; take m 0 such that m 0 p n q < m 0 + 1 p and m 1 such that m 1 - 1 p n + 1 q - 1 < m 1 p . This gives us v m 0 p through v m 1 p - 1 , which in turn gives us the corresponding letters for u . Because of the condition described above about the initial and final letters of p - and q -groups, we will always be able to extend the range of uniquely determined letters at each step. We repeat this process until all of u and v are determined. Because u and v are finite, this process will terminate at a finite step.

Now, we can apply this Lemma to the claim above. In the case where w 111 1 , there is some j for which w j = 0 or w j = 2 . In either case, this uniquely determines the corresponding u j and v j : They must be both 0 in the former case and both 1 in the latter case. Applying Lemma 4.2, we get a unique pair u , v with u + v = w .

In the case where w = 111 1 , there are no 0s or 2s, so we must make a choice. We can choose either u 0 = 1 and v 0 = 0 , or u 0 = 0 and v 0 = 1 , but nothing else. With either choice, by Lemma 4.2, the rest of u and v are uniquely determined. These two choices correspond to the two pairs given above.

Thus, for all but one w W , there is a unique pair u , v for which u + v = w . Since there are 2 p + q unique pairs of u and v , there must be exactly 2 p + q - 1 elements w W , as desired.

This Proposition leads us to several results regarding the set S p q , λ , presented here as Corollaries.

Corollary 4.3 The set of offsets A + B of S p q , λ contains exactly 2 p + q - 1 elements for all but finitely many λ .

This is an easy consequence of the Proposition and the construction of S p q , λ above.

Corollary 4.4 The set S p q , λ has zero Lebesgue measure for all λ < 2 p + q - 1 - 1 / p .

This is an improvement of the result of Lemma 3.2. It is clear that a set K in this form (defined by a set of N offsets and a scaling factor σ ) has length μ j K at the j t h stage bounded by

μ j K N j σ j

so that its Lebesgue measure μ K must be bounded by

μ K lim j μ j K lim j N j σ j

implying that μ K = 0 when N σ < 1 . In this case, we have N = 2 p + q - 1 and σ = λ p , so that μ S p q , λ = 0 when λ < 2 p + q - 1 - 1 / p , as desired. To see this result graphically, see [link] .

The light green line in this figure represents the previous sufficient condition for S p q , λ having zero Lebesgue measure. the darker green points represent the new condition given by Corollary 4.4, applied to θ = p q where 1 p q 10 and 1 q 6 . As p and q increase, these points move closer to the light green line. While some of these points appear on the light green line, the new condition presented in the above Corollary is indeed strictly stronger than the condition given by Lemma 3.2. Recall that the light green line is given for rational θ by λ = 2 p + q - 1 / p .

The next result from this study involves the results from Theorems 3.4 and 3.5. Using the notation developed above, we can compute algorithmically the value λ θ for any rational θ . Recall that this value is already known for irrational θ . To do this, we need the following proposition.

Proposition 4.5 The set S p q , λ = 0 , 1 if and only if there are no gaps in the first stage S 1 of its construction.

[Proof of the Proposition] ̲ : Remember that S 1 is the union of intervals of length λ p with left endpoints at the offsets in the set A + B . We have

S p q , λ = j = 0 S j

so that

0 , 1 S j 0 , 1 , j .

In particular,

S 1 = 0 , 1

as desired.

̲ : Assume that S p q , λ 0 , 1 . Thus, S p q , λ must contain a gap of positive length, and this gap must show up in a finite stage, so it must be a scaled-down copy (or the overlap of multiple scaled-down copies) of a gap/gaps in the first stage of the construction S 1 . Thus, S 1 0 , 1 , as desired.

This Proposition tells us that λ θ is the unique point for which

S 1 = 0 , 1 when λ λ θ .

This point can be computed by finding all the offsets of S p q , λ , ordering them from least to greatest, and checking the differences of adjacent offsets against λ p . This has been done for several values of θ = p q in [link] .

The values λ p q for 1 p q 4 and 1 q 5 are shown in black, along with the blue and red lines given by Theorems 3.4 and 3.5. As expected, when θ = n or θ = 1 + 1 n for some positive integer n , the points lie on the lower line.

The question of what happens below these points and above the points given by Corollary 4.4 is still open. We conjecture that strictly between these points, S θ , λ is an M -Cantorval, and that at the points given by Corollary 4.4, S θ , λ where θ > 1 is a Cantor set with Hausdorff dimension 1 and zero Lebesgue measure.

Acknowledgments

This Connexions module describes work conducted as part of Rice University's VIGRE program, supported by National Science Foundation grant DMS–0739420.

We would also like to thank Dr. Danijela Damjanović and Dr. David Damanik for leading this study.

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, The art of the pfug. OpenStax CNX. Jun 05, 2013 Download for free at http://cnx.org/content/col10523/1.34
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'The art of the pfug' conversation and receive update notifications?

Ask