Diophantine vectors
1 Dirichlet’s approximation theorem
Let , and for write
For a positive integer , let
which has elements. For any ,
Let be consecutive closed intervals with
Then there is some and some , , with . If have the same sign, then satisfies , and if have different signs then satisfies . In either case, , and satisfies
2 Diophantine vectors
For real , let be the set of those such that for any nonzero ,
In other words,
Each is closed, so is closed. Let
If and , let . Then , so , i.e.
Therefore
and
showing that is an set.
If and , suppose by contradiction that there is some . Now, by Dirichlet’s theorem, for each positive integer there is some satisfying . Then, as ,
hence
As , taking yields a contradiction. Therefore
3 Measures of sets
Denote by Lebesgue measure on . Let be the standard basis for , so
Let . Let be the supremum of the -dimensional Hausdorff measure of the intersection of an -dimensional affine subspace of and .
We calculate the following.11 1 Dmitry Treschev and Oleg Zubelevich, Introduction to the Perturbation Theory of Hamiltonian Systems, p. 166, Theorem 9.3.
Theorem 1.
For and ,
Proof.
Let , and for , let
and let
is the set of points between the hyperplanes and . The distance between the hyperplanes and is , so the distance between the hyperplanes and is . And , so . But , so
Now, , so
We remind ourselves that for a positive integer, the set has elements. Therefore
has
elements, using . Therefore
We estimate
and therefore
∎
4 Cohomological equation
Let and write for the Haar measure on for which . For let . Let be the set of those such that
Let
and then
For define by
In the following theorem, (1) is called a cohomological equation.22 2 Anatole Katok, Combinatorial Constructions in Ergodic Theory and Dynamics, p. 71, Theorem 11.5.
Theorem 2.
For , if and only if for any there is some such that
(1) |
Proof.
It is a fact that and that is an isomorphism of topological groups . For , is defined by
If the Fourier series of converges pointwise,
It is a fact that if and only if for any there is some such that
For and , because is invariant under multiplication in ,
Suppose that for every is that there is some satisfying (1). Taking the Fourier transform of (1),
then, if ,
Now suppose by contradiction that . This means that there are such that for each , there is some and some such that . Define
For let . Then for , either or if then
which shows that is . There is some satisfying (1), according to which, for ,
But is either or if then . Thus the Fourier coefficients of are unbounded, which contradicts that is . Therefore .
Now suppose that and let . Define by
The facts that and that is yield that is . It is straightforward from the definition of that satisfies (1). ∎