• Aucun résultat trouvé

be an exponential polynomial over a field of zero characteristic. Assume that for each pair

N/A
N/A
Protected

Academic year: 2022

Partager "be an exponential polynomial over a field of zero characteristic. Assume that for each pair"

Copied!
17
0
0

Texte intégral

(1)

Hans Peter Schlickewei · Wolfgang M. Schmidt · Michel Waldschmidt

Zeros of linear recurrence sequences

Received: 7 August 1998

Abstract. Letf (x) = P0(x)αx0+ · · · +Pk(x)αxk

be an exponential polynomial over a field of zero characteristic. Assume that for each pair

i, j

with

i6=j

,

αij

is not a root of unity. Define

1=Pk

j=0(degPj+1). We introduce a partition of

α0, . . . , αk

into subsets

αi0, . . . , αiki

(1

im), which induces a decomposition off

into

f =f1+· · ·+fm

, so that, for 1

im

,

αi0: · · · :αiki

∈Pki(Q)

, while for 1

i6=um

, the number

αi0u0

either is transcendental or else is algebraic with not too small a height. Then we show that for all but at most exp

1(

5

1)51

solutions

x∈Z

of

f (x)=

0, we have

f1(x)= · · · =fm(x)=

0

.

1. Introduction

Let K be a field of zero characteristic, α

1

, . . . , α

k

be non-zero elements of K and P

1

, . . . , P

k

non-zero polynomials with coefficients in K . Consider an exponential polynomial

f (x) = X

k j=0

P

j

(x)α

jx

.

We study the equation

f (x) = 0 ( 1 . 1 )

in x ∈ Z . We suppose that for each pair i, j with i 6= j ,

α

i

j

is not a root of unity. (1.2)

H. P. Schlickewei: Fachbereich Mathematik, Universität Marburg, Hans-Meerwein-Strasse, Lahnberge, D-35032 Marburg, Germany.

e-mail: hps@mathematik.Uni-Marburg.de

W. M. Schmidt: Department of Mathematics, University of Colorado, Campus Box 395, Boulder, CO 80309-0395, USA. e-mail: schmidt@euclid.colorado.edu

M. Waldschmidt: Université P. et M. Curie (Paris VI), Institut Mathématique de Jussieu, Problèmes Diophantiens, Case 247, 4, Place Jussieu, F-75252 Paris Cedex 05, France. e- mail: miw@math.jussieu.fr

Mathematics Subject Classification (1991): 11B37, 11D61, 11J13

(2)

We set

1(f ) = X

k j=0

( deg P

j

+ 1 ).

It is well known that f ( 0 ), f ( 1 ), . . .

is a linear recurrence sequence of order 1(f ), which is “non-degenerate”. Vice versa, any non-degenerate linear recurrence sequence u

0

, u

1

, . . .

of elements of K of order q has some representation u

n

= f (n) , where f is an exponential polynomial as above satisfying (1.2) and with 1(f ) = q . For more details, cf. e.g. [8].

So in studying (1.1) we study the zeros of linear recurrence sequences. An old conjecture says that the number of solutions x ∈ Z of equation (1.1) is bounded above by a function that depends only upon 1(f ) . Let us briefly review what is known so far in this context

1

.

For q = 1, equation (1.1) reduces to a

0

α

0x

= 0 and clearly there is no solution x at all.

For q = 2, we have one of the following two equations (a

0

+ a

1

x)α

x0

= 0 or a

0

α

0x

+ a

1

α

x1

= 0.

In either case, in view of our assumption (1.2) on non-degeneracy, we clearly do not have more than one solution x .

The first non-trivial case is q = 3. Here, Schlickewei [4] proved the con- jecture to be true. His bound has been improved by Beukers and Schlickewei [1]. They showed that for q = 3 equation (1.1) does not have more than 61 solutions.

Now suppose q ≥ 4. In a recent paper [3], Evertse, Schlickewei and Schmidt proved the following: Suppose that in (1.1) the polynomials f

i

for i = 0 , . . . , k are constant. Then equation (1.1) does not have more than exp ( 7 k)

3k

solutions. As in this situation q = k + 1, we see that when the polynomials f

i

in (1.1) are all constant, the conjecture is true.

There remains the case when q ≥ 4 and when not all f

i

’s are constant.

Now obviously in (1.1) we may suppose without loss of generality that α

0

= 1. With this normalization, Schlickewei [5] proved the following:

Suppose that α

1

, . . . , α

k

are algebraic and that [Q(α

1

, . . . , α

k

) : Q] ≤ d . Then the number of solutions of equation (1.1) is bounded in terms of q and d only. (A bound was given explicitly). Schlickewei and Schmidt [6] later on established the bound ( 2 q)

35q3

d

6q2

