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 character table of
Example
The character table of , with columns indexed by the classes of , , and (sizes , , ), is
Both orthogonality relations hold for this table.
Facts & Assumptions
Given: The symmetric group with its three irreducible characters , , .
has exactly three irreducible characters of degrees , , and , and its classes have sizes , , ( has three irreducible complex characters of degrees , , and ).
The first orthogonality relation: the rows are orthonormal (The first orthogonality relation for irreducible complex characters).
The second orthogonality relation: distinct columns are orthogonal and the squared norm of a column is the centralizer size (The second orthogonality relation for irreducible complex characters).
for even and for odd , so on the three class representatives it is , , .
The standard character is , with values , , on the three representatives.
Verification
By [F1] there are three irreducible characters and three classes; [A1] and [A2] supply the second and third rows, and the trivial character is the constant . Hence the displayed table is the character table.
Row orthogonality: the rows and have inner product , the row with gives , with gives , and each row has self-inner-product ; this matches [F2].
Column orthogonality: the first column has squared norm ; the second has ; the third has ; and each pair of distinct columns has inner product , , , matching [F3].
Depends on
Used by
Dependency tree · two levels
14 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)