fbpx
Wikipedia

Baker's theorem

In transcendental number theory, a mathematical discipline, Baker's theorem gives a lower bound for the absolute value of linear combinations of logarithms of algebraic numbers. The result, proved by Alan Baker (1966, 1967a, 1967b), subsumed many earlier results in transcendental number theory and solved a problem posed by Alexander Gelfond nearly fifteen years earlier.[1] Baker used this to prove the transcendence of many numbers, to derive effective bounds for the solutions of some Diophantine equations, and to solve the class number problem of finding all imaginary quadratic fields with class number 1.

History edit

To simplify notation, let   be the set of logarithms to the base e of nonzero algebraic numbers, that is

 
where   denotes the set of complex numbers and   denotes the algebraic numbers (the algebraic closure of the rational numbers  ). Using this notation, several results in transcendental number theory become much easier to state. For example the Hermite–Lindemann theorem becomes the statement that any nonzero element of   is transcendental.

In 1934, Alexander Gelfond and Theodor Schneider independently proved the Gelfond–Schneider theorem. This result is usually stated as: if   is algebraic and not equal to 0 or 1, and if   is algebraic and irrational, then   is transcendental. The exponential function is multi-valued for complex exponents, and this applies to all of its values, which in most cases constitute infinitely many numbers. Equivalently, though, it says that if   are linearly independent over the rational numbers, then they are linearly independent over the algebraic numbers. So if   and   is not zero, then the quotient   is either a rational number or transcendental. It cannot be an algebraic irrational number like  .

Although proving this result of "rational linear independence implies algebraic linear independence" for two elements of   was sufficient for his and Schneider's result, Gelfond felt that it was crucial to extend this result to arbitrarily many elements of   Indeed, from Gel'fond (1960, p. 177):

...one may assume ... that the most pressing problem in the theory of transcendental numbers is the investigation of the measures of transcendence of finite sets of logarithms of algebraic numbers.

This problem was solved fourteen years later by Alan Baker and has since had numerous applications not only to transcendence theory but in algebraic number theory and the study of Diophantine equations as well. Baker received the Fields medal in 1970 for both this work and his applications of it to Diophantine equations.

Statement edit

With the above notation, Baker's theorem is a nonhomogeneous generalization of the Gelfond–Schneider theorem. Specifically it states:

Baker's Theorem — If   are linearly independent over the rational numbers, then for any algebraic numbers   not all zero, we have

 
where H is the maximum of the heights of   and C is an effectively computable number depending on n,   and the maximum d of the degrees of   (If β0 is nonzero then the assumption that   are linearly independent can be dropped.) In particular this number is nonzero, so 1 and   are linearly independent over the algebraic numbers.

Just as the Gelfond–Schneider theorem is equivalent to the statement about the transcendence of numbers of the form ab, so too Baker's theorem implies the transcendence of numbers of the form

 

where the bi are all algebraic, irrational, and 1, b1, ..., bn are linearly independent over the rationals, and the ai are all algebraic and not 0 or 1.

Baker (1977) also gave several versions with explicit constants. For example, if   has height at most   and all the numbers   have height at most   then the linear form

 

is either 0 or satisfies

 

where

 

and the field generated by   and   over the rationals has degree at most d. In the special case when β0 = 0 and all the   are rational integers, the rightmost term log Ω can be deleted.

An explicit result by Baker and Wüstholz for a linear form Λ with integer coefficients yields a lower bound of the form

 

where

 

and d is the degree of the number field generated by the  

Baker's method edit

Baker's proof of his theorem is an extension of the argument given by Gel'fond (1960, chapter III, section 4). The main ideas of the proof are illustrated by the proof of the following qualitative version of the theorem of Baker (1966) described by Serre (1971):

If the numbers   are linearly independent over the rational numbers, for nonzero algebraic numbers   then they are linearly independent over the algebraic numbers.

The precise quantitative version of Baker's theory can be proved by replacing the conditions that things are zero by conditions that things are sufficiently small throughout the proof.