.

1

After the present paper was written, the second author [7] settled this conjecture.

(3)

We denote by Q the algebraic closure of Q in K (this is the field of algebraic elements in K ). We define an equivalence relation on the set K

×

of non-zero elements of K by the condition

z

1

z

2

⇐⇒ z

1

/z

2

is algebraic . This relation induces a partition of

α

0

, . . . , α

k

: α

0

, . . . , α

k

=

[

m i=1

α

i0

, . . . , α

iki

,

where, for 1 ≤ im ,

α

i0

: · · · : α

iki

∈ P

ki

(Q),

while for 1 ≤ i 6= um , the number α

i0

u0

is transcendental. Accord- ingly, f is decomposed into

f = f

1

+ · · · + f

m

, (1.3) with

f

i

(x) = P

i0

(x)α

ix0

+ · · · + P

iki

(x)α

ikxi

(1im).

We prove

Theorem 1.1. Suppose we have (1.2). Define 1 = 1(f ) and F (1) = exp 1( 5 1)

51

.

Then for all but at most F (1) solutions x ∈ Z of (1.1), we have

f

1

(x) = · · · = f

m

(x) = 0 . ( 1 . 4 ) Our result, in other words, says that the only case when the conjec- ture possibly could fail to be true arises from the algebraic case, i.e. when α

0

, . . . , α

k

are in Q . Moreover we shall see that the conjecture would follow from the special case where α

0

, . . . , α

k

are algebraic and each α

i

j

has a small height. Actually our method of proof gives a result of the type stated in the Theorem also under the assumption that the quotients α

i

u

are not transcendental but have logarithmic height bounded away from zero (for more details, see the final remark in Sect. 6).

We mention that our proof was inspired by a similar result for q = 3 by Beukers and Tijdeman [2]. They showed:

Let α and β be non-zero elements of K . Suppose that α , β and α/β are not roots of unity. Let a and b be non-zero elements of K . Suppose that the equation

x

+

x

= 1

has at least 4 solutions x ∈ Z . Then α and β are algebraic.

Our proof uses a recent result of Schlickewei and Schmidt [6] on polynomial

exponential equations.

(4)

2. Heights

Let K be a number field of degree d . Write M(K) for the set of places of K . For vM(K) , let | |

v

be the valuation which extends either the standard absolute value of Q , or if v|p for a rational prime p , let | |

v

be the valuation with |p|

v

= p

1

. Write d

v

for the local degree [K

v

: Q

p

] and define the absolute value k k

v

by

k k

v

= | |

dvv/d

.

Let n ≥ 1 and let α =

0

, . . . , α

n

) 6= (0, . . . , 0) be a point in K

n+1

. We then put

kαk

v

= max

0

k

v

, . . . ,

n

k

v

and we define the homogeneous height as H (α) = Y

v∈M(K)

kαk

v

.

Since it depends only on the class α =

0

: · · · : α

n

) of α in P

n

(Q), we also denote it by H (α) . Let

h(α) = h(α

0

: · · · : α

n

) = log H(α)

be the homogeneous logarithmic absolute height of α ∈ P

n

(Q) We shall also need the inhomogeneous absolute heights

H

in

(x) = H(1 : x

1

: · · · : x

n

) and

h

in

(x) = h(1 : x

1

: · · · : x

n

) = log H

in

(x) of x = (x

1

, . . . , x

n

) ∈ Q

n

. Further, for x ∈ Q, we set

H

in

(x) = H ( 1 : x) and h

in

(x) = h ( 1 : x) = log H

in

(x).

Given D ∈ N and h / > 0, we will use the fact that the set of elements α ∈ Q

×

with

deg αD and h

in

(α) ≤ h /

is finite.

(5)

3. Algebraic linear recurrence sequences

The results in this section are consequences of the Subspace Theorem.

Lemma 3.1. Let m1 and 0 be a finitely generated subgroup of (Q

×

)

m

of rank r0. Then the solutions z = xy = (x

1

y

1

, . . . , x

m

y

m

) of z

1

+ · · · + z

m

= 1 (3.1) with z0 , y ∈ Q

m

and

h

in

(y) ≤ 1

4m

2

h

in

(x) (3.2)

are contained in the union of at most

exp ( 4 m)

4m

(r + 1 ) proper subspaces of Q

m

.

Proof. This is a variation on Proposition A of [6]. In that proposition there was a distinction between three kinds of solutions:

i) Solutions where some y

i

= 0, i.e., some z

i

= 0. These clearly lie in m subspaces.

ii) Solutions where each y

i

6= 0 and where h

in

(x) > 2m log m. These were called large solutions in [6] and it was shown in (10.4) of that paper that they lie in the union of fewer than

2

30m2

(21m

2

)

