Introduction
Let P u ( X ) = X Q ( X ) ( X − u ) + 1 P_u(X)=XQ(X)(X-u)+1 P u ( X ) = X Q ( X ) ( X − u ) + 1 with Q ( X ) ∈ Z [ X ] Q(X)\in\mathbb{Z}[X] Q ( X ) ∈ Z [ X ] and with the non-negative integer parameter u u u . Such kind of polynomials seems to be investigated at the first time by Ankeny, Brauer and Chowla in 1956 [2 ] . They considered only such Q Q Q 's, which have solely simple, integer roots. They proved that P u ( X ) P_u(X) P u ( X ) is irreducible and the number fields generated by one of its roots have as large as possible class number for infinitely many u u u . To the honor of the authors I will call P u ( X ) P_u(X) P u ( X ) the family of ABC polynomials.
One can associate to any integer polynomial a Thue equation. Denote the degree of Q ( X ) Q(X) Q ( X ) by q q q then its associated Thue equation is
Y q + 2 P u ( X / Y ) = X ( Y q Q ( X / Y ) ) ( X − u Y ) + Y q + 2 = 1. (1) Y^{q+2}P_u(X/Y)=X(Y^qQ(X/Y))(X-uY)+Y^{q+2}=1. \tag*{(1)} Y q + 2 P u ( X / Y ) = X ( Y q Q ( X / Y )) ( X − u Y ) + Y q + 2 = 1. (1)
If Q ( X ) = ∏ j = 1 q ( X − a j ) Q(X)=\prod_{j=1}^{q}(X-a_j) Q ( X ) = ∏ j = 1 q ( X − a j ) with a 1 , … , a q a_1,\ldots,a_q a 1 , … , a q pairwise distinct integers, then (1) has the solutions ( 1 , 0 ) , ( 0 , 1 ) , ( a j , 1 ) (1,0),(0,1),(a_j,1) ( 1 , 0 ) , ( 0 , 1 ) , ( a j , 1 ) , j = 1 , … , q j=1,\ldots,q j = 1 , … , q and ( 0 , − 1 ) (0,-1) ( 0 , − 1 ) if q q q is even. We call them trivial . Bombieri and Schmidt [4 ] proved that a Thue equation of degree n n n admits at most O ( n ) O(n) O ( n ) solutions. Moreover they pointed out that Thue equations associated to ABC polynomials are with this respect up to a constant factor extremal, because they admit, at least n + 1 n+1 n + 1 solutions.
For q = 1 q=1 q = 1 , a 1 = 1 a_1=1 a 1 = 1 and with − ( u + 1 ) -(u+1) − ( u + 1 ) instead of u u u , Mignotte and Tzanakis [20 ] proved that if ∣ u ∣ > 3.67 ⋅ 10 32 |u|>3.67\cdot10^{32} ∣ u ∣ > 3.67 ⋅ 1 0 32 , then (1) has only one non-trivial solution, namely ( x , y ) = ( − u − 1 , − 1 ) (x,y)=(-u-1,-1) ( x , y ) = ( − u − 1 , − 1 ) . Mignotte [17 ] proved the same for ∣ u ∣ ≥ 5 |u|\ge5 ∣ u ∣ ≥ 5 and settled the cases u = 0 , 1 , 2 , 3 , 4 u=0,1,2,3,4 u = 0 , 1 , 2 , 3 , 4 too.
For q = 2 q=2 q = 2 , a 1 = 1 a_1=1 a 1 = 1 , a 2 = − 1 a_2=-1 a 2 = − 1 , equation (1) was completely solved for ∣ a ∣ > 10 28 |a|>10^{28} ∣ a ∣ > 1 0 28 by Pethő [22 ] . His result was extended to ∣ a ∣ ≥ 2 |a|\ge2 ∣ a ∣ ≥ 2 by Mignotte, Pethő and Roth [19 ] . In this case, there is again exactly one (parametrized) non-trivial solution, namely ( x , y ) = ( 1 , − a ) (x,y)=(1,-a) ( x , y ) = ( 1 , − a ) . Marzenta [12 ] gave an essentially new proof of the theorem of Pethő. His proof is based on a method developed for the solution of parametrized families of norm form equations and presented Amozo, Masser and Zannier in [1 ] .
Thomas [29 ] investigated equation (1) in the case, when the factor X − u X-u X − u disappear, but the a i a_i a i denote integer polynomials of distinct degrees in an integer variable u u u , a i = a i ( u ) ∈ Z [ u ] a_i=a_i(u)\in\mathbb{Z}[u] a i = a i ( u ) ∈ Z [ u ] , i = 1 , 2 i=1,2 i = 1 , 2 . He conjectured that (1) has only the trivial solutions if u u u is large enough, and pointed out that the conjecture might also be true in specific cases of polynomials of equal degrees. In the case n = 3 n=3 n = 3 , a 1 = u k a_1=u^k a 1 = u k , a 2 = u l a_2=u^l a 2 = u l , where 0 < k < l 0<k<l 0 < k < l are integers, Thomas proved in [29 ] , that for u ≥ ( 2 ⋅ 10 6 ( k + 2 l ) ) 4.85 / ( l − k ) u\geq\left(2\cdot10^6(k+2l)\right)^{4.85/(l-k)} u ≥ ( 2 ⋅ 1 0 6 ( k + 2 l ) ) 4.85/ ( l − k ) , (1) has only the trivial solutions. Heuberger [8 ] settled Thomas conjecture even if Q ( X ) Q(X) Q ( X ) is the product of any number of factors X − a i ( u ) X-a_i(u) X − a i ( u ) , but only under certain assumptions.
The above examples show that not only the trivial, but most of the non-trivial solutions are polynomials in u u u . Zigler [32 ] reformulated Thomas’ conjecture for solutions ( x , y ) ∈ C [ u ] (x,y)\in\mathbb{C}[u] ( x , y ) ∈ C [ u ] of (1) and proved it even in the case when a 1 ( u ) , a 2 ( u ) ∈ C [ u ] a_1(u),a_2(u)\in\mathbb{C}[u] a 1 ( u ) , a 2 ( u ) ∈ C [ u ] .
The proofs of most of the mentioned results consist of three main steps; the first is the reformulation of (1) to a weighted unit equation in two variables. In the second step it is shown that writing a solution of the weighted unit equation in an appropriate system of fundamental units, one of the exponents must be larger than c u log u cu\log u c u log u with a positive constant c c c . In the final step some result on logarithmic forms imply that there is no solution provided u u u is large enough. Halter-Koch, Lettl, Pethő and Tichy [7 ] implemented this program, when P u ( X ) P_u(X) P u ( X ) denotes a classical ABC polynomial, i.e. when Q ( X ) = ∏ j = 1 q ( X − a j ) Q(X)=\prod_{j=1}^{q}(X-a_j) Q ( X ) = ∏ j = 1 q ( X − a j ) with a 1 , … , a q a_1,\ldots,a_q a 1 , … , a q pairwise distinct integers. They finished the first two steps successfully, but failed with the third one, because the available lower bounds for linear forms in logarithms of algebraic numbers were not sharp enough. They were able to finish the work by invoking the Lang-Waldschmidt conjecture, see [10 ] . Despite of the 25 years development the Lang-Waldschmidt conjecture is still far from a proof.
The present paper was motivated by [7 ] and by the paper of Pethő and Tengely [24 ] . They investigated common values of linear recursive sequences associated to Shanks’ simplest cubics. The Thue equation associated to the same family of polynomials was solved by Thomas [28 ] and Mignotte [16 ] more than thirty years ago. Taking heart I tried the same game with ABC polynomials. More precisely write P u ( X ) = ∑ j = 0 q + 2 p j ( u ) X j P_u(X)=\sum_{j=0}^{q+2}p_j(u)X^j P u ( X ) = ∑ j = 0 q + 2 p j ( u ) X j , then p j ( u ) p_j(u) p j ( u ) , j = 1 , … , q + 1 j=1,\ldots,q+1 j = 1 , … , q + 1 are linear polynomials with integer coefficients of u u u and p 0 = p q + 2 = 1 p_0=p_{q+2}=1 p 0 = p q + 2 = 1 . Let A 0 ( u ) , … , A q + 1 ( u ) ∈ Z A_0(u),\ldots,A_{q+1}(u)\in\mathbb{Z} A 0 ( u ) , … , A q + 1 ( u ) ∈ Z and define A n ( u ) A_n(u) A n ( u ) , n ≥ q + 2 n\geq q+2 n ≥ q + 2 by the linear recursion
A n ( u ) = − p q + 1 ( u ) A n − 1 ( u ) − ⋯ − p 0 ( u ) A n − q − 2 ( u ) . (2) A_n(u)=-p_{q+1}(u)A_{n-1}(u)-\cdots-p_0(u)A_{n-q-2}(u). \tag*{(2)} A n ( u ) = − p q + 1 ( u ) A n − 1 ( u ) − ⋯ − p 0 ( u ) A n − q − 2 ( u ) . (2)
For simplicity we denote the initial terms by A 0 , … , A q + 1 A_0,\ldots,A_{q+1} A 0 , … , A q + 1 , and to exclude the zero sequence we assume that at least one of them is not zero. Set L = max { ∣ A 1 ∣ , … , ∣ A q + 1 ∣ } L=\max\{|A_1|,\ldots,|A_{q+1}|\} L = max { ∣ A 1 ∣ , … , ∣ A q + 1 ∣ } .
Plainly A n ( u ) ∈ Z [ u ] A_n(u)\in\mathbb{Z}[u] A n ( u ) ∈ Z [ u ] for all n ≥ 0 n\geq0 n ≥ 0 . The polynomial P u ( X ) P_u(X) P u ( X ) is called the characteristic polynomial of the sequence ( A n ( u ) ) (A_n(u)) ( A n ( u )) . As p 0 ( u ) = 1 p_0(u)=1 p 0 ( u ) = 1 this sequence can be extended to negative indexes too such that all members of the two sided sequence belong to Z [ u ] \mathbb{Z}[u] Z [ u ] . Hence the search for the integers, which appear multiple times in the two-parametric sequence ( A n ( u ) ) (A_n(u)) ( A n ( u )) is meaningful and non-trivial. In the language of Diophantine equations this means to find solutions of the equation
∣ A n ( u ) ∣ = ∣ A m ( u ) ∣ (3) |A_n(u)|=|A_m(u)| \tag*{(3)} ∣ A n ( u ) ∣ = ∣ A m ( u ) ∣ (3)
in n , m , u ∈ Z n,m,u\in\mathbb{Z} n , m , u ∈ Z , n ≠ m n\ne m n = m . Our aim is to prove the following.
Theorem 1. Let P u ( X ) = X Q ( X ) ( X − u ) + 1 P_u(X)=XQ(X)(X-u)+1 P u ( X ) = X Q ( X ) ( X − u ) + 1 , where Q ( X ) ∈ Z [ X ] Q(X)\in\mathbb{Z}[X] Q ( X ) ∈ Z [ X ] is monic, separable, has constant term ± 1 \pm1 ± 1 , and degree q ≥ 1 q\ge1 q ≥ 1 . Denote ( A n ( u ) ) (A_n(u)) ( A n ( u )) the linear recursive sequence having characteristic polynomial P u ( X ) P_u(X) P u ( X ) and initial terms A 0 , … , A q + 1 ∈ Z A_0,\ldots,A_{q+1}\in\mathbb{Z} A 0 , … , A q + 1 ∈ Z such that at least one of them is non-zero. Then there exist effectively computable constants n 0 , u 0 n_0,u_0 n 0 , u 0 depending only on Q ( X ) Q(X) Q ( X ) and L = max { ∣ A 0 ∣ , … , ∣ A q + 1 ∣ } L=\max\{|A_0|,\ldots,|A_{q+1}|\} L = max { ∣ A 0 ∣ , … , ∣ A q + 1 ∣ } such that if (3) holds for some integers u , n , m u,n,m u , n , m with u > u 0 u>u_0 u > u 0 and n ≠ m n\ne m n = m then
∣ n ∣ , ∣ m ∣ < n 0 . |n|,|m|<n_0. ∣ n ∣ , ∣ m ∣ < n 0 .
After submitting the manuscript we we made acquainted with the paper of Noubissie and Tichy [21 ] . They investigate common values of linear recursive sequences associated to generalized ABC-polynomials, π U ( X ) = X ( X − P 1 ( U ) ) ⋯ ( X − P q − 1 ( U ) ) + 1 \pi_U(X)=X(X-P_1(U))\cdots(X-P_{q-1}(U))+1 π U ( X ) = X ( X − P 1 ( U )) ⋯ ( X − P q − 1 ( U )) + 1 , where P 1 ( U ) , … , P q − 1 ( U ) ∈ Z [ U ] P_1(U),\ldots,P_{q-1}(U)\in\mathbb{Z}[U] P 1 ( U ) , … , P q − 1 ( U ) ∈ Z [ U ] are pairwise distinct and such that deg P 1 ≤ ⋯ ≤ deg P q − 3 < deg P q − 2 < deg P q − 1 \deg P_1\le\cdots\le\deg P_{q-3}<\deg P_{q-2}<\deg P_{q-1} deg P 1 ≤ ⋯ ≤ deg P q − 3 < deg P q − 2 < deg P q − 1 . They proved that these sequences have at most two sufficiently large common values. Their result is not effective. Unfortunately it say nothing on common values of linear recursive sequences associated to our version of ABC-polynomials, but with ∣ Q ( 0 ) ∣ > 1 |Q(0)|>1 ∣ Q ( 0 ) ∣ > 1 .
The strategy of our proof is similar that were used for the investigation of parametric families of Thue equations. In Section 3 we carefully investigate the roots of P u ( X ) P_u(X) P u ( X ) . It turns out that if u u u is large enough then they behave regularly. It admits two real roots, one α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) is as large as u u u , and the other α 0 ( u ) \alpha_0(u) α 0 ( u ) lies near to zero, moreover Q ( 0 ) α 0 ( u ) α q + 1 ( u ) Q(0)\alpha_0(u)\alpha_{q+1}(u) Q ( 0 ) α 0 ( u ) α q + 1 ( u ) is asymptotically one.
Section 4 is devoted to the ABC sequence with special attention to the weights of α 0 ( u ) \alpha_0(u) α 0 ( u ) and α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) appearing in the Binet formula of ( A n ( u ) ) (A_n(u)) ( A n ( u )) . In both sections the machinery of Puiseux expansions of algebraic functions play important role. In Section 5 we collected necessary tools from transcendental number theory.
In the last section we prove Theorem 1. First we deal with the easy cases, i.e. if n n n and m m m have the same signs. The hard case is, when n m < 0 nm<0 nm < 0 . Then we derive a lower bound for max { ∣ n ∣ , ∣ m ∣ } \max\{|n|,|m|\} max { ∣ n ∣ , ∣ m ∣ } in term of u u u , which have the shape g u f gu^f g u f with positive constants g , f g,f g , f . Having it we derive the desired upper bound for max { ∣ n ∣ , ∣ m ∣ } \max\{|n|,|m|\} max { ∣ n ∣ , ∣ m ∣ } by using Matveev’s theorem.
The symbols c x , n x , u x c_x,n_x,u_x c x , n x , u x denote constants, which depend only on Q ( X ) Q(X) Q ( X ) and L L L , the u x u_x u x are such that the corresponding predicate holds only for u ≤ u x u\le u_x u ≤ u x , the n x n_x n x play similar role with respect to max { ∣ n ∣ , ∣ m ∣ } \max\{|n|,|m|\} max { ∣ n ∣ , ∣ m ∣ } .
Tools from algebraic functions
To prove our main theorem in the generality as stated we have to invoke facts about algebraic functions. They are collected in this section. We present them for polynomials defined over Q \mathbb{Q} Q , because this is relevant in our application, although most results hold much more general.
A function S ( z ) : C ↦ C S(z):\mathbb{C}\mapsto\mathbb{C} S ( z ) : C ↦ C is called algebraic if there is F ( X , Y ) ∈ Q [ X , Y ] F(X,Y)\in\mathbb{Q}[X,Y] F ( X , Y ) ∈ Q [ X , Y ] such that F ( S ( z ) , z ) = 0 F(S(z),z)=0 F ( S ( z ) , z ) = 0 . The algebraic functions form a field, see e.g. Jung [9 ] (Viertes Kapitel, Satz I). The algebraic functions admit formal Puiseux expansions . More precisely let
F ( X , Y ) = X d + p 1 ( Y ) X d − 1 + … + p d ( Y ) , F(X,Y)=X^d+p_1(Y)X^{d-1}+\ldots+p_d(Y), F ( X , Y ) = X d + p 1 ( Y ) X d − 1 + … + p d ( Y ) ,
where p 1 ( Y ) , … , p d ( Y ) ∈ Q [ Y ] p_1(Y),\ldots,p_d(Y)\in\mathbb{Q}[Y] p 1 ( Y ) , … , p d ( Y ) ∈ Q [ Y ] . The following assertion is the simplified version of Theorem 2.1.1 of [6 ] .
Proposition 1. There are positive integers r ≤ d r \le d r ≤ d and e 1 , … , e r e_1,\ldots,e_r e 1 , … , e r with e 1 + ⋯ + e r = d e_1+\cdots+e_r=d e 1 + ⋯ + e r = d and formal Puiseux series
x i ( y ) = ∑ j = n i ∞ a i j y − j / e i , a i n i ≠ 0 , i = 1 , … , r x_i(y)=\sum_{j=n_i}^{\infty}a_{ij}y^{-j/e_i},\qquad a_{in_i}\ne0,\quad i=1,\ldots,r x i ( y ) = j = n i ∑ ∞ a ij y − j / e i , a i n i = 0 , i = 1 , … , r with a i j ∈ C a_{ij}\in\mathbb{C} a ij ∈ C that satisfy F ( x i ( y ) , y ) = 0 F(x_i(y),y)=0 F ( x i ( y ) , y ) = 0 .
We need not only the formal Puiseux expansion of algebraic functions, but also their convergence if y y y tends to infinity. Very special case of Lemma 1 of [26 ] is that the Puiseux series of any algebraic functions have positive radius of convergence.
Properties of the ABC polynomials
Although in Theorem 1 Q ( X ) Q(X) Q ( X ) is assumed to have constant term ± 1 \pm1 ± 1 , many preliminary statements hold without this assumption. In this section we suppose that Q ( X ) ∈ Z [ X ] Q(X)\in\mathbb{Z}[X] Q ( X ) ∈ Z [ X ] is monic and separable, Q ( 0 ) ≠ 0 Q(0)\ne0 Q ( 0 ) = 0 and that its degree is q q q . We set P u ( X ) = X Q ( X ) ( X − u ) + 1 P_u(X)=XQ(X)(X-u)+1 P u ( X ) = X Q ( X ) ( X − u ) + 1 , where u u u denotes parameter, which is usually a rational integer, but sometimes real. In the later case this will be indicated explicitly. Then, plainly, P u ( X ) ∈ R [ X ] P_u(X)\in\mathbb{R}[X] P u ( X ) ∈ R [ X ] (P u ( X ) ∈ Z [ X ] P_u(X)\in\mathbb{Z}[X] P u ( X ) ∈ Z [ X ] if u ∈ Z u\in\mathbb{Z} u ∈ Z ) is monic and of degree q + 2 q+2 q + 2 . Let β 0 = 0 , β q + 1 = u \beta_0=0,\beta_{q+1}=u β 0 = 0 , β q + 1 = u and denote β j \beta_j β j , j = 1 , … , q j=1,\ldots,q j = 1 , … , q the zeroes of Q ( X ) Q(X) Q ( X ) . Then β j \beta_j β j , j = 0 , … , q + 1 j=0,\ldots,q+1 j = 0 , … , q + 1 are the zeroes of X Q ( X ) ( X − u ) XQ(X)(X-u) X Q ( X ) ( X − u ) and they are pairwise distinct provided u ≠ β j u\ne\beta_j u = β j , j = 1 , … , q j=1,\ldots,q j = 1 , … , q , which happens certainly if ∣ u ∣ > max { ∣ β j ∣ : j = 1 , … , q } |u|>\max\{|\beta_j|:j=1,\ldots,q\} ∣ u ∣ > max { ∣ β j ∣ : j = 1 , … , q } . Our first lemma generalizes Lemma 1 of [2 ] . The proof is, up to notations, the same.
Lemma 1. If u ∈ R u\in\mathbb{R} u ∈ R and u ≥ u 1 u\ge u_1 u ≥ u 1 then P u ( X ) P_u(X) P u ( X ) has the following properties:
(i) The degree of P u ( X ) P_u(X) P u ( X ) is q + 2 q+2 q + 2 , and its zeroes α j ( u ) \alpha_j(u) α j ( u ) , 0 ≤ j ≤ q + 1 0\le j\le q+1 0 ≤ j ≤ q + 1 are pairwise distinct.
(ii) For a suitable arrangement of these roots
lim u → ∞ u ( α i ( u ) − β i ) = b i , i = 0 , … , q \lim_{u\to\infty}u\bigl(\alpha_i(u)-\beta_i\bigr)=b_i,\quad i=0,\ldots,q u → ∞ lim u ( α i ( u ) − β i ) = b i , i = 0 , … , q hold with
b 0 = Q ( 0 ) − 1 b_0=Q(0)^{-1} b 0 = Q ( 0 ) − 1 and
b i = 1 β i Q ′ ( β i ) ≠ 0 , i = 1 , … , q . b_i=\frac{1}{\beta_iQ'(\beta_i)}\ne0,\quad i=1,\ldots,q. b i = β i Q ′ ( β i ) 1 = 0 , i = 1 , … , q . (iii) If, with the arrangement of (ii), β i \beta_i β i is real, then α i ( u ) \alpha_i(u) α i ( u ) is real too. In particular the numbers α 0 ( u ) \alpha_0(u) α 0 ( u ) and α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) are real.
(iv) If, additionally, u ∈ Z u\in\mathbb{Z} u ∈ Z then P u ( X ) P_u(X) P u ( X ) is irreducible in Q [ X ] \mathbb{Q}[X] Q [ X ] .
(v) If u ∈ Z u\in\mathbb{Z} u ∈ Z then α 0 ( u ) \alpha_0(u) α 0 ( u ) and α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) are multiplicatively independent.
Proof. We do not separate the proofs of (i) and (ii). The degree of P u ( X ) P_u(X) P u ( X ) is q + 2 q+2 q + 2 , thus it has q + 2 q+2 q + 2 complex roots. We only have to prove that they are distinct. As u → ∞ u\to\infty u → ∞
− 1 u P u ( X ) → X Q ( X ) -\frac{1}{u}P_u(X)\to XQ(X) − u 1 P u ( X ) → X Q ( X )
pointwise. Because of the continuity of the roots as functions of the parameter u u u , each of the β i \beta_i β i , 0 ≤ i ≤ q 0\le i\le q 0 ≤ i ≤ q , is the limit of a root α i ( u ) \alpha_i(u) α i ( u ) of P u ( X ) P_u(X) P u ( X ) . Also, because of
P u ( α i ( u ) ) = 0 , P_u(\alpha_i(u))=0, P u ( α i ( u )) = 0 ,
( α i ( u ) − β i ) ( α i ( u ) − u ) ∏ j = 0 j ≠ i q ( α i ( u ) − β j ) + 1 = 0. (\alpha_i(u)-\beta_i)(\alpha_i(u)-u)\prod_{\substack{j=0\\j\ne i}}^{q}(\alpha_i(u)-\beta_j)+1=0. ( α i ( u ) − β i ) ( α i ( u ) − u ) j = 0 j = i ∏ q ( α i ( u ) − β j ) + 1 = 0.
Notice that
lim u → ∞ ∏ j = 0 j ≠ i q ( α i ( u ) − β j ) = ∏ j = 0 j ≠ i q ( β i − β j ) ≠ 0. \lim_{u\to\infty}\prod_{\substack{j=0\\j\ne i}}^{q}(\alpha_i(u)-\beta_j)=\prod_{\substack{j=0\\j\ne i}}^{q}(\beta_i-\beta_j)\ne0. u → ∞ lim j = 0 j = i ∏ q ( α i ( u ) − β j ) = j = 0 j = i ∏ q ( β i − β j ) = 0.
Hence, if i > 0 i>0 i > 0 then
lim u → ∞ u ( α i ( u ) − β i ) = ∏ j = 0 j ≠ i q ( β i − β j ) − 1 ≠ 0 , \lim_{u\to\infty}u(\alpha_i(u)-\beta_i)=\prod_{\substack{j=0\\j\ne i}}^{q}(\beta_i-\beta_j)^{-1}\ne0, u → ∞ lim u ( α i ( u ) − β i ) = j = 0 j = i ∏ q ( β i − β j ) − 1 = 0 ,
and for i = 0 i=0 i = 0
lim u → ∞ u α 0 ( u ) = ∏ j = 1 q ( − β j ) − 1 = Q ( 0 ) − 1 ≠ 0 , \lim_{u\to\infty}u\alpha_0(u)=\prod_{j=1}^{q}(-\beta_j)^{-1}=Q(0)^{-1}\ne0, u → ∞ lim u α 0 ( u ) = j = 1 ∏ q ( − β j ) − 1 = Q ( 0 ) − 1 = 0 ,
and all limits are non-zero constants. In particular, α i ( u ) = β i + O ( u − 1 ) \alpha_i(u)=\beta_i+O(u^{-1}) α i ( u ) = β i + O ( u − 1 ) , i = 0 , … , q i=0,\ldots,q i = 0 , … , q . Since ∑ j = 0 q + 1 α j ( u ) = ∑ j = 0 q + 1 β j \sum_{j=0}^{q+1}\alpha_j(u)=\sum_{j=0}^{q+1}\beta_j ∑ j = 0 q + 1 α j ( u ) = ∑ j = 0 q + 1 β j , it follows that α q + 1 ( u ) = β q + 1 + O ( u − 1 ) = u + O ( u − 1 ) \alpha_{q+1}(u)=\beta_{q+1}+O(u^{-1})=u+O(u^{-1}) α q + 1 ( u ) = β q + 1 + O ( u − 1 ) = u + O ( u − 1 ) , which proves (ii).
To prove (iii) assume that β i \beta_i β i is real, but α i ( u ) \alpha_i(u) α i ( u ) is not real for some 0 ≤ i ≤ q + 1 0\le i\le q+1 0 ≤ i ≤ q + 1 and for all large enough u u u . Then b i b_i b i is real too. Further α i ( u ) \alpha_i(u) α i ( u ) , the complex conjugate of α i ( u ) \alpha_i(u) α i ( u ) is different from α i ( u ) \alpha_i(u) α i ( u ) , and is a zero of P u ( X ) P_u(X) P u ( X ) , i.e. α i ( u ) ‾ = α j ( u ) \overline{\alpha_i(u)}=\alpha_j(u) α i ( u ) = α j ( u ) for some j ≠ i j\ne i j = i . On the other hand
u ( α j ( u ) − β i ) = u ( α i ( u ) ‾ − β i ) = u ( α i ( u ) − β i ) ‾ → b i ‾ = b i , u(\alpha_j(u)-\beta_i)=u(\overline{\alpha_i(u)}-\beta_i)=\overline{u(\alpha_i(u)-\beta_i)}\to\overline{b_i}=b_i, u ( α j ( u ) − β i ) = u ( α i ( u ) − β i ) = u ( α i ( u ) − β i ) → b i = b i ,
but this contradicts (ii).
Although the proof of (iv) repeats essentially the argumentation of Lemma 1 [2 ] we present it for the convenience of the readers, and because our statement is more general. The assumption u ∈ Z u\in\mathbb{Z} u ∈ Z yields P u ( X ) ∈ Z [ X ] P_u(X)\in\mathbb{Z}[X] P u ( X ) ∈ Z [ X ] . Assume that P u ( X ) P_u(X) P u ( X ) is reducible in Q [ X ] \mathbb{Q}[X] Q [ X ] , i.e. P u ( X ) = g 1 ( X ) g 2 ( X ) P_u(X)=g_1(X)g_2(X) P u ( X ) = g 1 ( X ) g 2 ( X ) with g 1 ( X ) , g 2 ( X ) ∈ Z [ X ] g_1(X),g_2(X)\in\mathbb{Z}[X] g 1 ( X ) , g 2 ( X ) ∈ Z [ X ] both of degree at least one. We may assume that α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) is a zero of g 2 ( X ) g_2(X) g 2 ( X ) . There is a 0 ≤ j ≤ q 0\le j\le q 0 ≤ j ≤ q such that α j ( u ) \alpha_j(u) α j ( u ) is a zero of g 1 ( X ) g_1(X) g 1 ( X ) . Then u − α j ( u ) u-\alpha_j(u) u − α j ( u ) is a unit because P u ( u ) = 1 = ∏ i = 0 q + 1 ( u − α i ( u ) ) P_u(u)=1=\prod_{i=0}^{q+1}(u-\alpha_i(u)) P u ( u ) = 1 = ∏ i = 0 q + 1 ( u − α i ( u )) . Hence there is an algebraic conjugate of u − α j ( u ) u-\alpha_j(u) u − α j ( u ) , which absolute value is smaller than one. On the other hand the algebraic conjugates of α j ( u ) \alpha_j(u) α j ( u ) are zeroes of g 1 ( X ) g_1(X) g 1 ( X ) , in particular different from α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) , thus by (ii) bounded. Hence for large enough u u u all algebraic conjugates of u − α j ( u ) u-\alpha_j(u) u − α j ( u ) have absolute value larger than one, which is a contradiction.
We come back to the proof of (v) at the end of this section. □
Corollary 1. Set F = 2 max { ∣ β 1 ∣ ± 1 , … , ∣ β q ∣ ± 1 } F=2\max\{|\beta_1|^{\pm1},\ldots,|\beta_q|^{\pm1}\} F = 2 max { ∣ β 1 ∣ ± 1 , … , ∣ β q ∣ ± 1 } . There exists a constant u 2 u_2 u 2 such that
max { ∣ α 1 ( u ) ∣ ± 1 , … , ∣ α q ( u ) ∣ ± 1 } < F \max\{|\alpha_1(u)|^{\pm1},\ldots,|\alpha_q(u)|^{\pm1}\}<F max { ∣ α 1 ( u ) ∣ ± 1 , … , ∣ α q ( u ) ∣ ± 1 } < F and
∣ α 0 ( u ) ∣ , ∣ α q + 1 ( u ) ∣ − 1 < F < ∣ α 0 ( u ) ∣ − 1 / 2 , α q + 1 ( u ) / 2 |\alpha_0(u)|,\ |\alpha_{q+1}(u)|^{-1}<F<|\alpha_0(u)|^{-1}/2,\ \alpha_{q+1}(u)/2 ∣ α 0 ( u ) ∣ , ∣ α q + 1 ( u ) ∣ − 1 < F < ∣ α 0 ( u ) ∣ − 1 /2 , α q + 1 ( u ) /2 hold for all u ≥ u 2 u\ge u_2 u ≥ u 2 .
Proof. Both assertions follow from Lemma 1 (ii). □
Lemma 2. Let X , X 1 , … , X q X, X_1,\ldots,X_q X , X 1 , … , X q be indeterminates and set Q ( X ) = ∏ j = 1 q ( X − X j ) Q(X)=\prod_{j=1}^{q}(X-X_j) Q ( X ) = ∏ j = 1 q ( X − X j ) . Denote Q ′ ( X ) Q'(X) Q ′ ( X ) the derivative of Q ( X ) Q(X) Q ( X ) with respect to X X X . Then
∑ j = 1 q 1 X j 2 Q ′ ( X j ) = ( − 1 ) q − 1 ∑ i = 1 q ∏ j = 1 j ≠ i q X j ∏ j = 1 q X j 2 = Q ′ ( 0 ) Q ( 0 ) 2 . (4) \sum_{j=1}^{q}\frac{1}{X_j^2Q'(X_j)}=(-1)^{q-1}\frac{\sum_{i=1}^{q}\prod_{\substack{j=1\\j\ne i}}^{q}X_j}{\prod_{j=1}^{q}X_j^2}=\frac{Q'(0)}{Q(0)^2}. \tag*{(4)} j = 1 ∑ q X j 2 Q ′ ( X j ) 1 = ( − 1 ) q − 1 ∏ j = 1 q X j 2 ∑ i = 1 q ∏ j = 1 j = i q X j = Q ( 0 ) 2 Q ′ ( 0 ) . (4) Proof. Notice that
Q ′ ( X ) = ∑ i = 1 q ∏ j = 1 j ≠ i q ( X − X j ) . Q'(X)=\sum_{i=1}^{q}\prod_{\substack{j=1\\j\ne i}}^{q}(X-X_j). Q ′ ( X ) = i = 1 ∑ q j = 1 j = i ∏ q ( X − X j ) . This implies on one hand
Q ′ ( 0 ) = ( − 1 ) q − 1 ∑ i = 1 q ∏ j = 1 j ≠ i q X j Q'(0)=(-1)^{q-1}\sum_{i=1}^{q}\prod_{\substack{j=1\\j\ne i}}^{q}X_j Q ′ ( 0 ) = ( − 1 ) q − 1 i = 1 ∑ q j = 1 j = i ∏ q X j and on the other hand
Q ′ ( X j ) = ∏ i = 1 i ≠ j q ( X j − X i ) Q'(X_j)=\prod_{\substack{i=1\\i\ne j}}^{q}(X_j-X_i) Q ′ ( X j ) = i = 1 i = j ∏ q ( X j − X i ) for all j = 1 , … , q j=1,\ldots,q j = 1 , … , q . The first identity together with the Vieta relation
Q ( 0 ) = ( − 1 ) q ∏ j = 1 q X j Q(0)=(-1)^q\prod_{j=1}^{q}X_j Q ( 0 ) = ( − 1 ) q j = 1 ∏ q X j yields that the second equality in (4) is correct. To prove the first equality we apply the usual addition rule and obtain
∑ j = 1 q 1 X j 2 Q ′ ( X j ) = N D , \sum_{j=1}^{q}\frac{1}{X_j^2Q'(X_j)}=\frac{N}{D}, j = 1 ∑ q X j 2 Q ′ ( X j ) 1 = D N , where
N = ∑ i = 1 q ∏ j = 1 j ≠ i q ( X j 2 Q ′ ( X j ) ) , D = ( ∏ j = 1 q X j 2 ) ( ∏ j = 1 q Q ′ ( X j ) ) . N=\sum_{i=1}^{q}\prod_{\substack{j=1\\j\ne i}}^{q}\left(X_j^2Q'(X_j)\right),\qquad D=\left(\prod_{j=1}^{q}X_j^2\right)\left(\prod_{j=1}^{q}Q'(X_j)\right). N = i = 1 ∑ q j = 1 j = i ∏ q ( X j 2 Q ′ ( X j ) ) , D = ( j = 1 ∏ q X j 2 ) ( j = 1 ∏ q Q ′ ( X j ) ) . If 1 ≤ i < j ≤ q 1\le i<j\le q 1 ≤ i < j ≤ q then the multiplicity of X i − X j X_i-X_j X i − X j is one in Q ′ ( X i ) Q'(X_i) Q ′ ( X i ) and in Q ′ ( X j ) Q'(X_j) Q ′ ( X j ) , but zero in all other Q ′ ( X h ) Q'(X_h) Q ′ ( X h ) . Thus we have
N = ∑ h = 1 h ≠ i , j q ∏ k = 1 k ≠ h q ( X k 2 Q ′ ( X k ) ) + ( X i − X j ) ( X i 2 ∏ h = 1 h ≠ i , j q ( X i − X h ) − X j 2 ∏ h = 1 h ≠ i , j q ( X j − X h ) ) V , N=\sum_{\substack{h=1\\h\ne i,j}}^{q}\prod_{\substack{k=1\\k\ne h}}^{q}\left(X_k^2Q'(X_k)\right)+(X_i-X_j)\left(X_i^2\prod_{\substack{h=1\\h\ne i,j}}^{q}(X_i-X_h)-X_j^2\prod_{\substack{h=1\\h\ne i,j}}^{q}(X_j-X_h)\right)V, N = h = 1 h = i , j ∑ q k = 1 k = h ∏ q ( X k 2 Q ′ ( X k ) ) + ( X i − X j ) X i 2 h = 1 h = i , j ∏ q ( X i − X h ) − X j 2 h = 1 h = i , j ∏ q ( X j − X h ) V , because X i − X j X_i-X_j X i − X j appears as X j − X i = − ( X i − X j ) X_j-X_i=-(X_i-X_j) X j − X i = − ( X i − X j ) in Q ′ ( X j ) Q'(X_j) Q ′ ( X j ) . In the last expression
V = ∏ h = 1 h ≠ i , j q ( X h 2 Q ′ ( X h ) ) . V=\prod_{\substack{h=1\\h\ne i,j}}^{q}\left(X_h^2Q'(X_h)\right). V = h = 1 h = i , j ∏ q ( X h 2 Q ′ ( X h ) ) . With the notation
T ( X ) = X 2 ∏ h = 1 h ≠ i , j q ( X − X h ) T(X)=X^2\prod_{\substack{h=1\\h\ne i,j}}^{q}(X-X_h) T ( X ) = X 2 h = 1 h = i , j ∏ q ( X − X h ) we see that the expression in the large brackets is T ( X i ) − T ( X j ) T(X_i)-T(X_j) T ( X i ) − T ( X j ) , which is plainly divisible by ( X i − X j ) (X_i-X_j) ( X i − X j ) . For $1\le i_1<j_1\le q$, 1 ≤ i 2 < j 2 ≤ q 1\le i_2<j_2\le q 1 ≤ i 2 < j 2 ≤ q and $(i_1,j_1)\ne(i_2,j_2)
the polynomials X i 1 − X j 1 X_{i_1}-X_{j_1} X i 1 − X j 1 and X i 2 − X j 2 X_{i_2}-X_{j_2} X i 2 − X j 2 are coprime in Z [ X 1 , … , X q ] \mathbb{Z}[X_1,\ldots,X_q] Z [ X 1 , … , X q ] , thus the polynomial
U = ∏ 1 ≤ i < j ≤ q ( X i − X j ) 2 U=\prod_{1\le i<j\le q}(X_i-X_j)^2 U = 1 ≤ i < j ≤ q ∏ ( X i − X j ) 2
divides the second summand of N N N , but it divides the first summand too, because in the product ∏ k ≠ h q ( X k 2 Q ′ ( X k ) ) \prod_{k\ne h}^{q}(X_k^2Q'(X_k)) ∏ k = h q ( X k 2 Q ′ ( X k )) , h ≠ i , j h\ne i,j h = i , j both Q ′ ( X i ) Q'(X_i) Q ′ ( X i ) and Q ′ ( X j ) Q'(X_j) Q ′ ( X j ) appear, thus the multiplicity of X i − X j X_i-X_j X i − X j is two. Hence the polynomial U U U divides N N N , but it is, up to sign, equal to ∏ j = 1 q Q ′ ( X j ) \prod_{j=1}^{q}Q'(X_j) ∏ j = 1 q Q ′ ( X j ) , which is the second factor in D D D , thus it is a common factor of N N N and D D D .
It remains to compute the quotient N / U ∈ Z [ X 1 , … , X q ] N/U\in\mathbb{Z}[X_1,\ldots,X_q] N / U ∈ Z [ X 1 , … , X q ] . Both polynomials N N N and U U U are symmetric in their variables, thus N / U N/U N / U is a symmetric polynomial too. The degree of X i X_i X i in N N N is 2 q − 1 2q-1 2 q − 1 because for h ≠ i h\ne i h = i the summand is ∏ j ≠ h q X j 2 Q ′ ( X j ) \prod_{j\ne h}^{q}X_j^2Q'(X_j) ∏ j = h q X j 2 Q ′ ( X j ) , i.e. X i X_i X i appears q + 1 q+1 q + 1 -times in X i 2 Q ′ ( X i ) X_i^2Q'(X_i) X i 2 Q ′ ( X i ) and one time in all other factors X j 2 Q ′ ( X j ) X_j^2Q'(X_j) X j 2 Q ′ ( X j ) , which number is q − 2 q-2 q − 2 . On the other hand X i X_i X i appears in exactly 2 ( q − 1 ) 2(q-1) 2 ( q − 1 ) factors of U U U , i.e. its degree in U U U is 2 q − 2 2q-2 2 q − 2 . Hence N / U N/U N / U is a symmetric polynomial, which is linear in all variables.
Next we compare the maximum of the total degrees of the monomials in N N N and U U U . The monomials in U U U have the same total degree q ( q − 1 ) q(q-1) q ( q − 1 ) because it is the product of q ( q − 1 ) q(q-1) q ( q − 1 ) linear polynomials. The monomials in X j 2 Q ′ ( X j ) X_j^2Q'(X_j) X j 2 Q ′ ( X j ) have total degree q − 1 + 2 = q + 1 q-1+2=q+1 q − 1 + 2 = q + 1 . The product of q − 1 q-1 q − 1 such polynomials has total degree ( q − 1 ) ( q + 1 ) = q 2 − 1 (q-1)(q+1)=q^2-1 ( q − 1 ) ( q + 1 ) = q 2 − 1 , which is an upper bound for the total degree of N N N . On the other hand the monomial ( X 2 ⋯ X q ) q + 1 (X_2\cdots X_q)^{q+1} ( X 2 ⋯ X q ) q + 1 with total degree q 2 − 1 q^2-1 q 2 − 1 appears only in the first summand of N N N , hence it is a monomial in N N N .
The consequence of the last two paragraphs is that the total degree of N / U N/U N / U is q 2 − 1 − ( q 2 − q ) = q − 1 q^2-1-(q^2-q)=q-1 q 2 − 1 − ( q 2 − q ) = q − 1 , thus every monomial in N / U N/U N / U is the product of q − 1 q-1 q − 1 indeterminates. On the other hand N / U N/U N / U is linear in all indeterminates, i.e.
N U = ∑ i = 1 q ∏ j = 1 j ≠ i q X j . \frac{N}{U}=\sum_{i=1}^{q}\prod_{\substack{j=1\\j\ne i}}^{q}X_j. U N = i = 1 ∑ q j = 1 j = i ∏ q X j .
To finish the proof we have to show that the sign on the right hand side of (4) is correct. Multiplying (4) by ∏ j = 1 q X j 2 \prod_{j=1}^{q}X_j^2 ∏ j = 1 q X j 2 the left hand side becomes
∑ j = 1 q ∏ i ≠ j q X i 2 Q ′ ( X j ) . \sum_{j=1}^{q}\frac{\prod_{i\ne j}^{q}X_i^2}{Q'(X_j)}. j = 1 ∑ q Q ′ ( X j ) ∏ i = j q X i 2 .
Substituting X q = 0 X_q=0 X q = 0 only the term with j = q j=q j = q remains because in all other summands X q X_q X q appear as a factor. Further, as Q ′ ( X q ) = Q ′ ( 0 ) = ( − 1 ) q − 1 ∏ j = 1 q − 1 X j Q'(X_q)=Q'(0)=(-1)^{q-1}\prod_{j=1}^{q-1}X_j Q ′ ( X q ) = Q ′ ( 0 ) = ( − 1 ) q − 1 ∏ j = 1 q − 1 X j , we obtain that the left hand side is ( − 1 ) q − 1 ∏ j = 1 q − 1 X j (-1)^{q-1}\prod_{j=1}^{q-1}X_j ( − 1 ) q − 1 ∏ j = 1 q − 1 X j . Substituting X q = 0 X_q=0 X q = 0 in the expression staying on the right hand side we obtain the same result, i.e. the sign is correct. □
Corollary 2. We have
α 1 ( u ) ⋯ α q ( u ) = ( − 1 ) q Q ( 0 ) − Q ′ ( 0 ) Q ( 0 ) u + o ( 1 u ) . \alpha_1(u)\cdots\alpha_q(u)=(-1)^qQ(0)-\frac{Q'(0)}{Q(0)u}+o\left(\frac{1}{u}\right). α 1 ( u ) ⋯ α q ( u ) = ( − 1 ) q Q ( 0 ) − Q ( 0 ) u Q ′ ( 0 ) + o ( u 1 ) .
Proof. For any ε > 0 \varepsilon> 0 ε > 0 there exists by Lemma 1 (ii) an u 0 ( ε ) u_0(\varepsilon) u 0 ( ε ) such that for all u > u 0 ( ε ) u > u_0(\varepsilon) u > u 0 ( ε ) there are δ j \delta_j δ j with ∣ δ j ∣ < ε |\delta_j| < \varepsilon ∣ δ j ∣ < ε such that
α j ( u ) = β j + b j u + δ j u , j = 0 , … , q , \alpha_j(u) = \beta_j + \frac{b_j}{u} + \frac{\delta_j}{u}, \qquad j = 0,\ldots,q, α j ( u ) = β j + u b j + u δ j , j = 0 , … , q ,
with the b j b_j b j given in the lemma. After multiplying for j = 1 , … , q j = 1,\ldots,q j = 1 , … , q the left and right hand sides of these equations we obtain
∏ j = 1 q α j ( u ) = ∏ j = 1 q ( β j + 1 u ( ∑ j = 1 q b j ∏ h = 1 h ≠ j q β h ) + δ u ) . \prod_{j=1}^{q}\alpha_j(u) = \prod_{j=1}^{q}\left(\beta_j + \frac{1}{u}\left(\sum_{j=1}^{q}b_j\prod_{\substack{h=1\\h\ne j}}^{q}\beta_h\right) + \frac{\delta}{u}\right). j = 1 ∏ q α j ( u ) = j = 1 ∏ q β j + u 1 j = 1 ∑ q b j h = 1 h = j ∏ q β h + u δ .
where ∣ δ ∣ ≤ ε H |\delta| \le\varepsilon H ∣ δ ∣ ≤ ε H , and H H H is bounded by a quantity depending only on q q q and β 1 , … , β q \beta_1,\ldots,\beta_q β 1 , … , β q . Using the expressions for the b i b_i b i and that
( − 1 ) q ∏ h = 1 q β h = Q ( 0 ) (-1)^q\prod_{h=1}^{q}\beta_h = Q(0) ( − 1 ) q h = 1 ∏ q β h = Q ( 0 )
we can rewrite the expression in the large brackets as
( − 1 ) q Q ( 0 ) ∑ j = 1 q 1 β h 2 Q ′ ( β h ) . (-1)^qQ(0)\sum_{j=1}^{q}\frac{1}{\beta_h^2Q'(\beta_h)}. ( − 1 ) q Q ( 0 ) j = 1 ∑ q β h 2 Q ′ ( β h ) 1 .
The sum is, by Lemma 2 , equal to ( − 1 ) q − 1 Q ′ ( 0 ) / Q 2 ( 0 ) (-1)^{q-1}Q'(0)/Q^2(0) ( − 1 ) q − 1 Q ′ ( 0 ) / Q 2 ( 0 ) , hence the last expression simplifies to ( − 1 ) q Q ( 0 ) ( − 1 ) q − 1 Q ′ ( 0 ) / Q 2 ( 0 ) = − Q ′ ( 0 ) / Q ( 0 ) (-1)^qQ(0)(-1)^{q-1}Q'(0)/Q^2(0) = -Q'(0)/Q(0) ( − 1 ) q Q ( 0 ) ( − 1 ) q − 1 Q ′ ( 0 ) / Q 2 ( 0 ) = − Q ′ ( 0 ) / Q ( 0 ) .
Corollary 3. There exist integers J , r > 0 J,r > 0 J , r > 0 , and π j , μ j ∈ C \pi_j,\mu_j \in\mathbb{C} π j , μ j ∈ C , j ≥ J j \ge J j ≥ J , π J ≠ 0 \pi_J \ne0 π J = 0 such that
1 Q ( 0 ) α 0 ( u ) α q + 1 ( u ) = 1 + π J u J / r + ∑ j = J + 1 ∞ π j u j / r , \frac{1}{Q(0)\alpha_0(u)\alpha_{q+1}(u)} = 1 + \frac{\pi_J}{u^{J/r}} + \sum_{j=J+1}^{\infty}\frac{\pi_j}{u^{j/r}}, Q ( 0 ) α 0 ( u ) α q + 1 ( u ) 1 = 1 + u J / r π J + j = J + 1 ∑ ∞ u j / r π j , Q ( 0 ) α 0 ( u ) α q + 1 ( u ) = 1 − π J u J / r + ∑ j = J + 1 ∞ μ j u j / r . Q(0)\alpha_0(u)\alpha_{q+1}(u) = 1 - \frac{\pi_J}{u^{J/r}} + \sum_{j=J+1}^{\infty}\frac{\mu_j}{u^{j/r}}. Q ( 0 ) α 0 ( u ) α q + 1 ( u ) = 1 − u J / r π J + j = J + 1 ∑ ∞ u j / r μ j . Both series are convergent if u > u 3 u > u_3 u > u 3 .
Proof. The identity α 0 ( u ) ⋯ α q + 1 ( u ) = ( − 1 ) q + 2 = ( − 1 ) q \alpha_0(u)\cdots\alpha_{q+1}(u) = (-1)^{q+2} = (-1)^q α 0 ( u ) ⋯ α q + 1 ( u ) = ( − 1 ) q + 2 = ( − 1 ) q and Corollary 2 yield
1 α 0 ( u ) α q + 1 ( u ) = α 1 ( u ) ⋯ α q ( u ) ( − 1 ) q = Q ( 0 ) + ( − 1 ) q + 1 Q ′ ( 0 ) Q ( 0 ) u + o ( 1 u ) . (5) \frac{1}{\alpha_0(u)\alpha_{q+1}(u)} = \frac{\alpha_1(u)\cdots\alpha_q(u)}{(-1)^q} = Q(0) + \frac{(-1)^{q+1}Q'(0)}{Q(0)u} + o\left(\frac{1}{u}\right). \tag*{(5)} α 0 ( u ) α q + 1 ( u ) 1 = ( − 1 ) q α 1 ( u ) ⋯ α q ( u ) = Q ( 0 ) + Q ( 0 ) u ( − 1 ) q + 1 Q ′ ( 0 ) + o ( u 1 ) . (5)
The functions α i ( u ) \alpha_i(u) α i ( u ) , i = 0 , … , q + 1 i = 0,\ldots,q+1 i = 0 , … , q + 1 are algebraic, hence α 0 ( u ) α q + 1 ( u ) \alpha_0(u)\alpha_{q+1}(u) α 0 ( u ) α q + 1 ( u ) and 1 / α 0 ( u ) α q + 1 ( u ) 1/\alpha_0(u)\alpha_{q+1}(u) 1/ α 0 ( u ) α q + 1 ( u ) are algebraic too, which are by Lemma 1 (iii) real for u > u 0 u > u_0 u > u 0 . Hence, by Proposition 1 there are N ∈ Z N \in\mathbb{Z} N ∈ Z , π j ′ ∈ R \pi'_j \in\mathbb{R} π j ′ ∈ R , j ≥ N j \ge N j ≥ N , π N ′ ≠ 0 \pi'_N \ne0 π N ′ = 0 and 1 ≤ r ∈ Z 1 \le r \in\mathbb{Z} 1 ≤ r ∈ Z such that
1 α 0 ( u ) α q + 1 ( u ) = ∑ j = N ∞ π j ′ u − j / r . \frac{1}{\alpha_0(u)\alpha_{q+1}(u)} = \sum_{j=N}^{\infty}\pi'_j u^{-j/r}. α 0 ( u ) α q + 1 ( u ) 1 = j = N ∑ ∞ π j ′ u − j / r .
Comparing this with (5) we see that N = 0 N = 0 N = 0 , π 0 ′ = Q ( 0 ) \pi'_0 = Q(0) π 0 ′ = Q ( 0 ) and π j ′ = 0 \pi'_j = 0 π j ′ = 0 for j = 1 , … , r − 1 j = 1,\ldots,r-1 j = 1 , … , r − 1 . Let J J J be the smallest positive index with π J ′ ≠ 0 \pi'_J \ne0 π J ′ = 0 , then
1 α 0 ( u ) α q + 1 ( u ) = Q ( 0 ) + π J ′ u J / r + ∑ j = J + 1 ∞ π j ′ u j / r . \frac{1}{\alpha_0(u)\alpha_{q+1}(u)} = Q(0) + \frac{\pi'_J}{u^{J/r}} + \sum_{j=J+1}^{\infty}\frac{\pi'_j}{u^{j/r}}. α 0 ( u ) α q + 1 ( u ) 1 = Q ( 0 ) + u J / r π J ′ + j = J + 1 ∑ ∞ u j / r π j ′ .
After division by Q ( 0 ) ≠ 0 Q(0) \ne0 Q ( 0 ) = 0 we get the first assertion with π j = π j ′ / Q ( 0 ) \pi_j = \pi'_j/Q(0) π j = π j ′ / Q ( 0 ) , j = 0 , 1 , … j = 0,1,\ldots j = 0 , 1 , … . If Q ′ ( 0 ) ≠ 0 Q'(0) \ne0 Q ′ ( 0 ) = 0 then J = r J = r J = r and π J = ( − 1 ) q + 1 Q ′ ( 0 ) / Q ( 0 ) 2 \pi_J = (-1)^{q+1}Q'(0)/Q(0)^2 π J = ( − 1 ) q + 1 Q ′ ( 0 ) / Q ( 0 ) 2 . The algebraic function Q ( 0 ) α 0 ( u ) α q + 1 ( u ) Q(0)\alpha_0(u)\alpha_{q+1}(u) Q ( 0 ) α 0 ( u ) α q + 1 ( u ) admits a Puiseux expansion too. The main term of its expansion is 1. Assume that
Q ( 0 ) α 0 ( u ) α q + 1 ( u ) = 1 + μ K u K / r + ∑ j = K + 1 ∞ μ j u j / r , Q(0)\alpha_0(u)\alpha_{q+1}(u)=1+\frac{\mu_K}{u^{K/r}}+\sum_{j=K+1}^{\infty}\frac{\mu_j}{u^{j/r}}, Q ( 0 ) α 0 ( u ) α q + 1 ( u ) = 1 + u K / r μ K + j = K + 1 ∑ ∞ u j / r μ j ,
where K K K denotes the smallest positive index with μ K ≠ 0 \mu_K\ne0 μ K = 0 . Multiplying the last two equations we get
1 = ( 1 + π J u J / r + ⋯ ) ( 1 + μ K u K / r + ⋯ ) = 1 + μ K u K / r + π J u J / r + ⋯ , \begin{aligned}
1&=\left(1+\frac{\pi_J}{u^{J/r}}+\cdots\right)\left(1+\frac{\mu_K}{u^{K/r}}+\cdots\right)\\
&=1+\frac{\mu_K}{u^{K/r}}+\frac{\pi_J}{u^{J/r}}+\cdots,
\end{aligned} 1 = ( 1 + u J / r π J + ⋯ ) ( 1 + u K / r μ K + ⋯ ) = 1 + u K / r μ K + u J / r π J + ⋯ ,
which is only possible, when J = K J=K J = K and μ J + π J = 0 \mu_J+\pi_J=0 μ J + π J = 0 , i.e. if μ J = − π J \mu_J=-\pi_J μ J = − π J . The existence of the series is proved. Their convergence is justified by Lemma 1 of Schmidt [26 ] . □
The next corollary is a simplified, but more applicable version of Corollary 3.
Corollary 4. There exist constants κ 1 ≥ 1 \kappa_1\ge1 κ 1 ≥ 1 , π > 0 \pi>0 π > 0 , u 4 u_4 u 4 depending only on Q ( X ) Q(X) Q ( X ) such that Q ( 0 ) α 0 ( u ) > 0 Q(0)\alpha_0(u)>0 Q ( 0 ) α 0 ( u ) > 0 and either
1 + π 2 u κ 1 < 1 ∣ Q ( 0 ) α 0 ( u ) ∣ α q + 1 ( u ) < 1 + 2 π u κ 1 1+\frac{\pi}{2u^{\kappa_1}}<\frac{1}{\lvert Q(0)\alpha_0(u)\rvert\alpha_{q+1}(u)}<1+\frac{2\pi}{u^{\kappa_1}} 1 + 2 u κ 1 π < ∣ Q ( 0 ) α 0 ( u )∣ α q + 1 ( u ) 1 < 1 + u κ 1 2 π and
1 − 2 π u κ 1 < ∣ Q ( 0 ) α 0 ( u ) ∣ α q + 1 ( u ) < 1 − π 2 u κ 1 1-\frac{2\pi}{u^{\kappa_1}}<\lvert Q(0)\alpha_0(u)\rvert\alpha_{q+1}(u)<1-\frac{\pi}{2u^{\kappa_1}} 1 − u κ 1 2 π < ∣ Q ( 0 ) α 0 ( u )∣ α q + 1 ( u ) < 1 − 2 u κ 1 π or
1 − 2 π u κ 1 < 1 ∣ Q ( 0 ) α 0 ( u ) ∣ α q + 1 ( u ) < 1 − π 2 u κ 1 1-\frac{2\pi}{u^{\kappa_1}}<\frac{1}{\lvert Q(0)\alpha_0(u)\rvert\alpha_{q+1}(u)}<1-\frac{\pi}{2u^{\kappa_1}} 1 − u κ 1 2 π < ∣ Q ( 0 ) α 0 ( u )∣ α q + 1 ( u ) 1 < 1 − 2 u κ 1 π and
1 + π 2 u κ 1 < ∣ Q ( 0 ) α 0 ( u ) ∣ α q + 1 ( u ) < 1 + 2 π u κ 1 1+\frac{\pi}{2u^{\kappa_1}}<\lvert Q(0)\alpha_0(u)\rvert\alpha_{q+1}(u)<1+\frac{2\pi}{u^{\kappa_1}} 1 + 2 u κ 1 π < ∣ Q ( 0 ) α 0 ( u )∣ α q + 1 ( u ) < 1 + u κ 1 2 π hold for all u > u 4 u>u_4 u > u 4 .
Proof. An obvious consequence of Corollary 3 is that Q ( 0 ) α 0 ( u ) α q + 1 ( u ) > 0 Q(0)\alpha_0(u)\alpha_{q+1}(u)>0 Q ( 0 ) α 0 ( u ) α q + 1 ( u ) > 0 . As α q + 1 ( u ) > 0 \alpha_{q+1}(u)>0 α q + 1 ( u ) > 0 we get Q ( 0 ) α 0 ( u ) > 0 Q(0)\alpha_0(u)>0 Q ( 0 ) α 0 ( u ) > 0 . By the second assertion of Corollary 3 the Puiseux series of α 0 ( u ) α q + 1 ( u ) \alpha_0(u)\alpha_{q+1}(u) α 0 ( u ) α q + 1 ( u ) and of 1 / α 0 ( u ) α q + 1 ( u ) 1/\alpha_0(u)\alpha_{q+1}(u) 1/ α 0 ( u ) α q + 1 ( u ) are convergent, whenever u > u 0 u>u_0 u > u 0 . In particular
∣ ∑ j = J + 1 ∞ π j u j / r ∣ < ∣ π J ∣ 2 u J / r and ∣ ∑ j = J + 1 ∞ μ j u j / r ∣ < ∣ μ J ∣ 2 u J / r = ∣ π J ∣ 2 ∣ Q ( 0 ) ∣ u J / r \left|\sum_{j=J+1}^{\infty}\frac{\pi_j}{u^{j/r}}\right|<\frac{|\pi_J|}{2u^{J/r}}
\quad\text{and}\quad
\left|\sum_{j=J+1}^{\infty}\frac{\mu_j}{u^{j/r}}\right|<\frac{|\mu_J|}{2u^{J/r}}=\frac{|\pi_J|}{2|Q(0)|u^{J/r}} j = J + 1 ∑ ∞ u j / r π j < 2 u J / r ∣ π J ∣ and j = J + 1 ∑ ∞ u j / r μ j < 2 u J / r ∣ μ J ∣ = 2∣ Q ( 0 ) ∣ u J / r ∣ π J ∣
hold for all u > u 0 u>u_0 u > u 0 . If π J > 0 \pi_J>0 π J > 0 then 1 / ∣ Q ( 0 ) α 0 ( u ) ∣ α q + 1 ( u ) > 1 1/|Q(0)\alpha_0(u)|\alpha_{q+1}(u)>1 1/∣ Q ( 0 ) α 0 ( u ) ∣ α q + 1 ( u ) > 1 and we obtain the first alternative with π = π J \pi=\pi_J π = π J and κ 1 = J / r \kappa_1=J/r κ 1 = J / r . The opposite case yields the second alternative, with π = − π J \pi=-\pi_J π = − π J and κ 1 = J / r \kappa_1=J/r κ 1 = J / r . □
Now we are enough equipped to prove Lemma 1 (v).
Proof of Lemma 1 (v). Assume that u ≥ u 1 u\ge u_1 u ≥ u 1 and α 0 ( u ) \alpha_0(u) α 0 ( u ) , α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) are multiplicatively dependent, i.e. there exist integers a , b a,b a , b at least one of them non-zero, such that α 0 a ( u ) α q + 1 b ( u ) = 1 \alpha_0^a(u)\alpha_{q+1}^b(u)=1 α 0 a ( u ) α q + 1 b ( u ) = 1 . If b < 0 b<0 b < 0 then α 0 − a ( u ) α q + 1 − b ( u ) = 1 \alpha_0^{-a}(u)\alpha_{q+1}^{-b}(u)=1 α 0 − a ( u ) α q + 1 − b ( u ) = 1 , which is an analogous equation, but with − b > 0 -b>0 − b > 0 . Hence we may assume b ≥ 0 b\ge0 b ≥ 0 in the sequel. By Lemma 1 (iv) the polynomial P u ( X ) P_u(X) P u ( X ) is irreducible. If b = 0 b=0 b = 0 then α 0 ( u ) \alpha_0(u) α 0 ( u ) is a root of unity, but this is impossible by the irreducibility of P u ( X ) P_u(X) P u ( X ) . Similarly a ≠ 0 a\ne0 a = 0 . Hence b > 0 b>0 b > 0 and a ≠ 0 a\ne0 a = 0 .
The case a < 0 , b > 0 a<0,b>0 a < 0 , b > 0 is impossible, because ∣ α 0 ( u ) ∣ < 1 |\alpha_0(u)|<1 ∣ α 0 ( u ) ∣ < 1 and ∣ α q + 1 ( u ) ∣ > 1 |\alpha_{q+1}(u)|>1 ∣ α q + 1 ( u ) ∣ > 1 , thus ∣ α 0 a ( u ) α q + 1 b ( u ) ∣ > 1 |\alpha_0^a(u)\alpha_{q+1}^b(u)|>1 ∣ α 0 a ( u ) α q + 1 b ( u ) ∣ > 1 , contradicting the assumption.
If a = b a=b a = b then ( α 0 ( u ) α q + 1 ( u ) ) a = 1 (\alpha_0(u)\alpha_{q+1}(u))^a=1 ( α 0 ( u ) α q + 1 ( u ) ) a = 1 , which yields ∣ α 0 ( u ) α q + 1 ( u ) ∣ = 1 |\alpha_0(u)\alpha_{q+1}(u)|=1 ∣ α 0 ( u ) α q + 1 ( u ) ∣ = 1 , but this contradicts Corollary 4.
Denote Σ \Sigma Σ the Galois group of the normal closure of Q ( α 0 ( u ) ) \mathbb{Q}(\alpha_0(u)) Q ( α 0 ( u )) . If there is an element σ ∈ Σ \sigma\in\Sigma σ ∈ Σ , which swaps α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) and α 0 ( u ) \alpha_0(u) α 0 ( u ) , then
1 = σ ( α 0 a ( u ) α q + 1 b ( u ) ) = σ ( α 0 ( u ) ) a σ ( α q + 1 ( u ) ) b = α q + 1 a ( u ) α 0 b ( u ) . 1=\sigma(\alpha_0^a(u)\alpha_{q+1}^b(u))=\sigma(\alpha_0(u))^a\sigma(\alpha_{q+1}(u))^b=\alpha_{q+1}^a(u)\alpha_0^b(u). 1 = σ ( α 0 a ( u ) α q + 1 b ( u )) = σ ( α 0 ( u ) ) a σ ( α q + 1 ( u ) ) b = α q + 1 a ( u ) α 0 b ( u ) .
This together with the original equation yields
( α 0 ( u ) α q + 1 ( u ) ) a + b = 1 , (\alpha_0(u)\alpha_{q+1}(u))^{a+b}=1, ( α 0 ( u ) α q + 1 ( u ) ) a + b = 1 ,
which was excluded earlier.
It remains to deal with the case when a , b > 0 a,b>0 a , b > 0 and no elements of Σ \Sigma Σ swaps α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) and α 0 ( u ) \alpha_0(u) α 0 ( u ) . We distinguish two cases: 0 < a < b 0<a<b 0 < a < b and 0 < b < a 0<b<a 0 < b < a .
We assume first 0 < a < b 0<a<b 0 < a < b . As the size of Σ \Sigma Σ is at least q + 2 ≥ 3 q+2\ge3 q + 2 ≥ 3 there is an element σ ∈ Σ \sigma\in\Sigma σ ∈ Σ , for which σ ( α q + 1 ( u ) ) = α 0 ( u ) \sigma(\alpha_{q+1}(u))=\alpha_0(u) σ ( α q + 1 ( u )) = α 0 ( u ) and σ ( α 0 ( u ) ) = α j ( u ) \sigma(\alpha_0(u))=\alpha_j(u) σ ( α 0 ( u )) = α j ( u ) , j ≠ 0 , q + 1 j\ne0,q+1 j = 0 , q + 1 . Now we have
1 = σ ( α 0 a ( u ) α q + 1 b ( u ) ) = α j a ( u ) α 0 b ( u ) = ( α j ( u ) α 0 ( u ) ) a α 0 b − a ( u ) , 1=\sigma(\alpha_0^a(u)\alpha_{q+1}^b(u))=\alpha_j^a(u)\alpha_0^b(u)=(\alpha_j(u)\alpha_0(u))^a\alpha_0^{b-a}(u), 1 = σ ( α 0 a ( u ) α q + 1 b ( u )) = α j a ( u ) α 0 b ( u ) = ( α j ( u ) α 0 ( u ) ) a α 0 b − a ( u ) ,
but this is impossible because ∣ α 0 ( u ) α j ( u ) ∣ < 1 |\alpha_0(u)\alpha_j(u)|<1 ∣ α 0 ( u ) α j ( u ) ∣ < 1 and ∣ α 0 ( u ) ∣ < 1 |\alpha_0(u)|<1 ∣ α 0 ( u ) ∣ < 1 whenever u u u is large enough.
In the second case, i.e. if 0 < b < a 0<b<a 0 < b < a we choose a σ ∈ Σ \sigma\in\Sigma σ ∈ Σ , for which σ ( α 0 ( u ) ) = α q + 1 ( u ) \sigma(\alpha_0(u))=\alpha_{q+1}(u) σ ( α 0 ( u )) = α q + 1 ( u ) , and σ ( α q + 1 ( u ) ) = α j ( u ) \sigma(\alpha_{q+1}(u))=\alpha_j(u) σ ( α q + 1 ( u )) = α j ( u ) , j ≠ 0 , q + 1 j\ne0,q+1 j = 0 , q + 1 . Now we have
1 = σ ( α 0 a ( u ) α q + 1 b ( u ) ) = α q + 1 a ( u ) α j b ( u ) = α q + 1 a − b ( u ) ( α 0 ( u ) α j ( u ) ) b , 1=\sigma(\alpha_0^a(u)\alpha_{q+1}^b(u))=\alpha_{q+1}^a(u)\alpha_j^b(u)=\alpha_{q+1}^{a-b}(u)(\alpha_0(u)\alpha_j(u))^b, 1 = σ ( α 0 a ( u ) α q + 1 b ( u )) = α q + 1 a ( u ) α j b ( u ) = α q + 1 a − b ( u ) ( α 0 ( u ) α j ( u ) ) b ,
but this is impossible because ∣ α j ( u ) α q + 1 ( u ) ∣ > 1 |\alpha_j(u)\alpha_{q+1}(u)|>1 ∣ α j ( u ) α q + 1 ( u ) ∣ > 1 and ∣ α q + 1 ( u ) ∣ > 1 |\alpha_{q+1}(u)|>1 ∣ α q + 1 ( u ) ∣ > 1 whenever u u u is large enough.□
Properties of the ABC sequences
Now we turn to the study of ( A n ( u ) ) (A_n(u)) ( A n ( u )) . We assume throughout this section that at least one of A 0 , … , A q + 1 A_0,\ldots,A_{q+1} A 0 , … , A q + 1 is non-zero. In the Introduction, more precisely by (2) the sequence ( A n ( u ) ) (A_n(u)) ( A n ( u )) is defined for non-negative indices, but we pointed out that it can be extended uniquely for negatives too, such that all members of the two-directional sequence are polynomials with integer coefficients. This is a consequence of the next lemma, which shows that ( A n ( u ) ) (A_n(u)) ( A n ( u )) is a linear recursive sequence with integer coefficients for negative indices too.
Lemma 3. If the characteristic polynomial of the sequence ( A n ( u ) ) (A_n(u)) ( A n ( u )) , n ≥ 0 n\ge0 n ≥ 0 is P u ( X ) P_u(X) P u ( X ) then it is a linear recursive sequence for n < 0 n<0 n < 0 too with the characteristic polynomial X q + 2 P u ( 1 / X ) X^{q+2}P_u(1/X) X q + 2 P u ( 1/ X ) .
Proof. Set p 0 ( u ) = p q + 2 ( u ) = 1 p_0(u)=p_{q+2}(u)=1 p 0 ( u ) = p q + 2 ( u ) = 1 and add p 0 ( u ) A n − q − 2 ( u ) − A n ( u ) = A n − q − 2 ( u ) − p q + 2 ( u ) A n ( u ) p_0(u)A_{n-q-2}(u)-A_n(u)=A_{n-q-2}(u)-p_{q+2}(u)A_n(u) p 0 ( u ) A n − q − 2 ( u ) − A n ( u ) = A n − q − 2 ( u ) − p q + 2 ( u ) A n ( u ) to both sides of (2), then, after rearrangement of the RHS, we get
A n − q − 2 ( u ) = − p 1 ( u ) A n − q − 1 ( u ) − … − p q + 1 ( u ) A n − 1 ( u ) − p q + 2 ( u ) A n ( u ) . A_{n-q-2}(u)=-p_1(u)A_{n-q-1}(u)-\ldots-p_{q+1}(u)A_{n-1}(u)-p_{q+2}(u)A_n(u). A n − q − 2 ( u ) = − p 1 ( u ) A n − q − 1 ( u ) − … − p q + 1 ( u ) A n − 1 ( u ) − p q + 2 ( u ) A n ( u ) .
The substitution n − q − 2 = − m n-q-2=-m n − q − 2 = − m yields
A − m ( u ) = − p 1 ( u ) A − ( m − 1 ) ( u ) − … − p q + 1 ( u ) A − ( m − q − 1 ) ( u ) − p q + 2 ( u ) A − ( m − q − 2 ) ( u ) , A_{-m}(u)=-p_1(u)A_{-(m-1)}(u)-\ldots-p_{q+1}(u)A_{-(m-q-1)}(u)-p_{q+2}(u)A_{-(m-q-2)}(u), A − m ( u ) = − p 1 ( u ) A − ( m − 1 ) ( u ) − … − p q + 1 ( u ) A − ( m − q − 1 ) ( u ) − p q + 2 ( u ) A − ( m − q − 2 ) ( u ) ,
and the lemma is proved. □ \square □
Although the members of ( A n ( u ) ) (A_n(u)) ( A n ( u )) satisfy a linear relation, they grow typically exponentially. The Binet formula express this unexpected phenomena, see e.g. Theorem C.1 in [27 ] . Assume that u ≥ u 1 u \ge u_1 u ≥ u 1 then (i) of Lemma 1 holds, i.e. α 0 ( u ) , … , α q + 1 ( u ) \alpha_0(u),\ldots,\alpha_{q+1}(u) α 0 ( u ) , … , α q + 1 ( u ) are pairwise different. By the just quoted theorem there exist uniquely determined functions a 0 ( u ) , … , a q + 1 ( u ) a_0(u),\ldots,a_{q+1}(u) a 0 ( u ) , … , a q + 1 ( u ) , which belong for any fixed u u u to the algebraic number field Q ( α 0 ( u ) , … , α q + 1 ( u ) ) \mathbb{Q}(\alpha_0(u),\ldots,\alpha_{q+1}(u)) Q ( α 0 ( u ) , … , α q + 1 ( u )) such that
A n ( u ) = a 0 ( u ) α 0 ( u ) n + ⋯ + a q + 1 ( u ) α q + 1 ( u ) n (6) A_n(u)=a_0(u)\alpha_0(u)^n+\cdots+a_{q+1}(u)\alpha_{q+1}(u)^n \tag*{(6)} A n ( u ) = a 0 ( u ) α 0 ( u ) n + ⋯ + a q + 1 ( u ) α q + 1 ( u ) n (6)
holds for all n ∈ Z n\in\mathbb{Z} n ∈ Z . The next lemma describes properties of the weights in the Binet formula. Denote ( b 1 , … , b d ) (\mathbf{b}_1,\ldots,\mathbf{b}_d) ( b 1 , … , b d ) the matrix having columns b 1 , … , b d \mathbf{b}_1,\ldots,\mathbf{b}_d b 1 , … , b d . Further set
A = ( A 0 , … , A q + 1 ) t , v j = ( α j ( u ) 0 , … , α j ( u ) q + 1 ) t , j = 0 , … , q + 1 , D ( u ) = det ( v 0 , … , v q + 1 ) and D j ( u ) = det ( v 0 , … , v j − 1 , A , v j + 1 , … , v q + 1 ) , j = 0 , … , q + 1. \begin{aligned}
\mathbf{A} &= (A_0,\ldots,A_{q+1})^t,\\
\mathbf{v}_j &= (\alpha_j(u)^0,\ldots,\alpha_j(u)^{q+1})^t,\quad j=0,\ldots,q+1,\\
D(u) &= \det(\mathbf{v}_0,\ldots,\mathbf{v}_{q+1})\quad\text{and}\\
D_j(u) &= \det(\mathbf{v}_0,\ldots,\mathbf{v}_{j-1},\mathbf{A},\mathbf{v}_{j+1},\ldots,\mathbf{v}_{q+1}),\quad j=0,\ldots,q+1.
\end{aligned} A v j D ( u ) D j ( u ) = ( A 0 , … , A q + 1 ) t , = ( α j ( u ) 0 , … , α j ( u ) q + 1 ) t , j = 0 , … , q + 1 , = det ( v 0 , … , v q + 1 ) and = det ( v 0 , … , v j − 1 , A , v j + 1 , … , v q + 1 ) , j = 0 , … , q + 1.
Lemma 4. The following assertions are true for all u 1 < u ∈ Z u_1<u\in\mathbb{Z} u 1 < u ∈ Z
(i) a j ( u ) ≠ 0 a_j(u)\ne0 a j ( u ) = 0 for all j = 0 , … , q + 1 j=0,\ldots,q+1 j = 0 , … , q + 1 ,
(ii) If for some 0 ≤ j ≤ q + 1 0\le j\le q+1 0 ≤ j ≤ q + 1 the function α j ( u ) \alpha_j(u) α j ( u ) is real, then a j ( u ) a_j(u) a j ( u ) is real too. Especially a 0 ( u ) a_0(u) a 0 ( u ) and a q + 1 ( u ) a_{q+1}(u) a q + 1 ( u ) are real,
(iii)
a q + 1 ( u ) a 0 ( u ) = D q + 1 ( u ) D 0 ( u ) . \frac{a_{q+1}(u)}{a_0(u)}=\frac{D_{q+1}(u)}{D_0(u)}. a 0 ( u ) a q + 1 ( u ) = D 0 ( u ) D q + 1 ( u ) . (iii) Denote Σ \Sigma Σ the Galois group of the normal closure of Q ( α 0 ( u ) ) \mathbb{Q}(\alpha_0(u)) Q ( α 0 ( u )) . If σ ∈ Σ \sigma\in\Sigma σ ∈ Σ swaps α i ( u ) \alpha_i(u) α i ( u ) and α j ( u ) \alpha_j(u) α j ( u ) for some 0 ≤ i ≤ j ≤ q + 1 0\le i\le j\le q+1 0 ≤ i ≤ j ≤ q + 1 then σ ( D j ( u ) ) = ± D i ( u ) \sigma(D_j(u))=\pm D_i(u) σ ( D j ( u )) = ± D i ( u ) .
Proof. Substituting n = 0 , 1 , … , q + 1 n=0,1,\ldots,q+1 n = 0 , 1 , … , q + 1 into (6) we obtain the system of linear equations
A j ( u ) = a 0 ( u ) α 0 ( u ) j + ⋯ + a q + 1 ( u ) α q + 1 ( u ) j , j = 0 , … , q + 1 A_j(u)=a_0(u)\alpha_0(u)^j+\cdots+a_{q+1}(u)\alpha_{q+1}(u)^j,\quad j=0,\ldots,q+1 A j ( u ) = a 0 ( u ) α 0 ( u ) j + ⋯ + a q + 1 ( u ) α q + 1 ( u ) j , j = 0 , … , q + 1
for the unknowns a 0 ( u ) , … , a q + 1 ( u ) a_0(u),\ldots,a_{q+1}(u) a 0 ( u ) , … , a q + 1 ( u ) . The coefficients form a Vandermonde matrix, whose determinant is D ( u ) = ∏ 0 ≤ i < j ≤ q + 1 ( α i ( u ) − α j ( u ) ) D(u)=\prod_{0\le i<j\le q+1}(\alpha_i(u)-\alpha_j(u)) D ( u ) = ∏ 0 ≤ i < j ≤ q + 1 ( α i ( u ) − α j ( u )) , which is non-zero by Lemma 1 (i). Hence the above system has unique solution. Cramer’s rule tells us, that
a j ( u ) = D j ( u ) D ( u ) . (7) a_j(u)=\frac{D_j(u)}{D(u)}. \tag*{(7)} a j ( u ) = D ( u ) D j ( u ) . (7)
By Lemma 1 (iv) P u ( X ) P_u(X) P u ( X ) is irreducible, hence the α ( u ) \alpha(u) α ( u ) ’s are algebraic conjugates. Thus the interchange of α j ( u ) \alpha_j(u) α j ( u ) and α 0 ( u ) \alpha_0(u) α 0 ( u ) is an isomorphism between the number fields Q ( α j ( u ) ) \mathbb{Q}(\alpha_j(u)) Q ( α j ( u )) and Q ( α 0 ( u ) ) \mathbb{Q}(\alpha_0(u)) Q ( α 0 ( u )) , which does not affect Q \mathbb{Q} Q . Hence, if D j ( u ) = 0 D_j(u)=0 D j ( u ) = 0 for some 0 ≤ j ≤ q + 1 0\le j\le q+1 0 ≤ j ≤ q + 1 , then D j ( u ) = 0 D_j(u)=0 D j ( u ) = 0 would hold for all 0 ≤ j ≤ q + 1 0\le j\le q+1 0 ≤ j ≤ q + 1 , i.e. A n ( u ) = 0 A_n(u)=0 A n ( u ) = 0 for all n ≥ q + 1 n\ge q+1 n ≥ q + 1 . This together with Lemma 3 implies A n ( u ) = 0 A_n(u)=0 A n ( u ) = 0 for all n ≥ 0 n\ge0 n ≥ 0 , but this contradicts the assumption regarding the initial terms. Hence (i) is true. To prove (ii) observe that we obtain the matrix of D j ( u ) D_j(u) D j ( u ) from the matrix of D ( u ) D(u) D ( u ) by replacing the real column vector v j \mathbf{v}_j v j by an other real column vector A \mathbf{A} A . The complex conjugation implies the interchange of the column vectors corresponding conjugate complex roots of P u ( X ) P_u(X) P u ( X ) , but the total number of interchanges are the same in both determinants, hence this transformation does not affect a j ( u ) a_j(u) a j ( u ) , i.e. it is a real number, and (ii) is proved.
Assertion (iii) is a direct consequence of (7) and D 0 ( u ) ≠ 0 D_0(u) \ne0 D 0 ( u ) = 0 . Now we prove (iv). By definition
D j ( u ) = det ( v 0 , … , v j − 1 , A , v j + 1 , … , v q + 1 ) , j = 0 , … , q + 1. D_j(u)=\det(\mathbf{v}_0,\ldots,\mathbf{v}_{j-1},\mathbf{A},\mathbf{v}_{j+1},\ldots,\mathbf{v}_{q+1}),\quad j=0,\ldots,q+1. D j ( u ) = det ( v 0 , … , v j − 1 , A , v j + 1 , … , v q + 1 ) , j = 0 , … , q + 1.
Let σ \sigma σ denote arbitrary element of Σ \Sigma Σ . If 0 ≤ k ≤ q + 1 0 \le k \le q+1 0 ≤ k ≤ q + 1 and σ ( α k ( u ) ) = α l ( u ) \sigma(\alpha_k(u))=\alpha_l(u) σ ( α k ( u )) = α l ( u ) then
σ ( v k ) = σ ( ( 1 , α k ( u ) , … , α k q + 1 ( u ) ) ) = ( 1 , α l ( u ) , … , α l q + 1 ( u ) ) = v l , \sigma(\mathbf{v}_k)=\sigma((1,\alpha_k(u),\ldots,\alpha_k^{q+1}(u)))=(1,\alpha_l(u),\ldots,\alpha_l^{q+1}(u))=\mathbf{v}_l, σ ( v k ) = σ (( 1 , α k ( u ) , … , α k q + 1 ( u ))) = ( 1 , α l ( u ) , … , α l q + 1 ( u )) = v l ,
hence
σ ( D j ( u ) ) = det ( σ ( v 0 ) , … , σ ( v j − 1 ) , σ ( A ) , σ ( v j + 1 ) , … , σ ( v q + 1 ) ) . \sigma(D_j(u))=\det(\sigma(\mathbf{v}_0),\ldots,\sigma(\mathbf{v}_{j-1}),\sigma(\mathbf{A}),\sigma(\mathbf{v}_{j+1}),\ldots,\sigma(\mathbf{v}_{q+1})). σ ( D j ( u )) = det ( σ ( v 0 ) , … , σ ( v j − 1 ) , σ ( A ) , σ ( v j + 1 ) , … , σ ( v q + 1 )) .
Notice that σ ( A ) = A \sigma(\mathbf{A})=\mathbf{A} σ ( A ) = A , because σ \sigma σ is the identity mapping on Q \mathbb{Q} Q . After this preparation we prove the assertion. If j = i j=i j = i then σ \sigma σ is a permutation on the set { v 0 , … , v j − 1 , v j + 1 , … , v q + 1 } \{\mathbf{v}_0,\ldots,\mathbf{v}_{j-1},\mathbf{v}_{j+1},\ldots,\mathbf{v}_{q+1}\} { v 0 , … , v j − 1 , v j + 1 , … , v q + 1 } , hence the column vectors of σ ( D j ( u ) ) \sigma(D_j(u)) σ ( D j ( u )) and D j ( u ) D_j(u) D j ( u ) are up to permutation identical, and the claim is proved in this case. If j ≠ i j\ne i j = i , then the i i i -th column of the determinant σ ( D j ( u ) ) \sigma(D_j(u)) σ ( D j ( u )) changes to v j \mathbf{v}_j v j , the j j j -th column does not change, while the other columns are a permutation of the vectors v 0 , … , v j − 1 , v j + 1 , … , v q + 1 \mathbf{v}_0,\ldots,\mathbf{v}_{j-1},\mathbf{v}_{j+1},\ldots,\mathbf{v}_{q+1} v 0 , … , v j − 1 , v j + 1 , … , v q + 1 , hence σ ( D j ( u ) ) \sigma(D_j(u)) σ ( D j ( u )) is up to permutation of its columns identical to D i D_i D i , and the claim is proved in this case too. □
In the next step we prove lower and upper bounds for ∣ D ( u ) ∣ |D(u)| ∣ D ( u ) ∣ , ∣ D 0 ( u ) ∣ |D_0(u)| ∣ D 0 ( u ) ∣ and ∣ D q + 1 ( u ) ∣ |D_{q+1}(u)| ∣ D q + 1 ( u ) ∣ .
Lemma 5. There exist easily computable constants c 1 , c 2 , c 3 , c 4 c_1,c_2,c_3,c_4 c 1 , c 2 , c 3 , c 4 depending only on the degree and the roots of Q ( X ) Q(X) Q ( X ) such that
c 1 α q + 1 ( u ) q + 1 ≤ ∣ D ( u ) ∣ ≤ c 2 α q + 1 ( u ) q + 1 (8) c_1\alpha_{q+1}(u)^{q+1}\le|D(u)|\le c_2\alpha_{q+1}(u)^{q+1} \tag*{(8)} c 1 α q + 1 ( u ) q + 1 ≤ ∣ D ( u ) ∣ ≤ c 2 α q + 1 ( u ) q + 1 (8) 1 c 3 c 4 − 1 L q α q + 1 ( u ) q − 1 ≤ ∣ D j ( u ) ∣ ≤ c 4 L α q + 1 ( u ) q + 1 , j = 0 , … , q (9) \frac{1}{c_3c_4^{-1}L^q\alpha_{q+1}(u)^{q-1}}\le|D_j(u)|\le c_4L\alpha_{q+1}(u)^{q+1},\quad j=0,\ldots,q \tag*{(9)} c 3 c 4 − 1 L q α q + 1 ( u ) q − 1 1 ≤ ∣ D j ( u ) ∣ ≤ c 4 L α q + 1 ( u ) q + 1 , j = 0 , … , q (9) 1 ( c 4 L ) q α q + 1 ( u ) q ( q + 1 ) ≤ ∣ D q + 1 ( u ) ∣ ≤ c 3 L (10) \frac{1}{(c_4L)^q\alpha_{q+1}(u)^{q(q+1)}}\le|D_{q+1}(u)|\le c_3L \tag*{(10)} ( c 4 L ) q α q + 1 ( u ) q ( q + 1 ) 1 ≤ ∣ D q + 1 ( u ) ∣ ≤ c 3 L (10) hold for all u ∈ Z u\in\mathbb{Z} u ∈ Z , provided P u ( X ) P_u(X) P u ( X ) is irreducible.
Remark 1. If u ≥ u 1 u\ge u_1 u ≥ u 1 then P u ( X ) P_u(X) P u ( X ) is irreducible by (iv) of Lemma 1.
Proof. If P u ( X ) P_u(X) P u ( X ) is irreducible, then α 0 ( u ) , … , α q + 1 ( u ) \alpha_0(u),\ldots,\alpha_{q+1}(u) α 0 ( u ) , … , α q + 1 ( u ) are pairwise distinct complex numbers, and by Lemma 4 the determinants D ( u ) , D j ( u ) D(u),D_j(u) D ( u ) , D j ( u ) , j = 0 , … , q + 1 j=0,\ldots,q+1 j = 0 , … , q + 1 are non-zero.
We know that D ( u ) D(u) D ( u ) is a Vandermonde determinant, more exactly
D ( u ) = ∏ 0 ≤ i < j ≤ q + 1 ( α i ( u ) − α j ( u ) ) . D(u)=\prod_{0\le i<j\le q+1}(\alpha_i(u)-\alpha_j(u)). D ( u ) = 0 ≤ i < j ≤ q + 1 ∏ ( α i ( u ) − α j ( u )) .
hence
∣ D ( u ) ∣ = α q + 1 ( u ) q + 1 ∏ j = 0 q ∣ 1 − α j ( u ) α q + 1 ( u ) ∣ ∏ 0 ≤ i < j ≤ q ∣ α i ( u ) − α j ( u ) ∣ , |D(u)|=\alpha_{q+1}(u)^{q+1}\prod_{j=0}^{q}\left|1-\frac{\alpha_j(u)}{\alpha_{q+1}(u)}\right|\prod_{0\le i<j\le q}|\alpha_i(u)-\alpha_j(u)|, ∣ D ( u ) ∣ = α q + 1 ( u ) q + 1 j = 0 ∏ q 1 − α q + 1 ( u ) α j ( u ) 0 ≤ i < j ≤ q ∏ ∣ α i ( u ) − α j ( u ) ∣ ,
and (8) follows by Lemma 1. To prove the other two assertions we need the inequality
∣ ∏ j = 0 q + 1 D j ( u ) ∣ ≥ 1 (11) \left|\prod_{j=0}^{q+1}D_j(u)\right|\ge1 \tag*{(11)} j = 0 ∏ q + 1 D j ( u ) ≥ 1 (11)
for all appropriate u u u . To prove this pick an u ≥ u 1 u \ge u_1 u ≥ u 1 and show that ± D j ( u ) \pm D_j(u) ± D j ( u ) , j = 0 , … , q + 1 j = 0,\ldots,q+1 j = 0 , … , q + 1 are all the algebraic conjugates of D 0 ( u ) D_0(u) D 0 ( u ) . If this is true, then ∣ ∏ j = 0 q + 1 D j ( u ) ∣ \left|\prod_{j=0}^{q+1}D_j(u)\right| ∏ j = 0 q + 1 D j ( u ) is a rational number, but D 0 ( u ) D_0(u) D 0 ( u ) is an algebraic integer, thus the above product, which is the absolute value of the norm of D 0 ( u ) D_0(u) D 0 ( u ) , is a rational integer. The D 0 ( u ) D_0(u) D 0 ( u ) is an algebraic integer, because all entries of the matrix defined it are algebraic integers. On the other hand we showed in the last lemma that D 0 ( u ) ≠ 0 D_0(u) \ne0 D 0 ( u ) = 0 , which yields the claim.
It remains to show that ± D j ( u ) \pm D_j(u) ± D j ( u ) , j = 0 , … , q + 1 j = 0,\ldots,q+1 j = 0 , … , q + 1 are all the algebraic conjugates of D 0 ( u ) D_0(u) D 0 ( u ) . Indeed, let τ \tau τ be an algebraic conjugation of α 0 ( u ) \alpha_0(u) α 0 ( u ) , which can be interpreted as a permutation of the set { α 0 ( u ) , … , α q + 1 ( u ) } \{\alpha_0(u),\ldots,\alpha_{q+1}(u)\} { α 0 ( u ) , … , α q + 1 ( u )} . Each permutation is the composition of transpositions, which are mappings interchanging two elements. Assume that τ \tau τ is the transposition τ ( α i ( u ) ) = α j ( u ) \tau(\alpha_i(u)) = \alpha_j(u) τ ( α i ( u )) = α j ( u ) and τ ( α j ( u ) ) = α i ( u ) \tau(\alpha_j(u)) = \alpha_i(u) τ ( α j ( u )) = α i ( u ) for some 0 ≤ i ≤ j ≤ q + 1 0 \le i \le j \le q+1 0 ≤ i ≤ j ≤ q + 1 . Restricting τ \tau τ to Q \mathbb{Q} Q is the identity mapping, thus τ ( A ) = A \tau(\mathbf{A}) = \mathbf{A} τ ( A ) = A .
If i = j i = j i = j then τ \tau τ is the identity mapping, in particular τ ( D 0 ) = D 0 \tau(D_0) = D_0 τ ( D 0 ) = D 0 . If i > 0 i > 0 i > 0 then τ \tau τ interchanges the vectors v i \mathbf{v}_i v i and v j \mathbf{v}_j v j in D 0 D_0 D 0 , hence τ ( D 0 ) = ± D 0 \tau(D_0) = \pm D_0 τ ( D 0 ) = ± D 0 . Finally, if 0 = i < j 0 = i < j 0 = i < j , then τ ( v j ) = v 0 \tau(\mathbf{v}_j) = \mathbf{v}_0 τ ( v j ) = v 0 , hence τ ( D 0 ) = det ( A , v 1 , … , v j − 1 , v 0 , v j + 1 , … , v q + 1 ) \tau(D_0) = \det(\mathbf{A},\mathbf{v}_1,\ldots,\mathbf{v}_{j-1},\mathbf{v}_0,\mathbf{v}_{j+1},\ldots,\mathbf{v}_{q+1}) τ ( D 0 ) = det ( A , v 1 , … , v j − 1 , v 0 , v j + 1 , … , v q + 1 ) , but this is ± D j \pm D_j ± D j , and our claim is proved.
Let 0 ≤ j ≤ q 0 \le j \le q 0 ≤ j ≤ q . Then, by the Hadamard inequality, we have
∣ D j ( u ) ∣ ≤ ∣ A ∣ ⋅ ∣ v q + 1 ∣ ∏ k = 0 k ≠ j q ∣ v k ∣ ≤ ( q + 1 ) L α q + 1 ( u ) u q + 1 ∏ k = 0 k ≠ j q ∣ v k ∣ , |D_j(u)| \le|\mathbf{A}| \cdot|\mathbf{v}_{q+1}| \prod_{\substack{k=0\\k\ne j}}^{q}|\mathbf{v}_k| \le(q+1)L\alpha_{q+1}(u)u^{q+1}\prod_{\substack{k=0\\k\ne j}}^{q}|\mathbf{v}_k|, ∣ D j ( u ) ∣ ≤ ∣ A ∣ ⋅ ∣ v q + 1 ∣ k = 0 k = j ∏ q ∣ v k ∣ ≤ ( q + 1 ) L α q + 1 ( u ) u q + 1 k = 0 k = j ∏ q ∣ v k ∣ ,
where ∣ v ∣ |\mathbf{v}| ∣ v ∣ denotes the Euclidean length of the vector v \mathbf{v} v . Corollary 1 implies that ( ( q + 1 ) F ) q − 1 ((q+1)F)^{q-1} (( q + 1 ) F ) q − 1 is an upper bound for the third factor, which depends only on the roots and degree of Q ( X ) Q(X) Q ( X ) . This proves the upper bound in (9) with
c 4 = ( ( q + 1 ) F ) q . c_4 = ((q+1)F)^q. c 4 = (( q + 1 ) F ) q .
The upper bound for ∣ D q + 1 ( u ) ∣ |D_{q+1}(u)| ∣ D q + 1 ( u ) ∣ can be proved analogously by observing that ∣ v 0 ∣ |\mathbf{v}_0| ∣ v 0 ∣ has an absolute upper bound. The lower bounds follow now by combining the upper bounds and (11). □
In the proof of our theorem we need not only the quotient a q + 1 ( u ) / a 0 ( u ) a_{q+1}(u)/a_0(u) a q + 1 ( u ) / a 0 ( u ) , but its limit when u u u tends to infinity too. The functions α 0 ( u ) , … , α q + 1 ( u ) \alpha_0(u),\ldots,\alpha_{q+1}(u) α 0 ( u ) , … , α q + 1 ( u ) are by Lemma 1 (i) pairwise different for all u 1 ≤ u ∈ R u_1 \le u \in\mathbb{R} u 1 ≤ u ∈ R . They yield the functions D ( u ) , D j ( u ) : R ↦ C D(u),D_j(u):\mathbb{R}\mapsto\mathbb{C} D ( u ) , D j ( u ) : R ↦ C , j = 0 , … , q + 1 j = 0,\ldots,q+1 j = 0 , … , q + 1 . As D ( u ) ≠ 0 D(u) \ne0 D ( u ) = 0 whenever u ≥ u 1 u \ge u_1 u ≥ u 1 , the functions a j ( u ) = D j ( u ) D ( u ) : R ↦ C a_j(u) = \frac{D_j(u)}{D(u)}:\mathbb{R}\mapsto\mathbb{C} a j ( u ) = D ( u ) D j ( u ) : R ↦ C , j = 0 , … , q + 1 j = 0,\ldots,q+1 j = 0 , … , q + 1 are well defined too. Unfortunately the limit of the quotient
a q + 1 ( u ) a 0 ( u ) = D q + 1 ( u ) D 0 ( u ) \frac{a_{q+1}(u)}{a_0(u)}=\frac{D_{q+1}(u)}{D_0(u)} a 0 ( u ) a q + 1 ( u ) = D 0 ( u ) D q + 1 ( u )
is not always well defined or is zero. Obvious instance of the later is because D 0 ( u ) D_0(u) D 0 ( u ) tends with α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) typically to infinity. Hence it is more convenient to study the limit of D 0 ( u ) / α q + 1 ( u ) q + 1 D_0(u)/\alpha_{q+1}(u)^{q+1} D 0 ( u ) / α q + 1 ( u ) q + 1 , which we denote by D 0 ′ D'_0 D 0 ′ . Lemma 1 (ii) yields
D 0 ′ = ∣ A 0 1 ⋯ 1 0 A 1 β 1 ⋯ β q 0 ⋮ ⋮ ⋱ ⋮ ⋮ A q β 1 q ⋯ β q q 0 A q + 1 β 1 q + 1 ⋯ β q q + 1 1 ∣ = ∣ A 0 1 ⋯ 1 A 1 β 1 ⋯ β q ⋮ ⋮ ⋱ ⋮ A q β 1 q ⋯ β q q ∣ . D'_0 =
\begin{vmatrix}
A_0 & 1 & \cdots& 1 & 0 \\
A_1 & \beta_1 & \cdots& \beta_q & 0 \\
\vdots& \vdots& \ddots& \vdots& \vdots\\
A_q & \beta_1^q & \cdots& \beta_q^q & 0 \\
A_{q+1} & \beta_1^{q+1} & \cdots& \beta_q^{q+1} & 1
\end{vmatrix}
=
\begin{vmatrix}
A_0 & 1 & \cdots& 1 \\
A_1 & \beta_1 & \cdots& \beta_q \\
\vdots& \vdots& \ddots& \vdots\\
A_q & \beta_1^q & \cdots& \beta_q^q
\end{vmatrix}. D 0 ′ = A 0 A 1 ⋮ A q A q + 1 1 β 1 ⋮ β 1 q β 1 q + 1 ⋯ ⋯ ⋱ ⋯ ⋯ 1 β q ⋮ β q q β q q + 1 0 0 ⋮ 0 1 = A 0 A 1 ⋮ A q 1 β 1 ⋮ β 1 q ⋯ ⋯ ⋱ ⋯ 1 β q ⋮ β q q .
Denote d 0 d_0 d 0 the determinant staying on the right hand side. Set further
D q + 1 ′ = lim u → ∞ D q + 1 ( u ) . D'_{q+1}=\lim_{u\to\infty}D_{q+1}(u). D q + 1 ′ = u → ∞ lim D q + 1 ( u ) .
Lemma 1 (ii) yields
D q + 1 ′ = ∣ 1 1 ⋯ 1 A 0 0 β 1 ⋯ β q A 1 ⋯ ⋯ ⋯ ⋯ ⋯ 0 β 1 q + 1 ⋯ β q q + 1 A q + 1 ∣ = β 1 ⋯ β q ∣ 1 ⋯ 1 A 1 β 1 ⋯ β q A 2 ⋯ ⋯ ⋯ ⋯ β 1 q ⋯ β q q A q + 1 ∣ . D'_{q+1}=
\left|
\begin{array}{ccccc}
1&1&\cdots&1&A_0\\
0&\beta_1&\cdots&\beta_q&A_1\\
\cdots&\cdots&\cdots&\cdots&\cdots\\
0&\beta_1^{q+1}&\cdots&\beta_q^{q+1}&A_{q+1}
\end{array}
\right|
=\beta_1\cdots\beta_q
\left|
\begin{array}{ccccc}
1&\cdots&1&A_1\\
\beta_1&\cdots&\beta_q&A_2\\
\cdots&\cdots&\cdots&\cdots\\
\beta_1^q&\cdots&\beta_q^q&A_{q+1}
\end{array}
\right|. D q + 1 ′ = 1 0 ⋯ 0 1 β 1 ⋯ β 1 q + 1 ⋯ ⋯ ⋯ ⋯ 1 β q ⋯ β q q + 1 A 0 A 1 ⋯ A q + 1 = β 1 ⋯ β q 1 β 1 ⋯ β 1 q ⋯ ⋯ ⋯ ⋯ 1 β q ⋯ β q q A 1 A 2 ⋯ A q + 1 .
Setting
d q + 1 = ∣ 1 ⋯ 1 A 1 β 1 ⋯ β q A 2 ⋯ ⋯ ⋯ ⋯ β 1 q ⋯ β q q A q + 1 ∣ d_{q+1}=
\left|
\begin{array}{ccccc}
1&\cdots&1&A_1\\
\beta_1&\cdots&\beta_q&A_2\\
\cdots&\cdots&\cdots&\cdots\\
\beta_1^q&\cdots&\beta_q^q&A_{q+1}
\end{array}
\right| d q + 1 = 1 β 1 ⋯ β 1 q ⋯ ⋯ ⋯ ⋯ 1 β q ⋯ β q q A 1 A 2 ⋯ A q + 1
we have D q + 1 ′ = ( − 1 ) q Q ( 0 ) d q + 1 D'_{q+1}=(-1)^qQ(0)d_{q+1} D q + 1 ′ = ( − 1 ) q Q ( 0 ) d q + 1 .
Unfortunately it can happen that d 0 d_0 d 0 or d q + 1 d_{q+1} d q + 1 or both are zero. For example if A 0 = ⋯ = A q = 0 , A q + 1 = 1 A_0=\cdots=A_q=0,A_{q+1}=1 A 0 = ⋯ = A q = 0 , A q + 1 = 1 then, obviously, d 0 = 0 d_0=0 d 0 = 0 . Another example is when β 1 = 1 \beta_1=1 β 1 = 1 and A j = 1 A_j=1 A j = 1 , j = 0 , … , q + 1 j=0,\ldots,q+1 j = 0 , … , q + 1 , in which case d 0 = d q + 1 = 0 d_0=d_{q+1}=0 d 0 = d q + 1 = 0 . I did several, attempts to characterize that irregular cases. Although I was not successful, it was possible to prove Theorem 1 under stronger assumptions, but with explicit constants. This can be the subject of a different paper, because the technical details would extend the size of these notes considerably. To overcome this difficulty we use that our determinants D 0 ( u ) , D q + 1 ( u ) D_0(u),D_{q+1}(u) D 0 ( u ) , D q + 1 ( u ) are algebraic functions, which makes it possible to deploy the machinery of that theory.
Lemma 6. There exist effective constants κ , κ 2 ∈ Q , φ , μ , ν 5 ∈ R , ∣ φ ∣ , μ > 0 \kappa,\kappa_2\in\mathbb{Q},\varphi,\mu,\nu_5\in\mathbb{R},|\varphi|,\mu>0 κ , κ 2 ∈ Q , φ , μ , ν 5 ∈ R , ∣ φ ∣ , μ > 0 depending only on Q , A 0 , … , A q + 1 Q,A_0,\ldots,A_{q+1} Q , A 0 , … , A q + 1 such that the function
Φ ( u ) = u κ D q + 1 ( u ) D 0 ( u ) \Phi(u)=u^\kappa\frac{D_{q+1}(u)}{D_0(u)} Φ ( u ) = u κ D 0 ( u ) D q + 1 ( u ) satisfy
lim u → ∞ Φ ( u ) = φ . \lim_{u\to\infty}\Phi(u)=\varphi. u → ∞ lim Φ ( u ) = φ . Moreover, if Φ ( u ) \Phi(u) Φ ( u ) is not ultimately constant, then
μ 2 u κ 2 < ∣ Φ ( u ) − φ ∣ < 2 μ u κ 2 \frac{\mu}{2u^{\kappa_2}}<|\Phi(u)-\varphi|<\frac{2\mu}{u^{\kappa_2}} 2 u κ 2 μ < ∣Φ ( u ) − φ ∣ < u κ 2 2 μ holds for all u ≥ u 5 u\geq u_5 u ≥ u 5 , u ∈ Z u\in\mathbb{Z} u ∈ Z .
Proof. The functions D 0 ( u ) , D q + 1 ( u ) D_0(u),D_{q+1}(u) D 0 ( u ) , D q + 1 ( u ) are the values of determinants whose entries are the integers A 0 , … , A q + 1 A_0,\ldots,A_{q+1} A 0 , … , A q + 1 and the powers of α 0 ( u ) , … , α q + 1 ( u ) \alpha_0(u),\ldots,\alpha_{q+1}(u) α 0 ( u ) , … , α q + 1 ( u ) , which are the roots of P u ( X ) ∈ Z [ X ] P_u(X)\in\mathbb{Z}[X] P u ( X ) ∈ Z [ X ] , hence algebraic functions. Thus D 0 ( u ) , D q + 1 ( u ) D_0(u),D_{q+1}(u) D 0 ( u ) , D q + 1 ( u ) are algebraic functions, consequently they admit Puiseux expansions. By Proposition 1 there are integers n i , r i n_i,r_i n i , r i , i = 0 , q + 1 i=0,q+1 i = 0 , q + 1 , positive integers r i r_i r i , i = 0 , q + 1 i=0,q+1 i = 0 , q + 1 and a i j ∈ C a_{ij}\in\mathbb{C} a ij ∈ C , i = 0 , q + 1 i=0,q+1 i = 0 , q + 1 , j ≥ n i j\geq n_i j ≥ n i such that
D i ( u ) = ∑ j = n i ∞ a i j u − j / r i , a i n i ≠ 0 , i = 0 , q + 1. D_i(u)=\sum_{j=n_i}^{\infty}a_{ij}u^{-j/r_i},\quad a_{in_i}\ne0,\quad i=0,q+1. D i ( u ) = j = n i ∑ ∞ a ij u − j / r i , a i n i = 0 , i = 0 , q + 1.
If r 0 ≠ r q + 1 r_0\ne r_{q+1} r 0 = r q + 1 then replacing n i n_i n i by n i r / r i n_i r/r_i n i r / r i , i = 0 , q + 1 i=0,q+1 i = 0 , q + 1 , where r r r denotes the least common multiple of r 0 , r q + 1 r_0,r_{q+1} r 0 , r q + 1 , the transformed Puiseux series have the property r 0 = r q + 1 r_0=r_{q+1} r 0 = r q + 1 . In the rest of this proof we write r r r instead of r 0 r_0 r 0 or r q + 1 r_{q+1} r q + 1 . Lemma 6 ensures that
∣ D 0 ( u ) ∣ α q + 1 q 2 − 1 |D_0(u)|\alpha_{q+1}^{q^2-1} ∣ D 0 ( u ) ∣ α q + 1 q 2 − 1
is larger, and
∣ D 0 ( u ) ∣ α q + 1 q 2 − 1 \frac{|D_0(u)|}{\alpha_{q+1}^{q^2-1}} α q + 1 q 2 − 1 ∣ D 0 ( u ) ∣
is less, than some positive constants for all large enough u u u , hence
− ( q + 1 ) ≤ n 0 r ≤ q 2 − 1. -(q+1) \le\frac{n_0}{r} \le q^2-1. − ( q + 1 ) ≤ r n 0 ≤ q 2 − 1.
We used here that α q + 1 ( u ) / u \alpha_{q+1}(u)/u α q + 1 ( u ) / u tends to one very rapidly. Similar argumentation leads to
0 ≤ n q + 1 r ≤ q ( q + 1 ) . 0 \le\frac{n_{q+1}}{r} \le q(q+1). 0 ≤ r n q + 1 ≤ q ( q + 1 ) .
With D 0 ( u ) D_0(u) D 0 ( u ) and D q + 1 ( u ) D_{q+1}(u) D q + 1 ( u ) their quotient is an algebraic function having formal Puiseux expansion, i.e. there exist integers J J J , r r r and non-zero complex numbers π J \pi_J π J such that
D q + 1 ( u ) D 0 ( u ) = ∑ j = J ∞ π j u − j / r . \frac{D_{q+1}(u)}{D_0(u)}=\sum_{j=J}^{\infty}\pi_j u^{-j/r}. D 0 ( u ) D q + 1 ( u ) = j = J ∑ ∞ π j u − j / r .
The inequalities for n i / r n_i/r n i / r , i = 0 , q + 1 i=0,q+1 i = 0 , q + 1 imply
− q 2 + 1 ≤ J r ≤ ( q + 1 ) 2 . -q^2+1 \le\frac{J}{r} \le(q+1)^2. − q 2 + 1 ≤ r J ≤ ( q + 1 ) 2 .
The choice κ = J / r \kappa=J/r κ = J / r , φ = π J \varphi=\pi_J φ = π J proves the first statement, because
Φ ( u ) = u κ D q + 1 ( u ) D u ( u ) = φ + ∑ j = 1 ∞ π J + j u − j / r . \Phi(u)=u^\kappa\frac{D_{q+1}(u)}{D_u(u)}=\varphi+\sum_{j=1}^{\infty}\pi_{J+j}u^{-j/r}. Φ ( u ) = u κ D u ( u ) D q + 1 ( u ) = φ + j = 1 ∑ ∞ π J + j u − j / r .
If Φ ( u ) \Phi(u) Φ ( u ) is not ultimately constant, then Φ ( u ) ≠ φ \Phi(u)\ne\varphi Φ ( u ) = φ for all u ≥ u 5 u\ge u_5 u ≥ u 5 , but then there exists j > 0 j>0 j > 0 with π J + j ≠ 0 \pi_{J+j}\ne0 π J + j = 0 too. Choosing J 0 J_0 J 0 the smallest such index, the assertion holds with μ = ∣ π J + J 0 ∣ \mu=|\pi_{J+J_0}| μ = ∣ π J + J 0 ∣ , κ 2 = J 0 / r \kappa_2=J_0/r κ 2 = J 0 / r .
Lemma 7. Let F = 2 max { ∣ β 1 ∣ ± 1 , … , ∣ β q ∣ ± 1 } F=2\max\{|\beta_1|^{\pm1},\ldots,|\beta_q|^{\pm1}\} F = 2 max { ∣ β 1 ∣ ± 1 , … , ∣ β q ∣ ± 1 } , like in Corollary 1. There exists an effectively computable constant n 2 n_2 n 2 , depending only on Q ( X ) Q(X) Q ( X ) and L L L , such that if n ≥ n 2 n\ge n_2 n ≥ n 2 then
∣ ∣ A n ( u ) ∣ − ∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ ∣ < c 8 L F n (12) \bigl||A_n(u)|-|a_{q+1}(u)\alpha_{q+1}(u)^n|\bigr|<c_8LF^n \tag*{(12)} ∣ A n ( u ) ∣ − ∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ < c 8 L F n (12) and
∣ ∣ A − n ( u ) ∣ − ∣ a 0 ( u ) α 0 ( u ) − n ∣ ∣ < c 8 L F n (13) \bigl||A_{-n}(u)|-|a_0(u)\alpha_0(u)^{-n}|\bigr|<c_8LF^n \tag*{(13)} ∣ A − n ( u ) ∣ − ∣ a 0 ( u ) α 0 ( u ) − n ∣ < c 8 L F n (13) hold for all u ≥ u 2 u\ge u_2 u ≥ u 2 .
Proof. By the Binet formula
A m ( u ) = ∑ j = 0 q + 1 a j ( u ) α j ( u ) m A_m(u)=\sum_{j=0}^{q+1}a_j(u)\alpha_j(u)^m A m ( u ) = j = 0 ∑ q + 1 a j ( u ) α j ( u ) m
holds for every integer $m. Suppose that m = n m=n m = n with a non-negative integer n n n , then
∣ A n ( u ) − a q + 1 ( u ) α q + 1 ( u ) n ∣ = ∑ j = 0 q ∣ a j ( u ) α j ( u ) n ∣ ≤ ( q + 1 ) c 4 L max { ∣ α j ( u ) ∣ n , j = 0 , … , q } / c 1 ≤ ( q + 1 ) c 4 L F n / c 1 . \begin{aligned}
\left|A_n(u)-a_{q+1}(u)\alpha_{q+1}(u)^n\right|=\sum_{j=0}^{q}\left|a_j(u)\alpha_j(u)^n\right| \\
&\le(q+1)c_4L\max\left\{\left|\alpha_j(u)\right|^n,\ j=0,\ldots,q\right\}/c_1 \\
&\le(q+1)c_4LF^n/c_1.
\end{aligned} ∣ A n ( u ) − a q + 1 ( u ) α q + 1 ( u ) n ∣ = j = 0 ∑ q ∣ a j ( u ) α j ( u ) n ∣ ≤ ( q + 1 ) c 4 L max { ∣ α j ( u ) ∣ n , j = 0 , … , q } / c 1 ≤ ( q + 1 ) c 4 L F n / c 1 .
The first inequality holds because (8) and (9), while the second because ∣ α j ( u ) ∣ < F \left|\alpha_j(u)\right|<F ∣ α j ( u ) ∣ < F , j = 0 , … , q j=0,\ldots,q j = 0 , … , q by Corollary 1.
If A n ( u ) A_n(u) A n ( u ) and a q + 1 ( u ) α q + 1 ( u ) n a_{q+1}(u)\alpha_{q+1}(u)^n a q + 1 ( u ) α q + 1 ( u ) n have the same signs, then (12) holds immediately with c 8 = ( q + 1 ) c 4 / c 1 c_8=(q+1)c_4/c_1 c 8 = ( q + 1 ) c 4 / c 1 . Otherwise
∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ < ( q + 1 ) c 4 L F n / c 1 . \left|a_{q+1}(u)\alpha_{q+1}(u)^n\right|<(q+1)c_4LF^n/c_1. ∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ < ( q + 1 ) c 4 L F n / c 1 .
Now, by (8) and (10) we have
∣ a q + 1 ( u ) ∣ = ∣ D q + 1 ( u ) ∣ ∣ D ( u ) ∣ > 1 c 4 L α q + 1 ( u ) q + 1 c 2 α q + 1 ( u ) q + 1 = 1 c 2 c 4 L α q + 1 ( u ) 2 ( q + 1 ) . \begin{aligned}
\left|a_{q+1}(u)\right|=\frac{\left|D_{q+1}(u)\right|}{\left|D(u)\right|} \\
&>\frac{1}{c_4L\alpha_{q+1}(u)^{q+1}c_2\alpha_{q+1}(u)^{q+1}} \\
&=\frac{1}{c_2c_4L\alpha_{q+1}(u)^{2(q+1)}}.
\end{aligned} ∣ a q + 1 ( u ) ∣ = ∣ D ( u ) ∣ ∣ D q + 1 ( u ) ∣ > c 4 L α q + 1 ( u ) q + 1 c 2 α q + 1 ( u ) q + 1 1 = c 2 c 4 L α q + 1 ( u ) 2 ( q + 1 ) 1 .
Combining the last two inequalities together we obtain
2 n < ( α q + 1 ( u ) F ) n < ( q + 1 ) c 2 ( c 4 L ) 2 c 1 ∣ α q + 1 ( u ) 2 ( q + 1 ) ∣ , 2^n<\left(\frac{\alpha_{q+1}(u)}{F}\right)^n<\frac{(q+1)c_2(c_4L)^2}{c_1}\left|\alpha_{q+1}(u)^{2(q+1)}\right|, 2 n < ( F α q + 1 ( u ) ) n < c 1 ( q + 1 ) c 2 ( c 4 L ) 2 α q + 1 ( u ) 2 ( q + 1 ) ,
which yields an easily computable upper bound n 2 ′ n'_2 n 2 ′ for n n n . The first inequality holds because α q + 1 ( u ) / F > 2 \alpha_{q+1}(u)/F>2 α q + 1 ( u ) / F > 2 by Corollary 1.
If m = − n m=-n m = − n with a non-negative integer n n n then the dominating term in the Binet formula is a 0 ( u ) α 0 − n a_0(u)\alpha_0^{-n} a 0 ( u ) α 0 − n , and, after this observation, the proof is identical to the first case. □
Corollary 5. If u > u 2 u>u_2 u > u 2 then ( ∣ A n ( u ) ∣ ) \left(\left|A_n(u)\right|\right) ( ∣ A n ( u ) ∣ ) and ( ∣ A − n ( u ) ∣ ) \left(\left|A_{-n}(u)\right|\right) ( ∣ A − n ( u ) ∣ ) are strictly monotone increasing whenever n ≥ n 3 n\ge n_3 n ≥ n 3 .
Proof. If n > n 2 n>n_2 n > n 2 then by Lemma 7 we have
∣ A n + 1 ( u ) ∣ > ∣ a q + 1 ( u ) α q + 1 ( u ) n + 1 ∣ − c 8 L F n + 1 \left|A_{n+1}(u)\right|>\left|a_{q+1}(u)\alpha_{q+1}(u)^{n+1}\right|-c_8LF^{n+1} ∣ A n + 1 ( u ) ∣ > a q + 1 ( u ) α q + 1 ( u ) n + 1 − c 8 L F n + 1
and
∣ A n ( u ) ∣ < ∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ + c 8 L F n . \left|A_n(u)\right|<\left|a_{q+1}(u)\alpha_{q+1}(u)^n\right|+c_8LF^n. ∣ A n ( u ) ∣ < ∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ + c 8 L F n .
If for such an n n n the inequality ∣ A n + 1 ( u ) ∣ ≤ ∣ A n ( u ) ∣ \left|A_{n+1}(u)\right|\le\left|A_n(u)\right| ∣ A n + 1 ( u ) ∣ ≤ ∣ A n ( u ) ∣ holds then
∣ a q + 1 ( u ) α q + 1 ( u ) n + 1 ∣ − c 8 L F n + 1 < ∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ + c 8 L F n . \left|a_{q+1}(u)\alpha_{q+1}(u)^{n+1}\right|-c_8LF^{n+1}<\left|a_{q+1}(u)\alpha_{q+1}(u)^n\right|+c_8LF^n. a q + 1 ( u ) α q + 1 ( u ) n + 1 − c 8 L F n + 1 < ∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ + c 8 L F n .
Rearranging this inequality we obtain
∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ ( α q + 1 ( u ) − 1 ) < c 8 L F n ( F + 1 ) , \left|a_{q+1}(u)\alpha_{q+1}(u)^n\right|(\alpha_{q+1}(u)-1)<c_8LF^n(F+1), ∣ a q + 1 ( u ) α q + 1 ( u ) n ∣ ( α q + 1 ( u ) − 1 ) < c 8 L F n ( F + 1 ) ,
but this yields n ≤ n 3 n\le n_3 n ≤ n 3 because α q + 1 ( u ) > 2 F \alpha_{q+1}(u)>2F α q + 1 ( u ) > 2 F .
The proof that ( ∣ A − n ( u ) ∣ ) \left(\left|A_{-n}(u)\right|\right) ( ∣ A − n ( u ) ∣ ) are strictly monotone increasing is the same. □
Tools from transcendental number theory
An important ingredient of the proof of the main theorem is A. Baker’s theory on linear forms in logarithms of algebraic numbers. It has many variants, nowadays one of the sharpest is due to Matveev [13 ] .
For an algebraic number η \eta η with minimal polynomial
f ( X ) = a 0 ( X − η ( 1 ) ) ⋯ ( X − η ( N ) ) ∈ Z [ X ] f(X)=a_0(X-\eta^{(1)})\cdots(X-\eta^{(N)})\in\mathbb{Z}[X] f ( X ) = a 0 ( X − η ( 1 ) ) ⋯ ( X − η ( N ) ) ∈ Z [ X ]
with a 0 > 0 a_0>0 a 0 > 0 and with relative prime coefficients, write h ( η ) h(\eta) h ( η ) for its absolute logarithmic or Weil height given by
h ( η ) = 1 N ( log a 0 + ∑ j = 1 N max { 0 , log ∣ η ( j ) ∣ } ) . h(\eta)=\frac{1}{N}\left(\log a_0+\sum_{j=1}^{N}\max\{0,\log|\eta^{(j)}|\}\right). h ( η ) = N 1 ( log a 0 + j = 1 ∑ N max { 0 , log ∣ η ( j ) ∣ } ) .
If η \eta η is an algebraic integer then
h ( η ) ≤ log max { ∣ η ( j ) ∣ , j = 1 , … , N } . (14) h(\eta)\leq\log\max\{|\eta^{(j)}|,\ j=1,\ldots,N\}. \tag*{(14)} h ( η ) ≤ log max { ∣ η ( j ) ∣ , j = 1 , … , N } . (14)
We provide some important and well known properties of the function h h h .
Lemma 8. Let γ , η \gamma,\eta γ , η be algebraic numbers of degree at most d d d and u ∈ Q u\in\mathbb{Q} u ∈ Q . Then we have
h ( γ ± η ) ≤ h ( γ ) + h ( η ) + log 2 h(\gamma\pm\eta)\leq h(\gamma)+h(\eta)+\log2 h ( γ ± η ) ≤ h ( γ ) + h ( η ) + log 2 ,
h ( γ η ± 1 ) ≤ h ( γ ) + h ( η ) h(\gamma\eta^{\pm1})\leq h(\gamma)+h(\eta) h ( γ η ± 1 ) ≤ h ( γ ) + h ( η ) ,
h ( γ u ) = ∣ u ∣ h ( γ ) h(\gamma^u)=|u|h(\gamma) h ( γ u ) = ∣ u ∣ h ( γ ) .
For the proof see e.g. Waldschmidt [30 ] , Ch. 3.2.
The next lemma is due to Matveev [13 ] and is presently the strongest general lower bound for linear forms in logarithms of algebraic numbers. He published originally its additive version, but for our purpose this multiplicative version is more beneficial.
Under the above mentioned circumstances, Matveev [13 ] proved the additive variant of the following theorem.
Lemma 9. Let K K K be an algebraic number field of degree d K d_K d K and let η 1 , … , η t ∈ K ∖ { 0 } \eta_1,\ldots,\eta_t\in K\setminus\{0\} η 1 , … , η t ∈ K ∖ { 0 } , and e 1 , … , e t e_1,\ldots,e_t e 1 , … , e t be nonzero integers. Put
E = max { ∣ e 1 ∣ , … , ∣ e t ∣ , 3 } and Γ = ∏ i = 1 t η i e i − 1. E=\max\{|e_1|,\ldots,|e_t|,3\}\qquad\text{and}\qquad\Gamma=\prod_{i=1}^{t}\eta_i^{e_i}-1. E = max { ∣ e 1 ∣ , … , ∣ e t ∣ , 3 } and Γ = i = 1 ∏ t η i e i − 1. Let F 1 , … , F t F_1,\ldots,F_t F 1 , … , F t be such that
F j ≥ max { d K h ( η j ) , ∣ log η j ∣ , 0.16 } , for j = 1 , … , t . F_j\geq\max\{d_Kh(\eta_j),|\log\eta_j|,0.16\},\qquad\text{for }j=1,\ldots,t. F j ≥ max { d K h ( η j ) , ∣ log η j ∣ , 0.16 } , for j = 1 , … , t . If Γ ≠ 0 \Gamma\neq0 Γ = 0 , then
log ∣ Γ ∣ > − 3 ⋅ 30 t + 4 ( t + 1 ) 5.5 d K 2 ( 1 + log d K ) ( 1 + log t E ) F 1 F 2 ⋯ F t . \log|\Gamma|>-3\cdot30^{t+4}(t+1)^{5.5}d_K^2(1+\log d_K)(1+\log tE)F_1F_2\cdots F_t. log ∣Γ∣ > − 3 ⋅ 3 0 t + 4 ( t + 1 ) 5.5 d K 2 ( 1 + log d K ) ( 1 + log tE ) F 1 F 2 ⋯ F t .
The following technical lemma has many variants, its present form appeared in [25 ] .
Lemma 10. If s ≥ 1 s\geq1 s ≥ 1 , T ≥ ( 4 s 2 ) s T\geq(4s^2)^s T ≥ ( 4 s 2 ) s , and x / ( log x ) s < T x/(\log x)^s<T x / ( log x ) s < T , then
x < 2 s T ( log T ) s . x<2^sT(\log T)^s. x < 2 s T ( log T ) s .
We also need the following simple property of the logarithm function, for its proof see de Weger [31 ] .
Lemma 11. Let a ∈ R a \in\mathbb{R} a ∈ R . If a < 1 a < 1 a < 1 and ∣ x ∣ < a |x| < a ∣ x ∣ < a then
∣ log ( 1 + x ) ∣ < − log ( 1 − a ) a ∣ x ∣ , |\log(1+x)| < \frac{-\log(1-a)}{a}|x|, ∣ log ( 1 + x ) ∣ < a − log ( 1 − a ) ∣ x ∣ , and
∣ x ∣ < a 1 − e − a ∣ e x − 1 ∣ . |x| < \frac{a}{1-e^{-a}}|e^x-1|. ∣ x ∣ < 1 − e − a a ∣ e x − 1∣.
Proof of Theorem 1
If u ≥ u 1 u \ge u_1 u ≥ u 1 then, by Lemma 1 (ii), α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) is the dominating root of P u ( X ) P_u(X) P u ( X ) and 1 / α 0 ( u ) 1/\alpha_0(u) 1/ α 0 ( u ) is the dominating root of X q + 2 P u ( 1 / X ) X^{q+2}P_u(1/X) X q + 2 P u ( 1/ X ) , hence, by the Théorème of Mignotte [14 ] , the equation (3) has for any fixed u ≥ u 1 u \ge u_1 u ≥ u 1 only finitely many effectively computable solutions. This happens for all u 1 ≤ u ≤ max { u 1 , … , u 5 } u_1 \le u \le\max\{u_1,\ldots,u_5\} u 1 ≤ u ≤ max { u 1 , … , u 5 } , i.e. we may assume that the assertions of the Lemmas 1, 4, 6, 7 and of the Corollaries 4, 5 hold, moreover we have to deal only with those u u u which are larger than max { u 1 , … , u 5 } \max\{u_1,\ldots,u_5\} max { u 1 , … , u 5 } .
Equation (3) compress three equations depending on the signs of n n n and m m m . In the cases n , m ≥ 0 n,m \ge0 n , m ≥ 0 and n , m < 0 n,m < 0 n , m < 0 it is enough to study the growth of ( ∣ A n ∣ ) (|A_n|) ( ∣ A n ∣ ) . The situation is much more complex, if n n n and m m m have different signs. Because (3) is symmetric in n n n and m m m we may restrict ourself to n ≥ 0 n \ge0 n ≥ 0 and m < 0 m < 0 m < 0 . We assume in the sequel that ( n , m ) ∈ Z (n,m) \in\mathbb{Z} ( n , m ) ∈ Z , n ≠ m n \ne m n = m is a solution of (3) and split the proof of Theorem 1 into two cases.
Case I, n , m ≥ 0 n,m \ge0 n , m ≥ 0 and n , m < 0 n,m < 0 n , m < 0 . Assume that ∣ A n ( u ) ∣ = ∣ A m ( u ) ∣ |A_n(u)|=|A_m(u)| ∣ A n ( u ) ∣ = ∣ A m ( u ) ∣ for some u > u 2 u>u_2 u > u 2 . By Corollary 5 the sequences ( ∣ A n ( u ) ∣ ) n ≥ n 3 (|A_n(u)|)_{n\ge n_3} ( ∣ A n ( u ) ∣ ) n ≥ n 3 and ( ∣ A n ( u ) ∣ ) n ≤ − n 3 (|A_n(u)|)_{n\le-n_3} ( ∣ A n ( u ) ∣ ) n ≤ − n 3 are strictly increasing hence (3) is not possible if u > u 2 u>u_2 u > u 2 and n , m ≥ n 3 n,m\ge n_3 n , m ≥ n 3 as well as if − n , − m ≥ n 3 -n,-m\ge n_3 − n , − m ≥ n 3 .
Case II, n ≥ 0 , m < 0 n \ge0,m < 0 n ≥ 0 , m < 0 . The proof of this case will be divided into several steps. To simplify the notation we will indicate the dependence on u u u only if it is essential. We start with general remarks.
The inequalities (12) and (13) imply
− c 8 L F n < ∣ A n ∣ − ∣ a q + 1 α q + 1 n ∣ < c 8 L F n -c_8LF^n < |A_n|-|a_{q+1}\alpha_{q+1}^n| < c_8LF^n − c 8 L F n < ∣ A n ∣ − ∣ a q + 1 α q + 1 n ∣ < c 8 L F n
and
− c 8 L F − m < ∣ A m ∣ − ∣ a 0 α 0 m ∣ < c 8 L F − m , -c_8LF^{-m} < |A_m|-|a_0\alpha_0^m| < c_8LF^{-m}, − c 8 L F − m < ∣ A m ∣ − ∣ a 0 α 0 m ∣ < c 8 L F − m ,
where 2 F < α q + 1 , ∣ α 0 ∣ − 1 2F<\alpha_{q+1},|\alpha_0|^{-1} 2 F < α q + 1 , ∣ α 0 ∣ − 1 . By our assumption (3) holds for the pair ( n , m ) ∈ Z (n,m)\in\mathbb{Z} ( n , m ) ∈ Z , n ≥ 0 > m n\ge0>m n ≥ 0 > m , hence
− c 8 L ( F n + F − m ) < ( ∣ A m ∣ − ∣ a 0 α 0 m ∣ ) − ( ∣ A n ∣ − ∣ a q + 1 α q + 1 n ∣ ) = ∣ a q + 1 α q + 1 n ∣ − ∣ a 0 α 0 m ∣ < c 8 L ( F n + F − m ) . (15) \begin{aligned}
-c_8L(F^n+F^{-m}) &< (|A_m|-|a_0\alpha_0^m|)-(|A_n|-|a_{q+1}\alpha_{q+1}^n|) \\
&= |a_{q+1}\alpha_{q+1}^n|-|a_0\alpha_0^m| \\
&< c_8L(F^n+F^{-m}). \tag*{(15)}
\end{aligned} − c 8 L ( F n + F − m ) < ( ∣ A m ∣ − ∣ a 0 α 0 m ∣ ) − ( ∣ A n ∣ − ∣ a q + 1 α q + 1 n ∣ ) = ∣ a q + 1 α q + 1 n ∣ − ∣ a 0 α 0 m ∣ < c 8 L ( F n + F − m ) . (15)
There is a constant n 4 n_4 n 4 such that ∣ a q + 1 ∣ α q + 1 n > 2 c 8 L F n |a_{q+1}|\alpha_{q+1}^n>2c_8LF^n ∣ a q + 1 ∣ α q + 1 n > 2 c 8 L F n , hence
∣ a q + 1 ∣ α q + 1 n < ∣ A n ∣ < 3 ∣ a q + 1 ∣ α q + 1 n |a_{q+1}|\alpha_{q+1}^n < |A_n| < 3|a_{q+1}|\alpha_{q+1}^n ∣ a q + 1 ∣ α q + 1 n < ∣ A n ∣ < 3∣ a q + 1 ∣ α q + 1 n
hold for all n ≥ n 4 n\ge n_4 n ≥ n 4 . Similarly, if − m ≥ n 4 -m\ge n_4 − m ≥ n 4 than
∣ a 0 α 0 m ∣ < ∣ A m ∣ < 3 ∣ a 0 α 0 m ∣ |a_0\alpha_0^m| < |A_m| < 3|a_0\alpha_0^m| ∣ a 0 α 0 m ∣ < ∣ A m ∣ < 3∣ a 0 α 0 m ∣
Thus if (3) holds, and n , − m ≥ n 4 n,-m\ge n_4 n , − m ≥ n 4 then
∣ a q + 1 ∣ α q + 1 n < ∣ A n ∣ = ∣ A m ∣ < 3 ∣ a 0 α 0 m ∣ |a_{q+1}|\alpha_{q+1}^n < |A_n|=|A_m| < 3|a_0\alpha_0^m| ∣ a q + 1 ∣ α q + 1 n < ∣ A n ∣ = ∣ A m ∣ < 3∣ a 0 α 0 m ∣
∣ a 0 α 0 m ∣ < ∣ A n ∣ = ∣ A m ∣ < 3 ∣ a q + 1 ∣ α q + 1 n , |a_0\alpha_0^m| < |A_n|=|A_m| < 3|a_{q+1}|\alpha_{q+1}^n, ∣ a 0 α 0 m ∣ < ∣ A n ∣ = ∣ A m ∣ < 3∣ a q + 1 ∣ α q + 1 n ,
which yield
− log ∣ a 0 3 a q + 1 ∣ < n log α q + 1 − m log ∣ α 0 ∣ < log ( 3 ∣ a 0 a q + 1 ∣ ) . (16) -\log\left| \frac{a_0}{3a_{q+1}} \right| < n\log\alpha_{q+1}-m\log|\alpha_0| < \log\left(3\left|\frac{a_0}{a_{q+1}}\right|\right). \tag*{(16)} − log 3 a q + 1 a 0 < n log α q + 1 − m log ∣ α 0 ∣ < log ( 3 a q + 1 a 0 ) . (16)
Lower bound for n n n and − m -m − m
So far we did not need any restrictions on Q ( 0 ) Q(0) Q ( 0 ) , apart that it is a non-zero integer. From here on we assume that Q ( 0 ) = ± 1 Q(0)=\pm1 Q ( 0 ) = ± 1 , hence ∣ Q ( 0 ) α 0 ∣ α q + 1 = ∣ α 0 ∣ α q + 1 |Q(0)\alpha_0|\alpha_{q+1}=|\alpha_0|\alpha_{q+1} ∣ Q ( 0 ) α 0 ∣ α q + 1 = ∣ α 0 ∣ α q + 1 . By Corollary 4 ∣ α 0 ∣ α q + 1 |\alpha_0|\alpha_{q+1} ∣ α 0 ∣ α q + 1 is either larger or less than one. We treat the two cases separately.
We assume first ∣ α 0 ∣ α q + 1 > 1 |\alpha_0|\alpha_{q+1}>1 ∣ α 0 ∣ α q + 1 > 1 . Inequality (16) implies
n < − m − log ∣ α 0 ∣ log α q + 1 + log 3 ∣ a 0 / a q + 1 ∣ log α q + 1 < − m + c 9 , n < -m\frac{-\log|\alpha_0|}{\log\alpha_{q+1}}+\frac{\log3|a_0/a_{q+1}|}{\log\alpha_{q+1}}<-m+c_9, n < − m log α q + 1 − log ∣ α 0 ∣ + log α q + 1 log 3∣ a 0 / a q + 1 ∣ < − m + c 9 ,
where
c 9 = ( q + 1 ) 2 + log ( 3 ⋅ ( c 4 L ) q + 1 ) log α q + 1 . c_9=(q+1)^2+\frac{\log\left(3\cdot(c_4L)^{q+1}\right)}{\log\alpha_{q+1}}. c 9 = ( q + 1 ) 2 + log α q + 1 log ( 3 ⋅ ( c 4 L ) q + 1 ) .
This is true because we can estimate 3 ∣ a 0 / a q + 1 ∣ = 3 ∣ D 0 / D q + 1 ∣ 3|a_0/a_{q+1}|=3|D_0/D_{q+1}| 3∣ a 0 / a q + 1 ∣ = 3∣ D 0 / D q + 1 ∣ by using Lemma 5.
The relation between n n n and − m -m − m yields F n < F − m + c 9 F^n<F^{-m+c_9} F n < F − m + c 9 , which allows us to rewrite inequality (15) as
∣ ∣ a q + 1 ∣ α q + 1 n − ∣ a 0 α 0 m ∣ ∣ < c 10 F − m , c 10 = c 8 L ( F c 9 + 1 ) . (17) \left||a_{q+1}|\alpha_{q+1}^n-|a_0\alpha_0^m|\right|<c_{10}F^{-m},\qquad c_{10}=c_8L(F^{c_9}+1). \tag*{(17)} ∣ a q + 1 ∣ α q + 1 n − ∣ a 0 α 0 m ∣ < c 10 F − m , c 10 = c 8 L ( F c 9 + 1 ) . (17)
After division by ∣ a 0 α 0 m ∣ |a_0\alpha_0^m| ∣ a 0 α 0 m ∣ we get
∣ ∣ Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ − 1 ∣ < c 10 a 0 ( F ∣ α 0 ∣ ) − m . \left||\Phi(u)|\left(|\alpha_0|\alpha_{q+1}\right)^{n-\kappa}|\alpha_0|^{-m-n+\kappa}-1\right|<\frac{c_{10}}{a_0}(F|\alpha_0|)^{-m}. ∣Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ − 1 < a 0 c 10 ( F ∣ α 0 ∣ ) − m .
with
Φ ( u ) = u κ a q + 1 a 0 = u κ D q + 1 ( u ) D 0 ( u ) \Phi(u)=u^\kappa\frac{a_{q+1}}{a_0}=u^\kappa\frac{D_{q+1}(u)}{D_0(u)} Φ ( u ) = u κ a 0 a q + 1 = u κ D 0 ( u ) D q + 1 ( u )
and the κ ∈ Q \kappa\in\mathbb{Q} κ ∈ Q is defined in Lemma 6. By Lemma 5
∣ a 0 ∣ = ∣ D 0 D ∣ > c 11 α q + 1 − q ( q + 1 ) |a_0|=\left|\frac{D_0}{D}\right|>c_{11}\alpha_{q+1}^{-q(q+1)} ∣ a 0 ∣ = D D 0 > c 11 α q + 1 − q ( q + 1 )
with an appropriate constant c 11 c_{11} c 11 . Hence
∣ ∣ Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ − 1 ∣ < c 12 ( F ∣ α 0 ∣ ) − m , \left||\Phi(u)|\left(|\alpha_0|\alpha_{q+1}\right)^{n-\kappa}|\alpha_0|^{-m-n+\kappa}-1\right|<c_{12}(F|\alpha_0|)^{-m}, ∣Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ − 1 < c 12 ( F ∣ α 0 ∣ ) − m ,
where c 12 = c 10 α q + 1 q ( q + 1 ) / c 11 c_{12}=c_{10}\alpha_{q+1}^{q(q+1)}/c_{11} c 12 = c 10 α q + 1 q ( q + 1 ) / c 11 .
There is a constant u 6 u_6 u 6 such that if u ≥ u 6 u\geq u_6 u ≥ u 6 then ∣ α 0 ( u ) ∣ − 1 > c 12 F 2 |\alpha_0(u)|^{-1}>c_{12}F^2 ∣ α 0 ( u ) ∣ − 1 > c 12 F 2 holds. Then
∣ α 0 ( u ) ∣ − ∣ m ∣ / 2 > c 12 ∣ m ∣ / 2 F ∣ m ∣ > c 12 F ∣ m ∣ . |\alpha_0(u)|^{-|m|/2}>c_{12}^{|m|/2}F^{|m|}>c_{12}F^{|m|}. ∣ α 0 ( u ) ∣ − ∣ m ∣/2 > c 12 ∣ m ∣/2 F ∣ m ∣ > c 12 F ∣ m ∣ .
Multiplying both sides by ∣ α 0 ( u ) ∣ ∣ m ∣ / 2 < 1 |\alpha_0(u)|^{|m|/2}<1 ∣ α 0 ( u ) ∣ ∣ m ∣/2 < 1 we get
c 12 ( F ∣ α 0 ∣ ) − m < ∣ α 0 ∣ − m / 2 . c_{12}(F|\alpha_0|)^{-m}<|\alpha_0|^{-m/2}. c 12 ( F ∣ α 0 ∣ ) − m < ∣ α 0 ∣ − m /2 .
Thus if u ≥ u 6 u\geq u_6 u ≥ u 6 and n ≥ n 4 n\geq n_4 n ≥ n 4 then
∣ ∣ Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ − 1 ∣ < ∣ α 0 ∣ − m / 2 . (18) \left||\Phi(u)|\left(|\alpha_0|\alpha_{q+1}\right)^{n-\kappa}|\alpha_0|^{-m-n+\kappa}-1\right|<|\alpha_0|^{-m/2}. \tag*{(18)} ∣Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ − 1 < ∣ α 0 ∣ − m /2 . (18)
The number on the right hand side is obviously less than 1 / 2 1/2 1/2 , hence
∣ log ∣ Φ ( u ) ∣ + ( n − κ ) log ( ∣ α 0 ∣ α q + 1 ) + ( − m − n + κ ) log ∣ α 0 ∣ ∣ < 2 ∣ α 0 ∣ − m / 2 (19) \left|\log|\Phi(u)|+(n-\kappa)\log(|\alpha_0|\alpha_{q+1})+(-m-n+\kappa)\log|\alpha_0|\right|<2|\alpha_0|^{-m/2} \tag*{(19)} ∣ log ∣Φ ( u ) ∣ + ( n − κ ) log ( ∣ α 0 ∣ α q + 1 ) + ( − m − n + κ ) log ∣ α 0 ∣ ∣ < 2∣ α 0 ∣ − m /2 (19)
by Lemma 11.
Lemma 12. Assume that ( n , m . u ) ∈ Z 3 (n,m.u) \in\mathbb{Z}^{3} ( n , m . u ) ∈ Z 3 is a solution of (3) such that n ≥ 0 n \ge0 n ≥ 0 , m < 0 m < 0 m < 0 . Denote κ 1 , κ 2 , φ \kappa_{1},\kappa_{2},\varphi κ 1 , κ 2 , φ the constants introduced in Corollary 4 and Lemma 6. If ∣ α 0 ( u ) ∣ α q + 1 ( u ) > 1 |\alpha_{0}(u)|\alpha_{q+1}(u)>1 ∣ α 0 ( u ) ∣ α q + 1 ( u ) > 1 and u ≥ u 2 u \ge u_{2} u ≥ u 2 then n + m − κ ≤ 0 n+m-\kappa\le0 n + m − κ ≤ 0 , and equality may hold only if ∣ Φ ( u ) ∣ < 1 |\Phi(u)|<1 ∣Φ ( u ) ∣ < 1 and κ 1 > κ 2 \kappa_{1}>\kappa_{2} κ 1 > κ 2 or ∣ Φ ( u ) ∣ < 1 |\Phi(u)|<1 ∣Φ ( u ) ∣ < 1 and κ 1 ≤ κ 2 \kappa_{1}\le\kappa_{2} κ 1 ≤ κ 2 and ∣ φ ∣ < 1 |\varphi|<1 ∣ φ ∣ < 1 . Moreover, if u > max { u 1 , … , u 10 } u>\max\{u_{1},\ldots,u_{10}\} u > max { u 1 , … , u 10 } then there exist effectively computable constants g , f > 0 g,f>0 g , f > 0 such that
− m ≥ n − κ > g u f . -m \ge n-\kappa> gu^{f}. − m ≥ n − κ > g u f .
Proof. In the proof of the lemma we separate some cases, which need different treatments.
If n + m − κ > 0 n+m-\kappa>0 n + m − κ > 0 then
∣ Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ ≥ ∣ φ ∣ 2 ( 1 + 1 2 u κ ) u 2 > 1 + 1 2 u κ . |\Phi(u)|\left(|\alpha_{0}|\alpha_{q+1}\right)^{n-\kappa}|\alpha_{0}|^{-m-n+\kappa}\ge\frac{|\varphi|}{2}\left(1+\frac{1}{2u^{\kappa}}\right)\frac{u}{2}>1+\frac{1}{2u^{\kappa}}. ∣Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ ≥ 2 ∣ φ ∣ ( 1 + 2 u κ 1 ) 2 u > 1 + 2 u κ 1 .
because ∣ α 0 ∣ − m − n + κ ≥ 1 / ∣ α 0 ∣ > u / 2 |\alpha_{0}|^{-m-n+\kappa}\ge1/|\alpha_{0}|>u/2 ∣ α 0 ∣ − m − n + κ ≥ 1/∣ α 0 ∣ > u /2 , provided u ≥ u 2 u\ge u_{2} u ≥ u 2 . This contradicts (18), and the proof of the first statement is complete.
Assume that n + m − κ < 0 n+m-\kappa<0 n + m − κ < 0 . Rearranging (19) we obtain
( n − κ ) log ( ∣ α 0 ∣ α q + 1 ) > ( n + m − κ ) log ∣ α 0 ∣ − log ∣ Φ ( u ) ∣ − 2 ∣ α 0 ∣ − m / 2 > ∣ log ∣ α 0 ∣ e ( ∣ φ ∣ + 1 ) ∣ . (n-\kappa)\log(|\alpha_{0}|\alpha_{q+1})>(n+m-\kappa)\log|\alpha_{0}|-\log|\Phi(u)|-2|\alpha_{0}|^{-m/2}>\left|\log\frac{|\alpha_{0}|}{e(|\varphi|+1)}\right|. ( n − κ ) log ( ∣ α 0 ∣ α q + 1 ) > ( n + m − κ ) log ∣ α 0 ∣ − log ∣Φ ( u ) ∣ − 2∣ α 0 ∣ − m /2 > log e ( ∣ φ ∣ + 1 ) ∣ α 0 ∣ .
Here we used that ( n + m − κ ) log ∣ α 0 ∣ ≥ ∣ log ∣ α 0 ∣ ∣ (n+m-\kappa)\log|\alpha_{0}|\ge|\log|\alpha_{0}|| ( n + m − κ ) log ∣ α 0 ∣ ≥ ∣ log ∣ α 0 ∣∣ , 2 ∣ α 0 ∣ − m / 2 < 1 2|\alpha_{0}|^{-m/2}<1 2∣ α 0 ∣ − m /2 < 1 and ∣ Φ ( u ) ∣ < ∣ φ ∣ + 1 |\Phi(u)|<|\varphi|+1 ∣Φ ( u ) ∣ < ∣ φ ∣ + 1 by Lemmata 1 and 6. Corollary 4 yields 0 < ∣ α 0 ∣ α q + 1 − 1 < 2 π u κ 1 < 1 2 0<|\alpha_{0}|\alpha_{q+1}-1<\frac{2\pi}{u^{\kappa_{1}}}<\frac{1}{2} 0 < ∣ α 0 ∣ α q + 1 − 1 < u κ 1 2 π < 2 1 as well, but then
log ( ∣ α 0 ∣ α q + 1 ) < 4 π u κ 1 \log(|\alpha_{0}|\alpha_{q+1})<\frac{4\pi}{u^{\kappa_{1}}} log ( ∣ α 0 ∣ α q + 1 ) < u κ 1 4 π
by Lemma 11. Hence
− m > n − κ > u κ 1 4 π ∣ log ∣ α 0 ∣ e ( φ + 1 ) ∣ > u κ 1 4 π log u 2 e ( ∣ φ ∣ + 1 ) , -m>n-\kappa>\frac{u^{\kappa_{1}}}{4\pi}\left|\log\frac{|\alpha_{0}|}{e(\varphi+1)}\right|>\frac{u^{\kappa_{1}}}{4\pi}\log\frac{u}{2e(|\varphi|+1)}, − m > n − κ > 4 π u κ 1 log e ( φ + 1 ) ∣ α 0 ∣ > 4 π u κ 1 log 2 e ( ∣ φ ∣ + 1 ) u ,
and the stated inequality holds with f = κ 1 f=\kappa_{1} f = κ 1 , g = ( log 2 ) / 4 π g=(\log2)/4\pi g = ( log 2 ) /4 π , when u > 2 e ( ∣ φ ∣ + 1 ) u>2e(|\varphi|+1) u > 2 e ( ∣ φ ∣ + 1 ) .
It remains to treat the case when n + m − κ = 0 n+m-\kappa=0 n + m − κ = 0 . We distinguish some cases.
Case 1, ∣ Φ ( u ) ∣ ≥ 1 |\Phi(u)|\ge1 ∣Φ ( u ) ∣ ≥ 1 . As n + m − κ = 0 n+m-\kappa=0 n + m − κ = 0 we have
∣ Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ ≥ ∣ α 0 ∣ α q + 1 > 1 + 1 2 u κ 1 |\Phi(u)|\left(|\alpha_{0}|\alpha_{q+1}\right)^{n-\kappa}|\alpha_{0}|^{-m-n+\kappa}\ge|\alpha_{0}|\alpha_{q+1}>1+\frac{1}{2u^{\kappa_{1}}} ∣Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ ∣ α 0 ∣ − m − n + κ ≥ ∣ α 0 ∣ α q + 1 > 1 + 2 u κ 1 1
by Corollary 4, but this contradicts (18) whenever − m = n − κ ≥ 2 κ 1 -m=n-\kappa\ge2\kappa_{1} − m = n − κ ≥ 2 κ 1 .
Case 2, ∣ Φ ( u ) ∣ < 1 |\Phi(u)|<1 ∣Φ ( u ) ∣ < 1 . The inequality ∣ Φ ( u ) − φ ∣ < 2 μ / u κ 2 |\Phi(u)-\varphi|<2\mu/u^{\kappa_{2}} ∣Φ ( u ) − φ ∣ < 2 μ / u κ 2 of Lemma 6 implies
∣ Φ ( u ) ∣ > ∣ φ ∣ − ∣ ∣ Φ ( u ) ∣ − ∣ φ ∣ ∣ > ∣ φ ∣ − 2 μ / u κ 2 > ∣ φ ∣ / 2 , |\Phi(u)|>|\varphi|-||\Phi(u)|-|\varphi||>|\varphi|-2\mu/u^{\kappa_{2}}>|\varphi|/2, ∣Φ ( u ) ∣ > ∣ φ ∣ − ∣∣Φ ( u ) ∣ − ∣ φ ∣∣ > ∣ φ ∣ − 2 μ / u κ 2 > ∣ φ ∣/2 ,
whenever u > u 5 u>u_{5} u > u 5 .
Subcase 2a, κ 1 ≤ κ 2 \kappa_{1}\le\kappa_{2} κ 1 ≤ κ 2 .
If ∣ φ ∣ = 1 |\varphi|=1 ∣ φ ∣ = 1 then we have
∣ Φ ( u ) ∣ > 1 − μ u κ 2 ≥ 1 − μ u κ 1 . |\Phi(u)|>1-\frac{\mu}{u^{\kappa_{2}}}\ge1-\frac{\mu}{u^{\kappa_{1}}}. ∣Φ ( u ) ∣ > 1 − u κ 2 μ ≥ 1 − u κ 1 μ .
Corollary 4 and a well known property of the exponential function imply
( ∣ α 0 ∣ α q + 1 ) n − κ > ( 1 + π 2 u κ 1 ) n − κ > 1 + π ( n − κ ) 2 u κ 1 . \left(|\alpha_{0}|\alpha_{q+1}\right)^{n-\kappa}>\left(1+\frac{\pi}{2u^{\kappa_{1}}}\right)^{n-\kappa}>1+\frac{\pi(n-\kappa)}{2u^{\kappa_{1}}}. ( ∣ α 0 ∣ α q + 1 ) n − κ > ( 1 + 2 u κ 1 π ) n − κ > 1 + 2 u κ 1 π ( n − κ ) .
Using this inequality and n + m − κ = 0 n+m-\kappa=0 n + m − κ = 0 we obtain
∣ Φ ( u ) ∣ ( ∣ α 0 ∣ ∣ α q + 1 ∣ ) n − κ ∣ α 0 ∣ − m − n + κ > ( 1 − μ u κ 1 ) ( 1 + π ( n − κ ) 2 u κ 1 ) ≥ 1 + π ( n − κ ) − 2 μ 2 u κ 1 − π μ ( n − κ ) 2 u 2 κ 1 ≥ 1 + π ( n − κ ) 4 u κ 1 − π μ ( n − κ ) 2 u 2 κ 1 = 1 + π ( n − κ ) 4 u κ 1 ( 1 − 2 μ u κ 1 ) > 1 + π ( n − κ ) 8 u κ 1 . \begin{aligned}
|\Phi(u)|\left(|\alpha_0||\alpha_{q+1}|\right)^{n-\kappa}|\alpha_0|^{-m-n+\kappa}
&> \left(1-\frac{\mu}{u^{\kappa_1}}\right)\left(1+\frac{\pi(n-\kappa)}{2u^{\kappa_1}}\right)\\
&\ge1+\frac{\pi(n-\kappa)-2\mu}{2u^{\kappa_1}}-\frac{\pi\mu(n-\kappa)}{2u^{2\kappa_1}}\\
&\ge1+\frac{\pi(n-\kappa)}{4u^{\kappa_1}}-\frac{\pi\mu(n-\kappa)}{2u^{2\kappa_1}}\\
&=1+\frac{\pi(n-\kappa)}{4u^{\kappa_1}}\left(1-\frac{2\mu}{u^{\kappa_1}}\right)\\
&>1+\frac{\pi(n-\kappa)}{8u^{\kappa_1}}.
\end{aligned} ∣Φ ( u ) ∣ ( ∣ α 0 ∣∣ α q + 1 ∣ ) n − κ ∣ α 0 ∣ − m − n + κ > ( 1 − u κ 1 μ ) ( 1 + 2 u κ 1 π ( n − κ ) ) ≥ 1 + 2 u κ 1 π ( n − κ ) − 2 μ − 2 u 2 κ 1 π μ ( n − κ ) ≥ 1 + 4 u κ 1 π ( n − κ ) − 2 u 2 κ 1 π μ ( n − κ ) = 1 + 4 u κ 1 π ( n − κ ) ( 1 − u κ 1 2 μ ) > 1 + 8 u κ 1 π ( n − κ ) .
The third inequality holds for all n ≥ 4 π μ + κ = n 5 n\ge\frac{4\pi}{\mu}+\kappa=n_5 n ≥ μ 4 π + κ = n 5 , while the last for all u u u with u > ( 4 μ ) 1 / κ 1 = u 7 u>(4\mu)^{1/\kappa_1}=u_7 u > ( 4 μ ) 1/ κ 1 = u 7 . The final inequality contradicts (18) , i.e. n + m − κ < 0 n+m-\kappa<0 n + m − κ < 0 as in Case 1.
If ∣ φ ∣ < 1 |\varphi|<1 ∣ φ ∣ < 1 , then Lemma 6 yields
∣ Φ ( u ) ∣ < ∣ φ ∣ + 2 μ u κ 2 < 1 − δ , |\Phi(u)|<|\varphi|+\frac{2\mu}{u^{\kappa_2}}<1-\delta, ∣Φ ( u ) ∣ < ∣ φ ∣ + u κ 2 2 μ < 1 − δ ,
with δ = 1 − ∣ φ ∣ − 2 μ u κ 2 > 0 \delta=1-|\varphi|-\frac{2\mu}{u^{\kappa_2}}>0 δ = 1 − ∣ φ ∣ − u κ 2 2 μ > 0 , provided u > ( 2 π / ( ∣ φ ∣ + δ − 1 ) ) 1 / κ 2 = u 8 u>(2\pi/(|\varphi|+\delta-1))^{1/\kappa_2}=u_8 u > ( 2 π / ( ∣ φ ∣ + δ − 1 ) ) 1/ κ 2 = u 8 . Corollary 4 implies ∣ α 0 ∣ ∣ α q + 1 ∣ < 1 + 2 π / u κ 1 |\alpha_0||\alpha_{q+1}|<1+2\pi/u^{\kappa_1} ∣ α 0 ∣∣ α q + 1 ∣ < 1 + 2 π / u κ 1 too. Using this inequality we obtain
( ∣ α 0 ∣ ∣ α q + 1 ∣ ) n − κ < ( 1 + 2 π u κ 1 ) n − κ = ( ( 1 + 2 π u κ 1 ) u κ 1 / ( 2 π ) ) 2 π ( n − κ ) / u κ 1 < e 2 π ( n − κ ) / u κ 1 < 1 + 4 π ( n − κ ) u κ 1 . \begin{aligned}
\left(|\alpha_0||\alpha_{q+1}|\right)^{n-\kappa}
&<\left(1+\frac{2\pi}{u^{\kappa_1}}\right)^{n-\kappa}\\
&=\left(\left(1+\frac{2\pi}{u^{\kappa_1}}\right)^{u^{\kappa_1}/(2\pi)}\right)^{2\pi(n-\kappa)/u^{\kappa_1}}\\
&<e^{2\pi(n-\kappa)/u^{\kappa_1}}<1+\frac{4\pi(n-\kappa)}{u^{\kappa_1}}.
\end{aligned} ( ∣ α 0 ∣∣ α q + 1 ∣ ) n − κ < ( 1 + u κ 1 2 π ) n − κ = ( ( 1 + u κ 1 2 π ) u κ 1 / ( 2 π ) ) 2 π ( n − κ ) / u κ 1 < e 2 π ( n − κ ) / u κ 1 < 1 + u κ 1 4 π ( n − κ ) .
The last inequality holds whenever
2 π ( n − κ ) u κ 1 < 2 π n u κ 1 < 1 / 2 , \frac{2\pi(n-\kappa)}{u^{\kappa_1}}<\frac{2\pi n}{u^{\kappa_1}}<1/2, u κ 1 2 π ( n − κ ) < u κ 1 2 π n < 1/2 ,
i.e. if n ≤ u κ 1 4 π n\le\frac{u^{\kappa_1}}{4\pi} n ≤ 4 π u κ 1 . Hence our assertion holds with g = 1 / 4 π g=1/4\pi g = 1/4 π , f = κ 1 f=\kappa_1 f = κ 1 .
Assuming n + m − κ = 0 n+m-\kappa=0 n + m − κ = 0 and n < min { u κ 1 4 π , κ + δ 8 π u κ 1 } n<\min\{\frac{u^{\kappa_1}}{4\pi},\kappa+\frac{\delta}{8\pi}u^{\kappa_1}\} n < min { 4 π u κ 1 , κ + 8 π δ u κ 1 } and combining recent inequalities we get
∣ Φ ( u ) ∣ ( ∣ α 0 ∣ ∣ α q + 1 ∣ ) n − κ < ( 1 − δ ) ( 1 + 4 π ( n − κ ) u κ 1 ) < 1 − δ + 4 π ( n − κ ) u κ 1 < 1 − δ 2 . \begin{aligned}
|\Phi(u)|\left(|\alpha_0||\alpha_{q+1}|\right)^{n-\kappa}
&<(1-\delta)\left(1+\frac{4\pi(n-\kappa)}{u^{\kappa_1}}\right)\\
&<1-\delta+\frac{4\pi(n-\kappa)}{u^{\kappa_1}}\\
&<1-\frac{\delta}{2}.
\end{aligned} ∣Φ ( u ) ∣ ( ∣ α 0 ∣∣ α q + 1 ∣ ) n − κ < ( 1 − δ ) ( 1 + u κ 1 4 π ( n − κ ) ) < 1 − δ + u κ 1 4 π ( n − κ ) < 1 − 2 δ .
This inequality contradicts (18) , i.e. n + m − κ = 0 n+m-\kappa=0 n + m − κ = 0 is only possible if n ≥ min { u κ 1 4 π , κ + δ 8 π u κ 1 } ≥ δ 8 π u κ 1 n\ge\min\{\frac{u^{\kappa_1}}{4\pi},\kappa+\frac{\delta}{8\pi}u^{\kappa_1}\}\ge\frac{\delta}{8\pi}u^{\kappa_1} n ≥ min { 4 π u κ 1 , κ + 8 π δ u κ 1 } ≥ 8 π δ u κ 1 . Hence, this time our assertion holds with g = δ = 8 π g=\delta=8\pi g = δ = 8 π , f = κ 1 f=\kappa_1 f = κ 1 .
Subcase 2b, κ 1 > κ 2 \kappa_1>\kappa_2 κ 1 > κ 2 . Another consequence of the inequality ∣ Φ ( u ) − φ ∣ < 2 μ / u κ 2 |\Phi(u)-\varphi|<2\mu/u^{\kappa_2} ∣Φ ( u ) − φ ∣ < 2 μ / u κ 2 of Lemma 6 is that Φ ( u ) \Phi(u) Φ ( u ) and φ \varphi φ have the same sign for all large enough u u u . Indeed, otherwise ∣ φ ∣ < ∣ Φ ( u ) − φ ∣ < 2 μ / u κ 2 |\varphi| < |\Phi(u)-\varphi| < 2\mu/u^{\kappa_2} ∣ φ ∣ < ∣Φ ( u ) − φ ∣ < 2 μ / u κ 2 , which is absurd whenever u > ( 2 μ / ∣ φ ∣ ) 1 / κ 2 = u 9 u > (2\mu/|\varphi|)^{1/\kappa_2}=u_9 u > ( 2 μ /∣ φ ∣ ) 1/ κ 2 = u 9 .
If ∣ φ ∣ = 1 |\varphi|=1 ∣ φ ∣ = 1 then ∣ Φ ( u ) ∣ < ∣ φ ∣ |\Phi(u)|<|\varphi| ∣Φ ( u ) ∣ < ∣ φ ∣ and the lower bound ∣ Φ ( u ) − φ ∣ > μ / 2 u κ 2 |\Phi(u)-\varphi|>\mu/2u^{\kappa_2} ∣Φ ( u ) − φ ∣ > μ /2 u κ 2 of Lemma 6 yields ∣ Φ ( u ) ∣ < ∣ φ ∣ − μ / 2 u κ 2 = 1 − μ / 2 u κ 2 |\Phi(u)|<|\varphi|-\mu/2u^{\kappa_2}=1-\mu/2u^{\kappa_2} ∣Φ ( u ) ∣ < ∣ φ ∣ − μ /2 u κ 2 = 1 − μ /2 u κ 2 .
If ∣ φ ∣ < 1 |\varphi|<1 ∣ φ ∣ < 1 then
∣ Φ ( u ) ∣ < ∣ φ ∣ + μ / 2 u κ 2 < 1 − μ / 2 u κ 2 , |\Phi(u)|<|\varphi|+\mu/2u^{\kappa_2}<1-\mu/2u^{\kappa_2}, ∣Φ ( u ) ∣ < ∣ φ ∣ + μ /2 u κ 2 < 1 − μ /2 u κ 2 ,
but the second inequality holds only if u > ( 2 ( 1 − ∣ φ ∣ ) / μ ) 1 / κ 2 = u 10 u>(2(1-|\varphi|)/\mu)^{1/\kappa_2}=u_{10} u > ( 2 ( 1 − ∣ φ ∣ ) / μ ) 1/ κ 2 = u 10 . In summary we have for 0 < φ ≤ 1 0<\varphi\leq1 0 < φ ≤ 1 uniform upper bound for ∣ Φ ( u ) ∣ |\Phi(u)| ∣Φ ( u ) ∣ . Combining that with the upper bound for ( ∣ α 0 ∣ α q + 1 ) n − κ (|\alpha_0|\alpha_{q+1})^{n-\kappa} ( ∣ α 0 ∣ α q + 1 ) n − κ proved in Subcase 2a, φ < 1 \varphi<1 φ < 1 , further assuming n + m − κ = 0 n+m-\kappa=0 n + m − κ = 0 and
n < min { u κ 1 4 π , κ + μ 8 π u κ 1 − κ 2 } , n<\min\left\{\frac{u^{\kappa_1}}{4\pi},\kappa+\frac{\mu}{8\pi}u^{\kappa_1-\kappa_2}\right\}, n < min { 4 π u κ 1 , κ + 8 π μ u κ 1 − κ 2 } ,
we get
∣ Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ < ( 1 − μ 2 u κ 2 ) ( 1 + 4 π ( n − κ ) u κ 1 ) < ( 1 − μ 2 u κ 2 ) ( 1 + μ 2 u κ 2 ) = 1 − μ 2 4 u 2 κ 2 . |\Phi(u)|(|\alpha_0|\alpha_{q+1})^{n-\kappa}
<
\left(1-\frac{\mu}{2u^{\kappa_2}}\right)
\left(1+\frac{4\pi(n-\kappa)}{u^{\kappa_1}}\right)
<
\left(1-\frac{\mu}{2u^{\kappa_2}}\right)
\left(1+\frac{\mu}{2u^{\kappa_2}}\right)
=
1-\frac{\mu^2}{4u^{2\kappa_2}}. ∣Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ < ( 1 − 2 u κ 2 μ ) ( 1 + u κ 1 4 π ( n − κ ) ) < ( 1 − 2 u κ 2 μ ) ( 1 + 2 u κ 2 μ ) = 1 − 4 u 2 κ 2 μ 2 .
Thus
∣ ∣ Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ − 1 ∣ = 1 − ∣ Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ > μ 2 4 u 2 κ 2 . \left||\Phi(u)|(|\alpha_0|\alpha_{q+1})^{n-\kappa}-1\right|
=
1-|\Phi(u)|(|\alpha_0|\alpha_{q+1})^{n-\kappa}
>
\frac{\mu^2}{4u^{2\kappa_2}}. ∣Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ − 1 = 1 − ∣Φ ( u ) ∣ ( ∣ α 0 ∣ α q + 1 ) n − κ > 4 u 2 κ 2 μ 2 .
which contradicts again (18). To avoid contradiction n n n must be large, more precisely
n ≥ min { u κ 1 4 π , κ + μ 8 π u κ 1 − κ 2 } ≥ μ 8 π u κ 1 − κ 2 . n\geq\min\left\{\frac{u^{\kappa_1}}{4\pi},\kappa+\frac{\mu}{8\pi}u^{\kappa_1-\kappa_2}\right\}
\geq\frac{\mu}{8\pi}u^{\kappa_1-\kappa_2}. n ≥ min { 4 π u κ 1 , κ + 8 π μ u κ 1 − κ 2 } ≥ 8 π μ u κ 1 − κ 2 .
Our inequality holds with g = μ / 8 π g=\mu/8\pi g = μ /8 π , f = κ 1 − κ 2 > 0 f=\kappa_1-\kappa_2>0 f = κ 1 − κ 2 > 0 . All assertions of the lemma are proved. □
We are left to deal with ∣ α 0 ( u ) ∣ α q + 1 ( u ) < 1 |\alpha_0(u)|\alpha_{q+1}(u)<1 ∣ α 0 ( u ) ∣ α q + 1 ( u ) < 1 .
Lemma 13. Assume that ( n , m . u ) ∈ Z 3 (n,m.u)\in\mathbb{Z}^3 ( n , m . u ) ∈ Z 3 is a solution of (3) such that n ≥ 0 , m < 0 n\geq0,m<0 n ≥ 0 , m < 0 . Denote κ 1 , κ 2 , φ \kappa_1,\kappa_2,\varphi κ 1 , κ 2 , φ the constants introduced in Corollary 4 and Lemma 6. If ∣ α 0 ( u ) ∣ α q + 1 ( u ) < 1 |\alpha_0(u)|\alpha_{q+1}(u)<1 ∣ α 0 ( u ) ∣ α q + 1 ( u ) < 1 and u ≥ u 2 u\geq u_2 u ≥ u 2 then n + m − κ ≥ 0 n+m-\kappa\geq0 n + m − κ ≥ 0 , and equality may hold only if ∣ Φ ( u ) ∣ > 1 |\Phi(u)|>1 ∣Φ ( u ) ∣ > 1 and κ 1 > κ 2 \kappa_1>\kappa_2 κ 1 > κ 2 or ∣ Φ ( u ) ∣ > 1 |\Phi(u)|>1 ∣Φ ( u ) ∣ > 1 and κ 1 ≤ κ 2 \kappa_1\leq\kappa_2 κ 1 ≤ κ 2 and ∣ φ ∣ < 1 |\varphi|<1 ∣ φ ∣ < 1 . Moreover, if u > max { u 1 , … , u 10 } u>\max\{u_1,\ldots,u_{10}\} u > max { u 1 , … , u 10 } then there exist effectively computable constants g , f > 0 g,f>0 g , f > 0 such that n ≥ − m + κ > g u f n\geq-m+\kappa>gu^f n ≥ − m + κ > g u f .
Proof. If ∣ α 0 ( u ) ∣ α q + 1 ( u ) < 1 |\alpha_0(u)|\alpha_{q+1}(u)<1 ∣ α 0 ( u ) ∣ α q + 1 ( u ) < 1 then inequality (16) implies
− m < n log α q + 1 − log ∣ α 0 ∣ + log ∣ a 0 / ( 3 a q + 1 ) ∣ − log α 0 < n + c 9 , -m<n\frac{\log\alpha_{q+1}}{-\log|\alpha_0|}
+\frac{\log|a_0/(3a_{q+1})|}{-\log\alpha_0}
<n+c_9, − m < n − log ∣ α 0 ∣ log α q + 1 + − log α 0 log ∣ a 0 / ( 3 a q + 1 ) ∣ < n + c 9 , with the constant c 9 c_9 c 9 defined before Lemma 12. Following the argumentation there we now derive from inequality (15) with division by ∣ a q + 1 ∣ ∣ α q + 1 n ∣ |a_{q+1}||\alpha_{q+1}^n| ∣ a q + 1 ∣∣ α q + 1 n ∣ and performing some manipulation
∣ ∣ Φ ( u ) ∣ − 1 ( ∣ α 0 ( u ) ∣ α q + 1 ( u ) ) − n + κ α q + 1 ( u ) n + m − κ − 1 ∣ < α q + 1 ( u ) − n / 2 , (20) \left||\Phi(u)|^{-1}(|\alpha_0(u)|\alpha_{q+1}(u))^{-n+\kappa}\alpha_{q+1}(u)^{n+m-\kappa}-1\right|
<\alpha_{q+1}(u)^{-n/2}, \tag*{(20)} ∣Φ ( u ) ∣ − 1 ( ∣ α 0 ( u ) ∣ α q + 1 ( u ) ) − n + κ α q + 1 ( u ) n + m − κ − 1 < α q + 1 ( u ) − n /2 , (20)
which yields
∣ log ∣ Φ ( u ) ∣ + ( n − κ ) log ( ∣ α 0 α q + 1 ∣ ) + ( − m − n + κ ) log ∣ α q + 1 ∣ ∣ < 2 α q + 1 − n / 2 . (21) \left|\log|\Phi(u)|+(n-\kappa)\log\left(|\alpha_0\alpha_{q+1}|\right)+(-m-n+\kappa)\log|\alpha_{q+1}|\right|<2\alpha_{q+1}^{-n/2}. \tag*{(21)} ∣ log ∣Φ ( u ) ∣ + ( n − κ ) log ( ∣ α 0 α q + 1 ∣ ) + ( − m − n + κ ) log ∣ α q + 1 ∣ ∣ < 2 α q + 1 − n /2 . (21)
From here on one can follow the same argumentation as used in the proof of Lemma 12 taking into account that ∣ α 0 ∣ − 1 |\alpha_0|^{-1} ∣ α 0 ∣ − 1 and α q + 1 \alpha_{q+1} α q + 1 have the same order of magnitude. As an example we prove that n + m − κ ≤ 0 n+m-\kappa\leq0 n + m − κ ≤ 0 . Assume in the contrary that n + m − κ > 0 n+m-\kappa>0 n + m − κ > 0 . If n > κ n>\kappa n > κ then
∣ Φ ( u ) ∣ − 1 ( ∣ α 0 α q + 1 ∣ ) − n + κ ∣ α q + 1 ∣ n + m − κ ≥ 1 2 ∣ φ ∣ ( 1 + 1 2 u κ ) u 2 > 1 + 1 2 u κ |\Phi(u)|^{-1}(|\alpha_0\alpha_{q+1}|)^{-n+\kappa}|\alpha_{q+1}|^{n+m-\kappa}\geq\frac{1}{2|\varphi|}\left(1+\frac{1}{2u^\kappa}\right)\frac{u}{2}>1+\frac{1}{2u^\kappa} ∣Φ ( u ) ∣ − 1 ( ∣ α 0 α q + 1 ∣ ) − n + κ ∣ α q + 1 ∣ n + m − κ ≥ 2∣ φ ∣ 1 ( 1 + 2 u κ 1 ) 2 u > 1 + 2 u κ 1
because ∣ Φ ( u ) ∣ < ∣ φ ∣ + 2 ∣ μ ∣ / u κ 2 < 2 φ |\Phi(u)|<|\varphi|+2|\mu|/u^{\kappa^2}<2\varphi ∣Φ ( u ) ∣ < ∣ φ ∣ + 2∣ μ ∣/ u κ 2 < 2 φ and α q + 1 n + m − κ ≥ α q + 1 > u / 2 \alpha_{q+1}^{n+m-\kappa}\geq\alpha_{q+1}>u/2 α q + 1 n + m − κ ≥ α q + 1 > u /2 , provided u u u is large enough. This contradicts (18). □
Final step
We proved in the last subsection that if n n n , m m m , u u u is a solution triplet of (3) such that u ≥ max { u 1 , … , u 10 } u\geq\max\{u_1,\ldots,u_{10}\} u ≥ max { u 1 , … , u 10 } , n ≥ 0 n\geq0 n ≥ 0 , m < 0 m<0 m < 0 then n , ∣ m ∣ > g u f n,|m|>g u^f n , ∣ m ∣ > g u f , with some effective constants g , f > 0 g,f>0 g , f > 0 . We derive effective upper bound for max { n , ∣ m ∣ } \max\{n,|m|\} max { n , ∣ m ∣ } by applying Matveev’s theorem, Lemma 9, to the inequalities (18) and (20). To this end we write (18) in the form
∣ Γ ( u ) − 1 ∣ < ∣ α 0 ( u ) ∣ − m / 2 (22) |\Gamma(u)-1|<|\alpha_0(u)|^{-m/2} \tag*{(22)} ∣Γ ( u ) − 1∣ < ∣ α 0 ( u ) ∣ − m /2 (22)
with
Γ ( u ) = ∣ a q + 1 ( u ) a 0 ( u ) ∣ ∣ α 0 ( u ) ∣ m α q + 1 ( u ) n . \Gamma(u)=\left|\frac{a_{q+1}(u)}{a_0(u)}\right||\alpha_0(u)|^m\alpha_{q+1}(u)^n. Γ ( u ) = a 0 ( u ) a q + 1 ( u ) ∣ α 0 ( u ) ∣ m α q + 1 ( u ) n .
With this notation (20) becomes
∣ Γ ( u ) − 1 − 1 ∣ < α q + 1 ( u ) − n / 2 , |\Gamma(u)^{-1}-1|<\alpha_{q+1}(u)^{-n/2}, ∣Γ ( u ) − 1 − 1∣ < α q + 1 ( u ) − n /2 ,
but then ∣ Γ ( u ) − 1 ∣ > 1 / 2 |\Gamma(u)^{-1}|>1/2 ∣Γ ( u ) − 1 ∣ > 1/2 , i.e. after division by ∣ Γ ( u ) − 1 ∣ |\Gamma(u)^{-1}| ∣Γ ( u ) − 1 ∣
∣ Γ ( u ) − 1 ∣ < α q + 1 ( u ) − n / 2 ∣ Γ ( u ) ∣ − 1 < 2 α q + 1 ( u ) − n / 2 , (23) |\Gamma(u)-1|<\frac{\alpha_{q+1}(u)^{-n/2}}{|\Gamma(u)|^{-1}}<2\alpha_{q+1}(u)^{-n/2}, \tag*{(23)} ∣Γ ( u ) − 1∣ < ∣Γ ( u ) ∣ − 1 α q + 1 ( u ) − n /2 < 2 α q + 1 ( u ) − n /2 , (23)
The left hand side of this inequality is the same as of (22), and there is slight difference in the right hand side. Hence the induced lower bound by Matveev’s theorem is the same for (18) and (20).
Our last lemma justify the applicability of Matveev’s theorem.
Lemma 14. There is a constant n 5 n_5 n 5 depending only on Q ( X ) Q(X) Q ( X ) and L L L such that if u ≥ u 2 u\geq u_2 u ≥ u 2 then
Γ ( u ) = ∣ a q + 1 ( u ) a 0 ( u ) ∣ ∣ α 0 ( u ) ∣ m α q + 1 ( u ) n ≠ 1 , \Gamma(u)=\left|\frac{a_{q+1}(u)}{a_0(u)}\right||\alpha_0(u)|^m\alpha_{q+1}(u)^n\ne1, Γ ( u ) = a 0 ( u ) a q + 1 ( u ) ∣ α 0 ( u ) ∣ m α q + 1 ( u ) n = 1 , provided max { ∣ n ∣ , ∣ m ∣ } ≥ n 5 \max\{|n|,|m|\}\geq n_5 max { ∣ n ∣ , ∣ m ∣ } ≥ n 5 .
We postpone the rather technical proof of this lemma to the end of the paper. If max { ∣ n ∣ , ∣ m ∣ } < n 5 \max\{|n|,|m|\}<n_5 max { ∣ n ∣ , ∣ m ∣ } < n 5 then the proof is finished. Otherwise, by Lemma 14, Matveev’s theorem is applicable to obtain lower bounds for the left hand side of the inequalities (18) and (20). We have actually K = Q ( α 0 ( u ) , … , α q + 1 ( u ) ) \mathbb{K}=\mathbb{Q}(\alpha_0(u),\ldots,\alpha_{q+1}(u)) K = Q ( α 0 ( u ) , … , α q + 1 ( u )) , hence d K ≤ ( q + 2 ) ! d_{\mathbb{K}}\leq(q+2)! d K ≤ ( q + 2 )! . Further t = 3 t=3 t = 3 ,
η 1 = ∣ a q + 1 ( u ) a 0 ( u ) ∣ , η 2 = ∣ α 0 ( u ) ∣ , η 3 = α q + 1 ( u ) , \eta_1=\left|\frac{a_{q+1}(u)}{a_0(u)}\right|,\quad\eta_2=|\alpha_0(u)|,\quad\eta_3=\alpha_{q+1}(u), η 1 = a 0 ( u ) a q + 1 ( u ) , η 2 = ∣ α 0 ( u ) ∣ , η 3 = α q + 1 ( u ) ,
and e 1 = 1 , e 2 = m , e 3 = n e_1 = 1, e_2 = m, e_3 = n e 1 = 1 , e 2 = m , e 3 = n and E = max { n , ∣ m ∣ } E = \max\{n, |m|\} E = max { n , ∣ m ∣ } . If ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ log ( α q + 1 ( u ) ) > 1 |\log(|\alpha_0(u)|)|\log(\alpha_{q+1}(u)) > 1 ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ log ( α q + 1 ( u )) > 1 then n < − m + c 9 ≤ 2 ∣ m ∣ n < -m + c_9 \leq2|m| n < − m + c 9 ≤ 2∣ m ∣ , i.e. E ≤ − 2 m E \leq-2m E ≤ − 2 m , provided − m ≥ c 9 -m \geq c_9 − m ≥ c 9 . If, however, log ( ∣ α 0 ( u ) ∣ ) log ( α q + 1 ( u ) ) < 1 \log(|\alpha_0(u)|)\log(\alpha_{q+1}(u)) < 1 log ( ∣ α 0 ( u ) ∣ ) log ( α q + 1 ( u )) < 1 then − m < n + c 9 ≤ 2 n -m < n + c_9 \leq2n − m < n + c 9 ≤ 2 n , i.e. E ≤ 2 n E \leq2n E ≤ 2 n , provided n ≥ c 9 n \geq c_9 n ≥ c 9 .
Plainly h ( η 2 ) = h ( η 3 ) h(\eta_2) = h(\eta_3) h ( η 2 ) = h ( η 3 ) , and
h ( η 3 ) = h ( α q + 1 ( u ) ) = 1 q + 2 ( log ( α q + 1 ( u ) ) − log ( ∣ α 0 ( u ) ∣ ) + ∑ j = 1 q max { 1 , log ∣ α j ( u ) ∣ } ) ≤ log ( α q + 1 ( u ) ) . \begin{aligned}
h(\eta_3) = h(\alpha_{q+1}(u)) = \frac{1}{q+2}\left(\log(\alpha_{q+1}(u)) - \log(|\alpha_0(u)|) + \sum_{j=1}^{q}\max\{1,\log|\alpha_j(u)|\}\right) \\
&\leq\log(\alpha_{q+1}(u)).
\end{aligned} h ( η 3 ) = h ( α q + 1 ( u )) = q + 2 1 ( log ( α q + 1 ( u )) − log ( ∣ α 0 ( u ) ∣ ) + j = 1 ∑ q max { 1 , log ∣ α j ( u ) ∣ } ) ≤ log ( α q + 1 ( u )) .
This is true because the sum in the large bracket is at most 3 log α q + 1 ( u ) 3\log\alpha_{q+1}(u) 3 log α q + 1 ( u ) and q ≥ 1 q \geq1 q ≥ 1 .
To estimate h ( η 1 ) h(\eta_1) h ( η 1 ) we apply several times the inequalities of Lemma 8. Let us start with
h ( η 1 ) = h ( a q + 1 ( u ) a 0 ( u ) ) = h ( D q + 1 ( u ) D 0 ( u ) ) ≤ h ( D q + 1 ( u ) ) + h ( D 0 ( u ) ) . h(\eta_1) = h\left(\frac{a_{q+1}(u)}{a_0(u)}\right) = h\left(\frac{D_{q+1}(u)}{D_0(u)}\right) \leq h(D_{q+1}(u)) + h(D_0(u)). h ( η 1 ) = h ( a 0 ( u ) a q + 1 ( u ) ) = h ( D 0 ( u ) D q + 1 ( u ) ) ≤ h ( D q + 1 ( u )) + h ( D 0 ( u )) .
Notice that D q + 1 ( u ) D_{q+1}(u) D q + 1 ( u ) and D 0 ( u ) D_0(u) D 0 ( u ) are algebraic integers because both are the sum of ( q + 2 ) ! (q+2)! ( q + 2 )! products of algebraic integers. For example D q + 1 ( u ) D_{q+1}(u) D q + 1 ( u ) is the sum of terms of form
α 0 ( u ) i 0 ⋯ α q ( u ) i q ⋅ A i q + 1 . \alpha_0(u)^{i_0}\cdots\alpha_q(u)^{i_q}\cdot A_{i_{q+1}}. α 0 ( u ) i 0 ⋯ α q ( u ) i q ⋅ A i q + 1 .
where ( i 0 , … , i q + 1 ) (i_0,\ldots,i_{q+1}) ( i 0 , … , i q + 1 ) denotes a permutation of { 0 , … , q + 1 } \{0,\ldots,q+1\} { 0 , … , q + 1 } . The numbers α j ( u ) \alpha_j(u) α j ( u ) , j = 0 , … , q + 1 j = 0,\ldots,q+1 j = 0 , … , q + 1 are the zeroes of the irreducible polynomial P u ( X ) P_u(X) P u ( X ) , hence
h ( α j ( u ) ) = h ( α q + 1 ( u ) ) ≤ log ( α q + 1 ( u ) ) , j = 0 , … , q + 1. h(\alpha_j(u)) = h(\alpha_{q+1}(u)) \leq\log(\alpha_{q+1}(u)), \qquad j = 0,\ldots,q+1. h ( α j ( u )) = h ( α q + 1 ( u )) ≤ log ( α q + 1 ( u )) , j = 0 , … , q + 1.
Further h ( A j ) ≤ log L h(A_j) \leq\log L h ( A j ) ≤ log L , j = 0 , … , q + 1 j = 0,\ldots,q+1 j = 0 , … , q + 1 . Hence
h ( α 0 ( u ) i 0 ⋯ α q ( u ) i q ⋅ A i q + 1 ) ≤ i 0 h ( α 0 ( u ) ) + ⋯ + i q h ( α q ( u ) ) + log L ≤ ( q + 1 ) 2 h ( α q + 1 ( u ) ) + log L ≤ c 13 log ( α q + 1 ( u ) ) . \begin{aligned}
h\left(\alpha_0(u)^{i_0}\cdots\alpha_q(u)^{i_q}\cdot A_{i_{q+1}}\right)
&\leq i_0h(\alpha_0(u))+\cdots+i_qh(\alpha_q(u))+\log L\\
&\leq(q+1)^2h(\alpha_{q+1}(u))+\log L\\
&\leq c_{13}\log(\alpha_{q+1}(u)).
\end{aligned} h ( α 0 ( u ) i 0 ⋯ α q ( u ) i q ⋅ A i q + 1 ) ≤ i 0 h ( α 0 ( u )) + ⋯ + i q h ( α q ( u )) + log L ≤ ( q + 1 ) 2 h ( α q + 1 ( u )) + log L ≤ c 13 log ( α q + 1 ( u )) .
We denote the expression of the right hand side by H H H .
Set k = ⌈ log 2 ( q + 2 ) ! ⌉ k = \lceil\log_2(q+2)!\rceil k = ⌈ log 2 ( q + 2 )!⌉ , where log 2 ( ) \log_2() log 2 ( ) denotes the logarithm function to base 2. Consider the binary tree of depth k k k with leaves the summands of D q + 1 ( u ) D_{q+1}(u) D q + 1 ( u ) . The nodes of each level represent the appropriately signed sum of its two children, hence the root is D q + 1 ( u ) D_{q+1}(u) D q + 1 ( u ) . We estimate the Weil height of the nodes, whose level is counted top down. At the first level, i.e. at the leaves, the height of each node is bounded by H 1 = H H_1 = H H 1 = H . If the height of the nodes at the j j j -th, j ≥ 1 j \geq1 j ≥ 1 level is bounded by H j H_j H j , then
H j + 1 ≤ 2 H j + log 2 = 4 H j − 1 + 3 log 2 = ⋯ = 2 j H 1 + 2 j − 1 < 2 j ( H + 1 ) . H_{j+1} \leq2H_j + \log2 = 4H_{j-1} + 3\log2 = \cdots= 2^jH_1 + 2^j - 1 < 2^j(H+1). H j + 1 ≤ 2 H j + log 2 = 4 H j − 1 + 3 log 2 = ⋯ = 2 j H 1 + 2 j − 1 < 2 j ( H + 1 ) .
Hence
h ( D q + 1 ( u ) ) ≤ 2 k − 1 ( H + 1 ) ≤ ( q + 2 ) ! ( H + 1 ) ≤ c 14 log ( α q + 1 ( u ) ) . h(D_{q+1}(u)) \leq2^{k-1}(H+1) \leq(q+2)!(H+1) \leq c_{14}\log(\alpha_{q+1}(u)). h ( D q + 1 ( u )) ≤ 2 k − 1 ( H + 1 ) ≤ ( q + 2 )! ( H + 1 ) ≤ c 14 log ( α q + 1 ( u )) .
The same estimation holds for h ( D 0 ) h(D_0) h ( D 0 ) , because D 0 ( u ) D_0(u) D 0 ( u ) and D q + 1 ( u ) D_{q+1}(u) D q + 1 ( u ) are algebraic conjugates, hence
h ( η 1 ) ≤ 2 c 14 log ( α q + 1 ( u ) ) . h(\eta_1) \leq2c_{14}\log(\alpha_{q+1}(u)). h ( η 1 ) ≤ 2 c 14 log ( α q + 1 ( u )) .
This means that the choice F 1 = F 2 = F 3 = c 14 log ( α q + 1 ( u ) ) F_1 = F_2 = F_3 = c_{14}\log(\alpha_{q+1}(u)) F 1 = F 2 = F 3 = c 14 log ( α q + 1 ( u )) is allowed, and Lemma 9 yields
log ∣ Γ ∣ > − c 15 ( 1 + log ( 3 E ) ) c 14 3 log 3 ( α q + 1 ( u ) ) > − c 16 ( log E ) log 3 ( α q + 1 ( u ) ) . (24) \begin{aligned}
\log|\Gamma| &> -c_{15}(1+\log(3E))c_{14}^{3}\log^{3}(\alpha_{q+1}(u)) \\
&> -c_{16}(\log E)\log^{3}(\alpha_{q+1}(u)). \tag*{(24)}
\end{aligned} log ∣Γ∣ > − c 15 ( 1 + log ( 3 E )) c 14 3 log 3 ( α q + 1 ( u )) > − c 16 ( log E ) log 3 ( α q + 1 ( u )) . (24)
In c 15 c_{15} c 15 we incorporated that t = 3 t=3 t = 3 and the estimations for d K d_{K} d K , which depends only on q q q .
If ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ log ( α q + 1 ( u ) ) > 1 |\log(|\alpha_0(u)|)|\log(\alpha_{q+1}(u))>1 ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ log ( α q + 1 ( u )) > 1 then we may set E = 2 ∣ m ∣ E=2|m| E = 2∣ m ∣ and comparing this lower bound (24) with the upper bound (22) we obtain
∣ m ∣ 2 ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ < c 16 log ( 2 ∣ m ∣ ) log 3 ( α q + 1 ( u ) ) . \frac{|m|}{2}|\log(|\alpha_0(u)|)|<c_{16}\log(2|m|)\log^{3}(\alpha_{q+1}(u)). 2 ∣ m ∣ ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ < c 16 log ( 2∣ m ∣ ) log 3 ( α q + 1 ( u )) .
Corollary 4 yields 0 < ∣ α 0 ∣ α q + 1 − 1 < 2 π u κ 1 < 3 2 0<|\alpha_0|\alpha_{q+1}-1<\frac{2\pi}{u^{\kappa_1}}<\frac{3}{2} 0 < ∣ α 0 ∣ α q + 1 − 1 < u κ 1 2 π < 2 3 as well, but then
log ( ∣ α 0 ∣ α q + 1 ) < 4 π u κ 1 \log(|\alpha_0|\alpha_{q+1})<\frac{4\pi}{u^{\kappa_1}} log ( ∣ α 0 ∣ α q + 1 ) < u κ 1 4 π
by Lemma 11. Hence
∣ log ( ∣ α 0 ( u ) ∣ ) ∣ = − log ( ∣ α 0 ( u ) ∣ ) > log ( α q + 1 ( u ) ) − 4 π u κ 1 ≥ log ( α q + 1 ( u ) ) 2 , |\log(|\alpha_0(u)|)|=-\log(|\alpha_0(u)|)>\log(\alpha_{q+1}(u))-\frac{4\pi}{u^{\kappa_1}}\ge\frac{\log(\alpha_{q+1}(u))}{2}, ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ = − log ( ∣ α 0 ( u ) ∣ ) > log ( α q + 1 ( u )) − u κ 1 4 π ≥ 2 log ( α q + 1 ( u )) ,
which allow us to rewrite the last inequality including m m m as
2 ∣ m ∣ log 2 ∣ m ∣ < 8 c 16 log 2 ( α q + 1 ( u ) ) . \frac{2|m|}{\log2|m|}<8c_{16}\log^{2}(\alpha_{q+1}(u)). log 2∣ m ∣ 2∣ m ∣ < 8 c 16 log 2 ( α q + 1 ( u )) .
Now we apply Lemma 10 with s = 1 s=1 s = 1 and T = 8 c 18 log 2 ( α q + 1 ( u ) ) T=8c_{18}\log^{2}(\alpha_{q+1}(u)) T = 8 c 18 log 2 ( α q + 1 ( u )) and get
∣ m ∣ < c 17 log 3 ( α q + 1 ( u ) ) . |m|<c_{17}\log^{3}(\alpha_{q+1}(u)). ∣ m ∣ < c 17 log 3 ( α q + 1 ( u )) .
after some simple and obvious computation.
On the other hand Lemma 12 gives us a lower bound for ∣ m ∣ |m| ∣ m ∣ , which yields
g u f < ∣ m ∣ < c 17 log 3 ( α q + 1 ( u ) ) , gu^{f}<|m|<c_{17}\log^{3}(\alpha_{q+1}(u)), g u f < ∣ m ∣ < c 17 log 3 ( α q + 1 ( u )) ,
with positive constants g , f g,f g , f . This inequality yields u < c 18 u<c_{18} u < c 18 , but then ∣ m ∣ |m| ∣ m ∣ and n n n are bounded too.
In the case ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ log ( α q + 1 ( u ) ) > 1 |\log(|\alpha_0(u)|)|\log(\alpha_{q+1}(u))>1 ∣ log ( ∣ α 0 ( u ) ∣ ) ∣ log ( α q + 1 ( u )) > 1 we set E = 2 n E=2n E = 2 n and compare the lower bound (24) with (23) we obtain
∣ n ∣ 2 log ( α q + 1 ( u ) ) + log 2 < c 16 log ( 2 n ) log 3 ( q + 1 ) ( α q + 1 ( u ) ) . \frac{|n|}{2}\log(\alpha_{q+1}(u))+\log2<c_{16}\log(2n)\log^{3(q+1)}(\alpha_{q+1}(u)). 2 ∣ n ∣ log ( α q + 1 ( u )) + log 2 < c 16 log ( 2 n ) log 3 ( q + 1 ) ( α q + 1 ( u )) .
From here we can derive upper bound for n n n as we did for ∣ m ∣ |m| ∣ m ∣ above. Hence our theorem holds with u 0 = max { u 1 , … , u 10 , c 18 } u_0=\max\{u_1,\ldots,u_{10},c_{18}\} u 0 = max { u 1 , … , u 10 , c 18 } and
n 0 = max { n 1 , … , n 5 , c 17 log 3 ( q + 1 ) ( α q + 1 ( u 0 ) ) } . n_0=\max\{n_1,\ldots,n_5,c_{17}\log^{3(q+1)}(\alpha_{q+1}(u_0))\}. n 0 = max { n 1 , … , n 5 , c 17 log 3 ( q + 1 ) ( α q + 1 ( u 0 ))} .
□ \square □
Proof of Lemma 14. Assume that there is a u > u 2 u>u_2 u > u 2 such that Γ ( u ) = 1 \Gamma(u)=1 Γ ( u ) = 1 , i.e.
a q + 1 ( u ) a 0 ( u ) α 0 ( u ) m α q + 1 ( u ) n = ± 1 (25) \frac{a_{q+1}(u)}{a_0(u)}\alpha_0(u)^m\alpha_{q+1}(u)^n=\pm1 \tag*{(25)} a 0 ( u ) a q + 1 ( u ) α 0 ( u ) m α q + 1 ( u ) n = ± 1 (25)
because all factors of Γ \Gamma Γ are real. The polynomial P u ( X ) P_u(X) P u ( X ) is irreducible, because u > u 2 u>u_2 u > u 2 . Denote Σ \Sigma Σ the Galois group of the normal closure of Q ( α 0 ( u ) ) \mathbb{Q}(\alpha_0(u)) Q ( α 0 ( u )) . Assume that there is a σ ∈ Σ \sigma\in\Sigma σ ∈ Σ , which swaps α 0 ( u ) \alpha_0(u) α 0 ( u ) and α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) . Then
± 1 = σ ( a q + 1 ( u ) a 0 ( u ) α 0 ( u ) m α q + 1 ( u ) n ) = σ ( D q + 1 ( u ) D 0 ( u ) α 0 ( u ) m α q + 1 ( u ) n ) = σ ( D q + 1 ( u ) ) σ ( D 0 ( u ) ) α q + 1 ( u ) m α 0 ( u ) n = ± D 0 ( u ) D q + 1 ( u ) α q + 1 ( u ) m α 0 ( u ) n = ± a 0 ( u ) a q + 1 ( u ) α q + 1 ( u ) m α 0 ( u ) n . \begin{aligned}
\pm1 &= \sigma\left(\frac{a_{q+1}(u)}{a_0(u)}\alpha_0(u)^m\alpha_{q+1}(u)^n\right)
= \sigma\left(\frac{D_{q+1}(u)}{D_0(u)}\alpha_0(u)^m\alpha_{q+1}(u)^n\right) \\
&= \frac{\sigma(D_{q+1}(u))}{\sigma(D_0(u))}\alpha_{q+1}(u)^m\alpha_0(u)^n
= \pm\frac{D_0(u)}{D_{q+1}(u)}\alpha_{q+1}(u)^m\alpha_0(u)^n \\
&= \pm\frac{a_0(u)}{a_{q+1}(u)}\alpha_{q+1}(u)^m\alpha_0(u)^n.
\end{aligned} ± 1 = σ ( a 0 ( u ) a q + 1 ( u ) α 0 ( u ) m α q + 1 ( u ) n ) = σ ( D 0 ( u ) D q + 1 ( u ) α 0 ( u ) m α q + 1 ( u ) n ) = σ ( D 0 ( u )) σ ( D q + 1 ( u )) α q + 1 ( u ) m α 0 ( u ) n = ± D q + 1 ( u ) D 0 ( u ) α q + 1 ( u ) m α 0 ( u ) n = ± a q + 1 ( u ) a 0 ( u ) α q + 1 ( u ) m α 0 ( u ) n .
This equality together with (25) yields
( α 0 ( u ) α q + 1 ( u ) ) n + m = ± 1 , \left(\alpha_0(u)\alpha_{q+1}(u)\right)^{n+m}=\pm1, ( α 0 ( u ) α q + 1 ( u ) ) n + m = ± 1 ,
but this is impossible as we showed in the proof of Lemma 1 (v).
In the last equality chain we used Lemma 4 (iii), and that σ ( D q + 1 ( u ) ) = ± D 0 ( u ) \sigma(D_{q+1}(u))=\pm D_0(u) σ ( D q + 1 ( u )) = ± D 0 ( u ) and σ ( D 0 ( u ) ) = ± D q + 1 ( u ) \sigma(D_0(u))=\pm D_{q+1}(u) σ ( D 0 ( u )) = ± D q + 1 ( u ) , which are true by Lemma 4 (iv).
In the rest of the proof we assume that there is no σ ∈ Σ \sigma\in\Sigma σ ∈ Σ , which swaps α 0 ( u ) \alpha_0(u) α 0 ( u ) and α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) .
If n > 0 n>0 n > 0 and m ≤ 0 m\leq0 m ≤ 0 then
∣ α 0 ( u ) m α q + 1 ( u ) n ∣ = ∣ a 0 ( u ) a i ( u ) ∣ = ∣ D 0 ( u ) D q + 1 ( u ) ∣ < ( c 4 L ) q + 1 α q + 1 ( u ) ( q + 1 ) 2 \left|\alpha_0(u)^m\alpha_{q+1}(u)^n\right|=\left|\frac{a_0(u)}{a_i(u)}\right|=\left|\frac{D_0(u)}{D_{q+1}(u)}\right|<(c_4L)^{q+1}\alpha_{q+1}(u)^{(q+1)^2} ∣ α 0 ( u ) m α q + 1 ( u ) n ∣ = a i ( u ) a 0 ( u ) = D q + 1 ( u ) D 0 ( u ) < ( c 4 L ) q + 1 α q + 1 ( u ) ( q + 1 ) 2
by Lemma 5, which implies an absolute bound, n 5 , 1 n_{5,1} n 5 , 1 , for m , ∣ n ∣ m,|n| m , ∣ n ∣ immediately.
If n , m > 0 n,m>0 n , m > 0 then we distinguish two cases: 0 < m < n 0<m<n 0 < m < n and 0 < n < m 0<n<m 0 < n < m . In the first case pick a σ ∈ Σ \sigma\in\Sigma σ ∈ Σ , which maps α 0 ( u ) \alpha_0(u) α 0 ( u ) to α i ( u ) \alpha_i(u) α i ( u ) for some 0 < i < q + 1 0<i<q+1 0 < i < q + 1 , and α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) to α 0 ( u ) \alpha_0(u) α 0 ( u ) . This is possible because q ≥ 1 q\geq1 q ≥ 1 . Applying σ \sigma σ to (25) we get
a 0 ( u ) a i ( u ) α i ( u ) m α 0 ( u ) n = ± 1 , (26) \frac{a_0(u)}{a_i(u)}\alpha_i(u)^m\alpha_0(u)^n=\pm1, \tag*{(26)} a i ( u ) a 0 ( u ) α i ( u ) m α 0 ( u ) n = ± 1 , (26)
which implies
∣ 1 α 0 ( u ) ∣ n ∣ 1 α i ( u ) ∣ m = ∣ a 0 ( u ) a i ( u ) ∣ < ( c 4 L ) q + 1 α q + 1 ( u ) ( q + 1 ) 2 . \left|\frac{1}{\alpha_0(u)}\right|^n\left|\frac{1}{\alpha_i(u)}\right|^m=\left|\frac{a_0(u)}{a_i(u)}\right|<(c_4L)^{q+1}\alpha_{q+1}(u)^{(q+1)^2}. α 0 ( u ) 1 n α i ( u ) 1 m = a i ( u ) a 0 ( u ) < ( c 4 L ) q + 1 α q + 1 ( u ) ( q + 1 ) 2 .
As ∣ α 0 ( u ) α q + 1 ( u ) ∣ < 2 |\alpha_0(u)\alpha_{q+1}(u)|<2 ∣ α 0 ( u ) α q + 1 ( u ) ∣ < 2 by Corollary 4, and ∣ α i ( u ) α q + 1 ( u ) ∣ < F |\alpha_i(u)\alpha_{q+1}(u)|<F ∣ α i ( u ) α q + 1 ( u ) ∣ < F by Corollary 1 we get
( α q + 1 ( u ) 2 2 F ) m < ( α q + 1 ( u ) 2 ) n ( α q + 1 ( u ) F ) m < ∣ 1 α 0 ( u ) ∣ n ∣ 1 α i ( u ) ∣ m . \left(\frac{\alpha_{q+1}(u)^2}{2F}\right)^m<\left(\frac{\alpha_{q+1}(u)}{2}\right)^n\left(\frac{\alpha_{q+1}(u)}{F}\right)^m<\left|\frac{1}{\alpha_0(u)}\right|^n\left|\frac{1}{\alpha_i(u)}\right|^m. ( 2 F α q + 1 ( u ) 2 ) m < ( 2 α q + 1 ( u ) ) n ( F α q + 1 ( u ) ) m < α 0 ( u ) 1 n α i ( u ) 1 m .
This inequality together with the former one yields an absolute bound, n 5 , 2 n_{5,2} n 5 , 2 for m m m . Equation (26) yields
∣ 1 α 0 ( u ) ∣ n = ∣ a 0 ( u ) a i ( u ) ∣ ∣ α i ( u ) ∣ m < ( c 4 L ) q + 1 F n 5 , 2 α q + 1 ( u ) ( q + 1 ) 2 , \left|\frac{1}{\alpha_0(u)}\right|^n=\left|\frac{a_0(u)}{a_i(u)}\right||\alpha_i(u)|^m<(c_4L)^{q+1}F^{n_{5,2}}\alpha_{q+1}(u)^{(q+1)^2}, α 0 ( u ) 1 n = a i ( u ) a 0 ( u ) ∣ α i ( u ) ∣ m < ( c 4 L ) q + 1 F n 5 , 2 α q + 1 ( u ) ( q + 1 ) 2 ,
which implies the searched bound, n 5 , 3 n_{5,3} n 5 , 3 for n n n as in the former cases.
In the case 0 < m < n 0<m<n 0 < m < n one picks a σ ∈ Σ \sigma\in\Sigma σ ∈ Σ , which maps α 0 ( u ) \alpha_0(u) α 0 ( u ) to α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) and α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) to α i ( u ) \alpha_i(u) α i ( u ) for some 0 < i < q + 1 0<i<q+1 0 < i < q + 1 . The rest is similar as in the previous case. We leave its elaboration to the kind readers.
Finally if n < 0 n<0 n < 0 then (25) yields
a 0 ( u ) a q + 1 ( u ) α 0 ( u ) − m α q + 1 ( u ) − n = ± 1. \frac{a_0(u)}{a_{q+1}(u)}\alpha_0(u)^{-m}\alpha_{q+1}(u)^{-n}=\pm1. a q + 1 ( u ) a 0 ( u ) α 0 ( u ) − m α q + 1 ( u ) − n = ± 1.
This equation has the same structure as (25) , but with a positive exponent of α q + 1 ( u ) \alpha_{q+1}(u) α q + 1 ( u ) . The same argumentation is applicable as for n > 0 n > 0 n > 0 .
During the proof we distinguished several cases, but in each one we established a constant, n 5 , x n_{5,x} n 5 , x , which depends only on Q ( X ) Q(X) Q ( X ) and L L L and is such that if max { ∣ n ∣ , ∣ m ∣ } > n 5 , x \max\{|n|, |m|\} > n_{5,x} max { ∣ n ∣ , ∣ m ∣ } > n 5 , x then Γ ( u ) ≠ ± 1 \Gamma(u) \ne\pm1 Γ ( u ) = ± 1 . Taking n 5 = max { n 5 , 1 , n 5 , 2 , … } n_5 = \max\{n_{5,1}, n_{5,2}, \ldots\} n 5 = max { n 5 , 1 , n 5 , 2 , … } we finish the proof. □
Acknowledgement The author thanks the anonymous referee for his/her valuable comments, especially for pointing out that the proof of ∣ Γ ∣ ≠ 1 |\Gamma| \ne1 ∣Γ∣ = 1 was erroneous in the submitted version.
Department of Computer Science,, University of Debrecen,, H-4002 Debrecen, P.O. Box 400
Email address: petho.attila@unideb.hu