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.
Finite-dimensional complex representations of a finite group are determined up to isomorphism by their characters
Statement
Let be a finite group and let and be finite-dimensional complex representations of . Then
Facts & Assumptions
Given: A finite group and finite-dimensional complex representations and of .
Every finite-dimensional representation of a finite group over a field of characteristic not dividing is completely reducible (If , every finite-dimensional representation of is completely reducible).
For irreducible , the multiplicity of in a completely reduced representation is (The multiplicity of an irreducible summand is a character inner product).
Equivalent representations have equal characters.
Proof
By [F1] there are decompositions and over the irreducible representations . By [F2] the multiplicities are and .
Conversely, if via an invertible intertwiner, then [A1] gives . This proves the reverse implication.
Assume . Then every inner product in step 1.1 agrees, so for every ; the two direct sums are built from the same irreducibles with the same multiplicities, hence . This proves the forward implication.
Steps 2.1 and 1.2 prove both implications, hence the equivalence.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
7 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.3 (standard reference, not scraped)