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
Let and let the classes of be represented by , , , and (sizes , , , ). The character table is
Both orthogonality relations hold.
Facts & Assumptions
Given: The group , its normal subgroup , a primitive cube root of unity , and the class representatives , , , .
has a normal subgroup of order with quotient of order , and its conjugacy classes have sizes , , , ( has a normal Klein four subgroup and four conjugacy classes).
A group of order is cyclic (Every cyclic group is isomorphic to or to for its finite order ).
Degree-one representations are exactly the homomorphisms (Equivalence classes of degree-one representations are exactly homomorphisms ; equivalently they factor through , and they form an abelian group).
The squared degrees of the irreducible characters sum to (The regular character gives a second proof of the sum-of-squares formula).
Row orthogonality: irreducible characters are orthonormal (The first orthogonality relation for irreducible complex characters).
Column orthogonality: distinct columns are orthogonal, and a column has squared norm the centralizer size (The second orthogonality relation for irreducible complex characters).
A homomorphism that is trivial on factors through the quotient ; conversely, a homomorphism from pulls back to one on that is trivial on .
The commutator equals , and a homomorphism to the abelian group is constant on conjugacy classes.
Verification
By [F1] and [F2] the quotient has order , hence is cyclic. Its three homomorphisms to send a generator to , , or ; by [F3] and [A1], they pull back to three one-dimensional characters of whose values are the first three rows. Conversely, every homomorphism kills commutators, so [A2] makes it kill and therefore, by conjugacy, every nonidentity element of . Hence every degree-one character is trivial on and factors through by [A1]. Thus these are exactly the three one-dimensional characters of .
By [F4], the remaining irreducible degree satisfies , so .
By [F6], the column of is orthogonal to the column of : , so .
By [F6], the column of is orthogonal to the column of : . Since , this forces , hence ; the same argument gives .
The four rows assembled in steps 1.1 through 4.1 form the displayed table. Row orthogonality holds by [F5]: the first three rows are orthonormal ( for the identity, with cross terms ), and , while is orthogonal to each of the first three rows.
Column orthogonality holds by [F6]: the squared norms are , , , , matching the centralizer sizes , , , of the four classes, and distinct columns are orthogonal.
Depends on
- $A_4$ has a normal Klein four subgroup and four conjugacy classes
- Every cyclic group is isomorphic to $(\mathbb Z,+)$ or to $(\mathbb Z/n,+)$ for its finite order $n\ge1$
- Equivalence classes of degree-one representations are exactly homomorphisms $G\to k^{\times}$; equivalently they factor through $G/G'$, and they form an abelian group
- The regular character gives a second proof of the sum-of-squares formula
- The first orthogonality relation for irreducible complex characters
- The second orthogonality relation for irreducible complex characters
Used by
- FALSE: every value of an irreducible complex character is real False statement
Dependency tree · two levels
32 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
- Pavel Etingof et al., Introduction to Representation Theory, Section 3.5 (standard reference, not scraped)