The preceding constructions lead to the Iwasawa theorem on local cyclotomic units. Its significance is that an explicitly calculated local unit quotient is governed by a p-adic L-function; class field theory then suggests that the same analytic object should govern global arithmetic. The latter prediction is the Iwasawa main conjecture, rather than a consequence of the local calculation alone.
Fix compatible roots of unity and put , . Let be the norm limit of the local principal units. Take its even part under complex conjugation to obtain , the local principal-unit limit in the real tower. Let be the closed subgroup generated by norm-compatible real cyclotomic units, with their finite-order residue factors removed. Write
Here the last map is augmentation. Normalize the p-adic zeta pseudomeasure by
The expression is well defined on for even . A pseudomeasure lies in the total fraction ring of the Iwasawa algebra; the pole on its trivial finite-character component is removed by the augmentation ideal, so . In this normalization the local theorem is
The following steps outline its proof and explain where the earlier questions enter.
First encode local units by Coleman power series. Evaluation at is surjective from to , and the product defining the Coleman norm operator gives
Thus norm-fixed series give norm-compatible sequences of local units. Conversely, lift from such a sequence to and take , where . This has . The estimates in Question 2 give . Consequently for fixed , the series differs from modulo and its value at is . The compactness of in the coarser of the topologies on integral formal power series supplies a convergent subsequence. Continuity of the Coleman norm operator and of evaluation shows that its limit is norm-fixed and takes every value . It is a unit because the original principal units have residue . Uniqueness follows from the Weierstrass preparation theorem: a nonzero series in has only finitely many zeros in the open unit disk, whereas the distinct give infinitely many interpolation points. This constructs the Coleman power series .
Next turn its multiplicative information into an integral p-adic measure. For a norm-fixed unit , use the Frobenius-corrected logarithm
The ratio belongs to by reduction modulo , and the logarithm divided by is integral because is odd. Equivalently , interpreting the constant coefficient with the p-adic logarithm on units. The averaging identity for the logarithm is understood on the open -adic unit disk, where the translated logarithmic series converge; the corrected result itself lies in . The logarithmic product formula and Question 1 give
Under the Amice transform, the root-of-unity average projects a p-adic measure onto its restriction to : the averaged factor survives exactly for . Consequently says that is supported on . This gives a Galois group-equivariant homomorphism from local principal units to the Iwasawa algebra of .
The integral lifting step in this proof is the Coleman unit-measure exact sequence
Here . The last map is surjective, since , and it has the cyclotomic action on its target. Its composition with is zero: implies . The kernel on the unit side consists of norm-compatible -power roots of unity. To see the shape of the kernel, write ; the equation becomes for , so only its linear term can survive. Integral solutions are , , after excluding finite residue factors by the principal unit condition. For the image, use the following explicit integral lifting of the corrected cyclotomic logarithm.
Take a p-adic measure on the units with first moment zero, and write for its Amice transform. Then and . Put and solve with . The constant equation is solved by . In degree one the terms involving cancel, and the remaining condition is , exactly ; choose any . For , after fixing the lower coefficients, the coefficient multiplying the unknown is
The other terms are divisible by : for the already integral truncated series, , while . Division therefore gives an integral , since and are units. Recursion constructs with . Now , and by Question 2. The p-adic logarithm is injective there, so . This supplies the desired Coleman power series of a norm-compatible sequence of local units. The freely chosen linear coefficient accounts precisely for the kernel . It proves the integral surjectivity step, including the integrality that rational inversion of would leave unproved.
Complex conjugation acts by on both copies of . As is odd, taking the even part is exact and removes both end terms. It follows that . The integral exact sequence is essential here: the support calculation alone would not prove this isomorphism.
It remains to calculate the image of the cyclotomic units. For , consider the symmetric cyclotomic unit series
The quotient has an invertible constant term , because both numerator and denominator have a simple zero at . The factor makes the expression unchanged under . The product over the roots of unity gives ; one may verify this first for integer prime to and then extend by continuity. Dividing by the norm-compatible Teichmuller representative makes the series correspond to principal units and does not change its logarithm. The generating function for the Bernoulli numbers, with , gives
The symmetric factor cancels the linear term. Applying , and then the moment formula of Question 3, yields
for even . These moments determine an even p-adic measure on the units: polynomials are dense by the Mahler theorem, even projection preserves density, and multiplication by is invertible on the units, so the positive even-degree polynomials are dense there as well. Thus
The closed ideal generated by all differences is . The closed subgroup generated by the corresponding cyclotomic units, including its Galois group translates, therefore has image exactly . Taking the quotient of the isomorphism proves the boxed local theorem.
Finally introduce global arithmetic. Let be the closure of norm-compatible global units in the real tower, let be its p-ramified Iwasawa module, and let be its unramified Iwasawa module. With compatible unit and splitting conventions, class field theory gives the class-field unit sequence; quotienting its unit terms by gives
In the cyclotomic tower the prime above is principal, so the unramified class-field convention also makes it split. On the torsion character components, multiplicativity of characteristic ideals implies
The local theorem has already calculated the first factor analytically. Equality of the global unit and class-group factors would therefore identify the characteristic ideal of with the same ideal of the p-adic L-function. That is the content predicted by the Iwasawa main conjecture. More explicitly, for a nontrivial even finite character , the character component of is the whole component and the prediction is
Here is the power-series algebra of the pro- part with coefficients in the character-value ring. The trivial component requires the augmentation correction for the zeta pole. Equivalently the characteristic ideals of and agree componentwise. A formulation using odd class-group characters must include the appropriate cyclotomic twist and inversion, as in Kummer reflection in Iwasawa theory. The motivation is an analytic formula for local units together with a global class-field exact sequence; the global equality is the additional arithmetic assertion.
The related class-number growth theorem illustrates why passage to an Iwasawa module is powerful. For the cyclotomic -extension, let be the -part of the class number at level . The unramified Iwasawa torsion theorem, the Iwasawa module structure theorem and the class-group control relations give, for sufficiently large ,
Here are the Iwasawa invariants. To see the two growth terms, use a topological generator and, after a fixed sufficiently high level , the norm polynomial . An elementary summand contributes to the length of its quotient by this polynomial. A summand associated with a distinguished polynomial of degree contributes plus a constant: at each root the valuation of the norm polynomial is plus a fixed constant for large . If is a root of unity already killed at level , its value is instead exactly and gives the same linear contribution. The finite errors in the structure and control maps stabilize and contribute to . Thus module structure explains growth, while the Iwasawa main conjecture goes further by identifying the characteristic series of an Iwasawa module themselves with analytic ones.
For a profinite abelian group , its Iwasawa algebra is the completed group algebra
where runs over open subgroups. The transition map sums the coefficients over the fibers of when . Consequently an element gives compatible values on cosets, equivalently a finitely additive -valued p-adic measure on the clopen sets of . Conversely these values specify every finite-quotient coefficient. Integration of a continuous function with values in is obtained by uniform approximation by locally constant functions; the integrals converge because all measure values have -adic absolute value at most . Multiplication in the Iwasawa algebra becomes convolution of p-adic measures. This is its measure realization of an Iwasawa algebra.
The Mahler theorem states that each continuous function has the unique expansion converging in the sense of uniform convergence
Its Mahler coefficients are
and . The same assertion holds for continuous functions with values in with coefficients in .
Given , define the bounded linear functional
The sum converges because and . Its values on indicator functions of clopen sets give a p-adic measure, denoted , with
Conversely, a p-adic measure determines these coefficients , and continuity allows termwise integration of every Mahler expansion. Thus the inverse is
which is the Amice transform. These two constructions are inverse, proving the canonical bijection . In fact it is an isomorphism of rings: the identity identifies convolution of p-adic measures with multiplication of formal power series. For example, and , where is the Dirac measure at .
For the moment identity, let denote a Stirling number of the second kind. The finite polynomial identity
gives . On the other hand, satisfies for every nonnegative integer . Expanding and evaluating at yields
Comparison in the basis of binomial polynomials gives . Terms with have zero constant term after at most differentiations, so no infinite-series interchange is needed. Therefore
The case says that the total mass is .
Let be the matrix of multiplication by in the basis from Question 1. Define the Coleman norm operator by the norm for a finite free ring extension:
The entries lie in , and is an isomorphism, so this determines uniquely. If is a unit, is invertible and its determinant is a unit. Also , giving . Splitting the conjugates, or diagonalizing multiplication after adjoining the roots of unity and inverting , gives the equivalent formula
In particular, this definition has the required target , rather than merely a ring with extra roots of unity in its coefficients.
For the requested ring congruence, observe that the reduction of is the injective map . If , its reduction first gives . Then ; repeat to obtain . Applying this to proves
This congruence reflection for Frobenius substitution is valid for all , without assuming is a unit.
A further property needed for the fixed points is Coleman norm contraction. If with , expand the determinant:
Here is the coefficient of degree in . The trace formula from Question 1 makes the linear term divisible by ; every later term is divisible by and . Reflecting the resulting ring congruence through gives
If and , iteration gives for every . Since , .
To identify all fixed points, we also need for every unit . In characteristic , the extension has degree and its norm for a finite free ring extension is . Indeed, after passing to fraction fields it is a purely inseparable field extension of degree , so multiplication has only the eigenvalue , with multiplicity , after splitting. Its determinant is . Therefore
and congruence reflection for Frobenius substitution gives .
Now choose any lift of a given and put . Multiplicativity gives
Thus is a Cauchy sequence for the finer of the topologies on integral formal power series and converges to a unit reducing to . The Coleman norm operator is continuous: multiplication matrices and their determinants are continuous, and the finite-free coordinate decomposition and its inverse preserve the -adic filtration defining the finer of the topologies on integral formal power series. Hence . If two fixed units reduce to , their quotient is fixed and belongs to , so it is by the preceding argument. This proves uniqueness, independence of the initial lift, and multiplicativity of the Coleman norm-fixed lift. In particular,
Every unit consequently has a unique factorization with , giving the canonical Coleman decomposition of power-series units:
The final assertion as printed is false. The original PDF identifies a ring with a product of unit groups. With multiplication, has a zero and is not a group. With addition, it has exponent , whereas has a nonidentity element of order : because is odd and . Thus neither interpretation makes the printed assertion true. The two boxed isomorphisms above are the valid natural conclusions; they do not require guessing which symbols the author intended to replace.
Put and , so that . The essential integrality statement for the Frobenius substitution on cyclotomic power series is the decomposition into a finite free module:
To prove it, reduce modulo . Since , grouping the coefficients of a formal power series according to their exponents modulo gives the unique expression . The change from to is a triangular matrix with diagonal entries , so this is also a basis over . Lift these coefficient series to , subtract their contribution from , divide the remaining error by , and repeat. The sums of the successive lifts converge in the finer of the topologies on integral formal power series, because is complete in that topology. This proves existence of the decomposition over . A relation among its summands reduces to the zero relation modulo , forcing each coefficient series to be divisible by . Repetition forces divisibility by every power of , hence every coefficient series is zero. This proves uniqueness and, in particular, injectivity of .
For , define
This is a -linear map. To calculate the average over roots of unity, work over . The substitutions are legitimate: their constant terms are topologically nilpotent, so the defining coefficient sums converge in . Since , each is unchanged by the substitution. The sums of the powers of the roots of unity are for and zero for . Consequently
Thus the average is integral and belongs to , and the constructed Coleman trace operator has the required property. Injectivity of forces uniqueness of any map satisfying that property. Finally, the decomposition of has and all other coefficients zero, giving .
We will also use the trace of multiplication by on this finite free module. After extending scalars to split the conjugates, that trace is the sum just computed. Hence
Choose , pad the partition of an integer with zeros, and define its beta numbers by
They form a strictly decreasing set of nonnegative integers. Conversely, from its decreasing enumeration recover . With these are exactly the first-column hook lengths, since . Padding changes the numbers: increasing by one replaces by , and leaves the represented partition of an integer unchanged.
Arrange positions on runners, putting position on runner at height . A bead occupies each position in the beta set. This is the abacus of a partition. The hook criterion in a beta set says that a bead and a gap correspond to a hook of length ; replacing by removes the corresponding rim hook. In particular removing a rim -hook moves a bead from to the vacant position immediately above it on the same runner. Its leg length counts the beads in the intervening positions of the full linear numbering.
For an explicit example, take , , and . Its beta set is . Runner zero has beads at , runner one has a bead at , and runner two is empty. Packing upwards gives , which represents ; thus the three-core is and the weight is two.
Every bead slide reduces the sum of occupied positions, so repeated slides terminate. The number of beads on each runner is unchanged. At termination they must occupy exactly
on runner , since any gap above a bead would allow a further slide. Hence the final beta set is uniquely determined by the initial runner counts, independently of the order of hook removals. Increasing the number of beads by replaces by , adds one bead to each runner, and gives exactly the same represented core after packing. General changes in padding follow by applying ; packing commutes with this operation up to the cyclic relabelling of runners. Therefore the result is independent of both removal order and padding:
The weight of a partition is .
A block of a group algebra is an indecomposable two-sided summand , where is a primitive central idempotent. The identity decomposes into pairwise orthogonal such idempotents; a module belongs to a block when its idempotent acts as identity and the other block idempotents act as zero. For ordinary characters, use a splitting p-modular system , or extend the residue field first: the block idempotents lift to , and determine which ordinary irreducible -modules lie in each -block. The symmetric group is split over its prime field, so extending introduces no change to the resulting partition of an integer labels.
The Nakayama block theorem, traditionally called the Nakayama Conjecture for symmetric groups, is
The simple modules in that block are exactly the with regular labels having that core. At fixed , the common core also fixes the weight. Here is an essay proof route through central characters, specifying the main algebraic and combinatorial steps and why each is needed.
First introduce the commuting Young–Jucys–Murphy elements
Their commutators vanish because contributions supported on each triple of letters cancel. Symmetric polynomials in the are central: for adjacent transpositions , the relations , show that commutes with symmetric expressions in , and it commutes with the other . Since these transpositions generate , the symmetric expressions commute with the whole group algebra.
The substantial generation ingredient is the integral Jucys–Murphy description of the center of a symmetric-group algebra: every conjugacy-class sum is an integral symmetric polynomial in the . Its proof expands symmetric monomials in these sums of transpositions and organizes the resulting class sums by the number of moved letters and cycle filtration; triangular elimination supplies integral spanning, rather than merely rational spanning. A useful first identity in this construction is
Indeed, when adjoining the letter , either choose and leave it as a singleton cycle, or choose a transposition and insert it into the cycle containing ; this gives every permutation uniquely. The full generation step distinguishes the individual class sums which this first identity groups together. Its integrality is essential: a description only over could use denominators divisible by and would not prove generation of the modular center. Since class sums form the integral basis of the center, this integral theorem reduces to the same generation statement over .
Next determine their scalar action. In the characteristic-zero tableau basis of , is diagonal with entry the Content of a Young-diagram cell occupied by , namely column minus row. This follows recursively along the multiplicity-free branching chain: the commuting operators preserve each path line, and determines the successive eigenvalues. Consequently a symmetric polynomial acts on by
This is independent of the ordering of the cells. The scalar identity holds on the integral Specht lattice, so after modular reduction it depends only on the multiset of contents modulo . Every composition factor has this same central character of a block.
Two simple modules are in the same block exactly when their central characters agree. The center of a block is a commutative local finite-dimensional algebra; its semisimple quotient gives one scalar character, while the orthogonal block idempotents separate different blocks. By the generation theorem, equality on all symmetric polynomials in the is enough. Conversely, different residue multisets are detected by elementary symmetric polynomials: the monic polynomial over recovers the multiplicity of each residue by unique factorization, including multiplicities larger than . Thus block equivalence is exactly equality of the integers
This gives the residue-content criterion for symmetric-group blocks without assuming that the sum of contents alone distinguishes blocks.
Finally identify residue content with the core. A removable rim -hook has consecutive contents modulo , hence removes one cell of each residue. Therefore shapes with the same core and the same size have the same residue counts. For the converse choose divisible by and at least , and write for the runner charges. Starting from the empty partition of an integer gives . Adding a cell of residue moves a beta-number bead from residue to residue , increasing and decreasing . The same changes occur in when increases by one. Induction on the cells therefore gives
Equal residue counts give equal charges and hence equal packed runner configurations, so they give the same core. This completes both directions of the block criterion. The argument exposes the three essential bridges: integral center generation, its scalar content evaluation, and the abacus identification of residue data with a unique core.
A rim hook is a connected skew diagram containing no square, whose removal leaves a partition of an integer diagram. Its leg length is its number of occupied rows minus one. The Murnaghan–Nakayama rule states that, if a permutation has cycle type , then
Iteration removes one hook for each cycle length; the empty diagram has character one at the empty cycle type.
For shape and cycle type , there are exactly two removable four-cell rim hooks. The remaining shapes are and ; the removed hooks have leg lengths one and two respectively. In shape the only removable three-cell rim hook leaves and has leg length one. In shape the only such hook leaves and again has leg length one. Since the characters of and at a transposition are and , we obtain
and hence
The cycle lengths can be taken in any order; using makes the two branches of the computation explicit.
Now consider the ordinary induction product . A hook partition is , equivalently a partition of an integer whose second row has length at most one. If a hook shape occurs in the Littlewood–Richardson rule, then , forcing itself to be a hook. In the skew hook , the new cells consist of a segment in the first row and a segment down the first column, with no shared column between those two segments. Every first-row entry must be : its rightmost entry is the first letter of the lattice word, hence is , and weak row increase forces all entries to its left to be too. The column segment has strictly increasing entries. Thus only can be repeated, forcing the content to be a hook as well. This also proves the assertion when the top segment is empty, since then every entry lies in a strictly increasing column.
Write the two nonempty hook factors as and , with and . Let the prospective resulting hook have top-row length and leg length . Its new top segment has cells and its new column segment has cells. The content consists of ones and the single letters . All those larger letters must be in the new column; its strict increase allows either no or exactly one . There are therefore only two possibilities:
In the first case fill the top segment with ones and the column with . In the second, use top ones and column . Each filling is unique and has a lattice word, including the case with an empty top segment in the second filling. This proves
Both displayed multiplicities are one.
To deduce the full-cycle value from this product result, rather than quote the Murnaghan–Nakayama rule again, form the virtual character
For every proper Young subgroup and every pair of its irreducible characters, the hook-product calculation gives
If a factor is not a hook there are no hook constituents; if both are hooks, their two consecutive leg lengths cancel in this alternating inner product. By Frobenius reciprocity and the completeness of the product irreducible characters, restricts to zero on every such subgroup. Any permutation with more than one cycle preserves a nonempty proper subset and is conjugate into one of these subgroups. Thus is supported only on the class of -cycles.
Its inner product with the trivial character is one, since only the one-row hook contributes. That class has size , so , giving . For any irreducible character, the support calculation then yields
By character orthogonality, the left side is for and zero otherwise. These are real integers, proving
For the same conclusion holds directly. This derives the requested special case from the Littlewood–Richardson rule and Frobenius reciprocity.
The kernel intersection theorem for Specht modules uses maps that move entries between adjacent rows. For and , let replace the row lengths by , keeping every other length unchanged. This is allowed to be a composition rather than a decreasing partition of an integer, and a zero row can be omitted. For a tabloid with row sets , define
by summing over all -subsets : the new row is , the new row is , and all other rows are unchanged. These are module homomorphisms, since relabelling commutes with choosing subsets. The theorem is
It holds over every field. Column cancellation shows the inclusion of in each kernel; the full theorem identifies the common kernel with the Specht module.
For completeness, the semistandard homomorphism theorem concerns a partition of an integer , a composition , and fillings of shape with occurrences of . Such a filling gives : replace its labels by the numbered entries of an input tableau, and sum the output tabloids over distinct permutations of the labels within each input row. Label assigns an entry to output row . The use of distinct assignments avoids dividing by any factorial. Let be its restriction to . The restrictions indexed by Semistandard Young tableaux are linearly independent. They form a basis of when , or when is two-regular. In characteristic two for a two-singular shape they need not span; omitting this exception would make the statement incorrect.
We now prove the invariant vector criterion for a Specht module directly from the first theorem. The group acts transitively on the tabloid basis of , so any invariant vector has all coefficients equal. Thus , where is the sum of all its tabloids and is nonzero over every field. Fix , write , , and count preimages of one output tabloid. The retained entries are prescribed; among the entries of the enlarged row, exactly must have come from its old row. Hence
The common-kernel criterion becomes
for every adjacent pair, where .
Suppose , and let be least with . If , its lowest base- digits are all . For any , adding to creates a carry at the lowest nonzero digit of . At that position the digit of is smaller than the corresponding digit of . Lucas's theorem therefore gives . Conversely, if one of the first digits is not , take . Minimality of gives , while addition at that digit creates no carry. Lucas then yields
This proves the claimed equivalence, and therefore
The invariant space, when present, is one-dimensional. At the last row put ; then and the condition is vacuous. This congruence formulation is for positive characteristic. In characteristic zero the positive binomial coefficients cannot vanish, so an invariant vector exists precisely for the one-row shape .
Finally suppose is regular. It has a unique simple head , by Question 1. The given sign-twisted duality of Specht modules implies
Thus is sign exactly when the conjugate shape satisfies the invariant congruences.
Here is an explicit solution of those congruences under regularity. Write the positive column heights of as , so . Regularity says , including , because this difference counts rows of length . Starting with , the congruence for its preceding row forces . Since , the only possibility is . Repeating upwards forces every earlier height to be . Consequently
where a zero final part is omitted. Conversely this shape satisfies every invariant congruence, so its conjugate is the desired regular label of the modular sign representation:
Zero parts are omitted. For this is , as it should be because sign is trivial. In characteristic zero the answer is .
For a Young diagram , a Removable node of a Young diagram is a cell whose deletion leaves a partition of an integer diagram; equivalently it is the last cell of row with . Let denote the distinct shapes obtained by deleting one such cell. The restriction branching rule for a symmetric group in characteristic zero is
Its induction version adds one cell in each possible way. Over an arbitrary field, restriction instead has a Specht filtration with these successive quotients, each once; it need not split.
To prove restriction, list the removable nodes from top to bottom. By the standard polytabloid basis, a basis of consists of with standard. Its entry is necessarily at a removable node. Let be the span of the basis vectors having at one of the first listed nodes, and put . These are -invariant. To verify this, apply a permutation of and straighten the resulting polytabloid by column antisymmetry and Garnir relations. A relation not involving the column containing leaves its row unchanged. In straightening a row descent, cannot be in the top segment of the right column: such a descent would require a left entry larger than . When belongs to the bottom segment of the left column, moving it to the shorter right column can only raise its row. In a relation involving that column, the terms which alter the position of place it in a higher row; the remaining terms have it at its old node. Thus straightening never moves it past the current top-to-bottom cutoff.
On send the class of , with at the th node, to the polytabloid obtained by deleting that node. The same straightening calculation proves equivariance: relations not moving are exactly the relations in the smaller diagram, and terms moving upwards vanish in the quotient. Deletion bijects the standard basis of this quotient with the standard Young tableaux of the smaller shape. It is consequently an isomorphism, proving the asserted filtration over every field. In characteristic zero, Maschke's theorem splits the filtration and gives the direct sum. Finally Frobenius reciprocity gives the induction rule, since a constituent has multiplicity one exactly when .
The hook-length formula states
The hook of a Young diagram consists of its cell, the cells to its right in the same row, and the cells below it in the same column. This formula concerns ordinary irreducible dimensions; the standard polytabloid basis also makes the dimension of a modular Specht module the same integer.
All transpositions are conjugate, have order two, and generate . In a one-dimensional ordinary representation their common scalar is therefore either or . These choices give precisely the trivial representation and the sign representation . At they coincide. The standard shape has dimension : its standard Young tableau is specified by choosing the bottom entry from . Conjugating the shape preserves the dimension, so has the same degree.
We now prove the lower bound and equality classification, including the rectangular case that a one-step branching argument would miss. Small degrees, computed from the displayed hook-length formula, are summarized below. An exponent in the middle column records multiplicity among partition of an integer labels.
Complete multiset of irreducible degreesLeast degree of a shape other than the linear and standard shapes
No other shape
at
at
For example, at the conjugate pairs , , , , have degrees , and the remaining shape has degree . These checks also identify every small equality case.
Induct on , assuming the lower bound for all smaller degrees. If a non-linear, nonstandard shape has at least two removable nodes, none of its predecessors is a single row or single column: adding one cell to a row or column could produce only a linear or standard shape. Hence two predecessors each have degree at least , and branching gives . If it has only one removable node, it is a rectangle with . Its sole predecessor is , which has two removable nodes. Both ensuing shapes of size are non-linear; a linear shape after these two deletions could occur only in the excluded rectangle. Therefore two-step branching gives . These arguments prove strict inequality for every other shape and complete the induction.
Consequently the least non-linear ordinary degree of a symmetric group is
For degree , the only labels are the two standard conjugate shapes, except that at there are also and , both degree five. At the exceptional lower degree is two, while the degree-three labels remain . There is a necessary endpoint qualification to the printed lower-bound claim: has only its two one-dimensional representations, so it has no degree exceeding one. At the listed degree- shapes are exactly its two linear shapes; at the two standard conjugate labels coincide.
Use for the ordinary irreducible character of . Multiplication of different degrees is the product in the induction ring of symmetric-group characters: it induces an external tensor product of group representations. For , the skew Young diagram is the set of cells of outside . A filling of it is a semistandard Young tableau when entries weakly increase along rows and strictly increase down columns. Its content means that occurs times. Its reading word takes each row right to left and the rows top to bottom. A lattice word has, in every initial segment, at least as many 's as 's for every .
The Littlewood–Richardson rule says
where the Littlewood–Richardson coefficient counts such skew semistandard fillings with content and lattice reading word. If is not contained in , the coefficient is zero. Over characteristic zero this is an actual direct-sum multiplicity statement; over other fields the analogous statement describes a Specht filtration, not necessarily a decomposition into simple modules.
For the required coefficient, the five skew cells are
Their columns are all distinct. Content uses three 's and two 's. The first reading letter must be by the lattice word condition, and row monotonicity forces both top cells to be . The remaining three cells, in reading order, can then be filled by , , or . The resulting words , , all satisfy the lattice inequalities, and exhaust the possibilities. Thus
For the determinantal form of a symmetric-group character, set in degree zero and for . The one-row character is trivial. The one-row specialization of the Littlewood–Richardson rule is the Pieri rule: multiplication by adds a horizontal strip of cells, since all entries are and no column can contain two of them.
Here is an explicit determinant argument, so that the desired form is genuinely deduced. Under the Frobenius characteristic map, corresponds to the complete homogeneous symmetric polynomial , whose monomials enumerate weakly increasing sequences of entries. Fix variables and rows. Let a directed lattice path run right or up from to , and assign weight to a horizontal step at height and weight one to a vertical step. The sum of its weights is . Expanding the determinant of this path matrix sums signed families connecting the sources to a permutation of the destinations.
Cancel intersecting families as follows. Choose the first intersection in a fixed order of vertices, and then the first pair of paths meeting there. Exchange their tails after that vertex. The total weight is unchanged, while the endpoint permutation changes by a transposition, reversing the sign. Choosing the intersection in this fixed order makes the operation an involution. The surviving families are nonintersecting; the ordered sources and ordered destinations force the identity endpoint pairing. Record the heights of the horizontal steps of path as row of a tableau. Rows weakly increase, and nonintersection of successive paths is precisely strict increase down the shared columns. Conversely every semistandard Young tableau gives one surviving path family. Thus the determinant has the semistandard-tableau generating function .
Young's rule identifies this generating function with the characteristic of : its coefficient at a monomial of weight is , the multiplicity obtained by pairing with the Young permutation module of type . The Frobenius characteristic map is injective and respects induction products. Transposing the path matrix does not change its determinant, so
This is the character version of the Jacobi–Trudi identity.
For the example the matrix is
Expanding gives the concise answer
At the identity the six induction-product dimensions are , respectively; their alternating sum is , agreeing with the hook-length formula for .
Since , Question 2 shows that every composition factor of is for a regular partition . If is regular, its radical quotient occurs once: it occurs as a quotient, and its multiplicity is bounded above by the multiplicity one in . All remaining factors have strictly dominating labels. A nonregular row has only strictly dominating regular labels.
Define . Order the row labels, all partitions of an integer of , and the column labels, the regular partitions of an integer, by the same total order refining decreasing dominance. Then
The matrix is generally rectangular. Its submatrix on regular rows is lower unitriangular in this decreasing convention; placing least dominant shapes first would transpose the visual triangular convention, not the indices.
This is the decomposition matrix, not just an abstract composition factor table. The standard polytabloid basis makes a free invariant integral lattice whose extension to characteristic zero is the ordinary irreducible . Reducing this same lattice modulo gives exactly the modular . On p-regular elements, reduction of its ordinary character is the sum of the Brauer characters of its composition factors, with coefficients . These are the defining decomposition numbers; the resulting class in the modular representation ring is independent of the chosen invariant lattice.
For , take rows in that order. In characteristic zero, or , all three Specht modules are irreducible by Maschke's theorem, and
For the regular labels are and
Indeed the sign representation equals the trivial representation. The two-dimensional is the sum-zero subspace of the three-point permutation module. Over an algebraic closure, a -cycle has two distinct nontrivial third-root eigenvalues there, and a transposition exchanges their lines. Neither line is invariant under , proving absolute irreducibility.
For the regular labels are and
In the same sum-zero space the vector now spans an invariant trivial line. Its one-dimensional quotient is sign: the determinant of the sum-zero representation is sign, and the determinant of the invariant line is trivial. Therefore has one trivial and one sign factor, with sign its simple head . The bottom Specht module is itself sign. This proves every entry of the three possible matrices.
The dominance order on partitions is defined by
Write when the shapes are distinct as well. We first explain why the nonzero from regular partitions exhaust the simple modules. The argument also provides the required constraint on composition factors.
For a regular partition and a tableau of that shape, the operator has rank one on : on its image lies in , and the nonzero pairing with the row-reversed polytabloid from Question 1 shows that this image survives in . On , a nonzero requires every row of to meet each column of at most once, by the same cancellation. Consequently the first rows of contain at most entries from column . Summing gives
Thus nonzero column action forces . In particular, if , its nonzero column operators applied to the realization of either simple as a composition factor of the other's Young permutation module force both dominances; hence .
Over an algebraic closure in characteristic , the number of simple group modules is the number of p-regular elements' conjugacy classes, by the Brauer character basis theorem. Such classes in have cycle lengths not divisible by . The Glaisher partition bijection equates their number with the number of regular partitions: expand a part , with , into copies of , and invert by the base- expansion of each multiplicity. The distinct absolutely irreducible therefore form the complete list. Since they are already defined and absolutely irreducible over the prime field, the same list is valid over any of characteristic . In characteristic zero, the analogous count uses all partitions of an integer and all conjugacy classes.
If occurs in a composition series of , its nonzero action lifts through the subquotient, so . The inequality above proves . When is regular, has rank one on and rank one on . An operator preserving a finite filtration has rank at least the sum of its ranks on the successive quotients: relative to an adapted basis its matrix is block triangular, and nonzero pivot minors of the diagonal blocks combine to a nonzero minor. Therefore can occur at most once. It occurs at least once as the quotient of . We have proved
For a nonregular , equality is impossible because .
Over , Young's rule gives the exact decomposition
The Kostka number counts Semistandard Young tableaux of shape and content : entry occurs times, rows weakly increase, and columns strictly increase. In particular and nonzero multiplicity requires dominance.
For the requested induction, products mean induction of the external tensor product of group representations from to : on , the pair acts as . One can compute using Young's rule alone. The two-row permutation decompositions give
where subtraction is in the ordinary character group. Reordering row blocks gives isomorphic permutation modules. Inducing after multiplication by the trivial gives . For a direct Kostka number calculation, the differences are one for
and zero for every other partition of an integer of seven. To see these counts without enumerating arbitrary fillings, first fill a shape with five entries of content or and then add two 's. The added cells must be a horizontal strip. Removing them leaves, for content , one of with multiplicity one, and for content one of with multiplicity one. The first two shapes cancel, leaving precisely the horizontal two-cell extensions of , namely the five listed shapes. Consequently
The hook-length formula checks the dimensions: .
Let be a partition of an integer . Its Young diagram consists of cells with , and its conjugate partition has parts . A numbered Young tableau fills these cells bijectively with . Its row and column stabilizers permute entries within each row and each column respectively. A tabloid remembers the sets in the ordered rows, forgetting their internal order. The Young subgroup is its stabilizer, so the Young permutation module is
Here the group acts by permuting numbered entries and extending linearly. A submodule is an invariant linear subspace. Give the tabloid basis its orthonormal symmetric bilinear form, denoted . This form is nondegenerate and invariant under the group. Define the column antisymmetrizer and polytabloid by
Thus is the Specht module, generated by any one , because the group is transitive on numbered Young tableaux. The orthogonal complement consists of vectors pairing to zero with every polytabloid.
The key calculation is
To prove it, first take . If two entries of one column of occur in one row of , their transposition fixes ; pairing the terms indexed by and cancels . This also works in characteristic two, where the paired equal terms have sum zero. Otherwise each row of contains at most one entry from each column of . The first row has entries and there are columns, so it uses every column once. Removing those entries, the second row must use exactly the columns of remaining positive height, and induction does the same for all rows. Consequently there is a unique with . Uniqueness follows from . In that case
Linearity proves the identity.
Now let be a submodule. If is not contained in , choose and with . The displayed identity puts in , so its group translates put all of in . This proves the James submodule theorem without a semisimplicity assumption.
Put . If , every proper submodule of lies in , by the same theorem. Hence is its unique maximal submodule, and is irreducible. If , the quotient is zero. This conclusion remains true after every field extension : the integral tabloid construction becomes , and the radical of the restricted form is the kernel of its Gram matrix, so it commutes with extension of scalars. A nonzero Gram entry stays nonzero in . Applying the theorem over makes irreducible. Thus a nonzero quotient is absolutely irreducible.
The precise nonvanishing criterion is
A regular partition has fewer than rows of each positive length. Here is the integral pairing argument behind this condition. Write for the number of rows of length . Expanding two polytabloids into tabloids, simultaneous permutations of equal-length rows partition of an integer all contributions to their pairing into free orbits of size ; the signs agree within each orbit because the same row permutation is applied in every relevant column on both sides. Therefore every pairing is divisible by . If some , the entire restricted form is zero modulo . Conversely, reverse the order of the entries in each row of a tableau to obtain . Counting the matching column permutations in the two expansions gives, up to the harmless overall sign,
Indeed the equal rows of length can be matched independently in each of their positions; after these choices the decreasing row lengths force every other matching. For a regular partition this integer is nonzero modulo , so the form and its radical quotient are nonzero. In characteristic zero it is nonzero for every shape. This supplies the requested justification of the criterion.
The abc conjecture asserts that for every there is such that coprime positive integers satisfy
where the radical is the product of the distinct prime divisors.
For a primitive positive Fermat triple, the three integers are pairwise coprime. Apply the conjecture to . Since , . Taking yields . For and this simultaneously gives
Thus there are finitely many primitive triples and exponents. The primitivity restriction is essential to this abc argument: a nonprimitive triple is a common multiple of a primitive one, and the conjecture normalizes that factor away rather than bounding it. Consequently the intended finiteness conclusion counts primitive triples, or scaling classes. The literal unrestricted Fermat assertion is true for the independent reason that Fermat's last theorem gives no positive solutions for ; it does not follow from the displayed primitive height bound alone.
There is a genuine exception to the second printed assertion. If , then solves the equation for every ; for example gives an infinite family. The correct uniform finiteness statement excludes .
For that corrected statement put and . Since their difference is , . Apply abc to . Its radical is at most , and its largest term is at least . Therefore
With , enlarge the fixed right side to . For the exponent is at least , so
This proves finiteness of all nonconstant-power solutions, without requiring coprime.
For an unconditional proof, the diagonal case satisfies and is elementary. If , the unequal-variable gap is at least , also bounding . In the remaining case interchange variables and coefficients, changing the sign of if necessary, to have and
The nonzero real logarithmic form satisfies . Once , , so . The two-logarithm Baker lower bound for a homogeneous linear form in logarithms, with the fixed height of and height of at most , gives
Hence because , and is bounded. The omitted case has bounded exponent and variables directly. For each of the finitely many exponents, has at least three distinct projective roots. The stronger nonzero-value Thue theorem argument from question 5 therefore gives finitely many pairs, whether or not that binomial form is irreducible. This establishes the exponent bound for a binomial power equation and the corrected finiteness statement with no unproved hypothesis. The constant-power family remains the unavoidable exception.
Use the following fixed-number form of a logarithmic estimate: for chosen logarithms of fixed nonzero algebraic numbers , a nonzero form with integer coefficients satisfies , for fixed positive constants . This follows from the Baker lower bound for a homogeneous linear form in logarithms.
By the Dirichlet unit theorem, write units as and , with finitely many roots of unity and fixed fundamental units. If the unit rank is zero, there are already only finitely many choices. Otherwise put . The real logarithmic embedding of the free unit group has full rank and lies in the product-formula hyperplane. Equivalence of norms in that finite-dimensional space shows that a unit with exponent size has some archimedean conjugate of modulus at most : a large positive logarithmic coordinate forces a comparably large negative one, and a large negative coordinate itself suffices.
Interchanging the two terms if necessary, choose such a conjugate for . At this embedding the equation makes with . For large define the logarithm near one. It is nonzero because , and
On fixed branches it is
for an integer . The bound on follows from summing the fixed imaginary parts and then reducing to the near-one branch. There are only finitely many possible embeddings and roots of unity, so the stated lower bound applies uniformly with coefficients . It contradicts the exponential upper bound when is large. Hence the exponents are bounded and in . This is the unit equation over a number field proof; “unit” here means an algebraic-integer unit, not an arbitrary nonzero field element.
For the Thue theorem, let be irreducible homogeneous of degree and let be fixed. In a splitting field , write with distinct roots. Choose a fixed integer so that each is integral and is a nonzero integer. For a solution the nonzero algebraic integers satisfy . Their principal ideals therefore divide a fixed ideal and have only finitely many possibilities. For each occurring principal ideal choose a generator , so with a unit.
Any three distinct roots give the identity
Divide by the third term and absorb the finitely many generator ratios into the coefficients. This is a fixed-coefficient unit equation in and , so it has finitely many solutions for each generator choice. Thus has finitely many values. The relation fixes a rational direction whenever an integer solution exists; simply gives . On each such direction, for a primitive integer pair, and allows finitely many . This proves the desired finiteness. When , irreducibility excludes a nonzero rational root direction, leaving only .
The argument also proves finiteness for any binary form with at least three distinct projective roots: irreducibility was used only to guarantee distinct roots and to dispose of the zero-value case. A rational invertible change of variables can move every projective root away from infinity; after clearing its fixed denominators, the resulting pairs lie in an integer lattice and the same proof applies. This stronger nonzero-value version will apply to the binomial forms in question 6.
The Gelfond–Schneider theorem says that if is algebraic and is algebraic irrational, every number with is transcendental. Thus the statement includes every determination of the power, not merely a chosen principal branch.
Here is an auxiliary-function outline with the arithmetic and analytic steps specified. Assume were algebraic, and put , . For a large integer , choose degrees and , with constants large enough that . Apply Siegel lemma to impose
on a nonzero polynomial of these two degrees. Each field equation gives at most rational equations. Clearing denominators and bounding conjugates gives equation-coefficient logarithmic size ; the surplus of variables therefore permits coefficient height with
The entire function is nonzero: its polynomial-exponential terms have distinct exponents , and their independence follows by the differential-operator argument in question 2. Here . Its maximum modulus satisfies . The grid points are distinct because is irrational, and lie in a disk of radius .
Suppose the vanishing grid has been extended to , for some . Divide by the product of its known linear zero factors and use the maximum principle on a disk of radius , with large and fixed. At a point of the doubled grid, the quotient estimate gives
if the value is nonzero. But this value equals the algebraic number . Clearing its denominators and taking its norm gives the opposite bound
For sufficiently large initial , the terms on the right are uniformly for every : and . Thus every doubled-grid value must be zero. Iterating doubles the grid indefinitely. This supplies quadratically many distinct zeros in disks of linearly growing radius, whereas Jensen's formula and the exponential-polynomial growth bound allow only zeros for a nonzero . The contradiction proves the theorem. This is the Schneider lattice proof of the Gelfond–Schneider theorem.
Now fix any logarithms of algebraic . Their values are nonzero. If were algebraic irrational, then would be algebraic, contradicting the theorem with base . Hence
For arbitrarily many logarithms the qualitative Baker theorem on algebraic linear combinations of logarithms states that logarithms of algebraic numbers which are linearly independent over remain independent over , even after adjoining one to the list. Equivalently a nonzero homogeneous algebraic-coefficient linear combination of such logarithms is transcendental. Rational relations are therefore the only source of homogeneous algebraic relations among the chosen logarithms.
Write . The authoritative PDF has exponent ; the geometric-series exponent in the converted TeX is a transcription error. On the unit disk this Fredholm series satisfies
First it is transcendental as a function. If , the terms with in are the positive terms and their sum tends to infinity as ; the finite preceding sum stays bounded. Thus every root of unity of -power order is a singularity. These roots are dense on the unit circle. An algebraic function has only finitely many possible branch points or poles, as seen from its defining polynomial's leading coefficient and discriminant. Hence cannot be algebraic over .
Suppose now that is algebraic, , and is algebraic. For a positive integer , a polynomial , nonzero and of degree at most in each variable, can be chosen so that
Indeed the first Taylor coefficients impose homogeneous integer equations on coefficients. There is a nonzero rational solution, which can be cleared to an integer one. Functional transcendence ensures is not identically zero.
Iterating the functional equation gives
Thus belongs to the fixed field and is nonzero for all sufficiently large , since a nonzero analytic has no sufficiently small nonzero zeros. Its analytic upper bound is
Choose an integer making algebraic integers, let , and choose bounding every conjugate of and . Then and are algebraic integers. Therefore
For every embedding of , the coefficient sum bounds the polynomial and gives
Taking the norm of the nonzero integral yields a nonzero rational integer, of absolute value at least one. Consequently
On the other hand the upper bound is , where . Choose so large that , possible because . Letting contradicts the two bounds. This proves, by the Mahler method, at every algebraic .
For the shorter rational-approximation argument at , truncate after and write with . The numerator is odd because its last summand is one and all previous summands are even, so this fraction is reduced. The tail satisfies
The value is irrational: if it were , the positive difference from a truncation would be at least , contradicting the tail bound for large . If it were algebraic irrational and , choose . Eventually the displayed upper bound is below for infinitely many reduced fractions. The Roth theorem says that an algebraic irrational admits only finitely many such approximations. This contradiction proves transcendence directly. The argument does not cover , because its exponent is not strictly larger than two; the Mahler proof does cover that case.
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.
We first give an auxiliary-polynomial proof, rather than assuming a transcendence theorem for exponentials. Suppose were algebraic, and let be its conjugates. Since the first factor vanishes,
Expand and collect equal subset sums of the . This gives , where counts the zero sums, the are distinct nonzero algebraic numbers, and each is a positive integer. The exponents and their weights are invariant under every Galois permutation.
Choose a positive integer such that all are algebraic integers. Their Galois-invariant monic polynomial has rational algebraic-integer coefficients, hence lies in . Its constant term is a nonzero integer. For a prime define
At each , derivatives below order vanish. Every higher derivative is times an algebraic integer, so is divisible by in the ring of algebraic integers. At zero the only derivative not visibly divisible by is the one of order , and thus
Galois invariance makes rational; it is therefore an integer, divisible by . Consequently
For every prime not dividing , this is a nonzero integer.
The finite derivative sum satisfies , so integration along the straight segment to gives
Sum with weights and use . The result is
On these finitely many fixed compact segments, , and are bounded independently of . Hence . There are arbitrarily large primes not dividing the fixed integer , contradicting . Therefore . This is the Hermite auxiliary-polynomial proof for pi.
The more general Lindemann–Weierstrass theorem states that exponentials of distinct algebraic numbers are linearly independent over . Equivalently, exponentials of rationally independent algebraic numbers are algebraically independent over . In particular, the exponential of a nonzero algebraic number is transcendental.
Suppose were algebraic. The exponential formula for cosine gives
After combining equal exponents this is an algebraic-coefficient linear relation among exponentials of distinct algebraic numbers. At least one exponent is nonzero, since and cannot both vanish when . Its coefficient is a positive integer, even when two exponents coincide. The relation is therefore nontrivial and contradicts the theorem. Thus , including the cases .

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