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.
Tensor Product Multiplicities and Littlewood Richardson
1 · Prerequisites
- Abelian Categories
- Absolute and Conditional Convergence; Rearrangement; Products
- Adjunctions Units and Counits
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Applications of the Fundamental Group
- Arc Length and Rectifiable Curves
- Artinian Rings and Length
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Bounded Variation and the Riemann–Stieltjes Integral
- Cardinal Arithmetic, Cofinality and the Alephs
- Cartan Subalgebras and Root Space Decompositions
- Categories, Functors and Natural Transformations
- Category O Finiteness Duality and Blocks
- Chain Complexes and Homology
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Chain Homotopy and the Homotopy Category
- Chains, Antichains, Sperner and Dilworth
- Characters and the Orthogonality Relations
- Clifford Theory over Normal Subgroups
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Differentiability and the Cauchy–Riemann Equations
- Complex Power Series and Analytic Functions
- 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ₙ
- Connectedness
- 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
- Contour Integration
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Covering Spaces and Lifting
- Cyclic Groups and Direct Products
- Delta Functors and Universality
- Derived Functors
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Distributions Integral Manifolds and the Frobenius Theorem
- 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
- Euclidean Ordinary Differential Equations with Smooth Dependence
- Exactness and the Member Calculus
- Exterior Powers, Orientation and Hodge Duality
- Filters and Ultrafilters
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Finite Weyl Invariants, Bruhat Order, and Kostant Harmonics
- Formal Power Series
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Goursat's Theorem and Cauchy's Theorem in a Convex Domain
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Harish Chandra Isomorphism Casimir and Central Characters
- Hereditary and Productive Behaviour of the Separation Axioms
- Highest Weight Theory for Complex Semisimple Lie Algebras
- Hilbert Space Geometry and Riesz Representation
- Holomorphic Functions of Several Complex Variables
- Homomorphisms Between Verma Modules and Linkage
- Homotopy and Homotopy Equivalence
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lie Algebra Representations, Enveloping Algebras, and PBW
- Lie Groups, Invariant Fields, and the Exponential Map
- Lie Subgroups, Actions, and Homogeneous Spaces
- Limits and Colimits
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Line Integrals and the Gradient Theorem
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Long Exact Sequences in Homology
- Manifolds with Boundary Collars and Orientations
- Maschke's Theorem, Complete Reducibility and the Structure of k[G]
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Functions, Discontinuities, and Continuity Sets
- 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
- Ordinal Arithmetic and the First Uncountable Ordinal
- Ordinals, Cardinals, and Transfinite Recursion
- Partitions of Unity and Paracompactness
- Permutation Statistics, Inversions and Eulerian Numbers
- pi: the Equivalent Characterizations
- Picard-Lindelöf and First-Order Ordinary Differential Equations
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Preadditive and Additive Categories and Biproducts
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Projective and Injective Resolutions
- Properties of the Integral and the Working FTC
- Rank Theorems and Embedded Submanifolds
- Reflective Subcategories and the Adjoint Functor Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Root Systems, Dynkin Diagrams, and the Cartan-Killing Classification
- Roots, Rational Powers, and Classical Inequalities
- Semisimple Lie Algebras, Cohomology, and Levi Theory
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Smooth Manifolds and Smooth Maps
- Smooth Partitions of Unity and Exhaustions
- Smooth Vector Bundles and Sections
- Solvable and Nilpotent Lie Algebras
- Specht Modules and the Irreducibles of the Symmetric Group
- Splitting Fields
- Subobject Lattices Generators and the Grothendieck Axioms
- Subspaces, Products, and Quotients
- 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
- Tangent Cotangent and the Differential
- Tensor Products of Modules
- The BGG Resolution
- The Branching Rule and the Young Graph
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Diagram Lemmas in an Abelian Category
- The Exponential Function
- The Fundamental Group
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Fundamental Theorems of Calculus
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The Holomorphic Inverse Function Theorem and Weierstrass Preparation
- The Identity Theorem, the Maximum Principle and the Open Mapping Theorem
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Logarithm and General Powers
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The Winding Number and the Global Cauchy Theorem
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Tor Flatness and Global Dimension
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Uniform Spaces: the Three Definitions
- Universal Properties, Representables and the Yoneda Lemma
- Vector Fields Flows and Lie Derivatives
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Verma Modules and Shapovalov Forms
- Weyl Character and Multiplicity Formulas
- Young Diagrams Tableaux and Permutation Modules
2 · Summary
The page turns character multiplication into a general alternating tensor-multiplicity formula and then specializes it to type , proving the Littlewood–Richardson and Pieri rules. Tensor-product multiplicities of finite-dimensional simple modules are first named and shown to be the structure constants of formal characters in the completed character ring; the weight-multiplicity formula and the equivalent Schur-lemma description of each multiplicity are recorded on the same footing. Weyl alternation then extracts the multiplicity of any simple summand from the alternation of the product of characters, and multiplying by the Weyl numerator and comparing coefficients yields Steinberg's alternating multiplicity formula and its Racah–Speiser regrouping, in which each weight of one factor is reflected to the dominant chamber and wall weights are discarded.
Minuscule weights are treated next: the definition by coroot pairings, its equivalence with the Weyl orbit of the highest weight, and the orbit-sum character are proved in full, giving the multiplicity-free tensor rule for minuscule weights as a corollary.
The type- half of the page starts from the classification of polynomial representations of by partitions with at most parts. Schur modules are identified as the multiplicity spaces of Schur–Weyl duality, their characters are expanded in semistandard tableaux by Schur–Weyl and Young's rule, and the Littlewood–Richardson tableaux are defined by the lattice-word condition on the reading word. Bender–Knuth involutions supply the symmetry of the tableau generating series; the sign-reversing-involution and bi-alternant argument then counts admissible tableaux. The lattice-word Littlewood–Richardson count is supplied by the explicitly cited theorem and complete proof in Macdonald §I.9; equality of character coefficients relates the two counts and gives the tensor-product rule. No tableau bijection is constructed on this page. The horizontal and vertical Pieri rules, the translation of highest weights by determinant twists, and the stabilization of the coefficients with the rank of the tensor factors are consequences proved here as well.
The companion gives complete direct calculations: the Clebsch–Gordan decomposition for with its Racah–Speiser sum, the computation by the minuscule rule, the Pieri product , the smallest coefficient greater than one, and the two boundary counterexamples on the lattice-word condition and the rank bound.
The Axiom of Choice is stated where the general arguments use the character ring and the classification of finite-dimensional simple modules; the tableau-theoretic items (the Littlewood–Richardson definition, the Bender–Knuth involutions and the tableau-only counterexample) are choice-free and carry no such assumption.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Tensor-product multiplicities for finite-dimensional simple modules
Definition
Assume the Axiom of Choice. Let be a finite-dimensional complex semisimple Lie algebra with Cartan subalgebra , positive system with base , positive cone , Weyl vector , weight lattice and set of dominant integral weights (Finite Weyl root system, lattice and chamber conventions, Integral, dominant, and strictly dominant weights).
For let denote the finite-dimensional simple -module of highest weight (Highest-weight classification), and let carry the tensor-product action (Direct-sum, dual, Hom, and tensor representations). By Weyl's complete reducibility theorem (Weyl's complete reducibility theorem) and the classification of finite-dimensional simple modules there is a decomposition with uniquely determined integers . The direct sum is finite because is finite-dimensional, so its completely reducible decomposition has only finitely many nonzero simple summands. Each constituent highest weight is a weight and lies below in the partial order of weights: every tensor-product weight is a sum of a weight of , which lies in , and a weight of , which lies in (Highest weight modules lie below the top weight).
The integers are the tensor-product multiplicities of . More generally, for a finite-dimensional completely reducible -module we write for the number of summands isomorphic to in any decomposition of into simple modules; this number does not depend on the chosen decomposition. By Schur's lemma (Schur’s lemma for irreducible Lie-algebra representations) the multiplicity has the equivalent hom-space description
Tensor-product multiplicities are character structure constants
Statement
Assume the Axiom of Choice. In the notation of Tensor-product multiplicities for finite-dimensional simple modules, for all the following hold in the completed character ring of The completed formal character ring:
(i) , a finite sum; (ii) if is any finite-dimensional -module and with integers (finitely many nonzero), then for every , so the expansion coefficients of the character are exactly the composition multiplicities and the elements , , are linearly independent in ; (iii) for every weight one has the weight-multiplicity formula a finite sum, where and (The formal character of a finite-dimensional weight module, Weight and weight space).
Facts & Assumptions
Given: AC and dominant integral weights , with the decomposition of Tensor-product multiplicities for finite-dimensional simple modules.
Every finite-dimensional -module is the direct sum of its weight spaces, the tensor product of two finite-dimensional modules has weight spaces , and the formal character is additive over direct sums and multiplicative over tensor products in the completed ring (Finite-dimensional modules decompose into weight spaces, Weight and weight space, Formal characters are additive and multiplicative, The completed formal character ring).
For each the module is the unique simple module of highest weight , its highest weight space is one-dimensional, and every weight of lies in , so is the maximum of the weights of in the root order; moreover every finite-dimensional module is completely reducible (Highest-weight classification, Highest weight modules lie below the top weight, Root order on weights, Tensor-product multiplicities for finite-dimensional simple modules).
Proof
Part (i) is the multiplicativity and additivity of the formal character applied to the decomposition: the tensor product distributes over the direct sum, so in ; the sum is finite by Tensor-product multiplicities for finite-dimensional simple modules.
Part (ii), comparison of coefficients. Let be finite-dimensional with decomposition , . Then . Suppose also with integers , both sums finite. Let be maximal in the root order among the indices with (if there is none, the two families are equal). Evaluating both characters in the weight and using that unless with equality only for , while [F2], gives a contradiction. Hence for all .
Part (ii), linear independence. Suppose with a finite nonempty set and integers , not all zero. Split at the with and and let and ; the vanishing of the alternating sum gives in . Both are characters of finite-dimensional modules, so by step 1.2 the multiplicity families and agree on every , forcing against the choice of . Hence the characters are linearly independent.
Part (iii): by the tensor-product weight-space formula of [F1], , and taking dimensions gives ; only the finitely many pairs of weights of and can contribute, so the sum is finite.
Weyl alternation extracts a dominant highest-weight coefficient
Statement
Assume the Axiom of Choice. Let be a finite-dimensional -module with formal character , the completed character ring of The completed formal character ring, and let be the Weyl alternation operator of The Weyl alternation operator, with for and the Weyl denominator. For every the coefficient of in equals the multiplicity of Tensor-product multiplicities for finite-dimensional simple modules. Explicitly, and for .
Facts & Assumptions
Given: AC, a finite-dimensional -module with decomposition and a dominant integral weight .
Weyl character formula: for , i.e. ; the alternants have finite support, the completed ring contains as an invertible element with inverse the Weyl-denominator geometric series, and (The Weyl character formula, The Weyl alternation operator, Geometric series are invertible in the completed character ring, The completed formal character ring).
The formal character is additive over direct sums and multiplicative over tensor products, and it determines the multiplicities: the coefficient of in satisfies (Formal characters are additive and multiplicative, Tensor-product multiplicities are character structure constants, Weyl's complete reducibility theorem, Highest-weight classification).
For each , is strictly dominant (Positive coroot pairings of a dominant integral weight). Each real Weyl orbit has one closed-dominant representative, and the stabilizer of that representative is generated by the simple reflections whose walls contain it. Thus the stabilizer of is trivial, and if for dominant integral , uniqueness first gives , then triviality of the stabilizer gives (Finite Weyl closed chambers and stabilizers, Integral, dominant, and strictly dominant weights, Finite Weyl root system, lattice and chamber conventions).
Proof
The decomposition of into simple summands and the additivity of the formal character [F2] give , a finite sum. Multiplying by the ring element and using from [F1] gives
Coefficient of a dominant translate. For and any , a finite sum. The term contributes when . If and , then would be a strictly dominant weight conjugate to the strictly dominant weight , which by [F3] forces , a contradiction; hence all such terms are and .
Extraction. Taking the coefficient of in step 1.1 and using step 1.2 gives which is the asserted extraction formula; here the sum over is finite because is finite-dimensional.
Steinberg's tensor-product multiplicity formula
Statement
Assume the Axiom of Choice. For all dominant integral weights the tensor-product multiplicity of Tensor-product multiplicities for finite-dimensional simple modules is where is the weight multiplicity (The formal character of a finite-dimensional weight module) and is the Weyl group with length function ; only finitely many summands are nonzero. Equivalently, after the substitution and Weyl-invariance of the weight multiplicities (Characters of finite-dimensional modules are Weyl-invariant),
Facts & Assumptions
Given: AC, dominant integral weights , the alternation operator with and the Weyl denominator, and the finite-dimensional module .
Coefficients of a character in the completed ring are the tensor multiplicities: with , and (Tensor-product multiplicities for finite-dimensional simple modules, Tensor-product multiplicities are character structure constants).
Alternation extraction: for every finite-dimensional module and , ; in particular (Weyl alternation extracts a dominant highest-weight coefficient).
Weyl character formula and linearity: , the formal character is multiplicative over tensor products, and with finitely many nonzero weights, each weight lying in (The Weyl character formula, Formal characters are additive and multiplicative, The formal character of a finite-dimensional weight module, Finite-dimensional modules decompose into weight spaces, Weight and weight space, The completed formal character ring, Geometric series are invertible in the completed character ring).
The Weyl group is finite and acts on weights by the reflection action; its length function satisfies , the weight multiplicities of a finite-dimensional module are Weyl-invariant, i.e. for all , and the set of weights of is finite (The Weyl group is finite and faithful, Root reflections and the Weyl group action, Characters of finite-dimensional modules are Weyl-invariant, The sign of the Weyl length is multiplicative).
Proof
Let . By multiplicativity and the character formula [F3], . Expanding gives . For each fixed , put ; Weyl invariance [F4] gives . The finite double sum is therefore .
Extract the coefficient of using [F2]: and . Hence because the condition is equivalent to , and terms with outside the finite weight set of contribute .
Equivalent form. Substituting in step 2.1 and using gives , which is the first displayed formula. Applying to the Weyl-invariance of weight multiplicities [F4] with the group element gives relabelling in the sum yields the equivalent form Only finitely many summands are nonzero in either form, since is finite [F4] and has finite support.
The Racah--Speiser tensor-product algorithm
Statement
Assume the Axiom of Choice. Let . For every weight of with multiplicity put and say that is regular relative to when is fixed by no reflection of , equivalently for every root . If is regular relative to , there is a unique with strictly dominant (Finite Weyl closed chambers and stabilizers), and then is a dominant integral weight (the shifted action being ). The Racah--Speiser algorithm computes the multiplicities of Steinberg's tensor-product multiplicity formula as the sum being finite; a weight for which is not regular is discarded, and every with occurs as for some regular weight of .
Facts & Assumptions
Given: AC, dominant integral weights , the weight set of with multiplicities (Weight and weight space), and the Weyl group acting on by the reflection action (Root reflections and the Weyl group action).
Steinberg's formula: the sum being finite (Steinberg's tensor-product multiplicity formula).
The shifted dominant weight is strictly dominant, and (Positive coroot pairings of a dominant integral weight). Every orbit in the real root span has exactly one point in the closed dominant chamber. Its stabilizer is generated by reflections in the simple walls through that point. Consequently a regular has a strictly dominant representative and a unique element sending it there; uniqueness of the element is asserted only for regular points (Finite Weyl closed chambers and stabilizers, Integral, dominant, and strictly dominant weights, Finite Weyl root system, lattice and chamber conventions). In particular is integral; if regular, all simple-coroot pairings of are positive integers, so subtracting leaves nonnegative integral pairings and .
Length parity: for every reflection (the sign is a homomorphism), so (The sign of the Weyl length is multiplicative).
Proof
Rewrite the Steinberg sum by the second argument. For put and , so that by [F1], the sum being finite. Fix a weight of and let where . This set is nonempty exactly when is -conjugate to .
Regular weights contribute one term each. Suppose is regular, so that has trivial stabilizer. If , then is strictly dominant for any , so by the uniqueness in [F2] there is exactly one such , namely where is the unique element with strictly dominant; in that case , and the contribution of to is . If , or if , the weight contributes nothing to .
Irregular weights cancel. Suppose is not regular: is fixed by some reflection . Then is stable under right multiplication by , because for every ; the map is a fixed-point-free involution of , and by [F3] the signs of paired terms are opposite. Since the multiplicity is the same for paired terms, the total contribution of the group to the sum of step 1.1 is .
Combining step 1.2 and 2.1, the value of is the sum of over the regular weights of with , which is the displayed Racah--Speiser formula; the sum is finite because has finitely many weights. If , the displayed sum is nonzero, so at least one regular weight satisfies ; this proves the final assertion.
Minuscule weights
Definition
Assume the Axiom of Choice. Let be a finite-dimensional complex simple Lie algebra, with Cartan subalgebra , root system , positive system , set of dominant integral weights and coroots of roots (Integral, dominant, and strictly dominant weights, Coroot of a Lie-algebra root, Finite Weyl root system, lattice and chamber conventions). Here is the natural pairing, and the coroots of form the dual root system (The root set is a reduced crystallographic root system, Fundamental weights).
A dominant integral weight is minuscule if Since the coroot of a negative root is the negative of the coroot of the positive root, at the level of the sets , and since is dominant integral the pairing is a nonnegative integer for ; hence the displayed condition is equivalent to The zero weight is minuscule, and the Weyl group acts on weights by the reflection action (Root reflections and the Weyl group action).
Minuscule weights have exactly the Weyl orbit as their weights
Statement
Assume the Axiom of Choice. For a dominant integral weight of a finite-dimensional complex simple Lie algebra , the following are equivalent (Minuscule weights):
- is minuscule;
- every weight of the finite-dimensional simple module belongs to the Weyl orbit ;
- every dominant integral weight with equals .
Consequently, if is minuscule, then each weight space of is at most one-dimensional, has exactly distinct weights, and .
Facts & Assumptions
Given: AC, a finite-dimensional complex simple Lie algebra with Cartan subalgebra , root system , positive system , Weyl group , root lattice with positive cone , weight lattice , dominant integral weights , and a dominant integral weight (Finite Weyl root system, lattice and chamber conventions, Integral, dominant, and strictly dominant weights, Minuscule weights).
is minuscule exactly when for every root ; for dominant integral this forces for each simple root. If is minuscule, let be the highest root and write its coroot as , with each a positive integer. Here is the needed support argument. Write with . Its support is nonempty. If it omitted a simple root, connectedness of the irreducible Dynkin graph would give an omitted vertex adjacent to the support. All off-diagonal simple-root inner products are nonpositive, with a negative one along that edge, so , contradicting the dominance of . Thus every . Since and simple coroots form an integral basis of the coroot group, every is a positive integer. Then so exactly one simple coroot, say , pairs nontrivially with , and its pairing is . Thus and . This proves that every nonzero minuscule weight is a fundamental weight; it does not assert that every fundamental weight is minuscule. (Minuscule weights, Height and highest root, Existence and uniqueness of the highest root, Coroot and dual root system, Fundamental weights).
There is a -invariant positive definite inner product on the real span of with ; in particular and -conjugate weights have equal norms (Finite Weyl root system, lattice and chamber conventions, The root set is a reduced crystallographic root system, Positive coroot pairings of a dominant integral weight).
Every weight of a highest weight module with highest weight lies in ; the weights in the Weyl orbit occur in with multiplicity exactly one (Highest weight modules lie below the top weight, Extremal Weyl-orbit weights).
Every Weyl orbit in the real span of the roots meets the closed dominant chamber; for integral weights the representative is dominant integral, because permutes the roots and preserves the weight lattice and the pairings (Finite Weyl closed chambers and stabilizers, Integral, dominant, and strictly dominant weights, Fundamental weights).
For a root , the root vectors , and span a subalgebra isomorphic to (The root sl_2 triple). Finite-dimensional -modules are direct sums of the irreducible modules with -eigenvalues , and the space of vectors of a fixed eigenvalue has dimension the multiplicity of that eigenvalue; root vectors shift weight spaces by (Finite-dimensional representations of sl_2, Root vectors shift weights).
If is a subset of the simple roots, then is a root subsystem with positive simple system : reflections in roots of preserve and , and a positive root supported in can only decompose into positive roots supported in . Write for the connected components of its induced Dynkin graph. The spans of distinct are orthogonal; the simple-reflection generation and root-orbit property show that every root of lies in the span of one such . Each resulting subsystem is irreducible, since an orthogonal decomposition would partition its simple roots into nonempty orthogonal sets and disconnect the graph. Thus these are exactly the irreducible components (Positive systems and simple roots, Simple roots form a signed integral basis, Reducible and irreducible root systems, Unique irreducible decomposition, Finite Weyl positive roots and simple reflections).
Proof
First suppose that is minuscule and nonzero; by [F1] it is a fundamental weight . We argue by induction on the rank of the irreducible root system. Let be dominant integral and write . If some has , delete the vertex from the Dynkin diagram. By [F6], the root subsystem generated by the remaining simple roots is the orthogonal direct sum of the subsystems for the connected components of the deleted diagram; their spans are mutually orthogonal, and is the sum of its component projections . In each component not containing , the projection of is zero, so , where is dominant for that component. Writing , we have because . Positive definiteness gives . The component containing has smaller rank; the projection of is its fundamental weight, still minuscule, and is dominant integral with . The induction hypothesis applies to the irreducible lower-rank system and gives , hence . Thus, if , then for every .
A root-lattice element with all pairings bounded by vanishes: if satisfies for every coroot , then . Suppose not, and choose a counterexample with minimal. Then by positive definiteness, so some has and of the same sign as ; replacing by if necessary, we may assume and , so by the bound. Then is again a counterexample, since for all coroots (the set of coroots is -stable), and it has coordinate sum , contradicting minimality. Hence .
The weight set of a finite-dimensional module is -stable. Let be such a module, let be a weight, and let be simple with . The subalgebra acts on . Decompose it into irreducibles and write a nonzero weight vector as the sum of its components in their weight- spaces. In each irreducible summand where that component is nonzero, the highest weight is some with . If , lowering that component by steps is nonzero and has weight ; if , raising it by steps is nonzero and has weight . Their direct sum is nonzero and has weight . Thus each simple reflection preserves the set of weights, and these reflections generate .
(2)(1): suppose (2) holds and is not minuscule. Then by [F1] there is a positive root with . Let be a highest weight vector; the root vector of the -triple [F5] satisfies , because is annihilated by all positive root vectors and spans the highest weight space of the -module it generates, of highest weight ; this vector has weight (Root vectors shift weights). By (2) there is with , and the -invariance of the form [F2] gives , while because . This contradiction proves (2)(1).
Suppose . For every , , since is the th fundamental weight and is dominant. Together with the assumed nonpositivity at , all simple-coroot pairings of are nonpositive. Therefore , because each . Positive definiteness gives and .
It remains to exclude the case , which is because pairs by and is dominant integral. Write . Then for by step 1.1, and the Cartan-integer formula gives . The off-diagonal Cartan integers are nonpositive, so and the integer is positive; hence every . Let be the highest root and write with all as in [F1]. By Existence and uniqueness of the highest root, for every simple root. Since is a positive scalar multiple of , this gives ; at least one is positive because the simple roots span and . Therefore . By [F1], , so . This is a nonnegative integer because is dominant integral and every ; hence it is zero, all simple-coroot pairings of vanish, and . Thus ; since was in , this proves before applying the root-lattice lemma.
(3)(2): let be a weight of . By [F4] choose with dominant; by step 1.3 and induction on a decomposition of into simple reflections, is again a weight of , hence by [F3]. Assumption (3) gives , so .
Conclusion of (1)(3): if the case of step 2.2 occurs, it gives and . The nonzero minuscule weight has all coroot pairings bounded in absolute value by , so step 1.2 now applies and forces , a contradiction. Together with step 2.1, this proves and . If and with , then because is dominant; positive definiteness gives . This proves (1)(3).
Consequences. Assume is minuscule. By (2) every weight of lies in , and by [F3] every element of occurs with multiplicity exactly one; hence every weight space is one-dimensional (in particular at most one-dimensional), there are exactly distinct weights, and .
Tensor product with a minuscule representation
Statement
Assume the Axiom of Choice. Let be a minuscule weight (Minuscule weights) of a finite-dimensional complex simple Lie algebra , and let . Then where is read as when ; equivalently the sum runs over those with dominant integral and each such summand occurs once. In characters,
Facts & Assumptions
Given: AC, a minuscule weight , a dominant integral weight , the Weyl orbit , and the alternation operator with in the completed character ring (The Weyl alternation operator, The completed formal character ring).
Orbit-sum character: (Minuscule weights have exactly the Weyl orbit as their weights, Minuscule weights).
Weyl character formula: and, for every , ; formal characters are multiplicative on tensor products, is invertible in , and in any finite-dimensional module the coefficients of the simple characters are their multiplicities. Every finite-dimensional -module is completely reducible (The Weyl character formula, Formal characters are additive and multiplicative, Geometric series are invertible in the completed character ring, Tensor-product multiplicities are character structure constants, Weyl's complete reducibility theorem).
Alternant vanishing on walls: if a reflection fixes , then ; equivalently is skew-invariant, for a reflection, so whenever lies on a wall (Weyl alternants are skew-invariant, The Weyl alternation operator).
For every one has for every positive root : by Minuscule weights the pairing of with every coroot lies in , and with , a pairing of with a coroot. If a weight has for a simple coroot, then : the positive-root half-sum definition of and the fact that permutes the positive roots other than give and therefore (The Weyl vector rho for a chosen positive system, Finite Weyl positive roots and simple reflections). Hence is fixed by and lies on its wall (Finite Weyl root system, lattice and chamber conventions, Integral, dominant, and strictly dominant weights, Finite Weyl closed chambers and stabilizers).
Proof
By [F1], [F2] and multiplicativity, For each fixed , the map permutes the orbit , so the inner sum is unchanged when is replaced by . Reindexing the finite double sum therefore gives
Non-dominant translates vanish. Let with . Since and by [F4] for every positive root, there is a simple coroot with ; then , because and , and hence . Thus is fixed by the reflection , and by [F3].
For a translate with , by the character formula [F2]. Substituting these dominant terms and the vanishing terms of step 1.2 into step 1.1 gives Cancelling the invertible element in the ring [F2] gives the asserted character identity ; the sum is finite because is finite.
Decomposition. By Weyl complete reducibility, both finite-dimensional modules in the character identity of step 2.1 decompose as finite direct sums of the pairwise non-isomorphic simples . The right-hand side is finite because is finite. Equality of their characters, together with the multiplicity-uniqueness clause of [F2], forces the multiplicities of each to agree. This gives the asserted module isomorphism, with every surviving summand occurring once.
Polynomial representations of GL_r and their highest weights
Definition
Assume the Axiom of Choice. Let be a finite-dimensional complex vector space of dimension and put ; fixing a basis, identify with and let denote the matrix entries of . A finite-dimensional representation is polynomial if in some pair of bases (equivalently, in every pair of bases) the matrix coefficients of are polynomial functions of the ; it is rational if these coefficients are rational functions defined on all of .
For the diagonal torus a polynomial representation is a direct sum of weight spaces the eigenvalues with being the weights of (Etingof §27.3; Goodman--Wallach Ch. 8 §8.1.2). A weight of a polynomial representation has nonnegative entries, : the matrix coefficients are polynomial and occurs as a polynomial character, so is impossible. Consequently the highest weight of a polynomial irreducible representation of (with respect to the Borel subgroup of upper triangular matrices) is a partition padded by zeros, that is, a partition with at most parts (Partitions, English diagrams, and conjugation).
For every partition with put and let be the Schur--Weyl module of Schur-Weyl decomposition and highest weights, where is the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules) and acts on by place permutations (Commuting symmetric-group and linear actions on a tensor power). Then is a nonzero polynomial irreducible representation of of highest weight , and distinct partitions with at most parts give non-isomorphic modules (Schur-Weyl decomposition and highest weights parts (1)--(4)). Conversely every polynomial irreducible representation of is isomorphic to for exactly one partition with : this is the classical type- highest-weight classification of polynomial representations (Etingof §27.3--27.4; Goodman--Wallach Theorem 5.5.22 for the corresponding rational classification; see Schur modules and their characters for the module notation used below).
Schur modules and their characters
Definition
Assume the Axiom of Choice. Let with , and let be a partition with at most parts (Partitions, English diagrams, and conjugation). Put and define the Schur module where is the complex Specht module (Column antisymmetrizers, polytabloids, and Specht modules) and acts on by place permutations (Commuting symmetric-group and linear actions on a tensor power); the -action is by postcomposition, . By Schur-Weyl decomposition and highest weights the space is a nonzero irreducible polynomial -module of highest weight in the sense of Polynomial representations of GL_r and their highest weights; for a partition with we define .
Let be the diagonal torus as in Polynomial representations of GL_r and their highest weights. The character of a finite-dimensional polynomial -module is the polynomial where is the weight space of . Characters are additive over direct sums, and for finite-dimensional polynomial modules, because . The character of a polynomial module is a symmetric polynomial: conjugation by a permutation matrix carries to , and characters of representations of a group are class functions, so is invariant under permuting . In particular is a symmetric polynomial for , homogeneous of degree because the Schur--Weyl decomposition of Schur-Weyl decomposition and highest weights exhibits as a direct summand of , all of whose weights have total degree ; it is for .
Remarks. The module is the multiplicity space of Schur-Weyl decomposition and highest weights; the two notations denote the same object. The character is computed explicitly in Semistandard tableaux expand Schur characters as the sum over semistandard tableaux of shape with entries in , and it is the rank- Schur polynomial of Stable Schur functions from bialternants.
Semistandard tableaux expand Schur characters
Statement
Assume the Axiom of Choice. Let , (Schur modules and their characters), and let be a partition with (Partitions, English diagrams, and conjugation). Then the sum over all semistandard tableaux of shape with entries in , where records the multiplicity of each entry (Semistandard tableaux and Kostka numbers, Skew diagrams and semistandard skew tableaux). Moreover this polynomial is the rank- Schur polynomial of Stable Schur functions from bialternants, i.e. for , while and when . In particular if and only if , and the multiplicity of the weight in equals the number of semistandard tableaux of shape and weight ; by Bender--Knuth involutions permute the weights of semistandard tableaux this polynomial is symmetric in .
Facts & Assumptions
Given: AC, with basis , a partition with and , and the module of Schur modules and their characters.
Schur--Weyl decomposition: as -modules, and for every with the module is a nonzero irreducible polynomial -module, while for (Schur-Weyl decomposition and highest weights parts (1) and (2), Polynomial representations of GL_r and their highest weights).
Young's rule: for partitions the multiplicity of the Specht module in the Young permutation module equals the Kostka number , the number of semistandard tableaux of shape and weight (Young's rule for complex permutation modules, Young subgroups, tabloids, and permutation modules, Semistandard tableaux and Kostka numbers); the Specht modules , , form a complete set of pairwise non-isomorphic simple -modules (Specht modules classify the complex irreducibles of , Column antisymmetrizers, polytabloids, and Specht modules).
has the basis of elementary tensors on which acts by place permutations; the diagonal torus of acts on by the weight whose -th component is the number of indices equal to (Commuting symmetric-group and linear actions on a tensor power, Schur modules and their characters).
At rank the tableau expansion holds over semistandard tableaux of shape with entries in when , and when ; the left-hand side is the bialternant quotient of Stable Schur functions from bialternants (Skew Jacobi–Trudi and tableau expansion with ).
A homomorphism between non-isomorphic irreducible -modules is zero. Also : any endomorphism has an eigenvalue over , and its difference from has a nonzero kernel, so irreducibility makes that difference zero. Consequently the multiplicity of in a direct sum of simples equals the dimension of its Hom-space into that sum (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and is a division ring, Specht modules classify the complex irreducibles of ).
Proof
First fix a partition with at most parts, padded by zeros to length . By [F3] the weight- subspace of has as its basis the elementary tensors whose index word has content . The group permutes these basis vectors by place permutations, and the action on the basis is transitive (any word with content is a rearrangement of ), with the stabilizer of a word of content being the subgroup of permutations preserving the letter classes, a conjugate of the Young subgroup ; hence is isomorphic to the Young permutation module (Young subgroups, tabloids, and permutation modules).
By Young's rule [F2] the multiplicity of the simple module in is the Kostka number , which by Semistandard tableaux and Kostka numbers is the number of semistandard tableaux of shape and weight .
Compare the -isotypic -component of . By the Schur--Weyl decomposition [F1] and non-isomorphism of distinct Specht modules [F2], the -isotypic component of is , on which acts on the first factor alone; therefore the -multiplicity in equals , the dimension of the weight- space of the -module . Combined with step 2.1 this gives
For an arbitrary weight of total , sort its entries into a partition . A permutation matrix carries the weight- space of isomorphically onto its weight- space, by conjugating the diagonal torus. The Bender--Knuth involutions of Bender--Knuth involutions permute the weights of semistandard tableaux likewise give a bijection between tableaux of weights and ; use a product of adjacent transpositions sorting . Thus step 3.1 holds for every composition weight , with denoting this tableau count. Summing these weight dimensions over all and using the definition of the character of Schur modules and their characters gives , summed over semistandard tableaux of shape with entries in . By the tableau expansion of [F4] this equals ; the case is the vanishing definition , matched by in [F4]. In particular exactly when or has no semistandard tableau with entries in ; the latter never happens for (fill row with the letter ), so if and only if , and the multiplicity of each weight in is the number of semistandard tableaux of shape and weight .
The polynomial is symmetric in by Bender--Knuth involutions permute the weights of semistandard tableaux, consistently with being the bialternant quotient, whose numerator and denominator are alternating and whose quotient is therefore a symmetric polynomial.
Littlewood--Richardson tableaux and coefficients
Definition
Let be partitions with , and let be a partition with . Use the conventions of Skew diagrams and semistandard skew tableaux for the skew diagram and for semistandard skew tableaux of shape , and those of Semistandard tableaux and Kostka numbers for the content of a tableau; recall that entries of a semistandard skew tableau weakly increase along rows and strictly increase down columns (Partitions, English diagrams, and conjugation fixes the English row and column coordinates).
The reading word of a semistandard skew tableau of shape is the word obtained by reading the rows of from right to left, beginning with the top row and proceeding to the bottom row. The word is a lattice word (a lattice permutation) if in every prefix and for every the number of letters in the prefix is at least the number of letters ; the empty word is a lattice word vacuously.
A Littlewood--Richardson tableau (LR tableau) of shape and content is a semistandard skew tableau of shape and content whose reading word is a lattice word. The Littlewood--Richardson coefficient is the number of LR tableaux of shape and content ; it is when , when , or when no such tableau exists. For and the empty skew tableau is the unique tableau of content , its reading word is empty, and hence ; more generally unless , and unless and .
Bender--Knuth involutions permute the weights of semistandard tableaux
Statement
Fix and a skew shape (for a partition shape take ), let , and let be a semistandard skew tableau of shape with entries in (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers). Call an entry or of free if there is no respectively no in the same column. Then:
(i) the free positions in each row occupy consecutive cells of that row; (ii) replacing in every row the free 's and free 's by their complementary counts (if the row has free 's and free 's, then after the replacement it has free 's and free 's in the same free cells, the remaining entries unchanged, the free cells filled from left to right by the copies of followed by the copies of ) produces again a semistandard skew tableau of the same shape, with entries in ; (iii) is an involution of the set of semistandard skew tableaux of shape with the same set of free positions, and , where is the transposition of and acting on weights (Semistandard tableaux and Kostka numbers, with weights read as vectors in ).
Consequently, for every weight the number of semistandard skew tableaux of shape and weight equals the number of weight , and the generating function , over semistandard skew tableaux of shape with entries in , is symmetric in (Partitions, English diagrams, and conjugation).
Facts & Assumptions
Given: , a skew shape with partitions and , an index , and a semistandard skew tableau of shape with entries in .
A semistandard skew tableau fills the cells of the skew diagram with positive integers, weakly increasing from left to right in each row and strictly increasing from top to bottom in each column; its weight is with the number of entries equal to , and its monomial is (Semistandard tableaux and Kostka numbers, Skew diagrams and semistandard skew tableaux).
The Young diagram consists of the cells with , (English coordinates), and its columns are the 's with , so a cell belongs to exactly when (Partitions, English diagrams, and conjugation, Skew diagrams and semistandard skew tableaux).
Proof
Given: , , , as above.
In a skew diagram, row consists of the interval , and column consists of the interval . Two rectangle-completion properties will be used. If are cells with and , then is a cell: . If are cells with and , then is a cell: . These use the weakly decreasing row lengths of both partitions.
No column contains two free cells: a column contains at most one and at most one by strict increase, a column containing a free contains no at all (freely), and a column containing a free contains no at all (freely); so a column cannot contain both a free and a free , and cannot contain two entries equal to the same letter. Consequently, in the modification of (ii) each column changes in at most one cell.
Structure of the free cells of a row. Let be a cell of with entry that is not free. Then some cell of the same column has entry ; by strict increase of the column . If is a cell of the same row with and entry , then is a cell by step 1.1, and inside row one has , while strictly increasing column gives ; hence and is not free. So the non-free 's of a row form an initial segment of its block of 's, read from the left. Symmetrically, if the entry at is not free, there is a cell with and entry ; for a cell with and entry , step 1.1 makes a cell, and by weak increase in row and by strict increase in column , so and is not free. Hence the non-free 's of a row form a final segment of its block of 's. Since the entries of a row are weakly increasing, the cells carrying precede those carrying , and combining the two statements the unblocked cells carrying (a final segment of the -block) and those carrying (an initial segment of the -block) form one consecutive block of cells of the row, proving (i).
The modification produces a semistandard tableau. Rows: by step 2.1 the free cells of a row form consecutive cells, the entry immediately left of the block, if present, is a non-free or a smaller letter, the entries of the block after the modification lie in and are filled weakly increasingly, and the entry immediately right of the block, if present, is a non-free or a larger letter; so rows stay weakly increasing. Columns: by step 1.2 only one entry of a column can change. If a free at is replaced by , then column contains no , so every entry above is and every entry below is , and strict increase persists; if a free is replaced by , column contains no entry , so every entry above is and every entry below is , and strict increase persists. The entries stay in because . This proves (ii).
Involution and weight. The modification is reversible: it is performed on the free cells, and by step 1.2 the free cells of are the same cells (a cell that was free remains the only cell of its column with an entry in , hence remains free), while every other cell is unchanged, so no free cell is created or destroyed. Hence is an involution with the same free cells. For the weight, let and be the numbers of entries equal to and to in , and let , be the total numbers of free 's and free 's. The non-free 's are in bijection with the non-free 's: send a non-free to the unique below it in its column (existence is the definition of non-free, uniqueness is strict increase in the column, and the image is non-free because its column contains that ); the inverse sends a non-free to the unique above it. Hence . The modification deletes the free 's and free 's and inserts copies of and copies of in their place, so the number of 's in is and the number of 's is , all other letter counts being unchanged. Thus .
Consequences. By step 3.1 and 4.1, is a weight--equivariant involutive bijection of the set of semistandard skew tableaux of shape with entries in ; hence it restricts to a bijection between the tableaux of weight and those of weight , so those two sets have the same cardinality. Consequently the generating function satisfies , which is with and interchanged; thus is invariant under each adjacent transposition of the variables. Every permutation of is a product of adjacent transpositions (bubble-sort any ordering), so is invariant under all permutations of the variables, that is, symmetric.
The admissible-tableau count equals the Littlewood--Richardson coefficient
Statement
Assume the Axiom of Choice. Let , , and let be partitions with . Write , , and over semistandard tableaux of shape with entries in (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants). Say that a semistandard tableau of shape with entries in is admissible for if is a partition with at most parts for every , where is the subtableau consisting of the entries in columns . Then:
(i) (bi-alternant expansion) the second identity obtained by dividing by and using for admissible .
(ii) For every partition with , the number of admissible tableaux of shape with equals the number of Littlewood--Richardson tableaux of shape and content , namely the Littlewood--Richardson coefficient (Littlewood--Richardson tableaux and coefficients). This count identity is the classical Littlewood--Richardson comparison; it is cited to Macdonald §I.9, (9.2)--(9.4), whose Littlewood--Robinson algorithm proves it. No bijection between the two tableau sets is asserted here. Moreover the multiplicity of in the polynomial -module equals , because the character of that tensor product is (Schur modules and their characters) and the multiplicities are read off from the expansion in the basis of characters of pairwise non-isomorphic simple modules (Schur-Weyl decomposition and highest weights parts (2) and (3)).
Facts & Assumptions
Given: AC, , partitions with , the alternants and the bialternant Schur polynomials at rank , and the set of semistandard tableaux of shape with entries in .
over semistandard tableaux of shape with entries in , and this polynomial is symmetric in ; for a partition with one has the bialternant formula (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, Skew Jacobi–Trudi and tableau expansion).
Bender--Knuth involutions: for there is an involution of the set of semistandard tableaux of shape with entries in , obtained by complementing the counts of free 's and free 's in each row, with ; consequently is invariant under exchanging and , hence symmetric (Bender--Knuth involutions permute the weights of semistandard tableaux); moreover for every and every exponent vector , since is the determinant . A or of a subtableau is free in exactly when it is free in , because a column of a skew tableau consists of all cells of with that column index.
The tensor product is a direct summand of : each factor is a direct summand of its tensor power by Schur--Weyl decomposition, and tensoring the inclusions and retractions gives a retraction onto . That larger tensor power is a finite direct sum of the simple Schur modules by Schur-Weyl decomposition and highest weights. A direct summand is again a direct sum of these simples: Schur's lemma makes its equivariant idempotent act by a scalar matrix on each isotypic multiplicity space; each scalar matrix is an idempotent and its image is a vector space of copies of the same simple (Schur's lemma for irreducible representations: a nonzero intertwiner is an isomorphism, and is a division ring; scalarity follows by applying the nonzero-kernel argument to an eigenvalue). The Schur characters at rank are linearly independent: multiply a finite relation by ; the strictly decreasing exponent vector occurs in exactly when , with coefficient one. Thus character coefficients in a Schur expansion of are its direct-summand multiplicities (Schur modules and their characters, Stable Schur functions from bialternants).
The classical Littlewood--Richardson theorem expands the product in the Schur basis with coefficient equal to the number of semistandard skew tableaux of shape , content , and lattice reading word, as defined in Littlewood--Richardson tableaux and coefficients. Macdonald's complete Littlewood--Robinson proof in §I.9 establishes this count formula; this item imports that theorem and makes no bijection claim between those tableaux and the admissible tableaux of part (i).
Proof
First identity. Since is symmetric by [F1] and acts on monomials by , for every one has Multiplying by , summing over , and using gives .
The bad guys cancel. Call bad if fails to be a partition for some ; equivalently for some pair . Among the pairs with maximal and then minimal, one has: is a partition (by maximality of ), the difference changes by at most one when passing from to , and hence column contains a and no , with Let be obtained from by applying the Bender--Knuth involution to the subtableau and leaving the rest unchanged. This is well defined and involutive: by the last sentence of [F2] the free cells of are the free cells of lying in columns , so the modification swaps the counts of free 's and free 's in each row of ; row weak increase within follows from the Bender--Knuth lemma. Across its boundary, only a changed to could cause a problem. But column contains no , so a boundary neighbour in that column which was at least is at least . Hence it remains at least the changed entry (Bender--Knuth involutions permute the weights of semistandard tableaux); column strictness is preserved because each column changes in at most one cell, as in the proof of Bender--Knuth involutions permute the weights of semistandard tableaux. Moreover , so is bad again, and the same pair is selected for : the violation tests at all levels are unchanged, so is still maximal; and the test at level is unchanged, so is still minimal. Hence applying to returns , and is an involution of the set of bad guys.
Cancellation. By [F2], and . The equality in step 1.2 says that fixes , so . Since [F2] and the transposition is odd, , so the paired terms cancel; if , its alternant equals its negative and is zero over in the sum of step 1.1. The bad guys therefore contribute , and the surviving tableaux are exactly the admissible ones, proving the first identity of (i).
Second identity. For admissible the vector is a partition with at most parts (take ), so by the bialternant formula [F1] . Substituting into step 2.1 and cancelling the nonzero polynomial gives .
The admissible-tableau count is the LR coefficient. By step 3.1, the coefficient of in is the number of admissible tableaux with . The Littlewood--Richardson theorem [F4] says that this same Schur coefficient is , the number of LR tableaux of shape and content . Thus the two counts agree.
Tensor multiplicities. Combining steps 3.1 and 4.1, the coefficient of in is for every partition with . Since and this tensor product is completely reducible with linearly independent Schur characters [F3], the multiplicity of in is the coefficient of , namely ; the terms with do not occur because there.
Remarks
Source note. The admissible-tableau/LR-tableau count identity in step 4.1 is imported from the complete Littlewood--Robinson proof in Macdonald §I.9; the exact equation locator remains in the source metadata. Stembridge, printed p. 3, records the comparison as an exercise. The finite checks in the Step 3b report are corroboration only; no explicit bijection is claimed or used.
The Littlewood--Richardson tensor-product rule
Statement
Assume the Axiom of Choice. Let , , and let be partitions with . Then the finite direct sum over partitions with at most rows, where is the Littlewood--Richardson coefficient of Littlewood--Richardson tableaux and coefficients; unless and . Equivalently in characters with for (Stable Schur functions from bialternants); the coefficients do not depend on .
Facts & Assumptions
Given: AC, , partitions with , and the tensor product with its -action.
The modules with are nonzero pairwise non-isomorphic irreducible polynomial -modules with characters , and for ; distinct Schur characters , , are linearly independent (Schur modules and their characters, Semistandard tableaux expand Schur characters, Schur-Weyl decomposition and highest weights parts (2) and (3), Polynomial representations of GL_r and their highest weights).
The tensor product is a polynomial -module of finite length whose character is , and the multiplicity of in it equals for every with (The admissible-tableau count equals the Littlewood--Richardson coefficient, Schur modules and their characters).
A skew shape is nonempty only if and ; a LR tableau of shape has content with , so unless and (Littlewood--Richardson tableaux and coefficients, Partitions, English diagrams, and conjugation).
Only finitely many partitions have the fixed size , since their parts and lengths are bounded by that size; the size condition in [F3] therefore makes the sum finite (Partitions, English diagrams, and conjugation, Littlewood--Richardson tableaux and coefficients).
Proof
Decomposition. By [F2] the multiplicity of in equals for every partition with . The module is completely reducible by the tensor-power retraction proved in the supplier of [F2], and its irreducible summands are among the pairwise non-isomorphic simple modules with by [F1]; therefore where the sum is finite by [F4] and the vanishing statement of [F3] removes all with or .
Characters. Taking characters in step 1.1 and using additivity and multiplicativity of the character together with [F1] gives , where terms with are by definition of and .
Independence of . The coefficient of in step 2.1 is , the number of LR tableaux of shape and content (Littlewood--Richardson tableaux and coefficients); this is a count of tableaux of a fixed skew shape and content, so it does not mention the rank at all, and the multiplicity statement of step 1.1 identifies the same integer as the multiplicity in the tensor product for every with . Hence the coefficients appearing in the decomposition are independent of , as claimed.
The horizontal Pieri rule
Statement
Assume the Axiom of Choice. Let , , let be a partition with and let . Then the sum over those partitions of with and for which the skew diagram is a horizontal strip (at most one box in each column, Skew diagrams and semistandard skew tableaux), each summand occurring with multiplicity one; equivalently in the rank- Schur basis, where is the -th symmetric power (Symmetric and exterior powers over an arbitrary field).
Facts & Assumptions
Given: AC, , a partition with and an integer .
For , the one-row Specht module is trivial: its tabloid module has one basis element and all column stabilizers are trivial. Thus . This is isomorphic to the quotient symmetric power of Symmetric and exterior powers over an arbitrary field: the averaging operator annihilates every coinvariance relation and induces the inverse to the quotient map restricted to invariants, because and fixes invariant tensors. These maps commute with (Schur modules and their characters, Column antisymmetrizers, polytabloids, and Specht modules). For , use the empty partition in place of ; its Schur module, and are all .
Littlewood--Richardson rule: for partitions with , , with the number of LR tableaux of shape and content , and unless and (The Littlewood--Richardson tensor-product rule, Littlewood--Richardson tableaux and coefficients).
A semistandard skew tableau of shape and content has all its entries equal to ; weak increase along rows is automatic, and strict increase down columns forces every column of to contain at most one box, so such a tableau exists if and only if is a horizontal strip, and then it is unique; its reading word is the constant word , a lattice word (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers, Littlewood--Richardson tableaux and coefficients).
The complete symmetric polynomial equals by the one-row tableau expansion (and ), and the Schur polynomials , , are linearly independent: after multiplying a finite relation by , the coefficient of the strictly decreasing exponent vector is exactly that relation’s coefficient of (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, The Littlewood--Richardson tensor-product rule).
Proof
Apply the Littlewood--Richardson rule [F2] with for and for , and use from [F1]:
For , the unique empty tableau gives the single summand . For , the coefficient counts LR tableaux of shape and content ; by [F3] this number is when is a horizontal strip and otherwise, and it vanishes unless and by [F2]. Substituting into step 1.1 gives the direct-sum decomposition, the sum being over precisely those horizontal strips.
Taking characters in step 2.1 and using and [F4] gives in the rank- Schur basis; the two displayed statements are equivalent by the linear independence of the Schur characters [F4].
The vertical Pieri rule
Statement
Assume the Axiom of Choice. Let , , let be a partition with and let . Then the sum over those partitions of with and for which the skew diagram is a vertical strip (at most one box in each row, Skew diagrams and semistandard skew tableaux), each summand occurring with multiplicity one; equivalently in the rank- Schur basis, where is the -th exterior power (Symmetric and exterior powers over an arbitrary field).
Facts & Assumptions
Given: AC, with basis , a partition with , and an integer .
The one-column Specht module is the sign representation: its column stabilizer is all of , and the signed sum of its distinct tabloids spans a line on which every permutation acts by its sign. Therefore is the subspace of alternating tensors. It is isomorphic to the quotient exterior power in Symmetric and exterior powers over an arbitrary field via . The displayed multilinear map vanishes when two inputs agree (pair permutations by their transposition), so it factors through the quotient. Conversely the quotient of this signed average is the original wedge, since a transposition changes a wedge's sign by expanding a repeated input ; the signed average fixes every alternating tensor. These are inverse equivariant maps (Schur modules and their characters, Column antisymmetrizers, polytabloids, and Specht modules). For , means and both spaces are ; for both spaces vanish (If , then ).
Littlewood--Richardson rule: for partitions with , , where is the number of LR tableaux of shape and content , vanishing unless and (The Littlewood--Richardson tensor-product rule, Littlewood--Richardson tableaux and coefficients).
Let be a semistandard skew tableau of shape and content , i.e. with entries each occurring once. Its reading word is a permutation of ; it is a lattice word exactly when , because the first letter of a lattice word of content must be , and inductively the -th letter must be . If contains two boxes in the same row, at columns , then the right cell is read before the left cell in the reading order, while semistandardness gives the strictly smaller entry on the left, so in the reading word the larger entry precedes the smaller entry and the word is not . Hence an LR tableau of content exists only if is a vertical strip; conversely, if is a vertical strip, filling the boxes with in the order in which they are read (equivalently, from top row to bottom row, since each row has at most one box) makes every column strictly increasing downward and gives the reading word , so the filling is the unique LR tableau of shape and content (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers, Littlewood--Richardson tableaux and coefficients).
The elementary symmetric polynomial equals by the one-column tableau expansion; and for . It is the character of , and the Schur characters , , are linearly independent (Semistandard tableaux expand Schur characters, Stable Schur functions from bialternants, The Littlewood--Richardson tensor-product rule).
Proof
If , the tensor product is zero by [F1], and the proposed sum is empty because a vertical strip inside at most rows has at most boxes. For , apply the Littlewood--Richardson rule [F2] with and use from [F1]:
By [F3] the coefficient is when is a vertical strip and otherwise, and it vanishes unless and by [F2]. Substituting into step 1.1 gives the decomposition, summed over precisely the vertical strips; for the left-hand side is zero by [F1], and indeed a vertical strip of size inside the rank- page has , which is impossible with boxes at most one per row.
Taking characters in step 2.1 and using and [F4] gives in the rank- Schur basis, the two statements being equivalent by the linear independence of the Schur characters [F4].
Determinant twists translate GL_r highest weights
Statement
Assume the Axiom of Choice. Let as in Schur modules and their characters, and let be the determinant character. Write for when using row-length coordinates; these zeros are not parts.
(i) For every partition with and every integer , let denote the partition obtained from by deleting all trailing zeros; the all-zero tuple gives (Partitions, English diagrams, and conjugation). Then one has as rational -modules, where for is the -fold tensor power of the dual of the one-dimensional module (On , the induced map is multiplication by , Determinant multiplicativity follows from the top exterior power).
(ii) Consequently the irreducible rational representations of are, up to isomorphism, exactly the twists with a partition of at most parts and ; the irreducible rational representation of highest weight is , where is obtained from by deleting all trailing zeros, again giving if every coordinate is zero.
Facts & Assumptions
Given: AC, , the diagonal torus and its characters , the one-dimensional determinant module with character , the Laurent character ring in which characters of rational -modules are expanded, and the Schur modules (Schur modules and their characters, On , the induced map is multiplication by ).
for and for ; characters of finite-dimensional rational modules are additive over direct sums and multiplicative over tensor products, and the character of is for every (Semistandard tableaux expand Schur characters, Schur modules and their characters, On , the induced map is multiplication by , Determinant multiplicativity follows from the top exterior power).
Bialternant description: for a partition with , with and (Stable Schur functions from bialternants).
Classification of irreducible rational representations: the irreducible rational -modules are exactly the modules with , , and the highest weight of is ; two irreducible rational modules with the same highest weight are isomorphic (Goodman--Wallach Theorem 5.5.22; Seynnaeve §12.1 Proposition 12.1). Every is a polynomial irreducible of highest weight (Polynomial representations of GL_r and their highest weights).
Proof
Determinant scaling of the alternant. Put with the zero-removal convention in (i). Since , the shifted coordinates are weakly decreasing and nonnegative, so is a partition with at most parts. After padding its coordinates back to length , . Thus every entry in row of the alternant matrix for is multiplied by to obtain the matrix for , giving Dividing by in the Laurent rational function field and applying [F2] yields This identity is valid also for negative ; the left side is a polynomial because the shifted coordinates are nonnegative.
By [F1] and step 1.1, . Tensoring with the one-dimensional character preserves invariant subspaces: each representing operator is multiplied by a nonzero scalar. Hence is irreducible, and its highest weight is , since a highest weight vector is multiplied on the diagonal torus by and is trivial on the upper unipotent subgroup. The polynomial irreducible has the same padded highest weight by [F3]. Highest-weight uniqueness in [F3] gives the isomorphism in (i).
By [F3] every irreducible rational module is for a partition of at most parts and , and conversely each such twist is irreducible of highest weight . For a dominant integral highest weight , take and form by deleting the trailing zeros of . This is a partition, including when all coordinates vanish, and its padded coordinates satisfy . Thus has highest weight and is the required irreducible by [F3]. The parametrisation with padded last coordinate is unique: then and the remaining positive coordinates determine . Arbitrary pairs need not be unique.
Littlewood--Richardson coefficients stabilise with rank
Statement
Assume the Axiom of Choice. Let be partitions, padding their row-length coordinates by zeros when needed, and let be the Littlewood--Richardson coefficients of Littlewood--Richardson tableaux and coefficients.
(i) If , then and ; in particular and .
(ii) For every the tensor product over decomposes as with the same coefficients for every such ; if no coefficient visible at a larger rank is lost, and for every such one has with for (Stable Schur functions from bialternants).
Facts & Assumptions
Given: AC, partitions , and the LR coefficients defined as counts of LR tableaux of skew shapes and content (Littlewood--Richardson tableaux and coefficients).
The LR coefficient counts semistandard skew tableaux of shape with content whose reading word is a lattice word; such a tableau exists only when and has exactly boxes, and its entries lie in because the letter occurs times for (Littlewood--Richardson tableaux and coefficients, Semistandard tableaux and Kostka numbers, Skew diagrams and semistandard skew tableaux).
Column contains a box in every row for which . A column of a skew diagram has its boxes in consecutive rows, and strict increase down that column gives distinct letters (Skew diagrams and semistandard skew tableaux, Semistandard tableaux and Kostka numbers).
Littlewood--Richardson tensor rule: for , for , and the character identity holds with for (The Littlewood--Richardson tensor-product rule, Schur modules and their characters, Stable Schur functions from bialternants).
Proof
Suppose and let be an LR tableau of shape and content . The containment and the size identity are part of [F1]. For the first row, read from right to left: the reading word of begins with the entries of the first row (weak increase becomes weak decrease read right to left), where is the number of boxes of the first row of the skew diagram. If , the lattice condition at the first letter forces : otherwise that prefix has one and no . Hence for every ; if , the desired inequality holds immediately, so all first-row entries equal and because contains only copies of . Hence , i.e. .
Row bound. Suppose has a box in row . Since , we have for every ; since row occurs in the partition , we also have for every . Thus each row contributes a box in column to , giving at least boxes in that column. Strict increase down the column makes their entries distinct, and all entries lie in because the tableau has content [F1]; hence , contradicting . Therefore .
Part (ii) for the tensor product is exactly [F3], applied at each rank ; the coefficients appearing are the rank-independent tableau counts of Littlewood--Richardson tableaux and coefficients, so they are the same for every such . If , then every with satisfies by step 1.2, so no coefficient disappears when the rank is lowered to from a larger rank; equivalently no coefficient visible at a larger rank is lost.
The character identity is the character form of the decomposition in [F3], with the convention for ; it holds for every by [F3]; once , the set of partitions with nonzero coefficients and those coefficients are independent of by step 2.1. The Schur polynomials themselves are evaluated in the rank-dependent variables .
5 · Examples, counterexamples and false statements
None yet.
Sources
- P. Etingof, Lie Groups and Lie Algebras II (MIT 18.755, Spring 2024), complete lecture notes
- R. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants, Graduate Texts in Mathematics 255, Springer 2009
- A. W. Knapp, Lie Groups Beyond an Introduction, 2nd ed., Birkhäuser 2002
- D. E. Littlewood and A. R. Richardson / G. Racah and J. Speiser, as presented in R. Goodman and N. R. Wallach, Symmetry, Representations, and Invariants, GTM 255, Springer 2009
- T. Seynnaeve, Representation Theory (lecture notes, Bern)
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Chapter I §5
- J. R. Stembridge, A Concise Proof of the Littlewood--Richardson Rule, Electronic Journal of Combinatorics 9 (2002), #N5, 4 pp.
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Chapter I §9