r

proper subspaces.

iii) Solutions where each y

i

6= 0 and where h

in

(x) ≤ 2m log m. These were called small solutions in [6]. Here we argue as follows. We have h

in

(y)(2m log m)/(4m

2

) < log 2 by (3.2). Then each component has h

in

(y

i

) < log 2, which is H

in

(y

i

) < 2. Since y

i

∈ Q

×

, we have y

i

= ± 1. The equation (3.1) now becomes

±x

1

± x

2

± · · · ± x

m

= 1. (3.3) The group 0

0

generated by 0 and the vectors 1 , · · · , ± 1 ) contains no more than r multiplicatively independent elements. By Proposition 2.1 of [6], the solutions of (3.3) lie in the union of not more than

exp ( 4 m)

3m

· 2 (r + 1 )

proper subspaces of Q

m

.

(6)

Combining our estimates we obtain m + 2

30m2

( 21 m

2

)

r

+ exp ( 4 m)

3m

· 2 (r + 1 )

< exp ( 4 m)

4m

(r + 1 ) . ut Corollary. Let q > 1 and let 0 be a finitely generated subgroup of (Q

×

)

q

of rank r0. Then the solutions of

z

1

+ · · · + z

q

= 0 (3.4) where z = xy with x0, y ∈ Q

q

and

h (y) ≤ 1 4q

2

h (x) are contained in the union of fewer than

exp ( 4 q)

4q

(r + 1 )

( 3 . 5 ) proper subspaces of the space given by (3.4).

Proof. This is just the homogeneous version of Lemma 3.1. We apply Lemma 3.1 with m = q − 1. One needs also to consider the possible solu- tions with z

q

= 0. But they lie in one subspace, and 1 is absorbed in (3.5) since q > m. ut

Lemma 3.2. Let α ∈ Q

×

be given with h

in

(α) > 0. Let a ∈ Q

×

. Then there is a u ∈ Z such that

h

in

(aα

x−u

) ≥ 1

4 h

in

(α)|x|

for x ∈ Z.

Proof. This is the case r = n = 1 of Lemma 15.1 in [6]. ut Agreement. We define the degree of the zero polynomial as −1.

Lemma 3.3. Consider an equation

P

0

(x)α

0x

+ · · · + P

k

(x)α

kx

= 0 ( 3 . 6 ) where

0

, . . . , α

k

)(Q

×

)

k+1

and, for 0jk, P

j

is a non-zero polynomial of degree d

j

0 with algebraic coefficients. Write

1 = X

k

j=0

(d

j

+ 1 ), D = max

0≤j≤k

d

j

. Suppose that 13,

0≤i,j

max

≤k

h

i

: α

j

)h /

(7)

where 0 < h /1 and set

E = 16 1

2

D/ h /, t = exp ( 5 1)

41

+ 5 E log E.

Then there are tuples

P

0(`)

, . . . , P

k(`)

6= ( 0 , . . . , 0 ) ( 1 ≤ `t)

of polynomials where deg P

j(`)

d

j

(0j < k , 1`t ) and deg P

k(`)

<

d

k

for ` = 1 , . . . , t , such that every solution x ∈ Z of (3.6) satisfies P

0(`)

(x)α

0x

+ · · · + P

