Approximation to real numbers by cubic algebraic integers. II

Similar documents
Continued Fractions and the Euclidean Algorithm

Math 115 Spring 2011 Written Homework 5 Solutions

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

FACTORING POLYNOMIALS IN THE RING OF FORMAL POWER SERIES OVER Z

HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Copy in your notebook: Add an example of each term with the symbols used in algebra 2 if there are any.

Algebraic and Transcendental Numbers

CHAPTER 5. Number Theory. 1. Integers and Division. Discussion

Vocabulary Words and Definitions for Algebra

it is easy to see that α = a

SOLVING POLYNOMIAL EQUATIONS

Some Polynomial Theorems. John Kennedy Mathematics Department Santa Monica College 1900 Pico Blvd. Santa Monica, CA

Notes on Determinant

Irreducibility criteria for compositions and multiplicative convolutions of polynomials with integer coefficients

On continued fractions of the square root of prime numbers

I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

God created the integers and the rest is the work of man. (Leopold Kronecker, in an after-dinner speech at a conference, Berlin, 1886)

SECTION 10-2 Mathematical Induction

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

Chapter 4, Arithmetic in F [x] Polynomial arithmetic and the division algorithm.

Math Review. for the Quantitative Reasoning Measure of the GRE revised General Test

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

CHAPTER SIX IRREDUCIBILITY AND FACTORIZATION 1. BASIC DIVISIBILITY THEORY

Math 55: Discrete Mathematics

On the number-theoretic functions ν(n) and Ω(n)

Counting Primes whose Sum of Digits is Prime

Winter Camp 2011 Polynomials Alexander Remorov. Polynomials. Alexander Remorov

11 Ideals Revisiting Z

CONTRIBUTIONS TO ZERO SUM PROBLEMS

Arithmetics on number systems with irrational bases

MATH10040 Chapter 2: Prime and relatively prime numbers

CONTINUED FRACTIONS AND FACTORING. Niels Lauritzen

Introduction to Finite Fields (cont.)

U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, Notes on Algebra

CONTINUED FRACTIONS AND PELL S EQUATION. Contents 1. Continued Fractions 1 2. Solution to Pell s Equation 9 References 12

General Framework for an Iterative Solution of Ax b. Jacobi s Method

a 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

Florida Math Correlation of the ALEKS course Florida Math 0028 to the Florida Mathematics Competencies - Upper

CHAPTER II THE LIMIT OF A SEQUENCE OF NUMBERS DEFINITION OF THE NUMBER e.

Algebra 1 Course Title

PROOFS BY DESCENT KEITH CONRAD

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics

Indiana State Core Curriculum Standards updated 2009 Algebra I

9. POLYNOMIALS. Example 1: The expression a(x) = x 3 4x 2 + 7x 11 is a polynomial in x. The coefficients of a(x) are the numbers 1, 4, 7, 11.

7. Some irreducible polynomials

An example of a computable

SECTION 0.6: POLYNOMIAL, RATIONAL, AND ALGEBRAIC EXPRESSIONS

1.7. Partial Fractions Rational Functions and Partial Fractions. A rational function is a quotient of two polynomials: R(x) = P (x) Q(x).

PYTHAGOREAN TRIPLES KEITH CONRAD

On the largest prime factor of x 2 1

THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS

The Division Algorithm for Polynomials Handout Monday March 5, 2012

Answer Key for California State Standards: Algebra I

FACTORING PEAK POLYNOMIALS

Solving Systems of Linear Equations

FACTORING SPARSE POLYNOMIALS

The Method of Partial Fractions Math 121 Calculus II Spring 2015

Algebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the school year.

Congruence properties of binary partition functions

MATH 304 Linear Algebra Lecture 9: Subspaces of vector spaces (continued). Span. Spanning set.

IRREDUCIBLE OPERATOR SEMIGROUPS SUCH THAT AB AND BA ARE PROPORTIONAL. 1. Introduction

Some facts about polynomials modulo m (Full proof of the Fingerprinting Theorem)

Zeros of a Polynomial Function

LOW-DEGREE PLANAR MONOMIALS IN CHARACTERISTIC TWO

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

This unit will lay the groundwork for later units where the students will extend this knowledge to quadratic and exponential functions.

Algebra I Vocabulary Cards

Lecture Notes on Polynomials

