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.
A splitting field for a finite group: every irreducible representation has scalar endomorphism ring
Definition
Let be a finite group and let be a field. The field is a splitting field for when every irreducible representation of over satisfies meaning that every -endomorphism of is a scalar operator with (A finite-dimensional representation over a field, and its degree, Intertwiners, the spaces and , equivalent representations, and faithful representations).
Remarks
-
This is the representation-theoretic condition used on the next pages. It is weaker than algebraic closedness, and Brauer's theorem records one sufficient roots-of-unity criterion for it without making that criterion the definition.
-
The definition quantifies only over irreducible representations of the fixed finite group .
Depends on
Used by
- Over a splitting field, every G-endomorphism of an irreducible representation is scalar Corollary
- Over ℂ, a cyclic group of order n has exactly n irreducible representations up to equivalence, represented by the characters g↦ λ with λⁿ=1 Example
- Brauer's cyclotomic criterion for splitting fields is recorded here only as an external theorem Remark
Dependency tree · two levels
10 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, Chapter 9 Sections 9.1-9.2 (standard reference, not scraped)