• Nie Znaleziono Wyników

The Hausdorff dimension of sets arising in metric Diophantine approximation

N/A
N/A
Protected

Academic year: 2021

Share "The Hausdorff dimension of sets arising in metric Diophantine approximation"

Copied!
8
0
0

Pełen tekst

(1)

LXVIII.2 (1994)

The Hausdorff dimension of sets arising in metric Diophantine approximation

by

H. Dickinson (Heslington)

A real number x which satisfies |qx−p| < q

−τ

for infinitely many p, q ∈ Z for any τ > 1 is called well-approximable. The Hausdorff dimension of the set of such numbers was found in 1929 by Jarn´ık [5]. Throughout this paper the modulus will be the sup norm, i.e.,

|q| = max

i

{|q

i

|}.

Let W (m, n; τ ) be the set of matrices X ∈ M

m×n

(R) which satisfy

|qX − p| < |q|

−τ

for infinitely many q ∈ Z

m

, p ∈ Z

n

. This set is a generalisation of the set of well-approximable numbers corresponding to m = n = 1. The Hausdorff dimension of W (m, n; τ ) was obtained in [1]. The Hausdorff dimension of the subset

W

0

= W

0

(m, n; τ ) = {X ∈ R

mn

: |qX| < |q|

−τ

for infinitely many q ∈ Z

m

} of W (m, n; τ ) was obtained in [2]. In W

0

, all the vectors p which can be regarded as a general kind of numerator, are set to zero. There now arises the question of what happens for a more general selection of the vectors p.

To this end define W

A

(m, n; τ ) to be the set of matrices X ∈ M

m×n

(R) such that

|qX − p| < |q|

−τ

for infinitely many q ∈ Z

m

, p ∈ A. In these sets c W will be used to denote the set of X restricted to the unit cube I. In this paper the Hausdorff dimension of W

A

(m, n; τ ) is studied when A ⊆ Z

n

is a subgroup of Z

n

. Because A is a subgroup the result holds for m + r > n where r is the dimension of the lattice A. Following the proof an application will be shown. This will give the Hausdorff dimension of the set of X ∈ M

m×n

(I), where I = (−1/2, 1/2], such that the system of inequalities

(1) max{|q·x

(1)

−p

1

|, . . . , |q·x

(r)

−p

r

|, |q·x

(r+1)

|, . . . , |q·x

(n)

|} < |q|

−τ

[133]

(2)

holds for infinitely many integer vectors q ∈ Z

m

and p ∈ A. Here x

(1)

, . . . . . . , x

(n)

are the column vectors of X. This is a set of mixed Diophan- tine inequalities and A = Z

r

× {0}

n−r

. Evidently the result for this set contains the result for W

0

in which r = 0. The Hausdorff dimension of W c

Zr×{0}n−r

(m, n; τ ) in the case m > 1, r = 1, n = 2 was obtained in [3].

The case r = 0, m = 1 will be omitted; in this case c W (1, n; τ ) = {0} and so the Hausdorff dimension is 0.

As some of the proofs for the present paper are very similar to those of [2] they will be omitted. The upper bound is straightforward as is usual and is found using a covering and counting argument. The lower bound will be found in two parts as in [2]. For m + r > n the more general result discussed above will be used. The second part will use this result to find the Hausdorff dimension of a cartesian product of two sets one of which is diffeomorphic to c W

Zr×{0}n−r

(m, n; τ ) when m + r ≤ n. This method is taken from [2] and the details will not be included here. Hereafter R

mn

is identified with the set of m × n real matrices M

m×n

(R). Also M

m×n

(I) will be denoted by I

mn

.

To obtain the Hausdorff dimension of W

A

the idea of ubiquity [3] will be used.

Define the set Π(p, q) to be the set of matrices X ∈ I

mn

such that

|qX − p| = 0.

Also define

N

A

(N ) = card{p ∈ A : |p| ≤ N } and ℘

A

(p) = card{p ∈ A : |p| = p}.

The symbol κ will be used to denote upper order at infinity. That is, for an increasing function f ,

κ(f ) = lim sup

N →∞

log f (N ) log N .

Since in this paper A will always be a subgroup of the lattice it will have a dimension r and this will usually be equivalent to κ(N ). For example, consider those vectors with only even entries. As there may exist a subgroup for which this is not so the upper order notation will be maintained but in the example given κ(N ) = r.

Theorem. When m, n > 0 are integers, for m + κ(N ) > n, dim W

A

(m, n; τ ) = (m − 1)n + m + κ(N )

τ + 1 when τ ≥ m + κ(N )

n − 1.

First the upper bound result will be stated with a brief proof. Full details

of this type of proof can be found in [1] and [2].

(3)

Lemma 1. For all integers m, n,

dim W

A

(m, n; τ ) ≤ (m − 1)n + m + κ(N )

