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.
An algebraic-integer average of roots of unity is either or a common root of unity
Statement
Let be roots of unity, and put . If is an algebraic integer, then either or .
Facts & Assumptions
Given: Roots of unity and their average , with an algebraic integer.
A rational algebraic integer is an integer (The rational algebraic integers are exactly the integers).
The modulus is the usual complex absolute value (Real and imaginary parts, complex conjugation, and modulus).
An algebraic integer is a complex number integral over (Integral elements over a commutative ring and algebraic integers).
Every algebraic conjugate of a root of unity is again a root of unity.
The average of complex numbers of modulus has modulus at most , with equality only when all of them are equal.
Proof
If , then and the conclusion holds.
Assume now that the are not all equal. By [A2], . Every algebraic conjugate of has the form with each a root of unity by [A1], so by [A2].
Suppose also that . Let be the monic minimal polynomial of over ; then is the product of the algebraic conjugates of . Because is an algebraic integer by [F3], that product is a rational algebraic integer, hence an integer by [F1]. But step 2.1 gives its modulus strictly between and , impossible. So .
Under the assumption that the roots are not all equal, step 3.1 forces . Together with step 1.1, this proves that is either or a common root of unity.
Depends on
Used by
Dependency tree · two levels
12 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
- Pavel Etingof et al., Introduction to Representation Theory, Lemma 4.22 (standard reference, not scraped)