k(`)

(x)α

kx

= 0 ( 3 . 7 ) for some ` .

Proof. Suppose u ∈ Z and set y = x + u. Then (3.6) may be rewritten as P

0

(yu)α

0−u

α

0y

+ · · · + P

k

(yu)α

−uk

α

yk

= 0 ,

which is the same as

P e

0

(y)α

0y

+ · · · + P e

k

(y)α

yk

= 0 , ( 3 . 8 ) with P e

j

(Y ) = P

j

(Yu)α

−uj

( 0 ≤ jk).

Suppose our assertion is true for (3.8), with polynomials P e

0(`)

, . . . , P e

k(`)

(1 ≤ `t). Thus every solution of (3.8) satisfies

P e

0(`)

(y)α

0y

+ · · · + P e

k(`)

(y)α

ky

= 0 for some `. But then x = yu satisfies (3.7) with

P

j(`)

(X) = P e

j(`)

(X + u)α

ju

( 0 ≤ jk).

We therefore may make a change of variables x 7→ y = x + u.

We may suppose that h

0

: α

ι

) ≥ h / for some ι in the range 1 ≤ ιk . Write P

j

(X) = a

j0

+a

j1

X +· · ·+ a

j,dj

X

dj

. Pick u according to Lemma 3.2 with h (a

0,d0

α

y−u0

: a

ι,dι

α

ιy−u

)

14

h /|y| . Writing P e

j

(Y ) = P

j

(Yu)α

j−u

= b

j0

+ b

j1

Y + · · · + b

j,dj

Y

dj

, we have b

0,d0

= a

0,d0

α

0−u

, b

ι,dι

= a

ι,dι

α

ι−u

, so that

h(b

0,d0

α

0y

: b

ι,dι

α

yι

) ≥ 1

4 h /|y|. (3.9)

The equation (3.8) may be written as b

00

+ b

01

y +· · ·+b

0,d0

y

d0

α

y0

+· · ·+ b

k0

+ b

k1

y +· · ·+ b

k,dk

y

dk

α

ky

= 0 .

(8)

Some coefficients may be zero; omitting the zero coefficients, we rewrite this as

b

000

y

v00

+ · · · + b

0,d0

y

d0

α

y0

+ · · · + b

k00

y

vk0

+ · · · + b

k,dk

y

dk

α

ky

= 0.

Let q be the total number of (non-zero) coefficients here, and consider the following vectors in q -space:

x = b

000

α

0y

, . . . , b

0,d0

α

0y

, . . . , b

0k0

α

yk

, . . . , b

k,dk

α

yk

w = y

v00

, . . . , y

d0

, . . . , y

vk0

, . . . , y

dk

. Our equation becomes

z

1

+ · · · + z

q

= 0 ( 3 . 10 ) with z = xw = (x

1

w

1

, . . . , x

q

w

q

). Hence x lies in the group 0 of rank r ≤ 2 generated by

0

, . . . , α

0

, . . . , α

k

, . . . , α

k

) and (b

000

, . . . , b

0,d0

, . . . , b

0k0

, . . . , b

k,dk

) . Further

h (x) ≥ h (b

0,d0

α

0y

: b

ι,dι

α

ιy

) ≥ 1 4 h /|y|

by (3.9). On the other hand, h (w)D log |y| . Therefore when

|y | ≥ 2E log E, (3.11)

so that |y| ≥ ( 32 q

2

D/ h /) log ( 16 q

2

D/ h /) by q1 , then

|y| > ( 16 q

2

D/ h /) log |y|, and

h(w) ≤ D log |y| < h /

16 q

2

|y | = 1 4 q

2

1

4 h /|y| ≤ 1 4 q

2

h(x).

By the corollary, for such y , we have z contained in the union of exp (4q)

4q

· 3

< exp (51)

41

proper subspaces of the space (3.10). Consider such a subspace c

1

z

1

+

· · · + c

q

z

q

= 0 (where (c

1

, . . . , c

q

) is not proportional to (1, . . . , 1)).

Taking a linear combination of this and (3.10) we obtain a non-trivial relation c

10

z

1

+· · ·+c

q−0 1

z

q−1

= 0. But this means exactly that y satisfies a non-trivial equation

Q e

0

(y)α

0y

+ · · · + Q e

k

(y)α

ky

= 0, (3.12) where deg Q e

j

d

j

(0 ≤ j < k ) and deg Q e

k

< d

k

.

There are not more than 5 E log E values of y where (3.11) is violated. For fixed y, and since 1 = P

(d

j

+ 1) ≥ 3, there will certainly be polynomials Q e

0

, . . . , Q e

k

as above (deg Q e

j

d

j

(0 ≤ j < k ) and deg Q e

k

< d

k

) with (3.12). ut

Remark. When h / ≥ exp −(51)

41

we have t ≤ exp (51)

51

.

(9)

4. A specialization-type argument

Lemma 4.1. Let K be a number field, D , N , M , L

1

, . . . , L

M

non-negative integers, A

1

, . . . , A

N

homogeneous polynomials in K [X

0

, . . . , X

k

] , each of degreeD and B

λµ

(1λL

µ

, 1µM) homogeneous polynomials in Q[X

0

, . . . , X

k

]. Assume that there exists α ∈ P

k

(K) such that

(i) A

1

(α) = · · · = A

N

(α) = 0 and

(ii) for each µ = 1, . . . , M, there exists λ ∈ {1, . . . , L

µ

} with B

λµ

(α) 6= 0.

Then there exist elements e α

0

, . . . , e α

k

in K , algebraic over Q , not all of which are zero, which generate an extension K e = K(e α

0

, . . . ,e α

k

) of K of degree e K : K

D

k

and such that the point e α = (e α

0

: · · · : e α

k

) ∈ P

k

( K) e satisfies

(i)

a

A

1

(e α) = · · · = A

N

(e α) = 0 and

(ii)

a

for each µ = 1 , . . . , M , there exists λ ∈ { 1 , . . . , L

µ

} with B

λµ

(e α) 6= 0.

Proof. Given homogeneous polynomials Q

1

, . . . , Q

N

in K[X

0

, . . . , X

k

], we write

Z(Q

1

, . . . , Q

N

) ⊂ P

