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 Frobenius characteristic preserves outer products
Statement
For all and all , ,
where is the outer induction product of The outer induction product of symmetric-group characters and the right-hand side is the algebra product in . If and are rational-valued, the identity holds in .
Facts & Assumptions
Given: Integers , honest characters of and of , an element of cycle type , and the block-preserving subgroup with blocks and .
For and , the outer product is , where ; the assignment is -bilinear (The outer induction product of symmetric-group characters).
The characteristic map is , is defined on every class function and is linear, and is by definition the set of integral combinations of the honest (irreducible) characters of (The Frobenius characteristic map, Virtual characters and the character ring of a finite group).
Frobenius' formula: for a finite group , a subgroup and the character of a finite-dimensional complex representation of , for every (Frobenius' formula for the character of an induced representation).
For every , is a -basis of , and , with (Power sums form a rational but not integral stable basis). Since each is nonzero, is also a rational basis; extending scalars to makes it a -basis of .
Identify with the subgroup of preserving the blocks and . The two restrictions identify this subgroup with the direct product, including when a block is empty (The outer induction product of symmetric-group characters).
For a partition , is a positive integer (If has cycles of length , then ).
Proof
Both sides of the asserted identity are -bilinear in : the outer product is bilinear by [F1], the characteristic map is linear by [F2], and multiplication in is bilinear. Since every element of is an integral combination of honest characters, and likewise for , it suffices to prove for honest characters of and of .
For honest , the character of is honest, so Frobenius' formula [F3] applied to and the subgroup of [F5] gives .
The condition says that preserves , equivalently that preserves . Hence the occurring in the sum are exactly those with for some -element -invariant subset , and for each such there are exactly permutations with . For all with the same , the permutation has its -component conjugate through to and its -component conjugate to , so , where is the cycle type of and the cycle type of ; this is independent of . With the factor cancelling, , the sum over the -element -invariant subsets .
An -element set is -invariant exactly when it is a union of cycles of , and then and the multisets of parts of and merge to the multiset of parts of . Conversely, every split with arises this way. For a fixed split, the number of -element -invariant with is , because for each cycle length one independently chooses which of the cycles of of length are included in . Therefore , an expression depending only on the cycle type of .
On the other side , using from [F4], the coefficient of equals ; for a split one has , since . This is exactly the coefficient in step 3.1; since is a -basis of by scalar extension [F4] and [F2] gives the same power-sum coefficients for the characteristic, .
By step 1.1 the identity holds for all virtual characters and . The cycle-split formula in step 3.1 also extends to these by bilinearity: . If are rational-valued, every term is rational, so is rational-valued. By [F2], and , while their product and lie in . Thus the identity holds over as claimed.
Depends on
- The outer induction product of symmetric-group characters
- The Frobenius characteristic map
- Frobenius' formula for the character of an induced representation
- Power sums form a rational but not integral stable basis
- If $\sigma\in S_n$ has $c_k$ cycles of length $k$, then $|C_{S_n}(\sigma)|=\prod_{k=1}^n k^{c_k}c_k!$
- Virtual characters and the character ring $R(G)$ of a finite group
Used by
Dependency tree · two levels
31 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., Chapter I §7 (standard reference, not scraped)
- Peter Webb, A Course in Finite Group Representation Theory, §4.3 (standard reference, not scraped)