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 :(0,∞) (0,∞) and ω:(0,∞) (0,1) satisfying q∞ω(q)=0, we study the set of points, which we call E(,ω), that are -well approximable but not (1-ω)-well approximable. We prove results on the cardinality and dimension of E(,ω). In particular we obtain the following general statements: (i) For any ω:(0,∞) (0,1) and τ>2 there exists :(0,∞) (0,∞) such that q∞- (q) q=τ and E(,ω)≠. (ii) Under natural monotonicity assumptions on and ω, we prove that if ω decays to zero sufficiently slowly (in a way that depends upon ) then E(,ω) is uncountable. Moreover, under further natural assumptions on we can calculate the Hausdorff dimension of E(,ω). Our main result demonstrates a new threshold for the behaviour of E(,ω). A particular instance of this threshold is illustrated by considering functions of the form τ(q)=q-τ when τ∈ N≥ 3. For these functions we prove the following: (iii) If ω(q)= Cq-τ(τ-1) for some sufficiently large C or ω(q)=q-τ' for some τ'<τ(τ-1), then E(τ,ω) is uncountable and we calculate its Hausdorff dimension. (iv) If ω(q)< cq-τ(τ-1) for some c∈ (0,1) for all q sufficiently large then E(τ,ω)=.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.