On approximation of real, complex, and p-adic numbers by algebraic numbers of bounded degree. by K. I. Tsishchanka

Similar documents
Approximation of complex algebraic numbers by algebraic numbers of bounded degree

Report on some recent advances in Diophantine approximation

Results and open problems related to Schmidt s Subspace Theorem. Jan-Hendrik Evertse

Infinite Continued Fractions

On Schmidt s Subspace Theorem. Jan-Hendrik Evertse

A Gel fond type criterion in degree two

ON THE APPROXIMATION TO ALGEBRAIC NUMBERS BY ALGEBRAIC NUMBERS. Yann Bugeaud Université de Strasbourg, France

NOTES ON IRRATIONALITY AND TRANSCENDENCE

Irrationality exponent and rational approximations with prescribed growth

#A5 INTEGERS 18A (2018) EXPLICIT EXAMPLES OF p-adic NUMBERS WITH PRESCRIBED IRRATIONALITY EXPONENT

Combinatorics, Automata and Number Theory

Solutions Final Exam May. 14, 2014

THE REAL NUMBERS Chapter #4

Dirchlet s Function and Limit and Continuity Arguments

Chapter 6. Approximation of algebraic numbers by rationals. 6.1 Liouville s Theorem and Roth s Theorem

arxiv:math/ v3 [math.nt] 23 May 2008

Inner Product Spaces An inner product on a complex linear space X is a function x y from X X C such that. (1) (2) (3) x x > 0 for x 0.

Dirchlet s Function and Limit and Continuity Arguments

NOTES ON DIOPHANTINE APPROXIMATION

ON THE LINEAR INDEPENDENCE OF THE SET OF DIRICHLET EXPONENTS

CONTENTS. Preface Preliminaries 1

On Normal Numbers. Theodore A. Slaman. University of California Berkeley

P -adic root separation for quadratic and cubic polynomials

A Simple Proof that ζ(n 2) is Irrational

Mathematics 242 Principles of Analysis Solutions for Problem Set 5 Due: March 15, 2013

On the divisibility of the discriminant of an integer polynomial by prime powers.

A Number Theorist s Perspective on Dynamical Systems

Chapter 6. Approximation of algebraic numbers by rationals. 6.1 Liouville s Theorem and Roth s Theorem

FUNCTIONAL ANALYSIS-NORMED SPACE

MA 301 Test 4, Spring 2007

Class 8: Numbers Exercise 3B

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 2 Solutions Please write neatly, and in complete sentences when possible.

In N we can do addition, but in order to do subtraction we need to extend N to the integers

Some consequences of the Riemann-Roch theorem

Math 320: Real Analysis MWF 1pm, Campion Hall 302 Homework 8 Solutions Please write neatly, and in complete sentences when possible.

FINAL EXAM Math 25 Temple-F06

QUARTIC POWER SERIES IN F 3 ((T 1 )) WITH BOUNDED PARTIAL QUOTIENTS. Alain Lasjaunias

The Borel-Cantelli Group

Strictly Positive Definite Functions on the Circle

Analytic Number Theory Solutions

RECENT RESULTS ON LINEAR RECURRENCE SEQUENCES

MATH 117 LECTURE NOTES

1. Group Theory Permutations.

ENCYCLOPEDIA OF MATHEMATICS AND ITS APPLICATIONS. Special Functions GEORGE E. ANDREWS RICHARD ASKEY RANJAN ROY CAMBRIDGE UNIVERSITY PRESS

M17 MAT25-21 HOMEWORK 6

A family of quartic Thue inequalities

On a Question of Wintner Concerning the Sequence of Integers Composed of Primes from a Given Set

Conference on Diophantine Analysis and Related Fields 2006 in honor of Professor Iekata Shiokawa Keio University Yokohama March 8, 2006

Algebraic function fields

Test 2. Monday, November 12, 2018

Abstract. 2. We construct several transcendental numbers.

ALGEBRA I FORM I. Textbook: Algebra, Second Edition;Prentice Hall,2002

Solutions to Practice Final

EECS 1028 M: Discrete Mathematics for Engineers

