A covering-surface formulation of the Ahlfors second fundamental theorem is as follows. For a regular finite bordered Riemann surface mapped holomorphically to a fixed metric bordered Riemann surface , let be the average sheet number and the pulled-back length of the relative boundary, namely the boundary mapped into the interior of . With the modern sign convention for the Euler characteristic,
where depends on and its metric, not on or the map. The associated area comparison is for each fixed regular target region . These formulations and the sign convention are explained in www.math.purdue.edu/~eremenko/dvi/ahl.pdf .
The island version of the Ahlfors second fundamental theorem for a disk source, which is the useful form here, says that for fixed Jordan domains with disjoint closures on the Riemann sphere,
Here counts simply connected islands of a meromorphic function over , once each without weighting by mapping degree, and
An island of a meromorphic function is a relatively compact inverse-image component mapped properly onto its target domain; components reaching the source boundary are not counted. The simply connected island estimate is recorded, for spherical disks, in Lemma 2 of pdfs.semanticscholar.org/d247/562607e237af7c8fc6e683b77be6b94829fa.pdf . Regular target regions give the same estimate with a region-dependent constant. General Jordan domains can be enclosed in slightly larger regular Jordan domains still having disjoint closures. A simple island over an enlarged domain restricts to one over the original domain, so it suffices to prove the conclusion for regular domains.
Suppose a nonconstant meromorphic function on the plane has no simple islands over five such domains. On every counted simply connected island its proper map has integer degree at least two. The area formula therefore gives
Together with area comparison and the Ahlfors second fundamental theorem, this yields
The area comparison can also be seen directly. The two-form on the target sphere has zero integral and a bounded one-form primitive. One construction solves its Poisson equation: the gradient of the spherical Green function has an integrable singularity, so convolution against the bounded density gives a bounded primitive. Pulling back and applying Stokes theorem, or smooth approximation at the domain boundary, bounds the integral by a constant times .
We now derive the needed length-area exhaustion of the complex plane. The Cauchy-Schwarz inequality on a circle gives
If for all sufficiently large , then and
Integration makes negative, which is impossible. Hence there are radii with . This contradicts and proves the Ahlfors five islands theorem: one of the five target domains has a bounded simply connected inverse-image component mapped biholomorphically onto it.
Four domains do not suffice. Take the Weierstrass elliptic function for the square lattice . The equation
shows the three distinct finite branch values ; the fourth is infinity, because all poles are double. Equivalently, the degree-two map from the elliptic torus to the Riemann sphere has these four branch values, with all their preimages of local degree two. Choose four small disjoint Jordan domains, each containing one of these four totally ramified Weierstrass values. A degree-one island of a meromorphic function over any one would contain a preimage of its central value of local degree one, contradicting total ramification. Thus provides four domains with no simple island.
The printed proximity integral is missing a factor . Denote that literal integral by and write . The correct Annular spherical Jensen formula, with the printed definitions of and , is
The following derivation proves this identity and also isolates the normalization issue.
For the chordal metric put and let . In a finite target coordinate,
For use . Differentiating away from the preimages of gives half the squared spherical derivative of a meromorphic function. At an -point of local degree , ; the second distributional derivatives give the Laplacian of is . Thus, including poles by changing spherical coordinates,
Because is off the image of , is smooth near that circle and is finite and independent of .
Apply Green's second identity to the harmonic weight on . On the outer boundary and ; on the inner boundary and . Hence
The distributional formula makes the left side , and , proving the corrected Annular spherical Jensen formula. Initially take an inner circle avoiding -points. Logarithmic singularities have continuous angular means, and a point on the inner circle has zero logarithmic counting weight, so continuity extends the identity to every .
There is no way to absorb the missing factor into a different constant . For the holomorphic function and , direct integration gives
The value of tends to as and to as . Therefore the literal printed identity has no constant , whereas the corrected identity has .
For the singularity criterion, define the nondecreasing normalized spherical area
Tonelli's theorem applied to the logarithmic weight gives . Averages of a nondecreasing function converge to its supremum: for fixed , . Thus the limit, not just the lower limit, exists in and equals
If has a removable singularity or pole at zero, it extends as a holomorphic map to the Riemann sphere; the pulled-back spherical density is smooth and bounded on the closed disk, hence its area is finite. Conversely an essential singularity gives, by the meromorphic version of the Great Picard theorem, infinitely many preimages of every spherical target with at most two exceptions in each punctured neighborhood. The area formula gives
The formula follows by applying change of variables on inverse-function neighborhoods away from the discrete critical points, then summing with multiplicity; the countable critical values have area zero. This proves the finite spherical area criterion for an isolated singularity and the requested equivalence between a finite lower limit and a removable singularity or pole.
Use the Nevanlinna proximity function and the Nevanlinna integrated counting function for poles, counting multiplicity. If the pole order at zero is , then
Boundedness of the Nevanlinna characteristic refers to , equivalently to a uniform bound on for any fixed . This avoids the harmless origin normalization when .
The Nevanlinna first main theorem states, for every fixed finite value and every nonconstant meromorphic function on the disk,
For , this is the definition of . The error is bounded independently of . Translation changes by , while Jensen's formula gives when near zero; these observations explain the first theorem.
The Nevanlinna second main theorem in the unit disc states that for distinct values on the Riemann sphere,
as outside an exceptional set satisfying . The truncated Nevanlinna counting function counts each distinct preimage once. The boundary-distance error cannot simply be suppressed: on the disk it need not be . The disk error and exceptional-set estimates follow from the logarithmic-derivative estimates in mathweb.tifr.res.in/Documents/Publications/Lectures/tifr17.pdf .
Suppose first that is bounded. Since , its poles satisfy the Blaschke condition, counting their orders: let in their integrated count and use . Let be their Blaschke product, including the origin factor if necessary. Then extends to a holomorphic function on the whole disk, and gives
Here the last bound follows from bounded and the uniform lower bound on .
The nonnegative subharmonic function has a finite harmonic majorant. Indeed its Poisson integrals on expanding disks dominate it by the maximum principle for subharmonic functions, increase with , and have . The Harnack inequality for harmonic functions bounds them on every compact subdisk, so their increasing limit is a finite harmonic function . Since the disk is simply connected, has a harmonic conjugate, giving a holomorphic function with . Consequently
This proves the constructive half of the quotient characterization of bounded characteristic.
Conversely, if with bounded holomorphic functions and , each pole of is a zero of of at least the same order. The elementary inequality and the Nevanlinna first main theorem give
Any cancellation at an origin zero contributes only a bounded multiple of on , which is included in this . The zero function is immediate; constant nonzero is handled directly. Thus bounded characteristic is exactly a quotient of two bounded analytic functions.
An unbounded example with bounded characteristic is
It is a ratio of the bounded holomorphic functions and . More explicitly, Jensen's formula gives the mean of as zero, so , although .
Finally, set . Pointwise . Jensen's inequality for the concave logarithm gives
There is no pole term because is holomorphic. Hence the stated integral bound implies bounded characteristic. This argument in fact works for every .
The modular group is acting on the complex upper half-plane by
Its central element acts trivially on points, so the effective group is . It is generated by and : the Euclidean algorithm reduces the bottom row of a matrix using these operations until it is a translation. The relations hold in the projective group.
A standard fundamental domain of the modular group is
To see that each orbit meets it, use . Choose a coprime integer pair minimizing the nonzero lattice modulus ; a modular matrix with that bottom row maximizes the imaginary part. Translate to the central strip. If the result had modulus below one, inversion would further increase its imaginary part, a contradiction. Interior representatives are unique: for a point in the interior, when . For use ; for use the strip and the strict unit-circle bound. Thus such a matrix lowers the imaginary part, which would contradict the same fact applied to its inverse if both representatives were in the interior. Matrices with are translations, and cannot move one interior strip point to another.
The vertical sides are identified by , and the circular halves by . The exceptional points with elliptic stabilizers of the modular group are represented by and , of projective stabilizer orders two and three. The rational boundary points together with infinity form one modular cusp orbit. In the hyperbolic metric the region has area .
A useful subgroup is the level-two principal congruence subgroup,
Reduction modulo two is onto , which has six elements and permutes the three nonzero vectors. Hence its kernel has index six, and the quotient is . In the projective action, is torsion-free. Indeed finite-order nonidentity modular elements have trace zero or ; matrices in have even trace, and trace zero is impossible because are odd while are even: with would imply . The subgroup has three modular cusp classes, represented by , each of width two. Parity of a primitive pair distinguishes these classes, and elementary level-two row operations reduce each class to its representative. Six translates of supply a fundamental region. Its compactified level-two modular curve is obtained by adjoining these three modular cusp points.
Invariant holomorphic functions arise naturally from theta constants. In the radian convention of Question 4, put , and define
Here . The theta-constant inversion and translation laws, obtained by Gaussian Poisson summation and by reindexing, interchange under with the common factor , leave fixed up to that factor, and under interchange while multiplying by . Together with the Jacobi abstruse identity , this gives
These transformations generate the six permutations of . In particular and fix ; with , these generate . Thus the modular lambda function is invariant under this subgroup, but not under the whole modular group. Its even theta constants do not vanish on , so it is holomorphic there and avoids . Near infinity, , with , which is the width-two modular cusp coordinate. The two transformation laws give modular cusp values one at zero and infinity at one, with the same simple local orders. Thus has exactly one simple pole on the compactified level-two quotient and no pole in the half-plane. A meromorphic map with one simple pole has degree one, so it identifies that quotient with the sphere and the open quotient with . This proves the coordinate assertion and describes all three modular cusps.
Symmetrizing this subgroup invariant produces a full modular-invariant function:
Substitution shows that this rational expression is unchanged by both and , hence by and . It is the Klein j-invariant. Its denominator does not vanish on , so it is holomorphic there; at the modular cusp it has , a simple pole in . It therefore remains nonconstant without being a bounded holomorphic function on the compactified quotient. In fact a holomorphic invariant extending holomorphically to the compactified modular curve would be constant by the maximum principle.
This also connects invariance to elliptic curves: changing an oriented basis of the lattice gives precisely the modular action after a rescaling. On the compact full modular quotient, has just the one simple modular cusp pole, so its map to the sphere has degree one. It therefore classifies the resulting homothety of complex lattices classes, while the modular lambda function retains a level-two labeling of the branch points in the Legendre model . Finally, a modular form of nonzero weight obeys a transformation law with a factor , not plain invariance; ratios of equal-weight forms instead give weight-zero modular functions. The distinction between forms, invariant holomorphic functions on the open half-plane, and their modular cusp behavior is essential to this construction.
For fixed , Gaussian decay of gives locally uniform convergence of the theta function series and all its -derivatives. It is therefore entire. Shifting the series argument and reindexing gives
Since , the corresponding second multiplier for has the opposite sign:
Thus obeys and . These give candidate period lattices; to show they are exact, first locate every zero.
At ,
because the terms with indices and cancel. The absolute convergence justifies that pairing. Quasi-periodicity propagates this zero to every .
For exhaustiveness and simplicity, let . It satisfies and . Take a fundamental parallelogram for , translated so its boundary has no zero. The two sloping edges cancel by the first identity; the bottom and reversed top give
The argument principle therefore counts one zero with multiplicity in every cell. Since a known zero class already exists, all zeros are simple and exactly
The denominator's simple zeros are instead . These two cosets are disjoint: cannot lie in because . Thus there are no cancelled zeros or poles in the quotient.
Any period of or must translate its zero set onto itself, so must belong to . A translation multiplies by ; the quotient is nonconstant, so an odd cannot be a period of . Squaring removes precisely that sign. This proves the period lattice of theta3 over theta4 and its squared counterpart:
The second lattice is for the squared function; no additional translation can preserve its zero set.
Take a real modulus and complementary modulus . The Jacobi elliptic sine is constructed by inverting a Schwarz-Christoffel mapping. The main reason for the Schwarz-Christoffel derivative is local angle behavior: if a prevertex corresponds to a polygon angle , straightening that corner gives . Hence has exponent . Along each straight boundary side its argument is constant. Dividing by removes those angle changes; Schwarz reflection extends the quotient across the real boundary and the corner singularities. With all vertices finite, its behavior at infinity is also regular, because the sum of the derivative exponents is . It is therefore a nonzero constant on the sphere. This yields
This argument explains the exponents, the branch choices and the role of boundary reflection, rather than just writing down the formula.
For a rectangle, four angles are , so choose prevertices and normalize the inverse map as
Use the branch positive on . Set
The two middle corner values are . The right side length is
as the substitution shows. The selected branch makes the increment along that side . Thus the other corner values are and . The two boundary intervals through infinity have combined horizontal length ; the substitution gives length from to infinity. In particular . As in the square mapping, the boundary goes once around a rectangle, and the argument principle gives a conformal bijection
Its inverse maps that rectangle onto the complex upper half-plane, and near zero has , . Differentiating the inverse relation gives
These identities continue meromorphically.
All four rectangle edges have real images, so Schwarz reflection extends across them. Reflection in the bottom edge gives . Reflection in the right edge, combined with the first reflection, gives . The even inverse-integral derivative gives , and hence
Reflection in the top edge and then the bottom gives . The resulting period lattice of the Jacobi elliptic sine is
To see the poles, use near the boundary point infinity. Then , so the inverse has a simple pole at with residue . The real half-period shift gives another pole at with opposite residue. Reflection tiles the plane with copies of the rectangle, so these are exactly two simple poles per displayed fundamental cell. They also show there is no additional period: a period must permute these two pole classes; exchanging them would shift by modulo the displayed lattice, which reverses the function's sign and residues rather than preserving it.
For any finite , integrate around a fundamental parallelogram avoiding its zeros and poles. The opposite edges cancel by periodicity, so the number of zeros of equals the number of poles, namely two. Therefore every value has two inverse images modulo periods, counted with multiplicity. The value infinity likewise has the two simple poles as preimages. Usually the finite-value preimages are distinct; the involution interchanges them. At , a critical point supplies one double inverse image instead. For example , , . Thus the printed “exactly two” requires the standard multiplicity convention; it would be false if interpreted as two distinct solutions at these branch values of a holomorphic map.
Now choose and put . Since , is even, elliptic for , and has degree two. The Weierstrass elliptic function for the same lattice is even and has one double pole per cell, hence also degree two. Its generic fibers are precisely . Consequently an even is constant on those fibers and descends to a meromorphic function of . At the four fixed classes of , the even local Laurent expansion makes this descent meromorphic in the squared local coordinate. A meromorphic function on the Riemann sphere is rational, so . Generic map degrees multiply:
Thus has degree one and the degree-two even elliptic function conclusion is
The determinant condition follows because is nonconstant. This proves the existence requested, with the explicit allowable shift .
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.
A skew Young diagram is connected when any two of its cells can be joined by a sequence of cells sharing edges; touching only at a corner does not connect them. A nonempty border strip, or rim hook, is a connected skew diagram containing no square. Its height is its number of occupied rows minus one.
For a weak composition , a border-strip tableau of shape and type is a chain
whose th difference is a border strip of size . Filling that strip with gives the equivalent weakly increasing row-and-column filling. A zero part corresponds to an empty difference and has height zero. Put . For positive , ; write . Thus zero type parts are ignored: one does not multiply by the finite-variable value .
We first prove the one-strip multiplication formula using alternants. Choose sufficiently large and let be the decreasing beta numbers of a partition. Expanding the determinant by permutations shows
Indeed, in each determinant monomial every variable occurs in exactly one row factor; multiplying that variable by its th power is equivalent to raising that row exponent.
A term vanishes if the new exponent equals another exponent. Otherwise suppose the changed exponent moves from position to position when restored to decreasing order. Its determinant sign is . The resulting partition has
and all other rows unchanged. The new diagram contains , and its size increases by . Between successive added rows, the overlap is exactly the single column . Thus the added cells form a connected strip without a square, of height . Conversely every added border strip has consecutive occupied rows and exactly this single-column overlap, forcing these formulas and the corresponding exponent shift. The correspondence is therefore bijective. Divide by the unchanged Vandermonde determinant and use the bialternant formula to get the power-sum border-strip multiplication identity
Apply this formula successively to each positive part of . Each sequence of choices is exactly a border-strip tableau, and its product of signs is . Therefore
Commutativity of the power sums also shows that the resulting coefficient does not depend on the order of the positive parts of the type.
Take empty and restrict to variables. Multiply by , with :
In an alternant , the exponents are distinct and their decreasing arrangement is . Consequently the monomial occurs only for , and in that determinant its coefficient is one. This proves the Frobenius alternant character formula
To identify these coefficients with symmetric-group characters, recall the Frobenius characteristic map
The representation-theoretic identification can be justified by Young's rule: the permutation character on ordered blocks of sizes is . Its characteristic is , because its fixed block decompositions allocate whole cycles to blocks, and the exponential generating series for those allocations is . On the symmetric-function side, Hall duality and Schur orthonormality give . Inverting the unitriangular Kostka matrix establishes the identification. Thus the coefficient of in is the irreducible character value on cycle type . We have supplied the border-strip computation rather than assuming the character rule.
Grouping border-strip chains by their first removal of a cycle length now yields the Murnaghan–Nakayama rule
One may choose the -cycle to be last in a strip-building chain because the power sums commute. The empty-shape value on the empty type is one, providing the recursion's initial condition.
For the staircase , use beta numbers including its padded zero row. Its beta set is
Removing a rim hook of length lowers one beta number by into an unoccupied nonnegative position, reversing the exponent-shift description above. For a positive even , this move either hits another occupied even position or goes below zero. Therefore there are no removable even-size border strips.
Under the Hall inner product of symmetric functions, the adjoint of multiplication by is : this follows on the power-sum basis from . Taking adjoints of the one-strip multiplication rule expresses this derivative on as the signed sum over removable size- strips. That sum is empty for even , so
The rational symmetric-function algebra is freely generated by the power sums, and its characteristic is zero. Vanishing of each of these derivatives therefore proves the staircase Schur functions use only odd power sums statement:
Finally, the cycle type of an -cycle has one strip of size . A straight diagram is a border strip exactly when its second row has length at most one: otherwise it contains the upper-left square; conversely the first row with a single-column tail is connected and contains none. These diagrams are exactly the hook partitions , of height . There is one strip filling in this case and none otherwise, giving
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.
A skew Young diagram is the difference of two nested Young diagrams. A semistandard Young tableau is a filling of precisely those cells by positive integers, weakly increasing along each occupied row and strictly increasing down each occupied column. It can be viewed as its filled diagram, or equivalently as a chain
where is a horizontal strip consisting of the cells labeled . Indeed, the weak row and strict column inequalities ensure that the cells labeled at most , together with , form a partition diagram, and equal labels cannot share a column. Conversely such a chain gives the tableau.
For a tableau , let count its entries , put , and define
There are finitely many tableaux for any fixed number of allowed letters, and the sum has total degree .
To prove symmetry directly, use a Bender-Knuth involution for each adjacent pair of letters . Pair any and that occur in the same column and leave them fixed; strictness makes them consecutive in that column. In a row the remaining unpaired entries have the form , between any fixed paired letters. Replace that block by . Rows stay weakly ordered. A free can be changed to without equaling the entry below, because such a below entry would have been paired with it; likewise changing a free to cannot equal the entry above. Other neighboring letters are outside , so strict columns are preserved. The paired cells remain the same, and repeating the operation restores each free block. The paired letters contribute equally to the two contents, while every free block exchanges its contributions. Thus the involution is a weight-preserving bijection after exchanging . Adjacent exchanges generate all finite variable permutations, proving
The skew Jacobi–Trudi identity gives a second proof, since its determinant entries are already symmetric.
Define the Kostka number to count straight-shape Semistandard Young tableaux with shape and content , meaning copies of label . Suppose such a tableau exists. Strict columns imply that an entry in row is at least . Therefore all entries from lie in the first rows, giving
Hence
For content , the copies of have nowhere to go except row one and fill it. The copies of then fill row two, and induction fills row with . This filling exists and is unique, so .
Symmetry identifies equal coefficients for each rearrangement of a content, hence
The monomial symmetric functions form a basis. In any total order extending dominance, this change-of-basis matrix is triangular with diagonal one. It is invertible in each degree, so
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 .
For a finite group action , Burnside's lemma states
Count pairs with in two ways. Counting first by gives the displayed sum. Counting first by gives . For an orbit , the orbit-stabilizer theorem gives , so each orbit contributes exactly . Division proves the formula.
Use colors , with variables , on the underlying finite set . The weight of a coloring is . It is constant on each coloring orbit. The pattern inventory is , one weight for each orbit, including its multiplicity when different orbits have the same content.
If is the number of length- cycles of on , define the cycle index
In the symmetric-function cycle-indicator convention, write for its substitution . A fixed coloring must be constant on every cycle of . Coloring one length- cycle therefore has weight sum , independently of other cycles. The weighted Burnside lemma, proved by exactly the same orbit-stabilizer double count with weights, yields
This defines both sides in the same alphabet; the raw cycle index in the independent variables is specialized before comparison. The identity holds for all finite and hence stably for arbitrarily many colors.
For the last assertion, the permutation character on satisfies . A pair is fixed in the diagonal action on exactly when both components are fixed. Therefore
The character is real, so its character inner product with itself and another application of Burnside's lemma give
This is the rank of a permutation action formula, and in fact does not require transitivity. If the action is transitive and , the diagonal is one orbit; rank two means exactly one further orbit on distinct ordered pairs, which is double transitivity.
For integer partitions , set . A semistandard Young tableau on it has weakly increasing rows, strictly increasing columns and positive integer entries. Its weight is ; their sum is the Skew Schur function . Define
The Jacobi–Trudi identity, including its skew form, is
where is any common padded length at least . Taking empty gives the ordinary Schur function formula.
For a proof, first use finitely many variables . A directed northeast path from to has one horizontal step for each unit of the horizontal displacement. Give such a step at height weight , and vertical steps weight one. The weakly increasing sequence of step heights shows that the sum of its weights is .
The determinant result needed is the nonintersecting lattice-path determinant: in an acyclic weighted network, the determinant of the single-path sums is the signed sum over vertex-disjoint path families, with sign the permutation of the paired endpoints. To prove it, expand the determinant and its products of path sums. An intersecting family has a first intersection in a fixed topological order. Choose the first two indexed paths there and swap their tails. Their total weight stays the same, their endpoint permutation changes by one transposition, and the operation is its own inverse. All intersecting families cancel. Only the disjoint families remain.
In this planar network the starting and finishing points occur in the same strict left-to-right order, so disjoint paths have identity endpoint pairing. For the path in row , associate its horizontal step from coordinate to with cell . Reading its height gives the tableau entry. Weak increase follows from northward movement; nonintersection with the path for the next row is exactly the strict column condition. Conversely a tableau constructs the paths, and the strict column inequalities keep them disjoint. This weight-preserving bijection proves the determinant formula. Arbitrary gives its stable symmetric function version.
The dual determinant will also be useful below. Allow steps or , assigning weight to a diagonal step reaching level . A single path uses distinct levels, so its sum is the elementary symmetric function , rather than . The same cancellation proof leaves tableaux with strict rows and weak columns. Transposing them gives
with and for .
Put . A squarefree weight in uses every label once, so it is counted by the number of standard skew Young tableaux. In one determinant product , the signed permutation gives . If any the product is zero; otherwise the squarefree coefficient is the number of ways to distribute the distinct labels into groups of sizes , namely . Coefficient extraction therefore gives the standard skew tableau determinant
Negative factorial arguments mean zero entries, and . The empty skew shape has count one, as this convention requires.

There are unlisted articles, also show them or only show them.