The main idea of Baker's proof is to construct an auxiliary function   of several variables that vanishes to high order at many points of the form   then repeatedly show that it vanishes to lower order at even more points of this form. Finally the fact that it vanishes (to order 1) at enough points of this form implies using Vandermonde determinants that there is a multiplicative relation between the numbers ai.

Construction of the auxiliary function edit

Assume there is a relation

 

for algebraic numbers α1, ..., αn, β1, ..., βn−1. The function Φ is of the form

 

The integer coefficients p are chosen so that they are not all zero and Φ and its derivatives of order at most some constant M vanish at   for integers   with   for some constant h. This is possible because these conditions are homogeneous linear equations in the coefficients p, which have a non-zero solution provided the number of unknown variables p is larger than the number of equations. The linear relation between the logs of the α's is needed to cut down the number of linear equations that have to be satisfied. Moreover, using Siegel's lemma, the sizes of the coefficients p can be chosen to be not too large. The constants L, h, and M have to be carefully adjusted so that the next part of the proof works, and are subject to some constraints, which are roughly:

  • L must be somewhat smaller than M to make the argument about extra zeros below work.
  • A small power of h must be larger than L to make the final step of the proof work.
  • Ln must be larger than about Mn−1h in order that it is possible to solve for the coefficients p.

The constraints can be satisfied by taking h to be sufficiently large, M to be some fixed power of h, and L to be a slightly smaller power of h. Baker took M to be about h2 and L to be about h2−1/2n.

The linear relation between the logarithms of the α's is used to reduce L slightly; roughly speaking, without it the condition Ln must be larger than about Mn−1h would become Ln must be larger than about Mnh, which is incompatible with the condition that L is somewhat smaller than M.

Zeros of the auxiliary function edit

The next step is to show that Φ vanishes to slightly smaller order at many more points of the form   for integers l. This idea was Baker's key innovation: previous work on this problem involved trying to increase the number of derivatives that vanish while keeping the number of points fixed, which does not seem to work in the multivariable case. This is done by combining two ideas; First one shows that the derivatives at these points are quite small, by using the fact that many derivatives of Φ vanish at many nearby points. Then one shows that derivatives of Φ at this point are given by algebraic integers times known constants. If an algebraic integer has all its conjugates bounded by a known constant, then it cannot be too small unless it is zero, because the product of all conjugates of a nonzero algebraic integer is at least 1 in absolute value. Combining these two ideas implies that Φ vanishes to slightly smaller order at many more points   This part of the argument requires that Φ does not increase too rapidly; the growth of Φ depends on the size of L, so requires a bound on the size of L, which turns out to be roughly that L must be somewhat smaller than M. More precisely, Baker showed that since Φ vanishes to order M at h consecutive integers, it also vanishes to order M/2 at h1+1/8n consecutive integers 1, 2, 3, .... Repeating this argument J times shows that Φ vanishes to order M/2J at h1+J/8n points, provided that h is sufficiently large and L is somewhat smaller than M/2J.

One then takes J large enough that:

 

(J larger than about 16n will do if h2 > L) so that:

 

Completion of the proof edit

By definition   can be written as:

 

Therefore as l varies we have a system of (L + 1)n homogeneous linear equations in the (L + 1)n unknowns which by assumption has a non-zero solution, which in turn implies the determinant of the matrix of coefficients must vanish. However this matrix is a Vandermonde matrix and the formula for the determinant of such a matrix forces an equality between two of the values:

 

so   are multiplicatively dependent. Taking logs shows that   are linearly dependent over the rationals.

Extensions and generalizations edit

Baker (1966) in fact gave a quantitative version of the theorem, giving effective lower bounds for the linear form in logarithms. This is done by a similar argument, except statements about something being zero are replaced by statements giving a small upper bound for it, and so on.

