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.
The restriction coproduct of the character of
Example
Using the ordered-block restriction coproduct, the irreducible character of has components
Under Frobenius characteristic these are the five bidegree terms of where At the identity of each the corresponding component has value .
Facts & Assumptions
Given: The partition , its irreducible character , the ordered-block restriction coproduct, and the inherited Littlewood–Richardson tableau convention.
For , is the restriction of to the ordered block subgroup , pulled back to that product; its endpoints are and (The restriction coproduct on the graded symmetric-group character ring).
Under Frobenius characteristic, the coproduct is Schur skewing: , and its bidegree coefficients are the restriction multiplicities (The restriction coproduct is Schur skewing).
The skew Schur function has expansion (The Littlewood–Richardson rule for products of Schur functions).
is the number of Littlewood–Richardson tableaux of shape and content (Littlewood--Richardson tableaux and coefficients).
The skew diagram is in English coordinates; semistandard entries weakly increase along rows and strictly increase down columns (Skew diagrams and semistandard skew tableaux).
Partitions are weakly decreasing row lengths, means diagram containment, the size is the number of nodes, and is the unique partition of zero (Partitions, English diagrams, and conjugation).
The Specht module is defined from the column antisymmetrizer and its tabloid action; the form a complete irredundant list of irreducible complex representations of , with character (Column antisymmetrizers, polytabloids, and Specht modules, Specht modules classify the complex irreducibles of ).
The Frobenius characteristic sends to (The characteristic of a Specht character is a Schur function).
The standard polytabloids form a basis of , so (Standard polytabloids form a basis of a complex Specht module).
A character is the trace of the representing operator; in particular, its value at the identity is the dimension (The character of a finite-dimensional complex representation).
Character values add on direct sums (Characters add on direct sums, multiply on tensor products, and conjugate on duals).
For irreducible characters of and , (The character ring of a direct product is the tensor product of the factor character rings).
, and is the trivial group (The finite symmetric group , one-line notation, and cycle notation).
A Littlewood–Richardson tableau is semistandard and has a top-to-bottom, right-to-left reading word that is a lattice word (Littlewood--Richardson tableaux and coefficients).
The stable Schur function of the empty partition is (Stable Schur functions from bialternants).
The Schur functions are orthonormal for the Hall form: (Schur functions form an orthonormal integral basis).
A standard tableau strictly increases along rows and columns (Tableaux and standard tableaux).
No form of the axiom of choice is used.
Verification
The subpartitions of are : if the second row is empty, the first has length or , and if it has length , the first has length or . Their sizes give the first tensor-factor degrees ; the corresponding skew diagrams are finite by [F5] and [F6]. The group convention is by [F13].
For , write the skew cells as , , and . Semistandardness requires and the reading word is . Content gives the unique filling , whose word is lattice. Content gives exactly one semistandard lattice filling, , with word ; the other possible locations of the either violate or make the word start with . For content , the distinct entries in the row must be one of , so in every semistandard filling the reading word starts with and fails the first-prefix lattice inequality. Thus .
For , the two skew cells and have no row or column comparison, and their reading order is . Content has the unique filling , and content has the unique lattice filling ; the reversed filling has a word beginning with . Hence . For , the remaining cells satisfy the row inequality and are read in the reverse order. Content gives one lattice filling, while the only semistandard filling of content has word and fails the lattice condition. Hence .
For and the skew diagram consists of one box, so its sole filling has content and its word is lattice, giving by [F3]–[F5] and [F14]. For the empty inner shape, [F17] and [F15] give by orthonormality [F16]. For , [F6] leaves only in [F17], and [F15]–[F16] give . These are all the remaining subshapes from step 1.1.
Applying the skewing formula [F2], expanding by [F3], using the tableau counts from [F4] and [F14] in steps 1.1–2.1, and translating back to by [F8] gives the terms grouped by first-factor degree: , , , , and , as stated; the character labels are those of the Specht modules in [F7], and the endpoint factors use [F1].
Let count standard tableaux. The one-row and one-column shapes each have one standard tableau by [F18], so . Removing the largest entry gives and : the largest entry is at a removable corner by [F18], and deletion and addition there are inverse operations. Thus [F9] gives dimensions for . By [F10], [F11], and [F12], the five component values at the identity are , , , , and , respectively; this also verifies the empty-factor endpoints. The enumeration is finite and uses no choice.
Depends on
- The restriction coproduct is Schur skewing
- The restriction coproduct on the graded symmetric-group character ring
- The Littlewood–Richardson rule for products of Schur functions
- Skew Schur functions by Hall adjointness
- Littlewood--Richardson tableaux and coefficients
- Skew diagrams and semistandard skew tableaux
- Partitions, English diagrams, and conjugation
- Column antisymmetrizers, polytabloids, and Specht modules
- Specht modules classify the complex irreducibles of $S_n$
- The characteristic of a Specht character is a Schur function
- Standard polytabloids form a basis of a complex Specht module
- Tableaux and standard tableaux
- The character $\chi_V(g)=\operatorname{tr}(\rho_V(g))$ of a finite-dimensional complex representation
- Characters add on direct sums, multiply on tensor products, and conjugate on duals
- The character ring of a direct product is the tensor product of the factor character rings
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- Stable Schur functions from bialternants
- Schur functions form an orthonormal integral basis
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
89 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)