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.
An outer-induction multiplicity greater than one
Statement
Let and . Then, as a complex -module,
The multiplicity of is , realized by the two LR tableaux of shape and content with their single entry at and , respectively; their reading words are and . The dimension check is
Facts & Assumptions
Given: , , and .
In English coordinates, ; for , containment is equivalent to and (Partitions, English diagrams, and conjugation).
Content requires exactly three entries and one entry (Semistandard tableaux and Kostka numbers).
The skew diagram is ; semistandard skew tableaux are weakly increasing along rows and strictly increasing down columns (Skew diagrams and semistandard skew tableaux).
An LR tableau is semistandard and its reading word, read right-to-left within each row from top to bottom, has every prefix containing at least as many 's as 's. The LR coefficient counts these tableaux and is zero unless and (Littlewood--Richardson tableaux and coefficients).
The outer induction product is induction from the subgroup preserving the first and second blocks of sizes and in (The outer induction product of symmetric-group characters).
For all partitions , the induced external product decomposes as ; in particular the multiplicity of is (The outer Littlewood–Richardson rule).
The standard polytabloids form a basis of , so , the number of standard tableaux of shape (Standard polytabloids form a basis of a complex Specht module).
For a finite group , subgroup , and finite-dimensional -module , (The dimension of an induced finite-dimensional representation is ).
Bases of two finite-dimensional vector spaces give the tensor-product basis of their tensor product, so (The elementary tensors of two bases form the product basis of the tensor product).
The library defines as the permutations of (The finite symmetric group , one-line notation, and cycle notation).
A standard tableau strictly increases along rows and columns (Tableaux and standard tableaux).
Proof
Listing the partitions of and retaining those with and from [F1] gives . The two remaining partitions of , and , do not contain and have coefficient zero by [F4].
Let count standard tableaux. In every nonempty standard tableau the largest entry is at a removable corner, that is, a node with no box to its right or below, by [F11]; deleting it leaves a partition and gives a bijection with the standard tableaux of the predecessor shapes, while appending the largest entry at any removable corner reverses the deletion. Thus and . The one-row and one-column shapes each have count . Repeated application gives , , , , , , , , , , , , , , , , , , , , , , , and . By [F7], the input dimensions are and the eight summand dimensions in statement order are , where and .
Each retained skew diagram has four boxes, so by [F2] a filling is determined by the position of its unique . Checking the row and column inequalities [F3], the semistandard positions for that , in the same order as step 1.1, are ; the last four shapes admit no semistandard filling. In , and , the column with two skew boxes forces the into its lower box, respectively , and . For , and a column has at least three boxes, which cannot be strictly filled with only 's and 's; for each of columns and forces a separate .
For a word with one and three 's, the lattice condition in [F4] holds exactly when at least one is read before the : after that first , every prefix has at least as many 's as 's, and no letters exceed . Removing the first-read top-right position from the semistandard-position lists in step 2.1 when it occurs, the LR-valid -positions are , , , , , , , and . Thus the coefficients in the order of step 1.1 are , with zero also for and .
Applying the outer Littlewood–Richardson theorem [F6] to the coefficient list in step 3.1 gives exactly the direct sum in the Statement; all other partitions of have coefficient zero. In particular, the two LR-valid positions and for yield .
By [F10] the global acts on , while [F5] gives the one-based block realization. The shift is a bijection from to ; preserves products and carries the initial three-letter block to , so it preserves the subgroup index. In the one-based realization the block subgroup stabilizes , and the map from its left cosets to the images is a bijection with the three-element subsets: every such subset is an image of under a permutation (extend bijections on and its four-element complement), and if then preserves and lies in , so . Hence . By [F8] and [F9], the induced module has dimension . Step 4.1 and the dimensions in step 1.2 give the right-hand side dimension . The LR enumeration and coset bijection are finite; any left transversal in [F8] is obtained by finitely many selections, which does not require the axiom of choice.
Depends on
- The outer Littlewood–Richardson rule
- Littlewood--Richardson tableaux and coefficients
- The outer induction product of symmetric-group characters
- Skew diagrams and semistandard skew tableaux
- Semistandard tableaux and Kostka numbers
- Partitions, English diagrams, and conjugation
- Standard polytabloids form a basis of a complex Specht module
- Tableaux and standard tableaux
- The dimension of an induced finite-dimensional representation is $[G:H]\dim W$
- The elementary tensors of two bases form the product basis of the tensor product
- The finite symmetric group $S_n$, one-line notation, and cycle notation
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
44 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- I. G. Macdonald, Symmetric Functions and Hall Polynomials, 2nd ed., Oxford Mathematical Monographs, 1995 (standard reference, not scraped)
- G. D. James, The Representation Theory of the Symmetric Groups, Lecture Notes in Mathematics 682, Springer 1978 (standard reference, not scraped)