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.
has three irreducible complex characters of degrees , , and
Example
The symmetric group has exactly three irreducible complex characters: the trivial character , the sign character , and the standard character ; their degrees are , , and .
Facts & Assumptions
Given: The symmetric group acting on .
The conjugacy classes of are indexed by cycle types (The conjugacy classes of are indexed by the tuples with ).
The degrees of all irreducible characters satisfy (The regular character gives a second proof of the sum-of-squares formula).
The sign representation is the one-dimensional representation in which acts by (The sign representation of and the restriction of a representation to a subgroup).
The standard character of is (The standard representation of has character equal to the number of fixed points minus ).
A complex character is irreducible exactly when its self-inner-product is (A complex character is irreducible if and only if its self-inner-product is ).
The standard inner product of class functions on a group of order is .
Verification
By [F1] the cycle types of are the identity type, the type of a transposition, and the type of a -cycle, so has three conjugacy classes; a direct count of each type gives class sizes , , and .
By [F3] the trivial and sign characters are distinct one-dimensional characters, hence irreducible: a one-dimensional space has no proper nonzero subspaces. Their degrees are and .
By [F4], the standard character has values , , and on the three classes of step 1.1 (fixed points , , and minus ). Using [A1], , so by [F5] the standard character is irreducible, of degree .
The three irreducible characters of steps 1.2 and 2.1 have squared degrees . By [F2] the sum over all irreducible characters is also , so no further irreducible character exists.
Depends on
- The conjugacy classes of $S_n$ are indexed by the tuples $(c_1,\ldots,c_n)$ with $\sum k c_k=n$
- The regular character gives a second proof of the sum-of-squares formula
- The sign representation of $S_n$ and the restriction $\operatorname{Res}^G_H(V)$ of a representation to a subgroup
- The standard representation of $S_n$ has character equal to the number of fixed points minus $1$
- A complex character is irreducible if and only if its self-inner-product is $1$
Used by
- The character table of S₃ Example
Dependency tree · two levels
15 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
- Peter Webb, A Course in Finite Group Representation Theory, Example 3.1.2 (standard reference, not scraped)
- Pavel Etingof et al., Introduction to Representation Theory, Section 3.5 (standard reference, not scraped)