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 regular character gives a second proof of the sum-of-squares formula
Statement
Let be a finite group and let be its irreducible complex characters, of degrees . Then
Facts & Assumptions
Given: A finite group with irreducible characters , the regular representation , and the regular character .
The regular character is at and elsewhere (The regular character is at and away from ).
The multiplicity of an irreducible summand is an inner product: (The multiplicity of an irreducible summand is a character inner product).
Characters add on direct sums: (Characters add on direct sums, multiply on tensor products, and conjugate on duals).
The degree of a character is its value at , .
Proof
By [F2], the regular representation decomposes as with . By [F1] and the definition of the inner product this is , because the only nonzero term is at .
Characters add on direct sums by [F3], so evaluating both sides of the decomposition of step 1.1 at gives . By [F1] the left side is , and step 1.1 gives , so .
Depends on
Used by
- S₃ has three irreducible complex characters of degrees 1, 1, and 2 Example
- The character table of A₄ Example
- The character table of Dih(C₄) Example
- The character table of Q₈ Example
- The character table of S₄ and the normal subgroups it reveals Example
- A finite group is abelian if and only if all its irreducible complex characters have degree 1 Theorem
Dependency tree · two levels
13 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, Corollary 3.3.7 (standard reference, not scraped)