k

(K)

for the set of zeros in P

k

(K) of the ideal (Q

1

, . . . , Q

N

) in K[X

0

, . . . , X

k

] generated by Q

1

, . . . , Q

N

.

Let Y be an absolutely irreducible component of Z(A

1

, . . . , A

N

) ⊂ P

k

(K) containing α. Consider the Zariski closed subset

F =

\

M µ=1

Z(B

1µ

, . . . , B

Lµ

)

of P

k

(K). By assumption α is not in F . Hence Lemma 4.1 is a consequence of the following statement:

Let A

1

, . . . , A

N

be homogeneous polynomials in K[X

0

, . . . , X

k

], each of degreeD . Let Y be an irreducible component of dimension δ of

Z(A

1

, . . . , A

N

)

and F a Zariski closed subset of P

k

(K) such that Y \F is not empty. Then there exists an element e α = (e α

0

: · · · : e α

k

) in Y \ F whose components e α

0

, . . . ,e α

k

are algebraic over Q and such that we have

K(e α

0

, . . . , e α

k

) : K

D

k−δ

.

(10)

Since Y is absolutely irreducible and not contained in F , we have dim(Y ∩ F )δ − 1. Pick linear forms L

1

, . . . , L

δ

with coefficients in K and in sufficiently general position such that

Z(L

1

) ∩ · · · ∩ Z(L

δ

)FY = ∅ and such that moreover

Z(L

1

) ∩ · · · ∩ Z(L

δ

)Y

is a non-empty finite set which does not contain more than D

k−δ

points. Let γ =

0

: · · · : γ

k

) be one of its elements. One at least among γ

0

, . . . , γ

k

is non-zero, say γ

0

. Put e α

i

= γ

i

0

. Then our construction implies that e α = ( 1 : e α

1

: · · · : e α

k

) = γ lies in Y \ F . Since our linear forms L

i

as well as the polynomials A

1

, . . . , A

N

have coefficients in K , it follows that for any K -embedding σ of K(e α

1

, . . . ,e α

k

) in K we have

( 1 : σe α

1

: · · · : σe α

k

)Z(L

1

) ∩ · · · ∩ Z(L

δ

)Y.

Since moreover the right hand side has cardinality ≤ D

k−δ

, we may conclude that in fact e α

1

, . . . ,e α

k

are algebraic over K and that

[K(e α

1

, . . . , e α

k

) : K ] ≤ D

k−δ

. ut Here is a consequence of Lemma 4.1.

Lemma 4.2. Let k be a non-negative integer, p , S , T , d

1

, . . . , d

S

positive in- tegers and h / a positive real number. For 1sS, let C

s

= (C

1s

, . . . , C

ps

) be a p-tuple of homogeneous polynomials in Q[X

0

, . . . , X

k

], each of de- gree d

s

. For 1tT , let D

t

= (D

1t

, . . . , D

pt

) be a p -tuple of homo- geneous polynomials in Q[X

0

, . . . , X

k

] , with deg D

1t

= · · · = deg D

pt

. Let α

0

, . . . , α

k

be non-zero elements of K and α =

0

, . . . , α

k

) ∈ K

k+1

. Denote by V the subspace of K

p

spanned by C

1

(α), . . . , C

S

(α) . Assume that for each t = 1, . . . , T , we have D

t

(α) 6∈ V .

Then there exist non-zero algebraic elements e α

0

, . . . ,e α

k

in K such that e α = (e α

0

, . . . , e α

k

) ∈ Q

k+1

has the following properties. The subspace V e of K

p

spanned by C

1

(e α), . . . , C

S

(e α) has dim V e = dim V . Further, for each t = 1, . . . , T , we have D

t

(e α) 6∈ V e . Furthermore, for 0i, jk , we have

