For homogeneous equations with integral coefficients , , Siegel lemma supplies a nonzero integral vector with
Map the integer box to the equation values. There are inputs, while each output coordinate lies in , so there are at most outputs. Since and , the input count is strictly larger. Two inputs have the same image; their nonzero difference solves every equation and has the stated norm bound. This proves the lemma by the pigeonhole proof of integer Siegel lemma.
Rational coefficients are handled by clearing denominators. For coefficients in a number field of degree , expansion in a rational basis gives at most rational equations; if the same argument gives an integer solution with the corresponding effective bound after clearing the basis denominators. The lemma concerns homogeneous equations; arbitrary inhomogeneous integer equations need not be soluble.
In Siegel's original convention, an E-function is an entire series with coefficients in a fixed number field, satisfying a nonzero linear differential equation over , together with these arithmetic bounds: for every , all conjugates of have size , and some positive integer makes every , , an algebraic integer. A frequently used stricter convention replaces both bounds by . The original and strict growth definitions should not simply be declared equivalent; the exponential examples below satisfy the strict one.
For sums, work in the compositum of the coefficient fields. Coefficient conjugate bounds add. The product of the two common denominators clears both lists; using in each original denominator bound gives the required product bound. Finally all derivatives of lie in the sum of the two finite-dimensional derivative spaces over that rational function field, so they satisfy a nontrivial linear dependence, giving a differential equation for the sum. Thus sums are again E-functions, the addition closure of Siegel E-functions.
The Siegel–Shidlovsky theorem states that if a vector of E-functions satisfies with rational-function matrix over , then at every nonzero algebraic which is not a pole of ,
In particular algebraically independent functions give algebraically independent values.
Take for algebraic numbers linearly independent over . Their coefficients are with exponential conjugate and denominator bounds, and . A polynomial relation among the functions expands into a relation among exponentials with distinct exponents and polynomial coefficients after clearing rational-function denominators; exponential-polynomial independence excludes it. At the theorem gives algebraic independence of the . For arbitrary distinct algebraic , choose a rational basis of their span and divide that basis by a common denominator. The are distinct Laurent monomials in the corresponding algebraically independent exponential values, so are linearly independent over . This recovers the general Lindemann–Weierstrass theorem. Its simplest instance uses just at nonzero algebraic .

Articles by others on the same topic (0)

There are currently no matching articles.