A quantitative framework for sets of exact approximation order by rational numbers
Abstract
In this paper we study a quantitative notion of exactness within Diophantine approximation. Given and satisfying , we study the set of points, which we call , that are -well approximable but not -well approximable. We prove results on the cardinality and dimension of . In particular we obtain the following general statements: (i) For any and there exists such that and (ii) Under natural monotonicity assumptions on and we prove that if decays to zero sufficiently slowly (in a way that depends upon ) then is uncountable. Moreover, under further natural assumptions on we can calculate the Hausdorff dimension of . Our main result demonstrates a new threshold for the behaviour of . A particular instance of this threshold is illustrated by considering functions of the form when . For these functions we prove the following: (iii) If for some sufficiently large or for some then is uncountable and we calculate its Hausdorff dimension. (iv) If for some for all sufficiently large then
Cite
@article{arxiv.2510.18451,
title = {A quantitative framework for sets of exact approximation order by rational numbers},
author = {Simon Baker and Benjamin Ward},
journal= {arXiv preprint arXiv:2510.18451},
year = {2025}
}