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.
Conjugates of an average of roots of unity
Statement
Let , let be roots of unity, and put . Then is algebraic over . There is a finite cyclotomic splitting field containing all the such that for every complex -conjugate of , some -automorphism satisfies . Each has the same multiplicative order as . No integrality hypothesis on is required.
Facts & Assumptions
Given: , each a complex root of unity, and .
A root of unity satisfies a positive power equation ; its order is the least positive such exponent (The group of -th roots of unity in a field, and primitive -th roots of unity).
An isomorphism of base fields extends to an isomorphism between splitting fields of a nonzero polynomial and its transported polynomial (A base-field isomorphism extends to an isomorphism between splitting fields of corresponding polynomials).
Conjugates over are roots of the same minimal polynomial (Conjugate algebraic elements over a field).
A cyclotomic extension of order is the splitting field of , generated by its roots (The cyclotomic extension as a splitting field of ).
Every nonconstant complex polynomial splits over (Every nonconstant polynomial in splits into linear factors).
A field obtained by adjoining finitely many algebraic elements has finite degree (An extension generated by finitely many algebraic elements is finite).
Every element of a finite field extension is algebraic (Every finite field extension is algebraic).
An algebraic splitting field of a nonzero polynomial is normal (An algebraic extension that is a splitting field of a polynomial is normal).
If two elements are roots of corresponding monic irreducible polynomials, a base-field isomorphism extends to their simple fields sending one root to the other (A base-field isomorphism extends across simple adjunctions of corresponding roots of an irreducible polynomial).
Finite sums use repeated addition with empty sum zero (A finite sum in a commutative monoid indexed by an arbitrary finite set).
Base and successor steps prove a statement for every finite length (The principle of mathematical induction).
Normality says each element’s minimal polynomial over the base field splits in the extension (A normal algebraic extension is one in which every minimal polynomial with a root in the extension splits there).
Proof
Let be the positive order of , and set . Each divides , hence . The nonconstant polynomial splits in by F5. Let be its set of roots there and . The linear factorization has factors, so is finite. The polynomial splits over , and is generated by these roots, so it is the cyclotomic splitting field of F4. All belong to .
Each member of is algebraic over , being a root of . F6 makes finite, and F7 makes it algebraic. As , repeated addition and multiplication in show that ; F10 gives the same finite sum in and . In particular is algebraic by F7.
F8 applies to the algebraic splitting field of the nonzero polynomial , giving normality. Let be the monic minimal polynomial of over . By F12, splits over . If is a conjugate of , then by F3. Write with . The field has no zero divisors, so forces for some ; thus .
Apply F9 to the identity isomorphism of and the monic irreducible polynomial , with roots and . It gives a -isomorphism satisfying . Both fields lie in . Since , one has ; the two inclusions follow respectively because contains and because . The same argument gives . Thus is a splitting field of over each of these base fields.
The coefficients of are rational and fixes them, so . Apply F2 to the two splitting-field structures from step 4.1. It extends to a field isomorphism . This is a -automorphism and .
A field homomorphism preserves finite sums: it sends the empty sum to , and preserves the assertion when a term is appended; F11 proves this for every length in F10. Since , it follows that .
Multiplicativity gives . If for a positive , applying gives , contrary to the definition of in F1. Thus the order is exactly . This covers and repeated roots. When , the construction still applies with . When , its minimal polynomial is , so ; steps 4.1–6.1 still apply. No step imposed integrality on .
Sources
Milne, Proposition 2.12 and Corollary 2.13, pp. 29–30, and Definition 3.7, p. 37, support extension and normality. Etingof et al., Lemma 5.4.5 proof, p. 101, uses simultaneous conjugate averages. Its later algebraic-integer conclusion is not claimed here.
Depends on
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- A base-field isomorphism extends to an isomorphism between splitting fields of corresponding polynomials
- Conjugate algebraic elements over a field
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- Every nonconstant polynomial in $\mathbb C[x]$ splits into linear factors
- An extension generated by finitely many algebraic elements is finite
- Every finite field extension is algebraic
- An algebraic extension that is a splitting field of a polynomial is normal
- A base-field isomorphism extends across simple adjunctions of corresponding roots of an irreducible polynomial
- A finite sum in a commutative monoid indexed by an arbitrary finite set
- The principle of mathematical induction
- A normal algebraic extension is one in which every minimal polynomial with a root in the extension splits there
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
45 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
- Etingof et al., Introduction to Representation Theory (standard reference, not scraped)
- J. S. Milne, Fields and Galois Theory, v5.10 (2022) (standard reference, not scraped)