This paper establishes new lower bounds for linear forms in powers of logarithms of algebraic numbers, refining previous results and utilizing Hermite-Mahler Padé approximations in both complex and p-adic contexts.
Contribution
It provides a novel lower bound for linear forms in logarithmic values, improving upon previous bounds with new techniques involving Padé approximations.
Findings
01
Refined lower bounds for linear forms in logarithms.
02
Applicable to both complex and p-adic cases.
03
Enhances previous results by Nesterenko-Waldschmidt.
Abstract
Let m≥2 be an integer, K an algebraic number field and α∈K∖{0,−1} with sufficiently small absolute value. In this article, we provide a new lower bound for linear form in 1,log(1+α),…,logm−1(1+α) with algebraic integer coefficients in both complex and p-adic cases (see Theorem 2.1 and Theorem 2.4). Especially, in the complex case, our result is a refinement of the result of Nesterenko-Waldschmidt on the lower bound of linear form in certain values of power of logarithms. The main integrant is based on Hermite-Mahler's Pad\'{e} approximation of exponential and logarithm functions.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMeromorphic and Entire Functions · Advanced Mathematical Identities · Analytic Number Theory Research
Full text
Linear independence of values of logarithms revisited
Makoto Kawashima
Abstract
Let m≥2 be an integer, K an algebraic number field and α∈K∖{0,−1} with sufficiently small absolute value.
In this article, we provide a new lower bound for linear form in 1,log(1+α),…,logm−1(1+α) with algebraic integer coefficients in both complex and p-adic cases (see Theorem 2.1 and Theorem 2.4). Especially, in the complex case, our result is a refinement of the result of Nesterenko-Waldschmidt on the lower bound of linear form in certain values of power of logarithms. The main integrant is based on Hermite-Mahler’s Padé approximation of exponential and logarithm functions.
7.3 Proof of Theorem 2.4
*** Key words and phrases.
Padé approximation, Linear independence, Logarithm, Exponential function.
1 Introduction
Let θ be a transcendental complex number. The function Φ:N×R>0⟶R>0 is a transcendental measure for θ if, for any sufficiently large positive integer m, any sufficiently large positive real number H and any nonzero polynomial P(z)∈Z[z] with deg(P)≤m and H(P)≤H, we have
[TABLE]
Let α be an algebraic number different from [math] and 1. Then the complex number log(α) is transcendental.
A great deal of work has already been done on finding transcendence measures for the values of logarithms.
For example, Mahler [7],[8],[9], Gel’fond [4], Feldman [3], Cijsouw [2], Reyssat [14] and Waldschmidt [18].
In [12], Nesterenko-Waldschmidt gave the following transcendence measure of values of logarithm.
Theorem 1.1**.**
([12, Theorem 6.1)])
Let α be an algebraic number, α=0,1.
Then there exists a effectively computable positive number C=C(α), depending only on α and the determination of the logarithm of α such that
if P(z)∈Z[z]∖{0}, degP≤m,L(P)≤L, then
[TABLE]
where L(P)=∑i=0m∣ai∣ if P(z)=∑i=0maizi.
The purpose of the present article is to give an improvement of Theorem 1.1 for algebraic numbers α which are sufficiently close to 1 and give a p-adic version of the result.
The main integrant of the proof of these results is Hermite-Padé approximation of exponential and logarithm functions.
2 Notations and main results
We collect some notations which we use throughout this article.
For a prime number p, we denote the p-adic number field by Qp, the p-adic completion of a fixed algebraic closure of Qp by Cp
and the normalized p-adic valuation on Cp by
[TABLE]
We fix an algebraic closure of Q and denote it by Q. We define the denominator function by
[TABLE]
We fix embeddings σ:Q↪C and σp:Q↪Cp.
For an algebraic number field K, we consider K as a subfield of Q and denote the ring of integers of K by OK.
For α∈K, we denote σ(α)=α, σp(α)=α and the set of conjugates of α by {α(k)}1≤k≤[K:Q] with α(1)=α and α(2) is the complex conjugate of α if σ(K)⊂R.
We denote the set of places of K (resp. infinite places, finite places) by MK (resp. MK∞, MKf).
For v∈MK, we denote the completion of K with respect to v by Kv.
For v∈MK, we define the normalized absolute value ∣⋅∣v as follows:
[TABLE]
where σv is the embedding K↪C corresponding to v.
Then we have the product formula
[TABLE]
Let m be a natural number and β:=(β0,…,βm)∈Km+1∖{0}.
We define the absolute height of β by
[TABLE]
Note that, for β=(β0,…,βm)∈OKm+1∖{0}, we have H(β)=∏v∈MK∞max{1,∣β0∣v,…,∣βm∣v} and
[TABLE]
Let log:C∖R≤0⟶C be the principal value logarithm function and logp:Cp∖{0}⟶Cp the p-adic logarithm function, i.e.
logp is a p-adic locally analytic function satisfying the following conditions:
[TABLE]
Under the above notations, we shall prove the following results.
Theorem 2.1**.**
Let m∈Z≥2, K be an algebraic number field and α∈K∖{0,−1}.
We define the real numbers
[TABLE]
where K∞ is the completion of K with respect to the fixed embedding σ:K↪C.
We assume ∣log(1+α)∣m≥4 and δ(α)>0,
then the numbers 1,log(1+α),…,logm−1(1+α) are linearly independent over K.
For any ϵ>0, we take a natural number n satisfying
[TABLE]
Then H0=(21exp[δ(α)n])[K:Q][K∞:R] satisfies the following property:
For any β:=(β0,…,βm−1)∈OKm∖{0} satisfying H0<H(β)≤H, then we have
[TABLE]
We will prove Theorem 2.4 in Section 6.1.
In the case of α is a rational number, we obtain the following corollary.
Corollary 2.2**.**
Let m∈Z≥2, ϵ>0 and α=c/d∈Q∖{0,−1} with (c,d)=1 and d>0.
Put
[TABLE]
Suppose δ(α)>0. Then we have
(i)* The complex numbers 1,log(1+α),…,logm−1(1+α) are linearly independent over Q.*
(ii)* Let n=n(ϵ) be a natural number satisfying*
[TABLE]
Then for
H0:=21exp(δ(α)n) and
b=(b0,b1,…,bm−1)∈Zm∖{0} of H0<H(b)≤H, we have
[TABLE]
Remark 2.3**.**
We show that Corollary 2.2 gives an improvement of Theorem 1.1 for 1+α∈Q∖{1,0} which are sufficiently close to 1 and m≥3.
We compare the result of Theorem 1.1 with that of Corollary 2.2.
Let m∈Z≥2, ϵ>0 and α=c/d∈Q∖{0,−1} with (c,d)=1 and d>0.
For b=(b0,b1,…,bm−1)∈Zm∖{0}, by Theorem 1.1,
we obtain
[TABLE]
where C(α) is a positive number depending on α with C(α)>105500⋅eH(α) for H(b)≤H.
Since we have
[TABLE]
we compare C(α)(m−1)2 and ν(α)/δ(α).
Since we have
[TABLE]
if ∣α∣=∣c∣/d is sufficiently close to [math], Corollary 2.2 improves Theorem 1.1 for 1+α∈Q∖{1,0} which are sufficiently close to 1 and m≥3.
Second, we introduce a p-adic version of Theorem 2.1.
Theorem 2.4**.**
Let m∈Z≥2, p be a prime number, K an algebraic number field and α∈K∖{0,−1} with ∣α∣p<1.
We use the same notations as in Theorem 2.1.
We also define the real numbers
[TABLE]
We assume δp(α)>0,
then the numbers 1,logp(1+α),…,logpm−1(1+α) are linearly independent over K.
For any ϵ>0, we take a natural number n satisfying
[TABLE]
where Kp is the completion of K with respect to the fixed embedding σp:K↪Cp.
Then H0=(21exp[δp(α)n])[K:Q][Kp:Qp] satisfies the following property:
For any β:=(β0,…,βm−1)∈OKm∖{0} satisfying H0<H(β)≤H, then we have
[TABLE]
We will prove Theorem 2.4 in Section 6.2.
3 Padé approximations of formal power series
In this section, we recall the definition and basic properties of Padé approximation of formal power series.
In the following of this section, we use K as a field with characteristic [math].
Lemma 3.1**.**
Let m∈N and f=(f1(z),…,fm(z))∈K[[z]]m. For n:=(n1,…,nm)∈Z≥0m, there exists a family of polynomials (A1(z),…,Am(z))∈K[z]m satisfying the following properties:
[TABLE]
In this article, we call the polynomials (A1(z),…,Am(z))∈K[z]m satisfying the conditions (i),(ii),(iii) in Lemma 3.1 as a weight n Padé approximants of f. For a weight n Padé approximants of f, (A1(z),…,Am(z)), we call the formal power series ∑j=1mAj(z)fj(z) as a weight n Padé approximation of f.
Definition 3.2**.**
Let m∈Z≥1 and f:=(f1(z),…,fm(z))∈K[[z]]m.
(i) Let n=(n1,…,nm)∈Z≥0m. We say n is normal with respect to f if for any weight n Padé approximation R(z) of f satisfy the equality
[TABLE]
(ii) We call f is perfect if any indices n∈Z≥0m are normal with respect to f.
Remark 3.3**.**
Let m∈N, n=(n1,…,nm)∈Z≥0m and f=(fj(z):=∑k=0∞fj,kzk)1≤j≤m∈K[[z]]m.
We put N=∑j=1m(nj+1). For r∈Z≥0, we define a N×(r+1) matrix An,r(f) by
[TABLE]
where aj,k=0 if k<0 for 1≤j≤m. Then we have the following bijection:
[TABLE]
Note that the indice n is normal with respect to f is equivalent to An,N−1(f)∈GLN(K).
Lemma 3.4**.**
Let m∈N, f:=(f1,…,fm)∈K[[z]]m and n:=(n1,…,nm)∈Nm.
Put ni:=(n1,…,ni−1,ni+1,ni+1,…,nm)∈Nm for 1≤i≤m.
Suppose n is normal with respect to f. Then we have
[TABLE]
for any weight ni Padé approximants (A1(z),…,Am(z)) of f.
Proof..
Put N:=∑j=1m(nj+1). Since n is normal with respect to f, we have
dimKker(An,N−1(f))=0.
Suppose there exist 1≤i≤m and a weight ni Padé approximants (A1(z),…,Am(z)) of f satisfying degAi<ni+1.
Put
[TABLE]
Then we have
[TABLE]
This is a contradiction. This completes the proof of Lemma 3.4.
∎
4 Padé approximation of exponential functions
In this section, we recall some properties of Padé approximation of exponential functions.
We quote some propositions for the Padé approximation of exponential functions in [6].
Proposition 4.1**.**
(cf. [6, Theorem 1.2.1])
Let n be a natural number and ω1,…,ωn pairwise distinct complex numbers. Then the functions eω1z,…,eωnz are perfect. Especially, for l∈N, the functions 1,ez,…,elz are perfect.
Let ω1,…,ωn be pairwise distinct complex numbers.
Explicit construction of Padé approximations of eω1z,…,eωnz are given by Hermite as follows.
Proposition 4.2**.**
(cf.[6, p. 242])
Let m:=(m1,…,mn)∈Z≥0n and {ah,j(m,ω)}1≤h≤n,1≤j≤mh+1 be the family of complex numbers satisfying the following equality:
[TABLE]
Then the formal power series
[TABLE]
is a weight m Padé approximation of eω1z,…,eωnz.
5 Padé approximations of power of logarithm functions
In this section, we construct Padé approximations of 1,log(1+z),…,logm−1(1+z) for m∈Z≥2 by using that of exponential functions obtained in Proposition 4.2.
Lemma 5.1**.**
Let f(z)∈K[[z]]. Suppose there exists g(z)∈K[[z]] satisfying f(g(z))=g(f(z))=z.
Put g~(z):=g(z)+1 and assume 1,g~(z),…,g~l(z) are perfect for any l∈N.
Then the any indices n∈{(n0,n1,…,nm−1)∈Z≥0m∣n0≥n1≥…≥nm−1} are normal with respect to (1,f(z),…,fm−1(z)) for any m∈Z≥2.
Proof..
Denote the set {(n0,n1,…,nm−1)∈Z≥0m∣n0≥n1≥…≥nm−1} by Xm.
Let
[TABLE]
where (ni)ri=(ni,…,ni)∈Z≥0ri for 0≤i≤s. We put
[TABLE]
We define the K-isomorphism Ψ by
[TABLE]
Note that Ψ is an order preserving map, namely we have ordF(z)=ordΨ(F(z)) for F(z)∈K[[z]].
We prove that Ψ induces the bijection
Ψ:Vn⟶Wm. Let R(z)=∑j=0m−1Aj(z)fj(z)∈Vn and put
Aj(z)=∑h=0n0ah,j(1+z)h with for 0≤j≤m−1.
Then we obtain
[TABLE]
Using (\refR1), we have
[TABLE]
Since Ψ is order preserving map, the equality (\refPsiR) shows that Ψ(R) is a weight m Padé approximation of g~.
Then we have Ψ(Vn)⊆Wm.
By the similar way, we also obtain Wm⊆Ψ(Vn). Then the map Ψ:Vn⟶Wm is bijection.
Since m is normal with respect to g~, we have ordS(z)=∑i=0s(ni+1)ri−1 for all S(z)∈Wm.
Since the bijection Ψ:Vn⟶Wm is order preserving map, we also obtain ordR(z)=∑i=0s(ni+1)ri−1 for all R(z)∈Vn.
This shows that the indice n is normal with respect to f. This completes the proof of Lemma 5.1.
∎
Proposition 5.2**.**
(cf. [6, Theorem 1.2.3])
Let m∈Z≥2. Denote the set {(n0,…,nm−1)∈Z≥0m∣n0≥n1≥…≥nm−1} by Xm.
Then any indices n∈Xm are normal with respect to (1,log(1+z),…,logm−1(1+z)).
Proof..
By Proposition 4.1, we have 1,ez,…,elz are perfect for l∈N.
Using Lemma 5.1 for f(z):=log(1+z) and g(z):=ez−1, any indices n∈Xm are normal with respect to (1,log(1+z),…,logm−1(1+z)). This completes the proof of Proposition 5.2.
∎
Let m∈Z≥2 and n∈Xm. We obtain a weight n Padé approximation of 1,log(1+z),…,logm−1(1+z) as follows:
Proposition 5.3**.**
Let {ri}0≤i≤s⊂N and {ni}0≤i≤s⊂Z≥0 satisfying r0+…+rs=m and n0>…>ns.
Put
[TABLE]
We define the family of rational numbers {ah,j(m,ω)}0≤h≤n0+1,1≤j≤m−1 as follows:
[TABLE]
Then the formal power series
[TABLE]
is a weight n Padé approximation of (1,log(1+z),…,logm−1(1+z)).
Proof..
We define a Q-isomorphism Ψ by
[TABLE]
By Proposition 4.2, the formal power series
[TABLE]
is a weight m Padé approximation of 1,ez,…,en0z. By the proof of Lemma 5.1, we have
[TABLE]
is a weight n Padé approximation of (1,log(1+z),…,logm−1(1+z)). Since the right hand side of the equality (\refR) is the formal power series R(z) defined in (\refPadelogpower), this completes the proof of Proposition 5.3.
∎
Remark 5.4**.**
Let (n0,…,nm)∈Xm and R(z) and R(z) be the formal power series defined in (\refPadelogpower) and (\refexplicitPadee) respectively.
Put N:=∑j=0m−1(nj+1). We have R(z)=(N−1)!zN−1+(higher order term) (see p. 242 [6]). Then by the definition of R(z), we have
[TABLE]
On the other hand, in p. 245 [6], Jager proved that the function
[TABLE]
where C is a contour with positive orientation enclosing the set {0,1,…,n0}, is a weight n Padé approximation of (1,log(1+z),…,logm−1(1+z)) and r(z) satisfies
[TABLE]
Since n is normal with respect to (1,log(1+z),…,logm−1(1+z)), a weight n Padé approximation of (1,log(1+z),…,logm−1(1+z)) is uniquely determined up to constant. Thus, by (\reffirsttermR) and (\reffirsttermr), we obtain
[TABLE]
6 Estimations
From this section to the last section, we use the following notations for m∈Z≥2, n∈Z≥0 and 1≤i≤m:
[TABLE]
We define the set of rational numbers {ah,j(mi,ω)}1≤i≤m,0≤h≤n+1,1≤j≤m satisfying the equality
[TABLE]
By Proposition 4.2 and Proposition 5.3, the formal power series
[TABLE]
are weight mi Padé approximation of 1,ez,…,e(n+1)z and weight ni Padé approximation of 1,log(1+z),…,logm−1(1+z) respectively.
We define
[TABLE]
Lemma 6.1**.**
(cf. [8, Theorem 1(a)])
We use the notations as above. For any 1≤i≤m, 0≤j≤m−1 and 0≤h≤n+1, we have
[TABLE]
Especially, for an algebraic number field K and an element α∈K, we have
[TABLE]
for 1≤i≤m, 0≤j≤m−1.
Proof..
Recall that, by the definition of ah,j(mi,ω), we have
[TABLE]
Fix a nonzero integer λ satisfying 0≤λ≤n. By the definition of Qm,i,n+1(x), we have the following equalities:
[TABLE]
Since we have
[TABLE]
then there exist a set of integers {ci,k}k∈Z≥0 satisfying
[TABLE]
where t is an intermediate. Substituting t=dn+1x−λ in the equality (\refbekikyuusuu), we obtain
[TABLE]
Substituting (\refbekiyuusuu2) for the equality (\reflambdaexp) and compare the equality (\reffukusyu) and (\reflambdaexp), we have
[TABLE]
By the relation
(n+1)!mλ!m(n−λ)!m(n+1−λ)i1∈Z and the equality (\refkeykilldenomi), we obtain
[TABLE]
In the case of λ=n+1, by using the same method as above, we also obtain
[TABLE]
This completes the proof of (\reftisaidenominator). The latter assertions are obtained by (\reftisaidenominator) and the definition of Ai,j,n+1(z). This completes the proof of Lemma 6.1.
∎
Lemma 6.2**.**
(cf. [8, Theorem 1(b)])
Let α be a complex number. Then we have
[TABLE]
for any 1≤i≤m, 0≤j≤m−1 and n∈Z≥0.
Proof..
In our proof of Lemma 6.2, we refer some of the arguments of [8, Theorem 1(b)].
First we remark that the aλ,j(mi,ω) can be represented as follows:
[TABLE]
Let λ be a natural number satisfying 0≤λ≤n+1. Then by the equality (\refresidue), we have the following inequality:
[TABLE]
Next, we estimate a lower bound of sup∣z−λ∣=1/2∣Qm,i,n+1(z)∣. Since we have the inequality
[TABLE]
for natural number h satisfying 0≤h≤n+1 and h=λ and z∈{z∈C∣∣z−λ∣=21}, we obtain the following inequalities:
[TABLE]
In the case of 0≤λ≤n, using the inequality (\refineqQ), we obtain
[TABLE]
Combining the inequality (see Proof of [8, Theorem 1, p. 376])
[TABLE]
and (\refzeroen), we obtain
[TABLE]
In the case of λ=n+1, using the inequality (\refineqQ), we obtain
[TABLE]
By the same arguments as above, from (\refn+1), we obtain
[TABLE]
Using the inequalities (\refa1), (\reflambdaconclusion) and (\refn+12), we obtain
[TABLE]
for 0≤λ≤n+1, 1≤j≤m and 1≤i≤m. By the definition of Pi,j,n+1(z) and use the inequalities (\refaconclusion), we obtain
[TABLE]
for α∈C. This completes the proof of Lemma 6.2.
∎
Lemma 6.3**.**
Let m be a natural number m≥2.
Let α∈C∖{0,−1} satisfying 2≤m/∣log(1+α)∣.
Then we have
[TABLE]
Proof..
This proof is based on that of [8, Theorem 1].
By (\refintegralrepR), we have
[TABLE]
where Cρ is a circle in the x-plane of center x=0 and radius ρ>n+1.
In the following, we take a positive real number ρ satisfying ρ≥2(n+1).
For x∈Cρ, we have
[TABLE]
Since
[TABLE]
and
[TABLE]
we have
[TABLE]
By (\refintegrepRin+1) and the above inequality, we obtain
[TABLE]
Put f(x)=x∣log(1+α)∣+xm(n+1)(n+2)−m(n+1)log(x) for x>0. Then f(x) takes the minimal value at
[TABLE]
Since n+2<m(n+1), we take ρ=2∣log(1+α)∣m(n+1)(1+1+4∣log(1+α)∣).
Note that, by the assumption 2≤m/∣log(1+α)∣, we have 2(n+1)≤ρ.
By (\refupperjyouyo1), we obtain the desire inequality. This completes the proof of Lemma 6.3.
∎
Next, we give a p-adic version of Lemma 6.3.
Lemma 6.4**.**
Let α∈Cp satisfying ∣α∣p<1.
Then we have
[TABLE]
for any natural number n satisfying 1/log∣α∣p−1+1/m≤n.
Proof..
Since Ri,n+1(z) is a wight ni Padé approximation of (1,log(1+z),…,logm−1(1+z)), we have ordRi,n+1(z)=m(n+1)+i−1.
Put En+1:=dn+1m(n+1)!m(m−1)! and
[TABLE]
First we prove the inequalities
[TABLE]
By Lemma 6.1, we have En+1Pi,j,n+1(z)∈Z[z] for 1≤i≤m, 0≤j≤m−1. Using the equality
[TABLE]
and the definition of log(1+z), we have den(ri,k,n+1)≤km−1 for m(n+1)+i−1≤k. Then we obtain the inequalities (\refabsvalcoeffRp).
Using the inequalities (\refabsvalcoeffRp), we have
[TABLE]
Since we have maxm(n+1)+i−1≤k∣ri,k,n+1αk∣p≤(m(n+1)+i−1)m−1∣α∣pm(n+1)+i−1
for any natural number n satisfying 1/log∣α∣p−1+1/m≤n, we have the desire inequalities.
This completes the proof of Lemma \refpupperboundjyouyo.
∎
7 Proof of main theorems
In this section, we give the proofs of Theorem 2.1 and Theorem 2.4.
7.1 Non-vanishing of certain determinants
Lemma 7.1**.**
(cf. [6, Theorem 1.2.3] )
Let K be a field with characteristic [math] and f=(1,f1,…,fm−1)∈K[[z]]m.
Let n=(n1,…,nm)∈Z≥0m. Put ni=(n1+1,n2+1,…,ni+1,ni+1,…,nm)for1≤i≤m.
Let (Ai,1(z),…,Ai,m(z))∈K[z]m be a weight ni Padé approximants of f. We define a polynomial Δ(z) by
[TABLE]
Then there exists γ∈K satisfying
[TABLE]
where N=∑j=1m(nj+1).
Moreover, if the set of indices {n}∪{ni}1≤i≤m−1 are normal with respect to f, we have Δ(z)=0, i.e. γ=0.
Proof..
Denote the formal power series Ai,1(z)+Ai,2(z)f1(z)+⋯+Ai,m(z)fm−1(z) by Ri(z) for 1≤i≤m. Note that we have
[TABLE]
By adding the i-th column of the matrix (\refdet) multiplied by fi−1(z) to the first column of the matrix (\refdet) for all 2≤i≤m, we obtain the following equality:
[TABLE]
For 1≤t,u≤m, we denote the (t,u)-th cofactor of the matrix in (\refequaldeterm1) by Δt,u(z). Then, we obtain
[TABLE]
Using the inequalities (\reforderlowerbound) and the equality (\refdecompdet), we have
[TABLE]
On the other hand, by using the equality (\refdet), we obtain
[TABLE]
Combining the inequalities (\reforderlowerbounddelta) and (\refupperbounddet), we obtain the equality (\refcalculationofdet).
If the set of indicies {n}∪{ni}1≤i≤m are normal with respect to f then, using Lemma 3.4, we have degAi,i(z)=ni+1 for 1≤i≤m.
Then we have
[TABLE]
This completes the proof of Lemma 7.1.
∎
Using Lemma 7.1 for f:=(1,log(1+z),…,logm−1(1+z)) and n=(n,…,n)∈Nm, we obtain the following corollary.
Corollary 7.2**.**
Let {Ai,j,n+1(z)}1≤i≤m,0≤j≤m−1⊂Q[z] be the set of polynomials defined in (\refcoeffpolynomial). Put Δ(n+1)(z):=det(Ai,j,n+1(z))1≤i≤m,0≤j≤m−1.
Then there exists some γ∈Q∖{0} satisfying
[TABLE]
Especially, we have
[TABLE]
7.2 Proof of Theorem 2.1
Before starting to prove Theorem 2.1, we introduce a sufficient condition to obtain a lower bound of linear forms of complex numbers with integer coefficients.
For β:=(β0,…,βm)∈Km+1∖{0} and θ0,θ1,…,θm∈C,
we denote ∑i=0mβiθi by Λ(β,θ).
Proposition 7.3**.**
Let K be an algebraic number field and fix an embedding of σ:K↪C. We denote the completion of K by the fixed embedding σ by K∞.
Let m∈N and θ0:=1,θ1,…,θm∈C∗.
Suppose there exist a set of matrices
[TABLE]
positive real numbers
[TABLE]
and a function f:N⟶R≥0
satisfying
[TABLE]
and
[TABLE]
for n≥N.
Put
[TABLE]
Suppose δ>0, then the numbers θ0,…,θm are linearly independent over K and, for any ϵ>0,
there exists a constant H0 depending on ϵ and the given data such that the following property holds.
For any β:=(β0,…,βm)∈OKm+1∖{0} satisfying H(β)≥H0, then we have
[TABLE]
Proof..
Since det(ai,j,n)0≤i,j≤m=0 for all n∈N, there exists 0≤In≤m satisfying
[TABLE]
where the vector (β0,…,βm) is placed in the In-th line of the matrix in the definition of Θβ,n.
Then by the product formula, we have
[TABLE]
where “\ {}^{\prime}\” in ∏k′ means k runs 2≤k≤[K:Q] if K∞=R and 3≤k≤[K:Q] if K∞=C.
In the following, we denote the (s,t)-th cofactor of the matrix in the definition of Θβ,n by Θβ,n,s,t.
First we give an upper bound of ∣Θβ,n(1)∣.
[TABLE]
Secondly, we give an upper bound of ∣Θβ,n(k)∣ for 2≤k≤[K:Q].
[TABLE]
Substituting the inequalities (\refupperiota) and (\reftaupartinfty) to the inequality (\refupperinfty) and taking the [K∞:R]1-th power, we obtain
[TABLE]
where
[TABLE]
Let ϵ>0 and 0<ϵ~<δ satisfying
[TABLE]
Write δ~:=δ−ϵ~.
By the assumptions δ>0 and (\reffn), there exists a natural number n∗ satisfying
[TABLE]
for all n≥n∗.
Consequently, using (\refconclusion2), we obtain
[TABLE]
Now for this fix n∗, we consider H0>1 such that e−δ~n∗H0[K∞:R][K:Q]≥21. Then we have e−δ~n∗H(β)[K∞:R][K:Q]≥21 for all β∈OKm+1∖{0} satisfying H(β)≥H0.
Take β∈OKm+1 satisfying H(β)≥H0. Let n~=n~(H(β))∈N be the least positive integer satisfying e−δ~n~H(β)[K∞:R][K:Q]<21. Note that n~>n∗. Using inequality (\refconclusion3) for n~, we have
[TABLE]
By the definition of n~, we have e−(n~−1)δ~H(β)[K∞:R][K:Q]≥21 and then en~≤(2H(β)[K∞:R][K:Q])δ~1e.
Finally, we obtain
[TABLE]
Note that the last inequality is obtained by the inequality (\refconditiontildemu).
This completes the proof of Proposition 7.3.
∎
Remark 7.4**.**
In this remark, we explain that how to take the positive number H0 in Proposition 7.3.
Let ϵ>0.
At first we take ϵ~:=(2ν+ϵδ)ϵδ2. Then we have
[TABLE]
Since f(n)=o(n)(n→∞), there exists n~∗∈N satisfying
[TABLE]
We take n∗≥n~∗ satisfying
[TABLE]
then we have the inequalities (\refcond1) and (\refcond2) for any n≥n∗.
At last, we take H0 by
[TABLE]
Then by the proof of Proposition 7.3,
the positive number H0 satisfies the following property:
[TABLE]
for any β:=(β0,…,βm)∈OKm+1∖{0} satisfying H(β)≥H0.
We use the same notations as in Section 5. Let Ri,n+1(z) be the formal power series defined in (\refexppadeS) for 1≤i≤m and n∈N.
Let K be an algebraic number field. We fix an element α∈K∖{0,−1} satisfying the assumption in Theorem 2.1. Then we have
[TABLE]
Put
[TABLE]
Then by Lemma 6.1 and Corollary 7.2, we have
[TABLE]
Define the set of positive real numbers
[TABLE]
Define g(n):=n[logn⋅exp(−(logn)/R)] with R:=(546−322)2515.
Note that, in [15], Rosser-Schoenfeld gives an estimate of dn of the form
[TABLE]
Put f(n):=mg(n).
Then we see f(n)=o(n)(n→∞).
By Lemma 6.2 and Lemma 6.3, we have
[TABLE]
for all n∈N.
We use Proposition 7.3 for θ1=log(1+α),…,θm−1=logm−1(1+α)
and the above datum
{A(k)(α)}1≤k≤[K:Q],
{cl(k)}0≤l≤m−11≤k≤[K:Q],
{T(k)(α)}1≤k≤[K:Q],
A(α),
c(α),
and T(α) then we obtain the assertion of Theorem 2.1.
∎
7.3 Proof of Theorem 2.4
Before proving Theorem 2.4, we introduce a p-adic version of Proposition 7.3.
Proposition 7.5**.**
Let K be an algebraic number field and fix an embedding ιp:K⟶Cp.
We denote the completion of K by the fixed embedding σp by Kp.
Let m∈N and θ0:=1,θ1,…,θm−1∈Cp.
Suppose, for all n∈N, there exist a set of matrices
[TABLE]
positive real numbers
[TABLE]
and a function f:N⟶R≥0 satisfying
[TABLE]
and
[TABLE]
for all n≥N. Put
[TABLE]
For ϵ>0 and n∗∈N satisfying n∗≥N and
[TABLE]
for all n≥n∗.
Suppose δp>0, then the numbers θ0,…,θm are linearly independent over K and the positive number
H0:=(21exp[δpn∗])[K:Q][Kp:Qp]
satisfies the following property:
For any β:=(β0,…,βm)∈OKm+1∖{0} satisfying H0≤H(β), then we have
[TABLE]
Since Proposition 7.5 can be proved by the same argument of that of Proposition 7.3, we omit the proof.
We use the same notations as in the proof of Theorem 2.1. Let K be an algebraic number field. We fix an element α∈K∖{0,−1} satisfying the assumption in Theorem 2.4.
Put
[TABLE]
By Lemma 6.2 and Lemma 6.4, we obtain
[TABLE]
for all natural number n satisfying 1/log(∣α∣p−1)+1/m≤n.
Using Proposition 7.5 for
θ1=logp(1+α),…,θm−1=logpm−1(1+α), we obtain the assertion of Theorem 2.4.
∎
Acknowledgements. The author warmly thank Noriko Hirata-Khono for her comments on the earlier version of this manuscript.
Bibliography20
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] A. Baker, Approximations to the logarithms of certain rational numbers , Acta Arith. 10 (1964), p. 315–323.
2[2] P. L. Cijsouw, Transcendence measures of exponentials and logarithms of algebraic numbers , Compositio Math. 28 (1974) , pp. 163–178.
3[3] N. I. Fel’dman, Approximation of the logarithms of algebraic numbers by algebraic numbers , English transl., Amer. Math. Soc. Transl. II ser., 58 (1966), pp. 125–142.
4[4] A. O. Gel’fond, Transcendental and algebraic numbers , English transl. (Dover Publications, New York (1960)).
5[5] C. Hermite, Sur la fonction exponentielle , Oeuvres tome III (1873), p. 150–181.
6[6] H. Jager, A multidimensional generalization of the Padé table. I, II, III, IV, V, VI , Nederl. Ak. Wetenschappen, 67 (1964), p. 192–249.
7[7] K. Mahler, Zur Approximation der Exponential funktion und des Logarithmus. Teil II , J. Reine. Angew. Math., 166 (1932), p. 137–150.
8[8] K. Mahler, On the approximation of logarithms of algebraic numbers , Phil. Trans. Royal Soc., 245 (1953), p. 371–398.