1 = (a 0 + b 0 α) (a m 1 + b m 1 α) 2. for certain elements a 0,..., a m 1, b 0,..., b m 1 of F. Multiplying out, we obtain

A Course on Number Theory. Peter J. Cameron

3 1. Note that all cubes solve it; therefore, there are no more

PRIME FACTORS OF CONSECUTIVE INTEGERS

How To Know If A Domain Is Unique In An Octempo (Euclidean) Or Not (Ecl)

MOP 2007 Black Group Integer Polynomials Yufei Zhao. Integer Polynomials. June 29, 2007 Yufei Zhao

10.2 Series and Convergence

Row Ideals and Fibers of Morphisms

Algebra I. In this technological age, mathematics is more important than ever. When students

The sum of digits of polynomial values in arithmetic progressions

Mathematics Course 111: Algebra I Part IV: Vector Spaces

Math 0980 Chapter Objectives. Chapter 1: Introduction to Algebra: The Integers.

1 if 1 x 0 1 if 0 x 1

MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

s-convexity, model sets and their relation

ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

Introduction to Algebraic Geometry. Bézout s Theorem and Inflection Points

F. ABTAHI and M. ZARRIN. (Communicated by J. Goldstein)

Integer roots of quadratic and cubic polynomials with integer coefficients

The cyclotomic polynomials

Sample Induction Proofs

Math 181 Handout 16. Rich Schwartz. March 9, 2010

CORRELATED TO THE SOUTH CAROLINA COLLEGE AND CAREER-READY FOUNDATIONS IN ALGEBRA

DIOPHANTINE m-tuples FOR LINEAR POLYNOMIALS. II. EQUAL DEGREES

BANACH AND HILBERT SPACE REVIEW

RECURSIVE ENUMERATION OF PYTHAGOREAN TRIPLES

Section Inner Products and Norms

Properties of sequences Since a sequence is a special kind of function it has analogous properties to functions:

1 Lecture: Integration of rational functions by decomposition

Powers of Two in Generalized Fibonacci Sequences

Transcription:

Annals of Mathematics, 158 (2003), 1081 1087 Approximation to real numbers by cubic algebraic integers. II By Damien Roy* Abstract It has been conjectured for some time that, for any integer n 2, any real number ε>0 and any transcendental real number ξ, there would exist infinitely many algebraic integers α of degree at most n with the property that ξ α H(α) n+ε, where H(α) denotes the height of α. Although this is true for n =2,weshow here that, for n =3,the optimal exponent of approximation is not 3 but (3 + 5)/2 2.618. 1. Introduction Define the height H(α) of an algebraic number α as the largest absolute value of the coefficients of its irreducible polynomial over Z. Thanks to work of H. Davenport and W. M. Schmidt, we know that, for any real number ξ which is neither rational nor quadratic over Q, there exists a constant c>0 such that the inequality ξ α ch(α) γ2, where γ =(1+ 5)/2 denotes the golden ratio, has infinitely many solutions in algebraic integers α of degree at most 3 over Q (see Theorem 1 of [3]). The purpose of this paper is to show that the exponent γ 2 in this statement is best possible. Theorem 1.1. There exists a real number ξ which is transcendental over Q and a constant c 1 > 0 such that, for any algebraic integer α of degree at most 3 over Q, we have ξ α c 1 H(α) γ2. Work partly supported by NSERC and CICMA. 2000 Mathematics Subject Classification: Primary 11J04; Secondary 11J13.

