How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Modular Branching and the Good-Node Crystal
1 · Prerequisites
- Adjunctions Units and Counits
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Artinian Rings and Length
- Balanced Triples and Global Crystal Bases
- Binary Operations, Monoids, Groups and Subgroups
- Blocks Defect Groups and the Brauer Homomorphism
- Braided and Symmetric Monoidal Categories
- Brauer Characters and Decomposition Matrices
- Bruhat Decomposition and Flags over Finite Fields
- Categories, Functors and Natural Transformations
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Characters and the Orthogonality Relations
- Clifford Theory over Normal Subgroups
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Constant Rank, Submersions, Immersions and Regular Level Sets
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divided Powers, Integral Forms, and Quantum Highest Weights
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Exterior Powers, Orientation and Hodge Duality
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Finite Weyl Invariants, Bruhat Order, and Kostant Harmonics
- Formal Power Series
- Foundations of the Real Numbers for Analysis
- Free Groups and Presentations
- Free Modules, Exact Sequences, Projective and Injective Modules
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Cohomology as a Derived Functor
- Group Homomorphisms and the Isomorphism Theorems
- Harish Chandra Isomorphism Casimir and Central Characters
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Induced Representations, Frobenius Reciprocity and Applications
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Integrable Highest Weight Kac Moody Modules
- Integral Extensions and Going Up
- Integral Specht Modules and Modular Simple Modules
- Inverse Limits and Noetherian Completion
- Jucys–Murphy Elements and Seminormal Forms
- Kac Moody Algebras from Generalized Cartan Matrices
- Kashiwara Operators and Crystal Lattices
- Lie Algebra Representations, Enveloping Algebras, and PBW
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Localisation of Modules and Support
- Maschke's Theorem, Complete Reducibility and the Structure of k[G]
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modular Representations and Projective Covers
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Noetherian Rings and Hilbert Basis
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Ordinals, Cardinals, and Transfinite Recursion
- Ordinary Hecke Specht Polytabloids and Signed Murphy Comparison
- Permutation Statistics, Inversions and Eulerian Numbers
- Polynomial Rings, the Division Algorithm and Roots
- Prime Spectra and Radicals
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Principal Series Representations of GL N over a Finite Field
- Quantized Enveloping Algebras and Quantum Serre Relations
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Specht Modules and the Irreducibles of the Symmetric Group
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Functions, the Hall Inner Product, and Schur Bases
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- Tensor Coherence and Algebraic Descent
- Tensor Product Multiplicities and Littlewood Richardson
- Tensor Products of Modules
- The Branching Rule and the Young Graph
- The Burau Representations
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Field of Fractions and Localisation
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The Hook Length Formula and Rsk Correspondence
- The Weyl Kac Character Formula
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Type-A Hecke Specht Modules and Cellular Bases
- Universal Properties, Representables and the Yoneda Lemma
- Valuation Rings and Discrete Valuation Rings
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Young Diagrams Tableaux and Permutation Modules
2 · Summary
This page develops the modular branching theory of the symmetric groups in the residue convention and in the -restricted labelling of the simple modules, and isolates the good-node combinatorics as a self-contained crystal. The first layer fixes the objects that make the branching computable inside : the Jucys-Murphy elements of The Jucys-Murphy elements of the symmetric group algebra are used to split the regular representation into simultaneous primary components, and the resulting central content idempotents cut the restriction and induction functors into residue summands and . These functors are the algebro-group-free form of the residue decomposition of the branching problem; they are exact, additive, duality-compatible and available over an arbitrary field of characteristic , with no splitting hypothesis beyond the fact that symmetric groups are split over their prime field. On the combinatorial side, Residue signatures, normal, good, conormal and cogood nodes fixes the residue signature of the -nodes of a -restricted partition, the cancellation of pairs and the resulting notions of normal, good, conormal and cogood nodes, together with the counts , and it records the same-shape normal/good-node dictionary with negated residue names for Brundan's -residue . Good-node deletion and cogood-node addition operators turns the good and cogood nodes into partial operators on -restricted partitions and proves, purely combinatorially, that they are mutually inverse and change the rank by one.
The second layer connects the functors with the nodes. Finite-group induction is coinduction, hence biadjoint to restriction records the relative Frobenius isomorphism for a subgroup of a finite group, so that induction is both a left and a right adjoint of restriction in the modular setting. The socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues states the residue-refined socle theorem for : the socle is the multiplicity-free sum of the simples over the good nodes, one for each residue with . From this, Every -restricted partition is reached from the empty partition by cogood additions derives the connectivity of the modular branching graph: every -restricted partition is reached from the empty partition by cogood-node additions, equivalently by good-node deletions. A remark draws the boundary of what is proved here: the level-one inductive labels agree with the cellular labels by the proved branching endpoints and induction on rank. Identifying this graph with the canonical Fock-space crystal is a separate theorem, and the broader cyclotomic labelling theorem requires its own argument.
The third layer compares the branching multiplicities with the first-level multiplicities over the algebraic group and with the Hecke algebra. The Schur functor compares first-level branching with Hecke restriction uses the type-A -Schur algebra and its Schur functor to identify the Schur image of the first level of a simple module with the restriction of the corresponding Hecke simple module, and transfers composition multiplicities between the first level and the Hecke restriction; the comparison is stated at general quantum characteristic and specialized to . Kleshchev's first-level branching multiplicity records Kleshchev's first-level branching multiplicity: for a removable node of a -regular partition the multiplicity of in the restriction is zero when is not normal and is one plus the number of normal nodes strictly above in the same residue class when is normal. The next two theorems give the residue-restriction and residue-induction multiplicities: the multiplicity of in for a normal node counts the normal nodes weakly below when is normal (and is zero otherwise), and, dually, the multiplicity of in for a conormal node counts the conormal nodes weakly above . The layer closes with the socle and head theorems for the extreme nodes: if is the good node then has simple socle and head occurring with multiplicity , and if is the cogood node then has simple socle and head occurring with multiplicity .
Throughout, is a field of characteristic , all partitions in the crystal statements are -restricted unless stated otherwise, all residues are read as with nodes ordered top to bottom, and every item is finite-dimensional and choice-free, with the characteristic case included. The page records the source theorems it uses (Kleshchev's survey and 1997 paper, and Brundan's 1998 paper) by exact locators; the local proofs and their declared suppliers carry the mathematical arguments.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Integral symmetric Jucys–Murphy polynomials span the center
Statement
For every commutative unital ring and , every element of is an -linear combination of evaluations of integral monomial symmetric polynomials at . Conversely every symmetric polynomial evaluation is central. In particular , where the right side denotes evaluations of symmetric polynomials, not invariants of an action on the group algebra. No integer is inverted.
Facts & Assumptions
Given: , a commutative unital ring , and the Jucys–Murphy elements.
The elements commute (The Jucys-Murphy elements commute pairwise); every symmetric polynomial evaluation over is central (Symmetric polynomials in the Jucys-Murphy elements give exactly the centre). Only the centrality direction over is used.
Proof
An integral symmetric polynomial evaluates in . Its commutator with any permutation vanishes in by [F1], hence vanishes integrally by coefficientwise injectivity. For any coefficient ring, invariance of a polynomial under variable permutations says exactly that its coefficients are constant on monomial orbits, so it is a linear combination of integral monomial symmetric polynomials. All their evaluations are therefore central over . A group-ring element is central exactly when its coefficients are constant on conjugacy classes: compare coefficients after conjugating by each permutation. Consequently the class sums form a basis of the center over and over , even with zero divisors.
Define the reduced cycle type by subtracting one from each nontrivial cycle length and discarding fixed points. Its size is the minimum number of transpositions expressing : multiplying by a transposition changes the number of cycles by one, giving the lower bound, and each cycle of length has a factorization with transpositions, giving equality. The possible types are precisely partitions with . Write for their integral class sums.
If a word of transpositions has product of degree , every prefix multiplication joins two different cycles; otherwise the final degree would be at most . The graph whose edges are the transpositions is therefore a forest, and its connected components are exactly the cycles of every prefix product. Indeed initially both are singletons, and each multiplication joins two current components by one edge and joins their two cycles. Thus edges never repeat, and each final tree of vertices gives a cycle of length .
Let be a possible reduced type of size , and expand the monomial symmetric polynomial , summing once over distinct assignments of the positive parts of to distinct indices . Each term is a word of transpositions, grouped into stars centered at those : the group has edges incident to . Every resulting permutation has degree at most . If its degree is , step 2.1 makes all these stars trees with distinct edges. Each star lies in one final tree; the degree of that tree is the sum of the exponents of its stars. Its reduced cycle type is therefore obtained from by merging some parts. Any proper merging decreases the number of parts.
The coefficient at any permutation of reduced type exactly is one. In the degree- expansion, equality of the number of parts forces each final tree to contain exactly one star. For a cycle with support , the center of its star must be its largest letter , since every factor from is with . The ordered star factorization is unique: with right-to-left permutation composition, is the cycle , as direct evaluation on each letter shows. Thus the cycle determines the leaf ordering. Different cycles have distinct maxima, their stars are disjoint and commute, and their assignments appear exactly once among the distinct monomials, including repeated exponents. This also constructs a term producing .
By centrality and steps 3.1–4.1, , with integer coefficients, where every remaining type either has smaller degree or is a proper merging of . Induct on degree and, within a degree, on the number of parts in increasing order. All remaining sums are already integral symmetric polynomial evaluations, so subtraction expresses that way too. The initial type is empty with . This proves integral spanning without division. Specialization to and the class-sum basis from step 1.1 prove the assertion over every , including and the zero ring.
Generalized Jucys-Murphy primary idempotents and the residue-summand functors ,
Definition
Let be a field of characteristic and let be the Jucys-Murphy elements of the symmetric group algebra (The Jucys-Murphy elements of the symmetric group algebra). Recall that they commute pairwise (The Jucys-Murphy elements commute pairwise), and for the element lies in the subalgebra and therefore commutes with .
(i) Primary idempotents. In the commutative subalgebra the minimal polynomial of each on the regular module splits into linear factors with in the prime field , and the commuting family admits the following simultaneous primary decomposition. There are pairwise orthogonal idempotents , indexed by and , with such that for every finite-dimensional -module the action of on is the projection onto the generalized eigenspace . The for different commute, and for each sequence with entries in the products are pairwise orthogonal idempotents with and , the simultaneous generalized weight space . Every and every is fixed by the antipode of .
(ii) Content sums and blocks. The symmetric group permutes the coordinates of sequences, and two sequences are called equivalent when they differ by a permutation, i.e. when they have the same content (the same multiset of entries of ). Write for the set of content classes (equivalently, multisets of residues). For let be the set of sequences representing , and put Each is a central idempotent of , and distinct are orthogonal; the nonzero are exactly the primitive central idempotents, that is the block idempotents of (p-blocks from primitive central idempotents), and every block idempotent of is of the form : this last identification of the content sums with the blocks is the block theorem of Lyle-Mathas and Brundan recorded as (2.41) in Kleshchev's survey (printed p. 14), with the content of the block being the content of any of its partitions. The present item proves centrality, idempotency, orthogonality, primitivity and exhaustiveness locally; the residue functors use the first three properties.
(iii) Residue-summand functors. For a finite-dimensional -module , a residue and a content class , put where denotes concatenation, is the content sum computed in and regarded in through the inclusion , and . Each is an idempotent of commuting with , the family is a family of pairwise orthogonal idempotents with , and is a -submodule of the restricted module with Dually, for a finite-dimensional -module of content , i.e. , put with ; for a general finite-dimensional , with the sum indexed by , put . Then , and all the functors are additive and exact, preserve finite-dimensionality, and commute with contragredient duality, because the projectors are fixed by the antipode. All statements hold at ; the construction is choice-free.
Facts & Assumptions
Given: A field of characteristic , an integer , and the Jucys-Murphy elements of .
The commute pairwise, and commutes with ; in particular commutes with (The Jucys-Murphy elements commute pairwise, The Jucys-Murphy elements of the symmetric group algebra).
Over , the joint spectrum of on the multiplicity-free sum of the complex Specht modules is the set of content vectors of the standard tableaux of size ; for each the vector spans a joint eigenspace with , the are the contents of the node of containing , and is injective (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors).
Chinese remainder theorem for pairwise comaximal ideals: for a commutative ring and pairwise comaximal ideals , the canonical map is surjective with kernel ; in particular the quotient has orthogonal coordinate idempotents summing to . Representatives may be chosen with modulo , but need not be idempotent in (Chinese remainder theorem for pairwise comaximal ideals).
Induction and restriction for group modules are and (Restriction, induction, and coinduction); for the finite group and the subgroup a coset transversal can be chosen as the set of least elements of the finitely many cosets for a fixed linear order of , so is free as a right -module (The group ring is free over a subgroup ring), and tensoring over with a free right module preserves exactness.
We use block idempotent to mean primitive central idempotent, as in p-blocks from primitive central idempotents. That supplier states the terminology for a splitting modular system; no such system is assumed here. The complete primitive central decomposition over the original arbitrary field is proved in step 6.2 below.
Over every coefficient field the center is the set of symmetric polynomial evaluations in the , by the integral class-sum triangular argument of Integral symmetric Jucys–Murphy polynomials span the center. This uses no division or splitting assumption.
The standard polytabloids form a finite free integral Specht lattice whose specialization is the Specht module over every field (Integral Specht lattice and base change).
Over the finite group algebra is the product of matrix algebras on all irreducibles, so its regular representation is a direct sum of those irreducibles with finite multiplicities (If is algebraically closed and , then ). The complex Specht list is the complete irreducible list in the construction underlying [F2].
Proof
Eigenvalues in . Let be the minimal polynomial of acting on the left regular module . Over the regular module is the direct sum of the complex Specht modules with multiplicities, and by [F2] the eigenvalues of on that module are the integers , the contents of the node containing , over all standard tableaux of nodes; hence is squarefree with the integer roots in the finite set . The group-basis coordinates of are integers and vanish over , so this identity holds already in . Reduction of coefficients modulo therefore gives in , so the minimal polynomial of on the regular module divides the reduction in , and every root of lies in the image of in .
Antipode invariance. The antipode , , is an anti-automorphism fixing every transposition, hence fixes each and therefore each and each .
An integral central identity. In one has , where is the number of cycles, including fixed points. To prove this by induction, regard as fixing . A term multiplied by leaves fixed and adds one cycle. A term multiplied by inserts in the cycle containing , without changing its cycle count. Conversely, deleting a nonfixed from its cycle uniquely recovers the permutation in and the transposition used. Thus every permutation occurs exactly once. Comparing coefficients, each elementary symmetric polynomial in is a sum of all permutations with cycles and hence is central; the identity and centrality remain true after reduction to .
Primary projectors. Write with . For the ideals and of are comaximal, since two powers of distinct linear polynomials are coprime and Bezout gives . By [F4] applied to the ring and its comaximal ideals, the canonical map is an isomorphism; let be the preimage of the idempotent supported at the -th factor when , and put when . Then , , for , and in . Substituting the algebra element for (legitimate because ) gives elements with , and .
These are the primary projections. Let be a finite-dimensional -module. Since the are polynomials in , they commute with and with one another; as one has , and annihilates , so . Conversely, if , then for , and for the element is invertible on the -primary subspace because and is nilpotent there; from we get for , whence . Thus and . The products are idempotent, pairwise orthogonal and sum to by multiplicativity of the ; applying the same argument successively to the commuting operators gives .
Central CRT separates contents. Choose such that for every and every tuple , using step 2.1 and the finiteness of the indices. On the commutative algebra summand with identity , the commuting elements generate an ideal whose -th power is zero for : every monomial of degree has a factor with exponent at least . Thus belongs to that nilpotent ideal, where is the elementary symmetric function of the residues. The tuple determines the content, because determines the multiplicities of its distinct linear factors, over every characteristic. In , the distinct content tuples therefore define distinct pairwise comaximal maximal ideals ; their powers are also pairwise comaximal, since expanding for places every term in one of the two -th powers. By [F4], choose congruent to modulo and to modulo every other . The nilpotence just proved gives when , and otherwise. Since the tuple idempotents sum to , it follows that . This is central by step 1.3. Idempotency, pairwise orthogonality for distinct content classes, and follow from step 3.1 and the partition of all tuples into their content classes.
The functor projectors. Fix and . The primary projectors for , , computed in agree with those in : the primary idempotents in are uniquely determined by their congruences modulo the powers of the distinct linear factors of the minimal polynomial, and the inclusion preserves the polynomial relations of . Summing once over each distinct sequence representing gives . By step 4.1 the first factor is central in , while the second commutes with by [F1]; their product is therefore an idempotent commuting with that subgroup algebra. The sets are disjoint for distinct pairs and partition all tuples of length . Consequently these idempotents are pairwise orthogonal and sum to , and their images are -submodules. Grouping these actual direct summands by the last residue gives . The indexing is by content classes throughout, so no content is counted twice.
Every nonzero content summand has local center. Fix . Since is central, : an element central in the summand commutes with the complementary summand because their products vanish. By [F7] every element of this center is for a symmetric polynomial over . For every , the difference belongs to the nilpotent ideal of step 4.1; symmetry makes the same scalar for all these tuples. The orthogonal sum of these differences is nilpotent with the common exponent of that step. Hence every central element of the summand has the form with nilpotent. The scalar is unique: a nonzero scalar multiple of is invertible in this nonzero summand and cannot be nilpotent. As the center is commutative, sums of commuting nilpotents and their products with any central element are nilpotent. Thus its nilpotents form an ideal, the scalar map is a surjective ring homomorphism onto , and every element with nonzero scalar is invertible by the finite geometric series. The center is local over the original field , without extending scalars.
Induction side. The same computation with replaced by shows that is an idempotent of commuting with , that with pairwise orthogonal summands, and that ; hence for any finite-dimensional , the middle step using and the centrality of in . This is .
Primitivity and exhaustiveness. A central idempotent in has scalar or by step 5.2. In the first case is nilpotent and idempotent, so ; in the second case is nilpotent and idempotent, so . Thus each nonzero is primitive central. Their orthogonal sum is by step 4.1. Any primitive central idempotent of decomposes as into orthogonal central idempotents; primitivity leaves exactly one nonzero term, and the primitivity of that forces . By [F6] these are precisely the block idempotents. At rank zero and gives the unique block; restriction from rank zero is taken to be the zero functor, while induction to rank one has only residue . This convention does not invoke a group .
Exactness and duality. Each is a direct sum of the functors ; a map of -modules commutes with the action of the element , so it restricts to a map , and each such functor is exact as a direct summand of the identity, hence additive and finite-dimensionality preserving. Each is a direct sum of the functors , which are direct summands of induction ; by [F5] is free as a right -module, so induction, and with it each , is exact, additive and finite-dimensionality preserving. For duality observe that is fixed by the antipode by step 1.2, and that the standard nondegenerate pairing satisfies ; hence for finite-dimensional the transpose of the projection on is the projection on and , giving . All these restriction-duality identifications are -linear and natural.
Induction duality by a perfect coset pairing. Put , , and let retain the coefficients of the elements of . For a finite-dimensional left -module , with contragredient action , define between and . For , the -bimodule property of gives and ; these identities prove balancing in the first and second tensor factors, respectively. Simultaneous left multiplication of by any element of leaves unchanged, proving -invariance. On a finite left-coset transversal one has for . Thus the pairing is the direct sum of the perfect evaluations and is perfect by [F5]. For , right multiplication is a well-defined -linear idempotent because commutes with . Let be the coefficient of ; directly on group elements, . For every , the coefficient of in equals , since commutes with . Therefore for all . Writing for its antipode image, step 1.2 gives , so expansion in the group basis yields . The two images of pair perfectly: a vector in either image annihilating the other annihilates the entire opposite space, since the opposite kernel is orthogonal to that image, and hence vanishes by perfectness. By tensor balancing, , so these images are precisely and . Distinct images are orthogonal by self-adjointness and projector orthogonality. Summing the perfect image pairings over proves the natural -isomorphism ; invariance supplies the contragredient action, and evaluation shows naturality in . The construction uses finite transversals and holds over every characteristic, including .
Partition content agrees with the block content. Let and let be the multiset of its node contents reduced modulo . Over , [F2] makes every elementary symmetric act on by the integer . In the integral basis of [F8] the matrix of has integer entries and vanishes after tensoring with , so it vanishes integrally and after specialization to . Thus the CRT polynomial of step 4.1 acts as on , while the other content projections act as zero. The same is true on its nonzero subquotients. Hence any simple module obtained from this Specht module belongs to the block , establishing the stated content dictionary without a splitting-field descent or a reduced interpolation denominator.
Remarks
For every symmetric polynomial over the evaluation is a central element of (Symmetric polynomials in the Jucys-Murphy elements give exactly the centre).
- The correct invariant idempotents. Individual primary idempotents do not in general commute with ; the elements that commute with and carry the residue decomposition are the content sums and the functor idempotents of step 5.1. All statements and proofs above use only the latter, so the residue-summand functors are well defined.
- Why the eigenvalues are in . Step 1.1 reduces the characteristic- minimal polynomial of to the squarefree integer polynomial with roots the tableau contents; this is the place where the published complex joint-spectrum theorem enters, and it is also why no algebraic closure of or splitting hypothesis is needed anywhere in the construction.
- Choice. The only transversals used are the finite ones of [F5], chosen by least elements; no choice principle is used.
Residue signatures, normal, good, conormal and cogood nodes
Definition
Let be a prime and let be a -restricted partition, so that for all (p-regular and p-restricted partitions, Partitions, English diagrams, and conjugation). A node of the Young diagram is an -node if its residue equals ; the -nodes of are its addable and removable nodes of residue (Removable and addable nodes).
The reduced -signature. Fix and list the -nodes of as from top to bottom, that is, in increasing row index and, for equal row index, in increasing column index. Form the word with if is addable and if is removable. Whenever , , and , replace and by ; repeat until no lies to the left of a . The resulting reduced -signature has the form with the zeros deleted, and the nodes attached to its signs are:
- the normal -nodes of are the removable nodes corresponding to the signs of the reduced signature;
- the good -node is the topmost (first listed) of the normal -nodes;
- the conormal -nodes of are the addable nodes corresponding to the signs of the reduced signature;
- the cogood -node is the bottommost (last listed) of the conormal -nodes.
Write and for the numbers of normal and of conormal -nodes of ; the good -node exists exactly when , and the cogood -node exactly when . At most one good and at most one cogood -node occur, for each residue.
Well-definedness. Each reduction step deletes two nonzero entries, so any sequence of steps terminates after at most steps, and in the resulting word no lies to the left of a : otherwise, take two nonzero entries that are consecutive among the nonzero entries of the current word and are ordered , ; all entries strictly between them are by the choice, so the pair would still be reducible. Hence, after deleting the zero entries, a terminal word is for some ; cancelled positions remain in their original places and need not form a contiguous block. The terminal word does not depend on the order in which reducible pairs are chosen: two reducible pairs cannot overlap partially, because an endpoint of one pair lying strictly inside the other would be a nonzero entry in a position that the other pair requires to be , and pairs sharing exactly one endpoint would similarly place a nonzero entry strictly inside the other pair; so any two reducible pairs are either disjoint (and the corresponding steps commute) or equal, there are no critical pairs, and the rewriting relation is locally confluent. Uniqueness follows by induction on the number of nonzero entries. A terminal word admits no step. Otherwise, two distinct first steps commute and reach a common word after one further step each. All these successor words have fewer nonzero entries, so the induction hypothesis identifies their terminal words. Thus any two reduction sequences have the same terminal word; in it the first surviving and the last surviving are unique positions whenever they exist. Thus the reduced signature, the sets of normal and conormal nodes, and the good and cogood nodes are well defined. The empty partition has the unique addable node , of residue , and no removable nodes. Its -signature is and its other signatures are empty. Thus for every , , and for . It has no good node and its cogood -node is .
Convention warning. Brundan's -residue is the negative of our . His normal and good removable nodes (§§2.2–2.4) are the same nodes on the same partition as ours, with residue names negated. Indeed, a minus survives our cancellation exactly when each prefix of the boundary word strictly below it has at least as many minuses as pluses. Brundan's lattice test expresses these inequalities after the noncorner entries common to his demand and support sets are removed, as in Remark 2.4(I). Remark 2.4(II) compares his convention with Kleshchev's older convention on the transpose; it does not identify our nodes with Brundan-normal nodes on the transpose. Transposition and residue negation must therefore be tracked separately (Removable and addable nodes, Partitions, English diagrams, and conjugation).
Remarks
- Zero entries are not nodes. The zeros of the word record cancelled places and carry no node; only the surviving signs are attached to nodes, as in the definition of the normal, good, conormal and cogood nodes.
- Why -restrictedness is assumed. The nodes and their residues are defined for every partition, but the definition is applied on this page to the -restricted labels, for which the good-node machinery matches the modular branching rules of the dual-Specht convention used throughout.
- At most one sign of each outer type. In the zero-suppressed reduced word the first surviving (if ) and the last surviving (if ) are unique places, which is the content of the final assertion.
- Choice. The definition and the well-definedness argument use only finite lists and a finite reduction; no choice principle is used.
Finite-group induction is coinduction, hence biadjoint to restriction
Statement
Let be finite groups and let be any field. For every left -module the map is a natural isomorphism of -modules (Restriction, induction, and coinduction). Consequently naturally, so induction is both a left and a right adjoint of restriction (Induction and coinduction are the two adjoints) and is exact. No hypothesis on the characteristic of , on splitting fields, or on the prime is needed, and the argument is choice-free: it uses only the finite selection of least representatives of the finitely many left cosets.
Facts & Assumptions
Given: Finite groups , a field , a left -module , and a set containing exactly one representative of each left coset (a left transversal), chosen as the set of least elements for a fixed linear order of .
is the tensor product of the -bimodule with , with ; the elements of form a -basis of , and the defining relations are for . The coinduced module consists of the -linear maps with for all , , with (Restriction, induction, and coinduction).
Induction is left adjoint and coinduction is right adjoint to restriction (Induction and coinduction are the two adjoints).
is free as a right -module on any left transversal, so , that is induction, preserves exactness; a supplied transversal is the only choice input (The group ring is free over a subgroup ring).
Every element of is uniquely with , , and is the disjoint union of the cosets , ; is a finite group and every product in is a finite sum.
Proof
is a well-defined -linear map. For fixed the formula defines a function on : if then , otherwise . It is -linear in by definition, and it is -linear: for and , if and otherwise; since and (as ), this equals in the first case and in the second. Hence . The map is -linear and in the second tensor variable balanced: for , the functions and both send to when and to otherwise; so is well defined on the tensor product. Finally it is -linear: if and otherwise, and if and otherwise, the two conditions being the same.
The inverse on coinduced maps. For , define . This is a finite sum and a -linear map. Inverting the left cosets shows that the right cosets partition . If a representative is replaced by with , then , by -linearity and the balancing relation. Thus the inverse formula is independent of the finite transversal.
. For , there is exactly one for which , equivalently . Write . Then , using the right-coset partition from step 1.2 and -linearity. Equality on the group basis gives equality on .
. For and , write uniquely with and . Then , by the left-coset partition and tensor balancing. Since such elementary tensors span the induced module, this proves the second inverse identity.
Naturality and consequences. If is a -map, then for all one has , because the formula is evaluated by multiplication in or and is linear; hence is a natural transformation, and by steps 2.1 and 2.2 each is an isomorphism with natural inverse . Therefore as functors, and [F2] yields that induction is both a left and a right adjoint of restriction: the left adjunction is its induction adjunction, and the right adjunction is transported across this natural isomorphism from the coinduction adjunction. Induction is right exact, and coinduction is left exact; a natural isomorphism between the two functors therefore makes induction exact, in agreement with the freeness of over recorded in [F3]. No hypothesis on , on characteristic, or on splitting is used, and the only selection made is the finite transversal of least representatives.
Remarks
- Freyd's adjoint functor heuristics. The isomorphism is the finite-group relative Frobenius map; it is the reason the modular branching page can use the biadjunction of restriction, and the two adjunctions are not identified by hand: the right adjunction is obtained by transporting the coinduction adjunction along .
- Finiteness of is what is used. The argument needs the finiteness of in step 1.2 and the total vanishing of all but one term in steps 2.1 and 2.2; for infinite these fail in general. The finite transversal is selected by least elements, so no choice principle enters.
Good-node deletion and cogood-node addition operators
Definition
On the set of -restricted partitions (p-regular and p-restricted partitions) define partial operators for by where is the good -node of (Residue signatures, normal, good, conormal and cogood nodes), the operator being undefined on when ; and where is the cogood -node of , the operator being undefined on when . Then for all -restricted ; in particular and are mutual inverses on their domains, each lowers the rank by one and each raises the rank by one, and at most one good and at most one cogood node exist in each residue. No module-theoretic statement is made here: this item is pure combinatorics, and the identification of these operators with the crystal operators of the level-one Fock space is a theorem of the later Fock-space page, not an input here.
Facts & Assumptions
Given: A prime , a residue , and -restricted partitions of ranks and .
For a -restricted partition the -signature is the word in read off the addable and removable -nodes ordered top to bottom, and its reduced form, after deleting zero entries, is well defined; the good -node of is the removable node of the first surviving , the cogood -node is the addable node of the last surviving , and are the numbers of surviving and signs (Residue signatures, normal, good, conormal and cogood nodes).
Let be -restricted and a removable -node. On deleting , only boundary nodes in rows can change. A newly removable node in row occurs only when , and has residue ; a newly removable node has residue . The former row- addable node has residue . A row- addable node is lost only when , and then has residue . These residues are different from for every prime . Thus the only change to an -boundary node is that changes from removable to addable: and . This follows directly from the row inequalities in Removable and addable nodes; it does not assert that every boundary node in row is retained.
The reduction of a signature word is confluent, and the zero-suppressed normal form can be computed by scanning the word from left to right, pushing each non-cancelled on a stack and letting each cancel the top of the stack if the stack is nonempty, and surviving otherwise; the surviving signs in their original order are exactly the normal form (Residue signatures, normal, good, conormal and cogood nodes).
If is a partition and a removable node of , then is a partition, and is a partition for every addable node of ; the restricted condition compares the consecutive differences with (p-regular and p-restricted partitions, Removable and addable nodes).
Proof
The stack algorithm computes the normal form. The stack algorithm of [F3] terminates with a word containing no before a (a surviving stays on the stack and blocks the stack from being empty, so no later survives after it), and the reduction relation is confluent by [F3], so the surviving signs read in order are the reduced signature with zero entries deleted, ; in particular the good node corresponds to the first surviving and the cogood node to the last surviving .
Comparison of the -words. Let be -restricted and a removable -node of ; put . By [F2] the -nodes of are obtained from those of by removing from the removable list and inserting into the addable list, all other -nodes and their top-to-bottom order being unchanged; hence the -signature words of and have the same length and the same entries except at the position of , where the word of has and the word of has .
First surviving versus last surviving . Let be a signature word with , let be with the entry at changed to , let be the prefix of strictly before , and let be the suffix strictly after . We prove that is the position of the first surviving of if and only if is the position of the last surviving of . Let be the stack of [F3] after scanning ; the prefix of before is the same word , so the same stack is present there. If is nonempty, let be its bottom entry; scanning further, can leave the stack only by being cancelled by a that has first cancelled every entry above it, in particular the entry at , so either survives, giving a surviving before , or the entry is cancelled before and does not survive; in both cases is not the first surviving of . Similarly, scanning the entry at is a , which survives only if the stack just before it is empty, so if is nonempty then does not survive and is not the last surviving of . Hence both events force to be empty, and we may assume this. With empty, push the at in the scan of ; while this entry is alive, the pending entries above it after scanning a prefix of are the signs of not yet cancelled, and since no has yet occurred at height , that number is . Consequently is cancelled at the first of whose preceding prefix has , and such a exists if and only if some prefix of has : counts change by one at each symbol, so a strict surplus arises only across a step of equality, and conversely a prefix with equality followed by a would create a strict surplus. Thus, with empty, the entry at survives in if and only if In , the at arrives at the empty stack and survives; after it, a later of survives exactly when the stack is empty at its arrival. If (C) holds and a of survived, with preceding prefix , then all of were cancelled, so , while (C) applied to the prefix extended by that gives , a contradiction; hence no later survives. Conversely, if (C) fails then some of survives: the stack height after a prefix of equals , where is the number of signs of that survived, as one checks by induction on the length of (a raises the height, and a raises by one and lowers the height by one exactly when it cancels); if no of survived then for every prefix , so for every prefix, contradicting the failure of (C). Therefore (C) holds if and only if, in , the entry at is the last surviving , and the claim follows.
Good versus cogood for a removable node. Let be -restricted, a removable -node of and , assumed -restricted. By step 1.2 the words of and differ exactly by the flip at the position of , so step 2.1 gives: is the good -node of if and only if is the cogood -node of . Consequently, if and is the good -node, then with cogood node , and .
Removing the good node preserves restrictedness. Let be -restricted and let be its good -node; we show that is -restricted. If and , then is a removable node of (as ) with , so is a removable -node above and hence occurs before in the -word. There is no -node between and : these are consecutive rows, and any addable node in either row has residue . Thus is still on the stack when is pushed. Either some before survives, and then is not the first surviving , or every before is eventually cancelled, in particular ; but a cancels only after cancelling every entry pushed after , in particular the entry at , so in that case is cancelled and does not survive; both alternatives contradict that is good. Hence , and then is -restricted: deleting the last node of row leaves and, if , , while all other consecutive differences are unchanged.
Adding the cogood node preserves restrictedness. Let be -restricted and let be its cogood -node; we show that is -restricted. Suppose first that ; then is an addable -node of , because and ; between and in the top-to-bottom order there is no -node: the entries after in row do not exist, and the remaining -node of row is the removable node , whose residue is , while the addable node of row is itself. Hence and are consecutive in the -word, both with sign . If the at survives, it leaves the stack empty, so the next entry, the at , also survives and is later than ; if the at does not survive, then is not the cogood node. In both cases is not the last surviving , contradicting that is cogood. Hence , and then , while for (no row above change is needed when ), and all other differences are unchanged; so is -restricted.
Good versus cogood for an addable node. Let be the cogood -node of the -restricted partition and . Step 3.3 makes -restricted, so step 3.1 applies. The node is removable in , and ; applying step 3.1 to the pair gives: is the good -node of if and only if is the cogood -node of . Consequently, if and is the cogood -node, then with good node , and .
The inverse property. Let be -restricted partitions. If , then , for the good -node of , and step 3.1 gives that is the cogood -node of , so that . Conversely, if , then , for the cogood -node of , and step 4.1 gives that is the good -node of , so that . Hence for all -restricted , both sides being false when the relevant node does not exist; and by steps 3.2 and 3.3 the operators map -restricted partitions to -restricted partitions.
Conclusion. By [F1] at most one good and at most one cogood -node exist in each residue, so the partial operators are well defined; removing a node lowers the rank by one and adding a node raises it by one, so lowers and raises the rank by one; and by step 5.1 each operator is defined at exactly the images of the other, so they are mutual inverses on their domains. No module theory and no choice principle are used.
Remarks
- The word comparison is where the geometry enters. Step 1.2 is the only place where the partition structure is used; the reduction of a general word does not behave this way, so the inverse property is a theorem about the -words of partitions, not a formal property of the cancellation procedure.
- One-sided cancellation. The reduction cancels only pairs, so a reduced word may contain both a surviving before a surviving , as in the reduced signatures appearing on the companion page.
- Choice. Everything is finite and explicit; no choice principle is used.
An integral essential-subset basis and count for type-A root intervals
Statement
Let have characteristic , let , and let be a polynomial highest weight. Let be the nonzero Schur Weyl-cell simple at , regarded as a left module by star, with its canonical highest vector . Put . For every , define and , reduced modulo for zero tests. A matching is an injection with ; it need not preserve order between different sources. Call essential when no outside in admits a zero- matching . Write for the number of essential sets.
The vectors constructed by the explicit integral coefficient recursion in the proof, indexed by essential , form a basis of . In particular this weight-space dimension is , including dimension zero. The construction has integer-polynomial coefficients, and its positive-word pivots remain valid in every field of characteristic .
Define a root to be normal in when and its demands with admit an injection satisfying and . If is not normal set ; otherwise let it be the number of normal in with . Set , where only coordinate is increased by one. Then, as ordinary integers, No restrictedness condition is imposed on or on the shifted auxiliary highest weights.
Facts & Assumptions
Given: as in the statement, with the finite integer root intervals and modulo- zero tests just defined.
The actual Schur algebra is the endomorphism algebra of the sum of permutation modules and has its dominance cellular semistandard basis and Weyl cell modules, with canonical diagonal tableau element the projection onto its permutation summand (The type-A q-Schur algebra and its Weyl modules). We use this basis and its cell-product definition, not a characteristic-zero highest-weight realization.
The cell rank-one multiplication implies that a nonzero form quotient is simple, remains simple on scalar extension, and that the nonzero cell quotients cover all simple modules (Cellular bases and cell modules, Nonzero cell heads classify the simple modules of a cellular algebra). The local argument below proves the needed highest-vector, polynomial-matrix and weight-spanning properties explicitly.
Proof
Extend only to . This field is infinite, and extension preserves the rank of every finite Gram matrix. A nonzero Schur cell-form quotient stays simple after this extension: in any field a vector outside its radical generates the entire cell module by the cellular rank-one action, and the same argument applies to the extended nonzero Gram form. No algebraic closure or infinite-choice step is required.
At , identify with the tensorword basis of , by sending to the word whose th letter is the row containing entry in the row-standard tableau . This is the explicit right-coset/tensorword convention; for regular type and basis , that letter is under right permutation notation. The symmetric-group action on tensor positions is transported through this map, so inverses in labels and right-position actions are fixed consistently. The symmetric group permutes the tensor positions. An endomorphism commuting with this permutation action has matrix coefficients constant on its orbits on pairs of words. Such orbits are indexed by nonnegative integer matrices with , recording the number of positions with input and output . Let be the matrix with entry 1 on that orbit and 0 elsewhere. The have disjoint support and form a basis of the endomorphism algebra. For a matrix , . The transpose involution sends to ; it is precisely the Schur star (the corresponding semistandard Hom maps are transposes under the orthonormal tensorword/permutation forms).
Invertible-matrix evaluations span this Schur algebra over . Indeed a linear functional annihilating all gives a polynomial vanishing whenever . Then vanishes at every matrix over . An elementary induction on the number of variables shows that a polynomial over an infinite field vanishing everywhere is zero: regard it as a polynomial in the last variable and use infinitely many values, then apply the induction to its coefficients. Thus as a polynomial, and the polynomial domain gives , so all vanish. Finite-dimensional duality proves the spanning claim. Consequently the star-converted Schur simple is a simple rational left -module, with the same submodules and composition multiplicities as the right Schur module.
The canonical semistandard tableau has weight and Schur form value 1. Indeed its diagonal Schur basis element is the projection onto the permutation summand : the defining Hom map is the identity there and zero on the other summands. Its square is itself, so the defining cell-product coefficient, which is the canonical tableau norm, is 1. This argument uses the canonical diagonal projection only, not an idempotence assertion for all diagonal tableau elements. Every semistandard tableau weight is dominated by : for each , all entries occur in the first rows by column strictness, so there are at most of them. The unique tableau of weight is the canonical one. Thus has highest weight with one-dimensional highest space , and its positive upper unipotent group fixes : any nonconstant positive-root coefficient would have weight strictly above . Torus weights are integer characters, distinct as Laurent monomials over ; no Lie-eigenvalue congruence substitutes for weight equality.
On the open set where leading principal minors are nonzero, Gaussian elimination gives . The negative-unipotent coefficient operators on span . To see this, let be their span and let annihilate . Then on that open set because and is a scalar multiple of . A polynomial matrix coefficient vanishing there vanishes identically by the same polynomial-identity argument, so annihilates the coefficient orbit of under all . That orbit spans by simplicity. Hence .
Positive coefficient operators detect every nonzero vector of weight . If they all had zero highest coefficient on , the Gaussian factorization would imply that the highest coefficient of was zero on the same open set: negative operators cannot raise a weight to , and no weight exceeds . The resulting polynomial identity would make that coefficient zero on the whole simple-module orbit of , which spans and contains , a contradiction. Thus some positive coefficient operator of weight raises to a nonzero multiple of .
For , every simple-root coefficient is 1. In a product expansion of a unipotent matrix, any monomial of total root weight therefore has each root-variable exponent or , and its roots are pairwise disjoint intervals covering . They are exactly cut partitions of that interval. Put , for , with . These words span the required negative coefficient space. Similarly the positive coefficient space is spanned by words using each once. Root-matrix commutators expand every longer positive root into such simple words. Permutations of these simple letters are identified using for ; their relative orders on adjacent pairs determine the canonical representative . Every word is carried to this representative by exchanging adjacent incomparable letters in the corresponding path partial order. Hence these words span all positive tests at the interval weight. There are no divided powers greater than 1 or factorial denominators in this grade.
The actions and all commutator calculations below use , and . They are integral matrix identities and apply to the actual Schur module. The construction descends from to because the resulting matrices have entries in and scalar extension preserves all ranks and linear relations.
For , define recursively. For . For let and . If , put . If , put . Every division here is performed in the integer polynomial ring before specialization. It is exact. To prove this, induct on , keeping the stronger statement that , where is an integer polynomial in the remaining differences independent of and of . At the next smallest cut, use . If , the numerator contains the explicit factor . If , the two terms are respectively evaluations and , multiplied by the same left factor, with ; their difference is divisible by , since . This gives the stronger factorization at the next step. The base case is the displayed product. Thus all coefficients are integer polynomials even when their displayed denominators vanish modulo .
Define . The coefficient recursion is equivalently the exact negative-word recursion . This follows by separating cut words according to whether the cut occurs. Products of adjacent interval words concatenate with the boundary cut present; this is exactly the cut-word product in the numerator.
The following splitting identity is integral: where . If omit the middle term and set . For this is rearranged at cut . For nonempty , remove its smallest , insert on the left and apply the induction to the two shorter products. Use . The terms containing the extra cut cancel in pairs, and the remaining numerator is . Exact divisibility already proved permits cancellation in the integer polynomial ring; reduction to is made only afterwards. This proves by induction, including the singleton case.
Order subsets by their largest differing element, with the subset containing that element larger. Complements reverse this order. The transition from to is unit triangular: . Here is an explicit induction. First , descending on , gives . For this is the defining empty- product; to pass to subtract in . The terms with cut cancel, leaving the indicated sum divided by the common factor . At this gives . For any other choose , split around , and rearrange . The product of the two shorter leading words is the cut word for the complement of , with coefficient 1. The two other terms have strictly larger , hence strictly smaller complementary leading cuts. Induct on interval length and then downward on . This proves . Therefore the words span precisely the same interval negative coefficient space as the words.
If has consecutive components , matrix commutation and give, for unless for some ; . Empty prefix operators are interpreted as 1. The endpoint action, with , is if ; if ; .
These formulas follow directly as follows. In the empty- expansion, group words by membership of and in their cuts. The coefficient of each residual word cancels through for . At the endpoint the two contributions are and , whose sum is , giving . For general , remove in . For the empty-prefix cancellation is unchanged. At , the first term has zero action; on the product term the empty-prefix endpoint coefficient is , since the later negative interval increases its adjacent Cartan value by 1. This cancels the displayed denominator and gives the first component case of . For later component starts the positive operator commutes with the initial prefix, and applying the induction to both terms in is exactly the same recursion for the shorter first factor in . All other internal indices give two zero terms. Applying the endpoint induction to gives ; in the singleton case its numerator is , and yields by . The general case cancels in the same way after deleting the maximal cut. All identities were derived integrally before reduction, so no denominator is cancelled in .
Set by . The endpoint calculation and give . Again this is an integer polynomial: it is the actual integral highest coefficient of a matrix-word action, or follows by the same difference-divisibility induction as . The product in the empty case is essential; the historical printed sum in 1995 Definition two point nine is not used.
If has a bounded zero- matching , with image , then . There is a polynomial proof preventing invalid modular cancellation. The stronger identity, for (and when ), is , where each has integer-polynomial coefficients independent of . The empty case is the defining product. Remove the smallest , put , and . The two induction formulas for , starting respectively at and , have exactly the same . Their left factors differ by replacing each with . Substitute them into , factoring . The principal numerator is . The bracket on the second line is divisible by in the integer polynomial ring. Every old error term is likewise a difference , divided by , because its prefactor and undergo the same translation. Thus after the exact division the first term is the required product with removed, the second is an integer-polynomial multiple of the new matched generator , and the remaining terms are multiples of the old matched generators. For complete control of the universal cancellation, replace the variable by the formal coordinate , since and its coefficient in is 1. Thus the integer polynomial ring is . Every matched generator has and is independent of . Its quotient is therefore a polynomial ring in over the remaining coefficient quotient, so multiplication by is injective even if that coefficient quotient has torsion or zero divisors. The exact paired divisions retain the matched ideal before specialization; no cancellation in a characteristic- coefficient field occurs. This proves the stronger identity, hence , without any division modulo .
if and only if there is an endpoint and a bounded zero- matching . Write as above and set . Every possible witness can be enlarged within its gap to for some , without changing its matched left set. Thus is equivalent to one of the following finite conditions : the earlier components have a bounded zero- matching into , and there is an unused zero- target for the additional left point .
Induct on interval length. The single-root case is iff modulo , by and positive detection, exactly . Suppose holds. For each component-start action in , if its index , the tail has the shorter witness obtained from the existing matching by taking its start as the extra left point; if , the prefix has the earlier witness . Thus each such product is zero by the induction. All other with annihilate by . If , the endpoint witness is . Both shorter terms in retain it after the last cut is deleted, so they are zero by induction. If , all has a regular matching and its unused zero- target gives by . Since for , any positive simple-word test of the full interval is either zero immediately or is forced to act in the order : a smaller out-of-order first letter commutes past all the already acted larger letters and kills . Its only possible surviving value is therefore , which is zero. Positive detection from the modular foundation already proved gives .
Conversely suppose but no holds. Its earlier prefix in each is nonzero by induction; otherwise the shorter witness would already give one of the forbidden . Separated prefix and tail operators in commute, and their product on is nonzero whenever both factors are nonzero: choose positive tests raising the two separate factors to nonzero multiples of , commute them across the opposite negative factor, and their product raises the product to the nonzero product scalar. Thus each tail in must be zero.
Work backwards through the components. For the last component, its zero tail gives a bounded zero- matching of all into . In general the zero tail beginning gives a matching of components into for some . All later components already have a regular matching by the backward induction, using targets . These two target ranges are disjoint, so their union matches all components . Thus all is regular. But implies , and then supplies an unused target with . Match to that target to obtain , a contradiction. This proves .
It follows immediately that is nonessential iff for some : its witness is precisely the witness in the essential predicate.
If is nonessential and , choose with by ; would have made already. Put if nonempty. The splitting identity gives , with the first term omitted if and . Both new subsets are strictly larger than . Repeating terminates because there are finitely many subsets; each nonessential vector is expressed through larger essential ones or zero. Combining with and the modular foundation already proved shows that essential vectors span the root weight space. If there are no essential sets, the result is the zero space; no division is involved in this straightening.
For and , write when each block of is a prefix of a block of : . Put . Call linked to if every admits a bounded zero- matching to targets , with . If this means all is regularly matched to . Define as the least linked in the subset order; it exists since is linked.
Let be the highest coefficient . The action formulas give unless , and if . For use . The signs are the explicit signs from the occurrences of , hence and irrelevant to zero/nonzero tests.
To verify , factor the positive word exactly as . This is just the canonical word reordered by commutations of letters at distance >1. Apply the rightmost displayed gap letters using . A start not among the 's gives zero immediately. When starts align, each gap action separates the negative factors into intervals with that simple root removed, so they commute with the other interval's positive factors. The sign contributed is .
The remaining one-block calculation is completely explicit. For and if , and is zero otherwise. Indeed . Move past , which commute with it when . If is a cut, gives ; repeat for . Each letter commutes with the still unacted end letters, and each application deletes exactly one initial cut and contributes . The last remaining word is on that tail, exactly . If the first missing initial cut is , says annihilates the current tail, so the result is zero. The case is the definition of .
Apply this one-block formula to the separated factors. It forces ; its remaining cut set is exactly , while the initial factor has cut set . This proves , with the explicit sign . Empty intervals contribute 1. This proof uses only , the definition of and commuting separated roots, and no source lemma as a premise.
For linked , apply to every factor in . Thus its value is, up to sign, the product of on the unmatched initial target interval and on the unmatched later target intervals. This gives the following pivot assertions.
First, if , then . A zero factor in the initial interval would match the extra left point to that unused target, together with its matching, yielding . A zero factor at endpoint would let one remove that endpoint from and match its newly released left point to the unused zero target. The old matchings remain disjoint; if that endpoint was a singleton block, merge the two adjacent target intervals, whose old ranges were disjoint. This produces a smaller linked subset, contradicting minimality of .
Second, whenever . Otherwise gives . Let . The two sets agree above . It must be the endpoint of its block: if were in that same block and in , it would start a block at , hence also a block by , contradicting . The next block start is common to both sets. The link matching for therefore matches together with the corresponding block of into the target interval up to that next start minus 2. Apply to the factor starting at . The unused target of is a zero factor in its residual product, so that factor and are zero.
Third, essential have distinct . Suppose are essential with the same , and let . Their tails above agree, and . Locate inside the block between two consecutive components. The link matching for that block restricts to a bounded zero- matching on into , where is one less than the next common block start (or at the end). Indeed the component containing ends before that next start; all entries between and in are the common tails of . The lower bound follows from boundedness of the matching, and the upper bound is exactly the link target bound. Both and lie outside . This makes nonessential, a contradiction.
In a putative nontrivial relation among essential vectors, choose whose is largest among the nonzero coefficients. Apply . A term with a smaller is killed by the second pivot assertion, and a term with a larger has coefficient zero by choice. Distinctness of hats leaves only the term, with nonzero coefficient by the first assertion and essentiality through . This contradicts the relation. Thus essential vectors are independent; the essential straightening already proved supplied spanning. The exact dimension is therefore .
All entries of the matrices are reduced integer polynomials in the . The construction over hence gives the same rank and basis over : a relation over would remain one over , and the equality of finite Gram ranks on extension rules out a missing dimension. Empty root weight spaces and all modular zeros were retained. The proof works for arbitrary dominant polynomial weights and all intervals, including the shifted lower weights needed by first-level character inversion. It does not assert semisimplicity of the Schur or symmetric-group algebra.
Fix a prime , a rank , and arbitrary nonnegative fundamental-weight coordinates . No -restricted or -small coordinate assumption is imposed. All zero/nonzero tests below are in ; all cardinalities are ordinary nonnegative integers. For define , . The identities used throughout are and, for , and . For integers , . An injection is weakly increasing here when for every ; it need NOT preserve the order of different source elements. Weakly decreasing means . This agrees with Definition one point twelve and is important for the augmenting paths below.
A subset is nonessential if there are in and an injection with and for every source . Otherwise is essential. Write for this family and . A subset is regular if it has an injection with and . The empty subset is regular.
An index is normal in if and its demand set has a compensation injection with and . Define as its indicator. Also set . The root normality depends only on ; an ambient earlier endpoint does not change it.
If is not normal, put . If is normal, set , . The primed functions refer to the last-interval-coordinate shift: , . Only is increased by 1. An interval ending before sees no effect of that shift. All shifted weights remain dominant.
The desired count recurrence, for every , is . In particular gives the first-level count formula with the final fundamental coordinate shifted at , not at or at the first coordinate.
Order subsets colexicographically: at the largest element of their symmetric difference, the subset containing that element is larger. The regular family is finite and nonempty, so it has a unique maximum . Claim: an essential regular subset exists iff is normal; if it exists it is exactly .
First let be regular and essential, with matching . If , add the source with ; this is disjoint from , whose images are . It is a forbidden witness with endpoints . Hence . Let . Every must belong to , since an unused could be assigned to the extra source and would again give a forbidden witness. For each choose . Then and ; hence compensates . These are distinct, proving is normal. Moreover, if were another regular subset, let be the largest element in at the highest difference. The subsets agree above . Restrict a regular matching of to ; its targets lie in and are distinct. Since , this is a forbidden witness for . Thus .
Conversely assume normal and let with a regular matching . Suppose a forbidden witness has endpoints . If , the subset is regular: use on its sources below and use on . Their targets are respectively and , so are disjoint. Since and all larger elements are retained, , a contradiction.
It remains to treat . Put , and . The target is not in , and since . Let . Normality gives a compensation injection on ; its targets satisfy and . Begin at the unused target . If , add that new source and assign it . Otherwise set , reassign to , and release . Then , so . Continue: use compensation , reassign it to if it lies in , and release its old -target. All targets and compensation sources along this path are distinct: and are injective, and a cycle would force the initially unused to be a -image. Finiteness therefore ends at a source . Every reassignment has and respects the lower-bound constraint . Keep on untouched and on ; those latter targets are and disjoint. This constructs a regular matching for together with one new source in , contradicting maximality. Thus is essential.
This proves the claim, including uniqueness, without assuming a source theorem or using a representation-theoretic count. Two elementary consequences of the witness definition will be used. Truncation. If is essential in and , then is essential in . Any forbidden witness for the truncated interval has endpoints , also outside , and is a witness in the original interval. Concatenation. If is essential in and essential in , then is essential in . A forbidden witness wholly to the left or right gives the corresponding forbidden witness. A witness crossing contains as a source; restrict it to . Since all such sources and their targets are , this is a forbidden witness for . The virtual case uses and the same restriction argument.
Let be essential. If it is regular it is the unique of the regular-essential matching argument already proved, and . Otherwise let be the largest element of satisfying and . Such exists: take , with empty prefix. The prefix is essential by truncation at , hence equals the unique ; in particular (or the virtual value 1).
We show is essential. If it had a witness with , that is already a forbidden witness for . If , the witness matches into ; combine it with the regular prefix matching, whose images are . Because , this makes regular in . If or there is no element of above , it makes regular, contrary to assumption. Otherwise let ; then , and that same matching makes regular. This contradicts maximality of . Thus is essential, and .
The decomposition is unique. Indeed, in a concatenated set with essential tail , no larger can meet the same two prefix conditions: a regular matching for its prefix, restricted to , would be a forbidden witness for with endpoints . The regular essential case cannot equal a concatenated case, because a regular matching of the whole set restricted to would make nonessential with endpoints .
Iterating this unique decomposition gives a bijection between essential subsets and -cut paths satisfying . For the condition is . The inverse recursively inserts the unique regular essential prefix and the cut point, so this is a genuine bijection, not merely equal cardinalities. In particular counts these paths.
For a fixed , . For a demand with , its eligible compensation positions are exactly with . This is a prefix/Ferrers matching problem. A compensation injection exists iff at every cutoff the number of demands does not exceed the number of eligible compensation positions : necessity follows by counting distinct targets; sufficiency follows by pairing increasing demands with increasing available eligible positions. This is a complete greedy matching proof.
If , initialize a stack with . Scan . When , push if , pop the last push if , and otherwise do nothing. These push/pop cases are disjoint, since . When and , the position supplies and consumes its own compensation slot, so it changes neither the matching inequality nor the stack; all other zero-coordinate positions are likewise neutral. Kill the root walk permanently if its initial push is popped. The prefix matching inequalities prove that is normal exactly when the walk is not killed.
When it is not killed, its final stack is exactly . A pushed position has and . For every the identities give and . Thus is normal precisely when no suffix after it has excess pops over pushes, equivalently when its push survives the last-in-first-out matching. This proves the claimed exact stack interpretation of and . For a killed root, is empty by definition. The same proof applies verbatim to every shifted weight.
We record two consequences of the stack, with proofs exposing the endpoint shift. Bridge lemma. Suppose and . If is normal in , then , and precedes all indices of .
For , means ; hence and . This proves the claim by the stack identities. For , the unshifted walk is alive through . Shifting only cannot affect its earlier steps. To make at its final step, the shifted walk must pop its last surviving root: its prior stack therefore has height 1 and , with . In the original walk . Also by the last nonzero condition. Thus the original step is neutral, and the stack before consists only of . Since and is normal, is a nonzero-coordinate push; for every later position the walks based at and have identical events. The stack is consequently followed by , as claimed. This argument works in as well, since is always nonzero.
Consecutive-normal lemma. In a nonempty let be consecutive final stack entries. Then and . First normality of gives prefix normality and hence . Both final entries satisfy , so . Before is pushed, the stack based at has exactly its initial entry: any additional unmatched push earlier than would survive whenever survives (last-in-first-out pops cannot remove it before removing ), and would be an intervening final normal entry. The step is neutral in the original walk. Indeed ; if , then , and would be such an intervening surviving push. Therefore . Increasing by 1 creates exactly one final pop of the height-one stack, proving . The adjacent case is , giving directly. These conclusions also apply to normal sets under a shift at some final endpoint : when , their bridge intervals end before , so their constants are unchanged by the outer shift. The term is absent from , which is why this remains true even when .
For a -cut path , put . Retain exactly the cut points for which . Call the retained set . Partition into blocks between retained cuts. Every internal removed cut has prime-zero bridge; the next retained cut has prime-positive boundary. Repeated application of the bridge lemma, in the weight shifted at the next retained boundary endpoint, shows that the removed cuts in this block are precisely an initial segment of (excluding its first entry ), where . The final block is similarly an initial segment of , excluding . All these normal sets are nonempty, because the retained boundary has positive and the last condition makes the final root normal.
More explicitly, the block containing a removed-cut chain before a retained endpoint has and prime-zero between consecutive removed cuts, while . The last root is normal for the weight shifted at . Repeated bridge identities therefore make the first entries of . This proves the asserted initial-segment property and determines uniquely. The final block uses the same argument with unshifted .
Conversely, for any choose integers for , and . For every segment insert the first normal indices after its initial index, and include every retained cut . The consecutive-normal lemma proves each new bridge has the required condition and prime-zero value. Normality of the last inserted index proves up to the next retained boundary and a positive there; the final index is normal in its tail. Thus the result is a -cut path. Its retention operation returns exactly , and the initial-segment lengths return the chosen . The two constructions are inverse.
Hence there is an explicit bijection from -cut paths onto the disjoint union, over all , of sets of size , with size when . Together with the essential/path bijection already proved this proves that equals this weighted-cut sum. Grouping its nonempty cuts by their first point gives the complete local recurrence . This is the source item five point six, part (iv) seam established by finite injections/bijections, not by an essential-basis or branching citation.
Fix and consider indices . Let be the strictly upper triangular integer matrix for , and the strictly upper triangular matrix for . Apply to the interval in the dominant weight . Its first primed factor on , does not see the outer endpoint shift, so it is . The tail is . Therefore .
Since is strictly upper triangular, . Let and be column vectors with entries and . Equation is , so . Multiplying by gives . Component is precisely : . All entries are ordinary integers; only nilpotence and finite matrix multiplication are used. This is also the finite reverse-character-inversion arithmetic needed by the first-level construction. No division, characteristic-zero argument, or generic dimension count appears.
For , essential subsets consist only of and it is essential exactly when ; the normal set is then . Both sides are 0 or 1 accordingly. All endpoint and zero-coordinate cases are therefore included. Nothing in the proof depends on the prime beyond working in a characteristic- field for the zero tests and . The recurrence is uniform in arbitrary dominant coordinates and every root interval.
Remarks
The operators, coefficient recursions and raising pivots are integral before specialization. The basis and count recurrence retain arbitrary dominant polynomial weights, including the nonrestricted shifted weights used in first-level character inversion.
In the empty-set definition of , the highest coefficient is the product forced by the explicit action. The printed sum in the 1995 definition is not used; neither that misprint nor a source count theorem is a proof premise.
Kleshchev's first-level branching multiplicity
Statement
Let be a field of characteristic (every field is splitting for symmetric groups, so no algebraic closedness is needed) and let be a -regular partition of (p-regular and p-restricted partitions), so that is the simple head of the Specht module (Modular simple modules of the symmetric group). Let be a removable node of whose removal is again -regular, and call normal for when the transposed node of the -restricted partition is a normal node in the sense of Residue signatures, normal, good, conormal and cogood nodes (this is Kleshchev's normality; it is computed in the reduced signature of the correct residue class of ). Then if is not normal, and if is normal. Here is the residue and "above" means strictly smaller row index. Equivalently, the multiplicity is the piecewise integer . Thus is normal precisely when this piecewise multiplicity is nonzero.
Facts & Assumptions
Given: A field of characteristic , a -regular partition and a removable whose removal is -regular.
The actual Schur endomorphism algebra, normalized semistandard maps, weight projections and right corner action are those of The type-A q-Schur algebra and its Weyl modules and The Schur idempotent and the Schur functor for type-A q-Schur algebras. The complete Weyl-corner, form/radical and first-level comparison required here are proved inline below, without the held general comparison or any finite-e classifier.
The actual signed-conjugate bridge has unit form factor , equal to one at , and identifies ordinary Specht form quotients with signed conjugate Murphy form quotients. The published group radical criterion gives nonzero ordinary quotients exactly at regular partitions, distinctly labelled by those partitions (Ordinary Specht modules are the signed conjugate Murphy cells, p-regular and p-restricted labels under transpose and sign, Modular simple modules of the symmetric group, p-regular and p-restricted partitions, Nonzero modular Specht quotient criterion, The Murphy cellular basis, the cell law and the Murphy form, The standard basis of the generic type-A Hecke algebra).
The complete local interval-basis/count lemma supplies the integral negative cut words, positive detection, exact essential-subset dimensions, and finite matching recurrence for arbitrary dominant polynomial weights and all root intervals, including the last-coordinate increase of one (An integral essential-subset basis and count for type-A root intervals). Its proof supplies these properties over every field, without a characteristic-zero PBW or external count theorem.
The general cellular rank-one action gives simplicity, absolute simplicity and completeness of the actual nonzero Schur cell quotients (Nonzero cell heads classify the simple modules of a cellular algebra). The signature convention is Residue signatures, normal, good, conormal and cogood nodes, and restriction has its usual exact group-module meaning (Restriction, induction, and coinduction).
Proof
Use the actual Schur Weyl-cell simple , dominant polynomial, converted from right to left by star. Its highest vector has weight and norm . The local lemma [F3] proves from the tensorword endomorphism realization that negative coefficient operators span each weight space, positive coefficient operators detect every nonzero vector, and integral cut-root words span every grade whose simple-root coefficients are or . It also proves the complete essential-subset basis and the dimension formula , . The local lemma [F3] also proves for every dominant and every interval, by finite matching/path/stack bijections and finite triangular matrix inversion, , where . These are actual proved local inputs, including all zero dimensions and arbitrary nonrestricted auxiliary weights.
We spell out a further modular consequence of the same foundation to close the algebraic support seam. Let be a deficit with each simple-root coefficient or , with disconnected support separated by at least one zero coefficient. Take the first component entirely inside the Levi on the first coordinates. Every negative cut word of grade factors uniquely into a -word and a -word, since no root crossing a missing simple root can occur; the two groups commute. Every positive coefficient word of grade similarly factors. All positive/negative cross commutators between the separated groups vanish. Consequently the matrix of highest coefficients at is the tensor product of the two separate coefficient matrices at and : for positive tests and negative words , . The rightmost separated test/word leaves the Cartan coordinates of the other interval unchanged, since the intervals are nonadjacent; this verifies the displayed equality even though has shifted weight.
Choose bases and of the separate images. Positive detection yields positive linear-combination tests and with , , by finite matrix inversion over the field. Thus the products are independent, since tests detect their coefficients; they span by the preceding factorization. On the entire weight space at the operator is the identity: applied to , its cross commutations give . Every is a positive Levi coefficient word of nonzero weight , and every is a negative Levi coefficient word. This argument proves the identity on arbitrary entangled linear combinations, not only pure products. If a separate image is zero, the full weight space is zero and cannot supply a primitive vector.
Now let be consecutive terms of a finite composition series of the first level, and choose representing the highest vector of a simple factor, of full deficit . Positive Levi operators of nonzero weight send into , because they annihilate its highest class. If had a disconnected initial component , the identity would put into : and preserve . This is impossible. Hence any primitive factor vector of binary deficit ending at the last simple root has support a single terminal interval. This is the disconnected-root primitive exclusion, proved here, without a characteristic-zero PBW theorem or a pure-product assumption for .
Suppose and let . Define the first level as the sum of weight spaces of whose last diagonal coordinate is . It is a polynomial Schur/ module of degree ; the Levi preserves that coordinate. Put . For any write , as a weight, and write , when is dominant, and otherwise. Dominance of is equivalent to . No modular restriction condition is imposed on a dominant . In particular non--restricted factors still contribute to all character equations below.
A simple factor contributing to the weight must have highest weight dominating . The standard Schur cell simples have unique highest vector, all other weights dominated by it, and cover all simple Schur modules by the cellular regular-module argument. Thus this statement applies to every factor over every field. Lift by appending the last coordinate , and let . Since is a weight of the first level, is a nonnegative integral combination of simple roots; since dominates , is a nonnegative integral combination of Levi roots. Consequently for , for , and . The support exclusion just proved forces for some . Thus and must be dominant. Only these terminal labels can contribute to this character equation; no stronger assertion about the other first-level factors is needed.
Weight-space dimensions are additive on a composition series. Indeed the actual weight idempotents give direct projections, so taking a fixed torus weight is exact. The own highest weight of , when defined, has dimension . Thus , . For an invalid its term is omitted. The lower weight deficit is . The fundamental coordinates of on that interval are . Any altered coordinate at is outside the interval and has no effect on the local formulas. The proved interval-basis theorem therefore gives , . This is valid for every legitimate dominant , including those not -restricted. When , is nondominant and ; also because its root is not normal.
Substitute these dimensions into the character equation and compare it with the local recurrence of [F3] at : , . Starting at and proceeding downwards proves for all . This is finite integer reverse substitution, never reduction of the character multiplicities modulo . The rank is , unrelated to the prime except in the zero tests.
The local lemma [F3] uses only the infinite purely transcendental extension for polynomial identities and Gaussian elimination. Its scalar-extension argument is reversible: all cut/raising matrices have entries in , hence their finite ranks and kernels preserve extension; its essential labels and pivot tests yield bases over itself. Schur cell simples remain simple under every field extension by the cellular rank-one action and their nonzero form. Extending a finite Schur composition series thus retains the simple factors and their labels, so the integers computed over are exactly those over . The first-level weight subspace commutes with extension because it is the image of a finite sum of weight idempotents. Neither an algebraic closure nor an assumption that the original field is infinite is used. All nil/zero-weight cases remain in the equations.
Let be -regular, , put , , . The index of is , not , and not . The coordinate is the multiplicity of the part in ; in particular , but the preceding algebraic proof did not need that restriction. A removable is the last row of its width block, hence .
The root normal walk based at starts with a push for and scans . At coordinates with the compensation walk is neutral, even when : the same position supplies and consumes a compensation slot. At positive coordinates , the last ordinary row of the width block gives a removable node, and . Thus is exactly the removable node's residue equal to 's residue. The first ordinary row of the width block has an addable node in column , and . Thus is exactly that addable node's residue equal to 's residue. Since at a positive coordinate, shows these two events cannot occur together at that same . Empty widths give only the neutral compensation case. The artificial final zero-width row also has no effect. Scanning positive in increasing order lists the ordinary corners above in the order , with a width block contributing its boundary event when the residue matches. The top extra addable node of width is already the event of the width coordinate; no boundary event is omitted.
Under transpose a removable ordinary node becomes a removable -node of opposite residue, and an addable becomes an addable of opposite residue. The top-to-bottom -signature following lists exactly these above ordinary nodes in this order. The only possible equal-column lower ordinary addable node lies immediately below and has residue differing by , so it is absent from this residue class. Consequently the root push/pop walk is exactly the reduced-signature stack after : push a removable , pop on an addable , implementing cancellation .
Earlier signature signs do not change whether or any later push is removed. survives precisely when no later prefix has more pops than pushes; this is exactly root normality . If it survives, the final stack consists of together with those above ordinary removable nodes in 's residue class whose transposes survive as normal nodes. The stack proof of [F3] identifies this final stack with , so if is not normal, and if is normal. The node count here is piecewise. It is not the unconditioned count of normal nodes weakly above when is nonnormal.
Work at with right Schur modules, reversing the star conversion used for the algebraic count. The Hecke presentation has and the symmetric-group braid relations; its standard basis maps bijectively to the group basis , so . Let be the weight projection of type , with via . The normalized semistandard map is supported from to . Thus survives exactly when both types are . These tableaux are ordinary standard tableaux, their defining fibers are singleton, and evaluation at gives . The higher Schur ideal corner is exactly the higher Murphy ideal, as equality of the corresponding basis spans. The projection on a Weyl cell fixes exactly for . To read its right action, choose the independent fixed outer index also of type ; evaluation at then turns into modulo the corresponding higher ideal. Hence by , with the actual same-shape Murphy action, over every field.
Choose all four indices standard of shape and type in the Schur cell product . Evaluate every map at in the corner. The Murphy product is , so its independent cell-product coefficient gives . The scalar is exactly . Since , contravariance gives . Thus the Weyl decomposition is orthogonal, and , including an identically zero corner form. The canonical shape/type diagonal is the projection onto and is idempotent, so the same cell-product coefficient gives canonical norm ; is nonzero simple. Projection by is exact (lift by , and kernels are intersections fixed by ), so , including zero. At the unit form comparison [F2] gives when is regular, and zero otherwise by the published ordinary radical criterion. These nonzero quotients are distinctly labelled group simples. This proves restricted survival locally and uses no general finite-e classification.
Take and the tensorword realization of already proved in [F3]. Let be the sum of all actual weight projections with last coordinate . Its tensorwords have exactly one occurrence of . Identify their remaining ordered positions with . For each lower Schur orbit matrix , define , where the last row and column have only their final entry . On every word with one this map preserves its position and applies to the other positions. Consequently products are exactly the lower products, , and embeds as a unital subalgebra of . This describes the lower Schur action on , and for the star-converted left simple it is exactly the block-diagonal action used in the character calculation, because expands in and acts at the unchanged position. Transpose sends to , so respects star. The first level counted above is therefore precisely , converted to the right; no source-only definition of first level is being substituted.
Let be the lower regular-type projection . In this embedding , the full type projection. Use the explicit coset-word map . On the regular type its jth letter is , in right permutation notation. Consequently changes a regular word by the corresponding label permutation , because . A lower corner element acts by this same label permutation on and fixes label . The orbit embedding therefore gives exactly on the full regular tensorword basis, with no extra inversion or opposite-algebra map. Thus , with the subgroup action in the right convention exactly . Consequently as -modules, with the latter the ordinary restriction of . Apply this to . This is the complete local first-level/corner identity; it is independent of the held generic comparison.
Apply the exact lower projection to a finite composition series of . Each factor becomes , proved by the lower-rank form/corner calculation of steps 14.1–15.1; it is a distinctly labelled simple when is restricted, and zero otherwise. Deleting repeated terms leaves a composition series of the group restriction corner. Thus the multiplicity of a restricted agrees exactly with its lower Schur multiplicity. Nonrestricted were retained in the earlier character calculation and are killed only here. For , [F2] gives . The candidate is restricted by the regular-removal hypothesis, and its image is . Hence the desired group restriction multiplicity is . Twisting both modules by sign preserves multiplicity because sign of restricts to sign of . To match a left-module convention for the ordinary in the Statement, apply the exact inverse/star equivalence from right group modules to left ones, . It commutes with restriction and sign twisting and preserves composition series. The ordinary polytabloid quotient is the same partition-labelled quotient in this convention; if the dictionary uses its contragredient realization, the induced nondegenerate invariant quotient form identifies that simple with its contragredient. Explicitly is bijective and equivariant since . This uses the form only after passing to the nonzero radical quotient, as in Modular Specht form and radical quotient; no self-duality of a possibly degenerate Specht module is assumed. Together with the algebraic count and signature calculation, this gives both displayed cases of the theorem.
For the ordinary simple is trivial and restricts trivially, so the unique removable node has multiplicity . Its transposed node is normal: no subsequent same-residue addable can cancel it, and the preceding possible addable gives a pair rather than a cancellation. There are no above ordinary removables. For this is the one-dimensional restriction to ; for the removable-node hypothesis is empty. These cases avoid requiring where it is false. All primes, all fields of characteristic , all -regular and all regular removals retain the original stated scope.
The piecewise integer times the number of normal nodes weakly above has value zero off normality and is at least one on normality, since itself is counted. The preceding multiplicity and boundary proofs therefore establish both the formula and its stated equivalence over every field of characteristic .
Remarks
The proof supplies the full local first-level count and signature calculation. The source Theorems 9.3 and 1.4 document its origin and are not proof premises. The rank is and the root interval starts at ; the prime appears only in zero tests. All lower dominant Schur factors, including nonrestricted ones, are retained until the exact corner functor kills their images. The former unconditional above-count equivalence was false: for , , , is nonnormal while a normal node of its residue exists above it. The piecewise correction preserves both original displayed cases.
Normal-node composition multiplicities under residue restriction
Statement
Let be a field of characteristic , a -restricted partition of and a removable -node of such that is again -restricted; let be the simple -module labelled by in the dual-Specht (cellular) convention, so that (p-regular and p-restricted labels under transpose and sign, Modular simple modules of the symmetric group), and let be the residue-summand functor of Generalized Jucys-Murphy primary idempotents and the residue-summand functors , . Then if is not a normal -node of , and (counting itself) if is normal. The corresponding Specht-to-restriction Hom criterion (Brundan 1998 Theorem 2.5, equivalently Kleshchev II Theorem 0.4) is a distinct statement and is not asserted here.
Facts & Assumptions
Given: A field of characteristic , a -restricted partition of , a removable -node with -restricted, and the residue-summand functor .
, and is the sum of the generalized eigenspaces of the last Jucys-Murphy element with eigenvalue , for every finite-dimensional -module ; here is the transposition class sum of (Generalized Jucys-Murphy primary idempotents and the residue-summand functors , , The Jucys-Murphy elements of the symmetric group algebra).
The central transposition class sum acts on the ordinary integral Specht lattice and every field specialization by the total content (The transposition class sum acts on a complex Specht module by total content). At , both the class sum and total content are zero directly. The actual same-shape perfect pairing identifies the Murphy cell with the star dual of the ordinary Specht module (Murphy cells are the same-shape contragredient Specht duals). Since , the same scalar acts on that dual and its nonzero form quotient . This uses the ordinary module itself, not a false ordinary/Murphy equality of form radicals.
For a -restricted , the module is nonzero, simple, self-dual and absolutely irreducible, so every -endomorphism of is a scalar (Modular simple modules of the symmetric group, p-regular and p-restricted labels under transpose and sign).
The complete locally proved piecewise count is Kleshchev's first-level branching multiplicity. For the ordinary regular label and the transposed removable node , its multiplicity is zero off normality and counts the same-residue normal nodes weakly above on normality. The group sign/conjugate dictionary and signature order in [F5] transport this exact count; no bibliographic normal-node theorem is a proof premise.
The dictionary between the two conventions: transposing exchanges removable nodes of with removable nodes of , exchanges "strictly above" for the dual order of the same residue class, and negates residues, ; ordinary normality on in Kleshchev's first-level branching multiplicity is defined by signature normality of the transposed node on . Brundan's lattice convention instead agrees with our signature on the same restricted shape, with residue names negated (Residue signatures, normal, good, conormal and cogood nodes, p-regular and p-restricted labels under transpose and sign).
Proof
Localization of an occurring factor. On the class sum acts by by [F2], hence it acts by that scalar on the whole restriction. The operator on this restriction is therefore , a central operator preserving every submodule. If occurs as a composition factor, [F2] gives its scalar . Thus acts on this factor by . The generalized primary projections are exact by [F1]; every occurrence of this factor lies in , and none in another summand. Consequently , also when both sides are zero. This does not assert that a factor occurs before its multiplicity is computed.
Apply the local count [F4] to and the ordinary node . The group dictionary is and likewise for ; sign restricts to sign, so simultaneous twist preserves the restriction multiplicity. Transposing negates residues and reverses the order of corners in a fixed residue class, as [F5] states. The ordinary piecewise formula is therefore zero when is not normal, and otherwise is the number of normal -nodes weakly below , counting itself. Combine this with step 1.1. The unconditioned weakly-below count is not used off normality.
For and , the normal residue- nodes are and ; the same-residue signature has the two minus signs and no plus sign. The two respective regular removals give multiplicities and by step 2.1. At degree one the same argument gives the one-dimensional restriction to ; degree zero has no removable node. Thus the boundary cases and both displayed cases are included. No Specht-to-restriction Hom criterion is asserted.
Remarks
The complete count proof is the local first-level supplier, built from the integral root-interval basis and finite essential-subset recurrence. The cited Kleshchev and Brundan papers document the historical source of this formula; they are not external proof premises. The new local contribution here is the conditional class-sum localization and the exact transpose/sign transport. No unconditional count or implication from a zero form quotient to a zero actual module head is used.
Conormal-node composition multiplicities under residue induction
Statement
In the notation of Normal-node composition multiplicities under residue restriction, let be an addable -node of the -restricted partition such that is again -restricted, and let be the residue-summand induction functor of Generalized Jucys-Murphy primary idempotents and the residue-summand functors , . Then if is not a conormal -node of , and (counting itself) if is conormal. The dual Specht-to-induction Hom criterion (Kleshchev survey Theorem 11.7(i), Brundan 1998 Theorem 2.5 dual form) is a distinct statement and is not asserted here.
Facts & Assumptions
Given: A field of characteristic , a -restricted partition of , an addable residue- node such that is -restricted, and the actual residue induction functor .
The actual Schur coefficient foundation and root-interval basis/count supplier holds over every field, for arbitrary dominant polynomial weights and all intervals. Negative coefficient words span, positive coefficient words detect, binary-root weight spaces have dimension , and the finite integer recurrence is , with . Its normal-stack proof includes zero coordinates and killed roots (An integral essential-subset basis and count for type-A root intervals).
The proved local Schur/group corner in steps 14.1–15.1 of Kleshchev's first-level branching multiplicity identifies the regular Weyl corner and cell form with the Murphy cell and form, with scalar , and proves equality of their radical corners. Thus for restricted and is zero otherwise; surviving labels are distinct. Its tensorword convention is explicit, and its proof uses ordinary-group survival rather than the held finite- classifier. The integral ordinary Specht basis and signed-conjugate identification are Ordinary Specht modules are the signed conjugate Murphy cells and p-regular and p-restricted labels under transpose and sign.
On the complex ordinary Specht module, the joint Jucys–Murphy spectrum is the tableau-content spectrum (The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors). Only its integral central operator-identity consequence is used, not any characteristic-zero composition count.
The boundary signature is read top to bottom with addable , removable and cancellation (Residue signatures, normal, good, conormal and cogood nodes). The actual primary projections define the direct residue decomposition of induction (Generalized Jucys-Murphy primary idempotents and the residue-summand functors , ). Neither primitive-block classification nor an adjunction transfer of composition counts is used.
Proof
For take , pad by zeros, set , let be the actual Schur simple, , and . Tensor coefficient operators are the actual polynomial Schur operators of degree , obtained by multiplying the two polynomial matrix actions. This works over finite fields without replacing coefficient actions by evaluated group elements. The case is treated below.
Here is the local component identity used below. If a binary root deficit has separated connected components (a zero simple-root coefficient between consecutive components), its negative words split into products supported on those components. All cross-component positive and negative root operators commute, and their Cartan characters on the other component are unchanged: their simple-root supports are nonadjacent. Move the positive words past the other components and evaluate their highest coefficients one component at a time. The positive/negative coefficient matrix is consequently the tensor product of the component matrices. Negative-word spanning and positive detection identify its quotient by the common positive-test kernel with the actual simple weight space. Hence this weight space is the tensor product of the component quotients, including when one is zero. This proves the assertion directly from coefficient words; it does not assume a tensor-product decomposition of the whole simple module.
In particular fix one component . Choose a negative basis of its quotient and positive tests dual to it. They are finite linear combinations of actual coefficient words, with coefficients in ; their existence follows from positive detection and ordinary finite-dimensional linear algebra. Then is the identity on every binary weight space having this component and any separated other components. The same tests apply because the other components change none of the Cartan data of . If , these weight spaces are zero. This is an identity of coefficient operators on those spaces, so it descends to subquotients.
Write . Suppose a simple composition factor with highest weight contributes at . All weights of are at most , and weights of that factor are at most . Thus
The deficit has simple-root coefficients or in positions and zero elsewhere. On a tensor summand the deficit in is
It must be nonnegative. Consequently every possible label lies before the first missing coefficient in . If has a component after that first gap, every positive or negative coefficient word supported on fixes the factor (its nonconstant terms annihilate each of these labels). Its action on this tensor weight is therefore purely its action on . The preceding is the identity on the entire weight , not just on individual tensor summands.
Choose a composition series and a lift of the nonzero highest vector of the proposed factor in its series quotient. Each lies in the preceding submodule because it has strictly higher weight, and each preserves that submodule. But would then place in it, a contradiction. If the component quotient is zero there was no such tensor weight to start with. Thus has no later component. Its only possible nonzero coefficients form one initial interval, and
This excludes only highest weights of factors contributing to . It asserts nothing about distant tensor factors.
Since every weight of is at most ,
Let be the actual composition multiplicity of in when that weight is dominant; set otherwise. No restrictedness condition is imposed on these auxiliary factors. The support lemma and the one-dimensional highest spaces give (equation C).
Indeed . On this interval the fundamental coordinates of the dominant weight are those of with its first coordinate increased by one; the coordinate changed by minus one lies outside the interval. Nondominant rows have multiplicity zero, so their formal summands cause no alteration of (C).
For completeness the weight-dimension symmetry needed here is local. Permutation matrices permute the integer weight spaces of . Hence its lowest weight is , its space is one dimensional, and every weight lies between and . The contragredient dual twisted by is a polynomial simple of highest weight
One can verify polynomiality without a rational-module classification theorem. The tensorword Schur algebra acts faithfully on ; its regular module embeds in a finite direct sum of copies of this tensor space by its action on a basis. Thus every simple is a subquotient of copies of this tensor space. Duality and the twist make it a subquotient of ; the explicit exterior-complement pairing gives over every field. It is therefore polynomial. Positive and negative coefficients interchange under duality, so the highest weight just identified determines the same actual Schur simple as in the accepted foundation. These statements are coefficient identities; over a finite field they can equivalently be checked over and descended as the identical finite matrices.
Put . Duality reverses roots and preserves weight dimensions, yielding
This argument applies also to any dominant shifted weight. In particular the first-coordinate shift at becomes the final-coordinate shift at on the reversed interval. No restriction on its fundamental coordinates is needed.
Reverse the indices: , , . On indices , let the strictly upper triangular matrices be
For , apply the accepted recurrence to after increasing coordinate . Every earlier interval with is unaffected, while the tail normal count is shifted at . Thus , or . Hence . Since these are finite integer matrices, the inverse is two-sided and . Equivalently, the supplier's first-cut recurrence gives and .
Let , with . Applying the accepted recurrence separately for every endpoint and summing gives
Opposition turns (C) into . Multiplication by gives, as ordinary integers, (equation D).
This is finite nilpotent matrix arithmetic. It neither divides in nor replaces a composition multiplicity by a residue in .
Use the accepted normal-stack interpretation; every coordinate and equality tested in this paragraph and the endpoint analysis is modulo , whereas stack heights are ordinary integers. Write for its alive indicator and put . For every dominant coordinate array , (equation E).
If killed before the final step, both counts are zero. Otherwise let its current height be . The endpoint shift keeps fixed and replaces and by and . If it creates a pop and lowers the count by one; when , the unshifted step instead pushes and the shifted zero-coordinate step is neutral, with the same difference. If it removes a pop and increases the count by one; when , the old step is neutral and the new step pushes, again with that difference. For other neither change alters the count. If a pop removes the initial root, its new count is zero, still . At the two counts are and , giving the same formula. These alternatives are exhaustive and valid for .
Fix an actual addable row and put , . If , addability means . Since is restricted, ; the reversed root therefore starts alive. For , , direct substitution gives
Thus the two indicators in (E) respectively detect an addable-position residue in row and a removable-position residue in row . The normal stack processes the boundary in reverse order, starting with the chosen in row . At step its push corresponds to the plus in row , and its pop to the minus in row . The top-row plus is a pending final event. This reversal is exactly the stack evaluation of cancellation: in a reverse scan, a minus cancels the most recently encountered plus.
Here is the precise check at flat row blocks and at the endpoints. Let
While the chosen root remains alive, is its current normal-stack height plus the pending indicator , where . At the initial step the removable event cannot occur since , and this identity follows immediately. At each subsequent live step the change in height is
For these are disjoint push/pop events. For the indicators are equal and the step is neutral, as required by the actual stack. Subtracting this height change from the change in gives
which replaces the previous pending indicator by the next. This proves the invariant by induction, including flat blocks. Equivalently, at each flat boundary , the virtual removable sign in row and virtual addable sign in row have the same residue and form an adjacent pair in the selected-residue row-boundary word. Deleting these pairs restores exactly the actual boundary word. By signature confluence their insertion or deletion has no effect on the surviving actual nodes. The chosen node is an actual addable, so it is never among the virtual pairs.
If the initial root is killed, its preceding height was one, the current event is , and is false. The pending indicator after the step is zero. Thus , and every later term is zero because the alive indicator remains zero. In the reversed boundary scan, killing the initial plus likewise means that the chosen node is canceled; later pluses above it cannot revive it. At the last step the pending indicator is the actual addable top-row plus. We have therefore evaluated exactly the reverse scan of the prefix ending at the chosen node. A minus below this prefix cannot cancel a plus in it under top-to-bottom cancellation; the conormal decisions for this prefix agree with those in the entire signature.
Consequently (D) is zero precisely when the chosen plus is canceled. If it survives, (D) is the number of surviving pluses of residue in the prefix, namely the number of conormal nodes weakly above . For , (D) is : the top plus survives and it is the only node weakly above itself. For completeness, a nondominant row has ; the first endpoint difference is , killing the virtual initial unit and all later differences, so (D) gives zero as required by (C). These rows were not silently discarded during the integer inversion.
Let be the regular degree- weight. Then
Let , fixing label , and . The accepted local corner/form calculation applies to degree and rank with regular weight : its surviving semistandard indices are precisely standard tableaux, and evaluating the corner at gives the same Murphy basis and scalar- form, regardless of the unused last label. Its radical-corner equality therefore makes the left group module . To fix the action convention, the supplier's right corner element permutes tensorword labels by ; star conversion makes left act by right , hence by label permutation . The same conversion in the degree- corner gives the output action. Thus the output regular-corner action is ordinary permutation of labels: on tensorwords the corresponding orbit matrix is exactly that label permutation. Since these are identities in the actual tensorword Schur algebra, the same equality holds on ; it does not depend on evaluated permutation matrices spanning the Schur algebra.
The explicit map .
is well defined and -equivariant. Left cosets of correspond to the image label , and their summands map bijectively to the displayed summands of . It is therefore an isomorphism. This proves , without Frobenius reciprocity or an adjunction multiplicity assertion.
Corner projection is exact. Each Schur composition factor projects to the distinct restricted group simple if is restricted, and to zero otherwise, by the accepted local form/radical and ordinary-group survival proof. Hence for a restricted , its total induction multiplicity is exactly . Nonrestricted near factors were kept until this exact projection. Distant factors were never excluded; distinct surviving labels ensure that they cannot change this particular count. When , the single degree-one tensor/corner gives the unique plus and multiplicity one directly.
The generalized Jucys--Murphy induction summands give a direct decomposition of total induction. For the ordinary group elements , induction by inserting the letter into a cycle gives the integral identity
The factor makes a new fixed point; each transposition inserts at the uniquely specified place in the cycle containing . These alternatives are disjoint and exhaust the permutations. Coefficients on the right are class sums, so all coefficients of are central over the integers and every field.
The published The joint spectrum of the Jucys-Murphy elements is the set of tableau content vectors says that acts on the complex ordinary Specht module of shape as . The ordinary integral Specht lattice has the free polytabloid basis provided by the accepted integral bridge. The operator equality has integer matrices on that lattice; its validity after scalar extension to therefore implies its validity over . Reducing and taking its radical quotient proves the same content scalar on ordinary over every field. The accepted signed-conjugate dictionary sends each to under the sign twist, and transpose negates contents. Hence acts on restricted by the content polynomial of . This use of the published complex spectrum is an integral operator-identity descent; none of the multiplicity inversion uses characteristic-zero composition counts or semisimplicity.
Let be the multiset of residues of . The exact central content polynomial on and the central CRT description of the content sums give ; this requires no primitive-block assertion. For clarity the functor idempotent implies the following test on . On its generating subspace , the first- content polynomial has exactly the scalar for , and is nilpotent. These operators commute and for a fixed primary exponent . A coefficient of is central by the integral identity. On it is the corresponding scalar coefficient of times : balance the first- central coefficient across into . Centrality lets this same calculation iterate, so . Since the whole module is generated by these vectors and commutes with every group translate, is zero on the whole module. On a simple factor a nilpotent central endomorphism is zero, since every nonzero simple-module endomorphism is invertible. Thus every factor in this summand has content polynomial .
Distinct residues give distinct polynomials: for . The content polynomial of appends exactly the residue of . Its factors therefore occur only in the corresponding residue summand. The total multiplicity computed above is exactly the multiplicity in required by the target. This argument does not use primitivity or exhaustiveness of any content-block idempotent.
Transpose preserves boundary types. Literally
It sends an addable node to an addable node and a removable node to a removable node; it negates the residue. The appropriate boundary reading order is reversed when transporting the signature convention. It does not exchange addable and removable sets. The proof above needs no claimed equality of induction and restriction multiplicities and no transpose transfer of a restriction count.
The finite character inversion, boundary-stack calculation, exact induction corner and residue allocation just proved identify the stated multiplicity with zero off conormality and with the conormal weak-above count on conormality. Both cases hold over every field of characteristic , with nonrestricted auxiliary factors retained until projection and no assertion about other tensor factors.
Remarks
The survey documents the formula's origin; its count is not a proof premise. Biadjunction does not equate these composition multiplicities: in characteristic , induction of to has multiplicity of , whereas restricting that simple has multiplicity of . The proof instead uses actual tensor weights, finite integer inversion and an explicit coset map.
The cogood node gives the simple socle and head of the residue induction
Statement
Let be a field of characteristic , a -restricted partition of and with ; let be the cogood -node and (Residue signatures, normal, good, conormal and cogood nodes). Then has simple socle and simple head, both isomorphic to , and the total (ungraded) multiplicity of in is (Generalized Jucys-Murphy primary idempotents and the residue-summand functors , ).
Facts & Assumptions
Given: A field of characteristic , a -restricted partition of , a residue with , its cogood node , and .
The integrated Schur endomorphism algebra has normalized semistandard cell maps and actual weight projections, and the right corner is transported by (The type-A q-Schur algebra and its Weyl modules, The Schur idempotent and the Schur functor for type-A q-Schur algebras). Nonzero cellular form quotients are absolutely simple and classify the simples; canonical Schur norm one makes all Schur labels nonzero (Nonzero cell heads classify the simple modules of a cellular algebra). All corner and socle-lifting assertions needed below are proved locally.
The accepted integral root-interval supplier gives the operators, splitting identity (P), zero criterion (Z), matched norm (M), and triangular hats, including distinct essential hats and the essential-regular characterization of root normality (An integral essential-subset basis and count for type-A root intervals). Its global tensor/positive-detection foundation is recalled explicitly below; no characteristic-zero PBW or strong-linkage premise is used.
The independent Murphy datum and signed-conjugate module/form bridge have form factor one at (The Murphy cellular basis, the cell law and the Murphy form, Ordinary Specht modules are the signed conjugate Murphy cells). The published ordinary group form criterion and classification give distinct absolutely irreducible quotients exactly at regular labels, with nondegenerate invariant quotient forms (Nonzero modular Specht quotient criterion, Modular simple modules of the symmetric group, Modular Specht form and radical quotient). Thus the restricted convention is obtained through the actual sign/inverse dictionary, not a finite- Hecke classifier.
The complete locally proved Conormal-node composition multiplicities under residue induction gives, over every field of characteristic , zero multiplicity off conormality and otherwise the number of conormal -nodes weakly above the restricted addition . The recovered reviewer independently verified its tensor-weight support, integer opposed recurrence, boundary-stack evaluation, actual induction corner and central-content residue allocation on the guarded companion proposal. Only the final total-multiplicity step uses this interface.
Normal/good and conormal/cogood mean the surviving signs, first surviving minus and last surviving plus in the top-to-bottom reduced signature (Residue signatures, normal, good, conormal and cogood nodes). Primary projectors are commuting polynomials in the Jucys-Murphy elements, inverse fixes them, and commutes with (Generalized Jucys-Murphy primary idempotents and the residue-summand functors , ). Their needed content/adjunction interfaces are proved locally below. A self-dual finite-dimensional module has head dual to socle (The radical, socle, head, and Loewy series of a finite-dimensional module).
Proof
We first establish the restriction endpoint locally. Work with left Schur modules through star. In tensor degree , the word of has th letter the row containing in ; at regular type it is , with zero-multiplicity labels omitted. Over the evaluations span the tensor Schur algebra: a functional killing them gives a polynomial zero on invertible matrices; multiplication by and the infinite-field polynomial identity force that polynomial to be zero. Schur simples are therefore simple polynomial modules. The canonical shape/type diagonal is its permutation-summand projection, whose square gives canonical form value one. Semistandard column strictness bounds entries at most by the first rows, so all weights are dominated by the highest weight and the highest space is . Integer torus characters, rather than Lie eigenvalues modulo , distinguish these weights.
Gaussian factorization on the big cell shows that negative coefficient operators on span its simple module: a functional killing them kills on that open set and hence everywhere by polynomial identity. Similarly, positive coefficient operators detect every nonzero vector of weight . If every positive highest coefficient vanished, the highest coefficient of would vanish on the big cell, because negative operators cannot raise any weight to ; it would then vanish on the orbit of , which spans the simple and contains . All coefficient operators have integral tensor replacement matrices, and the ranks and Hom kernels of finite matrices preserve extension from to . These arguments consequently descend to .
Let , , and let be the full last-coordinate-one subspace of . A primitive vector means one killed by every nonconstant coefficient of the upper Levi unipotent group, not merely by its Lie generators. Factor the full upper group as , where has only the last column above the diagonal nontrivial. A positive test of a Levi-primitive vector acts only through , since the right-hand nonconstant Levi coefficients kill it. Raising last coordinate to highest coordinate requires a monomial of degree exactly one. Positive detection therefore gives for some . Hence , where , even when the initial first-level deficit was arbitrary. On that primitive weight space is injective by the same detection argument, so its dimension is at most one.
Put and use and . For nonempty , the canonical kills a primitive vector: if , its ascending-prefix letter commutes past the remaining ascending letters, whose indices exceed , and becomes a rightmost Levi letter with . Expand a nonzero primitive vector of weight in the essential basis and select the largest hat among its nonzero coefficients. The triangular pivot isolates a nonzero term. That hat cannot be nonempty, since its test would annihilate the vector. Distinct essential hats therefore leave exactly one essential set with empty hat. Empty is linked precisely to a regular set, and the essential-regular matching theorem says such a set exists precisely when is normal. This proves necessity of normality.
Conversely, for normal let and choose its compensation with and . Put . The inverse matching makes regular, so its hat is empty. The matched norm is : , and removes exactly the other zero factors. Thus is nonzero, and the maximal-hat assertion gives for every nonempty . For , every positive test of has grade . Expanding its root matrices into simple words and appending the rightmost gives full words with nonempty canonical index, since acts before . All highest coefficients vanish, so positive detection gives . For the target weight is outside dominance below and is zero. A nonconstant Levi coefficient whose weight is not bounded by likewise has zero target. At a weight bounded by , root-variable exponents are at most one, so the coefficient is a product of positive root matrices, each an iterated simple-root commutator; its rightmost root kills the vector. This proves full group primitivity. The primitive line at is consequently one-dimensional exactly at normal , and we denote any nonzero vector on it by .
We separate primitive labels integrally, including . In tensor degree for Levi rank , put and define to act on a weight by the integer reduced in . Concretely it is , with no division by in . The tensor action of the group central transposition sum satisfies the exact integer identity . The equal-position part of is ; after subtracting it, the terms are exactly the two swaps of unequal labels. The diagonal terms count equal-label pairs. Since commutes with the position group and every Schur endomorphism, this operator belongs to the Schur algebra and is central.
On a primitive vector of dominant weight , kills it for , so acts by . Therefore has scalar . The binomial here is the actual diagonal weight operator of step 6.1. Centrality makes this scalar constant on the cyclic module generated by the vector. For first-level , it is , so . Thus the cyclic Levi module generated by cannot contain another primitive when . Equality of the scalars alone does not prove simplicity; we treat it explicitly next.
Suppose are normal and . Choose for the demands of as in step 5.1. For , , and . The demands of split into and . Compensation for , inherited from normality of , has image below . Since , all those targets and lie at most . Combining their matching with gives compensation for every demand of , so choose and . For each its matched gives , hence . If and , then .
Splitting (P) gives . The last term is zero. The middle term has a (Z) witness with endpoint , outside its cuts because and . Removing matched source releases its zero- target ; assign to and retain the matching on . All distinct bounded targets are below . Hence that term is zero as well. For , (P) omits the middle term and its last coefficient is . In both cases , without a field denominator.
The Gaussian argument on a cyclic module, without assuming simplicity, shows that is spanned by negative Levi coefficients on and has weights at most . Any nonzero proper Schur submodule contains a simple Schur submodule and thus a primitive by step 3.1. Dominance gives . For , its one-dimensional line is the generating line and would generate all of ; thus a proper submodule has , and the central scalar requires . Conversely, such an earlier normal gives a proper nonzero by step 9.1, since its weights are at most . Consequently is simple precisely when is normal with no earlier normal satisfying . All simple Schur submodules of are exactly these , each once: every simple has a primitive highest vector, and each primitive line has dimension one.
Now assume restricted. The root criterion is its physical signature criterion: identifies the removable node in row ; scanning , a nonzero gives a removable push if and an addable pop at row if . These events have the residue of row ; at the matching slot supplies and consumes itself and is neutral. For , the two events are disjoint. The compensation-prefix inequalities are exactly survival of the initial push in the signature stack. Also compares the residues. Thus the simple cyclic modules in step 10.1 are exactly at the good nodes. Their lower labels are restricted: removing row decreases by one and increases by one. The only failure, when , would be . Then , and is also normal, since its later demands are those of , , and the compensation for is also valid for . This contradicts goodness. Hence every Schur socle factor survives the restricted-label corner; no assertion is made about the other composition factors.
To transfer without a held generic classifier, for choose and the regular composition , so even for columns. Compute the cell corner temporarily in its original right-module convention, then transport through star. Its permutation summand is , and its actual projection gives via . Type- tableaux correspond to standard tableaux by increasing relabeling to . Their normalized map fibers are singleton, and evaluation at sends to . Higher ideals correspond as equality of corner basis spans. The Weyl weight projection keeps exactly these basis vectors; read its cell action using a fixed outer index of the same type and evaluate at to get the Murphy action. Thus with the actual same-shape normalization.
In the Schur cell product choose all four indices standard of type . Evaluation at turns into , so the unique Murphy coefficient gives . The factor is one. Since , the Weyl splitting is orthogonal, giving , including zero corner forms. Projection is exact by lifting through and taking kernels fixed by . Hence . The actual form-unit bridge identifies it with , nonzero exactly when is regular. Transporting these right-cell identities through star gives the corresponding left corners and used below. Their nonzero images are exactly the distinct absolutely simple restricted-label modules , with the inverse group convention fixed by the nondegenerate quotient form.
Let be the sum of actual weight projections with last coordinate one, so . The lower Schur orbit matrix embeds as ; on each word with one it preserves that position and applies to the remaining ordered positions. Products agree and the lower identity is , and transpose/star is respected. The lower regular projection of maps to . On the coset-word convention of step 1.1, acts by label permutation on the used lower labels, fixing , identically to for the subgroup fixing the last entry of . Thus, in the left convention, . Write for this lower Schur algebra; every socle and corner lift of below is over . The inverse/star equivalence passes between right and left modules and commutes with this embedding, restriction and sign; the ordinary simple labels are fixed by their nondegenerate invariant quotient forms. No self-duality of a degenerate Specht module is assumed.
Socle preservation requires more than exactness. By step 11.1 every Schur socle simple of survives . A nonzero Schur submodule killed by would contain a simple submodule inside that socle, whose corner is nonzero, a contradiction. Now a group-simple injection corresponds to , , . Its image is generated by its corner . A proper Schur submodule of has either , excluded by the no-killed-submodule property, or , which generates and forces . Thus is simple. Every group-simple corner submodule lifts to an actual Schur simple submodule, and conversely every surviving Schur simple has simple corner. Exactness on the semisimple sum, distinct labels and the one-dimensional primitive lines yield , multiplicity-free with exactly the good-deletion labels. The unused coordinate includes columns and , whose lower degree-zero corner is .
The group central acts on by , since its tensor action is step 6.1 and its regular-summand action is ; right multiplication equals left multiplication for this central element. On the good lower label it acts by . Therefore has scalar on that simple submodule, with the restricted convention . Primary projection selects just that residue, and socles respect the actual direct sum. We obtain when , and zero otherwise. In the latter case , since a nonzero finite-dimensional module contains a simple submodule.
The invariant nondegenerate quotient form makes self-dual. A primary polynomial projector in is self-adjoint, since the inverse involution fixes , so its summand has a restricted nondegenerate invariant form. Its head is therefore dual to its simple socle and is the same simple. Thus for every restricted of consecutive degrees, is one if and , and zero otherwise. The scalar endomorphism ring is by absolute simplicity. This all-pairs criterion includes the zero case and all initially possible primitive weights; it does not discard middle composition factors.
We justify the needed functor interfaces locally. In the Jucys identity is . Induct on : choosing leaves fixed, and choosing inserts it next to in a cycle, bijectively covering the non-fixed permutations. Hence each elementary symmetric JM coefficient is central over every field. On a simultaneous primary tuple these operators have generalized eigenvalues equal to its elementary symmetric residue coefficients; nilpotence follows by expanding a polynomial in the commuting nilpotent differences. Distinct residue multisets have distinct coefficient tuples, since their monic products of prime-field linear factors retain multiplicities uniquely even in characteristic . For each elementary symmetric operator, construct its univariate primary projectors by the same polynomial CRT construction as in [F5], then multiply these commuting projectors. This gives the content projector equal to the sum of tuple projectors of that content. This proves content centrality without factorial division, position-dependent symmetric-polynomial claims, or content-block primitivity. The projectors are inverse-fixed. For an input in content , induction projection by right is the same as right , because . An absolutely simple lies in exactly one of these central contents, since their scalar idempotents are orthogonal and sum to one; denote it by . Thus these interfaces agree with the actual functor definition.
Put , , and let truncate group coefficients. For left modules the natural Frobenius map is , with coinduction action . It is balanced and -linear by and . For a left-coset transversal of , its inverse is . The right cosets partition , so evaluation at has exactly the term and returns . On the unique term with balances back to . These verify both identities and naturality with correct cosets and only finite choices.
Let , commuting with and inverse-fixed. For any such centralizer element, : the coefficient at is the group coefficient trace , by cyclicity and commuting with . Under , the value at one of right projection is consequently . If is -linear, . Evaluation therefore identifies projected maps with -maps ; conversely an -map extends via , with evaluated after the projector . For , every -map already selects the matching content. Thus exactly, with no duality shift and no asserted equality of composition multiplicities.
The labelled signature inverse is local. Adding or removing a corner flips its -sign, and the other boundary statuses that can change have residues , not for . In the stack reduction, flipping the last surviving plus gives the first surviving minus and conversely: before that position the minus stack is empty, and its distinguished minus survives exactly when every suffix prefix has at least as many minus pushes as plus pops, equivalent to no later plus surviving after the flip. Good removal preserves restrictedness by step 11.1. Cogood addition also does: its only possible new forbidden difference is , in which case the addable node in row has the same residue, with no -node between the two pluses. If the earlier plus survives, the later one also survives, contradicting that the earlier is cogood. Hence addition remains restricted and the inverse holds in both directions. In particular is cogood for exactly when it is good for . No equality between and is used.
Apply step 20.1 with and for every restricted . By step 17.1 the resulting Hom space is one-dimensional precisely when , and zero otherwise. Step 21.1 makes exactly one such label, namely . The group simple classification covers every simple by these absolutely irreducible labels. The dimensions of all simple-to-module Hom spaces therefore identify the socle of as the single , with socle multiplicity one, excluding every other label.
Give the invariant nondegenerate coset form on a finite left transversal. A group element permutes cosets and acts by on the fibers, proving invariance. Equivalently its value on general group representatives is . The projection is self-adjoint: moving it to the first argument gives , which equals by the trace calculation of step 20.1, and . Its image is orthogonal to the complement and inherits a nondegenerate invariant form. Thus is self-dual, and its head is the dual of its simple socle, namely through the nondegenerate invariant quotient form. This proves both endpoints, including characteristic two.
For , the empty partition has one conormal node of residue zero and . Induction from to is , with , so has these endpoints; other residue functors are zero. Every use of above descends to the original field: weight projections and coefficient operators have matrices over , finite Hom ranks preserve extension, and the simple Schur and group labels remain absolutely simple. Therefore the endpoint assertions hold over every original field of characteristic .
The total multiplicity is the separate use of [F4]. Apply it to the cogood , which is bottommost conormal. Its conormal nodes weakly above it are exactly all conormal nodes, so . Combining this count with the independently constructed endpoints proves the full statement. The implication uses no equality of induction and restriction composition counts and no equality .
Remark
Steps 1.1–17.1 also prove the following restriction endpoint, independently of the uncoloured-socle corollary: for every -restricted with , where is the good -node and its deletion remains -restricted. The scalar is the node residue in step 16.1. The proof covers every field of characteristic , including , using the unused coordinate and the degree-zero lower corner when .
This is the recovered research-only first construction proposal for the exact cogood endpoint case, not a native-ready decision. The saved native50 construction and mathematical steps are reused; recovery has not opened another review or repair round. The endpoint proof is local; the complete target uses the independently reviewed conormal-count companion [F4], which must be integrated first. The actual canonical good-node/uncoloured-socle items and the survey statements are not endpoint proof premises. No general finite- classifier is used or reopened.
The former unused equality in F3 was false: for , , its two addable -nodes are conormal, so ; for one has . The true labelled good/cogood inverse is proved above. Simple endpoint multiplicity one and total composition multiplicity two in this example are consistent.
The authentic cached Kleshchev 1995 II scan (SHA-256 6a7a7856d3eb8c8198920c02bdcdd16d8b350f024d39ae96215f072050bc368c, 51 PDF pages) was recorded by the original native50 constructor as read visually on every printed page 198–212 and 163–166. The recovery constructor read the saved proof, proposal and handoffs; it does not claim to have repeated that visual reading. These include the full Theorems 4.2 and 4.11 proofs/continuations and the actual Theorem 0.5 statement. The scan ends with section 4 and references, not a section 5. The source's strong-linkage citation in 4.11 is replaced here by the integral central tensor operator and explicit compensated containment. No full-article/book reading or new retrieval is claimed. Source reading, preimages, pending interfaces and exact hashes are recorded in the accompanying handoff; all prior K/50 seals and caps remain untouched.
The socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues
Statement
Let be a field of characteristic and let be a -restricted partition of ; write for the simple -module labelled by (Modular simple modules of the symmetric group, p-regular and p-restricted labels under transpose and sign). Let denote the good -node of , for those with (Residue signatures, normal, good, conormal and cogood nodes). Then a multiplicity-free sum over distinct simple modules: distinct residues give distinct summands. The sum runs over the residues with , one good node per such residue; the completely reducible special case (the restriction is semisimple if and only if every normal node is good, Kleshchev II Theorem 0.6) is a separate statement and is not asserted here.
Facts & Assumptions
Given: A field of characteristic , a -restricted partition of , and the good -nodes of .
for every finite-dimensional -module , where each is a -submodule and is the residue-summand functor attached to the primary Jucys-Murphy idempotents (Generalized Jucys-Murphy primary idempotents and the residue-summand functors , ).
For a residue with the good -node is the unique normal -node with no normal -node above it, and the nodes for distinct residues are distinct nodes of , so the partitions of are distinct (Residue signatures, normal, good, conormal and cogood nodes).
Steps 1.1–17.1 of The cogood node gives the simple socle and head of the residue induction prove the restriction endpoint independently of this corollary: the root interval primitive lines, compensated containment, Schur-corner socle lift and class-sum localization give The good-deletion labels are -restricted by that proof's step 11.1. Only this proved restriction argument is used here; the later induction endpoint and its conormal multiplicity are not needed.
Over every field of characteristic , the conjugate-sign isomorphism of Conjugate Specht modules are sign-twisted duals over every field identifies with . Twisting by sign preserves submodules and their radicals, since it multiplies each group operator by a unit scalar. Thus its head is for -restricted . These heads are nonzero and absolutely simple by Nonzero modular Specht quotient criterion. They are pairwise nonisomorphic: twisting an isomorphism back by sign and applying the separation assertion of Nonzero maps into tabloid quotients force dominance forces , hence . No splitting-field descent is assumed.
The socle of a finite-dimensional module is the sum of its simple submodules, and the socle of a finite direct sum is the direct sum of the socles of the summands. Indeed each projection of a simple submodule is zero or simple, so that submodule lies in the sum of the summand socles; the reverse inclusion holds because each simple submodule of a summand is a submodule of the sum (The radical, socle, head, and Loewy series of a finite-dimensional module).
Proof
By [F1] the restriction decomposes as with each a -submodule, and by [F5] the socle of the restriction is the direct sum .
By the local restriction argument [F3], for each residue the module is when and is when ; by [F3] each is a -restricted partition of , so each displayed is a simple -module by [F4].
Summing the descriptions of step 1.2 over the finitely many residues and using step 1.1 gives
The sum is multiplicity-free and its summands are pairwise non-isomorphic: if and both and are positive, then the good nodes and have different residues and are therefore distinct nodes of , so the -restricted partitions and of are distinct by [F2]; by [F4] their simple modules and are non-isomorphic. Each residue contributes its summand once, so each isomorphism class occurs with multiplicity one in the displayed socle.
The displayed decomposition of step 2.1 has the left-hand side and, by step 3.1, is a multiplicity-free sum over distinct simple modules with one summand per residue satisfying . No claim is made here about the restriction being semisimple. In the smallest case one has , and the only node of residue is the removable node , so and the right-hand side is the single term , while the restriction to the trivial group is itself, in agreement with the display; this is the smallest instance in which the summands carry the empty partition as a label.
Remarks
- Proof input. The per-residue endpoint is proved in steps 1.1–17.1 of The cogood node gives the simple socle and head of the residue induction. That argument does not depend on this corollary or on the later
thm-good-node-gives-the-simple-socle-and-head-of-residue-restriction; the latter uses this corollary together with the normal-node count. The cited literature documents the origin of the result. - No character theory. Nothing in the proof uses complex characters or reciprocity; modular multiplicities are not computed from characteristic zero data.
- Choice. All index sets are finite and no choice principle is used.
Every -restricted partition is reached from the empty partition by cogood additions
Statement
Let be a field of characteristic . Every -restricted partition of is obtained from the empty partition by successive cogood additions: there are residues with equivalently, every -restricted has at least one good node, and successive good deletions carry to (Good-node deletion and cogood-node addition operators, Residue signatures, normal, good, conormal and cogood nodes). Hence, in the graph whose vertices are the -restricted partitions and whose edges join to for every for which the operator is defined, the empty partition is the unique vertex of rank and every vertex is reached from it; dually every vertex reaches the empty partition by successive good deletions. The argument is choice-free.
Facts & Assumptions
Given: A field of characteristic , a -restricted partition of , and the simple -module .
For a finite-dimensional -module the multiplication is the identity, and the counit , , of the induction-restriction adjunction is a surjective -module map; the group ring is free of rank as a right -module (Restriction, induction, and coinduction, The group ring is free over a subgroup ring).
If is a finite-dimensional module over a finite-dimensional -algebra, then has a nonzero simple submodule: a nonzero submodule of least positive dimension exists and has no proper nonzero submodule; the socle is the sum of the simple submodules of (The radical, socle, head, and Loewy series of a finite-dimensional module).
For every field of characteristic , the ordinary Specht module has nonzero absolutely simple head when is -restricted, since is -regular (Nonzero modular Specht quotient criterion). The arbitrary-field isomorphism identifies its dual-Specht head with (Conjugate Specht modules are sign-twisted duals over every field). Tensoring by sign is an exact equivalence, so this head is nonzero and simple over the original field. Only existence of this head is needed here, not completeness of a simple-label classification or a splitting modular system.
Kleshchev's residue-refined socle theorem: for -restricted , a multiplicity-free sum over the good nodes , one for each residue with (The socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues).
For a -restricted and a residue : the good -node exists exactly when ; deleting it returns a -restricted partition of ; adding the cogood -node returns a -restricted partition; and for -restricted (Good-node deletion and cogood-node addition operators).
Proof
Restriction is faithful on nonzero modules. Let be a finite-dimensional -module and consider the multiplication map , , where is regarded as a -module by restriction. It is -linear and surjective, since the image of is and the elements span ; hence if the restriction of to were zero, the tensor product would be zero and , a contradiction. Therefore restriction sends no nonzero module to zero.
Nonzero finite-dimensional modules have nonzero socle: choosing a nonzero submodule of least positive dimension gives a simple submodule, so the socle, which is the sum of all simple submodules, is nonzero.
is a nonzero simple -module by [F3], because is -restricted.
Applying step 1.1 to with : since by step 1.3, its restriction to is nonzero.
By step 1.2 applied to the nonzero finite-dimensional -module from step 2.1, the socle is nonzero.
By the residue-refined socle theorem [F4], the socle is the multiplicity-free sum of the simple modules over the residues with . Since this socle is nonzero by step 3.1, at least one residue satisfies .
Fix such a residue . By [F5] the good -node exists, is a -restricted partition of , and with .
Induction on . We prove that every -restricted partition of is reachable from by cogood additions. For the empty partition is the only partition and it is reached by the empty sequence. For and a -restricted partition of , if there is nothing to prove, and otherwise step 5.1 supplies a residue and a -restricted partition of with ; by the inductive hypothesis for suitable residues, whence . The residue is selected as, say, the least residue with , so no choice principle is used.
Good deletions carry every -restricted partition to . At each nonempty stage step 5.1 produces a good node and, by [F5], the partition obtained by deleting it is again -restricted of rank one less; iterating times reaches the only partition of rank , which is ; equivalently, by the inverse property in [F5], the two procedures are mutually inverse step by step.
Consequences for the graph. By definition the edges of the graph are the partial operations , so step 6.1 says exactly that every -restricted partition is reached from ; step 7.1 says every vertex reaches by good deletions . The empty partition is the unique partition of , so it is the unique rank- vertex, and it has no incoming edge from a -restricted partition because no partition of exists; all ranks are finite. No step used the characteristic of beyond the existence of the socle theorem [F4], and no choice principle was used.
Remarks
- Where the mathematics sits. The two inputs are the residue-refined socle theorem [F4] and the combinatorial inverse property [F5]; the present item is the induction that turns them into the connectivity of the restricted-partition graph. This is the level-one case of Kleshchev's statement that the restricted multipartitions are exactly the vertices reachable from (survey (3.14) with Example 3.2(i)).
- No circularity. The induction removes a good node and reduces the rank; the operator item's closure statements (proved there) keep the reduced partition in the class, so no restrictedness is assumed silently.
The good node gives the simple socle and head of the residue restriction
Statement
Let be a field of characteristic , a -restricted partition of and with ; let be the good -node and (Residue signatures, normal, good, conormal and cogood nodes). For the residue-summand functor of Generalized Jucys-Murphy primary idempotents and the residue-summand functors , the module has simple socle and simple head, both isomorphic to , and the total (ungraded) multiplicity of in is . Thus the Loewy endpoints are simple even though the formal character of may contain the additional normal-node factors of Normal-node composition multiplicities under residue restriction.
Facts & Assumptions
Given: A field of characteristic , a -restricted partition of , a residue with , the good -node and .
Kleshchev's uncoloured socle theorem in its residue-refined form (The socle of an uncoloured modular restriction is the multiplicity-free sum over the good residues): a multiplicity-free sum over the good nodes, one per residue with .
is a direct sum of -submodules. If is a removable -node of , is -restricted, and occurs as a composition factor of the restriction, then every occurrence belongs to the summand with (Generalized Jucys-Murphy primary idempotents and the residue-summand functors , ); the localization is proved in Normal-node composition multiplicities under residue restriction.
The normal-node multiplicity theorem (Normal-node composition multiplicities under residue restriction): if is a removable -node of with -restricted, then is the number of normal -nodes of weakly below (counting ) when is normal, and otherwise.
is self-dual for -restricted , and the functor commutes with contragredient duality, so is self-dual; and is simple, self-dual and absolutely irreducible (p-regular and p-restricted labels under transpose and sign, Generalized Jucys-Murphy primary idempotents and the residue-summand functors , ).
For a finite-dimensional module : is the sum of its simple submodules, the socle of a direct sum is the direct sum of the socles of its summands, and the head of a self-dual module is the dual of its socle, (The radical, socle, head, and Loewy series of a finite-dimensional module).
The good -node is the topmost normal -node, so the normal -nodes weakly below it are exactly all normal -nodes of , and there are of them (Residue signatures, normal, good, conormal and cogood nodes).
Proof
Socle. By [F5] the socle of is . By [F1] the socle of the restriction is the multiplicity-free sum of the over the good nodes, and by [F2] each summand lies in with its residue ; since a nonzero submodule of cannot lie in by the directness of the sum, the -summand of the socle is exactly the single simple module and is simple. For this gives .
Multiplicity. Applying the normal-node theorem [F3] with : since is a normal -node, is the number of normal -nodes of weakly below counting ; by [F6] this is .
Head. By [F4] the module is self-dual; by [F5] its head is the dual of its socle, , which by step 1.1 is because is self-dual by [F4]. Hence the head is simple and isomorphic to .
Conclusion. Step 1.1 gives simple socle , step 2.1 the total multiplicity of in , and step 2.2 simple head . The additional normal-node composition factors of [F3] may occur in the middle Loewy layers; the statement asserts only the endpoints and the total multiplicity, and no graded shift is displayed before the Hecke/KLR bridge.
Remarks
- Where each input is used. The simple socle and the identification of its label come from the recorded uncoloured socle theorem and the localization of the factor in its residue summand; the multiplicity is the normal-node count at the good node, and self-duality produces the head. No complex character theory is used.
- Distinct statements. The Hom criterion for Specht modules and the socle theorem beyond the good-node summands are not asserted here.
General Hecke residue branching endpoints from normalized Schur cells
Statement
Let be any field, have finite quantum characteristic , and let with . Use the actual Murphy cell-form quotients , indexed by -restricted partitions, converted to left modules by star. For additive Hecke JM elements , let be the -generalized eigenspace in restriction to ; let be induction followed by its commuting right -primary projector. These functors are defined over , for , with and otherwise.
For every restricted the nonzero have simple socle and simple head , each once, and exactly when the good -deletion is undefined. Similarly the nonzero have simple socle and simple head , each once, and vanish exactly when the cogood -addition is undefined. Here signatures use content , top-to-bottom order, cancellation of , first surviving minus and last surviving plus (Residue signatures, normal, good, conormal and cogood nodes). In particular the restriction socle is the multiplicity-free sum over good residues. This proves endpoints, not total composition multiplicities. Composite , arbitrary characteristic, nonsquare , and rank zero are included.
Facts & Assumptions
Given: The field, parameter, actual cellular labels, residue convention and functors of the Statement.
The first-level Weyl filtration, one-dimensional primitive/Hom bound and coefficient test, and the actual integral permutation/tensor corner identification are proved in Polynomial quantum Schur first levels: Weyl filtration and the actual Hecke corner. That supplier constructs the abstract highest norm-one form directly on the actual finite cell; it has radical the maximal submodule and gives self-dual simples. Its complete local finite-cell construction is used; no Choice-bearing free global highest-lattice isomorphism is invoked.
Central symmetric JM operators act on actual Schur Weyl cells by their node-content scalars, and every constituent retains their full residue multiset (Central Hecke Jucys–Murphy scalars separate q-Schur residue contents).
The actual corner and restricted-label classifier identifies the surviving Schur simple with the actual same-label Murphy simple; these are complete, distinct and absolutely simple over the original field (The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules). The standard trace is symmetric and satisfies (The Murphy cellular basis, the cell law and the Murphy form). Additive JM elements commute, centralize the preceding algebra, are star-fixed, and have triangular q-content spectra (The Hecke Jucys-Murphy action is dominance triangular).
At , the actual group restriction endpoint is supplied by the initial restriction construction (the first seventeen phases) of The cogood node gives the simple socle and head of the residue induction, independently of its final composition-multiplicity argument. Its actual restricted-label convention is retained. No inverse of is specialized to zero.
Proof
First construct the coefficient polynomials without specializing denominators. For , , and , define Cancel common . For disjoint sets let . If , multiply by . If , put ; splitting the sum according to gives . Divided difference of is , so induction proves even at coincident coordinates. Also by the same recursion. For , , splitting gives Indeed , so common factors there first cancel. The second difference is zero when ; otherwise its predecessor equals , giving the second term. The extra terms have negative sign and split independently at , giving the positive third product after subtraction. This accounts for every summand.
Put and Expansion of each as gives Selected difference factors vanish when their index belongs to ; the remaining predecessor is , and collection gives exactly by cancellation of the complement numerator/denominator sets. For a bijection with , this implies the matched-product identity Here is an integral induction proof. If , the alternating expression is the asserted full product. Otherwise take , remove its source and target, and apply induction on . Splitting the alternating sum by gives the prefix product times the divided difference of in . The prefix is and the divided difference is . All remaining match generators are independent of , so divided differencing retains their ideal. The induction product contains the target ; modulo its match it vanishes before substitution, and after substitution its factor is . Cancel that integral factor to leave exactly the tail product with this target removed. No target occurs below , since targets are at least their sources. The prefix completes the stated product. All divisions here are polynomial divided differences, not evaluation of rational functions.
Suppose and temporarily extend to a field containing with . Take , , , and . Use the actual normalized root operators The denominator is a field unit since . Define , evaluating ; use . The recurrence of step 1.1 gives Left-interval toral coefficients commute with right-interval lower roots, so the product order is exactly as displayed. The empty-set operator is . Rank-one commutation and the root recurrence give , if , and if . Disjoint indices commute; adjacent exterior indices contribute precisely their -weight factors. These follow by induction inserting into the simple defining commutators.
Modulo the left ideal , the recurrence gives this complete table: if , or and ; it is if , ; it is if ; finally for , it is . To verify the table induct on using step 2.2. Empty is the elementary table. For , , expand again at ; the two cut remainders are and its negative and cancel. At the cancellation is . For any other the recurrence splits into intervals, the remote factor commutes, and the other factor uses induction. For the split row reduce to by expanding at ; if the replacement is its remainder is the vanishing row, and otherwise all terms combine into the recurrence for . The shortened-endpoint row uses the same induction at the other end. Expanding at gives the final row: contributes , its weight factor is , and . These exhaust all positions. Successive commutation through a cut product gives . Summing proves .
Evaluate and . Let be the zero- set in and the zero- set in . Their vanishing is exactly the corresponding equal-residue comparison. If , then , because is a unit. Write for an injection of demands into supports , sending each demand to a weakly smaller support. For , we claim nonzero in implies . Induct on . At length one the elementary commutator and positive detection give equivalence with . At larger length some has nonzero image: otherwise all positive divided powers kill this vector, since its deficit has each simple-root coefficient zero or one, so powers greater than one have absent target weights; triangular spanning would generate a proper second highest submodule of the simple . Use the table of step 3.1. In the split case its disjoint factors commute, so both their vectors are nonzero; induction gives matchings on both intervals, and , identify the split demands with the full ones. If , induction on the shortened interval matches old demands and the extra demand, when present, uses . Otherwise put in the last table row. A nonzero first term has , so there is no new demand. A nonzero second term matches old demands into ; the released largest support handles the only possible new demand . This proves the claim in every case.
A primitive line of at exists exactly when . For necessity, dualize a nonzero primitive map using [F1] to get . Its highest coefficient functional on is nonzero at and zero at all nonempty cut products, by [F1]'s exact coefficient test. On , , its value is therefore that nonzero value times . This vector survives the radical, so step 4.1 gives necessity. Conversely choose a matching with image of size and invert it to a bijection with targets at least their sources. The polynomial match generators in step 2.1 vanish, so . Step 3.1 makes the resulting nonzero in . Its lower-Levi commutators vanish in : a potentially nonzero split has and demands . If its first factor survives, step 4.1 gives ; since and , the suffix demands outnumber suffix supports, forcing the second factor into the radical. Higher divided generators have absent target weights. Thus is primitive. [F1] gives one-dimensionality and excludes every other primitive highest label.
Let be the nonzero primitive line for a matched removable row and its cyclic lower-Schur module. If it has a proper nonzero submodule, that submodule contains a simple submodule, whose highest line is by [F1] and step 5.1. Triangular spanning puts its weight strictly below , so ; equality would contain the generating line. The universal Weyl map onto and [F2] force and to have the same residue multiset, hence . Conversely suppose are matched and . The demand/support sets split as and . A prefix matching exists by restricting any matching for to demands below ; these cannot use later supports. Combine it with a matching for , giving an image omitting with exactly earlier and later supports. Let , . Then , and the recurrence at gives When present, the first term replaces support by ; its earlier demands now outnumber earlier supports, so step 4.1 kills it in . The other full and suffix vectors are the nonzero primitive vectors of step 5.1. Hence lies in and generates a proper submodule. Thus is simple precisely for the first matched row of its residue, and the full first-level socle is the multiplicity-free sum of these simples.
The matching criterion is exactly the signature criterion. A zero records a later removable push of the same residue and a zero a later addable pop; nonremovable equal rows have both slots and cancel as a neutral pair. Removing common demand/support slots preserves the prefix inequalities for . The remaining prefix inequalities say that the minus at row survives all later pops. Thus matched rows are normal, and the first matched row of a residue is its good row. Good deletion preserves restrictedness: its only possible new gap is above the deleted row, when . The adjacent removable corners then have the same residue and no intervening same-residue boundary corner; if the lower minus survives, the upper minus survives too, contradicting first-surviving selection. The dual adjacent-plus argument proves cogood addition preserves restrictedness. Flipping the selected minus to plus changes no other -boundary status, since all other changed corners have residues , different from even at . Before the first surviving minus the stack is empty, and every suffix prefix has at least as many remaining minus pushes as plus pops; after the flip these are exactly the conditions for the last surviving plus. Hence good deletion and cogood addition are inverse partial moves on restricted partitions.
Transfer the socle through the actual corner, using more than exactness. By steps 6.1 and 7.1 all Schur socle labels of are restricted; [F3] makes their lower corners nonzero simples. Therefore has no nonzero corner-killed submodule, since every nonzero finite-dimensional submodule contains a simple submodule. For a simple lower-Hecke injection , the corner adjunction gives , whose image is generated by and satisfies . A proper nonzero submodule has corner zero or . The first contradicts the no-killed-submodule property; the second contains and thus generates . Hence is simple. Conversely every surviving Schur socle simple has simple corner by [F3]. These inclusions prove , with multiplicities and actual labels. [F1]'s explicit corner identifies this with the actual Hecke restriction of .
Define the primary functors over . By [F3] the spectra of in the regular module are q-contents, hence among the distinct , ; cellular layers and their common triangular flags give this for the regular action as well. The polynomial CRT applied to gives mutually orthogonal projectors , with sum one, in . They centralize and are star-fixed. Taking exponent is sufficient for every Jordan block of the regular action and therefore every module; absent eigenvalues give the zero projector. On a good lower simple in restriction, has scalar : the symmetric sums have their actual cell scalars by [F2]. Thus its primary projector selects exactly the good residue. Every nonzero primary summand contains a simple socle submodule, so a summand with no good residue is zero. The form quotient makes star self-dual, and its star-fixed projector inherits a nondegenerate restricted form; its head is dual to its simple socle and has the same label. This proves the restriction endpoints when . At use the actual group endpoint [F4], with the same primary construction and residue normalization.
Induction and restriction are biadjoint over . Let , , and let retain precisely the lower standard-basis terms. It is an -bimodule map. For distinguished parabolic cosets , the perfect trace gives : pair against each lower basis element using and the disjoint length-additive coset supports. All diagonal values are units. Hence the relative Frobenius pairing gives naturally. For a commuting primary projector , cyclicity of the trace and commutation with give , by pairing both expressions against the lower algebra's perfect trace. Under this identification right multiplication by corresponds to selecting on restriction. Ordinary tensor adjunction and this Frobenius adjunction therefore give both and .
For every simple label of rank , step 9.1 and absolute simplicity give each of these Hom dimensions with , as one exactly when the good -deletion of is , and zero otherwise. Step 7.1 makes its inverse exactly the cogood addition, unique when defined. The complete cellular classifier [F3] covers every simple, so these two Hom tests identify respectively the simple head and simple socle of , once each. If no cogood addition exists both tests vanish for every simple, forcing by finite dimensionality. At rank zero , , and the only move adds the residue-zero node; these formulas give and every other summand zero.
Descend the temporary square-root extension. The Hecke modules, their cell forms, all primary projectors and functors above are defined over . The cellular quotients of [F3] remain absolutely simple under , and finite-dimensional Hom spaces are kernels of finite linear systems over , so their dimensions are unchanged by this field extension. Step 9.1's restriction and step 11.1's induction Hom tests therefore hold over itself and give exactly the stated endpoints. This argument also permits a purely inseparable square-root extension in characteristic two; no Galois averaging is used. The polynomial, integral module, actual corner and coefficient-functional constructions never divide a specialized Gram determinant. No primality condition on or Fock-space label classification entered the proof; no Choice principle is used.
The crystal identification does not elementarily identify the cellular simple labels
Statement
At level one, distinguish the cellular labels , the nonzero Murphy cell-form quotients (the dual-Specht heads at ), from the inductive labels defined by for any defined good deletion . Here is any field, the Hecke parameter is invertible with finite quantum characteristic , and is -restricted. At , and the functors are those of Generalized Jucys-Murphy primary idempotents and the residue-summand functors , ; the general Hecke functors are constructed in General Hecke residue branching endpoints from normalized Schur cells. The group label convention is fixed by p-regular and p-restricted labels under transpose and sign.
The equality and independence of the chosen deletion follow at level one from the proved cellular branching endpoints and induction on rank, as explained below. They do not follow from the combinatorial inverse property alone (Good-node deletion and cogood-node addition operators). This local comparison uses no Fock-space classification.
The historical warning in Kleshchev's survey §11.2, equation (11.1), concerns the broader cyclotomic labelling theorem for restricted multipartitions. The survey attributes its proof to Ariki and a later graded argument, and describes both as relying on the wider theory. That warning does not preclude the finite level-one comparison here. Identifying the resulting graph with the canonical crystal is a separate result of General Hecke cellular simple labels match the basic crystal ↗, using the independent Fock-component suppliers and their declared Axiom of Choice. Neither that identification nor Fock reachability is a premise of the cellular branching proofs on this page.
Remarks
Every nonempty -restricted shape has a good deletion. Its bottom removable corner has residue , while the only boundary corner below it is the addable of residue . Since , that bottom minus cannot cancel, so a surviving minus exists. The finite signature argument in General Hecke residue branching endpoints from normalized Schur cells proves that good deletion remains restricted and that its inverse is the prescribed cogood addition. For the group specialization, reachability is also supplied by Every -restricted partition is reached from the empty partition by cogood additions.
Now induct on rank. At rank zero both modules are . For each allowed predecessor , induction gives . The cellular induction endpoint is . Thus every allowed deletion yields the same isomorphism class, and the bottom-corner argument ensures that a deletion exists. The argument is finite and choice-free; in the group specialization its induction endpoint is also The cogood node gives the simple socle and head of the residue induction.
The Schur functor compares first-level branching with Hecke restriction
Statement
Let be a field, , , and ; at the empty lower-rank boundary put with its identity functor. Use the left-module version of the q-Schur algebra and its exact Schur functor with left adjoint (The type-A q-Schur algebra and its Weyl modules, The Schur idempotent and the Schur functor for type-A q-Schur algebras). Right-module suppliers are converted to left modules through their star anti-involutions. All Specht and simple labels below are Murphy labels: and , the latter nonzero exactly when is -restricted (The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules).
For a degree- polynomial module , its first level is It is a module for the Levi polynomial algebra : the first coordinates sum to . It is not the sum of the weights one simple root below the highest weight. For an -restricted partition , the following hold.
- There is a natural -module isomorphism 2. For any -modules with and , the Schur functor induces Here is the intersection of submodules whose quotient is killed by , and is the sum of submodules killed by . 3. The socle of as a Levi module has only -restricted labels.
For every partition with -restricted, The exact functor transfers these surviving multiplicities; it may kill nonrestricted simple factors. At these statements hold over every field for the group algebras. In ordinary James labels the dictionary is , not an untwisted identification with (Hecke Specht theory specialises to group Specht theory at q = 1).
Facts & Assumptions
Given: The field, parameter, ranks, polynomial weight decomposition, and q-Schur and Hecke algebras of the Statement.
The permutation-summand realization is , with weight projections . The regular summand for a composition with exactly entries equal to is . The standard corner is (The type-A q-Schur algebra and its Weyl modules, The Schur idempotent and the Schur functor for type-A q-Schur algebras).
The exact Schur functor sends to and to , allowing zero images. The image is nonzero if and only if is restricted over the original field; the nonzero images are pairwise nonisomorphic simple modules (The Schur functor sends Weyl and simple modules to Specht and Hecke simple modules).
Brundan, full author manuscript, §3.22 defines polynomial levels by last-coordinate weight, using both and its binomial operators so the integer weight is determined even at a root of unity. The Levi commutes with these operators. The q-Schur polynomial realization is the corresponding finite-degree quotient. In §5.5 the functors are left-module functors; star converts the right-module suppliers to this convention.
Every Schur simple is its nonzero cell-form quotient, so the descended symmetric associative form makes under Schur star. The normalized maps are , with and ; Schur star is (The type-A q-Schur algebra and its Weyl modules). The standard coefficient trace satisfies and ; its complete generator-block proof is the actual standalone trace construction of The Murphy cellular basis, the cell law and the Murphy form and The standard basis of the generic type-A Hecke algebra. The following proof establishes the restricted-socle conclusion locally over the original field; no quantum-hyperalgebra square-root or unproved classical-specialization premise is used.
At the actual ordinary polytabloid/signed-conjugate Murphy comparison gives the group module dictionary, with form factor , over every field. It follows through the corrected Definition and the actual NEW50 comparison and specialization suppliers, not the printed-page-25 untwisted warning (Hecke Specht theory specialises to group Specht theory at q = 1).
Proof
Construct the lower-rank action directly over the given field. Put for . Length-additive parabolic coset bases give by . Thus the summands with last coordinate form . The functorial algebra homomorphism embeds into : the Hecke algebra is free on its parabolic coset basis and contains the unit coset, so the map is injective. Extend these maps by zero to the remaining summands of and put . For every left -module , is therefore a natural -module. This supplies the lower-rank action without assuming that the first level is a sum of root-adjacent highest-weight spaces, and without adjoining a square root of the Hecke parameter. It agrees with the last-coordinate polynomial level of [F3].
Prove the Hom assertion algebraically. For put and let send to . Its image is , which is under the stated hypothesis. Applying identifies with the isomorphism . Exactness of therefore gives for . The exact sequence is For any -map , its image is an -submodule killed by , so it is contained in . Thus factors uniquely through . The adjunction then gives . This proves assertion 2, with the kernel and quotient in the correct direction.
Reconcile the corners for all . Put and . Both and are the regular module . Their fixed identity isomorphism gives block matrix units with , , and . Thus multiplication by gives a natural isomorphism , with inverse multiplication by , and carries the standard regular corner action to the corner action. When these corners coincide. This explicitly supplies the natural corner identification instead of treating an idempotent with last coordinate as lying in the first level.
Construct a perfect Schur-contravariant form on the permutation-summand module . On each distinguished coset basis , put . The row generator cases are a same-row scalar , or an adjacent length-increasing pair with and , . Their weighted diagonal matrices verify , so the forms are Hecke-contravariant and perfect. To prove Schur adjointness, work first in . Length-additive cosets and [F4] give on , where is nonzero in with constant coefficient . For , and , membership in [F4] gives and . Thus Cancel the nonzero polynomials only in , then specialize the resulting identity to . The orthogonal sum is therefore perfect and satisfies for every actual Schur basis map and hence every . It identifies the left -module with . No Poincare factor is canceled in the given field, including at .
Compute the first-level corner inside this induced action. The lower regular summand is , whose induction is , exactly the summand of type . Its weight projection on is , so . The lower corner operator given by left multiplication by induces left multiplication by the same on under . Thus every generator acts exactly as its image in the upper regular corner, by equality of these explicit endomorphisms. The matrix units of step 2.1 identify the upper standard corner with this regular summand. They consequently give on every module. This is an algebra-level calculation; it needs no generic semisimplicity or cellular/crystal label identification.
Determine the simple socle labels of . Evaluation at in the regular summand gives as a left -module. Finite-dimensional star duality and [F4], together with step 2.2, give for every simple . The last bijection evaluates a map at , with inverse for . By [F2], is nonzero exactly for restricted . Thus every simple submodule of has restricted label; for restricted , any nonzero map is injective. The proof does not equate zero form quotients with zero actual module heads.
Transfer composition multiplicities by exactness, not by a Hom-space count. Apply to a finite composition series of . By [F2] its factors become either zero or the pairwise nonisomorphic for restricted . Removing repeated terms of the resulting filtration therefore preserves the number of each surviving simple factor. Step 3.1 identifies its result with , proving the stated equality. Assertion 3 is not used to claim that every composition factor survives; a socle statement alone would not justify that claim.
Prove the restricted-socle assertion over every original field. Applying to the injection of step 3.2 embeds into with the actual lower action of step 1.1. The length-additive parabolic coset basis makes free as a LEFT -module of rank , so is copies of as a left lower Schur module. Apply steps 2.2 and 3.2 to : its simple socle labels are exactly the surviving restricted labels. Every simple submodule of is a simple submodule of , and therefore restricted. At degree zero , with the unique empty label; at this is the convention . This proves assertion3, without adjoining a square root, using a splitting extension, assuming a quantum-hyperalgebra specialization, or requiring .
At , [F5] identifies the corner algebras with group algebras. In ordinary regular labels the two modules are simultaneously twisted by sign and both partition labels are conjugated. Sign restricts along the group tower, is exact, and preserves the two compared multiplicities. This is the ordinary group interpretation, including characteristic ; it is not an untwisted identification of a restricted label with the same regular label. Steps 3.1, 1.2, 4.2 and 4.1 prove all the assertions.
Remarks
The first-level and ordinary-label reconciliation above is the new authored binding repair. The previously accepted source20 cell-form repair and NEW50 ordinary polytabloid construction are unchanged. Actual acceptance requires the repaired current source20/NEW50 supplier carriers after the live writers drain and the same reviewer checks the actual bound interfaces. No further primitive bridge construction is claimed. No identification of cellular and crystal simple labels is used (The crystal identification does not elementarily identify the cellular simple labels).
5 · Examples, counterexamples and false statements
None yet.
Sources
- A. A. Jucys, Symmetric polynomials and the center of the symmetric group ring, Reports on Mathematical Physics 5 (1974), 107–112
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §2.3-2.4 with Lemma 2.4 and (2.6)-(2.8), §2.9 with (2.41), §7.1-7.5 with (7.16)-(7.17) and Lemma 7.1 (printed pp. 8-14 and 29-31); the block identification (2.41) is attributed there to S. Lyle and A. Mathas, Blocks of cyclotomic Hecke algebras, Adv. Math. 216 (2007), and to J. Brundan, Centers of degenerate cyclotomic Hecke algebras and parabolic category O. Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §3.4 with (3.12)-(3.14), printed pp. 18-19, and §11.4 with the normal/good/conormal/cogood naming and the counts epsilon_i, phi_i, printed pp. 53-54. Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Jonathan Brundan, Modular Branching Rules and the Mullineux Map for Hecke Algebras of Type A, Proc. London Math. Soc. (3) 77 (1998) 551-581; complete 34-page author manuscript, §2.2-2.4 and Remark 2.4(II), printed pp. 3-4 (the same-shape lattice test, the comparison with Kleshchev's older convention, and the l-residue r-c)
- Charles A. Weibel, An Introduction to Homological Algebra, §6.3 (induced and coinduced modules, the relative Frobenius isomorphism for finite-index subgroups), printed pp. 164-166
- Peter Webb, A Course in the Theory of Groups, or equivalently Webb's finite group representation notes, Chapter 7 (the natural isomorphism Ind_H^G M = kG tensor_{kH} M -> Hom_{kH}(kG,M) for finite G)
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §3.4 with (3.13)-(3.14), printed pp. 18-19 (the good node of mu is the cogood node of mu-minus-A and the restricted multipartitions). Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Alexander Kleshchev, Branching rules for modular representations of symmetric groups II, J. reine angew. Math. 459 (1995) 163-212, §5 (the removal and addition operators and their inverse property); read through the formulation recorded in the survey above (the GDZ scan has no text layer)
- Alexander Kleshchev, Branching rules for modular representations of symmetric groups, II, J. reine angew. Math. 459 (1995), 163-212; integer lowering coefficients, positive actions, zero criterion and raising pivots in sections 1-3; locally reconstructed below
- Alexander Kleshchev, On decomposition numbers and branching coefficients for symmetric and special linear groups, Proc. London Math. Soc. (3) 75 (1997), 497-558; essential subsets, Corollary 5.8(ii), Theorems 8.6 and 9.3; locally reconstructed below
- Alexander Kleshchev, On decomposition numbers and branching coefficients for symmetric and special linear groups, Proc. London Math. Soc. (3) 75 (1997) 497-558; complete 66-page author manuscript (dvips PostScript), Theorem 1.4 with its reformulation and worked examples, manuscript p. 5; Part I §§2-6 (essential and compensated subsets, normality, Corollary 5.8); Part II §§7-10 (first level, Theorems 8.6, 8.8, 8.9, Corollary 8.10, Definition 9.1, Lemma 9.2, Theorem 9.3); §11 (Propositions 11.1-11.3 and the deduction of Theorem 1.4 on pp. 64-65). Complete 66-page manuscript, SHA-256 0bbf3d69ddf20940089045c540e3d516c542118ab06644c5d26c430bedf46558
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §11.4 with Theorem 11.6 and the normal-node counts, printed pp. 53-54. Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Jonathan Brundan, Modular Branching Rules and the Mullineux Map for Hecke Algebras of Type A, Proc. London Math. Soc. (3) 77 (1998) 551-581; complete 34-page author manuscript, Remark 2.4(II) (the transposed-node dictionary) and Theorems 2.5-2.6, printed pp. 4-5
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §11.4 with Theorem 11.6(ii), printed pp. 53-54 (the count of normal i-nodes weakly below A). Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Alexander Kleshchev, Branching rules for modular representations of symmetric groups II, J. reine angew. Math. 459 (1995) 163-212, Theorems 0.4 and 0.5 (the normal-node and socle theorems); read through the statement recorded in the survey above (the GDZ scan has no text layer)
- Jonathan Brundan, Modular Branching Rules and the Mullineux Map for Hecke Algebras of Type A, Proc. London Math. Soc. (3) 77 (1998) 551-581; complete 34-page author manuscript, Theorems 2.5-2.6, Remark 2.7 and §5.5-5.7, printed pp. 4-5 and 30-32 (the proof-bearing treatment), and Remark 2.4(II) (the transposed-node dictionary)
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §11.4 with Theorem 11.7(ii), printed pp. 53-54 (the count of conormal i-nodes weakly above B), attributed there to [29]. Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Alexander Kleshchev, On decomposition numbers and branching coefficients for symmetric and special linear groups, Proc. London Math. Soc. (3) 75 (1997) 497-558; Part I essential-subset counts and endpoint-shift recurrence. The actual local basis/count supplier is used below; the tensor/signature argument is proved here.
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §11.4 with Theorem 11.7 and the dual socle statement, printed pp. 53-54. Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Jonathan Brundan, Modular Branching Rules and the Mullineux Map for Hecke Algebras of Type A, Proc. London Math. Soc. (3) 77 (1998) 551-581; complete 34-page author manuscript, §5.5 with the statement that the deduction of Theorem 2.6 from Theorem 5.4 is entirely similar, printed pp. 30-32 (the dual socle/head treatment)
- Alexander Kleshchev, Branching rules for modular representations of symmetric groups, II, J. reine angew. Math. 459 (1995), 163-212; authentic 51-page cached scan, SHA-256 6a7a7856d3eb8c8198920c02bdcdd16d8b350f024d39ae96215f072050bc368c; prior native50 constructor recorded visual reading printed163-166 and198-212, including complete4.2/4.11 proofs and Theorem0.5; local construction replaces external strong linkage
- Alexander Kleshchev, Branching rules for modular representations of symmetric groups II, J. reine angew. Math. 459 (1995) 163-212, Theorem 0.5 (socle and head of the uncoloured restriction as the sum over good nodes) and Theorem 0.6 (the completely reducible case); read through the statement recorded in the survey below (the GDZ scan has no text layer and was not relied on for any assertion here)
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §11.2-11.4 with Theorem 11.6 and the socle statement of §11.4, printed pp. 52-54. Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Jonathan Brundan, Modular Branching Rules and the Mullineux Map for Hecke Algebras of Type A, Proc. London Math. Soc. (3) 77 (1998) 551-581; complete 34-page author manuscript, Theorem 2.6, Remark 2.7 and Theorems 5.3-5.4 with the §5.5-5.7 transfer, printed pp. 4-5 and 28-32 (the proof-bearing form of the socle statement in the Hecke convention)
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §3.4 with (3.13)-(3.14) and Example 3.2(i), printed pp. 18-20, and §11.4 with Theorem 11.6, printed pp. 53-54 (connectivity of the restricted-partition graph and the identification with p-restricted partitions). Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Alexander Kleshchev, Branching rules for modular representations of symmetric groups II, J. reine angew. Math. 459 (1995) 163-212, historical origin of modular branching; the reachability statement used here is the 2010 survey, §3.4, (3.14), Example 3.2(i), cited above
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §11.4 with Theorem 11.6(ii) and the socle statement, printed pp. 53-54, and Theorem 7.4 with §11.3 for the epsilon_i-multiplicity. Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Jonathan Brundan, Modular Branching Rules and the Mullineux Map for Hecke Algebras of Type A, Proc. London Math. Soc. (3) 77 (1998) 551-581; complete 34-page author manuscript, Theorems 2.6 and 5.4 with §5.5-5.7, printed pp. 4-5 and 28-32 (the proof-bearing treatment of the good-node socle in the Hecke convention)
- Jonathan Brundan, Modular branching rules and the Mullineux map for Hecke algebras of type A, §§4.2–5.7
- Alexander Kleshchev, Representation Theory of Symmetric Groups and Related Hecke Algebras, Bull. Amer. Math. Soc. 47 (2010) 419-481, author arXiv version; §11.2 with the inductive definition of D-dot(mu) as the head of F_i D-dot(e-tilde_i mu) and the labelling conjecture (11.1), printed pp. 51-52, and §11.2 for the references to S. Ariki's proof and the graded argument [40, Theorems 5.13, 5.18]. Complete 66-page text, SHA-256 8685199608967fa7c479e4dd883990b716a6f708e71cf75f6ce4aba41c6f2cab
- Jonathan Brundan, Modular Branching Rules and the Mullineux Map for Hecke Algebras of Type A, Proc. London Math. Soc. (3) 77 (1998) 551-581; complete 34-page author manuscript, §5.5-5.7, printed pp. 30-32 (the Schur functors f_{n,r}, h_{n,r}, Lemma 5.6 and Lemma 5.7, and the weight comparison f_{n-1,r-1}(V^1) = f_{n,r}(V) restricted to H(r-1))
- Alexander Kleshchev, On decomposition numbers and branching coefficients for symmetric and special linear groups, Proc. London Math. Soc. (3) 75 (1997) 497-558; complete 66-page author manuscript, §2.12(v) and §11 (the comparison of the group restriction multiplicity with the first-level multiplicity over the algebraic group); the present item replaces the citation by a proof-bearing comparison in the q-Schur setting