Baker (1967a) showed how to eliminate the assumption about 2πi in the theorem. This requires a modification of the final step of the proof. One shows that many derivatives of the function   vanish at z = 0, by an argument similar to the one above. But these equations for the first (L+1)n derivatives again give a homogeneous set of linear equations for the coefficients p, so the determinant is zero, and is again a Vandermonde determinant, this time for the numbers λ1 log α1 + ⋯ + λn log αn. So two of these expressions must be the same which shows that log α1,...,log αn are linearly dependent over the rationals.

Baker (1967b) gave an inhomogeneous version of the theorem, showing that

 

is nonzero for nonzero algebraic numbers β0, ..., βn, α1, ..., αn, and moreover giving an effective lower bound for it. The proof is similar to the homogeneous case: one can assume that

 

and one inserts an extra variable z0 into Φ as follows:

 

Corollaries edit

As mentioned above, the theorem includes numerous earlier transcendence results concerning the exponential function, such as the Hermite–Lindemann theorem and Gelfond–Schneider theorem. It is not quite as encompassing as the still unproven Schanuel's conjecture, and does not imply the six exponentials theorem nor, clearly, the still open four exponentials conjecture.

The main reason Gelfond desired an extension of his result was not just for a slew of new transcendental numbers. In 1935 he used the tools he had developed to prove the Gelfond–Schneider theorem to derive a lower bound for the quantity

 

where β1 and β2 are algebraic and λ1 and λ2 are in  .[2] Baker's proof gave lower bounds for quantities like the above but with arbitrarily many terms, and he could use these bounds to develop effective means of tackling Diophantine equations and to solve Gauss' class number problem.

Extensions edit

Baker's theorem grants us the linear independence over the algebraic numbers of logarithms of algebraic numbers. This is weaker than proving their algebraic independence. So far no progress has been made on this problem at all. It has been conjectured[3] that if λ1, ..., λn are elements of   that are linearly independent over the rational numbers, then they are algebraically independent too. This is a special case of Schanuel's conjecture, but so far it remains to be proved that there even exist two algebraic numbers whose logarithms are algebraically independent. Indeed, Baker's theorem rules out linear relations between logarithms of algebraic numbers unless there are trivial reasons for them; the next most simple case, that of ruling out homogeneous quadratic relations, is the still open four exponentials conjecture.

Similarly, extending the result to algebraic independence but in the p-adic setting, and using the p-adic logarithm function, remains an open problem. It is known that proving algebraic independence of linearly independent p-adic logarithms of algebraic p-adic numbers would prove Leopoldt's conjecture on the p-adic ranks of units of a number field.

See also edit

Notes edit

  1. ^ See the final paragraph of Gel'fond (1960).
  2. ^ See Gel'fond (1960) and Sprindžuk (1993) for details.
  3. ^ Waldschmidt (2000), conjecture 1.15.

References edit

  • Baker, Alan (1966), "Linear forms in the logarithms of algebraic numbers. I", Mathematika, 13 (2): 204–216, doi:10.1112/S0025579300003971, ISSN 0025-5793, MR 0220680
  • Baker, Alan (1967a), "Linear forms in the logarithms of algebraic numbers. II", Mathematika, 14: 102–107, doi:10.1112/S0025579300008068, ISSN 0025-5793, MR 0220680
  • Baker, Alan (1967b), "Linear forms in the logarithms of algebraic numbers. III", Mathematika, 14 (2): 220–228, doi:10.1112/S0025579300003843, ISSN 0025-5793, MR 0220680
  • Baker, Alan (1990), Transcendental number theory, Cambridge Mathematical Library (2nd ed.), Cambridge University Press, ISBN 978-0-521-39791-9, MR 0422171
  • Baker, Alan (1977), "The theory of linear forms in logarithms", Transcendence theory: advances and applications (Proc. Conf., Univ. Cambridge, Cambridge, 1976), Boston, MA: Academic Press, pp. 1–27, ISBN 978-0-12-074350-6, MR 0498417
  • Baker, A.; Wüstholz, G. (1993), "Logarithmic forms and group varieties", Journal für die reine und angewandte Mathematik, 1993 (442): 19–62, doi:10.1515/crll.1993.442.19, MR 1234835, S2CID 118335888.
  • Baker, Alan; Wüstholz, G. (2007), Logarithmic forms and Diophantine geometry, New Mathematical Monographs, vol. 9, Cambridge University Press, ISBN 978-0-521-88268-2, MR 2382891
  • Gel'fond, A. O. (1960) [1952], Transcendental and algebraic numbers, Dover Phoenix editions, New York: Dover Publications, ISBN 978-0-486-49526-2, MR 0057921
  • Serre, Jean-Pierre (1971) [1969], "Travaux de Baker (Exposé 368)", Séminaire Bourbaki. Vol. 1969/70: Exposés 364--381, Lecture Notes in Mathematics, vol. 180, Berlin, New York: Springer-Verlag, pp. 73–86
  • Sprindžuk, Vladimir G. (1993), Classical Diophantine equations, Lecture Notes in Mathematics, vol. 1559, Berlin, New York: Springer-Verlag, doi:10.1007/BFb0073786, ISBN 978-3-540-57359-3, MR 1288309
  • Waldschmidt, Michel (2000), Diophantine approximation on linear algebraic groups, Grundlehren der Mathematischen Wissenschaften, vol. 326, Berlin, New York: Springer-Verlag, doi:10.1007/978-3-662-11569-5, ISBN 978-3-540-66785-8, MR 1756786

