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.
Brauer's cyclotomic criterion for splitting fields is recorded here only as an external theorem
Statement
Let be a finite group, and let be its exponent (The exponent of a finite group). Brauer's roots-of-unity criterion says that if a field contains a primitive -th root of unity (The group of -th roots of unity in a field, and primitive -th roots of unity, is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity), then is a splitting field for (A splitting field for a finite group: every irreducible representation has scalar endomorphism ring).
This theorem is recorded but not proved here.
Remarks
The criterion is stronger than the algebraically closed-field consequence used later on this page, and it is genuinely external here. Its standard proof uses Brauer induction and the later character theory of finite groups, not only the group-ring dictionary and Schur's lemma developed on RT-1. The point of this remark is therefore negative: it blocks a tempting but unproved shortcut.
Depends on
- The exponent of a finite group
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- A splitting field for a finite group: every irreducible representation has scalar endomorphism ring
- $t^{n}-1$ is separable over $K$ exactly when the characteristic does not divide $n$, and then a splitting field carries $n$ distinct $n$-th roots of unity
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
27 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, Theorem 9.2.7 (standard reference, not scraped)