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 of a finite-dimensional complex representation
Definition
Let be a finite-dimensional complex representation (A finite-dimensional representation over a field, and its degree). Its character is the function
where the trace is the basis-independent trace of an endomorphism (The basis-independent trace of an endomorphism of a finite-dimensional vector space); one writes or when the representation or the group is fixed.
The definition is well posed in two senses, recorded here because both are used throughout the page. First, the value does not depend on a choice of basis of : matrices of one endomorphism in two ordered bases are similar, and similar matrices have equal trace (The basis-independent trace of an endomorphism of a finite-dimensional vector space). Second, equivalent representations have equal characters: if is an invertible intertwiner, then , so by the identity (For and , ). Thus the character depends only on the equivalence class of the representation.
Depends on
Used by
- An irreducible complex character Definition
- The kernel of a complex character Definition
- For a complex character, χ(1)=dim V, χ is a class function, and |χ(g)|≤χ(1) with equality exactly at scalars Proposition
- Characters add on direct sums, multiply on tensor products, and conjugate on duals Theorem
- The character of a permutation representation counts fixed points Theorem
Dependency tree · two levels
11 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, Proposition 3.1.1 (standard reference, not scraped)
- Pavel Etingof et al., Introduction to Representation Theory, Section 3.3 (standard reference, not scraped)