baker, theorem, transcendental, number, theory, mathematical, discipline, gives, lower, bound, absolute, value, linear, combinations, logarithms, algebraic, numbers, result, proved, alan, baker, 1966, 1967a, 1967b, subsumed, many, earlier, results, transcenden. In transcendental number theory a mathematical discipline Baker s theorem gives a lower bound for the absolute value of linear combinations of logarithms of algebraic numbers The result proved by Alan Baker 1966 1967a 1967b subsumed many earlier results in transcendental number theory and solved a problem posed by Alexander Gelfond nearly fifteen years earlier 1 Baker used this to prove the transcendence of many numbers to derive effective bounds for the solutions of some Diophantine equations and to solve the class number problem of finding all imaginary quadratic fields with class number 1 Contents 1 History 2 Statement 3 Baker s method 3 1 Construction of the auxiliary function 3 2 Zeros of the auxiliary function 3 3 Completion of the proof 3 4 Extensions and generalizations 4 Corollaries 5 Extensions 6 See also 7 Notes 8 ReferencesHistory editTo simplify notation let L displaystyle mathbb L nbsp be the set of logarithms to the base e of nonzero algebraic numbers that isL l C e l Q displaystyle mathbb L left lambda in mathbb C e lambda in overline mathbb Q right nbsp where C displaystyle mathbb C nbsp denotes the set of complex numbers and Q displaystyle overline mathbb Q nbsp denotes the algebraic numbers the algebraic closure of the rational numbers Q displaystyle mathbb Q nbsp Using this notation several results in transcendental number theory become much easier to state For example the Hermite Lindemann theorem becomes the statement that any nonzero element of L displaystyle mathbb L nbsp is transcendental In 1934 Alexander Gelfond and Theodor Schneider independently proved the Gelfond Schneider theorem This result is usually stated as if a displaystyle a nbsp is algebraic and not equal to 0 or 1 and if b displaystyle b nbsp is algebraic and irrational then a b displaystyle a b nbsp is transcendental The exponential function is multi valued for complex exponents and this applies to all of its values which in most cases constitute infinitely many numbers Equivalently though it says that if l 1 l 2 L displaystyle lambda 1 lambda 2 in mathbb L nbsp are linearly independent over the rational numbers then they are linearly independent over the algebraic numbers So if l 1 l 2 L displaystyle lambda 1 lambda 2 in mathbb L nbsp and l 2 displaystyle lambda 2 nbsp is not zero then the quotient l 1 l 2 displaystyle lambda 1 lambda 2 nbsp is either a rational number or transcendental It cannot be an algebraic irrational number like 2 displaystyle sqrt 2 nbsp Although proving this result of rational linear independence implies algebraic linear independence for two elements of L displaystyle mathbb L nbsp was sufficient for his and Schneider s result Gelfond felt that it was crucial to extend this result to arbitrarily many elements of L displaystyle mathbb L nbsp Indeed from Gel fond 1960 p 177 one may assume that the most pressing problem in the theory of transcendental numbers is the investigation of the measures of transcendence of finite sets of logarithms of algebraic numbers This problem was solved fourteen years later by Alan Baker and has since had numerous applications not only to transcendence theory but in algebraic number theory and the study of Diophantine equations as well Baker received the Fields medal in 1970 for both this work and his applications of it to Diophantine equations Statement editWith the above notation Baker s theorem is a nonhomogeneous generalization of the Gelfond Schneider theorem Specifically it states Baker s Theorem If l 1 l n L displaystyle lambda 1 ldots lambda n in mathbb L nbsp are linearly independent over the rational numbers then for any algebraic numbers b 0 b n displaystyle beta 0 ldots beta n nbsp not all zero we have b 0 b 1 l 1 b n l n gt H C displaystyle left beta 0 beta 1 lambda 1 cdots beta n lambda n right gt H C nbsp where H is the maximum of the heights of b i displaystyle beta i nbsp and C is an effectively computable number depending on n l i displaystyle lambda i nbsp and the maximum d of the degrees of b i displaystyle beta i nbsp If b0 is nonzero then the assumption that l i displaystyle lambda i nbsp are linearly independent can be dropped In particular this number is nonzero so 1 and l i displaystyle lambda i nbsp are linearly independent over the algebraic numbers Just as the Gelfond Schneider theorem is equivalent to the statement about the transcendence of numbers of the form ab so too Baker s theorem implies the transcendence of numbers of the form a 1 b 1 a n b n displaystyle a 1 b 1 cdots a n b n nbsp where the bi are all algebraic irrational and 1 b1 bn are linearly independent over the rationals and the ai are all algebraic and not 0 or 1 Baker 1977 also gave several versions with explicit constants For example if exp l j a j displaystyle exp lambda j alpha j nbsp has height at most A j 4 displaystyle A j geq 4 nbsp and all the numbers b j displaystyle beta j nbsp have height at most B 4 displaystyle B geq 4 nbsp then the linear form L b 0 b 1 l 1 b n l n displaystyle Lambda beta 0 beta 1 lambda 1 cdots beta n lambda n nbsp is either 0 or satisfies log L gt 16 n d 200 n W log W log log A n log B log W displaystyle log Lambda gt 16nd 200n Omega left log Omega log log A n right log B log Omega nbsp where W log A 1 log A 2 log A n displaystyle Omega log A 1 log A 2 cdots log A n nbsp and the field generated by a i displaystyle alpha i nbsp and b i displaystyle beta i nbsp over the rationals has degree at most d In the special case when b0 0 and all the b j displaystyle beta j nbsp are rational integers the rightmost term log W can be deleted An explicit result by Baker and Wustholz for a linear form L with integer coefficients yields a lower bound of the form log L gt C h a 1 h a 2 h a n log max b 1 b n displaystyle log Lambda gt Ch alpha 1 h alpha 2 cdots h alpha n log left max left beta 1 ldots beta n right right nbsp where C 18 n 1 n n 1 32 d n 2 log 2 n d displaystyle C 18 n 1 n n 1 32d n 2 log 2nd nbsp and d is the degree of the number field generated by the a i displaystyle alpha i nbsp Baker s method editBaker s proof of his theorem is an extension of the argument given by Gel fond 1960 chapter III section 4 The main ideas of the proof are illustrated by the proof of the following qualitative version of the theorem of Baker 1966 described by Serre 1971 If the numbers 2 p i log a 1 log a n displaystyle 2 pi i log a 1 ldots log a n nbsp are linearly independent over the rational numbers for nonzero algebraic numbers a 1 a n displaystyle a 1 ldots a n nbsp then they are linearly independent over the algebraic numbers The precise quantitative version of Baker s theory can be proved by replacing the conditions that things are zero by conditions that things are sufficiently small throughout the proof The main idea of Baker s proof is to construct an auxiliary function F z 1 z n 1 displaystyle Phi z 1 ldots z n 1 nbsp of several variables that vanishes to high order at many points of the form z 1 z n 1 l displaystyle z 1 cdots z n 1 l nbsp then repeatedly show that it vanishes to lower order at even more points of this form Finally the fact that it vanishes to order 1 at enough points of this form implies using Vandermonde determinants that there is a multiplicative relation between the numbers ai Construction of the auxiliary function edit Assume there is a relation b 1 log a 1 b n 1 log a n 1 log a n displaystyle beta 1 log alpha 1 cdots beta n 1 log alpha n 1 log alpha n nbsp for algebraic numbers a1 an b1 bn 1 The function F is of the form F z 1 z n 1 l 1 0 L l n 0 L p l 1 l n a 1 l 1 l n b 1 z 1 a n 1 l n 1 l n b n 1 z n 1 displaystyle Phi z 1 ldots z n 1 sum lambda 1 0 L cdots sum lambda n 0 L p lambda 1 ldots lambda n alpha 1 lambda 1 lambda n beta 1 z 1 cdots alpha n 1 lambda n 1 lambda n beta n 1 z n 1 nbsp The integer coefficients p are chosen so that they are not all zero and F and its derivatives of order at most some constant M vanish at z 1 z n 1 l displaystyle z 1 cdots z n 1 l nbsp for integers l displaystyle l nbsp with 0 l h displaystyle 0 leq l leq h nbsp for some constant h This is possible because these conditions are homogeneous linear equations in the coefficients p which have a non zero solution provided the number of unknown variables p is larger than the number of equations The linear relation between the logs of the a s is needed to cut down the number of linear equations that have to be satisfied Moreover using Siegel s lemma the sizes of the coefficients p can be chosen to be not too large The constants L h and M have to be carefully adjusted so that the next part of the proof works and are subject to some constraints which are roughly L must be somewhat smaller than M to make the argument about extra zeros below work A small power of h must be larger than L to make the final step of the proof work Ln must be larger than about Mn 1h in order that it is possible to solve for the coefficients p The constraints can be satisfied by taking h to be sufficiently large M to be some fixed power of h and L to be a slightly smaller power of h Baker took M to be about h2 and L to be about h2 1 2n The linear relation between the logarithms of the a s is used to reduce L slightly roughly speaking without it the condition Ln must be larger than about Mn 1h would become Ln must be larger than about Mnh which is incompatible with the condition that L is somewhat smaller than M Zeros of the auxiliary function edit The next step is to show that F vanishes to slightly smaller order at many more points of the form z 1 z n 1 l displaystyle z 1 cdots z n 1 l nbsp for integers l This idea was Baker s key innovation previous work on this problem involved trying to increase the number of derivatives that vanish while keeping the number of points fixed which does not seem to work in the multivariable case This is done by combining two ideas First one shows that the derivatives at these points are quite small by using the fact that many derivatives of F vanish at many nearby points Then one shows that derivatives of F at this point are given by algebraic integers times known constants If an algebraic integer has all its conjugates bounded by a known constant then it cannot be too small unless it is zero because the product of all conjugates of a nonzero algebraic integer is at least 1 in absolute value Combining these two ideas implies that F vanishes to slightly smaller order at many more points z 1 z n 1 l displaystyle z 1 cdots z n 1 l nbsp This part of the argument requires that F does not increase too rapidly the growth of F depends on the size of L so requires a bound on the size of L which turns out to be roughly that L must be somewhat smaller than M More precisely Baker showed that since F vanishes to order M at h consecutive integers it also vanishes to order M 2 at h1 1 8n consecutive integers 1 2 3 Repeating this argument J times shows that F vanishes to order M 2J at h1 J 8n points provided that h is sufficiently large and L is somewhat smaller than M 2J One then takes J large enough that h 1 J 8 n gt L 1 n displaystyle h 1 frac J 8n gt L 1 n nbsp J larger than about 16n will do if h2 gt L so that l 1 2 L 1 n F l l 0 displaystyle forall l in left 1 2 ldots L 1 n right qquad Phi l ldots l 0 nbsp Completion of the proof edit By definition F l l 0 displaystyle Phi l ldots l 0 nbsp can be written as l 1 0 L l n 0 L p l 1 l n a 1 l 1 l a n l n l 0 displaystyle sum lambda 1 0 L cdots sum lambda n 0 L p lambda 1 ldots lambda n alpha 1 lambda 1 l cdots alpha n lambda n l 0 nbsp Therefore as l varies we have a system of L 1 n homogeneous linear equations in the L 1 n unknowns which by assumption has a non zero solution which in turn implies the determinant of the matrix of coefficients must vanish However this matrix is a Vandermonde matrix and the formula for the determinant of such a matrix forces an equality between two of the values a 1 l 1 a n l n displaystyle alpha 1 lambda 1 cdots alpha n lambda n nbsp so a 1 a n displaystyle alpha 1 ldots alpha n nbsp are multiplicatively dependent Taking logs shows that 2 p i log a 1 log a n displaystyle 2 pi i log alpha 1 ldots log alpha n nbsp are linearly dependent over the rationals Extensions and generalizations edit Baker 1966 in fact gave a quantitative version of the theorem giving effective lower bounds for the linear form in logarithms This is done by a similar argument except statements about something being zero are replaced by statements giving a small upper bound for it and so on Baker 1967a showed how to eliminate the assumption about 2pi in the theorem This requires a modification of the final step of the proof One shows that many derivatives of the function ϕ z F z z displaystyle phi z Phi z ldots z nbsp vanish at z 0 by an argument similar to the one above But these equations for the first L 1 n derivatives again give a homogeneous set of linear equations for the coefficients p so the determinant is zero and is again a Vandermonde determinant this time for the numbers l1 log a1 ln log an So two of these expressions must be the same which shows that log a1 log an are linearly dependent over the rationals Baker 1967b gave an inhomogeneous version of the theorem showing that b 0 b 1 log a 1 b n log a n displaystyle beta 0 beta 1 log alpha 1 cdots beta n log alpha n nbsp is nonzero for nonzero algebraic numbers b0 bn a1 an and moreover giving an effective lower bound for it The proof is similar to the homogeneous case one can assume that b 0 b 1 log a 1 b n 1 log a n 1 log a n displaystyle beta 0 beta 1 log alpha 1 cdots beta n 1 log alpha n 1 log alpha n nbsp and one inserts an extra variable z0 into F as follows F z 0 z n 1 l 0 0 L l n 0 L p l 0 l n z 0 l 0 e l n b 0 z 0 a 1 l 1 l n b 1 z 1 a n 1 l n 1 l n b n 1 z n 1 displaystyle Phi z 0 ldots z n 1 sum lambda 0 0 L cdots sum lambda n 0 L p lambda 0 ldots lambda n z 0 lambda 0 e lambda n beta 0 z 0 alpha 1 lambda 1 lambda n beta 1 z 1 cdots alpha n 1 lambda n 1 lambda n beta n 1 z n 1 nbsp Corollaries editAs mentioned above the theorem includes numerous earlier transcendence results concerning the exponential function such as the Hermite Lindemann theorem and Gelfond Schneider theorem It is not quite as encompassing as the still unproven Schanuel s conjecture and does not imply the six exponentials theorem nor clearly the still open four exponentials conjecture The main reason Gelfond desired an extension of his result was not just for a slew of new transcendental numbers In 1935 he used the tools he had developed to prove the Gelfond Schneider theorem to derive a lower bound for the quantity b 1 l 1 b 2 l 2 displaystyle beta 1 lambda 1 beta 2 lambda 2 nbsp where b1 and b2 are algebraic and l1 and l2 are in L displaystyle mathbb L nbsp 2 Baker s proof gave lower bounds for quantities like the above but with arbitrarily many terms and he could use these bounds to develop effective means of tackling Diophantine equations and to solve Gauss class number problem Extensions editBaker s theorem grants us the linear independence over the algebraic numbers of logarithms of algebraic numbers This is weaker than proving their algebraic independence So far no progress has been made on this problem at all It has been conjectured 3 that if l1 ln are elements of L displaystyle mathbb L nbsp that are linearly independent over the rational numbers then they are algebraically independent too This is a special case of Schanuel s conjecture but so far it remains to be proved that there even exist two algebraic numbers whose logarithms are algebraically independent Indeed Baker s theorem rules out linear relations between logarithms of algebraic numbers unless there are trivial reasons for them the next most simple case that of ruling out homogeneous quadratic relations is the still open four exponentials conjecture Similarly extending the result to algebraic independence but in the p adic setting and using the p adic logarithm function remains an open problem It is known that proving algebraic independence of linearly independent p adic logarithms of algebraic p adic numbers would prove Leopoldt s conjecture on the p adic ranks of units of a number field See also editAnalytic subgroup theoremNotes edit See the final paragraph of Gel fond 1960 See Gel fond 1960 and Sprindzuk 1993 for details Waldschmidt 2000 conjecture 1 15 References editBaker Alan 1966 Linear forms in the logarithms of algebraic numbers I Mathematika 13 2 204 216 doi 10 1112 S0025579300003971 ISSN 0025 5793 MR 0220680 Baker Alan 1967a Linear forms in the logarithms of algebraic numbers II Mathematika 14 102 107 doi 10 1112 S0025579300008068 ISSN 0025 5793 MR 0220680 Baker Alan 1967b Linear forms in the logarithms of algebraic numbers III Mathematika 14 2 220 228 doi 10 1112 S0025579300003843 ISSN 0025 5793 MR 0220680 Baker Alan 1990 Transcendental number theory Cambridge Mathematical Library 2nd ed Cambridge University Press ISBN 978 0 521 39791 9 MR 0422171 Baker Alan 1977 The theory of linear forms in logarithms Transcendence theory advances and applications Proc Conf Univ Cambridge Cambridge 1976 Boston MA Academic Press pp 1 27 ISBN 978 0 12 074350 6 MR 0498417 Baker A Wustholz G 1993 Logarithmic forms and group varieties Journal fur die reine und angewandte Mathematik 1993 442 19 62 doi 10 1515 crll 1993 442 19 MR 1234835 S2CID 118335888 Baker Alan Wustholz G 2007 Logarithmic forms and Diophantine geometry New Mathematical Monographs vol 9 Cambridge University Press ISBN 978 0 521 88268 2 MR 2382891 Gel fond A O 1960 1952 Transcendental and algebraic numbers Dover Phoenix editions New York Dover Publications ISBN 978 0 486 49526 2 MR 0057921 Serre Jean Pierre 1971 1969 Travaux de Baker Expose 368 Seminaire Bourbaki Vol 1969 70 Exposes 364 381 Lecture Notes in Mathematics vol 180 Berlin New York Springer Verlag pp 73 86 Sprindzuk Vladimir G 1993 Classical Diophantine equations Lecture Notes in Mathematics vol 1559 Berlin New York Springer Verlag doi 10 1007 BFb0073786 ISBN 978 3 540 57359 3 MR 1288309 Waldschmidt Michel 2000 Diophantine approximation on linear algebraic groups Grundlehren der Mathematischen Wissenschaften vol 326 Berlin New York Springer Verlag doi 10 1007 978 3 662 11569 5 ISBN 978 3 540 66785 8 MR 1756786 Retrieved from https en wikipedia org w index php title Baker 27s theorem amp oldid 1198859530, wikipedia, wiki, book, books, library,

article

, read, download, free, free download, mp3, video, mp4, 3gp, jpg, jpeg, gif, png, picture, music, song, movie, book, game, games.