( e α

i

/e α

j

= α

i

j

if α

i

j

is algebraic,

h (e α

i

: e α

j

)h / if α

i

j

is transcendental .

(11)

Proof. Let K denote a number field containing all coefficients of C

is

(1 ≤ ip , 1 ≤ sS ) and all algebraic elements of K which belong to the set α

i

j

; 0 ≤ i, jk . We shall prove the existence of e α = (e α

0

, . . . , e α

k

) ∈ K

k+1

satisfying the desired properties together with an upper bound for the degree of the number field K e = K(e α

0

, . . . ,e α

k

) , namely

e K : K

D

k

with D = p max

1≤s≤S

d

s

.

Define r = dim V . Since D

t

(α) is not in V , we have V 6= K

p

, hence r < p . Denote by

A

1

, . . . , A

J

the set of (r + 1 ) × (r + 1 ) minors of the p × S

matrix

C

1

, . . . , C

S

.

Each of these polynomials A

1

, . . . , A

J

is homogeneous of degree

(r + 1 ) max

1≤s≤S

d

s

D.

Also, for 1 ≤ tT , denote by

B

1t

, . . . , B

Lt

the set of (r + 1 )×(r + 1 ) minors of the p × (S + 1) matrix

C

1

, . . . , C

S

, D

t

. Further, let

A

J+1

, . . . , A

N

denote the set of polynomials α

i

X

j

α

j

X

i

where (i, j) runs over the set of pairs with 0 ≤ i, jk for which α

i

j

is algebraic. Furthermore, denote by

B

T+1

, . . . , B

M

the set of polynomials X

0

, . . . , X

k

, and βX

i

X

j

, where (i, j) runs over the set of pairs with 0 ≤ i, jk for which α

i

j

is transcendental, while β runs over the (finite) set of algebraic elements of K for which

[K(β) : K] ≤ D

k

and h

in

(β) ≤ h /.

By assumption the point α ∈ K

k+1

satisfies

A

1

(α) = · · · = A

N

(α) = 0 , B

µ

(α) 6= 0 for T + 1 ≤ µM,

and for each µ = 1, . . . , T , there exists λ ∈ {1, . . . , L} such that B

λµ

(α) 6=

0.

From Lemma 4.1 we deduce that there exists e α ∈ Q

k+1

such that K(e α

0

, . . . ,e α

k

) : K

D

k

, A

1

(e α) = · · · = A

N

(e α) = 0 , B

µ

(e α) 6= 0 for T + 1 ≤ µM,

and for each µ = 1, . . . , T , there exists λ ∈ {1, . . . , L} such that B

λµ

(e α) 6=

0. This e α then satisfies all desired properties. ut

(12)

We apply Lemma 4.2 to exponential polynomials.

Lemma 4.3. Let k1 be an integer, h / a positive real number, d

0

, . . . , d

k

non-negative integers and α

0

, . . . , α

k

non-zero elements of K satisfying (1.2). For 0jk , let

P

j

(X) =

dj

X

i=0

a

ij

X

i

be a non-zero polynomial in K[X] of degree d

j

. Define

f (x) = X

k j=0

P

j

(x)α

xj

and denote by N the set of solutions x ∈ Z of the equation f (x) = 0. Let E be a finite subset of Z . Assume that for each xE we are given a subset I (x) of

(i, j) ; 0 ≤ id

j

, 0 ≤ jk for which X

(i,j)∈I (x)

a

ij

x

i

α

jx

6= 0. (4.1)

Then there exist non-zero algebraic elementse α

0

, . . . , e α

k

of K and there exist polynomials P e

0

, . . . , P e

k

which are not all zero,

P e

j

(X) =

dj

X

i=0

e a

ij

X

i

(0jk),

with algebraic coefficients e a

ij

, and with the following properties:

deg P e

j

d

j

( 0 ≤ jk) (4.2) X

k

j=0

P e

j

(x)e α

xj

= 0 for all xN , (4.3) X

(i,j)∈I (x)

e a

ij

x

i

e α

jx

6= 0 for each xE, (4.4)

and, for 0i, jk,

( e α

i

/e α

j

= α

i

j

if α

i

j

is algebraic,

h (e α

i

: e α

j

)h / if α

i

j

is transcendental . (4.5)

(13)

Proof. We fix an ordering of the set I =

(i, j) ; 0 ≤ id

j

, 0 ≤ jk, a

ij

6= 0 and we denote by p the number of elements in this set. Also we write N = {n

1

, . . . , n

S

} (recall that N is finite) and E = {x

1

, . . . , x

T

} . For 1 ≤ sS, we define C

s

as the p-tuple composed of the polynomials n

is

X

jns

for (i, j)I . For 1 ≤ tT , let D

t

be the p -tuple composed of the

polynomials (

x

ti

X

xjt

for (i, j)II (x

t

) 0 for (i, j)I \ I (x

t

).

From the definition of N we deduce that the dimension r of the vector space V spanned by C

1

(α), . . . , C

S

(α) satisfies r < p. According to (4.1), for each t = 1 , . . . , T we have D

t

(α) 6∈ V . Therefore Lemma 4.3 follows from Lemma 4.2. ut

Remark. Let K denote the field generated over Q by all algebraic elements which belong to the set

α

i

j

; 0 ≤ i, jk . The proof of Lemma 4.3 also yields an upper bound for the degree of the number field K e = K(e α

0

, . . . , e α

k

) , namely

e K : K

1 max

x∈N

|x|

k

with 1 = d

1

+· · ·+d

k

+k+1. One may prove a variant of Lemma 4.3 where (4.3) holds only for some subset N

0

of N with Card N

0

/ Card N ≥ 1 /(k+ 1 ) but with the estimate

e K : K

1 min

x∈N0

|x|

k

.

5. Dividing exponential polynomials

Let α

0

, . . . , α

k

be given non-zero elements of K satisfying (1.2) and P

0

, . . . , P

k

be polynomials with coefficients in K , possibly zero. Consider the exponential polynomial

f (x) = X

k j=0

P

j

(x)α

jx

.

We set

1(f ) = X

k

j=0 Pj6=0

( deg P

j

+ 1 ).

Thus 1(f ) = 0 precisely when P

0

= · · · = P

k

= 0. When g(x) =

X

k j=0

Q

j

(x)α

jx

(14)

is another exponential polynomial with the same frequencies

0

, · · · , α

k

), we write gf if deg Q

j

≤ deg P

j

for 0 ≤ jk . We write g f if gf and 1(g) < 1(f ).

Lemma 5.1. Suppose gf and g 6= 0. Then there is an exponential polynomial

r(x) = R

0

(x)α

0x

+ · · · + R

k

(x)α

kx

with r f such that

f (x) = r(x) + cx

n

g(x) for some c in K

×

and some n0.

Proof. With f and g written as above, set n = min

0≤j≤k Qj6=0

( deg P

j

− deg Q

j

).

We may suppose n = deg P

0

− deg Q

0

. When

P

0

= c

a

X

a

+ c

a−1

X

a−1

+ · · · , Q

0

= d

b

X

b

+ d

b−1

X

b−1

+ · · · , where now a = b + n , set c = c

a

/d

b

and

r(x) = f (x)cx

n

g(x).

If again r(x) = R

0

(x)α

0x

+ · · · + R

k

(x)α

xk

, we have R

0

(X) = P

0

(X)(c

a

/d

b

)x

n

Q

0

(X),

so that deg R

0

< deg P

0

. Also deg R

j

≤ max ( deg P

j

, n+ deg Q

j

) ≤ deg P

j

, so that r f . ut

Consider an exponential polynomial f (x) =

X

k j=0

P

j

(x)α

xj

where α

0

, . . . , α

k

are non-zero algebraic elements in K satisfying (1.2).

Assume

α

0

, . . . , α

k

= [

m i=1

α

i0

: · · · : α

iki

is a partition of

α

0

, . . . , α

k

and define

f

i

(x) = P

i0

(x)α

ix0

+ · · · + P

iki

(x)α

ikxi

( 1 ≤ im) so that

f (x) = f

1

(x) + · · · + f

m

(x).

(15)

Suppose further, for 1 ≤ i 6= um, 0jk

i

and 0 ≤ vk

u

,

h

in

ij

uv

) ≥ 1 . ( 5 . 1 ) From (1.2) we deduce

1(f ) = 1(f

1

) + · · · + 1(f

m

).

Set

1 = 1(f ) Lemma 5.2. Define

F (1) = exp 1( 5 1)

51

.

Then for all but at most F (1) solutions x ∈ Z of f (x) = 0, we have f

1

(x) = · · · = f

m

(x) = 0 . ( 5 . 2 ) Proof. The lemma is non-trivial only when m ≥ 2 and at least two of f

1

, . . . , f

m

are non-zero, so that 1 ≥ 2. We now proceed by induction on 1 . When 1 = 2 and m ≥ 2, we have in fact f (x) =

10x

+

x20

with ab 6= 0 and h

in

10

20

) ≥ 1, so that α

10

20

is not a root of 1.

There can be at most one zero x of f , for if f (x) = f (y) = 0, then

10

20

)

