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.
Write and distinguish the all-pairs Eisenstein series in this problem from its primitive version
Separating each nonzero integer pair into a positive integer multiple of a primitive pair gives
The factor two accounts for the two signs of a primitive pair. It must not be omitted in the Rankin–Selberg unfolding.
Because and are invariant, unfolding its integral against produces the strip , :
The integral of the product Fourier expansions is . The Gamma function integral then gives
These steps first follow by absolute convergence sufficiently far right. For , positive unfolding and modular cusp decay show the square-coefficient series converges for ; the Cauchy-Schwarz inequality gives the same absolute-convergence range for the mixed series.
Put and define
This is the zeta-completed Rankin-Selberg coefficient series. Equivalently, solving this formula for expresses the requested series directly in terms of the all-pairs Eisenstein integral.
The exponential decay of cusp forms at infinity dominates the polynomial growth in of the Eisenstein series and its parameter derivatives, locally uniformly away from its poles. Thus its stated continuation can be passed through the integral. The completed series is meromorphic on , with possible simple poles only at , and its functional equation is
Indeed corresponds to . If , both pole residues vanish and the completion is entire.
The normalization of the poles can also be made explicit. The constant term of the given Eisenstein series is
The second term has residue one at , since the pole of has residue ; the functional equation gives residue minus one at . Hence the residues of at and are respectively and , the Petersson inner product.
It is important to separate this completed statement from the raw . Inverting the completion gives meromorphic continuation of , but zeros of in the denominator can give additional possible poles unless canceled by the integral. Nor does itself satisfy the unweighted symmetry . At the two displayed completion poles, for a nontrivial modular cusp modular weight,
The latter is finite because the pole of cancels that of the integral at , using . In particular, taking gives a raw-series pole at and regularity at . The direct analogue of the stipulated two-pole Eisenstein properties is therefore the completed function , not the raw series with all completion factors suppressed.
Finally suppose the two -series have Euler products. With first coefficients normalized to one, their coefficients are multiplicative, so is multiplicative too. Therefore
initially in its absolute-convergence half-plane. For unnormalized forms multiply the product by and use normalized coefficients inside it.
For the usual degree-two Hecke products of Question 3, take roots with sum and product , and with sum and the same product. The prime-power recurrence gives and the analogous expression for . Multiplying and summing four geometric series proves the Euler factor of a coefficientwise product of Hecke eigenforms:
Repeated roots are handled by continuity, or directly by the recurrence. Multiplication by cancels the local numerators and yields the degree-four convolution product. This also explains why the zeta factor belongs in the natural analytic completion.
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 .
In variables, pad to length and set . Define the alternant
The last equality is the Vandermonde determinant with the indicated descending-exponent convention.
We use the Jacobi–Trudi identity proved above and give the determinant step explicitly. Let
Put . The generating-function identity
shows, by extracting the coefficient of , that
When is empty, is upper triangular with diagonal one, and the product matrix is . Thus . Taking determinants for general gives and proves the bialternant formula
The equality before division is polynomial. Consequently the quotient extends at coincident variables as the Schur polynomial.
For the Fourier minors, choose a square submatrix of size , with distinct row residues and column residues. Sort the columns into decreasing exponents in ; this changes a determinant only by sign. Put
Because the are distinct nonnegative integers, , and . Hence is a partition. With , transposition of the submatrix and the bialternant formula give
The are distinct, so the Vandermonde factor does not vanish.
To prove that the Schur factor cannot vanish, work in and reduce modulo . Since the prime cyclotomic polynomial is and ,
All reduce to one, and the Schur factor reduces to . We need its value, not an assumption that the specialization is nonzero. The Schur evaluation at all ones formula is
For completeness, substitute with distinct into the bialternant. In the exponential expansions, the first nonzero determinant coefficient uses exactly the distinct powers and has degree in . The determinant in the and the factorial factors are common to numerator and denominator. The remaining ratio is the Vandermonde product in divided by that in , giving the formula as . Its value is an integer because has integer tableau coefficients.
Every positive difference and is strictly less than . Thus each is a unit modulo , and the displayed product has nonzero residue. A zero Schur factor would have zero residue, a contradiction. This proves the prime Fourier matrix minor theorem:
Finally use the one-row shape , for which . Its numerator determinant has first-row exponents and subsequent exponents . Expanding along the first row gives cofactors equal, up to their signs, to the Vandermonde determinant in all variables except . Since
the cofactor sign cancels the indicated sign in the quotient. Therefore
This rational expression is first computed for pairwise distinct variables; its sum is the polynomial , giving the continuous polynomial extension when variables coincide.
For genuine degrees three and two, the resultant is the Sylvester matrix determinant
Equivalently, if are the roots of , counted with multiplicity, then . Thus means that the polynomials have no common root, or equivalently are coprime over . One can also see this from the matrix: its singularity gives a nonzero relation with , . If were coprime, would force , then , a contradiction. Conversely, a common factor supplies such a relation after dividing by that factor. When a leading coefficient is zero, use the resultant for the actual polynomial degrees rather than assuming the displayed fixed-degree criterion unchanged.
An algebraic addition theorem for a meromorphic function means a nonzero polynomial with
identically where the values are finite. A local relation extends meromorphically to the other regular arguments.
For a polynomial of positive degree , let be the roots of and the roots of . Form
Its coefficients are separately symmetric polynomials in the two sets of roots. The Fundamental theorem of symmetric polynomials and the fixed nonzero leading coefficient of show they are polynomials in . The expression is monic of degree in , so it is nonzero. If , , one factor vanishes at . This proves the addition relation, including at exceptional multiple-root values by polynomial identity. A constant polynomial instead has the relation .
For the elliptic case, let . A nonconstant elliptic function defines a finite morphism , so the function field of is a finite algebraic extension of . The elliptic function-field decomposition expresses it as , with
The Weierstrass addition formula makes translation algebraic:
Differentiating and using the cubic differential equation also makes rational in the four separate values. Therefore lies in a finite algebraic extension of . Its algebraic equation, after clearing denominators, is the required polynomial relation. This sketches why every elliptic function, not only , has an algebraic addition theorem. Constants are already covered.
For the final assertion, consider , an entire function. If is a period, then for every . The continuous exponent must be a constant integer multiple of ; its derivative forces . Hence its periods are exactly , making it a simply periodic function.
Suppose it had an algebraic addition theorem . There are only finitely many values for which is identically zero: a nonzero coefficient polynomial in already bounds this exceptional set. Choose a positive irrational with outside this set, and set . Specializing gives a nonzero polynomial and, with ,
All exponents with nonzero coefficients are distinct, by irrationality of . Divide by the exponential with largest real exponent and let ; its nonzero coefficient would have to tend to zero. This contradiction proves that simple periodicity does not imply an algebraic addition theorem. It is the simply periodic entire function without an algebraic addition theorem example.