SYMMETRY AND SPECIALIZABILITY IN THE CONTINUED FRACTION EXPANSIONS OF SOME INFINITE PRODUCTS

MATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals

DIOPHANTINE APPROXIMATION AND CONTINUED FRACTIONS IN POWER SERIES FIELDS

Integral Points on Curves Defined by the Equation Y 2 = X 3 + ax 2 + bx + c

LIOUVILLE NUMBERS AND SCHANUEL S CONJECTURE

8 The Gelfond-Schneider Theorem and Some Related Results

Non-classical Study on the Simultaneous Rational Approximation ABSTRACT

In N we can do addition, but in order to do subtraction we need to extend N to the integers

SHABNAM AKHTARI AND JEFFREY D. VAALER

Math 104: Homework 1 solutions

Zero Determination of Algebraic Numbers using Approximate Computation and its Application to Algorithms in Computer Algebra

On repdigits as product of consecutive Lucas numbers

Yes zero is a rational number as it can be represented in the

Lower bounds for resultants II.

New methods for constructing normal numbers

1 + lim. n n+1. f(x) = x + 1, x 1. and we check that f is increasing, instead. Using the quotient rule, we easily find that. 1 (x + 1) 1 x (x + 1) 2 =

Polynomial root separation. by Yann Bugeaud and Maurice Mignotte, Strasbourg

Algebra 1 Mod 1 Review Worksheet I. Graphs Consider the graph below. Please do this worksheet in your notebook, not on this paper.

ADVANCED/HONORS ALGEBRA 2 - SUMMER PACKET

Chapter One Hilbert s 7th Problem: It s statement and origins

Maximal Class Numbers of CM Number Fields

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

LINEAR FORMS IN LOGARITHMS

HILBERT SPACES AND THE RADON-NIKODYM THEOREM. where the bar in the first equation denotes complex conjugation. In either case, for any x V define

arxiv: v3 [math.nt] 4 Oct 2009

P -ADIC ROOT SEPARATION FOR QUADRATIC AND CUBIC POLYNOMIALS. Tomislav Pejković

Continued Fractions New and Old Results

Mathematical Olympiad Training Polynomials

On some problems in Transcendental number theory and Diophantine approximation

MATH 201 Solutions: TEST 3-A (in class)

MATH10040: Numbers and Functions Homework 1: Solutions

Problem set 1, Real Analysis I, Spring, 2015.

Algebra I. Course Outline

Algebraic Expressions

Lecture Historical introduction to irrationality

P-adic Functions - Part 1

Section 1.1 Notes. Real Numbers

A parametric family of quartic Thue equations

Subtraction games. Chapter The Bachet game

SIMULTANEOUS RATIONAL APPROXIMATION VIA RICKERT S INTEGRALS

be a sequence of positive integers with a n+1 a n lim inf n > 2. [α a n] α a n

Part 2 Continuous functions and their properties

The Mysterious World of Normal Numbers

MATH 301 INTRO TO ANALYSIS FALL 2016

Homework 4, 5, 6 Solutions. > 0, and so a n 0 = n + 1 n = ( n+1 n)( n+1+ n) 1 if n is odd 1/n if n is even diverges.

1 What is numerical analysis and scientific computing?

Transcription:

On approximation of real, complex, and p-adic numbers by algebraic numbers of bounded degree by K. I. Tsishchanka

I. On approximation by rational numbers Theorem 1 (Dirichlet, 1842). For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1 q 2.

Example: Let ξ = e. Consider the continued fraction expansion: We have e = 2 + 1 + 2 + 1 1 1 1 + 1 1 +... 2 + 1 1 = 3 2 + 1 1 + 1 2 = 8 3 2 + 1 1 + 1 = 11 4 2 + 1 1 and so on.

The first convergents are: δ 1 = 3 e 3 < 1 δ 2 = 8 3 e 8 3 < 1 3 2 δ 3 = 11 4 e 11 4 < 1 4 2 δ 4 = 19 7 e 19 7 < 1 7 2 δ 5 = 87 32 e 87 32 < 1 32 2 δ 6 = 106 39 e 106 39 < 1 39 2

