1. Introduction
The study of rational points on, or close to, curves or manifolds has a wide variety of applications in many areas of mathematics. In the setting of
$\mathbb{R}^{n}$
, there have been many results of this type; in particular, see [Reference Beresnevich, Dickinson and Velani7, Reference Huxley32, Reference Schleischitz47, Reference Schleischitz48, Reference Vaughan and Velani50] in the case of curves and [Reference Beresnevich4, Reference Beresnevich, Vaughan, Velani and Zorin13, Reference Huang30, Reference Huang and Liu31] for results on manifolds. The equivalent problem in the
$p$
-adic setting is far less understood. In [Reference Badziahin and Bugeaud2, Reference Badziahin, Bugeaud and Schleischitz3], a bound on the number of rational points that lie on the
$p$
-adic Veronese curve was found, but as yet, no results for general manifolds or curves are known. In this article, we provide an upper and lower bound on the number of rational points within a rectangular neighbourhood of a
$p$
-adic integer. This allows us to prove a result in the setting of
$p$
-adic Diophantine approximation on manifolds, which has been vigorously studied in the past few decades [Reference Badziahin, Bugeaud and Schleischitz3, Reference Bugeaud, Budarina, Dickinson and O’Donnell21, Reference Kleinbock and Tomanov39, Reference Mohammadi and Salehi Golsefidy43].
Throughout, our setting is as follows. Fix a prime number
$p \in \mathbb{N}$
and let
$|.|_{p}$
denote the
$p$
-adic norm. Define
$\mathbb{Q}_{p}$
to be the set of
$p$
-adic numbers and denote by
$\mathbb{Z}_{p}\,:\!=\,\{x \in \mathbb{Q}_{p}\,:\, |x|_{p} \leq 1\}$
the ring of
$p$
-adic integers. For an introduction to
$p$
-adic numbers, see [Reference Gouvêa26]. We will use the bold notation
${\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}$
to denote a
$n$
-dimensional
$p$
-adic integer. Let
$\Psi =(\psi _{1}, \dots , \psi _{n})$
be an
$n$
-tuple of monotonic decreasing functions of the form
$\psi _{i}\,:\, \mathbb{N} \to \mathbb{R}_{+}$
, with
$\psi _{i}(q) \to 0$
as
$q \to \infty$
for each
$1 \leq i \leq n$
. Often we will consider
$\Psi$
to be of the form
$\psi _{i}(q)=q^{-\tau _{i}}$
(
$i=1,\ldots ,n$
) for some vector
$\boldsymbol{\tau }=(\tau _{1}, \dots , \tau _{n}) \in \mathbb{R}^{n}_{\gt 0}$
. For fixed
${\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}$
, fixed
$N\in \mathbb{N}$
and function
$\Psi$
, we study the cardinality of the set
That is, the set of rational points
$(\frac {q_{1}}{q_{0}}, \dots , \frac {q_{n}}{q_{0}}) \in \mathbb{Q}^{n}$
with denominator and numerator bounded by
$N$
that lie in a
$p$
-adic rectangle with sidelengths
$\frac {\psi _{i}(N)}{|q_{0}|_{p}}$
in the
$i$
th coordinate axis and centre
${\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}$
. If the functions
$\psi _{i}$
are of the form
$\psi _{i}(q)=q^{-\tau _{i}}$
for some vector
$\boldsymbol{\tau }=(\tau _{1}, \dots , \tau _{n}) \in \mathbb{R}^{n}_{\gt 0}$
, we will use the notation
$\mathcal{Q}_{n}({\boldsymbol{x}}, \boldsymbol{\tau }, N)$
. Throughout, we write
$a \ll b$
to mean there exists some constant
$c\gt 0$
such that
$a \leq cb$
. If
$a \ll b$
and
$a\gg b$
, we write
$a \asymp b$
. In order to obtain good bounds on the cardinality of
$\mathcal{Q}_{n}({\boldsymbol{x}},\Psi ,N)$
, we use the Diophantine exponent
$\tau ({\boldsymbol{x}})$
defined as
\begin{equation*} \tau ({\boldsymbol{x}})\,:\!=\, \sup \left \{ \sum _{i=1}^{n}\tau _{i}\,:\, \max _{1 \leq i \leq n} \left \{|q_{0}x_{i}-q_{i}|_{p}^{\frac {1}{\tau _{i}}} \right \} \lt \left ( \max _{0 \leq i \leq n} |q_{i}| \right )^{-1}, \, \, \text{ for i.m. } \,(q_{0}, \dots , q_{n}) \in \mathbb{Z}^{n+1} \right \}\, , \end{equation*}
where ‘i.m.’ denotes ‘infinitely many’. Generally, the Diophantine exponent
$\tau ({\boldsymbol{x}})$
tells us how well
${\boldsymbol{x}}$
can be approximated by integer rational points. It was proven by Mahler (see for example [Reference Sprindžuk49]) that for all
$x \in \mathbb{Z}_{p}$
,
$\tau (x) \geq 2$
and that
$\tau ({\boldsymbol{x}}) = n+1$
for almost all
${\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}$
[Reference Jarník36]. By almost all here, we mean with respect to the
$n$
-dimensional
$p$
-adic Haar measure
$\mu _{n}$
on
$\mathbb{Q}_{p}^{n}$
normalised by
$\mu _{n}(\mathbb{Z}_{p}^{n})=1$
.
We have the following result on the cardinality of
$\mathcal{Q}_{n}({\boldsymbol{x}},\tau ,N)$
.
Theorem 1.1.
Let
${\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}$
and suppose that
$\tau ({\boldsymbol{x}}) = n+1$
. Let
$\Psi =(\psi _{1}, \dots , \psi _{n})$
be an
$n$
-tuple of functions
$\psi _{i}\,:\, \mathbb{N} \to (0,\infty )$
with each
for some
$\varepsilon \gt 0$
. Then there exists
$N_{0} \in \mathbb{N}$
such that for all
$N \geq N_{0}$
,
where
\begin{equation*} C_{1}=\max \left \{ 3(6\sqrt {n})^{n}, \frac {(n+2)! \pi ^{n/2}\sqrt {n}^{n+1}}{\Gamma \left (\frac {n}{2}+1 \right )}\right \}. \end{equation*}
This type of result has been proven in the real case; see [Reference Beresnevich, Haynes and Velani8, Lemma 6.1]. If we want to strengthen the statement to all
$\mathbb{Z}_{p}^{n}$
, we need to consider the Diophantine exponent of our point of interest. For this statement, we restrict it to the case when the approximation functions are power functions and
$n=1$
.
Lemma 1.2.
Let
$x \in \mathbb{Z}_{p}$
with Diophantine exponent
$\tau (x)$
and let
$\psi (q)=q^{-\tau }$
for some
$\tau \in \mathbb{R}_{+}$
with
$\max \{1, \tau (x)-1\} \lt \tau \lt \tau (x)$
. Then for any
$\epsilon \gt 0$
, there exists a sufficiently large
$N_{0} \in \mathbb{N}$
such that for all
$N \geq N_{0}$
In order to deduce the upper bound appearing in Lemma 1.2, we need to know the value of
$\tau (x)$
, which may not be immediate. By the aforementioned result that
$\tau (x)=2$
for almost all
$x \in \mathbb{Z}_{p}$
, if
$1\lt \tau \lt 2$
then for any
$\epsilon \gt 0$
there exists
$N_{0} \in \mathbb{N}$
such that for all
$N \geq N_{0}$
A natural question to ask is about the sharpness of the bounds presented in Theorem 1.1 and Lemma 1.2. We have the following result.
Theorem 1.3.
Let
$\boldsymbol{\tau }=(\tau _{1},\dots ,\tau _{n}) \in \mathbb{R}_{\gt 0}^{n}$
and suppose that
for each
$1 \leq i \leq n$
and that
$\tau ({\boldsymbol{x}})=n+1$
. Then there exists
$N_{0} \in \mathbb{N}$
such that for all
$N \geq N_{0}$
we have
Furthermore, the lower bound holds for all
${\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}$
.
As with Theorem 1.1, the lower bound statement has been proven in
$\mathbb{R}^{n}$
, see [Reference Ramírez, Simmons and Süess45, Lemma 3].
The proof of Lemma 1.2 and Theorem 1.3 use elementary techniques. The proof of Theorem 1.1 is more substantial and uses
$p$
-adic approximation lattices and lattice counting techniques. Prior to the proofs of these results, we give an application in Diophantine approximation.
2.
$p$
-adic Diophantine approximation
The study of Diophantine approximation is an intensively studied area of research in number theory. For a beautiful introduction to the topic, see the notes [Reference Beresnevich, Ramírez and Velani12]. In this article, we consider
$p$
-adic Diophantine approximation. Define the set of
$p$
-adic weighted simultaneously approximable points as follows. For an
$n$
-tuple of approximation functions
$\Psi =(\psi _{1}, \dots , \psi _{n})$
and
$q_{0} \in \mathbb{N}$
let
\begin{equation*} \mathfrak{A}_{q_{0}}(\Psi )= \underset {1 \leq i \leq n}{\bigcup _{|q_{i}|\leq q_{0}, \, \, gcd(q_{i},q_{0})=1}}\left \{ {\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}\,:\,\left |x_{i}-\frac {q_{i}}{q_{0}}\right |_{p}\lt \psi _{i}(q_{0}) \right \}, \end{equation*}
where
${\boldsymbol{x}}=(x_{1}, \dots , x_{n})$
. Define the set of weighted
$\Psi$
-approximable
$p$
-adic points as
That is, a point
${\boldsymbol{x}}$
is weighted
$\Psi$
-approximable if there exists infinitely many hyperrectangles, with centre
$\tfrac {\boldsymbol{p}}{q}\in \mathbb{Q}^{n}$
and sidelengths depending on
$\Psi$
and
$q$
, that contain
${\boldsymbol{x}}$
. If the approximation functions are the same in each coordinate axis, i.e.,
$\Psi =(\psi , \dots , \psi )$
, then we will use the notation
$\mathfrak{W}_{n}(\Psi )=\mathfrak{W}_{n}(\psi )$
, which is often referred to as the set of simultaneously
$\psi$
-approximable points. If each
$\psi _{i}(q) = q^{-\tau _{i}}$
for some
$\boldsymbol{\tau }=(\tau _{1}, \dots , \tau _{n}) \in \mathbb{R}^{n}_{\gt 0}$
use the notation
$\mathfrak{W}_{n}(\Psi )=\mathfrak{W}_{n}(\boldsymbol{\tau })$
.
Dirichlet’s Theorem in the
$p$
-adic setting implies that for
$\Psi =(p q^{-\tau _{1}}, \ldots , p q^{-\tau _{n}})$
the set
$\mathfrak{W}_{n}(\boldsymbol{\tau })=\mathbb{Z}_{p}^{n}$
provided
$\sum _{i=1}^{n} \tau _{i} \leq n+1$
, see for example [Reference Mahler42] for the
$n=1$
version, or [Reference Beresnevich, Levesley and Ward11, Lemma 3.3] (Lemma3.1 below) from which it can be deduced. Metric results on the set
$\mathfrak{W}_{n}(\Psi )$
analogous to those of Khintchine [Reference Khintchine37], Besicovitch [Reference Besicovitch17] and Jarnik [Reference Jarník35] from the classical setting have been proven.
The Khintchine-type result in the one dimensional
$p$
-adic setting was proven in [Reference Jarník36], and since then results in the
$p$
-adic dual setting [Reference Lutz41], and the weighted simultaneous setting [Reference Beresnevich, Levesley and Ward11] have been proven. See also [Reference Haynes27] for the analogous Duffin-Schaeffer type theorem in the
$p$
-adics and [Reference Kristensen and Laursen40] for the recent resolution.
For sets of zero Haar measure, we use Hausdorff measure, denoted
$\mathcal{H}^{f}$
for dimension function
$f$
, and Hausdorff dimension, denoted
$\dim _H$
, to provide more accurate notions of size. The definitions of Hausdorff measure and dimension readily follow in
$p$
-adic space. See [Reference Falconer25] for the definition of Hausdorff measure and dimension, and [Reference Beresnevich, Levesley and Ward11] for the relevant definitions in the
$p$
-adic setting.
Hausdorff measure and dimension results on the set
$\mathfrak{W}_{n}(\Psi )$
are also known. For the
$p$
-adic analogue of the Jarnik-Besicovitch Theorem see [Reference Abercrombie1], and see [Reference Beresnevich, Dickinson and Velani6, Theorem 16] for the
$p$
-adic dual and simultaneous approximation setting. In the
$p$
-adic weighted simultaneous setting, analogous to [Reference Rynne46] in the real setting, we have the following.
Theorem 2.1 ([Reference Beresnevich, Levesley and Ward11]). Let
$\sum _{i=1}^{n} \tau _{i} \gt n+1$
. Then
\begin{equation*} \dim _H\mathfrak{W}_{n}(\boldsymbol{\tau })= \min _{1 \leq i \leq n} \left \{ \frac {n+1+ \sum _{j=i}^{n}(\tau _{i}-\tau _{j})}{\tau _{i}} \right \}. \end{equation*}
2.1.
$p$
-adic approximation on manifolds
In recent decades, Diophantine approximation on curves and manifolds has been intensively studied, see for example the fundamental works [Reference Beresnevich4, Reference Kleinbock and Margulis38] in the real setting, and for an in-depth discussion on the topic see [Reference Bernik and Dodson16]. There has also been many results in the analogous
$p$
-adic setting. Kleinbock and Tomanov proved the extremality (i.e., almost all points w.r.t. the induced Haar measure on the manifold have
$\tau ({\boldsymbol{x}})=n+1$
) of
$p$
-adic manifolds, provided some non-degeneracy conditions are satisfied; see [Reference Kleinbock and Tomanov39] for more details. There are a variety of results for
$p$
-adic dual approximation (linear forms) on manifolds, see for example [Reference Beresnevich, Bernik and Kovalevskaya5, Reference Beresnevich and Kovalevskaya9, Reference Budarina20, Reference Datta and Ghosh23, Reference Mohammadi and Salehi Golsefidy43]; however, results in the simultaneous case are lacking.
For the Hausdorff dimension, there are results on simultaneously approximable points over the
$p$
-adic Veronese curve,
$\mathcal{C}_{f}=\{(x, x^{2}, \dots , x^{n})\,:\, x \in \mathbb{Z}_{p}\}$
, provided the approximation functions have sufficiently large Diophantine exponents, see [Reference Badziahin, Bugeaud and Schleischitz3, Reference Bugeaud, Budarina, Dickinson and O’Donnell21]. In [Reference Beresnevich, Levesley and Ward11], a lower bound for the Hausdorff dimension was found for general
$n$
-dimensional manifolds satisfying a strong differentiability condition (see [Reference Beresnevich, Levesley and Ward11] for more details). A key reason the upper bound could not be obtained was a lack of results on the distribution of rational points close to
$p$
-adic curves.
In this article, we consider approximation on
$p$
-adic hyperplanes. Note that in much of the previous work the manifold under consideration is usually “sufficiently curved” (formally, the requirement is often that the manifold is non-degenerate; see [Reference Kleinbock and Margulis38] for details), and so hyperplanes are not usually considered. However, there are still several results for Diophantine approximation on hyperplanes; see [Reference Beresnevich, Lee, Vaughan and Velani10, Reference Ramírez44, Reference Ramírez, Simmons and Süess45] for results in the real setting.
Consider the following setup. Fix
$1\leq m\leq n-1$
and set
$d=n-m$
. For any vector of
$p$
-adic integers
$\boldsymbol{\alpha } \in \mathbb{Z}_{p}^{m}$
define the coordinate hyperplane
We are interested in the set of weighted
$\Psi$
-approximable points on coordinate hyperplanes, i.e., the set
$\mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }}$
. Note that trivially
$\dim _H \mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }} \leq d$
, with equality when
$\sum _{i=1}^{n} \tau _{i} \leq n+1$
. Theorems 1.1–1.3 of this paper provide us with a good understanding of the behaviour of rational points close to coordinate hyperplanes, allowing us to prove the following result.
Theorem 2.2.
Let
$\Pi _{\boldsymbol{\alpha }}$
be a coordinate hyperplane of
$\mathbb{Z}_{p}^{n}$
of the form (
2
), let
$\boldsymbol{\alpha } \in \mathbb{Z}_{p}^{m}$
satisfy
$\tau (\boldsymbol{\alpha })=m+1$
. Let
$\boldsymbol{\tau }=(\tau _{1}, \dots , \tau _{n}) \in \mathbb{R}^{n}_{+}$
be a weight vector with the properties that
for all
$1 \leq i \leq n$
. Then
\begin{equation*} \dim _H \mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }} = \min _{1 \leq i \leq d} \left \{ \frac {n+1-\sum _{i=1}^{m}\tau _{d+i}+\underset {1 \leq j \leq d}{\sum _{\tau _{j} \leq \tau _{i}}}(\tau _{i}-\tau _{j})}{\tau _{i}} \right \}=s. \end{equation*}
Furthermore
$\mathcal{H}^{s}\left ( \mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }} \right )= \infty$
.
Remark 2.3. In the special case of simultaneous approximation, we have that
This gives us the expected dimension of
$\dim _H \mathfrak{W}_{n}(\tau )$
less the codimension of the hyperplane
$\Pi _{\boldsymbol{\alpha }}$
.
Remark 2.4.
The upper bound constraints on
$(\tau _{d+1}, \dots , \tau _{n})$
ensure that we can apply Theorem 1.1
, whereas the lower bound constraints ensure we can obtain a ubiquity hypothesis; see § 4.1 below. The condition that
$\sum _{i=1}^{n}\tau _{i}\gt n+1$
is merely present to ensure that we do not include the trivial case when
$\mathfrak{W}_{n}(\boldsymbol{\tau })=\mathbb{Z}_{p}^{n}$
, in which case
$\dim _H \mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }}=d$
.
Remark 2.5.
We note that coordinate hyperplanes, the main focus of this paper, satisfies the differentiability condition introduced in [
Reference Beresnevich, Levesley and Ward11
] and so part of the lower bound in Theorem 2.2 has been proven in [
Reference Beresnevich, Levesley and Ward11
]. To highlight the key difference between the lower bound obtained here and the lower bound achieved in [
Reference Beresnevich, Levesley and Ward11
], note that the approximation exponents on the independent variable do not need to be greater than the approximation exponents on
$\boldsymbol{\alpha }$
. The reason being in this case the ‘dependent variable’ is fixed and thus independent of the first
$d$
coordinates.
For general approximation functions
$\Psi =(\psi _{1}, \dots , \psi _{n})$
, recall the order of infinity of
$\psi _{i}$
to be
Providing the order of infinity of
$\psi _{i}$
exists and is positive and finite for each
$1 \leq i \leq n$
, then define
$\Psi ^{*}=(v_{1}, \dots , v_{n})$
.
Corollary 2.6.
Let
$\Psi =(\psi _{1}, \dots , \psi _{n})$
be an
$n$
-tuple of approximation functions with the order of infinity of
$\psi _{i}$
being positive finite in each coordinate. If
$\Psi ^{*}$
satisfy the same conditions as in Theorem 2.2
, then for all
$\boldsymbol{\alpha } \in \mathbb{Z}_{p}^{m}$
with
$\tau (\boldsymbol{\alpha })=m+1$
,
The corollary easily follows from the observation that (3) implies there exists a sufficiently large
$q \in \mathbb{N}$
such that
for all
$1 \leq i \leq n$
and
$\epsilon =(\epsilon _{1}, \dots , \epsilon _{n})\gt 0$
with
$\epsilon _{i} \to 0$
as
$q \to \infty$
. Thus
$\mathfrak{W}_{n}(\Psi ^{*}+ \epsilon ) \subseteq \mathfrak{W}_{n}(\Psi ) \subseteq \mathfrak{W}_{n}(\Psi ^{*}-\epsilon )$
, and so letting
$\epsilon \to 0$
we obtain the desired result. While Corollary 2.6 provides a result for general
$\Psi$
satisfying (3), note there are many functions where such an order of infinity does not exist.
The following section provides auxiliary results needed to prove Theorem 2.2. In particular, the framework for the Mass Transference Principle from rectangles to rectangles [Reference Wang and Wu51] is provided.
3. Auxiliary results for Theorem 2.2
The following known results are required to prove Theorem 2.2. We begin with the
$p$
-adic version of Minkowski’s theorem for systems of linear forms. The proof is an application of the pigeonhole principle and can be found in [Reference Beresnevich, Levesley and Ward11].
Lemma 3.1 ([Reference Beresnevich, Levesley and Ward11, Lemma 3.3]). Let each
$L_{i}({\boldsymbol{x}})\,:\,\mathbb{Z}_{p}^{n} \to \mathbb{Z}_{p}$
, with
$i=1, \dots , n$
, be a linear form with
$p$
-adic integer coefficients. Let
$\sum _{i=1}^{n} \tau _{i}=n+1$
for
$\tau _{i} \in \mathbb{R}_{+}$
and
$\sum _{i=1}^{n}\sigma _{i}=n$
for
$\sigma =(\sigma _{1},\ldots ,\sigma _{n})\in \mathbb{R}^{n}$
. Then there exists
$H_{\sigma }\gt 1$
such that for all integers
$H_{0},H_{1},\ldots , H_{n}$
with
$T^{n+1}=(H_{0}+1)$
$(H_{1}+1)\ldots (H_{n}+1)\geq H_{\sigma }$
there exists a non-zero rational integer vector
${\boldsymbol{x}}=(x_{0},x_{1}, \dots , x_{n})\in \mathbb{Z}^{n}$
with
satisfying the system of inequalities
We also require the following lemma, which tells us that the measure of a
$\limsup$
set of balls remains unaltered when the radii are multiplied by some constant. The Euclidean version of this result is well known; see for example [Reference Beresnevich, Dickinson and Velani6, Reference Beresnevich and Velani14]. We need the following ultrametric version.
Lemma 3.2 ([Reference Beresnevich, Levesley and Ward11, Lemma 4.1]). Let
$(X,d)$
be a separable ultrametric space and
$\mu$
be a Borel regular measure on
$X$
. Let
$(B_i)_{i\in \mathbb{N}}$
be a sequence of balls in
$X$
with radii
$r_i\to 0$
as
$i\to \infty$
. Let
$(U_i)_{i\in \mathbb{N}}$
be a sequence of
$\mu$
-measurable sets such that
$U_i\subset B_i$
for all
$i$
. Assume that for some
$c\gt 0$
Then the limsup sets
have the same
$\mu$
-measure.
3.1. The weighted mass transference principle
Another key result is the following Mass Transference Principle type theorem. In order to state the result of Wang and Wu [Reference Wang and Wu51], we need the notion of local ubiquity for rectangles, a variation of the notion of ubiquitous systems introduced by Beresnevich, Dickinson, and Velani [Reference Beresnevich, Dickinson and Velani6].
Fix an integer
$n \geq 1$
, and for each
$1 \leq i \leq n$
let
$(X_{i},|.|_{i}, m_{i})$
be a bounded locally compact metric space with
$m_{i}$
a
$\delta _{i}$
-Ahlfors regular measure. Consider the product space
$(X, |.|,m)$
, defined by
For any
$x \in X$
and
$r \in \mathbb{R}_{+}$
define the open ball
where
$B_{i}$
denotes the ball associated with the
$i^{\text{th}}$
metric space. Let
$J$
be an infinite countable index set and
$\beta \,:\, J \to \mathbb{R}_{+}$
a positive function. Let
$l_{k},u_{k}$
be two sequences in
$\mathbb{R}_{+}$
such that
$u_{k} \geq l_{k}$
with
$l_{k} \to \infty$
as
$k \to \infty$
. Define
Let
$\rho \,:\, \mathbb{R}_{+} \to \mathbb{R}_{+}$
be a non-increasing function with
$\rho (\beta _{\alpha }) \to 0$
as
$\beta _{\alpha } \to \infty$
. For each
$1 \leq i \leq n$
, let
$\{ R_{\alpha ,i}\}_{\alpha \in J}$
be a sequence of subsets in
$X_{i}$
. As with the standard setting of ubiquitous systems define the resonant sets
\begin{equation*} \left \{ R_{\alpha }=\prod _{i=1}^{n} R_{\alpha , i} \right \}_{ \alpha \in J}. \end{equation*}
For
${\boldsymbol{a}}=(a_{1}, \dots , a_{n}) \in \mathbb{R}_{+}^{n}$
denote the set of hyperrectangles
where for some set
$A$
and
$b \in \mathbb{R}_{+}$
let
$\Delta (A,b)= \bigcup _{a \in A}B(a,b)$
.
Definition 3.3 (local ubiquitous system of rectangles). Call
$(\{R_{\alpha }\}_{\alpha \in J}, \beta )$
a local ubiquitous system of rectangles with respect to
$(\rho ,{\boldsymbol{a}})$
if there exists a constant
$c\gt 0$
such that for any ball
$B \subset X$
,
\begin{equation*} \limsup _{k \to \infty } m \left ( B \cap \bigcup _{\alpha \in J_{k}}\Delta (R_{\alpha }, \rho (u_{k})^{{\boldsymbol{a}}}) \right ) \geq c m(B). \end{equation*}
For
$\textbf {t}=(t_{1}, \dots , t_{n}) \in \mathbb{R}^{n}_{+}$
define
Given the above notations and definitions, we can state the Mass Transference Principle from rectangles to rectangles (MTPRR) of [Reference Wang and Wu51].
Theorem 3.4 (Mass Transference Principle from rectangles to rectangles). Under the settings above assume that
$(\{ R_{\alpha } \}_{\alpha \in J}, \beta )$
satisfies the local ubiquity for systems of rectangles condition with respect to
$(\rho , {\boldsymbol{a}})$
. Then
\begin{equation*} \dim _H W(\textbf {t}) \geq \min _{A_{i} \in A} \left \{ \sum _{j \in K_{1}} \delta _{j}+ \sum _{j \in K_{2}} \delta _{j}+ \frac {\sum _{j \in K_{3}}a_{j}\delta _{j}-\sum _{j \in K_{2}}t_{j}\delta _{j}}{A_{i}} \right \}=s, \end{equation*}
where
$A=\{ a_{i}, a_{i}+t_{i} , 1 \leq i \leq n \}$
and
$K_{1},K_{2},K_{3}$
are a partition of
$\{1, \dots , n\}$
defined as
Furthermore
$\mathcal{H}^{s}(B \cap W(\boldsymbol{\tau }))=\mathcal{H}^{s}(B)$
.
Hence, provided we can find a
$\limsup$
set of hyperrectangles that satisfy the local ubiquity property for rectangles, then we have a lower bound on the Hausdorff dimension of the corresponding
$\limsup$
set of shrunken hyperrectangles.
4. Proof of Theorem 2.2
We split the proof into the upper and lower bounds and solve each case separately. In both cases we will use the following simplified set. Let
$\pi$
be the projection
$\pi \,:\, \mathbb{Z}_{p}^{n} \to \mathbb{Z}_{p}^{n-m}$
, defined by
By a well-known result of fractal geometry (see [Reference Falconer25, Proposition 3.3]), as
$\pi$
is a bi-Lipschitz mapping over
$\mathfrak{W}_{n}(\boldsymbol{\tau })\cap \Pi _{\boldsymbol{\alpha }}$
, we have that
Let
$\boldsymbol{\tau }_{m}=(\tau _{d+1}, \dots , \tau _{n})$
denote the
$m$
-tuple of approximation exponents of
$\boldsymbol{\alpha }$
, and similarly, let
$\boldsymbol{\tau }_{d}=(\tau _{1}, \dots , \tau _{d})$
denote the
$d$
-tuple of approximation exponents of the independent variables of
$\Pi _{\boldsymbol{\alpha }}$
. Consider the set of integers
\begin{equation*} \mathcal{Q}(\boldsymbol{\alpha }, \boldsymbol{\tau }_{m})\,:\!=\, \left \{ q_{0} \in \mathbb{N} \,: \left |\alpha _{i} - \frac {q_{d+i}}{q_{0}} \right |_{p} \lt q_{0}^{-\tau _{d+i}}, \, \text{ for some } \, \begin{array}{c} |q_{d+i}| \leq q_{0}, \\ gcd(q_{d+i},q_{0})=1,\\ \end{array} \, 1 \leq i \leq m \right \}, \end{equation*}
and the union of sets
\begin{equation*} \mathfrak{A}_{q_{0}}^{*}(\boldsymbol{\tau }_{d})= \underset {1 \leq i \leq d}{\bigcup _{|q_{i}| \leq q_{0}, \, \, gcd(q_{i},q_{0})=1}} \left \{ {\boldsymbol{x}} \in \mathbb{Z}_{p}^{d}\,: \left |x_{i}-\frac {q_{i}}{q_{0}} \right |_{p} \lt q_{0}^{-\tau _{i}} \right \}. \end{equation*}
Then, we have that
and so, by (4), our problem is reduced to finding upper and lower bounds for
$\dim _H \underset {q_{0} \in \mathcal{Q}(\boldsymbol{\alpha }, \boldsymbol{\tau }_{m})}{\limsup } \mathcal{A}^{*}_{q_{0}}(\boldsymbol{\tau }_{d})$
.
4.1. Upper bound
For the upper bound we take the standard cover of hyperrectangles used in the construction of
$\mathfrak{A}^{*}_{q}(\boldsymbol{\tau }_{d})$
. By hyperrectangles in the
$p$
-adic setting we mean Cartesian products of
$p$
-adic balls in each coordinate axis. Concisely,
\begin{equation} \left \{ {\boldsymbol{x}} \in \mathbb{Z}_{p}^{d}\,: \left |x_{i}-\frac {q_{i}}{q_{0}} \right |_{p} \lt q_{0}^{-\tau _{i}} \right \} =\prod _{i=1}^{d} B\left ( \frac {q_{i}}{q_{0}}, q_{0}^{-\tau _{i}}\right )\, , \end{equation}
where
$B(x,r)$
denotes a ball in
$\mathbb{Z}_{p}$
induced by the
$p$
-adic norm. Observe that, unlike the Euclidean case, the centre of the ball is not uniquely defined. In particular, if
$|x-y|_{p}\lt r$
, then by the strong triangle inequality
$B(x,r)=B(y,r)$
. It is critical in the upper bound that we can estimate the size of
$\mathcal{Q}(\boldsymbol{\alpha },\boldsymbol{\tau }_{m})$
. By a standard geometrical argument, note that each hyperrectangle of the form (5) in the construction of
$\mathfrak{A}_{q}^{*}(\boldsymbol{\tau }_{d})$
can be covered by a finite collection of balls
$\mathfrak{B}_{q}(\tau _{i})$
of radius
$q^{-\tau _{i}}$
for
$1 \leq i \leq d$
. Without loss of generality, we can assume that
$\tau _{1} \geq \dots \geq \tau _{d}$
, since if not, then take some bi-Lipschitz mapping to reorder the coordinate axes so this is the case. Fix some
$1\leq i \leq d$
. For each coordinate
$1\leq j \leq d$
, consider the ball
$B(\tfrac {q_{j}}{q_{0}}, p^{-\ell _{j}})$
, where
$\ell _{j}\in \mathbb{N}$
is uniquely chosen so that
Each ball
$B(\tfrac {q_{j}}{q_{0}}, p^{-\ell _{j}})$
can be covered by
$p^{\max \{0,\ell _{i}-\ell _{j}\}}$
balls
$\mathcal{G}_{j}$
of radii
$p^{-\ell _{i}}$
. Note that
Thus, by considering the Cartesian product of all balls in each set
$\mathcal{G}_{j}$
, we have a covering by balls of radius
$p^{-\ell _{i}}$
of the hyperrectangle of type (5), and the cardinality of the cover is at most
\begin{equation*} \ll \prod _{j=i}^{d} \frac {q^{-\tau _{j}}}{q^{-\tau _{i}}}=q^{\sum _{j=i}^{d}(\tau _{i}-\tau _{j})}. \end{equation*}
Next, we need to know how many hyperrectangles are in the set
$\mathfrak{A}^{*}_{q}(\boldsymbol{\tau }_{d})$
. Working this out per layer is hard, but using our main result, Theorem 1.1, for each
$k\in \mathbb{N}$
, we can estimate the number of hyperrectangles in the set
To do this, observe the following. Let
where
$\Psi _{m}$
has functions of the form
$q\mapsto (2^{-1}q)^{-\tau _{i}}$
in each of the
$m$
coordinates. Since
$\tau _{i}\gt 1$
for each
$1 \leq i \leq m$
we have that each
$q_{0}\in \mathcal{Q}^{'}_{m}(\boldsymbol{\alpha }, \boldsymbol{\tau }_{m}, N)$
has unique associated
$(q_{0},q_{1}, \dots , q_{m})\in \mathcal{Q}_{m}(\boldsymbol{\alpha }, \Psi _{m},N)$
. So, with the additional coprimality condition, we have that
Furthermore, by the coprimality condition, note that
are equivalent since
$p \nmid q_{0}$
. To see that
$p\nmid q_{0}$
suppose that
$q_{0}=p^{k}q_{0}'$
for some
$k\in \mathbb{N}$
. Since
$gcd(q_{i},q_{0})=1$
we clearly have
$p \nmid q_{i}$
. As
$\alpha _{i}\in \mathbb{Z}_{p}$
this leads us to conclude, by the strong triangle inequality, that
This cannot be true for
$N$
sufficiently large, and so
$p\nmid q_{0}$
. Thus,
\begin{equation*} \mathcal{Q}^{'}_{m}(\boldsymbol{\alpha },\boldsymbol{\tau }_{m},N)=\left \{ q_{0}\in \mathbb{N}\,:\, \begin{array}{c} 0\lt q_{0}\leq N\, ,\\ \max _{1\leq i\leq m} |q_{i}|\leq N\, ,\\ gcd(q_{i},q_{0})=1\, ,\end{array} \left |\alpha _{i}-\frac {q_{i}}{q_{0}}\right |_{ p}\lt (2^{-1}N)^{-\tau _{i}} \quad 1\leq i \leq m \right \}\, . \end{equation*}
Consider any
$q_{0} \in C(\boldsymbol{\alpha },\boldsymbol{\tau }_{m},k)$
. By definition of
$\mathcal{Q}(\boldsymbol{\alpha },\boldsymbol{\tau }_{m})$
there exists
$(q_{d+1},\ldots ,q_{d+m})\in \mathbb{Z}^{m}$
with
$gcd(q_{d+i},q_{0})=1$
and
$\max _{i}|q_{d+i}|\leq q_{0}$
. Since
$2^{k}\leq q_{0}\lt 2^{k+1}$
we have
$\max _{i}|q_{d+i}|\leq 2^{k+1}$
and
Thus
$q_{0}\in \mathcal{Q}^{'}_{m}(\boldsymbol{\alpha }, \Psi _{m},2^{k+1})$
, and so
by (6). Each
$\tau _{i}$
-approximation function is monotonic decreasing and so
\begin{equation*} \limsup _{k\to \infty }\bigcup _{q_{0}\in C(\boldsymbol{\alpha },\boldsymbol{\tau }_{m},k)}\underset {1 \leq i \leq d}{\bigcup _{|q_{i}| \leq q_{0}, \, }} \left \{ {\boldsymbol{x}} \in \mathbb{Z}_{p}^{d}\,:\, \left |x_{i}-\frac {q_{i}}{q_{0}} \right |_{p} \lt (2^k)^{-\tau _{i}} \right \}\, , \end{equation*}
is a cover of our set
$\pi \left (\mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }}\right )$
. Hence, for any
$k_{0}\in \mathbb{N}$
sufficiently large, we have that
\begin{align*} \mathcal{H}^{s}\left ( \pi \left (\mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }}\right )\right ) & \leq \sum _{k=k_{0}}^{\infty } \sum _{q \in C(\boldsymbol{\alpha }, \boldsymbol{\tau }_{m}, k)} q^{d} \#\mathfrak{B}_{2^{k}}(\tau _{i}).((2^{k})^{-\tau _{i}})^{s}, \\ & \overset {\text{Theorem 1.1}}{\ll } \sum _{k=k_{0}}^{\infty } 2^{(k+1)(m+1-\sum _{i=1}^{m}\tau _{d+i})}(2^{k+1})^{d}(2^{k})^{\sum _{j=i}^{d}(\tau _{i}-\tau _{j})}(2^{k})^{-\tau _{i}s}, \\ & \ll \sum _{k=k_{0}}^{\infty }2^{k(n+1-\sum _{i=1}^{m}\tau _{d+i}+\sum _{j=i}^{d}(\tau _{i}-\tau _{j})-\tau _{i}s)}, \end{align*}
The above sum converges when
for any
$\epsilon \gt 0$
. This is true for each
$1 \leq i \leq d$
, and as
$\epsilon$
is arbitrary we have that
\begin{equation*} s\geq \min _{1 \leq i \leq d} \left \{ \frac {n+1-\sum _{i=1}^{m}\tau _{d+i}+\sum _{j=i}^{d}(\tau _{i}-\tau _{j})}{\tau _{i}} \right \}, \end{equation*}
completing the upper bound result.
4.2. Lower bound
In order to use the weighted mass Transference Principle (Theorem 3.4) we need to construct a ubiquitous system of rectangles. Let
\begin{equation*} \begin{array}{ccc} J=\mathcal{Q}(\boldsymbol{\alpha }, \boldsymbol{\tau }_{m}), & R_{q,i}=\left \{ \dfrac {q_{i}}{q} \in \mathbb{Q} \,:\, \begin{array}{c} |q_{i}| \leq q, \\ gcd(q_{i},q)=1 \end{array} \right \}, & R_{q}= \prod _{i=1}^{d}R_{q,i},\\ \beta (q)=q, & \rho (q)=Cq^{-1}, & l_{k}=M^{k}, \, \, u_{k}=M^{k+1}, \end{array} \end{equation*}
with
$M \in \mathbb{N}$
and
$C\gt 0$
constant, both to be determined later. We prove the following.
Proposition 4.1.
Let
$R_{q}$
,
$\rho$
, and
$J_{k}$
be defined as above. Let
$\tilde {v}=(v_{1}, \dots , v_{d}) \in \mathbb{R}^{d}_{\gt 0}$
with each
$v_{i} \gt 1$
and
for
and each
$\tau _{i}\gt 1$
. Then for any ball
$B=B(x,r) \subset \mathbb{Z}_{p}^{d}$
, with centre
$x \in \mathbb{Z}_{p}^{d}$
and radius
$0\lt r\lt r_{0}$
for some
$r_{0} \in \mathbb{R}_{+}$
, there exists sufficiently large
$k, M \in \mathbb{N}$
and a constant
$c\gt 0$
such that
\begin{equation*} \mu _{d}\left (B \cap \bigcup _{q \in J_{k}} \Delta (R_{{\boldsymbol{q}}}, \rho (u_{k})^{\tilde {v}}) \right ) \geq c \mu _{d}(B). \end{equation*}
The proof follows the same style of similar results in
$\mathbb{R}^{n}$
. See [Reference Beresnevich, Ramírez and Velani12, Theorem 1.3] for the one dimensional real case, or [Reference Beresnevich, Levesley and Ward11, Proposition 5.1] for the
$n$
-dimensional
$p$
-adic case.
Proof. Fix some ball
$B=B({\boldsymbol{y}},r)$
for some
${\boldsymbol{y}} \in \mathbb{Z}_{p}^{n}$
and
$r \in \{p^{i}\,:\, i \in \mathbb{N}\cup \{0\} \}$
. We will assume that
$k$
is sufficiently large so that
$M^{k}r\geq 1$
. For any
$y=(y_{1}, \dots , y_{d}) \in (\mathbb{Z}_{p} \backslash \mathbb{Q})^{d}$
, consider the system of inequalities
\begin{equation} \begin{cases} |q_{0}\alpha _{i}-q_{d+i}|_{p} \lt (M^{k+\frac {1}{n+1}})^{-\tau _{d+i}}, \quad 1 \leq i \leq m, \\ |q_{0}y_{i}-q_{i}|_{p}\lt p^{\frac {n}{d}}(M^{k+\frac {1}{n+1}})^{-v_{i}}, \quad 1 \leq i \leq d, \\ \max _{1 \leq i \leq n} |q_{i}| \leq M^{k}, \\ |q_{0}| \leq M^{k+1}. \end{cases} \end{equation}
By the condition on
$\tilde {v}$
, we have, by Lemma 3.1, that there exists a non-zero integer solution
$(q_{0}, \dots , q_{n})$
$\in \mathbb{Z}^{n+1}$
to (8) for any
${\boldsymbol{y}} \in B$
. We can assume without loss of generality that
$q_{0} \geq 0$
and, furthermore, that
$q_{0} \neq 0$
since each
$v_{i}, \tau _{d+i}\gt 1$
for all
$1 \leq i \leq d$
and
$1 \leq j \leq m$
. As we wish to have a statement for rectangles, rather than linear forms, we need to divide through by
$|q_{0}|_{p}$
. To ensure we do not divide by a value too small, we remove the set of
$q_{0}$
that contain large powers of
$p$
, that is, all
$q_{0}$
such that
$|q_{0}|_{p} \leq p^{-\lambda _{0}}$
for some fixed
$\lambda _{0} \in \mathbb{N}$
. Since
$v_{i}, \tau _{d+j}\gt 1$
for each
$1 \leq i \leq d$
and
$1 \leq j \leq m$
, (8) combined with
$0\lt q_{0} \leq M^{k+1}$
implies that
$|q_{i}|_{p} \leq |q_{0}|_{p}$
for each
$1 \leq i \leq n$
, provided that
$k$
is sufficiently large.
For fixed solution
$(q_{0},\ldots ,q_{n})$
to (8) let
$\lambda$
be the integer such that
$|q_{0}|_{p}=p^{-\lambda }$
. Write
$q_{0}'=q_{0}p^{-\lambda }$
and
$q_{i}'=q_{i}p^{-\lambda }$
. Observe that
$q_{0}',q_{i}' \in \mathbb{Z}$
, that
for each
$1 \leq i \leq n$
, and that
We have similar for the inequalities on
$\boldsymbol{\alpha }$
. We want to count the number of
$\frac {{\boldsymbol{q}}}{q_{0}}=\left ( \frac {q_{1}}{q_{0}}, \dots , \frac {q_{d}}{q_{0}} \right ) \in R_{q_{0}}$
such that
By using our assumptions that
$r\geq M^{-k}$
and each
$v_{i}\gt 1$
, we have that
$r\gt \rho (M^{k+1})^{v_{i}}$
for each
$i=1,\ldots ,d$
. So, by the strong triangle inequality, we need
in order for
$\tfrac {{\boldsymbol{q}}}{q_{0}}$
to satisfy (11). For
$q_{0}$
fixed and each
$|q_{i}| \leq q_{0}$
by congruence classes, we have that there are at most
$(2q_{0}r+1)^{d}\lt 3^{d}M^{kd}r^{d}$
suitable values of
${\boldsymbol{q}}$
solving (12). Hence, we have that
\begin{align*} &\mu _{d} \left ( B \cap \underset {\lambda \geq \lambda _{0}}{\bigcup } \underset { 0\lt q_{0}' \leq \frac {M^{k+1}}{p^{\lambda }}: \, \, q_{0}' \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , \frac {M^{k+1}}{p^{\lambda }}\right )}{\bigcup _{|q_{i}'|\leq \frac {M^{k}}{p^{\lambda }}}} \bigcup _{\left ( \frac {q_{1}'}{q_{0}'}, \dots , \frac {q_{d}'}{q_{0}'} \right ) \in B} \prod _{i=1}^{d} B\left ( \frac {q_{i}'}{q_{0}'}, p^{\lambda +\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-v_{i}} \right ) \right )\\ & \quad\leq \sum _{\lambda \geq \lambda _{0}} \#\mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau }, \frac {M^{k+1}}{p^{\lambda }} \right ) \left (3 \frac {M^{k}}{p^{\lambda }}r \right )^{d} p^{d \lambda + n} M^{-k(n+1-\tilde {\tau })-1+\frac {\tilde {\tau }}{n+1}}, \\ & \quad \overset {Theorem 1.1}{\leq } \sum _{\lambda \geq \lambda _{0}} C_{1}\left ( \frac {M^{k+1}}{p^{\lambda }} \right )^{m+1-\tilde {\tau }}3^{d}\left ( \frac {M^{k}}{p^{\lambda }} \right )^{d}p^{d\lambda + n} M^{-\left (k(n+1-\tilde {\tau })+1-\frac {\tilde {\tau }}{n+1} \right )}\mu _{d}(B) \\ & \quad = \sum _{\lambda \geq \lambda _{0}} \mu _{d}(B)C_{1}3^{d}p^{n-\lambda (m+1-\tilde {\tau })}M^{m-\tilde {\tau }+\frac {\tilde {\tau }}{n+1}}, \\ & \quad \leq C_{1}3^{d}M^{m-\tilde {\tau }+\frac {\tilde {\tau }}{n+1}}\frac {p^{n+(1-\lambda _{0})(m+1-\tilde {\tau })}}{p^{m+1-\tilde {\tau }}-1}\mu _{d}(B). \end{align*}
Take
$\lambda _{0}$
sufficiently large, say
\begin{equation*} p^{\lambda _{0}} \gt \left ( 2\frac {{ C_{1}}3^{d}p^{n+m+1-\tilde {\tau }}M^{m-\tilde {\tau }+\frac {\tilde {\tau }}{n+1}}}{p^{m+1-\tilde {\tau }}-1} \right )^{\frac {1}{m+1-\tilde {\tau }}}. \end{equation*}
Observe that since
$\tilde {\tau }\gt m+\frac {m}{n}$
the fact that
$\lambda _{0}$
is dependent on
$M$
is irrelevant since the value decreases as
$M$
increases; hence, we could replace
$M^{m-\tilde {\tau }+\frac {\tilde {\tau }}{n+1}}$
by
$1$
. Then we have that
\begin{equation*} \mu _{d} \left ( B \cap \underset {\lambda \geq \lambda _{0}}{\bigcup } \underset { 0\lt q_{0}' \leq \frac {M^{k+1}}{p^{\lambda }}: \, \, q_{0}' \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , \frac {M^{k+1}}{p^{\lambda }}\right )}{\bigcup _{|q_{i}|\leq \frac {M^{k}}{p^{\lambda }}}} \bigcup _{\left ( \frac {q_{1}'}{q_{0}'}, \dots , \frac {q_{d}'}{q_{0}'} \right ) \in B} \prod _{i=1}^{d} B\left ( \frac {q_{i}'}{q_{0}'}, p^{\lambda +\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-v_{i}} \right ) \right ) \leq \frac {1}{2} \mu _{d}(B). \end{equation*}
and so
\begin{align*} &\mu _{d}\left ( B \cap \underset {0\lt q_{0}' \leq M^{k+1}: \, \, q_{0}' \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , M^{k+1}\right ) , \, \, |q_{0}|_{p} \geq p^{-\lambda _{0}}}{\bigcup _{|q_{i}| \leq M^{k}}} \prod _{i=1}^{n} B\left ( \frac {q_{i}}{q_{0}} , p^{\lambda _{0}+\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-\alpha _{i}} \right ) \right ) \\ & \quad \geq \mu _{d}\left ( B \cap \underset {0\lt q_{0}' \leq M^{k+1}: \, \, q_{0}' \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , M^{k+1}\right )}{\bigcup _{|q_{i}| \leq M^{k}}} \prod _{i=1}^{n} B\left ( \frac {q_{i}}{q_{0}} , p^{\lambda +\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-\alpha _{i}} \right ) \right ) \\ & \qquad - \mu _{d}\left ( B \cap \underset {0\lt q_{0}' \leq M^{k+1}: \, \, q_{0}' \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , M^{k+1}\right ), \, \, |q_{0}|_{p}\lt p^{-\lambda _{0}}}{\bigcup _{|q_{i}| \leq M^{k}}} \prod _{i=1}^{n} B\left ( \frac {q_{i}}{q_{0}} , p^{\lambda +\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-\alpha _{i}} \right ) \right ) \\ & \quad \geq \frac {1}{2}\mu _{d}(B). \end{align*}
Similarly to the above we can deduce that
\begin{align} &\mu _{d} \left ( B \cap \underset {M^{k} \lt q_{0} \leq M^{k+1}: \, \, q_{0} \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , M^{k+1}\right ), \, \, |q_{0}|_{p} \geq p^{-\lambda _{0}}}{\bigcup _{|q_{i}| \leq M^{k} }}\prod _{i=1}^{n}B\left ( \frac {q_{i}}{q_{0}}, p^{\lambda _{0}+\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-\alpha _{i}} \right ) \right ) \nonumber \\ & \quad\geq \mu _{d}\left ( B \cap \underset {0 \lt q_{0}\lt M^{k+1} : \, \, q_{0} \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , M^{k+1}\right ), \, \, |q_{0}|_{p} \geq p^{-\lambda _{0}}}{\bigcup _{|q_{i}| \leq M^{k}}} \prod _{i=1}^{n} B\left ( \frac {q_{i}}{q_{0}} , p^{\lambda _{0}+\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-\alpha _{i}} \right ) \right ) \\ & \qquad - \mu _{d}\left ( B \cap \underset {0 \lt q_{0} \leq M^{k}:\, \, q_{0} \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , M^{k}\right ), \, \, |q_{0}|_{p} \geq p^{-\lambda _{0}}}{\bigcup _{|q_{i}| \leq M^{k}}} \prod _{i=1}^{n} B\left ( \frac {q_{i}}{q_{0}} , p^{\lambda _{0}+\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-\alpha _{i}} \right ) \right ). \nonumber \end{align}
Note that we are justified in taking the smaller set
$\mathcal{Q}'_{m}(\boldsymbol{\alpha }, \boldsymbol{\tau }, M^{k})$
rather than
$\mathcal{Q}_{m}(\boldsymbol{\alpha } , \boldsymbol{\tau } , M^{k+1})$
in the last row of the (13) since
Calculating the measure of the 3rd row of (13) gives us that
\begin{align*} &\mu _{d}\left ( B \cap \underset {0 \lt q_{0} \leq M^{k}:\, \, q_{0} \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , M^{k}\right ), \, \, |q_{0}|_{p} \geq p^{-\lambda _{0}}}{\bigcup _{|q_{i}| \leq M^{k}}} \prod _{i=1}^{n} B\left ( \frac {q_{i}}{q_{0}} , p^{\lambda _{0}+1}\left (M^{k+\frac {1}{n+1}}\right )^{-\alpha _{i}} \right ) \right )\\ & \quad \leq \#\mathcal{Q}'_{m}(\boldsymbol{\alpha }, \boldsymbol{\tau }, M^{k}) \left ( 3M^{k}r \right )^{d} p^{d\lambda _{0}+n}M^{-\left (k(n+1-\tilde {\tau })+1-\frac {\tilde {\tau }}{n+1}\right )} \\ & \quad \overset {\text{Theorem 1.1}}{\leq } C_{1}M^{k(m+1-\tilde {\tau })} 3^{d}M^{kd}p^{d\lambda _{0}+n}M^{-\left (k(n+1-\tilde {\tau })+1-\frac {\tilde {\tau }}{n+1}\right )}\mu _{d}(B)\\ & \quad\leq 3^{d}p^{d\lambda _{0}+n}M^{-(1-\frac {\tilde {\tau }}{n+1})}\mu _{d}(B). \end{align*}
Taking
for some constant
$c_{1}\lt \frac {1}{2}$
and applying this to (13) gives us that
\begin{equation*} \mu _{d} \left ( B \cap \underset {q_{0} \in \mathcal{Q}'_{m}\left (\boldsymbol{\alpha }, \boldsymbol{\tau } , M^{k+1}\right ), \, \, |q_{0}|_{p} \geq p^{-\lambda _{0}}}{\underset {M^{k} \lt q_{0} \leq M^{k+1}: \, \, }{\bigcup _{|q_{i}| \leq M^{k} }}}\prod _{i=1}^{n}B\left ( \frac {q_{i}}{q_{0}}, p^{\lambda _{0}+\frac {n}{d}}\left (M^{k+\frac {1}{n+1}}\right )^{-\alpha _{i}} \right ) \right ) \geq \left ( \frac {1}{2}-c_{1} \right )\mu _{d}(B). \end{equation*}
To complete the proof take the constant
$C$
associated with the function
$\rho$
to be
Given Proposition 4.1, we have that
$(R_{q}, \beta )$
is a local ubiquitous system of rectangles with respect to
$(\rho ,\tilde {v})$
, provided
$\sum _{i=1}^{d}v_{i}= n+1-\sum _{i=1}^{m}\tau _{d+i}$
and (7) is satisfied. Given
$\boldsymbol{\tau }_{d}=(\tau _{1}, \dots , \tau _{d}) \in \mathbb{R}^{d}_{\gt 0}$
assume without loss of generality that
$\tau _{1}\gt \tau _{2}\gt \dots \gt \tau _{d}$
and define each
$v_{d-i}$
recursively by
\begin{equation*} v_{d-i}=\min \left \{ \tau _{d-i}, \frac {n+1-\sum _{i=1}^{m}\tau _{d+i}-\sum _{j=d-i+1}^{d}v_{j}}{d-i} \right \}. \end{equation*}
By the condition on
$\boldsymbol{\tau }_{d}$
of Theorem 2.2, there exists a
$k \in \{1, \dots , d\}$
such that
for all
$1 \leq l \leq d-k$
. Clearly each
$v_{i}\leq \tau _{i}$
for
$1 \leq i \leq d$
, and so the associated vector
$\mathbf{t}=(t_{1}, \dots t_{n-1}) \in \mathbb{R}^{n-1}_{\geq 0}$
is well defined by
Consider the set
For each
$A_{i} \in A$
observe the following:
-
i)
$A_{i} \in \{v_{1}, \dots , v_{d}\}$
: Then we have the setsBy Theorem 3.4 we have that
\begin{equation*} \begin{array}{ccc} K_{1}=\{1, \dots , \max \{i,d-k\} \}, & K_{2}=\{ \max \{i+1,d-k+1\}, \dots , d\}, & K_{3}=\emptyset . \end{array} \end{equation*}
Since
\begin{align*} &\dim _H\mathfrak{W}_{n}(\boldsymbol{\tau })\cap \Pi _{\boldsymbol{\alpha }}\\ &\quad \geq \min _{A_{i}} \left \{ \frac {\max \{i,d-k\}v_{i}+(d-\max \{i+1,d-k+1\}+1)v_{i}- \sum _{j=\max \{i+1,\,d-k+1\}}^{d}t_{j}}{v_{i}} \right \}, \\ &\quad = \min _{A_{i}} \left \{ \frac {d v_{i}- \sum _{j=\max \{i+1,\,d-k+1\}}^{d}t_{j}}{v_{i}} \right \}. \end{align*}
$t_{j}=0$
for
$d-k+1 \leq j \leq d$
the above equation gives a dimension result of
$d=n-m$
, the maximal dimension of
$\mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }}$
.
-
ii)
$A_{i} \in \{\tau _{1}, \dots , \tau _{d}\}$
: Since
$\tau _{i}=v_{i}$
for
$d-k+1 \leq i \leq d$
the above argument covers such case, so we only need to consider
$\tau _{i}$
for
$1 \leq i \leq d-k$
. For such
$\tau _{i}$
we have the setsApplying Theorem 3.4 we have
\begin{equation*} \begin{array}{ccc} K_{1}=\emptyset , & K_{2}=\{ i, \dots , d\}, & K_{3}=\{1, \dots , i-1\}. \end{array} \end{equation*}
\begin{align*} \dim _H\mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }} & \geq \min _{A_{i}} \left \{ \frac {(d-i+1)\tau _{i} + \sum _{j=1}^{i-1}v_{j} - \sum _{j=i}^{d}t_{j}}{\tau _{i}} \right \}, \\ & = \min _{A_{i}} \left \{ \frac {(d-i+1)\tau _{i}+ (d-k)\left ( \frac {n+1-\sum _{i=1}^{m}\tau _{d+i}-\sum _{j=d-k+1}^{d}v_{j}}{d-k} \right )-\sum _{j=i}^{d-k}\tau _{j}}{\tau _{i}} \right \}, \\ &= \min _{A_{i}} \left \{ \frac {n+1-\sum _{i=1}^{m}\tau _{d+i}+\sum _{j=i}^{d}(\tau _{i}-\tau _{j})}{\tau _{i}} \right \}. \end{align*}
Combining i) and ii) we have that
\begin{equation*} \dim _H\mathfrak{W}_{n}(\boldsymbol{\tau }) \cap \Pi _{\boldsymbol{\alpha }} \geq \min _{1 \leq i \leq d} \left \{ \frac {n+1-\sum _{i=1}^{m}\tau _{d+i}+\sum _{j=i}^{d}(\tau _{i}-\tau _{j})}{\tau _{i}} \right \}, \end{equation*}
completing the proof of the lower bound, and thus completing the proof of Theorem 2.2.
5. Proof of the counting results
Recall, we are providing bounds on the set
We begin with the two easier statements, namely the lower bound statement of Theorem 1.3 and Lemma 1.2. The style of proof used in the lower bound of Theorem 1.3 follows a similar method to the proof in the real case analogue, see [Reference Ramírez, Simmons and Süess45, Lemma 3].
Proof of Theorem
1.3: Fix
${\boldsymbol{x}}=(x_{1}, \dots , x_{n}) \in \mathbb{Z}_{p}^{n}$
and take
${ \mathbf{t}}=(t_{1}, \dots , t_{n}) \in \mathbb{N}^{n}$
to be the integers such that
Denote by
$P=\prod _{i=1}^{n}p^{t_{i}}$
. Consider a set of open disjoint rectangles
$\{R_{i} \}_{i=1}^{P}$
, each with some centre point
$k_{i}=(k_{i,1}, \dots , k_{i,n}) \in \mathbb{Z}^{n}$
and sidelights
$p^{-t_{i}}$
. Choose the set of centre points
$\{k_{i}\}$
such that
$\mathbb{Z}_{p}^{n} \subseteq \bigcup _{i=1}^{P}R_{i}$
. Consider the
$(N+1)^{n+1}$
set of points of the form
with
$q_{i} \in [0,N]$
for each
$0 \leq i \leq n$
. By the pigeon-hole principle there exists at least one rectangle, say
$R_{j}$
, containing at least
points. As
$\sum _{i=1}^{n}\tau _{i}\lt n+1$
we can choose
$N$
sufficiently large so that
$p^{-n}N^{n+1-\sum _{i=1^{n}}\tau _{i}}\gt 2$
. Order the points
$(q_{0},\dots ,q_{n})$
, corresponding to the points
$q_{0}{ {\boldsymbol{x}}-{\boldsymbol{q}}}$
contained in
$R_{j}$
, by the absolute value of the
$q_{0}$
component. If the
$q_{0}$
components are equal then order by
$q_{1}$
and so on. Suppose that the vector
$(m_{0}, \dots ,m_{n})$
is the smallest by our ordering. Then for all other vectors
$(r_{0}, \dots , r_{n})$
contained in
$R_{j}$
we have that
Hence, the vectors
$(r_{0}-m_{0}, \dots , r_{n}-m_{n}) \in \mathbb{Z}^{n+1}$
solve the inequality of
$\mathcal{Q}_{n}({\boldsymbol{x}}, \boldsymbol{\tau }, N)$
. Furthermore,
$(r_{i}-m_{i}) \in [-N,N]$
, and by the ordering stated above
$r_{0}-m_{0} \in [0,N]$
. To exclude the case where
$r_{0}-m_{0}=0$
observe that each
$\tau _{i}\gt 1$
and so we would have that
for
$1 \leq i \leq n$
, a contradiction. The above argument yields
$p^{-n}N^{n+1-\sum _{i=1^{n}}\tau _{i}}-1$
such points. Taking
$N$
sufficiently large we obtain our lower bound counting result, completing the proof modulo Theorem 1.1.
Lemma 1.2 also has a relatively simple proof. The following method of assuming a contradiction and then using the pigeonhole principle to prove otherwise is a well know technique used in a variety of texts [Reference Bernik15, Reference Sprindžuk49].
Proof of Lemma 1.2: We use a proof by contradiction. Suppose that
We use the following notations. Let
$X \in \mathbb{N}$
be an integer such that
for some suitably large
$M \in \mathbb{N}$
, in particular we may take
where
$(x_{i})_{i \in \mathbb{N}}$
is the
$p$
-adic expansion of
$x$
. . Define
$V_{N}^{+}$
and
$V_{N}^{-}$
to be the sets
Let
$t \in \mathbb{N}$
be the integer such that
and similarly
$k \in \mathbb{N}$
be the integer such that
Note that as
$\tau (x)\gt \tau$
, we have that
$k \geq t$
, and so
$p^{k-t} \in \mathbb{N}$
. Further, observe that
Lastly, by the definition of
$\tau (x)$
, we have that there exists only finitely many
$Q \in \mathbb{N}$
such that
for
$0 \lt q, |q_{1}| \leq Q$
. Hence, we may choose a sufficiently large
$N_{0}$
such that for all
$N\gt N_{0}$
for any pair
$0 \lt q,|q_{1}| \leq N$
,
for all
$\epsilon \gt 0$
. Consider the set of points in
$\mathcal{Q}_{1}(x, \tau , N)$
. Note that
$(q,q_{1}) \in \mathcal{Q}_{ 1}(x, \tau , N)$
if and only if
$(q,q_{1}) \in V_{N}^{+} \cup V_{N}^{-}$
, and
Thus, for all
$(q,q_{1}) \in \mathcal{Q}_{1}(x,\tau ,N)$
we have that
for some
$\lambda \in \mathbb{Z}$
. Split the set of points in
$\mathcal{Q}_{1}(x,\tau ,N)$
into two disjoint sets, the set of pairs in
$V_{N}^{+}$
, and the set of pairs in
$V_{N}^{-}$
. As there are greater than
$2N^{\tau (x)-\tau +\epsilon }$
pairs, at least one of the sets has greater than
$N^{\tau (x)-\tau +\epsilon }$
pairs. Without loss of generality assume such set of points belong in
$V_{N}^{+}$
. Considering the range of values of
$\lambda p^{t}$
for
$t$
fixed and
$\lambda$
varying we observe there are
$p^{k-t}$
possible values of
$\lambda p^{t}$
modulo
$p^{k}$
. By (14) and (15) we have, by the pigeon-hole principle, that there exists at least two pairs, say
$(a,a_{1})$
and
$(b,b_{1})$
, such that
This implies
with
$(a-b,a_{1}-b_{1}) \in V_{N}^{+} \cup V_{N}^{-}$
, as
$0\lt a-b \leq N$
by our choice of ordering of
$a,b$
, and
$|a_{1}-b_{1}| \leq N$
by the fact that the pairs
$(a,a_{1}),(b,b_{1}) \in V_{N}^{+}$
. However, such result contradicts (16) which follows from the definition of
$\tau (x)$
, thus (14) must be false.
5.1.
$p$
-adic approximation lattices
Prior to the proof of Theorem 1.1, we recall some basic definitions and results from the geometry of numbers that will be needed. Define a lattice
$\Lambda$
as a discrete additive subgroup of
$\mathbb{R}^{n}$
. If
$\Lambda \subseteq \mathbb{Z}^{n}$
the n
$\Lambda$
is an integer lattice. A set of linearly independent vectors
$\mathbf{b}_{1}, \dots , \mathbf{b}_{n}$
that generate
$\Lambda$
as a
$\mathbb{Z}$
-module is called a basis of
$\Lambda$
. Let
$B$
be a
$n\times n$
matrix with columns
$\mathbf{b}_{i}$
, then call
$B$
a basis matrix. Define the fundamental region as
\begin{equation*} \mathcal{F}(B)\,:\!=\, \left \{ \sum _{i=1}^{n} a_{i}{ \mathbf{b}_{i}} \,:\, a_{i} \in \mathbb{R}, \, \, 0 \leq a_{i} \lt 1 \right \}. \end{equation*}
If
$B$
is a basis matrix for
$\Lambda$
then
$\mathcal{F}(B)$
contains no lattice points other than the origin (see Chapter 3, Lemma 6 of [Reference Cassels22]).
The volume of the fundamental region can be found by taking the determinant of the basis matrix, that is
$\mathrm{vol}(\mathcal{F}(B))=|\det B|$
. A basis matrix is not unique for each
$\Lambda$
, however for any lattice
$\Lambda$
the volume of the fundamental region is the same regardless of choice of basis matrix. For this reason we use the notation
$\det \Lambda$
to denote the volume of the fundamental region. If
$U \in \mathbb{Z}^{n\times n}$
is a unimodular matrix and
$B_{1}$
is a basis matrix for
$\Lambda$
then
$B_{2}=B_{1}U$
is also a basis matrix for
$\Lambda$
.
Let
$B_{n}=B(0,1)$
denote the
$n$
-dimensional Euclidean unit ball. For
$c \in \mathbb{R}_{+}$
we use the notation
$cB_{n}=B(0,c)$
. Define the successive minima of a lattice
$\Lambda \subset \mathbb{R}^{n}$
of rank
$n$
as the set of values
for
$i=1, \dots , n$
. By Minkowski’s inequalities on the successive minima (see e.g. [Reference Henk and Xue29]) we have that
For a count on the number of lattice points within a convex body we have the follow theorem.
Theorem 5.1 ([Reference Blichfeldt19]). Let
$\Lambda \subset \mathbb{R}^{n}$
be a lattice of rank
$n$
and let
$V\subset \mathbb{R}^{n}$
be a convex body such about the origin that
${\textrm {rank}}(\Lambda \cap V)=n$
. Then
We also have the following counting result due to Henk where the convex body of interest need not have full rank when intersected with the lattice.
Theorem 5.2 ([Reference Betke, Henk and Wills18, Reference Henk28]). Let
$n\geq 2$
,
$B(0,K)$
a
$n$
-dimensional ball of radius
$K\gt 0$
centred at the origin and
$\Lambda$
a
$n$
-dimensional lattice. Then
We remark that if
$\textrm {rank}(\Lambda \cap B(0,M))\lt n$
then we must have at least that
$\lambda _{n}(\Lambda ) \geq M$
. Thus the
$n^{th}$
value of the product in Theorem 5.2 would be bounded above by
$3$
.
For the proof of Theorem 1.1 we use
$p$
-adic approximation lattices. Such lattices have been used in
$p$
-adic Diophantine approximation regularly, for example De Weger [Reference de Weger24] used them to prove a variety of results in classical
$p$
-adic Diophantine approximation, including the
$p$
-adic analogue of Hurwitz Theorem in classical Diophantine approximation. See also [Reference Inoue, Kamada and Naito33, Reference Inoue and Naito34].
For a
$n$
-tuple of approximation functions
$\Psi =(\psi _{1}, \dots , \psi _{n})$
, an integer
$N \in \mathbb{N}$
, and a fixed
${\boldsymbol{x}}=(x_{1}, \dots , x_{n}) \in \mathbb{Z}_{p}^{n}$
define the
$\Psi$
-approximation lattice
$\Lambda _{N, {\boldsymbol{x}}}$
by
To briefly justify the above claim note that the collection of points are discrete, and that any integer linear combination of such points is also contained within the set due to the strong triangle inequality. Observe that such claim is clearly false if we were to consider the real case analogous to the above setting. Observe that
since the Euclidean ball
$B(0, \sqrt {n}N)$
contains all integer points satisfying
$\max _{0 \leq i \leq n}|q_{i}| \leq N$
.
For any
${\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}$
we may write each
$x_{j}$
as the
$p$
-adic expansion
Let
$X_{j,N} \in \mathbb{Z}$
be the integer
where each
$t_{j} \in \mathbb{N}$
is the unique value associated with
$N$
satisfying
Lastly, for each
$1 \leq j \leq n$
let
$\psi _{j,N}^{*}=p^{t_{j}}$
. Then the set of vectors
\begin{equation} B=\left \{ \left ( \begin{array}{c} 1 \\ X_{1,N} \\ \vdots \\ X_{n,N} \end{array} \right ), \left ( \begin{array}{c} 0 \\ \psi _{1,N}^{*} \\ \vdots \\ 0 \end{array} \right ), \dots , \left ( \begin{array}{c} 0 \\ 0 \\ \vdots \\ \psi _{n,N}^{*} \end{array} \right ) \right \}, \end{equation}
form a basis for
$\Lambda _{N, {\boldsymbol{x}}}$
. To support this claim observe that
\begin{equation*} |x_{i}-X_{i,N}|_{p}=\left | \sum _{j=t_{i}+1}^{\infty }x_{i,j}p^{j} \right |_{p} \lt p^{-t_{i}} \lt \psi _{i}(N), \end{equation*}
and
for
$1 \leq i \leq n$
. Thus, each vector in
$B$
is a point in
$\Lambda _{N,{\boldsymbol{x}}}$
; hence, the span of vectors
$B$
at least produces a sublattice of
$\Lambda _{N, {\boldsymbol{x}}}$
. To show
$B$
is a basis of
$\Lambda _{N, {\boldsymbol{x}}}$
we consider the fundamental region
$\mathcal{F}(B)$
and show that the only lattice point contained is
$\textbf {0}$
. Suppose there exists a non-zero lattice point in
$\mathcal{F}(B)$
of the form
where
$b_{i}$
are the vectors of
$B$
and each
$0 \leq c_{i} \lt 1$
. Since
$\Lambda _{N, {\boldsymbol{x}}} \subseteq \mathbb{Z}^{n+1}$
and the first vector of
$B$
is the only vector with a non-zero entry in the first row we must have
$c_{1}=0$
. For the remaining vectors observe that each non-zero term is a prime power, so each
$c_{i}$
must be of the form
$p^{-r}$
for some
$r \in \mathbb{N}$
. However, by the construction of each
$\psi ^{*}_{i,N}$
we have that
and so the only possible value for each
$c_{i}$
is zero. Thus
$\sum _{i=1}^{n+1}c_{i}b_{i}= \textbf {0}$
.
Given basis
$B$
we can deduce that
\begin{equation*} |\det \Lambda _{N, {\boldsymbol{x}}} |=\prod _{i=1}^{n}\psi _{i,N}^{*} \asymp \left (\prod _{i=1}^{n} \psi _{i}(N) \right )^{-1}, \end{equation*}
where the implied constants can be easily found using (19) to obtain
\begin{equation} \left (\prod _{i=1}^{n} \psi _{i}(N)\right )^{-1}\leq |\det \Lambda _{N, {\boldsymbol{x}}}| \leq p^{n}\left (\prod _{i=1}^{n} \psi _{i}(N)\right )^{-1}. \end{equation}
In the simultaneous case,
$\Psi =(\psi , \dots , \psi )$
, it was proven in [Reference Inoue and Naito34] that
In order to prove Theorem 1.1 we find a lower bound on
$\lambda _{1}(\Lambda _{N, {\boldsymbol{x}}})$
by considering
${\boldsymbol{x}} \in \mathbb{Z}_{p}$
satisfying certain Diophantine exponent properties. For completeness we also prove the upper bound.
Lemma 5.3.
Let
$\Lambda _{N, {\boldsymbol{x}}}$
be defined above with
$\tau ({\boldsymbol{x}})=n+1$
, and suppose that
Then for any
$\frac {1}{n+1}\gt \delta \gt 0$
the exists sufficiently large
$N_{0} \in \mathbb{N}$
such that for all
$N \geq N_{0}$
,
where
\begin{equation*} C_{2}=2\left (\frac { \Gamma \left (\frac {n+1}{2}+1 \right )p^{n}}{\pi ^{\frac {n+1}{2}}}\right )^{\frac {1}{n+1}}. \end{equation*}
Proof. We prove the upper bound case first. Such proof is a standard application of Minkowski’s Theorem on successive minima and follows almost immediately by the above calculation of
$|\det \Lambda _{M, {\boldsymbol{x}}}|$
. Concisely, we have that
Rearranging for
$\lambda _{1}(\Lambda _{N,{\boldsymbol{x}}})$
, using (21), and recalling the volume of an
$(n+1)$
- dimensional Euclidean ball we obtain the upper bound on
$\lambda _{1}(\Lambda _{N,{\boldsymbol{x}}})$
.
We now prove the lower bound. For any
${\boldsymbol{x}} \in \mathbb{Z}_{p}^{n}$
observe that
\begin{align*} \begin{cases} \prod _{i=1}^{n}|q_{0}x_{i}-q_{i}|_{p} \lt p^{n} N^{-(n+1)},\\ \max _{0 \leq i \leq n}|q_{i}| \leq N \end{cases} \end{align*}
has solutions for infinitely many
$N$
by Lemma 3.1. Since
$\tau ({\boldsymbol{x}})=n+1$
for any
$\delta \gt 0$
there exists
$N_{\delta }$
so that for all
$N \geq N_{\delta }$
any rational integer vectors
$(q_{0},\dots , q_{n})$
with
$\max _{0 \leq i \leq n}|q_{i}| = N$
satisfies
Let
$N_{1}$
be sufficiently large such that for all
$N\gt N_{1}$
\begin{equation*} \left (\prod _{i=1}^{n} \psi _{i}(N)\right )^{-\left (\frac {1}{n+1}-\delta \right )} \geq N_{\delta }. \end{equation*}
Such
$N$
is possible since
$\prod _{i=1}^{n} \psi _{i}(N)\lt N^{-n}$
and so the value on the left hand side tends to infinity as
$N \to \infty$
(for any
$\delta \lt \frac {1}{n+1}$
). Henceforth fix
$\frac {1}{n+1} \gt \delta \gt 0$
and assume
$N \geq N_{0}= \max \{N_{\delta },N_{1}\}$
.
Suppose that
$(q_{0}, \dots , q_{n})\in \mathbb{Z}^{n+1}$
is a minimum length non-zero vector of
$\Lambda _{N,{\boldsymbol{x}}}$
. Then
$\lambda _{1}(\Lambda _{N, {\boldsymbol{x}}}) \geq \max _{0 \leq i \leq n}|q_{i}|$
. Suppose that
\begin{equation} \max _{0 \leq i \leq n}|q_{i}| \lt \left (\prod _{i=1}^{n} \psi _{i}(N)\right )^{-\left (\frac {1}{n+1}-\delta \right )}. \end{equation}
We prove (24) to be false. Observe that
since
$(q_{0},\dots , q_{n}) \in \Lambda _{N, {\boldsymbol{x}}}$
, and by rearranging (24) we can conclude that
This contradicts (23) since
for any
$\frac {1}{n+1} \gt \delta \gt 0$
. Hence, we must have that (24) is false, and so
\begin{equation*} \lambda _{1}(\Lambda _{N,{\boldsymbol{x}}}) \geq \left (\prod _{i=1}^{n} \psi _{i}(N)\right )^{-\left (\frac {1}{n+1}-\delta \right )}, \end{equation*}
completing the proof.
Given Lemma 5.3 we can proceed with the following.
Proof of Theorem 1.1: Consider the following two cases:
-
i)
${\textrm {rank}}(\Lambda _{N,{\boldsymbol{x}}} \cap B(0,\sqrt {n}N))=n+1$
: By Theorem 5.1 we have thatNote that the last inequality follows since
\begin{align*} \# (\Lambda _{N,{\boldsymbol{x}}} \cap B(0,\sqrt {n}N)) & \leq (n+1)! \frac {{ \mathrm{vol}}(B(0,\sqrt {n}N))}{\det \Lambda _{N,{\boldsymbol{x}}}}+n+1, \\ & \leq \frac {(n+1)! \pi ^{n/2}\sqrt {n}^{n+1}}{\Gamma \left (\frac {n}{2}+1 \right )}N^{n+1}(\prod _{i=1}^{n}\psi _{i,N}^{*})^{-1}+n+1, \\ & \leq \frac {(n+2)! \pi ^{n/2}\sqrt {n}^{n+1}}{\Gamma \left (\frac {n}{2}+1 \right )} N^{n+1}\prod _{i=1}^{n}\psi _{i}(N). \end{align*}
$\prod _{i=1}^{n}\psi _{i}(N) \gt N^{-(n+1-\varepsilon n)}$
by (1). This proves Theorem 1.1 for the rank
$n+1$
case.
-
ii)
${\textrm {rank}}(\Lambda _{N,{\boldsymbol{x}}} \cap B(0,\sqrt {n}N))\lt n+1$
: Since
${\textrm {rank}}(\Lambda _{N,{\boldsymbol{x}}} \cap B(0,\sqrt {n}N))\lt n+1$
, we must have
$\lambda _{n+1}(\Lambda _{N,{\boldsymbol{x}}})\gt \sqrt {n}N$
. Hence, by Theorem 5.2, we have thatNote that we have used here the remark following Theorem 5.2. Namely, we are only considering the above product over the first
\begin{equation*} \# (\Lambda _{N, {\boldsymbol{x}}} \cap B(0,\sqrt {n}N)) \lt 2^{n}3 \prod _{i=1}^{n}\left ( \frac {2\sqrt {n}N}{\lambda _{i}(\Lambda _{N,{\boldsymbol{x}}})}+1 \right )\, . \end{equation*}
$n$
-successive minima, rather than all
$(n+1)$
-successive minima. Each
$\lambda _{i}(\Lambda _{N,{\boldsymbol{x}}})$
is bounded below by
$\lambda _{1}(\Lambda _{N,{\boldsymbol{x}}})$
for
$1 \leq i \leq n$
. Condition (22) of Lemma 5.3 is satisfied by (1). Choose
$\frac {1}{n+1}\gt \delta \gt 0$
such that
$\delta \lt \varepsilon (n+1)^{-2}$
. By Lemma 5.3 there exists
$N_{0} \in \mathbb{N}$
such that for all
$N\gt N_{0}$
We can deduce
\begin{align*} \lambda _{1}(\Lambda _{N,{\boldsymbol{x}}}) & \geq \left ( \frac {1}{\prod _{i=1}^{n}\psi _{i}(N)} \right )^{\frac {1}{n+1}-\delta }, \\ & \geq \left ( \left (\frac {1}{\prod _{i=1}^{n}\psi _{i}(N)}\right )^{n-\delta n(n+1)} \right )^{\frac {1}{n(n+1)}}, \\ & \geq \left ( \left ( \prod _{i=1}^{n}\psi _{i}(N) \right )^{\delta n(n+1)}\left ( \frac {1}{\prod _{i=1}^{n}\psi _{i}(N)} \right )^{n}\right )^{\frac {1}{n(n+1)}}, \\ & \overset {(\!*\!)}{\geq } \left ( \frac {1}{N^{n+1}\prod _{i=1}^{n}\psi _{i}(N)} \left ( \frac {1}{\prod _{i=1}^{n}\psi _{i}(N)} \right )^{n}\right )^{\frac {1}{n(n+1)}}, \\ & \geq \left ( \frac {1}{N \prod _{i=1}^{n}\psi _{i}(N)} \right )^{1/n}\, . \end{align*}
$(\!*\!)$
by observing that by our choice of
$\delta$
we have(25)for any
\begin{equation} \delta \lt \frac {\varepsilon }{(n+1)^{2}} \lt \frac {\varepsilon }{n+1} \frac {\log N}{(n+1)\log N } \overset {(1)}{\lt } \frac {\varepsilon }{n+1} \frac {\log N}{\log \left (\prod _{i=1}^{n}\psi _{i}(N) \right )^{-1}} \, , \end{equation}
$N \geq N_{0}$
. Thuscombining the two statements above, and Theorem 5.2, we have that
\begin{align*} \left ( \prod _{i=1}^{n}\psi _{i}(N) \right )^{\delta n(n+1)} \overset {(25)}{\gt } N^{-\varepsilon n} \overset {(1)}{\geq } \left ( N^{n+1} \prod _{i=1}^{n}\psi _{i}(N) \right )^{-1} \, . \end{align*}
\begin{align*} \# (\Lambda _{N, {\boldsymbol{x}}} \cap B(0,\sqrt {n}N)) & \lt 2^{n}3 \prod _{i=1}^{n}\left ( \frac {2\sqrt {n}N}{\lambda _{1}(\Lambda _{N,{\boldsymbol{x}}})}+1 \right ), \\ &\lt 2^{n}3 \left (2\sqrt {n}N^{1+1/n}\left (\prod _{i=1}^{n}\psi _{i}(N) \right )^{1/n}+1 \right )^{n}, \\ &\lt 3(6\sqrt {n})^{n}N^{n+1}\prod _{i=1}^{n}\psi _{i}(N). \end{align*}
Thus, in either case
$i)$
or
$ii)$
we have that
with
\begin{equation*} C_{1}=\max \left \{ 3(6\sqrt {n})^{n}, \frac {(n+2)! \pi ^{n/2}\sqrt {n}^{n+1}}{\Gamma \left (\frac {n}{2}+1 \right )}\right \}. \end{equation*}