τ + 1 when τ ≥ m + κ(N )

n − 1.

P r o o f. The number of mn-dimensional hypercubes C ∈ C(p, q) of width 4|q|

−(τ +1)

with centres on the (m − 1)n-dimensional hyperplane Π(p, q) which cover {X ∈ I

mn

: |qX − p| < |q|

−τ

} is  |q|

(τ +1)(m−1)n

. The collection of such hypercubes with |q| > N covers W

A

for each N . The

“t-volume” of this cover of W

A

(m, n; τ ) can be estimated by X

q∈Zm

|q|>N

X

p∈A

|p|<|q|

X

C∈C(p,q)

4

t

|q|

−(τ +1)t

.

Now take t > (m − 1)n + (m + κ(N ))/(τ + 1), i.e., take t to be (m − 1)n + (m + κ(N ))/(τ + 1) + ε for some ε > 0. The triple sum is then

 X

q>N

q

−(τ +1)(m−1)n−m−κ(N )−ε(τ +1)+(τ +1)(m−1)n+κ(N )+(m−1)

where |q| = q. This becomes

 X

q>N

q

−1−ε

,

which tends to 0 as N → ∞ and proves the lemma.

For the lower bound consider the related lim sup set Λ

A

, where Λ

A

= {X ∈ I

mn

: dist(X, Π(p, q)) < ψ(|q|)

for infinitely many q ∈ Z

m

, p ∈ A}, and ψ(|q|) = m

−1

|q|

−(τ +1)

. Here dist(X, Π(p, q)) represents the distance of X from the resonant set Π(p, q) taken with the sup norm. Evidently W

A

⊇ Λ

A

. Thus it suffices to find a lower bound for the Hausdorff dimen- sion for Λ

A

. In [3] the method of ubiquity was developed in order to find the Hausdorff dimensions of general lim sup sets. There follows a modified version (with appropriate notation for Λ

A

) of ubiquity which can be shown to be equivalent to the full definition in [3] when the affine case is considered.

Ubiquity. Let Ω be a bounded open region in R

mn

and let R

A

= {Π(p, q) : q ∈ Z

m

\{0}, p ∈ A}.

Also for each δ write

B(Π(p, q); δ) = {X ∈ Ω : dist(X, Π(p, q)) < δ}.

(4)

Then, if

N →∞

lim

