Diophantine approximation with improvement of the simultaneous control of the error and of the denominator

Abstract

In this work we proof the following theorem which is, in addition to someother lemmas, our main result: theorem. Let\ X=\ ( x\1, %t\1) , ( x\2, t\2) , ..., (x\n, t\n)\ be a finite part of R× R +, then there exist a finite part R of R% + such that for all > 0 there exists r∈ R such that if 0 < ≤ r then there exist rational numbers ( p\iq) \i=1,2,...,n such that:\c| x\i-p\iq| ≤ t\i q≤ t\i|, i=1,2,...,n. * It is clear that the condition q≤ t\i for %i=1,2,...,n is equivalent to q≤ t=i=1,2,...,nMin% ( t\i) .\ Also, we have (*) for all verifying 0 < ≤ \0= R.The previous theorem is the classical equivalent of the following one whichis formulated in the context of the nonstandard analysis ([ 2] %, [ 5] , [ 6] , [ 8] ). theorem. For every positive infinitesimal real , there exists an unlimited integer q depending only of , such that ∀ stx ∈ R\ ∃ px ∈ Z :\ \cccx & = \& pxq+ φ q \& \& 0. For this reason, to prove the nonstandard version of the main result and to get its classical version we place ourselves in the context of the nonstandard analysis.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…