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 S_5 character table by fixed-tabloid reconstruction
Example
Take and order the partitions in James's dictionary order for both rows and columns, a linear extension of dominance with the most dominant partition first; this column order is the reverse of the usual one: here the degrees appear in the last column. Counting the elements of the Young subgroups by cycle type gives with for the class sizes . Solving the Gram equation of Fixed-tabloid reconstruction of the character table (Fox–Mullineux) for the nonnegative upper-triangular matrix gives with diagonal and nonzero entries , , , etc.; explicitly, Then is the character table and ; e.g. .
Facts & Assumptions
Given: The partitions of in the dictionary order above, the standard Young subgroups (Young subgroups, tabloids, and permutation modules), the conjugacy classes of indexed by cycle type with sizes (The conjugacy classes of are indexed by the tuples with ), and the integers , of Fixed-tabloid reconstruction of the character table (Fox–Mullineux).
The centralizer order is and (If has cycles of length , then ).
is the direct product of the symmetric groups of the blocks of , of order , and its elements are the tuples of permutations of the blocks, so the cycle type of an element is the union of the cycle types of its block permutations (Young subgroups, tabloids, and permutation modules, The conjugacy classes of are indexed by the tuples with ).
counts semistandard tableaux of shape and content (Semistandard tableaux and Kostka numbers), and in the notation of the theorem, whose uniqueness statement identifies the matrix (Fixed-tabloid reconstruction of the character table (Fox–Mullineux), Young's rule for complex permutation modules).
The character inner product is (The standard inner product on , Virtual characters and the character ring of a finite group), and the entries of are the values of the irreducible characters (The character table of a finite group).
Verification
The class sizes and . By [F1], evaluates to on the classes : for instance and . Hence is and .
The matrix . By [F2] the cycle types in are obtained by combining the cycle types of the blocks. The single-block counts used are: in , type : ; in , types : ; in , types : ; in , types : ; and in the counts are the class sizes of types . Combining block counts for each (for example, in the identity gives one element of type ; a -cycle together with the identity gives the elements of type ; a -cycle with the transposition gives the elements of type ; a transposition in combined with the identity, or the identity in combined with the transposition of , gives the elements of type ; and a transposition in combined with the transposition in gives the elements of type ) yields exactly the displayed matrix .
The matrix . By [F3] the entry is times the number of semistandard tableaux of shape and content ; the diagonal is , and the displayed nonzero entries are confirmed by the corresponding counts: , because a semistandard tableau of shape and content must place or in the single lower cell and then is determined; and are checked the same way. The whole displayed matrix satisfies the Gram equation with the displayed and : each entry of is the finite sum , and comparing with gives, for example, and . By the uniqueness clause of [F3] the nonnegative upper-triangular matrix with this Gram matrix and positive diagonal is , so no other matrix can occur.
The character table. Multiplying on the right by the inverse transpose of gives the displayed ; equivalently, , and this is the identity of the theorem. Two full rows of the product check it: the row consists of ones, and for every ; for the row one gets and ; the remaining rows are verified by the same finite sums from the displayed and . By the theorem's determinant formula, , the product of all parts of all partitions of .
The orthogonality spot check of the example statement: with the class sizes of step 1.1 and the rows of , , and ; the entries are real, so the conjugate in [F4] plays no role. Thus the displayed table is orthonormal on the checked pairs, as a character table must be.
Depends on
- Fixed-tabloid reconstruction of the character table (Fox–Mullineux)
- The character table of a finite group
- 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!$
- The conjugacy classes of $S_n$ are indexed by the tuples $(c_1,\ldots,c_n)$ with $\sum k c_k=n$
- Young subgroups, tabloids, and permutation modules
- Young's rule for complex permutation modules
- Semistandard tableaux and Kostka numbers
- The standard inner product on $\mathrm{cf}(G)$
- Virtual characters and the character ring $R(G)$ of a finite group
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
50 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
- G. D. James, The Representation Theory of the Symmetric Groups, Lecture Notes in Mathematics 682, Springer 1978 (complete author-hosted scan, 161 pp.) (standard reference, not scraped)
- William Woods, Representation theory of the symmetric groups (Cambridge Part III essay, 33 pp.) (standard reference, not scraped)