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.
Finitely many roots of unity in a number field
Statement
Let be a number field. The group of roots of unity contained in is finite.
Facts & Assumptions
Given: A number field of degree , and the set of the elements of that satisfy for some .
For every the set is a subgroup of , and an element 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).
An element of a commutative ring is integral over a subring when it is a root of a monic polynomial in , and an algebraic integer is a complex number integral over (Integral elements over a commutative ring and algebraic integers); the ring of integers is the integral closure of in (Ring of integers).
For , one has if and only if the monic minimal polynomial of over lies in (Minimal-polynomial criterion for algebraic integers).
For an algebraic element of an extension of , the monic minimal polynomial satisfies if and only if in (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).
Complex modulus satisfies , and only for (Conjugation is an involutive real-field automorphism, , and modulus is definite, multiplicative, and subadditive); the -th roots of unity in are the numbers , , all of modulus one (The -th roots of a complex number and the distinct roots of unity for every ).
If is algebraic over with minimal polynomial of degree , then (An element is algebraic over if and only if its simple extension is finite).
If and is finite, then and are finite and divides (The degree of an intermediate field divides the degree of a finite extension); for finite extensions the degrees multiply, (Tower law for finite extensions: , The degree of a finite field extension).
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 one batch-2 supplier consumed here, authored in this run; the exact obligation used is that the set of monic integer polynomials of degree at most all of whose complex roots have modulus at most is finite.
A nonzero polynomial of degree over an integral domain has at most distinct roots in that domain (A nonzero polynomial of degree over an integral domain has at most distinct roots); is a field, hence an integral domain.
Proof
The set is a subgroup of : it contains ; if and then ; and if then .
Let be a root of unity with for some . Then is a root of the monic polynomial , so is integral over and therefore lies in ; its monic minimal polynomial has coefficients in ; and divides in , because the polynomial vanishes at and is the minimal polynomial of .
Every complex root of the polynomial satisfies , hence with , so ; equivalently the roots of are the -th roots of unity, of modulus one.
The degree of equals by [F6], and with finite, so is finite and divides by [F7]; in particular .
Every complex root of is a complex root of , since in and therefore in ; by step 1.3 such a root has . Hence is a monic integer polynomial of degree all of whose complex roots have modulus at most , with the degree bound of step 1.4.
By [F8] the monic integer polynomials of degree at most whose complex roots all have modulus at most are only finitely many; fix a list of them. Each has degree at most , hence at most distinct complex roots by [F9], so the union of their complex root sets has at most elements.
Every root of unity has of the form by step 2.1, so is a root of one of the finitely many polynomials ; therefore is contained in the finite union of their root sets, and is finite. By step 1.1 it is the group of roots of unity contained in .
Depends on
- Minimal-polynomial criterion for algebraic integers
- An element is algebraic over $F$ if and only if its simple extension $F(a)/F$ is finite
- The degree of an intermediate field divides the degree of a finite extension
- Archimedean embeddings and signature
- The degree $[K:F]=\dim_F K$ of a finite field extension
- Integral elements over a commutative ring and algebraic integers
- 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
- The $n$-th roots of a complex number and the $n$ distinct roots of unity for every $n\ge1$
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- A nonzero polynomial of degree $n$ over an integral domain has at most $n$ distinct roots
- Tower law for finite extensions: $[L:F]=[L:K][K:F]$
Used by
Dependency tree · two levels
51 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)
- Brian Conrad and Aaron Landesman, Math 154 Algebraic Number Theory (standard reference, not scraped)
- Andrew V. Sutherland, MIT 18.785 Lecture 15: Dirichlet's Unit Theorem (Fall 2021) (standard reference, not scraped)