We also note that δ 1 = 3 e 3 < 1 2 1 2 δ 2 = 8 3 e 8 3 < 1 2 3 2 δ 3 = 11 4 e 11 4 < 1 4 2 δ 4 = 19 7 e 19 7 < 1 2 7 2 δ 5 = 87 32 e 87 32 < 1 2 32 2 δ 6 = 106 39 e 106 39 < 1 39 2

Theorem 2. For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1 2q 2.

Theorem 2. For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1 2q 2. Theorem 1. For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1 q 2.

Finally, some convergents give even better approximation: δ 1 = 3 e 3 < 1 5 1 2 δ 2 = 8 3 e 8 3 < 1 2 3 2 δ 3 = 11 4 e 11 4 < 1 4 2 δ 4 = 19 7 e 19 7 < 1 5 7 2 δ 5 = 87 32 e 87 32 < 1 2 32 2 δ 6 = 106 39 e 106 39 < 1 39 2

Theorem 3 (Hurwitz). For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1. 5q 2

Theorem 3 (Hurwitz). For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1. 5q 2 This result is the best possible.

Theorem 3 (Hurwitz). For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1. 5q 2 This result is the best possible. Example: ξ = 1 + 5 2 = 1 + 1 + 1 + 1 1 1 1 + 1 1 +...

II. Polynomial Interpretation Theorem 1. For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1 q 2.

II. Polynomial Interpretation Theorem 1. For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1 = qξ p < q 1. q 2

II. Polynomial Interpretation Theorem 1. For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1 = qξ p < q 1. q 2 Theorem 4. For any real irrational number ξ there exist infinitely many polynomials P Z[x] of the first degree such that P (ξ) P 1, where P denotes the height of P.

II. Polynomial Interpretation Theorem 1. For any real irrational number ξ there exist infinitely many rational numbers p/q such that ξ p q < 1 = qξ p < q 1. q 2 Theorem 5. For any real number ξ A n there exist infinitely many polynomials P Z[x] of degree n such that P (ξ) P n, where A n is the set of real algebraic numbers of degree n.

ξ p q < q 2

ξ p q < q 2 qξ p < q 1

ξ p q < q 2 qξ p < q 1 P (ξ) P n

ξ p q < q 2 qξ p < q 1 ξ α P (ξ) P n

ξ p q < q 2 qξ p < q 1 ξ α? P (ξ) P n

III. Conjecture of Wirsing Conjecture (Wirsing, 1961). For any real number ξ A n, there exist infinitely many algebraic numbers α A n with ξ α H(α) n 1+ɛ, ɛ > 0, where H(α) is the height of α. Further W. M. Schmidt conjectured that the exponent n 1 + ɛ can be replaced even by n 1.

ξ p q < q 2 qξ p < q 1 ξ α H(α) n 1 P (ξ) P n

ξ p q < q 2 qξ p < q 1 ξ α H(α) n 1 P (ξ) P n At the moment this Conjecture is proved only for n = 1 ξ α H(α) 2 (Dirichlet)

ξ p q < q 2 qξ p < q 1 ξ α H(α) n 1 P (ξ) P n At the moment this Conjecture is proved only for n = 1 ξ α H(α) 2 (Dirichlet) n = 2 ξ α H(α) 3 (Davenport Schmidt)

ξ p q < q 2 qξ p < q 1 ξ α H(α) n 1 P (ξ) P n At the moment this Conjecture is proved only for n = 1 ξ α H(α) 2 (Dirichlet) n = 2 ξ α H(α) 3 (Davenport Schmidt) n > 2???

Consider the polynomial P (x) = a n x n +... + a 1 x + a 0 = a n (x α 1 )... (x α n ). Without loss of generality we can assume that α 1 is the root of P (x) closest to ξ.

It is known that ξ α 1 P (ξ) P (ξ). By Theorem 3 there are infinitely many polynomials P Z[x] of degree n such that Let n = 1. Then P (ξ) P n. P (ξ) = a 1 P ξ α 1 P 1 P = P 2

