Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)audited 2026-10-02
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 K be a number field. The group μ(K) of roots of unity contained in K is finite.

Facts & Assumptions

Given: A number field K of degree n=[K:Q], and the set μ(K)=⋃N≥1μN(K) of the elements of K that satisfy xN=1 for some N≥1.

[F1]

For every N≥1 the set μN(K)={x∈K:xN=1} is a subgroup of K×, and an element x∈K is a root of unity exactly when xN=1 for some N≥1 (The group μn(K) of n-th roots of unity in a field, and primitive n-th roots of unity).

[F2]

An element b of a commutative ring B is integral over a subring A when it is a root of a monic polynomial in A[X], and an algebraic integer is a complex number integral over Z (Integral elements over a commutative ring and algebraic integers); the ring of integers OK is the integral closure of Z in K (Ring of integers).

[F3]

For α∈K, one has α∈OK if and only if the monic minimal polynomial of α over Q lies in Z[X] (Minimal-polynomial criterion for algebraic integers).

[F4]

For an algebraic element a of an extension of Q, the monic minimal polynomial ma∈Q[X] satisfies f(a)=0 if and only if ma∣f in Q[X] (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element).

[F5]

Complex modulus satisfies ∣zw∣=∣z∣ ∣w∣, ∣z∣≥0 and ∣z∣=0 only for z=0 (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive); the N-th roots of unity in C are the numbers e2πik/N, k=0,…,N−1, all of modulus one (The n-th roots of a complex number and the n distinct roots of unity for every n≥1).

[F6]

If a is algebraic over F with minimal polynomial of degree d, then [F(a):F]=d (An element is algebraic over F if and only if its simple extension F(a)/F is finite).

[F7]

If F⊆E⊆L and L/F is finite, then E/F and L/E are finite and [E:F] divides [L:F] (The degree of an intermediate field divides the degree of a finite extension); for finite extensions the degrees multiply, [L:F]=[L:E][E:F] (Tower law for finite extensions: [L:F]=[L:K][K:F], The degree [K:F]=dim⁡FK of a finite field extension).

[F8]

There are only finitely many monic integer polynomials of degree at most n whose complex roots, counted with multiplicity, all have modulus at most R=1 (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 n all of whose complex roots have modulus at most 1 is finite.

[F9]

A nonzero polynomial of degree d over an integral domain has at most d distinct roots in that domain (A nonzero polynomial of degree n over an integral domain has at most n distinct roots); C is a field, hence an integral domain.

Proof

technique · every root of unity in $K$ is an algebraic integer whose minimal polynomial has degree at most $n$ and all of whose complex roots have modulus $1$; the bounded-conjugate polynomials of that degree form a finite box, and each polynomial has at most $n$ roots
1.1F1

The set μ(K) is a subgroup of K×: it contains 1; if ζm=1 and ηk=1 then (ζη)mk=ζmkηmk=1; and if ζm=1 then (ζ−1)m=(ζm)−1=1.

1.2F2F3F4

Let ζ∈K be a root of unity with ζN=1 for some N≥1. Then ζ is a root of the monic polynomial XN−1∈Z[X], so ζ is integral over Z and therefore lies in OK; its monic minimal polynomial mζ∈Q[X] has coefficients in Z; and mζ divides XN−1 in Q[X], because the polynomial XN−1 vanishes at ζ and mζ is the minimal polynomial of ζ.

1.3F5

Every complex root w of the polynomial XN−1 satisfies wN=1, hence ∣w∣N=∣wN∣=1 with ∣w∣≥0, so ∣w∣=1; equivalently the roots of XN−1 are the N-th roots of unity, of modulus one.

1.4F6F7

The degree of mζ equals [Q(ζ):Q] by [F6], and Q⊆Q(ζ)⊆K with K/Q finite, so [Q(ζ):Q] is finite and divides [K:Q]=n by [F7]; in particular d:=deg⁡mζ≤n.

2.1step 1.2step 1.3step 1.4

Every complex root w of mζ is a complex root of XN−1, since mζ∣XN−1 in Q[X] and therefore in C[X]; by step 1.3 such a root has ∣w∣=1. Hence mζ is a monic integer polynomial of degree d≤n all of whose complex roots have modulus at most 1, with the degree bound of step 1.4.

3.1F8F9step 2.1

By [F8] the monic integer polynomials of degree at most n whose complex roots all have modulus at most 1 are only finitely many; fix a list g1,…,gM of them. Each gj has degree at most n, hence at most n distinct complex roots by [F9], so the union of their complex root sets has at most nM elements.

4.1step 1.1step 3.1∎

Every root of unity ζ∈K has mζ of the form gj by step 2.1, so ζ is a root of one of the finitely many polynomials g1,…,gM; therefore μ(K) is contained in the finite union of their root sets, and μ(K) is finite. By step 1.1 it is the group of roots of unity contained in K.

Depends on

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