x

=

10

20

)

y

= −b/a, so that

10

20

)

x−y

= 1 hence x = y since α

10

20

is not a root of 1.

Now assume 1 ≥ 3. In the induction step we apply Lemma 3.3 with h / = 1. The condition max

0≤i,j≤k

h

i

: α

j

) ≥ 1 is satisfied because m ≥ 2.

Any x ∈ Z with f (x) = 0 satisfies a relation f

(`)

(x) = 0

for some ` in the range 1 ≤ `t where t = exp ( 5 1)

51

and each f

(`)

6= 0 has f

(`)

f . By Lemma 5.1 we have, for 1 ≤ `t

f (x) = r

(`)

(x) + c

(`)

x

n(`)

f

(`)

(x) with r

(`)

f . Write out

f

(`)

(x) = f

1(`)

(x) + · · · + f

m(`)

(x), r

(`)

(x) = r

1(`)

(x) + · · · + r

m(`)

(x) with

f

i(`)

(x) = P

i(`)0

(x)α

ix0

+ · · · + P

ik(`)i

(x)α

xiki

, r

i(`)

(x) = R

i(`)0

(x)α

ix0

+ · · · + R

(`)iki

(x)α

ikxi

and

f

i

(x) = r

i(`)

(x) + c

(`)

x

n(`)

f

i(`)

(x). (5.3)

(16)

By induction, and since f

(`)

f and r

(`)

f , hence 1(f

(`)

) < 1(f ), 1(r

(`)

) < 1(f ) , we see that all but at most F (1− 1 ) solutions of f

(`)

(x) = 0 have

f

1(`)

(x) = · · · = f

m(`)

(x) = 0 , ( 5 . 4 ) and similarly all but at most F (1 − 1 ) solutions of r

(`)

(x) = 0 have

r

1(`)

(x) = · · · = r

m(`)

(x) = 0 . ( 5 . 5 ) But (5.3), (5.4) and (5.5) imply (5.2). Taking the sum over ` in 1 ≤ `t , we see that all but at most

2 tF (1 − 1 ) ≤ exp 1 + ( 5 1)

51

+ (1 − 1 )( 5 1)

51−5

F (1) solutions of f (x) = 0 have (5.2). ut

6. Proof of Theorem 1.1

Assume that the assumptions of Theorem 1.1 are satisfied. Let E be a set of more than F (1) solutions of (1.1). Assume that for each x in E there is an index i = i(x) in the range 1 ≤ im such that f

i(x)

(x) 6= 0.

We apply Lemma 4.3 with h / = 1. We produce algebraic elements e α

0

, . . . ,e α

k

and polynomials with algebraic coefficients P e

0

, . . . , P e

k

satis- fying (4.2), (4.3), (4.4) and (4.5). The exponential polynomial

f (x) e = X

k j=0

P e

j

(x)e α

jx

can be written

f (x) e = f e

1

(x) + · · · + f e

m

(x) where, for 1 ≤ im ,

f e

i

(x) =

ki

X

j=0

P e

ij

(x)e α

ijx

and, for 1 ≤ i 6= um, 0jk

i

and 0 ≤ vk

u

, h

in

(e α

ij

/ e α

uv

) ≥ 1 .

We apply Lemma 5.2 and deduce that one at least of x in E satisfies f e

i(x)

(x) = 0, which is a contradiction with (4.4). ut

Final remark. The proof of Theorem 1.1 yields a stronger result. Fix h / with

0 < h / ≤ 1. If we replace the assumption that α

i0

u0

is transcendental by

the assumption that either it is transcendental, or else has height ≥ h /, then

we get the same conclusion but with F (1) replaced by a function of 1 and

h /, which is equal to F (1) when h / = 1.

(17)

References

[1] Beukers, F. and Schlickewei, H.P.: The equation

x+y=

1 in finitely generated groups.

Acta Arith. 78, 189–199 (1996)

[2] Beukers, F. and Tijdeman, R.: On the multiplicities of binary complex recurrences.

Compositio Math. 51, 193–213 (1984)

[3] Evertse, J.H., Schlickewei, H.P. and Schmidt, W.M.: Linear equations with variables which lie in a multiplicative group. In preparation

[4] Schlickewei, H.P.: The multiplicity of binary recurrences. Invent. Math. 129, 11–36 (1997)

[5] Schlickewei, H.P.: Multiplicities of recurrence sequences. Acta Math. 176, 171–243 (1996)

[6] Schlickewei, H.P. and Schmidt, W.M.: Linear equations with variables which lie in a multiplicative group. Preprint

[7] Schmidt, W.M.: The zero multiplicity of linear recurrence sequences. Acta Arith., to appear

[8] Shorey, T.N. and Tijdeman, R.: Exponential Diophantine Equations. Cambridge Tracts

in Mathematics 87, Cambridge Univ. Press, 1986, pp. 240

Références

Documents relatifs

Recall that for the second boundary value problem of the Monge-Amp`ere equation (see (1.5), (1.6) below), or for the reflector problem in the far field case (see (1.7), (1.8)

While it is natural for us to talk about cumulated gain over time, the traditional cumulated gain measures have substi- tuted document rank for time and implicitly model a user

Hausdorff measure and dimension, Fractals, Gibbs measures and T- martingales and Diophantine

We define sender-initiated file transfer for IP as a TCP service as follows: a receiver program (the server or &#34;daemon&#34;) listens on port 608 for inbound

This document lists those unused option codes and directs IANA to make these option codes available for assignment to other DHCP options in the future.. The document also

In particular, bundles including the optional metadata block would be protected in their entirety for the duration of a single hop, from a forwarding node to an

While a CA is typically advised against issuing a certificate with a validity period that spans a greater period of time than the validity period of the CA’s certificate that

When an outstanding TSN is acknowledged or a HEARTBEAT sent to that address is acknowledged with a HEARTBEAT ACK, the endpoint SHOULD clear the error counter of the