It is known that ξ α 1 P (ξ) P (ξ). By Theorem 3 there are infinitely many polynomials P Z[x] of degree n such that P (ξ) P n. Let n = 2. Then for some δ 1 we have P (ξ) = 2a 2 ξ + a 1 P δ ξ α 1 P 2 P δ = P 2 δ

Question: Can one prove that the following is impossible: All polynomials with P (ξ) P n have a small derivative P (ξ) P δ.

Question: Can one prove that the following is impossible: All polynomials with P (ξ) P n have a small derivative P (ξ) P δ. Answer: Yes, for n=1 (Dirichlet, 1842) n=2 (Davenport Schmidt, 1967)

IV. Theorem of Wirsing Theorem 6 (Wirsing, 1961). For any real number ξ A n there exist infinitely many algebraic numbers α A n with ξ α H(α) n 2 λ n, lim n λ n = 2.

By Dirichlet s Box principle there are infinitely many polynomials P (x) = a n (x α 1 )... (x α n ) such that P (ξ) P n, therefore ξ α 1... ξ α n P n a 1 n. Even if a n = P, we can only prove that ξ α 1... ξ α n P n 1 H(α 1 ) n 1, ξ α 1 H(α 1 ) n+1 n??? It is also clear, that the worth case for us is when ξ α 1 =... = ξ α n.

Question: Can one prove that for infinitely many polynomials P Z[x] with P (ξ) P n the situation ξ α 1 =... = ξ α n is impossible?

Question: Can one prove that for infinitely many polynomials P Z[x] with P (ξ) P n the situation ξ α 1 =... = ξ α n is impossible? Answer: For infinitely many polynomials P Z[x] with P (ξ) P n we have: ξ α 1 ξ α 2 1, ξ α 3,..., ξ α n are big.

Step 1: Construct infinitly many P, Q Z[x], deg P, Q n, such that P (ξ) P n Q(ξ) Q n P Q and P, Q have no common root

Step 2. Consider the resultant of P, Q : R(P, Q) = a l m bm l (α i β j ). 1 i,j n

Step 2. Consider the resultant of P, Q : R(P, Q) = a l m bm l (α i β j ). 1 i,j n On the one hand, R(P, Q) 0, since P, Q have no common root.

Step 2. Consider the resultant of P, Q : R(P, Q) = a l m bm l (α i β j ). 1 i,j n On the one hand, R(P, Q) 0, since P, Q have no common root. Moreover, R(P, Q) Z, since P, Q have integer coefficients.

Step 2. Consider the resultant of P, Q : R(P, Q) = a l m bm l (α i β j ). 1 i,j n On the one hand, R(P, Q) 0, since P, Q have no common root. Moreover, R(P, Q) Z, since P, Q have integer coefficients. Therefore we get R(P, Q) 1.

Step 3. On the other hand, R(P, Q) = a l m bm l α i β j. 1 i,j n

Step 3. On the other hand, R(P, Q) = a l m bm l α i β j 1 i,j n P 2n α i β j. 1 i,j n

Step 3. On the other hand, R(P, Q) = a l m bm l α i β j 1 i,j n P 2n α i β j P 2n 1 i,j n 1 i,j n max( ξ α i, ξ β j ).

Step 3. On the other hand, R(P, Q) = a l m bm l α i β j 1 i,j n P 2n α i β j P 2n 1 i,j n 1 i,j n max( ξ α i, ξ β j ). If ξ α 1 =... = ξ α n P 1 n, 1 ξ β 1 =... = ξ β n P 1 n 1

Step 3. On the other hand, R(P, Q) = a l m bm l α i β j 1 i,j n P 2n α i β j P 2n 1 i,j n 1 i,j n max( ξ α i, ξ β j ). If ξ α 1 =... = ξ α n P 1 n, 1 ξ β 1 =... = ξ β n P 1 n, 1 then R(P, Q) P 2n P ( 1 n)n 1 2 = P n n2 < 1

Step 3. On the other hand, R(P, Q) = a l m bm l α i β j 1 i,j n P 2n α i β j If then P 2n 1 i,j n 1 i,j n max( ξ α i, ξ β j ). ξ α 1 =... = ξ α n P 1 1 n, ξ β 1 =... = ξ β n P 1 1 n, R(P, Q) P 2n P ( 1 1 n)n 2 = P n n2 < 1, which gives a contradiction, since R(P, Q) 1 by Step 2.

