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.
Kronecker root-of-unity criterion
Statement
Let be a number field and let be an algebraic integer all of whose complex conjugates satisfy . Then is a root of unity.
Facts & Assumptions
Given: A number field of degree , the set of its embeddings into , and an element with for every .
is separable, because has characteristic zero, hence is perfect, and algebraic extensions of perfect fields are separable (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect, Every algebraic extension of a perfect field is separable); so the norm is the product over the distinct embeddings, , with (Norm and trace from embeddings, with the inseparable exponent in the norm formula, Archimedean embeddings and signature).
For the norm is an integer (Trace and norm of an algebraic integer); if then multiplication by is an invertible linear map, so (The norm and trace of a finite field extension, Ring of integers).
An element is conjugate to over exactly when is a complex root of the minimal polynomial (Conjugate algebraic elements over a field). Sending an embedding to is a bijection onto the set of distinct complex roots of (-embeddings of into an algebraically closed field correspond to the distinct roots of ); restriction is surjective (Restriction partitions embeddings in a finite tower into extension fibres); and for one has . Hence the set of complex roots of is exactly .
Complex modulus is multiplicative, , and only for (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive).
Sums and products of elements integral over are integral (Integral elements over a nonzero base ring form a subring), so for the power is a nonzero element of , the integral closure of in (Ring of integers).
For every the minimal polynomial of the algebraic element has coefficients in , and divides (Minimal-polynomial criterion for algebraic integers, An element is algebraic over if and only if its simple extension is finite, The degree of an intermediate field divides the degree of a finite extension).
Every complex root of is the image of under a -embedding of into (-embeddings of into an algebraically closed field correspond to the distinct roots of ). Such an embedding extends to a -embedding (Restriction partitions embeddings in a finite tower into extension fibres), so .
For fixed and there are only finitely many monic integer polynomials of degree at most whose complex roots, counted with multiplicity, all have modulus at most (Bounded roots give finitely many monic integer polynomials); this is the supplier consumed here, and the exact obligation used is this instance .
A nonzero polynomial of degree at most over the integral domain has at most distinct roots (A nonzero polynomial of degree over an integral domain has at most distinct roots).
An element of is a root of unity exactly when for some (The group of -th roots of unity in a field, and primitive -th roots of unity).
Proof
Since , the norm is a nonzero integer, so .
The set of -embeddings has elements and .
The complex roots of are exactly the numbers with ; each is a conjugate of , so by the hypothesis for every .
By multiplicativity of the modulus, , and every factor is at most by step 1.3, so .
Steps 1.1 and 2.1 give , so ; a product of finitely many real numbers in equals only if every factor equals , so for every , and every complex root of has modulus exactly .
Let . Then is monic of degree at most . By [F7], every complex root of equals for some ; hence by step 3.1.
By [F8] there are only finitely many monic integer polynomials of degree at most whose complex roots all have modulus at most , and each of them has at most distinct complex roots by [F9]; hence the union of the complex root sets of these finitely many polynomials is finite.
For every , is a complex root of , so the set is contained in the finite union of step 5.1 and is finite.
Two distinct powers therefore coincide: for integers , and since this gives , so is a root of unity.
Depends on
- Minimal-polynomial criterion for algebraic integers
- Every algebraic extension of a perfect field is separable
- An element is algebraic over $F$ if and only if its simple extension $F(a)/F$ is finite
- Fields of characteristic zero, finite fields, and algebraically closed fields are perfect
- Integral elements over a nonzero base ring form a subring
- The degree of an intermediate field divides the degree of a finite extension
- Trace and norm of an algebraic integer
- Archimedean embeddings and signature
- Conjugate algebraic elements over a field
- The norm $N_{K/F}$ and trace $\operatorname{Tr}_{K/F}$ of a finite field extension
- Number field
- Ring of integers
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- Bounded roots give finitely many monic integer polynomials
- Conjugation is an involutive real-field automorphism, $z\overline z=|z|^2$, and modulus is definite, multiplicative, and subadditive
- Restriction partitions embeddings in a finite tower into extension fibres
- $F$-embeddings of $F(\alpha)$ into an algebraically closed field correspond to the distinct roots of $m_{\alpha}$
- Norm and trace from embeddings, with the inseparable exponent in the norm formula
- A nonzero polynomial of degree $n$ over an integral domain has at most $n$ distinct roots
Used by
Dependency tree · two levels
63 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
- J. S. Milne, Algebraic Number Theory v3.08 (standard reference, not scraped)
- William A. Stein, Algebraic Number Theory: A Computational Approach (standard reference, not scraped)
- Andrew V. Sutherland, MIT 18.785 Lecture 15: Dirichlet's Unit Theorem (Fall 2021) (standard reference, not scraped)