Functions whose differentials are linearly independent at the point in question. For this means the derivative has rank , so is a submersion there. The condition is open. It is distinct from global algebraic independence of functions.
Let be weighted homogeneous of modular weight , and suppose as a holomorphic function. Apply the modular group matrices . At a fixed point in the complex upper half-plane, this gives for every integer . A polynomial with infinitely many roots vanishes identically, so every . Within one modular weight, the monomials reduce to powers of , after taking out a common factor. This ratio is nonconstant, as its Fourier expansion begins , so its powers are linearly independent. This proves algebraic independence even when the generators are regarded as analytic functions rather than elements of a formal graded ring.
A standard form of the Schneider-Lang theorem is this. Let be meromorphic functions with for a fixed number field . Suppose have algebraic independence over and have finite growth orders . There are at most points at which all the functions are finite and all their values lie in .
Take and , of orders zero and one. Their derivatives belong to . They have algebraic independence: a polynomial relation is impossible by exponential-polynomial independence, or by letting real tend to infinity and considering the largest .
If nonzero algebraic had algebraic , put . At each of the distinct points , both and belong to . Infinitely many points contradict the theorem's finite bound. Therefore
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 .
Normalize the weight-four and weight-six Eisenstein series to have constant term one. Their Fourier expansions begin
Their absolutely convergent lattice sums transform by modular weights four and six under reindexing by the modular group, and their Fourier expansions prove holomorphy at its modular cusp. Thus they are elements of .
We use the valence formula for the modular group: for a nonzero weight- form,
The sum uses one point of each ordinary orbit. This is the argument principle on a truncated fundamental region: paired vertical integrals cancel, the circle pairing contributes the modular weight term, and local quotient coordinates at the two elliptic points of a modular curve modular weight their orders by . All orders are nonnegative for a holomorphic modular form.
Define the modular discriminant by
It is a weight-twelve cusp form. Its order at infinity is one, exhausting the valence total . Hence has no zeros in . Therefore every weight- cusp form is divisible by , with quotient holomorphic on and at the modular cusp:
Negative modular weights vanish by the valence formula, and odd modular weights vanish because acts by . Weight-zero forms are constant: they descend holomorphically to the compactified modular curve, and the maximum modulus principle applies. There are no weight-two forms: forces a zero at , whose valence contribution exceeds .
Every nonnegative even modular weight other than two is with . If , take ; if and , take . For , choose such a monomial , whose constant term is one. Subtracting the constant term of gives , so
Induction on modular weight, together with , proves that every modular form is a polynomial in .
For algebraic independence, first fix one modular weight . All solutions of have the same residue of modulo three and the same parity of . Consequently their monomials can be written
for suitable . On an open set where the common factor and are nonzero, a linear relation would give a polynomial relation in
This is nonconstant. By the open mapping theorem, a polynomial vanishing on all its values must be the zero polynomial. Thus same-weight monomials are linearly independent.
Different modular weights cannot cancel either. Suppose with each weighted homogeneous. Transform by . At any fixed this gives
The numbers are infinitely many distinct values, so the polynomial in that number vanishes identically, and every . The same-weight independence then sets every coefficient to zero. This is the graded weights separate analytic polynomial relations argument. Hence
with algebraically independent generators. Multiplying the two Eisenstein series by their nonzero lattice-normalization constants does not alter either generation or independence.
Let be the set of finite weakly decreasing sequences of positive integers, together with the empty sequence; equivalently pad them indefinitely with zeros. The size is , the length counts positive parts, and consists of size- integer partitions. Their Young diagrams have cells with .
Diagram containment is the partial order defined by for every . Componentwise minimum and maximum give its meet and join, so this is Young's lattice. Its covers add one cell. On the dominance order on partitions is
It is not diagram containment: distinct equal-size diagrams cannot contain one another. For the reverse lexicographic order on partitions, use the descending-dictionary convention: when the first unequal pair of parts has . Thus for size four its increasing list is . This is a total order opposite to increasing dictionary order on integer partitions, not the last-differing-exponent order on polynomial monomials.
Define the elementary symmetric functions and complete homogeneous symmetric functions by
For a partition, write and . The monomial symmetric function sums each monomial with exponent multiset once.
Here is a proof of the Fundamental theorem of symmetric polynomials sufficient for the stable algebra. In variables, the lexicographically largest monomial of a symmetric homogeneous polynomial has exponents . Otherwise exchanging an inverted pair of variables produces a larger monomial with the same coefficient. The polynomial
has that monomial as its largest one, with coefficient one. Subtract a suitable multiple and continue; there are only finitely many monomials of the fixed degree, so the procedure terminates and proves generation. Distinct products have distinct largest exponents . The largest such monomial in any nonzero polynomial relation cannot cancel, proving algebraic independence. Stabilizing in each degree, where only with no greater than that degree can occur, gives
The two generating functions satisfy
Since the freely generate, there is a unique algebra homomorphism with . Apply it to the last identity:
It follows that and . Hence the symmetric-function involution is an involutory automorphism, and
For the forgotten coefficients, it is useful to derive the required duality explicitly. Put . The logarithmic generating-function identities give
The transition a polynomial in lower-index 's is triangular and invertible over , so the are also free generators and is a basis. Define the Hall inner product of symmetric functions by
Expand the same formal kernel in two ways:
The last expansion is a reproducing kernel for this inner product. Comparing it with the expansion gives . One can see this without assuming any Schur orthogonality: pair either kernel with ; the reproducing property gives , and uniqueness of its expansion proves the duality. The signs in show that is an isometry; together with this makes it self-adjoint.
If and , define the forgotten symmetric function . Its monomial coefficient is consequently
It remains to compute this coefficient rather than merely invoke duality. Expand the formal inverse as a geometric series in :
In , choose a positive composition of each . A term is precisely when the concatenated list is a distinct rearrangement of the parts of . Its boundaries at the end of each chosen composition are exactly the prescribed prefix sums of . Conversely such a rearrangement uniquely determines the compositions by cutting at those prefix sums. Every one of its signs is , canceled by the prefactor in . Thus
Identical parts are not artificially distinguished. For example : only the order refines , while both orders refine the single block .
An integer version of Siegel lemma is as follows. For homogeneous linear equations , with integer matrix entries bounded in absolute value by , there is a nonzero integer solution satisfying
Put the displayed integer bound equal to and evaluate the equations at every vector in . There are inputs and at most outputs. But and , so the number of inputs is larger. Two distinct inputs have identical outputs; their difference proves the claim. This is the pigeonhole proof of integer Siegel lemma. Rational coefficients are handled by clearing denominators. Over a number field of degree , expanding in a rational basis gives at most rational equations, so the same construction applies when , with the height of the resulting integer matrix controlling the bound.
Siegel's original arithmetic definition starts with an entire series , with all in a fixed number field. For every there must be positive integers such that are algebraic integers, and both and the absolute values of every conjugate of are . The growth condition ensures convergence everywhere. The stronger, now customary strict E-function definition uses bounds for a fixed and also includes the requirement of a nonzero linear differential equation over . In the original formulation, that differential condition is explicitly part of the system hypothesis in the theorem below. These definitions should be distinguished; the exponentials used here satisfy even the stronger conditions.
The Siegel–Shidlovsky theorem states that if a vector of E-functions satisfies , with a matrix of rational functions over , then for every nonzero algebraic which is not a pole of ,
In particular, algebraic independence of the functions implies algebraic independence of the values. The exclusion of zero is necessary: their Taylor values there are algebraic.
Take rationally independent algebraic and . Their coefficients are , their conjugates grow exponentially, and powers of a fixed common denominator clear all coefficients through degree . They satisfy the nonsingular diagonal system .
To check functional independence, a polynomial relation among these exponentials, after clearing rational-function denominators, would be with distinct . Such an exponential polynomial cannot vanish identically. To isolate a nonzero term with exponent , apply . All other terms vanish, while the remaining polynomial is acted on by operators , each injective on polynomials because its nonzero constant preserves a nonzero leading coefficient. Thus the remaining term is nonzero, a contradiction.
The theorem at now makes algebraically independent. For arbitrary distinct algebraic exponents , choose a rational basis of their span and divide its elements by a common denominator so that every is an integer combination of the resulting . Then are distinct Laurent monomials in . A linear relation among them becomes a nonzero polynomial relation after multiplying by a common monomial, contradicting independence. These particular E-functions therefore yield the full Lindemann–Weierstrass theorem.
The coordinate ring is . The induced action is contragredient on functions:
It is a group action by degree-preserving algebra automorphisms, extending the dual action on linear polynomial functions. Its polynomial invariant ring is
For a monic polynomial , its polynomial discriminant is . This is symmetric in the roots, hence polynomial in the coefficients, and is zero exactly when a root is repeated.
For the alternating group action, let be the elementary symmetric polynomials and put . If is -invariant and is any transposition, decompose
Normality and index two of show that is symmetric and transforms by the sign character of . Any alternating polynomial vanishes when , so every divides it. These pairwise nonassociate prime factors have product , so with symmetric. The Fundamental theorem of symmetric polynomials yields
The sum is direct, since a polynomial that is both symmetric and alternating is zero in characteristic zero. Also , where is the discriminant polynomial of
Thus, more precisely than the requested quotient assertion,
Surjectivity follows from the direct-sum expression. Divide any putative kernel element by the monic quadratic in ; its remainder is . The direct sum forces , and algebraic independence of the gives . Hence the displayed relation is the entire kernel. The argument also covers , where is trivial.
Now let be finite with no nontrivial linear characters, and write , . The polynomial ring is a unique factorization domain. Factor a nonzero invariant in ; invariance permutes the associate classes of its irreducible factors and makes their exponents constant on each orbit. For an orbit , choose representatives and form its orbit product of polynomial factors
For every , for a nonzero scalar . Applying two group elements proves that is a homomorphism. The hypothesis forces , so .
This orbit product is prime in . If it divides with , one factor divides or in . Invariance of that chosen polynomial makes every factor in the orbit divide it. Their product therefore divides it in , and the quotient is invariant because numerator and denominator are invariant and cancellation is valid in the integral domain . Thus divides or in . Every nonzero is a scalar times a product of these prime orbit products, and the only units of are nonzero constants, as they are units in . Therefore is a unique factorization domain. This gives a direct proof, without assuming a divisor-class-group theorem.
For a failure in characteristic zero, let the cyclic group of order two act on by . Its coordinate invariants are
Every invariant monomial has even total degree: its exponents are either both even, or both odd, giving the indicated generators. Reducing powers of to at most one shows that is the only relation, since and map to distinct monomials. The three quadratic invariants are irreducible in : each nonconstant invariant has degree at least two, so a product of two nonunits has degree at least four. They are pairwise nonassociate, but
gives two different irreducible factorizations. Hence this invariant ring is not a unique factorization domain. The nontrivial sign character is precisely the kind of character excluded in the preceding theorem.
The Noether normalization lemma is valid over every field , including finite fields: a nonzero finitely generated algebra contains elements with algebraic independence over such that is finite as a module over the polynomial ring . We prove it without an infinite-field hypothesis.
Write and induct on . If the generators have algebraic independence, they already give a polynomial ring and the assertion is immediate. Otherwise choose a nonzero relation . Choose an integer larger than every exponent in the monomials of , and set
In , the largest power of has a nonzero coefficient in . Indeed, a monomial with exponents contributes top weight . These weights are distinct by uniqueness of base- expansion, so only one monomial contributes the highest power. After rescaling, the substituted relation is monic in .
Consequently is an integral element over , and is finite over . Apply the induction hypothesis to and compose the finite module extensions. This proves Noether normalization by weighted substitutions. The induction reaches , where . For an integral domain , taking fraction fields makes the resulting extension finite algebraic, so is the transcendence degree of . More generally : integral extensions preserve Krull dimension, and a polynomial algebra in variables has Krull dimension .
A useful bridge to the Hilbert Nullstellensatz is the Zariski lemma. If a field is a finitely generated algebra over , normalization makes it finite and integral over a polynomial ring . A subring over which a field is integral is a field: for nonzero , an integral equation for , multiplied by , expresses as an element of . Therefore must be a field. A polynomial ring in a positive number of variables is not a field, since a variable has no polynomial inverse. Hence and is a finite field extension. This proves the Zariski lemma.
Now let be an algebraically closed field. The Weak Hilbert Nullstellensatz says that every maximal ideal of is uniquely of the form
To prove it, the residue field is a field generated as a -algebra by the images of the variables. The Zariski lemma makes it finite algebraic over , and algebraic closedness makes it . Thus each has an image . The evaluation map has kernel the displayed ideal: subtracting the constant value of a polynomial expresses its difference as a combination of . That kernel is maximal and contained in , so equality holds. Conversely every evaluation kernel is maximal because its quotient is . Uniqueness follows from the variable images. Every proper ideal is contained in a maximal ideal, so it has a common zero; equivalently, an ideal with no common zero is the whole ring.
For an ideal , let be its common-zero set and let be all polynomials vanishing on that set. The Strong Hilbert Nullstellensatz states
The inclusion follows because a field has no nonzero nilpotent elements. For the other inclusion, take vanishing on , with , and form the Rabinowitsch trick ideal
It has no common zero: at a zero of the second generator has value one. The Weak Hilbert Nullstellensatz in variables gives . Hence a finite identity has the form , with . Substitute in the localization of a ring . Clearing the finitely many powers of occurring in denominators gives for some , so . The case is immediate. This completes all three proofs. The algebraically closed hypothesis belongs to the two forms of the Hilbert Nullstellensatz; it was not needed for the Noether normalization lemma or the Zariski lemma.
Let be a map of commutative rings. The Kähler differentials are generated as an -module by symbols , with relations
These relations make the universal -derivation. Every -derivation into an -module factors uniquely through the map . Thus the universal property of Kähler differentials is
This constructs the module and proves its universal property, rather than merely listing a formal derivative rule.
For the polynomial ring , the Kähler differentials of a polynomial algebra form the free module . The usual formal partial derivatives prove that assigning arbitrary images to defines a derivation, and every polynomial involves only finitely many variables. For , the Conormal exact sequence for Kähler differentials gives
The map is well-defined because vanishes after reduction modulo . Its cokernel has exactly the universal property of derivations on that kill , so is . In a finite polynomial presentation this gives
There need not be injectivity at : in characteristic , the relation has derivative zero.
Localization of Kähler differentials commutes with localization of a ring:
The quotient rule follows by differentiating . It extends every derivation uniquely and proves the isomorphism by the universal property. Likewise base change for Kähler differentials gives : a -linear derivation is determined by its values on , and the product rule extends those values to the tensor product.
For a tower , the Transitivity exact sequence for Kähler differentials is
Quotienting by the submodule generated by differentials of elements of represents precisely the -derivations, which proves exactness. The first map need not be injective in general. To relate this to a transcendence basis, we need the stronger property supplied by a separable field extension.
If is finite separable and has minimal polynomial , differentiating its equation forces
The denominator is nonzero by separability. Conversely this formula extends an arbitrary -derivation , for an -module , to ; it kills the relation and hence descends to . A tower of simple separable extensions proves unique extension for all finite separable . Therefore Kähler differentials under a separable field extension satisfy
This proves injectivity in this case, which would not follow from right exactness alone.
A transcendence basis for a finitely generated field extension has algebraic independence over and makes algebraic, hence finite. A separating transcendence basis additionally makes that finite extension separable. Apply the polynomial computation and the quotient rule to the rational function field , and then the separable-extension isomorphism. We obtain the central link:
when the basis is separating. The dual statement says that any prescribed values of the extend uniquely to a -derivation of with values in . In characteristic zero every transcendence basis of a finitely generated field extension is separating, so Kähler differentials measure transcendence degree exactly.
There is also a characteristic-zero test for algebraic independence. If are algebraically dependent, choose a nonzero polynomial relation of minimum total degree. Some formal partial derivative is nonzero in characteristic zero, and it cannot also vanish on the tuple, since it has smaller degree. Differentiation therefore gives a nontrivial linear relation among the . Conversely, an algebraically independent tuple extends to a transcendence basis, whose differentials form a basis as just proved. Thus differentials detect algebraic independence in characteristic zero: a finite tuple is algebraically independent exactly when its differentials are linearly independent. Its differentials form a basis of exactly when the tuple is a transcendence basis.
The separability qualification is essential in positive characteristic. For and with , the extension is purely inseparable of degree , with transcendence degree zero. The polynomial presentation yields , because the defining relation has derivative zero. Also, in , the tuple is a transcendence basis but , while is a basis of the one-dimensional differential module. A chosen arbitrary transcendence basis therefore need not give differential coordinates in characteristic .
Finally, the presentation makes the relation useful geometrically. For in characteristic zero,
After passage to the fraction field, it has dimension one, the transcendence degree of the curve. At the origin, tensoring with its residue field leaves both independent, so the differential fibre has dimension two. For a -rational point with maximal ideal , that fibre is the cotangent space of a local ring : write elements as their constant value plus an element of , and note that derivations into kill . This explains how Kähler differentials record both generic transcendental parameters and the extra tangent direction at a singular point.
In characteristic , let and , with having algebraic independence. The monomials , , form a -basis, so . Their independence follows by grouping polynomial monomials according to their exponents modulo , after clearing rational-function denominators.
Every has , so its minimal polynomial divides and . Thus this finite purely inseparable extension has no primitive element. It demonstrates why the separable field extension hypothesis cannot simply be removed.
Choose a very ample divisor . By the stronger form of Kodaira's lemma, for some effective divisor . The subsystem defines the embedding given by on . Ratios of its sections generate the function field . The map from the complete complete linear system of a divisor contains these ratios, so it induces the same function field and is birational onto its image.
The converse is true; smoothness is unnecessary. If gives a birational map, choose algebraically independent ratios among a generating set of its section ratios. For every , the sections
are linearly independent by algebraic independence. Therefore , giving condition (1) of part (iii). This is the birational linear system criterion for bigness.