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.
Outer induction makes the graded symmetric-group representation group a commutative graded ring
Statement
Let be the graded abelian group of ordinary symmetric-group character rings, and let be the outer induction product (The graded ordinary representation ring of the symmetric groups, The outer induction product of symmetric-group characters). For , , and :
(i) , and is -bilinear and distributive over addition;
(ii) in ;
(iii) in ;
(iv) if is the trivial character of , then .
Consequently is a commutative graded -algebra. No choice principle is used.
Facts & Assumptions
Given: Nonnegative integers and virtual characters , , and .
The current library convention realizes as permutations of with composition (The finite symmetric group , one-line notation, and cycle notation).
A group homomorphism preserves products (Monoid homomorphism and group homomorphism).
The outer product definition uses the ordered one-based blocks and , defines by induction of , and makes this product bilinear (The outer induction product of symmetric-group characters).
is the direct sum of the , whose elements have finite support, and (The graded ordinary representation ring of the symmetric groups).
Induced modules are functions satisfying , with left translation action (The induced -linear -module as -covariant functions on ).
An induced character is the character of the induced representation (The induced character of a complex character).
Induction is transitive along subgroup chains (Induction is transitive along subgroup chains).
Induction to a direct product commutes with an external tensor factor, including the case where a subgroup equals its ambient factor (Induction commutes with an external tensor factor).
Conjugating a subgroup and its representation by the same element leaves the induced character unchanged (Induction is invariant under conjugation of the subgroup and the representation).
The external direct product has componentwise multiplication (The external direct product with componentwise multiplication).
The componentwise product of groups is a group ( is a group with identity , coordinatewise inverses, and homomorphic coordinate projections).
A subset closed under the group identity, products, and inverses is a subgroup (Subgroup).
Proof
For each , define from to , with the empty bijection if . The group isomorphism preserves products and carries the zero-based ordered blocks to the one-based blocks in [F3]. Pullback along identifies representations and character groups. Explicitly, for a one-based subgroup and module , set and . The map has inverse composition with , and . Since , it also intertwines the transported left actions in [F5]. Thus the one-based calculation represents the same outer product in .
First take honest characters of . In the one-based realization let , , and , allowing empty blocks, and let be the permutations preserving each . The identity, products, and inverses preserve each block, so by [F12]. Restriction to the three blocks identifies with the componentwise product by [F10, F11]. Both parenthesized two-block embeddings have image , and on a triple both parenthesized external product characters have value by [F3]. Hence the two parenthesized external product characters on agree.
In the one-based realization define by for and for . Its two ranges are disjoint and cover , so it is a permutation, also when one block is empty. If denotes the block embedding in [F3], its action on the two blocks gives . Thus conjugates the first block subgroup to the second.
When one block is empty, the block subgroup or is all of , and its external product character identifies with the other factor by [F3]. For any -module , evaluation at the identity identifies with : its inverse sends to the covariant function , and both maps respect left translation by [F5]. Thus the unit identities hold for honest characters, and bilinearity with finite expansions [F3, F4] gives for every virtual character.
Apply [F8] at each outer tensor step and then [F7] to induction in stages. Both and become induction from the same subgroup to of the equal external product characters in step 1.2. By [F6] their induced characters are equal. Bilinearity and the finite integral character expansions in [F3, F4] extend this equality to all virtual , proving associativity.
For honest characters , the representation conjugated by has value at , so it is exactly by [F3, F9]. The conjugation-invariance result [F9] therefore gives . Bilinearity and the finite integral expansions in [F3, F4] extend this equality to virtual characters.
Steps 1.1, 2.1, 2.2, and 1.4 establish compatibility with the library's group convention, associativity, commutativity, and the unit. The product on the direct sum is graded by [F3, F4], and all virtual characters are finite integral combinations, so the stated ring axioms follow. Every relabeling and block conjugator was given explicitly, and every extension used finite sums; no form of the axiom of choice is used.
Depends on
- The outer induction product of symmetric-group characters
- The graded ordinary representation ring of the symmetric groups
- The induced character $\operatorname{Ind}_H^G\chi$ of a complex character
- Induction is transitive along subgroup chains
- Induction commutes with an external tensor factor
- Induction is invariant under conjugation of the subgroup and the representation
- The external direct product $G\times H$ with componentwise multiplication
- The finite symmetric group $S_n$, one-line notation, and cycle notation
- Monoid homomorphism and group homomorphism
- The induced $R$-linear $G$-module $\operatorname{Ind}_H^G W$ as $H$-covariant functions on $G$
- $G\times H$ is a group with identity $(e_G,e_H)$, coordinatewise inverses, and homomorphic coordinate projections
- Subgroup
Used by
Dependency tree · two levels
35 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)
- Peter Webb, A Course in Finite Group Representation Theory (complete author-hosted textbook, 294 pp.) (standard reference, not scraped)