Introduction
In integer bases every real number has at most two expansions. In non-integer bases the situation is completely different: if M M M is a positive integer and M < q < M + 1 M < q < M+1 M < q < M + 1 , then Lebesgue almost every x ∈ [ 0 , M q − 1 ] x \in[0,\frac{M}{q-1}] x ∈ [ 0 , q − 1 M ] has 2 ℵ 0 2^{\aleph_0} 2 ℵ 0 expansions of the form
x = ∑ i = 1 ∞ c i q i , ( c i ) ∈ { 0 , 1 , … , M } N (1) x = \sum_{i=1}^{\infty} \frac{c_i}{q^i}, \qquad(c_i) \in\{0,1,\ldots,M\}^{\mathbb{N}} \tag*{(1)} x = i = 1 ∑ ∞ q i c i , ( c i ) ∈ { 0 , 1 , … , M } N (1)
[14 , 3 ] . Moreover, there exists a largest base q M q_M q M such that if q < q M q < q_M q < q M , then every x ∈ ( 0 , M q − 1 ) x \in(0,\frac{M}{q-1}) x ∈ ( 0 , q − 1 M ) has 2 ℵ 0 2^{\aleph_0} 2 ℵ 0 expansions of the form (1.1) [4 , 6 , 5 , 2 ] . For example, q 1 q_1 q 1 is the Golden ratio. More generally,
q 2 p − 1 = p + p 2 + 4 p 2 q_{2p-1} = \frac{p+\sqrt{p^2+4p}}{2} q 2 p − 1 = 2 p + p 2 + 4 p
and q 2 p = p + 1 q_{2p}=p+1 q 2 p = p + 1 for p = 1 , 2 , … p=1,2,\ldots p = 1 , 2 , … . Similar results hold for arbitrary ternary alphabets, too [7 , 10 , 15 ] .
If M = 2 p − 1 M=2p-1 M = 2 p − 1 is odd, then the last property no longer holds for q = q M q=q_M q = q M . However, the property still holds for a closely related expansion with integer denominators. Indeed, introducing the Lucas sequence
F 0 = 0 , F 1 = 1 , and F k = p ( F k − 1 + F k − 2 ) for k = 2 , 3 , … (2) F_0=0,\qquad F_1=1,\qquad\text{and}\qquad F_k=p(F_{k-1}+F_{k-2})\quad\text{for }k=2,3,\ldots \tag*{(2)} F 0 = 0 , F 1 = 1 , and F k = p ( F k − 1 + F k − 2 ) for k = 2 , 3 , … (2)
(for simplicity we do not indicate their dependence on p p p ), we have F k + 1 / F k → q M F_{k+1}/F_k \to q_M F k + 1 / F k → q M as k → ∞ k \to\infty k → ∞ , and every x ∈ ( 0 , ∑ i = 1 ∞ M F i ) x \in(0,\sum_{i=1}^{\infty}\frac{M}{F_i}) x ∈ ( 0 , ∑ i = 1 ∞ F i M ) has 2 ℵ 0 2^{\aleph_0} 2 ℵ 0 expansions of the form
x = ∑ i = 1 ∞ c i F i , ( c i ) ∈ { 0 , 1 , … , M } N x = \sum_{i=1}^{\infty} \frac{c_i}{F_i}, \qquad(c_i) \in\{0,1,\ldots,M\}^{\mathbb{N}} x = i = 1 ∑ ∞ F i c i , ( c i ) ∈ { 0 , 1 , … , M } N
[1 , 8 , 9 ] .
The convergence relation F k + 1 / F k → q M F_{k+1}/F_k \to q_M F k + 1 / F k → q M easily follows from the explicit formula
F k = A k − B k A − B , k = 0 , 1 , … , F_k=\frac{A^k-B^k}{A-B},\qquad k=0,1,\ldots, F k = A − B A k − B k , k = 0 , 1 , … ,
where
A : = q M = p + p 2 + 4 p 2 and B : = p − p 2 + 4 p 2 = − p A A:=q_M=\frac{p+\sqrt{p^2+4p}}{2}
\qquad\text{and}\qquad
B:=\frac{p-\sqrt{p^2+4p}}{2}=-\frac{p}{A} A := q M = 2 p + p 2 + 4 p and B := 2 p − p 2 + 4 p = − A p
are the solutions of the equation x 2 = p x + p x^2=px+p x 2 = p x + p , and from the obvious inequalities
p < A < p + 1 and − 1 < B < 0. p<A<p+1\qquad\text{and}\qquad-1<B<0. p < A < p + 1 and − 1 < B < 0.
A main idea of the proof in [1 ] was that in case M = 1 M=1 M = 1 we may remove from the sequence ( 1 / F i ) (1/F_i) ( 1/ F i ) infinitely many elements so that the remaining sequence ( p i ) (p_i) ( p i ) satisfies the inequalities
p n ≤ ∑ i = n + 1 ∞ p i p_n \le\sum_{i=n+1}^{\infty} p_i p n ≤ i = n + 1 ∑ ∞ p i
for every n n n . The proof of this lemma was not constructive. The following more precise estimates, obtained in [11 ] , imply that the removal of the elements 1 / F 2 ⋅ 3 n 1/F_{2\cdot3^n} 1/ F 2 ⋅ 3 n from ( 1 / F i ) (1/F_i) ( 1/ F i ) yields such a sequence ( p n ) (p_n) ( p n ) :
Theorem 1.1. Let ( F i ) (F_i) ( F i ) denote the Fibonacci sequence. If k k k is a positive odd integer, then
∑ i = k + 2 3 k + 1 1 F i < 1 F k < ∑ i = k + 2 3 k + 2 1 F i . \sum_{i=k+2}^{3k+1}\frac{1}{F_i}<\frac{1}{F_k}<\sum_{i=k+2}^{3k+2}\frac{1}{F_i}. i = k + 2 ∑ 3 k + 1 F i 1 < F k 1 < i = k + 2 ∑ 3 k + 2 F i 1 .
The object of the present work is to extend Theorem 1.1 to the Lucas sequences (1.2); they similarly lead to a constructive proof of the main results of [8 , 9 ] .
The method of our proof allows us to consider a larger class of Lucas sequences. We fix two integers p ≥ q ≥ 1 p\ge q\ge1 p ≥ q ≥ 1 , and we define the sequence
F 0 = 0 , F 1 = 1 , and F k = p F k − 1 + q F k − 2 for k = 2 , 3 , … ; (3) F_0=0,\qquad F_1=1,\qquad\text{and}\qquad F_k=pF_{k-1}+qF_{k-2}\quad\text{for }k=2,3,\ldots; \tag*{(3)} F 0 = 0 , F 1 = 1 , and F k = p F k − 1 + q F k − 2 for k = 2 , 3 , … ; (3)
for simplicity we do not indicate their dependence on p , q p,q p , q .
Binet’s formula readily extends to these sequences: introducing the solutions
A : = p + p 2 + 4 q 2 and B : = p − p 2 + 4 q 2 = − q A A:=\frac{p+\sqrt{p^2+4q}}{2}
\qquad\text{and}\qquad
B:=\frac{p-\sqrt{p^2+4q}}{2}=-\frac{q}{A} A := 2 p + p 2 + 4 q and B := 2 p − p 2 + 4 q = − A q
of the equation x 2 = p x + q x^2=px+q x 2 = p x + q , we have p < A < p + 1 p<A<p+1 p < A < p + 1 , − 1 < B < 0 -1<B<0 − 1 < B < 0 , and
F k = A k − B k A − B F_k=\frac{A^k-B^k}{A-B} F k = A − B A k − B k
for all k ≥ 0 k\ge0 k ≥ 0 .
First we consider the special case where q = 1 q=1 q = 1 .
Theorem 1.2. If p ≥ 2 p\ge2 p ≥ 2 and q = 1 q=1 q = 1 , then
p − 1 F k + 1 + ∑ i = k + 2 3 k p F i < 1 F k < p − 1 F k + 1 + ∑ i = k + 2 3 k + 1 p F i . (4) \frac{p-1}{F_{k+1}}+\sum_{i=k+2}^{3k}\frac{p}{F_i}<\frac{1}{F_k}<\frac{p-1}{F_{k+1}}+\sum_{i=k+2}^{3k+1}\frac{p}{F_i}. \tag*{(4)} F k + 1 p − 1 + i = k + 2 ∑ 3 k F i p < F k 1 < F k + 1 p − 1 + i = k + 2 ∑ 3 k + 1 F i p . (4) for all positive odd integers k k k .
Observe the difference between the cases p = 1 p=1 p = 1 and p ≥ 2 p\ge2 p ≥ 2 : the summation limits are 3 k + 1 3k+1 3 k + 1 and 3 k + 2 3k+2 3 k + 2 in Theorem 1.1 , and 3 k 3k 3 k and 3 k + 1 3k+1 3 k + 1 in Theorem 1.2 .
Our next result shows that the summation limits are more complicated for q ≥ 2 q\ge2 q ≥ 2 .
Theorem 1.3. If p ≥ q ≥ 2 p\ge q\ge2 p ≥ q ≥ 2 , then we have
p − 1 F k + 1 + ∑ i = k + 2 K 1 ( k ) p + q − 1 F i < 1 F k < p − 1 F k + 1 + ∑ i = k + 2 K 2 ( k ) p + q − 1 F i . (5) \frac{p-1}{F_{k+1}}+\sum_{i=k+2}^{K_1(k)}\frac{p+q-1}{F_i}<\frac{1}{F_k}<\frac{p-1}{F_{k+1}}+\sum_{i=k+2}^{K_2(k)}\frac{p+q-1}{F_i}. \tag*{(5)} F k + 1 p − 1 + i = k + 2 ∑ K 1 ( k ) F i p + q − 1 < F k 1 < F k + 1 p − 1 + i = k + 2 ∑ K 2 ( k ) F i p + q − 1 . (5) for all positive odd integers k k k , where
K 1 ( k ) = ⌊ ( 3 − ln q ln A ) k + ln ( p + q − 1 ) ln A − 1 ⌋ K_1(k)=\left\lfloor\left(3-\frac{\ln q}{\ln A}\right)k+\frac{\ln(p+q-1)}{\ln A}-1\right\rfloor K 1 ( k ) = ⌊ ( 3 − ln A ln q ) k + ln A ln ( p + q − 1 ) − 1 ⌋ and
K 2 ( k ) = ⌈ ( 3 − ln q ln A ) k + ln ( p + q − 1 ) − 2 ln q ln A + 1 ⌉ . K_2(k)=\left\lceil\left(3-\frac{\ln q}{\ln A}\right)k+\frac{\ln(p+q-1)-2\ln q}{\ln A}+1\right\rceil. K 2 ( k ) = ⌈ ( 3 − ln A ln q ) k + ln A ln ( p + q − 1 ) − 2 ln q + 1 ⌉ .
Example 1.5. For p = q = 2 p=q=2 p = q = 2 and k = 1 k=1 k = 1 we have K 1 ( k ) = 2 K_1(k)=2 K 1 ( k ) = 2 and K 2 ( k ) = 4 K_2(k)=4 K 2 ( k ) = 4 by a straightforward computation. Since F 1 = 1 F_1=1 F 1 = 1 , F 2 = 2 F_2=2 F 2 = 2 , F 3 = 6 F_3=6 F 3 = 6 and F 4 = 16 F_4=16 F 4 = 16 , (1.5) takes the form
1 2 < 1 < 1 2 + 3 6 + 3 16 ; \frac{1}{2}<1<\frac{1}{2}+\frac{3}{6}+\frac{3}{16}; 2 1 < 1 < 2 1 + 6 3 + 16 3 ; its validity is obvious.
Remarks 1.6.
The conclusion of Theorem 1.3 also holds if p ≥ 2 p\ge2 p ≥ 2 and q = 1 q=1 q = 1 , but this conclusion is weaker than Theorem 1.2: K 1 ( k ) = 3 k − 1 K_1(k)=3k-1 K 1 ( k ) = 3 k − 1 and K 2 ( k ) = 3 k + 2 K_2(k)=3k+2 K 2 ( k ) = 3 k + 2 , instead of 3 k 3k 3 k and 3 k + 1 3k+1 3 k + 1 , respectively.
Note that K 2 ( k ) > K 1 ( k ) ≥ k + 1 K_2(k)>K_1(k)\ge k+1 K 2 ( k ) > K 1 ( k ) ≥ k + 1 , and hence K 2 ( k ) ≥ k + 2 K_2(k)\ge k+2 K 2 ( k ) ≥ k + 2 . Indeed, the inequality K 2 ( k ) > K 1 ( k ) K_2(k)>K_1(k) K 2 ( k ) > K 1 ( k ) is obvious, and the next one follows by using the relations 1 ≤ q ≤ p < A 1\le q\le p<A 1 ≤ q ≤ p < A :
( 2 − ln q ln A ) k + ln ( p + q − 1 ) ln A − 1 ≥ ( 2 − ln q ln A ) + ln ( p + q − 1 ) ln A − 1 ≥ 2 − 1 = 1. \left(2-\frac{\ln q}{\ln A}\right)k+\frac{\ln(p+q-1)}{\ln A}-1\ge\left(2-\frac{\ln q}{\ln A}\right)+\frac{\ln(p+q-1)}{\ln A}-1\ge2-1=1. ( 2 − ln A ln q ) k + ln A ln ( p + q − 1 ) − 1 ≥ ( 2 − ln A ln q ) + ln A ln ( p + q − 1 ) − 1 ≥ 2 − 1 = 1.
Remarks 1.7. Let us focus on the special case p = q ≥ 2 p=q\ge2 p = q ≥ 2 .
We have
K 2 ( k ) − K 1 ( k ) ≤ 4 − 2 ln q ln A < 3 K_2(k)-K_1(k)\le4-\frac{2\ln q}{\ln A}<3 K 2 ( k ) − K 1 ( k ) ≤ 4 − ln A 2 ln q < 3
because q 2 = p 2 > p + 1 > A q^2=p^2>p+1>A q 2 = p 2 > p + 1 > A . Hence K 2 ( k ) = K 1 ( k ) + 1 K_2(k)=K_1(k)+1 K 2 ( k ) = K 1 ( k ) + 1 or K 2 ( k ) = K 1 ( k ) + 2 K_2(k)=K_1(k)+2 K 2 ( k ) = K 1 ( k ) + 2 for every odd integer k ≥ 1 k\ge1 k ≥ 1 , so that Theorem 1.3 is essentially optimal.
We consider the case p = q = 2 p=q=2 p = q = 2 . Table 1 shows the values of
Table 1. Non-optimality of K 1 ( k ) K_1(k) K 1 ( k ) or K 2 ( k ) K_2(k) K 2 ( k ) for k k k ’s with K 2 ( k ) = K 1 ( k ) + 2 K_2(k) = K_1(k) + 2 K 2 ( k ) = K 1 ( k ) + 2 for p = q = 2 p = q = 2 p = q = 2
S K : = p − 1 F k + 1 + ( ∑ i = k + 2 K p + q − 1 F i ) − 1 F k = 1 F k + 1 + ( ∑ i = k + 2 K 3 F i ) − 1 F k S_K:=\frac{p-1}{F_{k+1}}+\left(\sum_{i=k+2}^{K}\frac{p+q-1}{F_i}\right)-\frac{1}{F_k}=\frac{1}{F_{k+1}}+\left(\sum_{i=k+2}^{K}\frac{3}{F_i}\right)-\frac{1}{F_k} S K := F k + 1 p − 1 + ( i = k + 2 ∑ K F i p + q − 1 ) − F k 1 = F k + 1 1 + ( i = k + 2 ∑ K F i 3 ) − F k 1
for K = K 1 ( k ) , K 1 ( k ) + 1 , K 1 ( k ) + 2 K=K_1(k),K_1(k)+1,K_1(k)+2 K = K 1 ( k ) , K 1 ( k ) + 1 , K 1 ( k ) + 2 for those values of k = 1 , 3 , … , 49 k=1,3,\ldots,49 k = 1 , 3 , … , 49 for which K 2 ( k ) = K 1 ( k ) + 2 K_2(k)=K_1(k)+2 K 2 ( k ) = K 1 ( k ) + 2 .
We see that in Theorem 1.3 sometimes, but not always, we may change K 1 ( k ) K_1(k) K 1 ( k ) to K 1 ( k ) + 1 K_1(k)+1 K 1 ( k ) + 1 , and sometimes, but not always, we may change K 2 ( k ) K_2(k) K 2 ( k ) to K 2 ( k ) − 1 K_2(k)-1 K 2 ( k ) − 1 .
Let us write the formulas of K 1 ( k ) K_1(k) K 1 ( k ) and K 2 ( k ) K_2(k) K 2 ( k ) in the form
K 1 ( k ) = ⌊ ( 3 − ln q ln A ) k + α p , q ⌋ and K 2 ( k ) = ⌈ ( 3 − ln q ln A ) k + β p , q ⌉ K_1(k)=\left\lfloor\left(3-\frac{\ln q}{\ln A}\right)k+\alpha_{p,q}\right\rfloor\quad\text{and}\quad K_2(k)=\left\lceil\left(3-\frac{\ln q}{\ln A}\right)k+\beta_{p,q}\right\rceil K 1 ( k ) = ⌊ ( 3 − ln A ln q ) k + α p , q ⌋ and K 2 ( k ) = ⌈ ( 3 − ln A ln q ) k + β p , q ⌉
for brevity. Since
p + q − 1 > A > 1 , β p , q − α p , q = 2 − 2 ln q ln A and q 2 > A p+q-1>A>1,\qquad\beta_{p,q}-\alpha_{p,q}=2-2\frac{\ln q}{\ln A}\qquad\text{and}\qquad q^2>A p + q − 1 > A > 1 , β p , q − α p , q = 2 − 2 ln A ln q and q 2 > A
(see (i)), we have 0 < α p , q < β p , q < 1 0<\alpha_{p,q}<\beta_{p,q}<1 0 < α p , q < β p , q < 1 . Therefore K 2 ( k ) = K 1 ( k ) + 2 K_2(k)=K_1(k)+2 K 2 ( k ) = K 1 ( k ) + 2 if and only if there exists an integer n n n such that
( 3 − ln q ln A ) k + α p , q < n < ( 3 − ln q ln A ) k + β p , q . \left(3-\frac{\ln q}{\ln A}\right)k+\alpha_{p,q}<n<\left(3-\frac{\ln q}{\ln A}\right)k+\beta_{p,q}. ( 3 − ln A ln q ) k + α p , q < n < ( 3 − ln A ln q ) k + β p , q .
We may rewrite this in the equivalent form
( 3 − ln q ln A ) k ∈ ( − β p , q , − α p , q ) ( m o d 1 ) . \left(3-\frac{\ln q}{\ln A}\right)k\in(-\beta_{p,q},-\alpha_{p,q})\pmod{1}. ( 3 − ln A ln q ) k ∈ ( − β p , q , − α p , q ) ( mod 1 ) .
By a classical equidistribution theorem the density of the odd integers k k k (among all positive odd integers) for which K 2 ( k ) = K 1 ( k ) + 2 K_2(k)=K_1(k)+2 K 2 ( k ) = K 1 ( k ) + 2 , is equal to β p , q − α p , q = 2 − 2 ln q ln A \beta_{p,q}-\alpha_{p,q}=2-2\frac{\ln q}{\ln A} β p , q − α p , q = 2 − 2 l n A l n q .
(iv) Since p = q p = q p = q and p < A < p + 1 p < A < p + 1 p < A < p + 1 ,
β p , q − α p , q = 2 − 2 ln p ln A → 0 as p → ∞ , \beta_{p,q} - \alpha_{p,q} = 2 - 2\frac{\ln p}{\ln A} \to0 \quad\text{as } p \to\infty, β p , q − α p , q = 2 − 2 ln A ln p → 0 as p → ∞ ,
so that the frequency of k k k ’s for which Theorem 1.3 does not give the optimal values of K 1 ( k ) K_1(k) K 1 ( k ) and K 2 ( k ) K_2(k) K 2 ( k ) , tends to zero as p → ∞ p \to\infty p → ∞ . See Table 2 .
Table 2. Density of k k k ’s for which K 2 ( k ) = K 1 ( k ) + 2 K_2(k) = K_1(k) + 2 K 2 ( k ) = K 1 ( k ) + 2
We end the paper with an application of Theorem 1.3 to expansions in non-integer bases. Fix a positive integer p p p , and consider the Fibonacci or Lucas sequence associated with p = q p = q p = q . We are investigating the expansions of the form
x = ∑ i = 1 ∞ c i F i with ( c i ) ∈ { 0 , 1 , … , 2 p − 1 } N . (6) x = \sum_{i=1}^{\infty} \frac{c_i}{F_i} \quad\text{with} \quad(c_i) \in\{0,1,\ldots,2p-1\}^{\mathbb{N}}. \tag*{(6)} x = i = 1 ∑ ∞ F i c i with ( c i ) ∈ { 0 , 1 , … , 2 p − 1 } N . (6)
The following theorem was obtained in [1 ] for p = q = 1 p = q = 1 p = q = 1 and in [8 , 9 ] for p = q ≥ 2 p = q \ge2 p = q ≥ 2 :
has 2 ℵ 0 2^{\aleph_0} 2 ℵ 0 expansions of the form (1.6).
The proof of Theorem 1.8 was based on the following result: there exists an infinite sequence of indices 1 ≤ n 1 < n 2 < ⋯ 1 \le n_1 < n_2 < \cdots 1 ≤ n 1 < n 2 < ⋯ such that
1 F n j < p − 1 F n j + 1 + ∑ i = n j + 2 n j + 1 2 p − 1 F i , j = 1 , 2 , … ; (7) \frac{1}{F_{n_j}} < \frac{p-1}{F_{n_j+1}}+\sum_{i=n_j+2}^{n_{j+1}}\frac{2p-1}{F_i}, \qquad j=1,2,\ldots; \tag*{(7)} F n j 1 < F n j + 1 p − 1 + i = n j + 2 ∑ n j + 1 F i 2 p − 1 , j = 1 , 2 , … ; (7)
see the proof of [9 Theorem 1.11] . While in [1 , 8 , 9 ] only the existence of such sequences ( n j ) (n_j) ( n j ) was proved, Theorems 1.1 and 1.3 readily imply an explicit construction:
Corollary 1.9.
If p = q = 1 p=q=1 p = q = 1 , then the estimates (7) are satisfied with n j : = 2 ⋅ 3 j − 1 n_j:=2\cdot3^j-1 n j := 2 ⋅ 3 j − 1 .
If p = q ≥ 2 p=q\ge2 p = q ≥ 2 , then the estimates (7) are satisfied with the sequence ( n j ) (n_j) ( n j ) defined by the following recursion, starting with n 1 = 1 n_1=1 n 1 = 1 . If j ≥ 2 j\ge2 j ≥ 2 , and n j − 1 n_{j-1} n j − 1 has also been defined, then let n j n_j n j be the smallest odd integer satisfying n j ≥ K 2 ( n j − 1 ) n_j\ge K_2(n_{j-1}) n j ≥ K 2 ( n j − 1 ) .
Remark 1.10. In view of the explicit formula of K 2 ( k ) K_2(k) K 2 ( k ) in Theorem 1.3 the following asymptotic relations hold:
n j ∼ ( 3 − ln p ln A ) j − 1 , j → ∞ . n_j \sim\left(3-\frac{\ln p}{\ln A}\right)^{j-1}, \qquad j\to\infty. n j ∼ ( 3 − ln A ln p ) j − 1 , j → ∞.
Furthermore,
3 − ln p ln A → 2 as p → ∞ . 3-\frac{\ln p}{\ln A}\to2 \qquad\text{as }p\to\infty. 3 − ln A ln p → 2 as p → ∞.
We prove Theorem 1.2 in § 2 –§ 3 , and then Theorem 1.3 in § 4 –§ 5 . The proof of Theorem 1.3 is more technical, and it will use a crucial idea from the proof of Theorem 1.2.
Proof of the lower estimate of Theorem 1.2
We fix p ≥ 2 p\ge2 p ≥ 2 and q = 1 q=1 q = 1 . It follows from the definition that
0 = F 0 < F 1 < ⋯ , and F n ≥ p F n − 1 for every n ≥ 1. (8) 0=F_0<F_1<\cdots,\qquad\text{and}\qquad F_n\ge pF_{n-1}\quad\text{for every }n\ge1. \tag*{(8)} 0 = F 0 < F 1 < ⋯ , and F n ≥ p F n − 1 for every n ≥ 1. (8)
We need four lemmas. The first one is well-known; we recall a short proof for convenience:
Lemma 2.1. The following identities hold:
F i + j = F i − 1 F j + F i F j + 1 for all i ≥ 1 and j ≥ 0 ; (9) F_{i+j}=F_{i-1}F_j+F_iF_{j+1}\quad\text{for all }i\ge1\text{ and }j\ge0; \tag*{(9)} F i + j = F i − 1 F j + F i F j + 1 for all i ≥ 1 and j ≥ 0 ; (9) F i F j + 1 − F i + 1 F j = ( − 1 ) j F i − j for all i ≥ j ≥ 0. (10) F_iF_{j+1}-F_{i+1}F_j=(-1)^jF_{i-j}\quad\text{for all }i\ge j\ge0. \tag*{(10)} F i F j + 1 − F i + 1 F j = ( − 1 ) j F i − j for all i ≥ j ≥ 0. (10)
Proof. The identity (9) reduces to the obvious relations F i = F i F_i=F_i F i = F i and F i + 1 = F i − 1 + p F i F_{i+1}=F_{i-1}+pF_i F i + 1 = F i − 1 + p F i for j = 0 j=0 j = 0 and j = 1 j=1 j = 1 , and the general case follows by induction on j j j :
F i + j + 1 = p F i + j + F i + j − 1 = p ( F i − 1 F j + F i F j + 1 ) + ( F i − 1 F j − 1 + F i F j ) = F i − 1 ( p F j + F j − 1 ) + F i ( p F j + 1 + F j ) = F i − 1 F j + 1 + F i F j + 2 . \begin{aligned}
F_{i+j+1}&=pF_{i+j}+F_{i+j-1}=p\left(F_{i-1}F_j+F_iF_{j+1}\right)+\left(F_{i-1}F_{j-1}+F_iF_j\right)\\
&=F_{i-1}\left(pF_j+F_{j-1}\right)+F_i\left(pF_{j+1}+F_j\right)=F_{i-1}F_{j+1}+F_iF_{j+2}.
\end{aligned} F i + j + 1 = p F i + j + F i + j − 1 = p ( F i − 1 F j + F i F j + 1 ) + ( F i − 1 F j − 1 + F i F j ) = F i − 1 ( p F j + F j − 1 ) + F i ( p F j + 1 + F j ) = F i − 1 F j + 1 + F i F j + 2 .
Since the identity (10) reduces to the obvious equality F i = F i F_i=F_i F i = F i for j = 0 j=0 j = 0 , it is sufficient to show that the left hand side only changes sign when we replace ( i , j ) (i,j) ( i , j ) by ( i + 1 , j + 1 ) (i+1,j+1) ( i + 1 , j + 1 ) . This is shown as follows:
( F i + 1 F j + 2 − F i + 2 F j + 1 ) + ( F i F j + 1 − F i + 1 F j ) = F i + 1 ( F j + 2 − F j ) − F j + 1 ( F i + 2 − F i ) = F i + 1 p F j + 1 − F j + 1 p F i + 1 = 0. \begin{aligned}
&(F_{i+1}F_{j+2}-F_{i+2}F_{j+1})+(F_iF_{j+1}-F_{i+1}F_j)\\
&=F_{i+1}(F_{j+2}-F_j)-F_{j+1}(F_{i+2}-F_i)\\
&=F_{i+1}pF_{j+1}-F_{j+1}pF_{i+1}=0.
\end{aligned} ( F i + 1 F j + 2 − F i + 2 F j + 1 ) + ( F i F j + 1 − F i + 1 F j ) = F i + 1 ( F j + 2 − F j ) − F j + 1 ( F i + 2 − F i ) = F i + 1 p F j + 1 − F j + 1 p F i + 1 = 0.
Lemma 2.2. The following identity holds for all i ≥ 2 i\ge2 i ≥ 2 :
p F i = 1 F i − 1 − 1 F i + 1 + ( − 1 ) i p F i − 1 F i F i + 1 . \frac{p}{F_i}=\frac{1}{F_{i-1}}-\frac{1}{F_{i+1}}+(-1)^i\frac{p}{F_{i-1}F_iF_{i+1}}. F i p = F i − 1 1 − F i + 1 1 + ( − 1 ) i F i − 1 F i F i + 1 p .
Proof. Multiplying by the denominators we rewrite the identity in the form
p F i − 1 F i + 1 = F i F i + 1 − F i − 1 F i + ( − 1 ) i p . pF_{i-1}F_{i+1}=F_iF_{i+1}-F_{i-1}F_i+(-1)^ip. p F i − 1 F i + 1 = F i F i + 1 − F i − 1 F i + ( − 1 ) i p .
Since p F i + 1 + F i = F i + 2 pF_{i+1}+F_i=F_{i+2} p F i + 1 + F i = F i + 2 , this is equivalent to
F i − 1 F i + 2 = F i F i + 1 + ( − 1 ) i p . F_{i-1}F_{i+2}=F_iF_{i+1}+(-1)^ip. F i − 1 F i + 2 = F i F i + 1 + ( − 1 ) i p .
The last identity follows from the identity (10) :
F i + 1 F i − F i + 2 F i − 1 = ( − 1 ) i − 1 F 2 F_{i+1}F_i-F_{i+2}F_{i-1}=(-1)^{i-1}F_2 F i + 1 F i − F i + 2 F i − 1 = ( − 1 ) i − 1 F 2
because F 2 = p F_2=p F 2 = p .
Lemma 2.3
Lemma 2.3. If k ≥ 1 k\ge1 k ≥ 1 is odd, then
( p − 1 F k + 1 + ∑ i = k + 2 3 k p F i ) − 1 F k < p F k F k + 1 F k + 2 − 1 F 3 k − 1 F 3 k + 1 . (11) \left(\frac{p-1}{F_{k+1}}+\sum_{i=k+2}^{3k}\frac{p}{F_i}\right)-\frac{1}{F_k}<\frac{p}{F_kF_{k+1}F_{k+2}}-\frac{1}{F_{3k}}-\frac{1}{F_{3k+1}}. \tag*{(11)} ( F k + 1 p − 1 + i = k + 2 ∑ 3 k F i p ) − F k 1 < F k F k + 1 F k + 2 p − F 3 k 1 − F 3 k + 1 1 . (11)
Proof. Using Lemma 2.2, and simplifying a resulting telescopic sum, we obtain that
( p − 1 F k + 1 + ∑ i = k + 2 3 k p F i ) − 1 F k = − 1 F k − 1 F k + 1 + ∑ i = k + 1 3 k p F i = − 1 F k − 1 F k + 1 + ∑ i = k + 1 3 k ( 1 F i − 1 − 1 F i + 1 + ( − 1 ) i p F i − 1 F i F i + 1 ) = − 1 F 3 k − 1 F 3 k + 1 + ∑ i = k + 1 3 k ( − 1 ) i p F i − 1 F i F i + 1 . \begin{aligned}
\left(\frac{p-1}{F_{k+1}}+\sum_{i=k+2}^{3k}\frac{p}{F_i}\right)-\frac{1}{F_k}
=-\frac{1}{F_k}-\frac{1}{F_{k+1}}+\sum_{i=k+1}^{3k}\frac{p}{F_i} \\
&=-\frac{1}{F_k}-\frac{1}{F_{k+1}}+\sum_{i=k+1}^{3k}\left(\frac{1}{F_{i-1}}-\frac{1}{F_{i+1}}+(-1)^i\frac{p}{F_{i-1}F_iF_{i+1}}\right) \\
&=-\frac{1}{F_{3k}}-\frac{1}{F_{3k+1}}+\sum_{i=k+1}^{3k}(-1)^i\frac{p}{F_{i-1}F_iF_{i+1}}.
\end{aligned} ( F k + 1 p − 1 + i = k + 2 ∑ 3 k F i p ) − F k 1 = − F k 1 − F k + 1 1 + i = k + 1 ∑ 3 k F i p = − F k 1 − F k + 1 1 + i = k + 1 ∑ 3 k ( F i − 1 1 − F i + 1 1 + ( − 1 ) i F i − 1 F i F i + 1 p ) = − F 3 k 1 − F 3 k + 1 1 + i = k + 1 ∑ 3 k ( − 1 ) i F i − 1 F i F i + 1 p .
The last sum is a Leibniz type alternating sum by (8) , and it is majorized by its first term because it is positive. This completes the proof.
For the lower estimate of Theorem 1.2 it is sufficient to show that the right hand side of the inequality (11) is negative. For this we need another lemma:
Lemma 2.4
Lemma 2.4. The following identity holds for all k ≥ 1 k\ge1 k ≥ 1 :
F 3 k = F k ( F k − 1 2 + F k 2 + F k − 1 F k + 1 + F k + 1 2 ) . (12) F_{3k}=F_k\left(F_{k-1}^2+F_k^2+F_{k-1}F_{k+1}+F_{k+1}^2\right). \tag*{(12)} F 3 k = F k ( F k − 1 2 + F k 2 + F k − 1 F k + 1 + F k + 1 2 ) . (12)
Proof. Using the identity (9) we have the following equalities:
F 3 k = F 2 k − 1 F k + F 2 k F k + 1 , F_{3k}=F_{2k-1}F_k+F_{2k}F_{k+1}, F 3 k = F 2 k − 1 F k + F 2 k F k + 1 ,
F 2 k − 1 = F k − 1 2 + F k 2 , F_{2k-1}=F_{k-1}^2+F_k^2, F 2 k − 1 = F k − 1 2 + F k 2 ,
F 2 k = F k ( F k − 1 + F k + 1 ) . F_{2k}=F_k\left(F_{k-1}+F_{k+1}\right). F 2 k = F k ( F k − 1 + F k + 1 ) .
Combining them we get (12) .
Proof of the lower estimate of Theorem 1.2. As mentioned above, it is sufficient to establish the inequality
p F k F k + 1 F k + 2 − 1 F 3 k − 1 F 3 k + 1 < 0. \frac{p}{F_kF_{k+1}F_{k+2}}-\frac{1}{F_{3k}}-\frac{1}{F_{3k+1}}<0. F k F k + 1 F k + 2 p − F 3 k 1 − F 3 k + 1 1 < 0.
Since F 3 k + 1 ≤ ( p + 1 ) F 3 k F_{3k+1}\le(p+1)F_{3k} F 3 k + 1 ≤ ( p + 1 ) F 3 k by (3) and (8) , it is sufficient to establish the stronger estimate
p F k F k + 1 F k + 2 − 1 F 3 k − 1 ( p + 1 ) F 3 k < 0. \frac{p}{F_kF_{k+1}F_{k+2}}-\frac{1}{F_{3k}}-\frac{1}{(p+1)F_{3k}}<0. F k F k + 1 F k + 2 p − F 3 k 1 − ( p + 1 ) F 3 k 1 < 0.
Multiplying by ( p + 1 ) F 3 k F k F k + 1 F k + 2 (p+1)F_{3k}F_kF_{k+1}F_{k+2} ( p + 1 ) F 3 k F k F k + 1 F k + 2 , this is equivalent to
L : = ( p + 2 ) F k + 1 F k + 2 − p ( p + 1 ) F 3 k F k > 0. L:=(p+2)F_{k+1}F_{k+2}-p(p+1)\frac{F_{3k}}{F_k}>0. L := ( p + 2 ) F k + 1 F k + 2 − p ( p + 1 ) F k F 3 k > 0.
Applying Lemma 2.4 we obtain that
L = ( p + 2 ) F k + 1 F k + 2 − p ( p + 1 ) ( F k − 1 2 + F k 2 + F k − 1 F k + 1 + F k + 1 2 ) . L=(p+2)F_{k+1}F_{k+2}-p(p+1)\left(F_{k-1}^2+F_k^2+F_{k-1}F_{k+1}+F_{k+1}^2\right). L = ( p + 2 ) F k + 1 F k + 2 − p ( p + 1 ) ( F k − 1 2 + F k 2 + F k − 1 F k + 1 + F k + 1 2 ) .
Using the identity F k + 2 = p F k + 1 + F k F_{k+2}=pF_{k+1}+F_k F k + 2 = p F k + 1 + F k we eliminate F k + 2 F_{k+2} F k + 2 to get
L = p F k + 1 2 + ( p + 2 ) F k F k + 1 − p ( p + 1 ) ( F k − 1 2 + F k 2 + F k − 1 F k + 1 ) . L=pF_{k+1}^{2}+(p+2)F_kF_{k+1}-p(p+1)\left(F_{k-1}^{2}+F_k^{2}+F_{k-1}F_{k+1}\right). L = p F k + 1 2 + ( p + 2 ) F k F k + 1 − p ( p + 1 ) ( F k − 1 2 + F k 2 + F k − 1 F k + 1 ) .
Using the inequality F n + 1 ≥ p F n F_{n+1}\ge pF_n F n + 1 ≥ p F n first with n = k − 1 n=k-1 n = k − 1 , and later with n = k n=k n = k , we obtain that
L ≥ p F k + 1 2 + ( p + 2 ) F k F k + 1 − p ( p + 1 ) ( p − 2 F k 2 + F k 2 + p − 1 F k F k + 1 ) = p F k + 1 2 + F k F k + 1 − p ( p + 1 ) ( p − 2 + 1 ) F k 2 ≥ [ p 3 + p − p ( p + 1 ) ( p − 2 + 1 ) ] F k 2 = p 3 [ 1 − 1 p − 1 p 3 − 1 p 4 ] F k 2 . \begin{aligned}
L&\ge pF_{k+1}^{2}+(p+2)F_kF_{k+1}-p(p+1)\left(p^{-2}F_k^{2}+F_k^{2}+p^{-1}F_kF_{k+1}\right)\\
&=pF_{k+1}^{2}+F_kF_{k+1}-p(p+1)\left(p^{-2}+1\right)F_k^{2}\\
&\ge\left[p^{3}+p-p(p+1)\left(p^{-2}+1\right)\right]F_k^{2}\\
&=p^{3}\left[1-\frac{1}{p}-\frac{1}{p^{3}}-\frac{1}{p^{4}}\right]F_k^{2}.
\end{aligned} L ≥ p F k + 1 2 + ( p + 2 ) F k F k + 1 − p ( p + 1 ) ( p − 2 F k 2 + F k 2 + p − 1 F k F k + 1 ) = p F k + 1 2 + F k F k + 1 − p ( p + 1 ) ( p − 2 + 1 ) F k 2 ≥ [ p 3 + p − p ( p + 1 ) ( p − 2 + 1 ) ] F k 2 = p 3 [ 1 − p 1 − p 3 1 − p 4 1 ] F k 2 .
Since p ≥ 2 p\ge2 p ≥ 2 , all factors of the last product are positive, and hence L > 0 L>0 L > 0 , as required. □
Proof of the upper estimate of Theorem 1.2
As in the preceding section, we fix p ≥ 2 p\ge2 p ≥ 2 and q = 1 q=1 q = 1 .
Lemma 3.1. If k ≥ 1 k\ge1 k ≥ 1 is odd, then
( p − 1 F k + 1 + ∑ i = k + 2 3 k + 1 p F i ) − 1 F k > p F k F k + 1 F k + 2 − p F k + 1 F k + 2 F k + 3 − 1 F 3 k + 1 − 1 F 3 k + 2 . (13) \left(\frac{p-1}{F_{k+1}}+\sum_{i=k+2}^{3k+1}\frac{p}{F_i}\right)-\frac{1}{F_k}>\frac{p}{F_kF_{k+1}F_{k+2}}-\frac{p}{F_{k+1}F_{k+2}F_{k+3}}-\frac{1}{F_{3k+1}}-\frac{1}{F_{3k+2}}. \tag*{(13)} ( F k + 1 p − 1 + i = k + 2 ∑ 3 k + 1 F i p ) − F k 1 > F k F k + 1 F k + 2 p − F k + 1 F k + 2 F k + 3 p − F 3 k + 1 1 − F 3 k + 2 1 . (13) Proof. Similarly to the proof of Lemma 2.3, now we obtain that
( p − 1 F k + 1 + ∑ i = k + 2 3 k + 1 p F i ) − 1 F k = − 1 F k − 1 F k + 1 + ∑ i = k + 1 3 k + 1 p F i \left(\frac{p-1}{F_{k+1}}+\sum_{i=k+2}^{3k+1}\frac{p}{F_i}\right)-\frac{1}{F_k}
=-\frac{1}{F_k}-\frac{1}{F_{k+1}}+\sum_{i=k+1}^{3k+1}\frac{p}{F_i} ( F k + 1 p − 1 + i = k + 2 ∑ 3 k + 1 F i p ) − F k 1 = − F k 1 − F k + 1 1 + i = k + 1 ∑ 3 k + 1 F i p = − 1 F k − 1 F k + 1 + ∑ i = k + 1 3 k + 1 ( 1 F i − 1 − 1 F i + 1 + ( − 1 ) i p F i − 1 F i F i + 1 ) =-\frac{1}{F_k}-\frac{1}{F_{k+1}}+\sum_{i=k+1}^{3k+1}\left(\frac{1}{F_{i-1}}-\frac{1}{F_{i+1}}+(-1)^i\frac{p}{F_{i-1}F_iF_{i+1}}\right) = − F k 1 − F k + 1 1 + i = k + 1 ∑ 3 k + 1 ( F i − 1 1 − F i + 1 1 + ( − 1 ) i F i − 1 F i F i + 1 p ) = − 1 F 3 k + 1 − 1 F 3 k + 2 + ∑ i = k + 1 3 k + 1 ( − 1 ) i p F i − 1 F i F i + 1 . =-\frac{1}{F_{3k+1}}-\frac{1}{F_{3k+2}}+\sum_{i=k+1}^{3k+1}(-1)^i\frac{p}{F_{i-1}F_iF_{i+1}}. = − F 3 k + 1 1 − F 3 k + 2 1 + i = k + 1 ∑ 3 k + 1 ( − 1 ) i F i − 1 F i F i + 1 p . Now the last sum is minorized by the sum of its first two terms, and this yields the estimate (3.1). □
For the upper estimate of Theorem 1.2 it is sufficient to show that the right hand side of the inequality (3.1) is positive .
We need two further identities:
Lemma 3.2. The following identities hold for all k ≥ 0 k\ge0 k ≥ 0 :
F 3 k + 1 = F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 ; (14) F_{3k+1}=F_{k+1}^{3}+3F_k^{2}F_{k+1}-pF_k^{3}; \tag*{(14)} F 3 k + 1 = F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 ; (14) F 3 k + 2 = p F k + 1 3 + 3 F k F k + 1 2 + F k 3 . (15) F_{3k+2}=pF_{k+1}^{3}+3F_kF_{k+1}^{2}+F_k^{3}. \tag*{(15)} F 3 k + 2 = p F k + 1 3 + 3 F k F k + 1 2 + F k 3 . (15) Proof. For k = 0 k=0 k = 0 the identities reduce to the obvious equalities 1 = 1 1=1 1 = 1 and p = p p=p p = p . Henceforth we assume that k ≥ 1 k\ge1 k ≥ 1 . Using the identities (1.3) and (2.2) we have
F 3 k + 1 = F 2 k + ( k + 1 ) = F 2 k − 1 F k + 1 + F 2 k F k + 2 F_{3k+1}=F_{2k+(k+1)}=F_{2k-1}F_{k+1}+F_{2k}F_{k+2} F 3 k + 1 = F 2 k + ( k + 1 ) = F 2 k − 1 F k + 1 + F 2 k F k + 2 = ( F k − 1 2 + F k 2 ) F k + 1 + F k ( F k − 1 + F k + 1 ) F k + 2 = \left(F_{k-1}^{2}+F_k^{2}\right)F_{k+1}+F_k\left(F_{k-1}+F_{k+1}\right)F_{k+2} = ( F k − 1 2 + F k 2 ) F k + 1 + F k ( F k − 1 + F k + 1 ) F k + 2 = ( F k + 1 − p F k ) 2 F k + 1 + F k 2 F k + 1 + F k F k + 2 ( 2 F k + 1 − p F k ) =\left(F_{k+1}-pF_k\right)^{2}F_{k+1}+F_k^{2}F_{k+1}+F_kF_{k+2}\left(2F_{k+1}-pF_k\right) = ( F k + 1 − p F k ) 2 F k + 1 + F k 2 F k + 1 + F k F k + 2 ( 2 F k + 1 − p F k ) = F k + 1 3 − 2 p F k F k + 1 2 + ( p 2 + 1 ) F k 2 F k + 1 + F k ( p F k + 1 + F k ) ( 2 F k + 1 − p F k ) =F_{k+1}^{3}-2pF_kF_{k+1}^{2}+\left(p^{2}+1\right)F_k^{2}F_{k+1}+F_k\left(pF_{k+1}+F_k\right)\left(2F_{k+1}-pF_k\right) = F k + 1 3 − 2 p F k F k + 1 2 + ( p 2 + 1 ) F k 2 F k + 1 + F k ( p F k + 1 + F k ) ( 2 F k + 1 − p F k ) = F k + 1 3 − 2 p F k F k + 1 2 + ( p 2 + 1 ) F k 2 F k + 1 + 2 p F k F k + 1 2 + ( 2 − p 2 ) F k 2 F k + 1 − p F k 3 =F_{k+1}^{3}-2pF_kF_{k+1}^{2}+\left(p^{2}+1\right)F_k^{2}F_{k+1}+2pF_kF_{k+1}^{2}+\left(2-p^{2}\right)F_k^{2}F_{k+1}-pF_k^{3} = F k + 1 3 − 2 p F k F k + 1 2 + ( p 2 + 1 ) F k 2 F k + 1 + 2 p F k F k + 1 2 + ( 2 − p 2 ) F k 2 F k + 1 − p F k 3 = F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 . =F_{k+1}^{3}+3F_k^{2}F_{k+1}-pF_k^{3}. = F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 .
Next, using also (3.2) and (2.5), we have
F 3 k + 2 = p F 3 k + 1 + F 3 k = p ( F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 ) + F k ( F k − 1 2 + F k 2 + F k − 1 F k + 1 + F k + 1 2 ) = p ( F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 ) + F k ( ( F k + 1 − p F k ) 2 + F k 2 + ( F k + 1 − p F k ) F k + 1 + F k + 1 2 ) = p F k + 1 3 + 3 F k F k + 1 2 + F k 3 . \begin{aligned}
F_{3k+2}=pF_{3k+1}+F_{3k} \\
&=p\left(F_{k+1}^{3}+3F_k^{2}F_{k+1}-pF_k^{3}\right)+F_k\left(F_{k-1}^{2}+F_k^{2}+F_{k-1}F_{k+1}+F_{k+1}^{2}\right) \\
&=p\left(F_{k+1}^{3}+3F_k^{2}F_{k+1}-pF_k^{3}\right)+F_k\left((F_{k+1}-pF_k)^{2}+F_k^{2}+(F_{k+1}-pF_k)F_{k+1}+F_{k+1}^{2}\right) \\
&=pF_{k+1}^{3}+3F_kF_{k+1}^{2}+F_k^{3}.
\end{aligned} F 3 k + 2 = p F 3 k + 1 + F 3 k = p ( F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 ) + F k ( F k − 1 2 + F k 2 + F k − 1 F k + 1 + F k + 1 2 ) = p ( F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 ) + F k ( ( F k + 1 − p F k ) 2 + F k 2 + ( F k + 1 − p F k ) F k + 1 + F k + 1 2 ) = p F k + 1 3 + 3 F k F k + 1 2 + F k 3 .
Proof of the upper estimate of Theorem 1.2. By Lemma 3.1 it is sufficient to prove that the right hand side of the inequality (3.1) is positive. This is equivalent to the relation
R : = F k F k + 1 F k + 2 F 3 k + 1 + F k F k + 1 F k + 2 F 3 k + 2 + p F k F k + 3 < p . R:=\frac{F_kF_{k+1}F_{k+2}}{F_{3k+1}}+\frac{F_kF_{k+1}F_{k+2}}{F_{3k+2}}+\frac{pF_k}{F_{k+3}}<p. R := F 3 k + 1 F k F k + 1 F k + 2 + F 3 k + 2 F k F k + 1 F k + 2 + F k + 3 p F k < p .
Using the relations (1.3), (2.1), (3.2) and (3.3) we may estimate R R R as follows:
R = F k F k + 1 F k + 2 F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 + F k F k + 1 F k + 2 p F k + 1 3 + 3 F k F k + 1 2 + F k 3 + p F k F k + 3 < F k F k + 1 F k + 2 F k + 1 3 + 2 F k 2 F k + 1 + F k F k + 1 F k + 2 p 2 F k F k + 1 2 + 3 F k F k + 1 2 + p F k p 3 F k = F k F k + 2 F k + 1 2 + 2 F k 2 + F k + 2 ( p 2 + 3 ) F k + 1 + 1 p 2 = p F k F k + 1 + F k 2 F k + 1 2 + 2 F k 2 + F k + 2 ( p 2 + 3 ) F k + 1 + 1 p 2 ≤ F k + 1 2 + F k 2 F k + 1 2 + 2 F k 2 + ( p + 1 ) F k + 1 ( p 2 + 3 ) F k + 1 + 1 p 2 < 1 + p + 1 p 2 + 1 p 2 = 1 + 1 p + 2 p 2 . \begin{aligned}
R&=\frac{F_kF_{k+1}F_{k+2}}{F_{k+1}^{3}+3F_k^{2}F_{k+1}-pF_k^{3}}+\frac{F_kF_{k+1}F_{k+2}}{pF_{k+1}^{3}+3F_kF_{k+1}^{2}+F_k^{3}}+\frac{pF_k}{F_{k+3}}\\
&<\frac{F_kF_{k+1}F_{k+2}}{F_{k+1}^{3}+2F_k^{2}F_{k+1}}+\frac{F_kF_{k+1}F_{k+2}}{p^{2}F_kF_{k+1}^{2}+3F_kF_{k+1}^{2}}+\frac{pF_k}{p^{3}F_k}\\
&=\frac{F_kF_{k+2}}{F_{k+1}^{2}+2F_k^{2}}+\frac{F_{k+2}}{(p^{2}+3)F_{k+1}}+\frac{1}{p^{2}}\\
&=\frac{pF_kF_{k+1}+F_k^{2}}{F_{k+1}^{2}+2F_k^{2}}+\frac{F_{k+2}}{(p^{2}+3)F_{k+1}}+\frac{1}{p^{2}}\\
&\le\frac{F_{k+1}^{2}+F_k^{2}}{F_{k+1}^{2}+2F_k^{2}}+\frac{(p+1)F_{k+1}}{(p^{2}+3)F_{k+1}}+\frac{1}{p^{2}}\\
&<1+\frac{p+1}{p^{2}}+\frac{1}{p^{2}}\\
&=1+\frac{1}{p}+\frac{2}{p^{2}}.
\end{aligned} R = F k + 1 3 + 3 F k 2 F k + 1 − p F k 3 F k F k + 1 F k + 2 + p F k + 1 3 + 3 F k F k + 1 2 + F k 3 F k F k + 1 F k + 2 + F k + 3 p F k < F k + 1 3 + 2 F k 2 F k + 1 F k F k + 1 F k + 2 + p 2 F k F k + 1 2 + 3 F k F k + 1 2 F k F k + 1 F k + 2 + p 3 F k p F k = F k + 1 2 + 2 F k 2 F k F k + 2 + ( p 2 + 3 ) F k + 1 F k + 2 + p 2 1 = F k + 1 2 + 2 F k 2 p F k F k + 1 + F k 2 + ( p 2 + 3 ) F k + 1 F k + 2 + p 2 1 ≤ F k + 1 2 + 2 F k 2 F k + 1 2 + F k 2 + ( p 2 + 3 ) F k + 1 ( p + 1 ) F k + 1 + p 2 1 < 1 + p 2 p + 1 + p 2 1 = 1 + p 1 + p 2 2 .
Since p ≥ 2 p\ge2 p ≥ 2 , the required estimate follows:
R < 1 + 1 p + 2 p 2 ≤ 1 + 1 2 + 2 2 2 = 2 ≤ p . R<1+\frac{1}{p}+\frac{2}{p^{2}}\le1+\frac{1}{2}+\frac{2}{2^{2}}=2\le p. R < 1 + p 1 + p 2 2 ≤ 1 + 2 1 + 2 2 2 = 2 ≤ p .
Proof of the lower estimate of Theorem 1.3
We do not have an elegant generalization of Lemma 2.2, but we use its underlying idea in Lemma 4.1 below. We recall that the sequence ( F i ) (F_i) ( F i ) satisfies Binet’s formula
F i = A i − B i A − B , i = 0 , 1 , … , F_i=\frac{A^i-B^i}{A-B},\qquad i=0,1,\ldots, F i = A − B A i − B i , i = 0 , 1 , … ,
where
A : = p + p 2 + 4 q 2 and B : = p − p 2 + 4 q 2 = − q A , A:=\frac{p+\sqrt{p^{2}+4q}}{2}\qquad\text{and}\qquad B:=\frac{p-\sqrt{p^{2}+4q}}{2}=-\frac{q}{A}, A := 2 p + p 2 + 4 q and B := 2 p − p 2 + 4 q = − A q ,
are the solutions of the equation x 2 = p x + q x^{2}=px+q x 2 = p x + q . Observe that
p < A < p + 1 and − 1 < B < 0. p<A<p+1\qquad\text{and}\qquad-1<B<0. p < A < p + 1 and − 1 < B < 0.
Lemma 4.1. Set
a i : = A 2 − 1 A F i − 1 F i − 1 + 1 F i + 1 , i = 2 , 3 , … . a_i:=\frac{A^{2}-1}{AF_i}-\frac{1}{F_{i-1}}+\frac{1}{F_{i+1}},\qquad i=2,3,\ldots. a i := A F i A 2 − 1 − F i − 1 1 + F i + 1 1 , i = 2 , 3 , … .
Then the series ∑ i = 2 ∞ a i \sum_{i=2}^{\infty}a_i ∑ i = 2 ∞ a i is of Leibniz type, starting with $a_2>0. Proof. Since F i → + ∞ F_i \to+\infty F i → + ∞ , a i → 0 a_i \to0 a i → 0 . Next we show that
a i = − B i − 1 H i A 2 F i − 1 F i F i + 1 , H i = q ( A 2 − 1 ) F i − 1 + p A 2 F i > 0. (16) a_i=-\frac{B^{i-1}H_i}{A^2F_{i-1}F_iF_{i+1}},\qquad H_i=q(A^2-1)F_{i-1}+pA^2F_i>0. \tag*{(16)} a i = − A 2 F i − 1 F i F i + 1 B i − 1 H i , H i = q ( A 2 − 1 ) F i − 1 + p A 2 F i > 0. (16)
First we take a common denominator in the definition of a i a_i a i to get
a i = ( A 3 − A ) F i − 1 F i + 1 − A 2 F i F i + 1 + A 2 F i − 1 F i A 2 F i − 1 F i F i + 1 . a_i=\frac{(A^3-A)F_{i-1}F_{i+1}-A^2F_iF_{i+1}+A^2F_{i-1}F_i}{A^2F_{i-1}F_iF_{i+1}}. a i = A 2 F i − 1 F i F i + 1 ( A 3 − A ) F i − 1 F i + 1 − A 2 F i F i + 1 + A 2 F i − 1 F i .
Hence (16) will follow if we prove the identities
F i − A F i − 1 = B i − 1 F_i-AF_{i-1}=B^{i-1} F i − A F i − 1 = B i − 1
and
( A 3 − A ) F i − 1 F i + 1 − A 2 F i F i + 1 + A 2 F i − 1 F i = ( A F i − 1 − F i ) [ q ( A 2 − 1 ) F i − 1 + p A 2 F i ] . (A^3-A)F_{i-1}F_{i+1}-A^2F_iF_{i+1}+A^2F_{i-1}F_i=(AF_{i-1}-F_i)[q(A^2-1)F_{i-1}+pA^2F_i]. ( A 3 − A ) F i − 1 F i + 1 − A 2 F i F i + 1 + A 2 F i − 1 F i = ( A F i − 1 − F i ) [ q ( A 2 − 1 ) F i − 1 + p A 2 F i ] .
for every i ≥ 1 i\geq1 i ≥ 1 . For i = 1 , 2 i=1,2 i = 1 , 2 the first identity reduces to the obvious equalities 1 = 1 1=1 1 = 1 and p − A = B p-A=B p − A = B ; the general case hence follows by induction because F i + 1 = p F i + q F i − 1 F_{i+1}=pF_i+qF_{i-1} F i + 1 = p F i + q F i − 1 and B 2 = p B + q B^2=pB+q B 2 = pB + q .
Next, eliminating F i + 1 F_{i+1} F i + 1 from the second identity by using the relation F i + 1 = p F i + q F i − 1 F_{i+1}=pF_i+qF_{i-1} F i + 1 = p F i + q F i − 1 , it remains to show that
[ ( A 3 − A ) F i − 1 − A 2 F i ] ( p F i + q F i − 1 ) + A 2 F i − 1 F i = ( A F i − 1 − F i ) [ q ( A 2 − 1 ) F i − 1 + p A 2 F i ] . [(A^3-A)F_{i-1}-A^2F_i](pF_i+qF_{i-1})+A^2F_{i-1}F_i=(AF_{i-1}-F_i)[q(A^2-1)F_{i-1}+pA^2F_i]. [( A 3 − A ) F i − 1 − A 2 F i ] ( p F i + q F i − 1 ) + A 2 F i − 1 F i = ( A F i − 1 − F i ) [ q ( A 2 − 1 ) F i − 1 + p A 2 F i ] .
Developing both sides, after simplification this reduces to the obvious relation A 2 = p A + q A^2=pA+q A 2 = p A + q .
It follows from (16) that the sequence ( a i ) (a_i) ( a i ) has alternating sign.
It remains to show the inequalities ∣ a i ∣ > ∣ a i + 1 ∣ |a_i|>|a_{i+1}| ∣ a i ∣ > ∣ a i + 1 ∣ . For this we observe that
H i F i + 2 − H i + 1 F i − 1 = [ q ( A 2 − 1 ) F i − 1 + p A 2 F i ] ( p F i + 1 + q F i ) − [ q ( A 2 − 1 ) F i + p A 2 F i + 1 ] F i − 1 = q ( A 2 − 1 ) F i − 1 ( F i + 2 − F i ) + p A 2 [ ( p F i − F i − 1 ) F i + 1 + q F i 2 ] > 0 \begin{aligned}
H_iF_{i+2}-H_{i+1}F_{i-1}
&=[q(A^2-1)F_{i-1}+pA^2F_i](pF_{i+1}+qF_i)\\
&\quad-[q(A^2-1)F_i+pA^2F_{i+1}]F_{i-1}\\
&=q(A^2-1)F_{i-1}(F_{i+2}-F_i)+pA^2[(pF_i-F_{i-1})F_{i+1}+qF_i^2]>0
\end{aligned} H i F i + 2 − H i + 1 F i − 1 = [ q ( A 2 − 1 ) F i − 1 + p A 2 F i ] ( p F i + 1 + q F i ) − [ q ( A 2 − 1 ) F i + p A 2 F i + 1 ] F i − 1 = q ( A 2 − 1 ) F i − 1 ( F i + 2 − F i ) + p A 2 [( p F i − F i − 1 ) F i + 1 + q F i 2 ] > 0
because A > p ≥ q ≥ 1 A>p\geq q\geq1 A > p ≥ q ≥ 1 , F i + 2 > F i F_{i+2}>F_i F i + 2 > F i , F i − 1 > 0 F_{i-1}>0 F i − 1 > 0 , p F i − F i − 1 ≥ 0 pF_i-F_{i-1}\geq0 p F i − F i − 1 ≥ 0 , and q F i 2 > 0 qF_i^2>0 q F i 2 > 0 . The monotonicity hence follows:
∣ a i + 1 a i ∣ = ∣ B ∣ i H i + 1 A 2 F i F i + 1 F i + 2 ⋅ A 2 F i − 1 F i F i + 1 ∣ B ∣ i − 1 H i = H i + 1 F i − 1 H i F i + 2 ∣ B ∣ < ∣ B ∣ < 1. \left|\frac{a_{i+1}}{a_i}\right|=\frac{|B|^iH_{i+1}}{A^2F_iF_{i+1}F_{i+2}}\cdot\frac{A^2F_{i-1}F_iF_{i+1}}{|B|^{i-1}H_i}=\frac{H_{i+1}F_{i-1}}{H_iF_{i+2}}|B|<|B|<1. a i a i + 1 = A 2 F i F i + 1 F i + 2 ∣ B ∣ i H i + 1 ⋅ ∣ B ∣ i − 1 H i A 2 F i − 1 F i F i + 1 = H i F i + 2 H i + 1 F i − 1 ∣ B ∣ < ∣ B ∣ < 1.
Lemma 4.2. Let k ≥ 1 k\geq1 k ≥ 1 be an odd integer. If
− 1 F k + ( p + q − 1 A + 1 ) 1 F k + 1 + A + q A + 1 1 F k + 2 ≤ A + q A + 1 ( 1 F K + 1 F K + 1 ) -\frac{1}{F_k}+\left(p+\frac{q-1}{A+1}\right)\frac{1}{F_{k+1}}+\frac{A+q}{A+1}\frac{1}{F_{k+2}}\leq\frac{A+q}{A+1}\left(\frac{1}{F_K}+\frac{1}{F_{K+1}}\right) − F k 1 + ( p + A + 1 q − 1 ) F k + 1 1 + A + 1 A + q F k + 2 1 ≤ A + 1 A + q ( F K 1 + F K + 1 1 ) for K : = K 1 ( k ) K:=K_1(k) K := K 1 ( k ) , then the first estimate of Theorem 1.3 holds.
Remark. The relation (4.2) is equivalent to
− A + 1 F k + A 2 + p − 1 F k + 1 + A + q F k + 2 ≤ A + q F K + A + q F K + 1 . -\frac{A+1}{F_k}+\frac{A^2+p-1}{F_{k+1}}+\frac{A+q}{F_{k+2}}\leq\frac{A+q}{F_K}+\frac{A+q}{F_{K+1}}. − F k A + 1 + F k + 1 A 2 + p − 1 + F k + 2 A + q ≤ F K A + q + F K + 1 A + q .
Proof. We recall from Remark 1.6 (ii) that K 1 ( k ) ≥ k + 1 K_1(k)\geq k+1 K 1 ( k ) ≥ k + 1 . For K = k + 1 K=k+1 K = k + 1 the inequality (4.2) reduces to − 1 F k + p − 1 F k + 1 ≤ 0 -\frac{1}{F_k}+\frac{p-1}{F_{k+1}}\leq0 − F k 1 + F k + 1 p − 1 ≤ 0 , which is satisfied because F k + 1 = p F k + q F k − 1 > ( p − 1 ) F k F_{k+1}=pF_k+qF_{k-1}>(p-1)F_k F k + 1 = p F k + q F k − 1 > ( p − 1 ) F k .
Henceforth we assume that K ≥ k + 2 K \ge k+2 K ≥ k + 2 . Applying Lemma 4.1 we have the following relations:
p − 1 F k + 1 + ( ∑ i = k + 2 K p + q − 1 F i ) − 1 F k = − 1 F k − q F k + 1 + ( ∑ i = k + 1 K p + q − 1 F i ) = − 1 F k − q F k + 1 + ( p + q − 1 ) A A 2 − 1 ∑ i = k + 1 K ( 1 F i − 1 − 1 F i + 1 + a i ) = − 1 F k − q F k + 1 + ( p + q − 1 ) A A 2 − 1 ( 1 F k + 1 F k + 1 − 1 F K − 1 F K + 1 + ∑ i = k + 1 K a i ) . (17) \begin{aligned}
\frac{p-1}{F_{k+1}}+\left(\sum_{i=k+2}^{K}\frac{p+q-1}{F_i}\right)-\frac{1}{F_k}
&=-\frac{1}{F_k}-\frac{q}{F_{k+1}}+\left(\sum_{i=k+1}^{K}\frac{p+q-1}{F_i}\right)\\
&=-\frac{1}{F_k}-\frac{q}{F_{k+1}}+\frac{(p+q-1)A}{A^2-1}\sum_{i=k+1}^{K}\left(\frac{1}{F_{i-1}}-\frac{1}{F_{i+1}}+a_i\right)\\
&=-\frac{1}{F_k}-\frac{q}{F_{k+1}}+\frac{(p+q-1)A}{A^2-1}\left(\frac{1}{F_k}+\frac{1}{F_{k+1}}-\frac{1}{F_K}-\frac{1}{F_{K+1}}+\sum_{i=k+1}^{K}a_i\right). \tag*{(17)}
\end{aligned} F k + 1 p − 1 + ( i = k + 2 ∑ K F i p + q − 1 ) − F k 1 = − F k 1 − F k + 1 q + ( i = k + 1 ∑ K F i p + q − 1 ) = − F k 1 − F k + 1 q + A 2 − 1 ( p + q − 1 ) A i = k + 1 ∑ K ( F i − 1 1 − F i + 1 1 + a i ) = − F k 1 − F k + 1 q + A 2 − 1 ( p + q − 1 ) A ( F k 1 + F k + 1 1 − F K 1 − F K + 1 1 + i = k + 1 ∑ K a i ) . (17)
If k k k is odd, then the last Leibniz type alternating sum starts with a positive term, so that
p − 1 F k + 1 + ( ∑ i = k + 2 K p + q − 1 F i ) − 1 F k < − 1 F k − q F k + 1 + ( p + q − 1 ) A A 2 − 1 ( 1 F k + 1 F k + 1 − 1 F K − 1 F K + 1 + a k + 1 ) = − 1 F k − q F k + 1 + ( p + q − 1 ) A A 2 − 1 ( 1 F k + 1 + 1 F k + 2 + A 2 − 1 A F k + 1 − 1 F K − 1 F K + 1 ) = 1 F k + ( ( p + q − 1 ) A A 2 − 1 + p − 1 ) 1 F k + 1 + ( p + q − 1 ) A A 2 − 1 ( 1 F k + 2 − 1 F K − 1 F K + 1 ) . \begin{aligned}
\frac{p-1}{F_{k+1}}+\left(\sum_{i=k+2}^{K}\frac{p+q-1}{F_i}\right)-\frac{1}{F_k}
&<-\frac{1}{F_k}-\frac{q}{F_{k+1}}+\frac{(p+q-1)A}{A^2-1}\left(\frac{1}{F_k}+\frac{1}{F_{k+1}}-\frac{1}{F_K}-\frac{1}{F_{K+1}}+a_{k+1}\right)\\
&=-\frac{1}{F_k}-\frac{q}{F_{k+1}}+\frac{(p+q-1)A}{A^2-1}\left(\frac{1}{F_{k+1}}+\frac{1}{F_{k+2}}+\frac{A^2-1}{AF_{k+1}}-\frac{1}{F_K}-\frac{1}{F_{K+1}}\right)\\
&=\frac{1}{F_k}+\left(\frac{(p+q-1)A}{A^2-1}+p-1\right)\frac{1}{F_{k+1}}+\frac{(p+q-1)A}{A^2-1}\left(\frac{1}{F_{k+2}}-\frac{1}{F_K}-\frac{1}{F_{K+1}}\right).
\end{aligned} F k + 1 p − 1 + ( i = k + 2 ∑ K F i p + q − 1 ) − F k 1 < − F k 1 − F k + 1 q + A 2 − 1 ( p + q − 1 ) A ( F k 1 + F k + 1 1 − F K 1 − F K + 1 1 + a k + 1 ) = − F k 1 − F k + 1 q + A 2 − 1 ( p + q − 1 ) A ( F k + 1 1 + F k + 2 1 + A F k + 1 A 2 − 1 − F K 1 − F K + 1 1 ) = F k 1 + ( A 2 − 1 ( p + q − 1 ) A + p − 1 ) F k + 1 1 + A 2 − 1 ( p + q − 1 ) A ( F k + 2 1 − F K 1 − F K + 1 1 ) .
Since
( p + q − 1 ) A A 2 − 1 = ( A 2 − q ) + ( q − 1 ) A A 2 − 1 = ( A 2 − 1 ) + ( q − 1 ) ( A − 1 ) A 2 − 1 = 1 + q − 1 A + 1 = A + q A + 1 , \frac{(p+q-1)A}{A^2-1}
=\frac{(A^2-q)+(q-1)A}{A^2-1}
=\frac{(A^2-1)+(q-1)(A-1)}{A^2-1}
=1+\frac{q-1}{A+1}
=\frac{A+q}{A+1}, A 2 − 1 ( p + q − 1 ) A = A 2 − 1 ( A 2 − q ) + ( q − 1 ) A = A 2 − 1 ( A 2 − 1 ) + ( q − 1 ) ( A − 1 ) = 1 + A + 1 q − 1 = A + 1 A + q ,
we conclude that
p − 1 F k + 1 + ( ∑ i = k + 2 K p + q − 1 F i ) − 1 F k < − 1 F k + ( p + q − 1 A + 1 ) 1 F k + 1 + A + q A + 1 ( 1 F k + 2 − 1 F K − 1 F K + 1 ) . \begin{aligned}
\frac{p-1}{F_{k+1}}+\left(\sum_{i=k+2}^{K}\frac{p+q-1}{F_i}\right)-\frac{1}{F_k}
&<-\frac{1}{F_k}+\left(p+\frac{q-1}{A+1}\right)\frac{1}{F_{k+1}}+\frac{A+q}{A+1}\left(\frac{1}{F_{k+2}}-\frac{1}{F_K}-\frac{1}{F_{K+1}}\right).
\end{aligned} F k + 1 p − 1 + ( i = k + 2 ∑ K F i p + q − 1 ) − F k 1 < − F k 1 + ( p + A + 1 q − 1 ) F k + 1 1 + A + 1 A + q ( F k + 2 1 − F K 1 − F K + 1 1 ) .
We conclude by observing that the last expression is ≤ 0 \le0 ≤ 0 by (4.2). □
Let us denote the left and right hand side of (4.2) by L k L_k L k and R K R_K R K , respectively. We are going to show that (4.2) is satisfied with K = K 1 ( k ) K=K_1(k) K = K 1 ( k ) defined in Theorem 1.3. It is convenient to introduce the number
t : = − B A = q A 2 ∈ ( 0 , 1 ) . t:=-\frac{B}{A}=\frac{q}{A^2}\in(0,1). t := − A B = A 2 q ∈ ( 0 , 1 ) .
Then
1 F j = A − B A j − B j = A ( 1 + t ) A j ( 1 − ( − t ) j ) = A 1 − j ( 1 + t ) ( 1 + ( − t ) j + ( − t ) 2 j + ( − t ) 3 j + ( − t ) 4 j + ⋯ ) , j = 1 , 2 , … . (18) \frac{1}{F_j}=\frac{A-B}{A^j-B^j}=\frac{A(1+t)}{A^j(1-(-t)^j)}
=A^{1-j}(1+t)\left(1+(-t)^j+(-t)^{2j}+(-t)^{3j}+(-t)^{4j}+\cdots\right),\qquad j=1,2,\ldots. \tag*{(18)} F j 1 = A j − B j A − B = A j ( 1 − ( − t ) j ) A ( 1 + t ) = A 1 − j ( 1 + t ) ( 1 + ( − t ) j + ( − t ) 2 j + ( − t ) 3 j + ( − t ) 4 j + ⋯ ) , j = 1 , 2 , … . (18)
Next we estimate the two sides of the inequality (4.2).
Lemma 4.3. The left hand side L k L_k L k of (4.2) satisfies the following inequalities:
L k 1 + t < A 1 − k ( − 1 + t k ) + ( p + q − 1 A + 1 ) A − k 1 − t k + 1 + ( 1 + q − 1 A + 1 ) A − k − 1 . (19) \frac{L_k}{1+t}<A^{1-k}\left(-1+t^k\right)+\left(p+\frac{q-1}{A+1}\right)\frac{A^{-k}}{1-t^{k+1}}+\left(1+\frac{q-1}{A+1}\right)A^{-k-1}. \tag*{(19)} 1 + t L k < A 1 − k ( − 1 + t k ) + ( p + A + 1 q − 1 ) 1 − t k + 1 A − k + ( 1 + A + 1 q − 1 ) A − k − 1 . (19)
Remark. The inequality (4.5) is equivalent to
L k 1 + t < A 1 − k ( − 1 + t k ) + A 2 + p − 1 A + 1 ⋅ A − k 1 − t k + 1 + A + q A + 1 A − k − 1 . \frac{L_k}{1+t} < A^{1-k}\left(-1+t^k\right) + \frac{A^2+p-1}{A+1}\cdot\frac{A^{-k}}{1-t^{k+1}}+\frac{A+q}{A+1}\,A^{-k-1}. 1 + t L k < A 1 − k ( − 1 + t k ) + A + 1 A 2 + p − 1 ⋅ 1 − t k + 1 A − k + A + 1 A + q A − k − 1 .
Proof. Using (4.4) we may rewrite the definition of L k L_k L k in the following form (we recall that k k k is odd):
L k 1 + t = A 1 − k ( − 1 + t k − t 2 k + t 3 k − t 4 k + ⋯ ) + ( p + q − 1 A + 1 ) A − k ( 1 + t k + 1 + t 2 k + 2 + t 3 k + 3 + t 4 k + 4 + ⋯ ) + ( 1 + q − 1 A + 1 ) A − k − 1 ( 1 − t k + 2 + t 2 k + 4 − t 3 k + 6 + t 4 k + 8 + ⋯ ) . \begin{aligned}
\frac{L_k}{1+t}
={}&A^{1-k}\left(-1+t^k-t^{2k}+t^{3k}-t^{4k}+\cdots\right)\\
&+\left(p+\frac{q-1}{A+1}\right)A^{-k}\left(1+t^{k+1}+t^{2k+2}+t^{3k+3}+t^{4k+4}+\cdots\right)\\
&+\left(1+\frac{q-1}{A+1}\right)A^{-k-1}\left(1-t^{k+2}+t^{2k+4}-t^{3k+6}+t^{4k+8}+\cdots\right).
\end{aligned} 1 + t L k = A 1 − k ( − 1 + t k − t 2 k + t 3 k − t 4 k + ⋯ ) + ( p + A + 1 q − 1 ) A − k ( 1 + t k + 1 + t 2 k + 2 + t 3 k + 3 + t 4 k + 4 + ⋯ ) + ( 1 + A + 1 q − 1 ) A − k − 1 ( 1 − t k + 2 + t 2 k + 4 − t 3 k + 6 + t 4 k + 8 + ⋯ ) .
Since 0 < t < 1 0<t<1 0 < t < 1 , by the classical majoration of Leibniz type alternating sums we have
− 1 + t k − t 2 k + t 3 k − t 4 k + ⋯ < − 1 + t k -1+t^k-t^{2k}+t^{3k}-t^{4k}+\cdots<-1+t^k − 1 + t k − t 2 k + t 3 k − t 4 k + ⋯ < − 1 + t k
and
1 − t k + 2 + t 2 k + 4 − t 3 k + 6 + t 4 k + 8 + ⋯ < 1. 1-t^{k+2}+t^{2k+4}-t^{3k+6}+t^{4k+8}+\cdots<1. 1 − t k + 2 + t 2 k + 4 − t 3 k + 6 + t 4 k + 8 + ⋯ < 1.
Finally,
1 + t k + 1 + t 2 k + 2 + t 3 k + 3 + t 4 k + 4 + ⋯ = 1 1 − t k + 1 . 1+t^{k+1}+t^{2k+2}+t^{3k+3}+t^{4k+4}+\cdots=\frac{1}{1-t^{k+1}}. 1 + t k + 1 + t 2 k + 2 + t 3 k + 3 + t 4 k + 4 + ⋯ = 1 − t k + 1 1 .
Lemma 4.4. Setting
T K = A 1 − ( − t ) K + 1 1 − ( − t ) K + 1 , T_K=\frac{A}{1-(-t)^K}+\frac{1}{1-(-t)^{K+1}}, T K = 1 − ( − t ) K A + 1 − ( − t ) K + 1 1 , the following estimates hold for all K ≥ 2 K\ge2 K ≥ 2 :
A + 1 − 1 A 2 < T K < A + 1 + A 1 − K < A + 2. A+1-\frac{1}{A^2}<T_K<A+1+A^{1-K}<A+2. A + 1 − A 2 1 < T K < A + 1 + A 1 − K < A + 2. Proof. If K K K is even, then
T K − ( A + 1 ) = A 1 − t K + 1 1 + t K + 1 − ( A + 1 ) = A t K 1 − t K − t K + 1 1 + t K + 1 > A t K − t K + 1 > 0 T_K-(A+1)=\frac{A}{1-t^K}+\frac{1}{1+t^{K+1}}-(A+1)=\frac{At^K}{1-t^K}-\frac{t^{K+1}}{1+t^{K+1}}>At^K-t^{K+1}>0 T K − ( A + 1 ) = 1 − t K A + 1 + t K + 1 1 − ( A + 1 ) = 1 − t K A t K − 1 + t K + 1 t K + 1 > A t K − t K + 1 > 0 because 0 < t < 1 < A 0<t<1<A 0 < t < 1 < A , and
T K − ( A + 1 ) = A 1 − t K + 1 1 + t K + 1 − ( A + 1 ) = A t K 1 − t K − t K + 1 1 + t K + 1 < A t K 1 − t K ≤ A 1 − K < 1. T_K-(A+1)=\frac{A}{1-t^K}+\frac{1}{1+t^{K+1}}-(A+1)=\frac{At^K}{1-t^K}-\frac{t^{K+1}}{1+t^{K+1}}<\frac{At^K}{1-t^K}\le A^{1-K}<1. T K − ( A + 1 ) = 1 − t K A + 1 + t K + 1 1 − ( A + 1 ) = 1 − t K A t K − 1 + t K + 1 t K + 1 < 1 − t K A t K ≤ A 1 − K < 1. Only the second to last inequality is not obvious. Since
A t K 1 − t K ≤ A 1 − K ⟺ ( 1 + A K ) t K ≤ 1 ⟺ ( 1 + A K ) ∣ B ∣ K ≤ A K ⟺ ∣ B ∣ K + q K ≤ A K , \frac{At^K}{1-t^K}\le A^{1-K}\Longleftrightarrow(1+A^K)t^K\le1\Longleftrightarrow(1+A^K)|B|^K\le A^K\Longleftrightarrow|B|^K+q^K\le A^K, 1 − t K A t K ≤ A 1 − K ⟺ ( 1 + A K ) t K ≤ 1 ⟺ ( 1 + A K ) ∣ B ∣ K ≤ A K ⟺ ∣ B ∣ K + q K ≤ A K , it is sufficient to show the last inequality. It is satisfied for K = 1 K=1 K = 1 because A − ∣ B ∣ = p ≥ q A-|B|=p\ge q A − ∣ B ∣ = p ≥ q , and the case K > 1 K>1 K > 1 hence follows by induction because ∣ B ∣ < q < A |B|<q<A ∣ B ∣ < q < A .
If K K K is odd, then K ≥ 3 K\ge3 K ≥ 3 . Since 0 < t < 1 0<t<1 0 < t < 1 and A t = q / A < 1 At=q/A<1 A t = q / A < 1 , now we have
T K − ( A + 1 ) = A 1 + t K + 1 1 − t K + 1 − ( A + 1 ) = t K + 1 1 − t K + 1 − A t K 1 + t K > − A t K 1 + t K > − A t K ≥ − A t 3 > − 1 A 2 , \begin{aligned}
T_K-(A+1)
&=\frac{A}{1+t^K}+\frac{1}{1-t^{K+1}}-(A+1)\\
&=\frac{t^{K+1}}{1-t^{K+1}}-\frac{At^K}{1+t^K}
>-\frac{At^K}{1+t^K}>-At^K\ge-At^3>-\frac{1}{A^2},
\end{aligned} T K − ( A + 1 ) = 1 + t K A + 1 − t K + 1 1 − ( A + 1 ) = 1 − t K + 1 t K + 1 − 1 + t K A t K > − 1 + t K A t K > − A t K ≥ − A t 3 > − A 2 1 , and
T K − ( A + 1 ) = t K + 1 1 − t K + 1 − A t K 1 + t K < t K + 1 1 − t K + 1 ≤ A − K − 1 < A 1 − K . T_K-(A+1)=\frac{t^{K+1}}{1-t^{K+1}}-\frac{At^K}{1+t^K}<\frac{t^{K+1}}{1-t^{K+1}}\le A^{-K-1}<A^{1-K}. T K − ( A + 1 ) = 1 − t K + 1 t K + 1 − 1 + t K A t K < 1 − t K + 1 t K + 1 ≤ A − K − 1 < A 1 − K . Indeed, in the last case we may repeat the computation given for even K K K 's with K + 1 K+1 K + 1 instead of K K K .
Lemma 4.5. The right hand side R K R_K R K of (4.2) satisfies the following inequality for all K ≥ 2 K \ge2 K ≥ 2 :
R K 1 + t > A + q A K ( 1 − 1 A 2 ( A + 1 ) ) . \frac{R_K}{1+t} > \frac{A+q}{A^K}\left(1-\frac{1}{A^2(A+1)}\right). 1 + t R K > A K A + q ( 1 − A 2 ( A + 1 ) 1 ) .
Proof. The lemma follows from Lemma 4.4 because
R K 1 + t = A + q A K ( A + 1 ) T K \frac{R_K}{1+t}=\frac{A+q}{A^K(A+1)}T_K 1 + t R K = A K ( A + 1 ) A + q T K
by (18) .
Now we are ready to prove the first inequality of Theorem 1.3. In view of the estimates of L k L_k L k and R K R_K R K in Lemmas 4.3 and 4.5, (4.2) will follow if we show that
A 1 − k ( − 1 + t k ) + ( p + q − 1 A + 1 ) A − k 1 − t k + 1 + ( 1 + q − 1 A + 1 ) A − k − 1 < A + q A K ( 1 − 1 A 2 ( A + 1 ) ) , A^{1-k}\left(-1+t^k\right)+\left(p+\frac{q-1}{A+1}\right)\frac{A^{-k}}{1-t^{k+1}}+\left(1+\frac{q-1}{A+1}\right)A^{-k-1}<\frac{A+q}{A^K}\left(1-\frac{1}{A^2(A+1)}\right), A 1 − k ( − 1 + t k ) + ( p + A + 1 q − 1 ) 1 − t k + 1 A − k + ( 1 + A + 1 q − 1 ) A − k − 1 < A K A + q ( 1 − A 2 ( A + 1 ) 1 ) ,
or equivalently that
A 2 ( − 1 + t k ) + ( p + q − 1 A + 1 ) A 1 − t k + 1 + ( 1 + q − 1 A + 1 ) < ( A + q ) A k + 1 A K ( 1 − 1 A 2 ( A + 1 ) ) . A^2\left(-1+t^k\right)+\left(p+\frac{q-1}{A+1}\right)\frac{A}{1-t^{k+1}}+\left(1+\frac{q-1}{A+1}\right)<\frac{(A+q)A^{k+1}}{A^K}\left(1-\frac{1}{A^2(A+1)}\right). A 2 ( − 1 + t k ) + ( p + A + 1 q − 1 ) 1 − t k + 1 A + ( 1 + A + 1 q − 1 ) < A K ( A + q ) A k + 1 ( 1 − A 2 ( A + 1 ) 1 ) .
Since
− A 2 + ( p + q − 1 A + 1 ) A + ( 1 + q − 1 A + 1 ) = − ( p A + q ) + p A + 1 + q − 1 A + 1 ( A + 1 ) = 0 , -A^2+\left(p+\frac{q-1}{A+1}\right)A+\left(1+\frac{q-1}{A+1}\right)=-(pA+q)+pA+1+\frac{q-1}{A+1}(A+1)=0, − A 2 + ( p + A + 1 q − 1 ) A + ( 1 + A + 1 q − 1 ) = − ( p A + q ) + p A + 1 + A + 1 q − 1 ( A + 1 ) = 0 ,
the relation may be rewritten in the form
A 2 t k + ( p + q − 1 A + 1 ) A t k + 1 1 − t k + 1 < ( A + q ) A k + 1 A K ( 1 − 1 A 3 + A 2 ) . A^2t^k+\left(p+\frac{q-1}{A+1}\right)\frac{At^{k+1}}{1-t^{k+1}}<\frac{(A+q)A^{k+1}}{A^K}\left(1-\frac{1}{A^3+A^2}\right). A 2 t k + ( p + A + 1 q − 1 ) 1 − t k + 1 A t k + 1 < A K ( A + q ) A k + 1 ( 1 − A 3 + A 2 1 ) .
Since k ≥ 1 k\ge1 k ≥ 1 and 0 < t < 1 0<t<1 0 < t < 1 , it is sufficient to prove the following, slightly stronger estimate:
A 2 t k + ( p + q − 1 A + 1 ) A t k + 1 1 − t 2 < ( A + q ) A k + 1 A K ( 1 − 1 A 3 + A 2 ) . A^2t^k+\left(p+\frac{q-1}{A+1}\right)\frac{At^{k+1}}{1-t^2}<\frac{(A+q)A^{k+1}}{A^K}\left(1-\frac{1}{A^3+A^2}\right). A 2 t k + ( p + A + 1 q − 1 ) 1 − t 2 A t k + 1 < A K ( A + q ) A k + 1 ( 1 − A 3 + A 2 1 ) .
Using the definition t = q A − 2 t=qA^{-2} t = q A − 2 we eliminate t t t , and the last inequality takes the following form:
q k A 2 − 2 k + ( p + q − 1 A + 1 ) q k + 1 A − 2 k − 1 1 − q 2 A − 4 < ( A + q ) A k + 1 A K ( 1 − 1 A 3 + A 2 ) . q^kA^{2-2k}+\left(p+\frac{q-1}{A+1}\right)\frac{q^{k+1}A^{-2k-1}}{1-q^2A^{-4}}<\frac{(A+q)A^{k+1}}{A^K}\left(1-\frac{1}{A^3+A^2}\right). q k A 2 − 2 k + ( p + A + 1 q − 1 ) 1 − q 2 A − 4 q k + 1 A − 2 k − 1 < A K ( A + q ) A k + 1 ( 1 − A 3 + A 2 1 ) .
This is equivalent to
q k A K − 3 k + 1 { 1 + ( p + q − 1 A + 1 ) q A − 3 1 − q 2 A − 4 } < ( A + q ) ( 1 − 1 A 3 + A 2 ) q^kA^{K-3k+1}\left\{1+\left(p+\frac{q-1}{A+1}\right)\frac{qA^{-3}}{1-q^2A^{-4}}\right\}<(A+q)\left(1-\frac{1}{A^3+A^2}\right) q k A K − 3 k + 1 { 1 + ( p + A + 1 q − 1 ) 1 − q 2 A − 4 q A − 3 } < ( A + q ) ( 1 − A 3 + A 2 1 )
or to
q k A K − 3 k + 1 { 1 + ( p + q − 1 A + 1 ) q A A 4 − q 2 } < ( A + q ) ( 1 − 1 A 3 + A 2 ) . q^kA^{K-3k+1}\left\{1+\left(p+\frac{q-1}{A+1}\right)\frac{qA}{A^4-q^2}\right\}<(A+q)\left(1-\frac{1}{A^3+A^2}\right). q k A K − 3 k + 1 { 1 + ( p + A + 1 q − 1 ) A 4 − q 2 q A } < ( A + q ) ( 1 − A 3 + A 2 1 ) .
Multiplying by ( A 3 + A 2 ) ( A 4 − q 2 ) (A^3+A^2)(A^4-q^2) ( A 3 + A 2 ) ( A 4 − q 2 ) it takes the following form:
q k A K − 3 k + 1 { ( A 3 + A 2 ) ( A 4 − q 2 ) + ( p A + p + q − 1 ) q A 3 } < ( A + q ) ( A 4 − q 2 ) ( A 3 + A 2 − 1 ) . q^kA^{K-3k+1}\left\{(A^3+A^2)(A^4-q^2)+(pA+p+q-1)qA^3\right\}<(A+q)(A^4-q^2)(A^3+A^2-1). q k A K − 3 k + 1 { ( A 3 + A 2 ) ( A 4 − q 2 ) + ( p A + p + q − 1 ) q A 3 } < ( A + q ) ( A 4 − q 2 ) ( A 3 + A 2 − 1 ) .
By Remark 1.4 the lower estimate of Theorem 1.3 will be proved if we establish the following inequality:
( p + q − 1 ) { ( A 3 + A 2 ) ( A 4 − q 2 ) + ( p A + p + q − 1 ) q A 3 } < ( A + q ) ( A 4 − q 2 ) ( A 3 + A 2 − 1 ) . (20) (p+q-1)\left\{(A^3+A^2)(A^4-q^2)+(pA+p+q-1)qA^3\right\}<(A+q)(A^4-q^2)(A^3+A^2-1). \tag*{(20)} ( p + q − 1 ) { ( A 3 + A 2 ) ( A 4 − q 2 ) + ( p A + p + q − 1 ) q A 3 } < ( A + q ) ( A 4 − q 2 ) ( A 3 + A 2 − 1 ) . (20)
The inequality (20) may be simplified to
( p + q − 1 ) { A 7 + A 6 + p q A 4 + ( p q − q ) A 3 − q 2 A 2 } < A 8 + ( q + 1 ) A 7 + q A 6 − A 5 − ( q 2 + q ) A 4 − ( q 3 + q 2 ) A 3 − q 3 A 2 + q 2 A + q 3 . \begin{aligned}
(p+q-1)\left\{A^7+A^6+pqA^4+(pq-q)A^3-q^2A^2\right\} \\
&<A^8+(q+1)A^7+qA^6-A^5-(q^2+q)A^4-(q^3+q^2)A^3-q^3A^2+q^2A+q^3.
\end{aligned} ( p + q − 1 ) { A 7 + A 6 + pq A 4 + ( pq − q ) A 3 − q 2 A 2 } < A 8 + ( q + 1 ) A 7 + q A 6 − A 5 − ( q 2 + q ) A 4 − ( q 3 + q 2 ) A 3 − q 3 A 2 + q 2 A + q 3 .
We have to show that the difference between the right and left hand sides of this relation is positive, i.e., that
Δ : = A 8 + ( 2 − p ) A 7 + ( 1 − p ) A 6 − A 5 + ( − q 2 − q − p 2 q − p q 2 + p q ) A 4 + ( − q 3 − p 2 q − p q 2 + 2 p q − q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 > 0. \begin{aligned}
\Delta:=A^8+(2-p)A^7+(1-p)A^6-A^5+(-q^2-q-p^2q-pq^2+pq)A^4 \\
&+ (-q^{3}-p^{2}q-pq^{2}+2pq-q)A^{3}+(pq^{2}-q^{2})A^{2}+q^{2}A+q^{3}>0.
\end{aligned} Δ := A 8 + ( 2 − p ) A 7 + ( 1 − p ) A 6 − A 5 + ( − q 2 − q − p 2 q − p q 2 + pq ) A 4 + ( − q 3 − p 2 q − p q 2 + 2 pq − q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 > 0.
Let us transform the last expression by applying repeatedly the relation A 2 = p A + q A^{2}=pA+q A 2 = p A + q (for more visibility the terms denoted by “…” are unchanged):
Δ = 2 A 7 + ( q + 1 − p ) A 6 − A 5 + ( − q 2 − q − p 2 q − p q 2 + p q ) A 4 + ( − q 3 − p 2 q − p q 2 + 2 p q − q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 = ( q + 1 + p ) A 6 + ( 2 q − 1 ) A 5 + ( − q 2 − q − p 2 q − p q 2 + p q ) A 4 + ( − q 3 − p 2 q − p q 2 + 2 p q − q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 = ( p q + p + p 2 + 2 q − 1 ) A 5 + ( 2 p q − p 2 q − p q 2 ) A 4 + ( − q 3 − p 2 q − p q 2 + 2 p q − q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 = ( p 2 + p 3 + 4 p q − p q 2 − p ) A 4 + ( − q 3 + 3 p q + 2 q 2 − 2 q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 = ( p 2 + p 3 − p q 2 − p ) A 4 + ( 4 p 2 q − q 3 + 3 p q + 2 q 2 − 2 q ) A 3 + ( 5 p q 2 − q 2 ) A 2 + q 2 A + q 3 = p ( ( p 2 − q 2 ) + ( p − 1 ) ) A 4 + q ( 4 p 2 q − q 3 + 3 p + 2 q − 2 ) A 3 + q 2 ( 5 p − 1 ) A 2 + q 2 A + q 3 . \begin{aligned}
\Delta={}&2A^{7}+(q+1-p)A^{6}-A^{5}+(-q^{2}-q-p^{2}q-pq^{2}+pq)A^{4}\\
&+(-q^{3}-p^{2}q-pq^{2}+2pq-q)A^{3}+(pq^{2}-q^{2})A^{2}+q^{2}A+q^{3}\\
={}&(q+1+p)A^{6}+(2q-1)A^{5}+(-q^{2}-q-p^{2}q-pq^{2}+pq)A^{4}\\
&+(-q^{3}-p^{2}q-pq^{2}+2pq-q)A^{3}+(pq^{2}-q^{2})A^{2}+q^{2}A+q^{3}\\
={}&(pq+p+p^{2}+2q-1)A^{5}+(2pq-p^{2}q-pq^{2})A^{4}\\
&+(-q^{3}-p^{2}q-pq^{2}+2pq-q)A^{3}+(pq^{2}-q^{2})A^{2}+q^{2}A+q^{3}\\
={}&(p^{2}+p^{3}+4pq-pq^{2}-p)A^{4}+(-q^{3}+3pq+2q^{2}-2q)A^{3}\\
&+(pq^{2}-q^{2})A^{2}+q^{2}A+q^{3}\\
={}&(p^{2}+p^{3}-pq^{2}-p)A^{4}+(4p^{2}q-q^{3}+3pq+2q^{2}-2q)A^{3}\\
&+(5pq^{2}-q^{2})A^{2}+q^{2}A+q^{3}\\
={}&p\bigl((p^{2}-q^{2})+(p-1)\bigr)A^{4}+q(4p^{2}q-q^{3}+3p+2q-2)A^{3}\\
&+q^{2}(5p-1)A^{2}+q^{2}A+q^{3}.
\end{aligned} Δ = = = = = = 2 A 7 + ( q + 1 − p ) A 6 − A 5 + ( − q 2 − q − p 2 q − p q 2 + pq ) A 4 + ( − q 3 − p 2 q − p q 2 + 2 pq − q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 ( q + 1 + p ) A 6 + ( 2 q − 1 ) A 5 + ( − q 2 − q − p 2 q − p q 2 + pq ) A 4 + ( − q 3 − p 2 q − p q 2 + 2 pq − q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 ( pq + p + p 2 + 2 q − 1 ) A 5 + ( 2 pq − p 2 q − p q 2 ) A 4 + ( − q 3 − p 2 q − p q 2 + 2 pq − q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 ( p 2 + p 3 + 4 pq − p q 2 − p ) A 4 + ( − q 3 + 3 pq + 2 q 2 − 2 q ) A 3 + ( p q 2 − q 2 ) A 2 + q 2 A + q 3 ( p 2 + p 3 − p q 2 − p ) A 4 + ( 4 p 2 q − q 3 + 3 pq + 2 q 2 − 2 q ) A 3 + ( 5 p q 2 − q 2 ) A 2 + q 2 A + q 3 p ( ( p 2 − q 2 ) + ( p − 1 ) ) A 4 + q ( 4 p 2 q − q 3 + 3 p + 2 q − 2 ) A 3 + q 2 ( 5 p − 1 ) A 2 + q 2 A + q 3 .
Since p ≥ q ≥ 1 p\ge q\ge1 p ≥ q ≥ 1 and A > 0 A>0 A > 0 , the last expression is positive. Hence Δ > 0 \Delta>0 Δ > 0 , and the proof is completed.
Proof of the upper estimate of Theorem 1.3
We recall from Remark 1.6 (ii) that K 2 ( k ) ≥ k + 2 K_{2}(k)\ge k+2 K 2 ( k ) ≥ k + 2 . Setting K : = K 2 ( k ) K:=K_{2}(k) K := K 2 ( k ) for brevity, we have to prove for every positive odd integer k k k the inequality
p − 1 F k + 1 + ( ∑ i = k + 2 K p + q − 1 F i ) − 1 F k > 0. (21) \frac{p-1}{F_{k+1}}+\left(\sum_{i=k+2}^{K}\frac{p+q-1}{F_{i}}\right)-\frac{1}{F_{k}}>0. \tag*{(21)} F k + 1 p − 1 + ( i = k + 2 ∑ K F i p + q − 1 ) − F k 1 > 0. (21)
Lemma 5.1. Let k ≥ 1 k\ge1 k ≥ 1 be an odd integer. If
− A + 1 F k + ( p − 1 ) ( A + 1 ) F k + 1 + ( p + q ) A + p + 2 q − 1 F k + 2 + A + q F k + 3 > A + q F K + A + q F K + 1 , (22) -\frac{A+1}{F_{k}}+\frac{(p-1)(A+1)}{F_{k+1}}+\frac{(p+q)A+p+2q-1}{F_{k+2}}+\frac{A+q}{F_{k+3}}>\frac{A+q}{F_{K}}+\frac{A+q}{F_{K+1}}, \tag*{(22)} − F k A + 1 + F k + 1 ( p − 1 ) ( A + 1 ) + F k + 2 ( p + q ) A + p + 2 q − 1 + F k + 3 A + q > F K A + q + F K + 1 A + q , (22) then the inequality (5.1) holds.
Proof. Let us denote by L L L the left hand side of (5.1). By the identity (17) we have
L = − 1 F k − q F k + 1 + ( p + q − 1 ) A A 2 − 1 ( 1 F k + 1 F k + 1 − 1 F K − 1 F K + 1 + ∑ i = k + 1 K a i ) . L=-\frac{1}{F_{k}}-\frac{q}{F_{k+1}}+\frac{(p+q-1)A}{A^{2}-1}\left(\frac{1}{F_{k}}+\frac{1}{F_{k+1}}-\frac{1}{F_{K}}-\frac{1}{F_{K+1}}+\sum_{i=k+1}^{K}a_{i}\right). L = − F k 1 − F k + 1 q + A 2 − 1 ( p + q − 1 ) A ( F k 1 + F k + 1 1 − F K 1 − F K + 1 1 + i = k + 1 ∑ K a i ) .
Since K ≥ k + 2 K\ge k+2 K ≥ k + 2 , Lemma 4.1 gives the following relations:
L ≥ − 1 F k − q F k + 1 + ( p + q − 1 ) A A 2 − 1 ( 1 F k + 1 F k + 1 − 1 F K − 1 F K + 1 + a k + 1 + a k + 2 ) = − 1 F k − q F k + 1 + ( p + q − 1 ) A A 2 − 1 ( 1 F k + 2 + 1 F k + 3 − 1 F K − 1 F K + 1 + A 2 − 1 A F k + 1 + A 2 − 1 A F k + 2 ) = − 1 F k + p − 1 F k + 1 + ( p + q + q − 1 A + 1 ) 1 F k + 2 + A + q A + 1 ( 1 F k + 3 − 1 F K − 1 F K + 1 ) . \begin{aligned}
L\ge-\frac{1}{F_{k}}-\frac{q}{F_{k+1}}+\frac{(p+q-1)A}{A^{2}-1}\left(\frac{1}{F_{k}}+\frac{1}{F_{k+1}}-\frac{1}{F_{K}}-\frac{1}{F_{K+1}}+a_{k+1}+a_{k+2}\right) \\
&=-\frac{1}{F_{k}}-\frac{q}{F_{k+1}}+\frac{(p+q-1)A}{A^{2}-1}\left(\frac{1}{F_{k+2}}+\frac{1}{F_{k+3}}-\frac{1}{F_{K}}-\frac{1}{F_{K+1}}+\frac{A^{2}-1}{AF_{k+1}}+\frac{A^{2}-1}{AF_{k+2}}\right) \\
&=-\frac{1}{F_{k}}+\frac{p-1}{F_{k+1}}+\left(p+q+\frac{q-1}{A+1}\right)\frac{1}{F_{k+2}}+\frac{A+q}{A+1}\left(\frac{1}{F_{k+3}}-\frac{1}{F_{K}}-\frac{1}{F_{K+1}}\right).
\end{aligned} L ≥ − F k 1 − F k + 1 q + A 2 − 1 ( p + q − 1 ) A ( F k 1 + F k + 1 1 − F K 1 − F K + 1 1 + a k + 1 + a k + 2 ) = − F k 1 − F k + 1 q + A 2 − 1 ( p + q − 1 ) A ( F k + 2 1 + F k + 3 1 − F K 1 − F K + 1 1 + A F k + 1 A 2 − 1 + A F k + 2 A 2 − 1 ) = − F k 1 + F k + 1 p − 1 + ( p + q + A + 1 q − 1 ) F k + 2 1 + A + 1 A + q ( F k + 3 1 − F K 1 − F K + 1 1 ) .
Hence (5.1) is satisfied if the last expression is 0 0 0 , and this is equivalent to (5.2). □
Now we estimate the left and right hand sides of (5.2). Similarly to the preceding section, we introduce the number
t : = − B A = q A 2 ∈ ( 0 , 1 ) , t:=-\frac{B}{A}=\frac{q}{A^{2}}\in(0,1), t := − A B = A 2 q ∈ ( 0 , 1 ) ,
and we recall from (18) the identity
1 ( 1 + t ) F j = A A j ( 1 − ( − t ) j ) = A 1 − j ( 1 + ( − t ) j + ( − t ) 2 j + ( − t ) 3 j + ( − t ) 4 j + ⋯ ) . (23) \frac{1}{(1+t)F_{j}}=\frac{A}{A^{j}(1-(-t)^{j})}=A^{1-j}\left(1+(-t)^{j}+(-t)^{2j}+(-t)^{3j}+(-t)^{4j}+\cdots\right). \tag*{(23)} ( 1 + t ) F j 1 = A j ( 1 − ( − t ) j ) A = A 1 − j ( 1 + ( − t ) j + ( − t ) 2 j + ( − t ) 3 j + ( − t ) 4 j + ⋯ ) . (23)
for all j ≥ 1 j \ge1 j ≥ 1 .
Lemma 5.2. The left hand side L k L_k L k of (22) satisfies the following inequality:
L k > ( 1 + t ) q k A − 3 k − 2 ( [ ( p 3 + p 2 + 3 p q ) A + ( p 2 q + 2 p q + q 2 − q ) ] − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 − q k ( A 4 − 2 k + A 3 − 2 k ) ) . (24) L_k > (1+t)q^k A^{-3k-2}\left([(p^3+p^2+3pq)A+(p^2q+2pq+q^2-q)]-(p+q)q^2A^{-2}-(p+2q-1)q^2A^{-3}-q^k(A^{4-2k}+A^{3-2k})\right). \tag*{(24)} L k > ( 1 + t ) q k A − 3 k − 2 ( [( p 3 + p 2 + 3 pq ) A + ( p 2 q + 2 pq + q 2 − q )] − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 − q k ( A 4 − 2 k + A 3 − 2 k ) ) . (24)
Proof. Using (23) we may rewrite L k L_k L k in the following form (we recall that k k k is odd):
L k 1 + t = A 1 − k ( A + 1 ) ( − 1 + t k − t 2 k + t 3 k − t 4 k + ⋯ ) + ( p − 1 ) A − k ( A + 1 ) ( 1 + t k + 1 + t 2 k + 2 + t 3 k + 3 + t 4 k + 4 + ⋯ ) + ( ( p + q ) A + p + 2 q − 1 ) A − k − 1 ( 1 − t k + 2 + t 2 k + 4 − t 3 k + 6 + t 4 k + 8 + ⋯ ) + ( A + q ) A − k − 2 ( 1 + t k + 3 + t 2 k + 6 + t 3 k + 9 + t 4 k + 12 + ⋯ ) . \begin{aligned}
\frac{L_k}{1+t}={}&A^{1-k}(A+1)\left(-1+t^k-t^{2k}+t^{3k}-t^{4k}+\cdots\right)\\
&+(p-1)A^{-k}(A+1)\left(1+t^{k+1}+t^{2k+2}+t^{3k+3}+t^{4k+4}+\cdots\right)\\
&+((p+q)A+p+2q-1)A^{-k-1}\left(1-t^{k+2}+t^{2k+4}-t^{3k+6}+t^{4k+8}+\cdots\right)\\
&+(A+q)A^{-k-2}\left(1+t^{k+3}+t^{2k+6}+t^{3k+9}+t^{4k+12}+\cdots\right).
\end{aligned} 1 + t L k = A 1 − k ( A + 1 ) ( − 1 + t k − t 2 k + t 3 k − t 4 k + ⋯ ) + ( p − 1 ) A − k ( A + 1 ) ( 1 + t k + 1 + t 2 k + 2 + t 3 k + 3 + t 4 k + 4 + ⋯ ) + (( p + q ) A + p + 2 q − 1 ) A − k − 1 ( 1 − t k + 2 + t 2 k + 4 − t 3 k + 6 + t 4 k + 8 + ⋯ ) + ( A + q ) A − k − 2 ( 1 + t k + 3 + t 2 k + 6 + t 3 k + 9 + t 4 k + 12 + ⋯ ) .
Since A 2 = p A + q A^2=pA+q A 2 = p A + q , here we have
− A 1 − k ( A + 1 ) + ( p − 1 ) A − k ( A + 1 ) + ( ( p + q ) A + p + 2 q − 1 ) A − k − 1 + ( A + q ) A − k − 2 = A − k − 2 [ − A 4 − A 3 + ( p − 1 ) ( A 3 + A 2 ) + ( p + q ) A 2 + ( p + 2 q − 1 ) A + ( A + q ) ] = A − k − 2 [ − A 4 + ( p − 2 ) A 3 + ( 2 p + q − 1 ) A 2 + ( p + 2 q ) A + q ] = A − k − 2 [ − 2 A 3 + ( 2 p − 1 ) A 2 + ( p + 2 q ) A + q ] = A − k − 2 [ − A 2 + p A + q ] = 0. \begin{aligned}
&-A^{1-k}(A+1)+(p-1)A^{-k}(A+1)+((p+q)A+p+2q-1)A^{-k-1}+(A+q)A^{-k-2}\\
={}&A^{-k-2}\left[-A^4-A^3+(p-1)(A^3+A^2)+(p+q)A^2+(p+2q-1)A+(A+q)\right]\\
={}&A^{-k-2}\left[-A^4+(p-2)A^3+(2p+q-1)A^2+(p+2q)A+q\right]\\
={}&A^{-k-2}\left[-2A^3+(2p-1)A^2+(p+2q)A+q\right]\\
={}&A^{-k-2}\left[-A^2+pA+q\right]\\
={}&0.
\end{aligned} = = = = = − A 1 − k ( A + 1 ) + ( p − 1 ) A − k ( A + 1 ) + (( p + q ) A + p + 2 q − 1 ) A − k − 1 + ( A + q ) A − k − 2 A − k − 2 [ − A 4 − A 3 + ( p − 1 ) ( A 3 + A 2 ) + ( p + q ) A 2 + ( p + 2 q − 1 ) A + ( A + q ) ] A − k − 2 [ − A 4 + ( p − 2 ) A 3 + ( 2 p + q − 1 ) A 2 + ( p + 2 q ) A + q ] A − k − 2 [ − 2 A 3 + ( 2 p − 1 ) A 2 + ( p + 2 q ) A + q ] A − k − 2 [ − A 2 + p A + q ] 0.
Therefore the preceding identity simplifies to
L k 1 + t = A 1 − k ( A + 1 ) ( t k − t 2 k + t 3 k − t 4 k + ⋯ ) + ( p − 1 ) A − k ( A + 1 ) ( t k + 1 + t 2 k + 2 + t 3 k + 3 + t 4 k + 4 + ⋯ ) + [ ( p + q ) A + p + 2 q − 1 ] A − k − 1 ( − t k + 2 + t 2 k + 4 − t 3 k + 6 + t 4 k + 8 + ⋯ ) + ( A + q ) A − k − 2 ( t k + 3 + t 2 k + 6 + t 3 k + 9 + t 4 k + 12 + ⋯ ) . \begin{aligned}
\frac{L_k}{1+t}={}&A^{1-k}(A+1)\left(t^k-t^{2k}+t^{3k}-t^{4k}+\cdots\right)\\
&+(p-1)A^{-k}(A+1)\left(t^{k+1}+t^{2k+2}+t^{3k+3}+t^{4k+4}+\cdots\right)\\
&+[(p+q)A+p+2q-1]A^{-k-1}\left(-t^{k+2}+t^{2k+4}-t^{3k+6}+t^{4k+8}+\cdots\right)\\
&+(A+q)A^{-k-2}\left(t^{k+3}+t^{2k+6}+t^{3k+9}+t^{4k+12}+\cdots\right).
\end{aligned} 1 + t L k = A 1 − k ( A + 1 ) ( t k − t 2 k + t 3 k − t 4 k + ⋯ ) + ( p − 1 ) A − k ( A + 1 ) ( t k + 1 + t 2 k + 2 + t 3 k + 3 + t 4 k + 4 + ⋯ ) + [( p + q ) A + p + 2 q − 1 ] A − k − 1 ( − t k + 2 + t 2 k + 4 − t 3 k + 6 + t 4 k + 8 + ⋯ ) + ( A + q ) A − k − 2 ( t k + 3 + t 2 k + 6 + t 3 k + 9 + t 4 k + 12 + ⋯ ) .
Since 0 < t < 1 0<t<1 0 < t < 1 , by the standard minoration of Leibniz type alternating series we infer that
L k 1 + t > A 1 − k ( A + 1 ) ( t k − t 2 k ) + ( p − 1 ) A − k ( A + 1 ) t k + 1 − [ ( p + q ) A + p + 2 q − 1 ] A − k − 1 t k + 2 , \frac{L_k}{1+t}>A^{1-k}(A+1)(t^k-t^{2k})+(p-1)A^{-k}(A+1)t^{k+1}-[(p+q)A+p+2q-1]A^{-k-1}t^{k+2}, 1 + t L k > A 1 − k ( A + 1 ) ( t k − t 2 k ) + ( p − 1 ) A − k ( A + 1 ) t k + 1 − [( p + q ) A + p + 2 q − 1 ] A − k − 1 t k + 2 ,
or equivalently that
L k A k + 2 ( 1 + t ) t k > ( A 4 + A 3 ) ( 1 − t k ) + ( p − 1 ) ( A 3 + A 2 ) t − [ ( p + q ) A + p + 2 q − 1 ] A t 2 . \frac{L_kA^{k+2}}{(1+t)t^k}>(A^4+A^3)(1-t^k)+(p-1)(A^3+A^2)t-[(p+q)A+p+2q-1]At^2. ( 1 + t ) t k L k A k + 2 > ( A 4 + A 3 ) ( 1 − t k ) + ( p − 1 ) ( A 3 + A 2 ) t − [( p + q ) A + p + 2 q − 1 ] A t 2 .
Using the equality t = q A − 2 t=qA^{-2} t = q A − 2 , and then repeatedly the identity A 2 = p A + q A^2=pA+q A 2 = p A + q , we infer the following relations:
L k A 3 k + 2 ( 1 + t ) q k + q k ( A 4 − 2 k + A 3 − 2 k ) > A 4 + A 3 + ( p − 1 ) q ( A + 1 ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 = ( p + 1 ) A 3 + q A 2 + ( p − 1 ) q A + ( p − 1 ) q − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 = ( p 2 + p + q ) A 2 + 2 p q A + ( p − 1 ) q − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 = ( p 3 + p 2 + 3 p q ) A + ( p 2 q + 2 p q + q 2 − q ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 . \begin{aligned}
\frac{L_kA^{3k+2}}{(1+t)q^k}+q^k\left(A^{4-2k}+A^{3-2k}\right)>A^4+A^3+(p-1)q(A+1)-(p+q)q^2A^{-2}-(p+2q-1)q^2A^{-3} \\
&=(p+1)A^3+qA^2+(p-1)qA+(p-1)q-(p+q)q^2A^{-2}-(p+2q-1)q^2A^{-3} \\
&=(p^2+p+q)A^2+2pqA+(p-1)q-(p+q)q^2A^{-2}-(p+2q-1)q^2A^{-3} \\
&=(p^3+p^2+3pq)A+(p^2q+2pq+q^2-q)-(p+q)q^2A^{-2}-(p+2q-1)q^2A^{-3}.
\end{aligned} ( 1 + t ) q k L k A 3 k + 2 + q k ( A 4 − 2 k + A 3 − 2 k ) > A 4 + A 3 + ( p − 1 ) q ( A + 1 ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 = ( p + 1 ) A 3 + q A 2 + ( p − 1 ) q A + ( p − 1 ) q − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 = ( p 2 + p + q ) A 2 + 2 pq A + ( p − 1 ) q − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 = ( p 3 + p 2 + 3 pq ) A + ( p 2 q + 2 pq + q 2 − q ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 .
This is equivalent to (24) . □
Lemma 5.3. The right hand side R K R_K R K of (22) satisfies the following inequalities:
R K < ( 1 + t ) A − K ( A + q ) ( A + 1 + A 1 − K ) < ( 1 + t ) A − K ( A + q ) ( A + 2 ) . R_K < (1+t)A^{-K}(A+q)(A+1+A^{1-K}) < (1+t)A^{-K}(A+q)(A+2). R K < ( 1 + t ) A − K ( A + q ) ( A + 1 + A 1 − K ) < ( 1 + t ) A − K ( A + q ) ( A + 2 ) . Proof. Applying (23) we obtain that
R K 1 + t = A − K ( A + q ) ( A 1 − ( − t ) K + 1 1 − ( − t ) K + 1 ) = : A − K ( A + q ) T K \frac{R_K}{1+t}=A^{-K}(A+q)\left(\frac{A}{1-(-t)^K}+\frac{1}{1-(-t)^{K+1}}\right)=:A^{-K}(A+q)T_K 1 + t R K = A − K ( A + q ) ( 1 − ( − t ) K A + 1 − ( − t ) K + 1 1 ) =: A − K ( A + q ) T K We conclude by applying Lemma 4.4.
We recall that the validity of the upper estimate of Theorem 1.3 follows from the estimate (21) . In order to prove the latter we first give a technical lemma:
Lemma 5.4. Let ε = 1 \varepsilon=1 ε = 1 or ε = A 1 − K \varepsilon=A^{1-K} ε = A 1 − K . If
( p + q − 1 ) [ ( p 3 + p 2 + 3 p q ) A + ( p 2 q + 2 p q + q 2 − q ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 − q k ( A 4 − 2 k + A 3 − 2 k ) ] > q 2 A ( A + q ) ( A + 1 + ε ) . (25) (p+q-1)\left[(p^3+p^2+3pq)A+(p^2q+2pq+q^2-q)-(p+q)q^2A^{-2}-(p+2q-1)q^2A^{-3}-q^k\left(A^{4-2k}+A^{3-2k}\right)\right]>q^2A(A+q)(A+1+\varepsilon). \tag*{(25)} ( p + q − 1 ) [ ( p 3 + p 2 + 3 pq ) A + ( p 2 q + 2 pq + q 2 − q ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 − q k ( A 4 − 2 k + A 3 − 2 k ) ] > q 2 A ( A + q ) ( A + 1 + ε ) . (25) then the inequality (21) is satisfied.
Proof. In view of Lemmas 5.1–5.3 it is sufficient to prove the inequality
q k A − 3 k − 2 [ ( p 3 + p 2 + 3 p q ) A + ( p 2 q + 2 p q + q 2 − q ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 − q k ( A 4 − 2 k + A 3 − 2 k ) ] > A − K ( A + q ) ( A + 1 + ε ) , q^kA^{-3k-2}\left[(p^3+p^2+3pq)A+(p^2q+2pq+q^2-q)-(p+q)q^2A^{-2}-(p+2q-1)q^2A^{-3}-q^k\left(A^{4-2k}+A^{3-2k}\right)\right]>A^{-K}(A+q)(A+1+\varepsilon), q k A − 3 k − 2 [ ( p 3 + p 2 + 3 pq ) A + ( p 2 q + 2 pq + q 2 − q ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 − q k ( A 4 − 2 k + A 3 − 2 k ) ] > A − K ( A + q ) ( A + 1 + ε ) , which we may also write in the following form:
q k + 2 A K − 3 k − 1 [ ( p 3 + p 2 + 3 p q ) A + ( p 2 q + 2 p q + q 2 − q ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 − q k ( A 4 − 2 k + A 3 − 2 k ) ] > q 2 A ( A + q ) ( A + 1 + ε ) . q^{k+2}A^{K-3k-1}\left[(p^3+p^2+3pq)A+(p^2q+2pq+q^2-q)-(p+q)q^2A^{-2}-(p+2q-1)q^2A^{-3}-q^k\left(A^{4-2k}+A^{3-2k}\right)\right]>q^2A(A+q)(A+1+\varepsilon). q k + 2 A K − 3 k − 1 [ ( p 3 + p 2 + 3 pq ) A + ( p 2 q + 2 pq + q 2 − q ) − ( p + q ) q 2 A − 2 − ( p + 2 q − 1 ) q 2 A − 3 − q k ( A 4 − 2 k + A 3 − 2 k ) ] > q 2 A ( A + q ) ( A + 1 + ε ) . In view of Remark 1.4, it is enough to prove (25) .
Lemma 5.5. The inequality (25) of Lemma 5.4 is equivalent to the following one:
[ ( p 2 + p q + 2 q ) ( p 2 − q 2 ) + ( 2 − ε ) p q 2 − ε q 3 + 2 p 2 q − p 2 − 3 p q ] A + [ ( p q + q 2 ) ( p 2 − q 2 ) + p q 2 − ε q 3 + p 2 q + 2 p q 2 − 3 p q − 2 q 2 + q ] − ( p + q − 1 ) ( p + q ) q 2 A − 2 − ( p + q − 1 ) ( p + 2 q − 1 ) q 2 A − 3 > ( p + q − 1 ) q k ( A 4 − 2 k + A 3 − 2 k ) . (26) \begin{aligned}
&\left[(p^2+pq+2q)(p^2-q^2)+(2-\varepsilon)pq^2-\varepsilon q^3+2p^2q-p^2-3pq\right]A\\
&+\left[(pq+q^2)(p^2-q^2)+pq^2-\varepsilon q^3+p^2q+2pq^2-3pq-2q^2+q\right]\\
&-(p+q-1)(p+q)q^2A^{-2}-(p+q-1)(p+2q-1)q^2A^{-3}\\
&>(p+q-1)q^k\left(A^{4-2k}+A^{3-2k}\right). \tag*{(26)}
\end{aligned} [ ( p 2 + pq + 2 q ) ( p 2 − q 2 ) + ( 2 − ε ) p q 2 − ε q 3 + 2 p 2 q − p 2 − 3 pq ] A + [ ( pq + q 2 ) ( p 2 − q 2 ) + p q 2 − ε q 3 + p 2 q + 2 p q 2 − 3 pq − 2 q 2 + q ] − ( p + q − 1 ) ( p + q ) q 2 A − 2 − ( p + q − 1 ) ( p + 2 q − 1 ) q 2 A − 3 > ( p + q − 1 ) q k ( A 4 − 2 k + A 3 − 2 k ) . (26) Proof. Since the right hand side of (25) is equal to
q 2 A 3 + q 2 ( q + 1 + ε ) A 2 + ( 1 + ε ) q 3 A q^2A^3+q^2(q+1+\varepsilon)A^2+(1+\varepsilon)q^3A q 2 A 3 + q 2 ( q + 1 + ε ) A 2 + ( 1 + ε ) q 3 A = ( p q 2 + q 3 + ( 1 + ε ) q 2 ) A 2 + ( 2 + ε ) q 3 A =(pq^2+q^3+(1+\varepsilon)q^2)A^2+(2+\varepsilon)q^3A = ( p q 2 + q 3 + ( 1 + ε ) q 2 ) A 2 + ( 2 + ε ) q 3 A = ( p 2 q 2 + p q 3 + ( 1 + ε ) p q 2 + ( 2 + ε ) q 3 ) A + ( p q 3 + q 4 + ( 1 + ε ) q 3 ) , =(p^2q^2+pq^3+(1+\varepsilon)pq^2+(2+\varepsilon)q^3)A+(pq^3+q^4+(1+\varepsilon)q^3), = ( p 2 q 2 + p q 3 + ( 1 + ε ) p q 2 + ( 2 + ε ) q 3 ) A + ( p q 3 + q 4 + ( 1 + ε ) q 3 ) , (25) may be rewritten in the form
( ( p + q − 1 ) ( p 3 + p 2 + 3 p q ) − ( p 2 q 2 + p q 3 + ( 1 + ε ) p q 2 + ( 2 + ε ) q 3 ) ) A + ( ( p + q − 1 ) ( p 2 q + 2 p q + q 2 − q ) − ( p q 3 + q 4 + ( 1 + ε ) q 3 ) ) − ( p + q − 1 ) ( p + q ) q 2 A − 2 − ( p + q − 1 ) ( p + 2 q − 1 ) q 2 A − 3 > ( p + q − 1 ) q k ( A 4 − 2 k + A 3 − 2 k ) . \begin{aligned}
&\left((p+q-1)(p^3+p^2+3pq)-(p^2q^2+pq^3+(1+\varepsilon)pq^2+(2+\varepsilon)q^3)\right)A\\
&+\left((p+q-1)(p^2q+2pq+q^2-q)-(pq^3+q^4+(1+\varepsilon)q^3)\right)\\
&-(p+q-1)(p+q)q^2A^{-2}-(p+q-1)(p+2q-1)q^2A^{-3}\\
&>(p+q-1)q^k\left(A^{4-2k}+A^{3-2k}\right).
\end{aligned} ( ( p + q − 1 ) ( p 3 + p 2 + 3 pq ) − ( p 2 q 2 + p q 3 + ( 1 + ε ) p q 2 + ( 2 + ε ) q 3 ) ) A + ( ( p + q − 1 ) ( p 2 q + 2 pq + q 2 − q ) − ( p q 3 + q 4 + ( 1 + ε ) q 3 ) ) − ( p + q − 1 ) ( p + q ) q 2 A − 2 − ( p + q − 1 ) ( p + 2 q − 1 ) q 2 A − 3 > ( p + q − 1 ) q k ( A 4 − 2 k + A 3 − 2 k ) . Simplifying the last expression we obtain (26) because
( p + q − 1 ) ( p 3 + p 2 + 3 p q ) − ( p 2 q 2 + p q 3 + ( 1 + ε ) p q 2 + ( 2 + ε ) q 3 ) = p 4 + p 3 + 3 p 2 q + p 3 q + p 2 q + 3 p q 2 − p 3 − p 2 − 3 p q − p 2 q 2 − p q 3 \begin{aligned}
&(p+q-1)(p^3+p^2+3pq)-(p^2q^2+pq^3+(1+\varepsilon)pq^2+(2+\varepsilon)q^3)\\
&=p^4+p^3+3p^2q+p^3q+p^2q+3pq^2-p^3-p^2-3pq-p^2q^2-pq^3
\end{aligned} ( p + q − 1 ) ( p 3 + p 2 + 3 pq ) − ( p 2 q 2 + p q 3 + ( 1 + ε ) p q 2 + ( 2 + ε ) q 3 ) = p 4 + p 3 + 3 p 2 q + p 3 q + p 2 q + 3 p q 2 − p 3 − p 2 − 3 pq − p 2 q 2 − p q 3
− ( 1 + ε ) p q 2 − ( 2 + ε ) q 3 = ( p 4 + p 3 q − p 2 q 2 − p q 3 ) + ( 4 p 2 q + ( 2 − ε ) p q 2 − ( 2 + ε ) q 3 ) − ( p 2 + 3 p q ) = ( p 2 + p q + 2 q ) ( p 2 − q 2 ) + ( 2 − ε ) p q 2 − ε q 3 + 2 p 2 q − p 2 − 3 p q -(1+\varepsilon)pq^2-(2+\varepsilon)q^3
= (p^4+p^3q-p^2q^2-pq^3)+(4p^2q+(2-\varepsilon)pq^2-(2+\varepsilon)q^3)-(p^2+3pq)
= (p^2+pq+2q)(p^2-q^2)+(2-\varepsilon)pq^2-\varepsilon q^3+2p^2q-p^2-3pq − ( 1 + ε ) p q 2 − ( 2 + ε ) q 3 = ( p 4 + p 3 q − p 2 q 2 − p q 3 ) + ( 4 p 2 q + ( 2 − ε ) p q 2 − ( 2 + ε ) q 3 ) − ( p 2 + 3 pq ) = ( p 2 + pq + 2 q ) ( p 2 − q 2 ) + ( 2 − ε ) p q 2 − ε q 3 + 2 p 2 q − p 2 − 3 pq
and
( p + q − 1 ) ( p 2 q + 2 p q + q 2 − q ) − ( p q 3 + q 4 + ( 1 + ε ) q 3 ) = p 3 q + 2 p 2 q + p q 2 − p q + p 2 q 2 + 2 p q 2 + q 3 − q 2 − p 2 q − 2 p q − q 2 + q − p q 3 − q 4 − ( 1 + ε ) q 3 = ( p q + q 2 ) ( p 2 − q 2 ) + p q 2 − ε q 3 + p 2 q + 2 p q 2 − 2 q 2 + q − 3 p q . \begin{aligned}
(p+q-1)(p^2q+2pq+q^2-q)-(pq^3+q^4+(1+\varepsilon)q^3)
&=p^3q+2p^2q+pq^2-pq+p^2q^2+2pq^2+q^3-q^2\\
&\quad-p^2q-2pq-q^2+q-pq^3-q^4-(1+\varepsilon)q^3\\
&=(pq+q^2)(p^2-q^2)+pq^2-\varepsilon q^3+p^2q+2pq^2-2q^2+q-3pq.
\end{aligned} ( p + q − 1 ) ( p 2 q + 2 pq + q 2 − q ) − ( p q 3 + q 4 + ( 1 + ε ) q 3 ) = p 3 q + 2 p 2 q + p q 2 − pq + p 2 q 2 + 2 p q 2 + q 3 − q 2 − p 2 q − 2 pq − q 2 + q − p q 3 − q 4 − ( 1 + ε ) q 3 = ( pq + q 2 ) ( p 2 − q 2 ) + p q 2 − ε q 3 + p 2 q + 2 p q 2 − 2 q 2 + q − 3 pq .
Now we are ready to prove the upper estimate of Theorem 1.3. We recall from Example 1.5 that Theorem 1.3 holds for p = q = 2 p=q=2 p = q = 2 and k = 1 k=1 k = 1 . In the remaining cases, in view of Lemmas 5.4 and 5.5, it is sufficient to prove the estimate (5.6) with ε = 1 \varepsilon=1 ε = 1 or with ε = A 1 − K \varepsilon=A^{1-K} ε = A 1 − K . We distinguish the following three cases:
p > q , p = q ≥ 3 and p = q = 2 , k ≥ 3. p>q,\qquad p=q\ge3\qquad\text{and}\qquad p=q=2,\ k\ge3. p > q , p = q ≥ 3 and p = q = 2 , k ≥ 3.
Proof of (5.6) with ε = 1 \varepsilon=1 ε = 1 for all k ≥ 1 k\ge1 k ≥ 1 when p > q p>q p > q . Since p > q p>q p > q and p , q p,q p , q are integers, we have p − q ≥ 1 p-q\ge1 p − q ≥ 1 and p 2 − q 2 ≥ p + q p^2-q^2\ge p+q p 2 − q 2 ≥ p + q , so that the coefficient of A A A and the following term in (5.6) may be minorized as follows:
( p 2 + p q + 2 q ) ( p 2 − q 2 ) + ( p − q ) q 2 + 2 p 2 q − p 2 − 3 p q ≥ ( p 2 + p q + 2 q ) ( p + q ) + q 2 + 2 p 2 q − p 2 − 3 p q = p 3 + 4 p 2 q − p q + p q 2 + 3 q 2 − p 2 , \begin{aligned}
(p^2+pq+2q)(p^2-q^2)+(p-q)q^2+2p^2q-p^2-3pq
&\ge(p^2+pq+2q)(p+q)+q^2+2p^2q-p^2-3pq\\
&=p^3+4p^2q-pq+pq^2+3q^2-p^2,
\end{aligned} ( p 2 + pq + 2 q ) ( p 2 − q 2 ) + ( p − q ) q 2 + 2 p 2 q − p 2 − 3 pq ≥ ( p 2 + pq + 2 q ) ( p + q ) + q 2 + 2 p 2 q − p 2 − 3 pq = p 3 + 4 p 2 q − pq + p q 2 + 3 q 2 − p 2 ,
and
( p q + q 2 ) ( p 2 − q 2 ) + ( p − q ) q 2 + p 2 q + 2 p q 2 − 3 p q − 2 q 2 + q ≥ ( p q + q 2 ) ( p + q ) + q 2 + p 2 q + 2 p q 2 − 3 p q − 2 q 2 + q = 2 p 2 q + 4 p q 2 + q 3 − 3 p q − q 2 + q . \begin{aligned}
(pq+q^2)(p^2-q^2)+(p-q)q^2+p^2q+2pq^2-3pq-2q^2+q
&\ge(pq+q^2)(p+q)+q^2+p^2q+2pq^2-3pq-2q^2+q\\
&=2p^2q+4pq^2+q^3-3pq-q^2+q.
\end{aligned} ( pq + q 2 ) ( p 2 − q 2 ) + ( p − q ) q 2 + p 2 q + 2 p q 2 − 3 pq − 2 q 2 + q ≥ ( pq + q 2 ) ( p + q ) + q 2 + p 2 q + 2 p q 2 − 3 pq − 2 q 2 + q = 2 p 2 q + 4 p q 2 + q 3 − 3 pq − q 2 + q .
Therefore it is sufficient to show that
( p 3 + 4 p 2 q − p q + p q 2 + 3 q 2 − p 2 ) A + ( 2 p 2 q + 4 p q 2 + q 3 − 3 p q − q 2 + q ) > ( p + q − 1 ) [ ( p + q ) q 2 A 2 − k + ( p + 2 q − 1 ) q 2 A k − 3 + q k ( A 4 − 2 k + A 3 − 2 k ) ] . \begin{aligned}
&(p^3+4p^2q-pq+pq^2+3q^2-p^2)A+(2p^2q+4pq^2+q^3-3pq-q^2+q)\\
&\quad>(p+q-1)\left[(p+q)q^2A^{2-k}+(p+2q-1)q^2A^{k-3}+q^k\left(A^{4-2k}+A^{3-2k}\right)\right].
\end{aligned} ( p 3 + 4 p 2 q − pq + p q 2 + 3 q 2 − p 2 ) A + ( 2 p 2 q + 4 p q 2 + q 3 − 3 pq − q 2 + q ) > ( p + q − 1 ) [ ( p + q ) q 2 A 2 − k + ( p + 2 q − 1 ) q 2 A k − 3 + q k ( A 4 − 2 k + A 3 − 2 k ) ] .
Since 0 < q < p < A 0<q<p<A 0 < q < p < A and k ≥ 1 k\ge1 k ≥ 1 , on the right hand side we have
( p + q − 1 ) ( p + q ) q 2 A 2 − k < ( p + q − 1 ) ( p + q ) , (p+q-1)(p+q)q^2A^{2-k}<(p+q-1)(p+q), ( p + q − 1 ) ( p + q ) q 2 A 2 − k < ( p + q − 1 ) ( p + q ) ,
( p + q − 1 ) ( p + 2 q − 1 ) q 2 A k − 3 < 3 ( p + q − 1 ) , (p+q-1)(p+2q-1)q^2A^{k-3}<3(p+q-1), ( p + q − 1 ) ( p + 2 q − 1 ) q 2 A k − 3 < 3 ( p + q − 1 ) ,
( p + q − 1 ) q k ( A 4 − 2 k + A 3 − 2 k ) ≤ ( p + q − 1 ) q ( A 2 + A ) = ( p + q − 1 ) q ( p A + q + A ) = ( p 2 q + p q 2 + q 2 − q ) A + ( p + q − 1 ) q 2 , \begin{aligned}
(p+q-1)q^k\left(A^{4-2k}+A^{3-2k}\right)
&\le(p+q-1)q(A^2+A)\\
&=(p+q-1)q(pA+q+A)\\
&=(p^2q+pq^2+q^2-q)A+(p+q-1)q^2,
\end{aligned} ( p + q − 1 ) q k ( A 4 − 2 k + A 3 − 2 k ) ≤ ( p + q − 1 ) q ( A 2 + A ) = ( p + q − 1 ) q ( p A + q + A ) = ( p 2 q + p q 2 + q 2 − q ) A + ( p + q − 1 ) q 2 ,
so that it is sufficient to show the following inequality:
( p 3 + 4 p 2 q − p q + p q 2 + 3 q 2 − p 2 ) A + ( 2 p 2 q + 4 p q 2 + q 3 − 3 p q − q 2 + q ) > ( p 2 q + p q 2 + q 2 − q ) A + ( p + q − 1 ) ( q 2 + p + q + 3 ) . \begin{aligned}
&(p^3+4p^2q-pq+pq^2+3q^2-p^2)A+(2p^2q+4pq^2+q^3-3pq-q^2+q)\\
&\quad>(p^2q+pq^2+q^2-q)A+(p+q-1)(q^2+p+q+3).
\end{aligned} ( p 3 + 4 p 2 q − pq + p q 2 + 3 q 2 − p 2 ) A + ( 2 p 2 q + 4 p q 2 + q 3 − 3 pq − q 2 + q ) > ( p 2 q + p q 2 + q 2 − q ) A + ( p + q − 1 ) ( q 2 + p + q + 3 ) .
This is equivalent to
( p 3 + 3 p 2 q − p q + 2 q 2 − p 2 + q ) A + ( 2 p 2 q + 4 p q 2 + q 3 − 3 p q − q 2 + q ) > ( p + q − 1 ) ( p + q + 3 ) . (p^3+3p^2q-pq+2q^2-p^2+q)A+(2p^2q+4pq^2+q^3-3pq-q^2+q)>(p+q-1)(p+q+3). ( p 3 + 3 p 2 q − pq + 2 q 2 − p 2 + q ) A + ( 2 p 2 q + 4 p q 2 + q 3 − 3 pq − q 2 + q ) > ( p + q − 1 ) ( p + q + 3 ) .
Since A > p A>p A > p , it is sufficient to show that
( p 3 + 3 p 2 q − p q + 2 q 2 − p 2 + q ) p + ( 2 p 2 q + 4 p q 2 + q 3 − 3 p q − q 2 + q ) > ( p + q − 1 ) ( p + q + 3 ) , (p^3+3p^2q-pq+2q^2-p^2+q)p+(2p^2q+4pq^2+q^3-3pq-q^2+q)>(p+q-1)(p+q+3), ( p 3 + 3 p 2 q − pq + 2 q 2 − p 2 + q ) p + ( 2 p 2 q + 4 p q 2 + q 3 − 3 pq − q 2 + q ) > ( p + q − 1 ) ( p + q + 3 ) ,
and this is equivalent by a direct computation to the following inequality:
p 4 + 3 p 3 q + 5 p 2 q + p q 2 + 2 p + 3 q + 3 > p 3 + p 2 + 4 p q + q 2 . p^4+3p^3q+5p^2q+pq^2+2p+3q+3>p^3+p^2+4pq+q^2. p 4 + 3 p 3 q + 5 p 2 q + p q 2 + 2 p + 3 q + 3 > p 3 + p 2 + 4 pq + q 2 .
We complete the proof by observing that all terms are positive on both sides, and
p 4 > p 3 , 3 p 3 q > p 2 , 5 p 2 q > 4 p q and p q 2 > q 2 . p^4>p^3,\qquad3p^3q>p^2,\qquad5p^2q>4pq\qquad\text{and}\qquad pq^2>q^2. p 4 > p 3 , 3 p 3 q > p 2 , 5 p 2 q > 4 pq and p q 2 > q 2 .
Now we turn to the case p = q p=q p = q . Then the inequality (26) of Lemma 5.5 reduces to
[ ( 4 − 2 ε ) p 3 − 4 p 2 ] A + ( 4 − ε ) p 3 − 5 p 2 + p > ( 2 p − 1 ) [ 2 p 3 A − 2 + ( 3 p 3 − p 2 ) A − 3 + p k ( A 4 − 2 k + A 3 − 2 k ) ] , (27) \begin{aligned}
[(4-2\varepsilon)p^3-4p^2]A+(4-\varepsilon)p^3-5p^2+p
&>(2p-1)\left[2p^3A^{-2}+(3p^3-p^2)A^{-3}+p^k\left(A^{4-2k}+A^{3-2k}\right)\right], \tag*{(27)}
\end{aligned} [( 4 − 2 ε ) p 3 − 4 p 2 ] A + ( 4 − ε ) p 3 − 5 p 2 + p > ( 2 p − 1 ) [ 2 p 3 A − 2 + ( 3 p 3 − p 2 ) A − 3 + p k ( A 4 − 2 k + A 3 − 2 k ) ] , (27)
so that the validity of (27) implies the validity of the upper estimate in Theorem 1.3 for the corresponding values of p = q p=q p = q and k k k .
*Proof of (5.7) with ε = A 1 − K \varepsilon=A^{1-K} ε = A 1 − K for all k ≥ 1 k\geq1 k ≥ 1 when p = q ≥ 3. ∗ S i n c e p=q\geq3.* Since p = q ≥ 3. ∗ S in ce A>p>0a n d $ 3 p 3 − p 2 > 0 and \$3p^3-p^2>0 an d $3 p 3 − p 2 > 0 , for k ≥ 1 k\geq1 k ≥ 1 we have
2 p 3 A − 2 + ( 3 p − 1 ) p 2 A − 3 + p k ( A 4 − 2 k + A 3 − 2 k ) ≤ 2 p + 3 + p A 2 + p A = p 2 + 2 p + 3 + ( p 2 + p ) A . 2p^3A^{-2}+(3p-1)p^2A^{-3}+p^k\left(A^{4-2k}+A^{3-2k}\right)\leq2p+3+pA^2+pA=p^2+2p+3+(p^2+p)A. 2 p 3 A − 2 + ( 3 p − 1 ) p 2 A − 3 + p k ( A 4 − 2 k + A 3 − 2 k ) ≤ 2 p + 3 + p A 2 + p A = p 2 + 2 p + 3 + ( p 2 + p ) A .
Therefore, since 2 p − 1 > 0 2p-1>0 2 p − 1 > 0 , it suffices to prove that
[ ( 4 − 2 ε ) p 3 − 4 p 2 ] A + ( 4 − ε ) p 3 − 5 p 2 + p > ( 2 p − 1 ) ( p 2 + 2 p + 3 + ( p 2 + p ) A ) . [(4-2\varepsilon)p^3-4p^2]A+(4-\varepsilon)p^3-5p^2+p>(2p-1)\left(p^2+2p+3+(p^2+p)A\right). [( 4 − 2 ε ) p 3 − 4 p 2 ] A + ( 4 − ε ) p 3 − 5 p 2 + p > ( 2 p − 1 ) ( p 2 + 2 p + 3 + ( p 2 + p ) A ) .
This is equivalent to
[ 2 p 3 − 5 p 2 + p ] A + [ 2 p 3 − 8 p 2 − 3 p + 3 ] > ε p 3 ( 2 A + 1 ) . [2p^3-5p^2+p]A+[2p^3-8p^2-3p+3]>\varepsilon p^3(2A+1). [ 2 p 3 − 5 p 2 + p ] A + [ 2 p 3 − 8 p 2 − 3 p + 3 ] > ε p 3 ( 2 A + 1 ) .
Since K ≥ 3 K\geq3 K ≥ 3 by Remark 1.6 (ii), ε ≤ A − 2 \varepsilon\leq A^{-2} ε ≤ A − 2 , and it is sufficient to prove the following, stronger inequality:
[ 2 p 3 − 5 p 2 + p ] A + [ 2 p 3 − 8 p 2 − 3 p + 3 ] > 2 p 3 A − 1 + p 3 A − 2 , [2p^3-5p^2+p]A+[2p^3-8p^2-3p+3]>2p^3A^{-1}+p^3A^{-2}, [ 2 p 3 − 5 p 2 + p ] A + [ 2 p 3 − 8 p 2 − 3 p + 3 ] > 2 p 3 A − 1 + p 3 A − 2 ,
which is equivalent to
[ 2 p 3 − 5 p 2 + p ] A 3 + [ 2 p 3 − 8 p 2 − 3 p + 3 ] A 2 − 2 p 3 A − p 3 > 0. [2p^3-5p^2+p]A^3+[2p^3-8p^2-3p+3]A^2-2p^3A-p^3>0. [ 2 p 3 − 5 p 2 + p ] A 3 + [ 2 p 3 − 8 p 2 − 3 p + 3 ] A 2 − 2 p 3 A − p 3 > 0.
We prove this inequality by using the identities
A 2 = p A + p and A 3 = p ( p A + p ) + p A = ( p 2 + p ) A + p 2 A^2=pA+p\qquad\text{and}\qquad A^3=p(pA+p)+pA=(p^2+p)A+p^2 A 2 = p A + p and A 3 = p ( p A + p ) + p A = ( p 2 + p ) A + p 2
and our assumption p ≥ 3 p\geq3 p ≥ 3 as follows:
[ 2 p 3 − 5 p 2 + p ] A 3 + [ 2 p 3 − 8 p 2 − 3 p + 3 ] A 2 − 2 p 3 A − p 3 = [ 2 p 3 − 5 p 2 + p ] [ ( p 2 + p ) A + p 2 ] + [ 2 p 3 − 8 p 2 − 3 p + 3 ] ( p A + p ) − 2 p 3 A − p 3 = [ 2 p 5 − p 4 − 14 p 3 − 2 p 2 + 3 p ] A + [ 2 p 5 − 3 p 4 − 8 p 3 − 3 p 2 + 3 p ] = p 5 A ( 2 − 1 p − 14 p 2 − 2 p 3 + 3 p 4 ) + p 5 ( 2 − 3 p − 8 p 2 − 3 p 3 + 3 p 4 ) > p 5 A ( 2 − 1 3 − 14 3 2 − 2 3 3 ) + p 5 ( 2 − 3 3 − 8 3 2 − 3 3 3 ) = p 5 A 27 > 0. \begin{aligned}
&[2p^3-5p^2+p]A^3+[2p^3-8p^2-3p+3]A^2-2p^3A-p^3\\
&=[2p^3-5p^2+p][(p^2+p)A+p^2]+[2p^3-8p^2-3p+3](pA+p)-2p^3A-p^3\\
&=[2p^5-p^4-14p^3-2p^2+3p]A+[2p^5-3p^4-8p^3-3p^2+3p]\\
&=p^5A\left(2-\frac{1}{p}-\frac{14}{p^2}-\frac{2}{p^3}+\frac{3}{p^4}\right)+p^5\left(2-\frac{3}{p}-\frac{8}{p^2}-\frac{3}{p^3}+\frac{3}{p^4}\right)\\
&>p^5A\left(2-\frac{1}{3}-\frac{14}{3^2}-\frac{2}{3^3}\right)+p^5\left(2-\frac{3}{3}-\frac{8}{3^2}-\frac{3}{3^3}\right)\\
&=\frac{p^5A}{27}>0.
\end{aligned} [ 2 p 3 − 5 p 2 + p ] A 3 + [ 2 p 3 − 8 p 2 − 3 p + 3 ] A 2 − 2 p 3 A − p 3 = [ 2 p 3 − 5 p 2 + p ] [( p 2 + p ) A + p 2 ] + [ 2 p 3 − 8 p 2 − 3 p + 3 ] ( p A + p ) − 2 p 3 A − p 3 = [ 2 p 5 − p 4 − 14 p 3 − 2 p 2 + 3 p ] A + [ 2 p 5 − 3 p 4 − 8 p 3 − 3 p 2 + 3 p ] = p 5 A ( 2 − p 1 − p 2 14 − p 3 2 + p 4 3 ) + p 5 ( 2 − p 3 − p 2 8 − p 3 3 + p 4 3 ) > p 5 A ( 2 − 3 1 − 3 2 14 − 3 3 2 ) + p 5 ( 2 − 3 3 − 3 2 8 − 3 3 3 ) = 27 p 5 A > 0.
Proof of (5.7) with ε = A 1 − K \varepsilon=A^{1-K} ε = A 1 − K for all k ≥ 3 k\geq3 k ≥ 3 when $p=q=2. For p = 2 p=2 p = 2 inequality (27) becomes
( 16 − 16 ε ) A + ( 14 − 8 ε ) > 48 A − 2 + 60 A − 3 + 3 ⋅ 2 k ( A 4 − 2 k + A 3 − 2 k ) . (16-16\varepsilon)A+(14-8\varepsilon)>48A^{-2}+60A^{-3}+3\cdot2^k\left(A^{4-2k}+A^{3-2k}\right). ( 16 − 16 ε ) A + ( 14 − 8 ε ) > 48 A − 2 + 60 A − 3 + 3 ⋅ 2 k ( A 4 − 2 k + A 3 − 2 k ) .
Since 2 / A < 1 2/A<1 2/ A < 1 , the right hand side is decreasing as k k k increases. Therefore, in view of Example 1.5 , it is sufficient to prove the following inequality, with k k k replaced by 3.
( 16 − 16 ε ) A + ( 14 − 8 ε ) > 48 A − 2 + 60 A − 3 + 24 ( A − 2 + A − 3 ) . (16-16\varepsilon)A+(14-8\varepsilon)>48A^{-2}+60A^{-3}+24\left(A^{-2}+A^{-3}\right). ( 16 − 16 ε ) A + ( 14 − 8 ε ) > 48 A − 2 + 60 A − 3 + 24 ( A − 2 + A − 3 ) .
Since ε ≤ A − 2 \varepsilon\leq A^{-2} ε ≤ A − 2 , it is sufficient to show that
16 A − 16 A − 1 + 14 − 8 A − 2 > 48 A − 2 + 60 A − 3 + 24 ( A − 2 + A − 3 ) . 16A-16A^{-1}+14-8A^{-2}>48A^{-2}+60A^{-3}+24\left(A^{-2}+A^{-3}\right). 16 A − 16 A − 1 + 14 − 8 A − 2 > 48 A − 2 + 60 A − 3 + 24 ( A − 2 + A − 3 ) .
Multiplying by A 3 / 2 A^{3}/2 A 3 /2 and simplifying this may be written in the following equivalent form:
8 A 4 + 7 A 3 − 8 A 2 − 40 A − 42 > 0. 8A^{4}+7A^{3}-8A^{2}-40A-42>0. 8 A 4 + 7 A 3 − 8 A 2 − 40 A − 42 > 0.
The last inequality may be proved directly, by using repeatedly the identity A 2 = 2 A + 2 A^{2}=2A+2 A 2 = 2 A + 2 as follows:
8 A 4 + 7 A 3 − 8 A 2 − 40 A − 42 = 23 A 3 + 8 A 2 − 40 A − 42 = 54 A 2 + 6 A − 42 = 114 A + 66 > 0. \begin{aligned}
8A^{4}+7A^{3}-8A^{2}-40A-42 &= 23A^{3}+8A^{2}-40A-42 \\
&= 54A^{2}+6A-42 \\
&= 114A+66>0.
\end{aligned} 8 A 4 + 7 A 3 − 8 A 2 − 40 A − 42 = 23 A 3 + 8 A 2 − 40 A − 42 = 54 A 2 + 6 A − 42 = 114 A + 66 > 0.
Département de mathématique, Université de Strasbourg, 7 rue René Descartes, 67084 Strasbourg Cedex, France
Email address: vilmos.komornik@math.unistra.fr
Università Roma Tre, Dipartimento di Matematica e Fisica, Largo S. Leonardo Murialdo n. 1, 00146 Roma RM, Italy
Email address: marco.pedicini@uniroma3.it