1082 DAMIEN ROY In general, for a positive integer n, denote by τ n the supremum of all real numbers τ with the property that any transcendental real number ξ admits infinitely many approximations by algebraic integers α of degree at most n over Q with ξ α H(α) τ. Then, the above result shows that τ 3 = γ 2 2.618 against the natural conjecture that τ n = n for all n 2 (see [7, p. 259]). Since τ 2 =2(see the introduction of [3]), it leaves open the problem of evaluating τ n for n 4. At present the best known estimates valid for general n 2 are (n +1)/2 τ n n where the upper bound comes from standard metrical considerations, while the lower bound, due to M. Laurent [4], refines, for even integers n, the preceding lower bound τ n (n +1)/2 of Davenport and Schmidt [3]. Note that similar estimates are known for the analog problem of approximation by algebraic numbers, but in this case the optimal exponent is known only for n 2 (see [2]). In the next section we recall the results that we will need from [6]. Then, in Section 3, we present the class of real numbers for which we will prove, in Section 4, that they satisfy the measure of approximation of Theorem 1.1. Section 3 also provides explicit examples of such numbers based on the Fibonacci continued fractions of [5] and [6] (a special case of the Sturmian continued fractions of [1]). 2. Extremal real numbers The arguments of Davenport and Schmidt in Section 2 of [3] show that, if a real number ξ is not algebraic over Q of degree at most 2 and has the property stated in Theorem 1.1, then there exists another constant c 2 > 0 such that the inequalities (2.1) 1 x 0 X, x 0 ξ x 1 c 2 X 1/γ, x 0 ξ 2 x 2 c 2 X 1/γ, have a solution in integers x 0,x 1,x 2 for any real number X 1. In [6], we defined a real number ξ to be extremal if it is not algebraic over Q of degree at most 2 and satisfies the latter property of simultaneous approximation. We showed that such numbers exist and form a countable set. Thus, candidates for Theorem 1.1 have to be extremal real numbers. For each x =(x 0,x 1,x 2 ) Z 3 and each ξ R, wedefine x = max{ x 0, x 1, x 2 } and L ξ (x) =max{ x 0 ξ x 1, x 0 ξ 2 x 2 }. Identifying x with the symmetric matrix ( x0 x 1 x 1 x 2 ),

APPROXIMATION TO REAL NUMBERS 1083 we also define det(x) =x 0 x 2 x 2 1. Then, Theorem 5.1 of [6] provides the following characterization of extremal real numbers. Proposition 2.1. Areal number ξ is extremal if and only if there exists aconstant c 3 1 and an unbounded sequence of nonzero points (x k ) k 1 of Z 3 satisfying, for all k 1, (i) c 1 3 x k γ x k+1 c 3 x k γ, (ii) c 1 3 x k 1 L ξ (x k ) c 3 x k 1, (iii) 1 det(x k ) c 3, (iv) 1 det(x k, x k+1, x k+2 ) c 3. In order to prove our main Theorem 1.1, we will also need the following special case of Proposition 9.1 of [6] where, for a real number t, the symbol {t} denotes the distance from t to a closest integer: Proposition 2.2. Let ξ be an extremal real number and let (x k ) k 1 be as in Proposition 2.1. Assume that, upon writing x k =(x k,0,x k,1,x k,2 ), there exists a constant c 4 > 0 such that {x k,0 ξ 3 } c 4 for all k 1. Then, for any algebraic integer α of degree at most 3 over Q, we have ξ α c 5 H(α) γ2 for some constant c 5 > 0. Since extremal real numbers are transcendental over Q (see [6, 5]), this reduces the proof of Theorem 1.1 to finding extremal real numbers satisfying the hypotheses of the above proposition. Note that, for an extremal real number ξ and a corresponding sequence (x k ) k 1, Proposition 9.2 of [6] shows that there exists a constant c 6 > 0 such that {x k,0 ξ 3 } c 6 x k 1/γ3 for any sufficiently large k. We also mention the following direct consequence of Corollary 5.2 of [6]: Proposition 2.3. Let ξ be an extremal real number and let (x k ) k 1 be as in Proposition 2.1. Then there exists an integer k 0 1 and a 2 2 matrix M with integral coefficients such that, viewing each x k as a symmetric matrix, the point x k+2 is a rational multiple of x k+1 Mx k when k k 0 is odd, and a rational multiple of x t k+1 Mx k when k k 0 is even.

