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.
Frobenius Characteristic and the Symmetric-Group Character Dictionary — Examples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Characters and the Orthogonality Relations
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Conjugacy in Sₙ, Generation, and the Simplicity of Aₙ
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Averaging and Character-Theory Prerequisites
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Frobenius Characteristic and the Symmetric-Group Character Dictionary
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Induced Representations, Frobenius Reciprocity and Applications
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Maschke's Theorem, Complete Reducibility and the Structure of k[G]
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Permutation Statistics, Inversions and Eulerian Numbers
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Simple Field Extensions and the Construction of the Complex Numbers
- Specht Modules and the Irreducibles of the Symmetric Group
- Splitting Fields
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Functions, the Hall Inner Product, and Schur Bases
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Symmetric Polynomials and the Fundamental Theorem of Symmetric Functions
- Tensor Products of Modules
- The Branching Rule and the Young Graph
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Group Algebra and Representations of Finite Groups
- The ZFC Axioms and the Basic Set Constructions
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Young Diagrams Tableaux and Permutation Modules
2 · Summary
These computations and counterexamples exercise the character dictionary of the companion page at the smallest symmetric groups. The first example expands all three Schur functions in degree three in the power-sum basis and reads off the full character table of together with its orthogonality checks; the second recomputes the Young permutation module from both the fixed-tabloid count and Young's rule and matches it with . The third verifies the omega/sign-twist rule on the conjugate pair and of , and the counterexample separates the outer induction product, which lands in , from the Kronecker tensor product of two representations of one symmetric group.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
The Frobenius characteristic dictionary for
Example
For , expand the three Schur functions in the power-sum basis and recover the character table of . The expansion is
so the coefficients of give the table, on cycle types respectively:
The degrees are and , matching the number of standard tableaux, and the columns are orthogonal with .
Facts & Assumptions
Given: The partitions of and the cycle types of .
Jacobi–Trudi and dual Jacobi–Trudi: , , and , with (Jacobi–Trudi and dual Jacobi–Trudi identities).
, using , , ; likewise and (Complete homogeneous functions expand in power sums with cycle-distribution coefficients).
The involution satisfies , , , , and it is an algebra homomorphism, so (The omega involution conjugates Schur functions).
for every , and is the coefficient of in the power-sum expansion of , i.e. (The characteristic of a Specht character is a Schur function, Irreducible symmetric-group character values are power-sum coefficients).
is the number of standard -tableaux, so and (Standard polytabloids form a basis of a complex Specht module).
Verification
The cycle types of are , with , and , so [F2] gives , and .
The three relevant Schur functions are , and by [F1] and [F3].
The numbers of standard tableaux are , and by [F5].
Substituting step 1.1 into step 1.2: ; ; and .
By [F4], is the coefficient of in the expansion of step 2.1; since , , , the coefficients of in are respectively , and .
The identity-column sum is . The weighted squared row norms are , , and in the displayed row order. The weighted products of the three distinct row pairs are , , and . The column squared norms are , , and , and the distinct column products are , , and . Thus the rows are orthonormal with weights , and the columns are orthogonal with squared norms .
The Young permutation characteristic for shape
Example
For , the Young permutation module has , and its character takes the values on cycle types , decomposing as ; this agrees with Young's rule and with the dictionary table.
Facts & Assumptions
Given: The partition of , the cycle types of , and a permutation .
, where is the character of , and (The characteristic of a Young permutation character is complete homogeneous, Elementary and complete families freely generate the stable ring).
is the number of -tabloids fixed by (The character of a permutation representation counts fixed points).
Young's rule: , with the number of semistandard -tableaux of content (Young's rule for complex permutation modules, Semistandard tableaux and Kostka numbers).
For partitions of the same integer, with unless and (The Kostka change of basis is dominance-unitriangular).
In the dictionary example for , , , with and on the cycle types (The Frobenius characteristic dictionary for ).
Verification
Listing the three -tabloids by their two-element row: , , . The identity fixes all three; the transposition fixes exactly , because a fixed tabloid must have both its row sets -invariant, and preserves and but moves to and to ; the -cycle fixes none, since a row set of size is never invariant under a -cycle. Hence on the cycle types .
By [F1], .
The Kostka numbers for are (the single semistandard tableau of shape ) and (the tableau with first row and second row ), while both because two entries equal to would have to occur in the same column and because does not dominate [F4]; so Young's rule [F3] gives .
By [F5] the dictionary example gives ; on the other hand , so . Therefore , and step 1.2 identifies this with .
Adding the values of and from [F5] gives on the cycle types , exactly the values computed for in step 1.1.
The two routes agree: directly, by step 2.2, matching the Young's-rule decomposition of step 1.3; symmetrically, by steps 1.2 and 2.1, matching the dictionary table of [F5].
Sign twist conjugates the character of
Example
In , the character has values on the cycle types , and multiplication by the sign character, , gives , which are the values of . Thus , in agreement with .
Facts & Assumptions
Given: The partitions and of and the cycle types of .
Jacobi–Trudi and dual Jacobi–Trudi give and (Jacobi–Trudi and dual Jacobi–Trudi identities).
The involution satisfies and , and ; consequently and (The omega involution conjugates Schur functions).
and is the coefficient of in the power-sum expansion of (The characteristic of a Specht character is a Schur function, Irreducible symmetric-group character values are power-sum coefficients).
For of cycle type , the sign is , and the tensor-product character satisfies ; moreover and (A -cycle has sign , and when fixed points are counted as cycles, Sign twist corresponds to the omega involution).
Verification
The cycle types of together with their centralizer orders are , , , and ; hence by [F2] and [F3], and .
With and and , [F1] gives and .
Substituting step 1.1 into step 1.2: , and .
By [F4] the values are the coefficients of in step 2.1; with the centralizer orders of step 1.1 this gives and on the cycle types .
Multiplying pointwise by the sign values , namely , turns the values of step 3.1 into , which are exactly the values of ; this agrees with the module isomorphism and with of [F3].
Outer induction is not the Kronecker product
Statement refuted
The claim refuted is: the outer induction product of two symmetric-group characters is the same operation as the Kronecker (tensor) product of two representations of one symmetric group, so that for the outer product coincides with the tensor product . Take and let be the trivial character of . The outer product is the permutation character of on the two cosets of , with values on the cycle types and decomposition ; its characteristic is . By contrast, the tensor product of the two one-dimensional trivial representations of has dimension , lies in degree and remains a representation of . Hence the outer induced product and the same-rank tensor product are different operations: an outer coefficient such as records a multiplicity for representations of inducing to , not a tensor-product multiplicity for two representations of one symmetric group.
Facts & Assumptions
Given: The trivial characters of and of , the transposition , and the subgroup .
The outer product is for , , with ; for the subgroup is the trivial subgroup of (The outer induction product of symmetric-group characters).
Frobenius' formula: for a character of a subgroup (Frobenius' formula for the character of an induced representation).
is linear, and for , (The Frobenius characteristic map, The Frobenius characteristic preserves outer products).
for the Specht characters of , and are the two pairwise inequivalent irreducible characters of (The characteristic of a Specht character is a Schur function, Specht modules classify the complex irreducibles of , Distinct complex Specht modules are inequivalent, Column antisymmetrizers, polytabloids, and Specht modules).
Jacobi–Trudi and dual Jacobi–Trudi: and (Jacobi–Trudi and dual Jacobi–Trudi identities).
The involution satisfies and (The omega involution conjugates Schur functions).
The tensor product of two finite-dimensional complex representations of a group is a representation of on the same group, with and (The tensor product of two complex representations, Characters add on direct sums, multiply on tensor products, and conjugate on duals).
Finite-dimensional complex representations of a finite group are determined up to isomorphism by their characters (Finite-dimensional complex representations of a finite group are determined up to isomorphism by their characters).
Counterexample
The subgroup is the trivial subgroup of , and is the trivial character of . By [F2], , while for the transposition the condition fails for every , so .
Since is the trivial character of , whose only cycle type is with , [F3] gives ; hence .
By [F7], , so by [F6], and therefore .
The tensor product of two -dimensional complex representations of is a -dimensional complex representation of with character the product of the two characters, so it lies in and has degree ; the value of the product of two trivial characters at the identity is .
By [F5] and step 1.3 applied to the identities , one has .
By [F4] and [F3], and ; reading the coefficients of in these expansions with gives and on the cycle types .
Steps 1.2 and 2.1 give in .
Step 3.1 and step 2.2 show that the character of the induced module equals , namely as computed in step 1.1; by [F9] the induced module is isomorphic to , so the outer coefficient is the multiplicity of in a module induced from to .
The two sides are therefore objects attached to different symmetric groups: the outer product is an element of , namely the degree- character with , while the tensor product of the two one-dimensional trivial representations of is an element of of degree with value at the identity [step 1.4]; a class function on with value at and a class function on the one-element group cannot be the same function, and an outer product coefficient records a multiplicity for representations of inducing to , not a tensor-product multiplicity inside one . This refutes the identified claim.