/ [

q

|q|≤N p∈A

B(Π(p, q); %(N )) = 0

and lim

N →∞

%(N ) = 0, where % is a decreasing function, the family R

A

is called a ubiquitous system relative to %. (For the details see [3].)

Lemma 2. R

A

is ubiquitous with respect to the function

%(N ) = (m + 2)N

−m/n

(N

A

(N/2))

−1/n

log N.

To prove this lemma we need the following.

Lemma 3. For N > N

0

(n, m, A) and every X ∈ I

mn

there exist integer vectors q ∈ Z

m

, p ∈ A with |q|, |p| ≤ N for N

0

large enough such that

|qX − p| < (m + 2)N

1−m/n

(N

A

(N/2))

−1/n

.

P r o o f. Consider those q with non-negative components and those p such that |p| ≤ N/2. There are (N + 1)

m

N

A

(N/2) vectors qX − p and

m + 2

2 N ≤ qX − p ≤ m + 2 2 N.

Divide the cube in R

n

with centre 0, sidelength (m + 2)N and volume (m + 2)

n

N

n

into N

m

N

A

(N/2) smaller cubes of volume (m + 2)

n

N

n−m

× (N

A

(N/2))

−1

and sidelength (m+2)N

1−m/n

(N

A

(N/2))

−1/n

. As (N +1)

m

>

N

m

there must be two vectors q

1

X − p

1

, q

2

X − p

2

, say, in one small cube.

Therefore

|(q

1

− q

2

)X − (p

1

− p

2

)| < (m + 2)N

1−m/n

(N

A

(N/2))

−1/n

.

Evidently q

1

− q

2

∈ Z

m

and |q

1

− q

2

| ≤ N . Also p

1

− p

2

∈ A since A is closed under subtraction and |p

1

− p

2

| ≤ N by choice of p

1

and p

2

. Thus the lemma is proved.

In Lemma 3 the p which has been shown to exist will always be such that |p| <

12

|q| + 1 as otherwise |qX − p| > 1, which would be unacceptable.

P r o o f o f L e m m a 2. The p, q in the following proof are those which have been shown to exist for any X in the previous lemma. Let

E(N ) = {X ∈ I

mn

: |q| < N/ log N } and

D(N ) = {X ∈ I

mn

: |X − ∂I

mn

| ≥ N

−1

}\E(N ).

(5)

Then E(N ) ⊆

N/ log N

[

q=1 k|q|

[

p=1

[

|q|=q

[

p∈A

|p|=p

{X ∈ I

mn

:

|qX − p| < (m + 2)N

1−m/n

(N

A

(N/2))

−1/n

}.

Therefore

|E(N )| ≤

N/ log N

X

q=1 k|q|

X

p=1

X

|q|=q

X

p∈A

|p|=p

2

n

(m + 2)

n

N

n−m

(N

A

(N/2))

−1

|q|

n

 N

n−m

(N

A

(N/2))

−1

N/ log N

X

q=1

N

A

(kq)q

m−1−n

. For m + κ(N ) > n this is

(2)  N

n−m

(N

A

(N/2))

−1

 N

log N



m−n−1

 N log N

 N

A

 N

log N

 . This is  (log N )

n−m−κ(N )+ε

for all ε > 0 since it can be shown that

N

A

(N/ log N )

N

A

(N/2)  (log N )

−κ(N )+ε

. Thus |E(N )| → 0 as N → ∞ when m + κ(N ) > n.

Thus lim

N →∞

|E(N )| = 0 and lim

N →∞

|I

mn

\D(N )| = 0. Now let e X ∈ D(N ) and choose a e q such that

|e q e X − e p| ≤ (m + 2)N

1−m/n

(N

A

(N/2))

−1/n

, N/ log N ≤ |e q| ≤ N

as is possible by Lemma 3.

Now |e q| = |e q

i

| for some i. Let δ

j

= (e p

j

− e qe x

(j)

)/|e q

i

|, for 1 ≤ j ≤ n. Then e

q(e x

(j)

+ δ

j

e

(i)

) − e p

j

= 0 for j = 1, . . . , n where e

(i)

denotes the ith basis vector. Also

j

| ≤ (m + 2)N

1−m/n

(N

A

(N/2))

−1/n

|e q|

≤ (m + 2)N

−m/n

log N (N

A

(N/2))

−1/n

,

for 1 ≤ j ≤ n. Therefore X = (e x

(1)

+ δ

1

e

(i)

, . . . , e x

(n)

+ δ

n

e

(i)

) is a point in the resonant set and

dist( e X, X) ≤ (m + 2)N

−m/n

(N

A

(N/2))

−1/n

log N.

Now, let

%(N ) = (m + 2)N

−m/n

(N

A

(N/2))

−1/n

log N,

(6)

so that

D(N ) ⊆ A(N ) = [

q∈Zm,p∈A

|q|≤N

B(Π(p, q), %(N ))

giving lim

N →∞

|Ω\A(N )| = 0. Thus R

A

is ubiquitous with respect to %(N ) for m + κ(N ) > n.

From Theorem 1 in [3],

dim Λ

A

≥ dim R

A

+ γ codim R

A

where

γ = lim sup

N →∞

log %(N ) log ψ(N ) ,

and R

A

is the set of resonant sets Π(p, q). Now, dim R

A

= (m − 1)n, codim R

A

= n, %(N ) = (m + 2)N

−m/n

(N

A

(N/2))

−1/n

log N and ψ(N ) = m

−1

N

−(τ +1)

. Hence

γ = lim sup

N →∞

log %(N ) log N

log N log ψ(N )

= lim sup

N →∞



m n 1

n

log N

A

(N/2)

log N + log log N log N

 −1 τ + 1



= m + κ(N ) n(τ + 1) .

Thus, since W

A

(m, n; τ ) ⊇ Λ

A

,

dim W

A

(m, n; τ ) ≥ dim Λ

A

≥ (m − 1)n + m + κ(N ) τ + 1 . So the theorem is proved for m + κ(N ) > n.

Now we apply this result to W

Zr×{0}n−r

(m, n; τ ). If W

Zr×{0}n−r

(m, n; τ ) then N

A

(N ) = N

r

. Thus

κ(N ) = lim

N →∞

log N

r

log N = r.

Hence for m + r > n,

dim W

Zr×{0}n−r

(m, n; τ ) ≥ (m − 1)n + m + r τ + 1 . The upper bound result, Lemma 1, also holds giving

dim c W

A

(m, n; τ ) = (m − 1)n + m + r τ + 1 for m + r > n where A = Z

r

× {0}

n−r

.

To obtain the Hausdorff dimension for W

Zr×{0}n−r

(m, n; τ ) when m+r ≤

n the result obtained above will be used. In the following method a subset

W f

A

(m, n; τ ) will be needed. This is the set of matrices in c W

A

(m, n; τ ) such

(7)

that the column vectors x

(r+1)

, . . . , x

(n)

are linearly independent. It can be readily verified that this set has the same dimension as c W

A

(m, n; τ ). In fact the set of X for which those vectors are linearly dependent is of lower dimension and so plays no major part.

First two lemmas will be stated, the proof of the first can be found in [1], [2] and [6] and the proof of the second can be found in [4].

Lemma 4. For any real interval, (a, b), and set X ⊆ R

k

, the Hausdorff dimension of the set (X × (a, b)

p

), where p is a positive integer , is

dim(X × (a, b)

p

) = dim X + p.

Lemma 5. If there exists an onto function f : X → Y such that f is one-one and obeys a bi-Lipschitz condition then dim Y = dim X.

For simplicity only the case n = m + r will be obtained; the result then extends easily to n > m + r. Let G denote the set of vectors



x

(1)

, . . . , x

(m+r−1)

,

m−1

X

k=1

a

k

x

(r+k)



such that

(x

(1)

, . . . , x

(m+r−1)

) ∈ f W

A

(m, m + r − 1; τ ) and

a

k

 −1 m − 1 , 1

m − 1

 .

As in [2], G ⊆ c W

A

(m, m + r; τ ). Define the function f : f W

A

(m, m + r − 1; τ ) ×

 −1 m − 1 , 1

m − 1



m−1

→ G by

(x

(1)

, . . . , x

(m+r−1)

, a

1

, . . . , a

m−1

) 7→



x

(1)

, . . . , x

(m+r−1)

,

m−1

X

k=1

a

k

x

(r+k)

 .

Exactly as in [2] this function can be shown to be locally bi-Lipschitz. There- fore, from the two lemmas above

dim c W

A

(m, m + r; τ ) ≥ dim G

= dim f W

A

(m, m + r − 1; τ ) ×

 −1 m − 1 , 1

m − 1



m−1

, which gives

dim c W

A

(m, n; τ ) ≥ (m − 1)(m + r) + m + r

τ + 1 ,

(8)

for m + r = n. For m + r > n extend the function f as in [2]. In this case the cartesian product is between f W

A

(m, m + r − 1; τ ) and a “cube” in (n − m − r + 1)(m − 1) dimensions. This gives the result that

dim W

Zr×{0}n−r

(m, n; τ ) ≥ (m − 1)n + m + r τ + 1 , and finally from Lemma 1 that

dim W

Zr×{0}n−r

(m, n; τ ) = (m − 1)n + m + r τ + 1 .

Acknowledgements. I would like to thank my supervisor Maurice Dod- son for his enthusiastic help and encouragement and Professor Fernandez for asking some useful questions.

References

[1] J. D. B o v e y and M. M. D o d s o n, The Hausdorff dimension of systems of linear forms, Acta Arith. 45 (1986), 337–358.

[2] H. D i c k i n s o n, The Hausdorff dimension of systems of simultaneously small linear forms, Mathematika 40 (1993), 367–374.

[3] M. M. D o d s o n, B. P. R y n n e and J. A. G. V i c k e r s, Diophantine approximation and a lower bound for Hausdorff dimension, ibid. 37 (1990), 59–73.

[4] K. J. F a l c o n e r, Fractal Geometry—Mathematical Foundations and Applications, Wiley, Chichester, 1990.

[5] V. J a r n´ık, Diophantische Approximationen und Hausdorffsches Mass, Mat. Sb. 36 (1929), 371–382.

[6] D. G. L a r m a n, On Hausdorff measure in finite dimensional compact metric spaces, Proc. London Math. Soc. (3) 17 (1967), 193–206.

DEPARTMENT OF MATHEMATICS UNIVERSITY OF YORK

HESLINGTON, YORK, YO1 5DD ENGLAND

E-mail: HD3@VAX.YORK.AC.UK

Received on 19.7.1993

and in revised form on 21.5.1994 (2412)

Cytaty

Powiązane dokumenty

Harary, On defining sets of vertex colorings of the cartesian product of a cycle with a complete graph, Combinatorics, Graph Theory and Algorithms (1999) 461–467..

By well-known results about the com- ponent structure of locally compact groups (see Hewitt–Ross (1963), Chap- ter 2, Section 7), for compact G this means that G is connected, and

Choose N sufficiently large that it satisfies the conditions imposed on the number Q in the first two sentences of the proof of Lemma 4 of [4].. Thus, the proof reduces to finding a

In other words, we focus on a new generalization of evolution equations beyond vector spaces (§ 3) and verify the required preliminaries in detail for nonlocal geometric evolutions

Let f be a 2π-periodic function and Lebesgue integrable on [−π, π].. The degree of approximation by Hausdorff means of a conju- gate Fourier series. We first formulate a variant

The sets of equal distance are known under several names: bisectors (in computa- tional geometry), equi-distance lines, conflict lines of the distance function (in singularity

Sendov and others [5]-[7], whereas almost periodicity of bounded or bounded on every bounded interval functions with respect to this metric was first studied in Poznań in the

Now, in this paper, we construct a graph called intersection graph of gamma sets in the total graph of a commutative ring R with vertex set as collection of all γ-sets of the