1084 DAMIEN ROY Proof. Corollary 5.2 together with formula (2.2) of [6] show that there exists an integer k 0 1 such that x k+2 is a rational multiple of x k+1 x 1 k 1 x k+1 for all k>k 0. If S is a 2 2 matrix such that x k+1 is a rational multiple of x k Sx k 1 for some k>k 0, this implies that x k+2 is a rational multiple of x k Sx k+1 and thus, by taking transpose, that x k+2 is a rational multiple of x t k+1 Sx k. The conclusion then follows by induction on k, upon choosing M so that the required property holds for k = k 0. Note that, in the case where all points x k have determinant 1, one may assume that M GL 2 (Z) inthe above proposition and the conclusion then becomes x k+2 = ±x k+1 Sx k where S is either M or t M depending on the parity of k k 0. This motivates the following definition: Definition 2.4. Let M GL 2 (Z) beanonsymmetric matrix. We denote by E(M) the set of extremal real numbers ξ with the following property. There exists a sequence of points (x k ) k 1 in Z 3 satisfying the conditions of Proposition 2.1 which, viewed as symmetric matrices, belong to GL 2 (Z) and satisfy the recurrence relation { M if k is odd, x k+2 = x k+1 Sx k, (k 1), where S = t M if k is even. Examples of extremal real numbers are the Fibonacci continued fractions ξ a,b (see [5] and [6, 6]) where a and b denote distinct positive integers. They are defined as the real numbers ξ a,b =[0,a,b,a,a,b,...]=1/(a +1/(b + )) whose sequence of partial quotients begins with 0 followed by the elements of the Fibonacci word on {a, b}, the infinite word abaab starting with a which is a fixed point of the substitution a ab and b a. Corollary 6.3 of [6] then shows that such a number ξ a,b belongs to E(M) with (2.2) M = ( a 1 1 0 )( b 1 1 0 ) = We conclude this section with the following result. Lemma 2.5. matrix ( ab +1 a b 1 ). Assume that ξ belongs to E(M) for some nonsymmetric ( ) a b M = GL c d 2 (Z), and let (x k ) k 1 be as in Definition 2.4. Then, upon writing x k =(x k,0,x k,1,x k,2 ), we have, for all k 2, (i) x k+2 =(ax k,0 +(b + c)x k,1 + dx k,2 )x k+1 ± x k 1, (ii) x k,0 x k+1,2 x k,2 x k+1,0 = ±(ax k 1,0 dx k 1,2 ) ± (b c)x k 1,1.

APPROXIMATION TO REAL NUMBERS 1085 Proof. For k 1, we have x k+1 = x k Sx k 1 and x k+2 = x k+1 t Sx k where S is M or t M according to whether k is even or odd, and so x k+2 = t x k+2 = x k Sx k+1 =(x k S) 2 x k 1. Since Cayley-Hamilton s theorem gives we deduce (x k S) 2 = trace(x k S)x k S det(x k S)I, x k+2 = trace(x k S)x k+1 det(x k S)x k 1 which proves (i). Finally, (ii) follows from the fact that the left-hand side of this inequality is the sum of the coefficients outside of the diagonal of the product ( ) 0 1 x k Jx k+1 where J =, and that, since Jx k J = ±x 1 k,wehave x k Jx k+1 = ±Jx 1 k x k+1 = ±JSx k 1. 3. A smaller class of real numbers Although we expect that all extremal real numbers ξ satisfy a measure of approximation by algebraic integers of degree at most 3 which is close to that of Theorem 1.1, say with exponent γ 2 + ε for any ε>0, we could only prove in [6] that they satisfy a measure with exponent γ 2 +1 (see [6, Th. 1.5]). Here we observe that the formulas of Lemma 2.5 show a particularly simple arithmetic for the elements ξ of E(M) when, in the notation of this lemma, the matrix M has b =1,c = 1 and d =0.Taking advantage of this, we will prove: Theorem 3.1. Let a be apositive integer. Then, any element ξ of ( ) a 1 E a = E satisfies the measure of approximation of Theorem 1.1. The proof of this result will be given in the next section. Below, we simply show that, for a =1,the corresponding set of extremal real numbers is not empty. Proposition 3.2. Let m be a positive integer. Then, the real number η =(m +1+ξ m,m+2 ) 1 =[0,m+1,m,m+2,m,m,m+2,...] belongs to the set E 1.

1086 DAMIEN ROY Proof. We first note that, if a real number ξ belongs to E(M) for some nonsymmetric matrix M GL 2 (Z) with corresponding sequence of symmetric matrices (x k ) k 1, and if C is any element of GL 2 (Z), then the real number η for which (η, 1) is proportional to (ξ, 1)C belongs to E( t CMC) with corresponding sequence (C 1 x t k C 1 ) k 1. The conclusion then follows since ξ m,m+2 belongs to E(M) where M is given by (2.2) with a = m and b = m +2 and since ( ) t 1 1 CMC = for C = ( ) 0 1. 1 m +1 Remark. In fact, it can be shown that E a is not empty for any integer a 1. For example, consider the sequence of matrices (x k ) k 1 defined recursively using the formula of Definition 2.4 with ( ) ( 1 1 a x 1 =, x 1 0 2 = 3 +2a a 3 a 2 ) +2a 1 a 3 a 2 +2a 1 a 3 2a 2 +3a 2 and ( ) a 1 M =. Then, using similar arguments as in [6, 6], it can be shown that (x k ) k 1 is a sequence of symmetric matrices in GL 2 (Z) which satisfies the four conditions of Proposition 2.1 for some real number ξ which therefore belongs to E a. 4. Proof of Theorem 3.1 We fix a positive integer a, areal number ξ E a, and a corresponding sequence of points (x k ) k 1 of Z 3 as in Definition 2.4. For simplicity, we also define X k = x k and δ k = {x k,2 ξ}, (k 1). The constant c 3 being as in Proposition 2.1, we first note that (4.1) {x k,0 ξ} x k,0 ξ x k,1 c 3 Xk 1, {x k,1ξ} x k,1ξ x k,0ξ 2 + x k,0ξ 2 x k,2 ( ξ +1)c 3 Xk 1. For k 2, the recurrence formula of Lemma 2.5 (i) implies (4.2) x k+2,2 = ax k,0 x k+1,2 ± x k 1,2 and Lemma 2.5 (ii) gives x k,0 x k+1,2 = x k,2 x k+1,0 ± ax k 1,0 ± 2x k 1,1. Using (4.1), the latter relation leads to the estimate {x k,0 x k+1,2 ξ} X k {x k+1,0 ξ} + a{x k 1,0 ξ} +2{x k 1,1 ξ} c 7 X 1 k 1

APPROXIMATION TO REAL NUMBERS 1087 for some constant c 7 > 0 (since X k Xk+1 1 c2+γ 3 Xk 1 1 by virtue of Proposition 2.1 (i)). Combining this with (4.2), we deduce δ k+2 δ k 1 a{x k,0 x k+1,2 ξ} ac 7 Xk 1 1. Since the sequence (X k ) k 1 grows at least geometrically, this in turn implies that, for any pair of integers j and k which are congruent modulo 3 with j k 1, we have δ j δ k c 8 Xk 1 with some other constant c 8 > 0. Since {x k,0 ξ 3 } δ k x k,0 ξ 3 x k,2 ξ c 3 ξ Xk 1, (k 1), we conclude that, for i =1, 2, 3, the limit θ i = lim {x i+3j,0 ξ 3 } = lim δ i+3j j j exists and that θ i {x k,0 ξ 3 } (c 8 + c 3 ξ )Xk 1 for k i mod 3. Since, for all sufficiently large k, Proposition 9.2 of [6] gives {x k,0 ξ 3 } c 9 X 1/γ3 k with a constant c 9 > 0, these numbers θ i are nonzero. Thus the sequence ( ) {x k,0 ξ 3 } has (at most three) nonzero accumulation points and therefore k 1 is bounded below by some positive constant, say for k k 0,toexclude the finitely many indices k where x k,0 =0. Applying Proposition 2.2 to the subsequence (x k ) k k0,weconclude that ξ has the approximation property stated in Theorem 1.1. University of Ottawa, Ottawa, Ontario, Canada E-mail address: droy@uottawa.ca References [1] J.-P. Allouche, J. L. Davison, M. Queffélec, and L. Q. Zamboni, Transcendence of Sturmian or morphic continued fractions, J. Number Theory 91 (2001), 39 66. [2] H. Davenport and W. M. Schmidt, Approximation to real numbers by quadratic irrationals, Acta Arith. 13 (1967), 169 176. [3], Approximation to real numbers by algebraic integers, Acta Arith. 15 (1969), 393 416. [4] M. Laurent, Simultaneous rational approximation to the successive powers of a real number, Indag. Math. 11 (2003), 45 53. [5] D. Roy, Approximation simultanée d un nombre et de son carré, C. R. Acad. Sci., Paris, ser. I 336 (2003), 1 6. [6], Approximation to real numbers by cubic algebraic integers I, Proc. London Math. Soc. 88 (2004), 42 62; arxiv:math.nt/0210181. [7] W. M. Schmidt, Diophantine Approximation, Lecture Notes in Math. 785, Springer- Verlag, New York, 1980. (Received October 11, 2002)