Lemma (Wirsing, 1961): P (ξ) 1 2 Q(ξ) P n 3 2, ξ γ max P (ξ) Q(ξ) 1 2 P n 3 2, where γ is a root of P or Q closest to ξ. Since we get P (ξ) P n, Q(ξ) Q n, ξ γ P n 2 n+n 3 2 = P n 2 3 2.

V. Big Derivative Method Theorem 7 (Bernik-Tsishchanka, 1993). For any real number ξ A n there exist infinitely many algebraic numbers α A n with ξ α H(α) n 2 λ n, lim n λ n = 3.

The following table contains the values of n 2 + λ n corresponding to Wirsing s Theorem (1961), the Theorem of Bernik-Tsishchanka (1993), and the Conjecture: n 1961 1993 Conj. 3 3.28 3.5 4 4 3.82 4.12 5 5 4.35 4.71 6 10 6.92 7.47 11 50 26.98 27.84 51 100 51.99 52.92 101

Fix some H > 0. By Dirichlet s Box Principle there exists an integer polynomial P such that a n H,..., a 2 H, a 1 H 1+ɛ, a 0 H 1+ɛ, (1) where ɛ > 0. P (ξ) H n ɛ,

Case A: Let max( a 1, a 0 ) H, that is max( a 1, a 0 ) = H 1+δ = P, 0 < δ ɛ. It is clear that in this case the derivative of P is big, that is P (ξ) H 1+δ. (2) We have the following well-known inequality ξ α P (ξ) P (ξ), (3) where α is the root of the polynomial P closest to ξ. Substituting (1) and (2) into (3), we get ξ α H n ɛ H 1+δ = H (1+δ) n+1+ɛ+δ 1+δ = P n+1+ɛ+δ 1+δ H(α

Case B: Let max( a 1, a 0 ) H, then P H. (4) Using Dirichlet s Box we construct an integer polynomial Q such that b n H,..., b 2 H, b 1 H 1+ɛ, b 0 H 1+ Q(ξ) H n ɛ, (5) If max( b 1, b 0 ) H, then ξ β H(β) n+1+2ɛ 1+ɛ. If max( b 1, b 0 ) H, then Q H. (6) Then we can apply Wirsing s Lemma: P (ξ) 1 2 Q(ξ) P n 3 2, ξ γ max P (ξ) Q(ξ) 1 2 P n 3 2, Substituting (4), (5), (6), and P (ξ) H n ɛ, we get: ξ γ H n 2 3 2 3 2 ɛ H(γ) n 2 3 2 3 2 ɛ.

Let us compare estimates in the Case A and Case B: Case A: Case B: ξ α H(α) n+1+2ɛ 1+ɛ ξ α H(α) n 2 3 2 3 2 ɛ If we take ɛ = 0, then Case A: ξ α H(α) n 1 Case B: ξ α H(α) n 2 3 2 On the other hand, if we take ɛ = 2, then Case A: ξ α H(α) n+5 3 Case B: ξ α H(α) n 2 4.5 Finally, if we choose an optimal value of ɛ, namely we obtain ɛ = 1 6 n, ξ α H(α) n/2+λ n, lim n λ n = 3, in both cases.

VI. Improvement Let us consider an integer polynomial P such that a n H,..., a 3 H, a 2 H 1+ɛ, a 1 H 1+ɛ, a 0 H 1+ɛ, P (ξ) H n 2ɛ. We have Case A: ξ α H(α) n+1+3ɛ 1+ɛ Case B: ξ α H(α) n 2 3 2 3ɛ. Put then ɛ = 1 10 n, ξ α H(α) n/2+λ n, lim n λ n = 4.5, in both cases. However, the Case A does not work. In fact, max( a 2, a 1, a 0 ) H P (ξ) is big.

VII. Method of Polynomial Staircase In 1996 a new approach to this problem was introduced: Step 1. Let R (k) be a polynomial with k big coefficients. We construct the following n polynomials which are small at ξ. Q (3),..., Q (n+1), P (n+1), Step 2. We prove that they are linearly independent. Step 3. Using a linear combination of these polynomials, we construct the polynomial L (2) = d 1 Q (3) +... + d n 1 Q (n+1) + d n P (n+1) with two big coefficients. The Case A does work for L. Moreover, it is possible to show that an influence of the numbers d 1,..., d n is very weak, so L(ξ) H n 2ɛ.

Theorem 8. For any real number ξ A n there exist infinitely many algebraic numbers α A n with ξ α H(α) n 2 λ n, lim n λ n = 4.

The following table contains the values of n 2 + λ n corresponding to Wirsing s Theorem (1961), the Theorem of Bernik-Tsishchanka (1993), Theorem 8 (2001), and the Conjecture: n 1961 1993 2001 Conj. 3 3.28 3.5 3.73 4 4 3.82 4.12 4.45 5 5 4.35 4.71 5.14 6 10 6.92 7.47 8.06 11 50 26.98 27.84 28.70 51 100 51.99 52.92 53.84 101

VIII. Complex case Theorem 9 (Wirsing, 1961). For any complex number ξ A n there exist infinitely many algebraic numbers α A n with where ξ α H(α) A, A = n 4 + 1. Method: Resultant

In 2000 this result was slightly improved: A = n 4 + λ n, where lim n λ n = 3 2. Method: Big Derivative. Method Polynomial Staircase :???

IX. P -adic case Theorem 10 (Morrison, 1978). Let ξ Qp. If ξ A n, then there are infinitely many algebraic numbers α A n with ξ α H(α) A, where A = 1 + 3 when n = 2, n 2 + 3 2 when n > 2.

Theorem 11 (Teulié, 2002). If ξ A 2, then there are infinitely many algebraic numbers α A 2 with ξ α H(α) 3. The second part of Morrison s theorem was also improved: A = n 2 + λ n, where lim n λ n = 3. Method: Big Derivative. Method Polynomial Staircase :???

X. Two Counter-Examples 1. Simultaneous case. Conjecture. For any two real numbers ξ 1, ξ 2 A n there exist infinitely many algebraic numbers α 1, α 2 such that { ξ1 α 1 P (n+1)/2, ξ 2 α 2 P (n+1)/2, where P (x) Z[x], P (α 1 ) = P (α 2 ) = 0, deg P n. The implicit constant in should depend on ξ 1, ξ 2, and n.

Counter-example (Roy-Waldschmidt, 2001). For any sufficiently large n there exist real numbers ξ 1 and ξ 2 such that max{ ξ 1 α 1, ξ 2 α 2 } > P 3 n. Theorem 12. For any real numbers ξ 1, ξ 2 A n at least one of the following assertions is true: (i) There exist infinitely many algebraic numbers α 1, α 2 of degree n such that ξ 1 α 1 P n 8 3 8, ξ 2 α 2 P n 8 3 8. (ii) For some ξ {ξ 1, ξ 2 } there exist infinitely many algebraic numbers α of degree 2 k n+2 4 such that ξ α H(α) n+2 4 1.

2. Approximation by algebraic integers. Theorem 13. (Davenport - Schmidt, 1968) Let n 3. Let ξ be real, but not algebraic of degree 2. Then there are infinitely many algebraic integers α of degree 3 which satisfy where 0 < ξ α H(α) η 3, η 3 = 1 2 (3 + 5) = 2.618...

Conjecture. Let ξ be real, but is not algebraic of degree n. Suppose ɛ > 0. Then there are infinitely many real algebraic integers α of degree n with ξ α H(α) n+ɛ. Theorem 14 (Roy, 2001). There exist real numbers ξ such that for any algebraic integer α of degree 3, we have ξ α H(α) η 3.

XI. Most Recent Result Theorem 15. For any real number ξ A 3 there exist infinitely many algebraic numbers α A 3 such that ξ α H(α) A, where A = 3.7475.. is the largest root of the equation 2x 3 11x 2 + 11x + 8 = 0.