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.
Ring of integers of every cyclotomic field
Statement
For every , with a primitive -th root of unity in a fixed algebraic closure of , and is an integral basis of .
Facts & Assumptions
Given: An integer and a primitive -th root of unity in a fixed algebraic closure of . When , write with pairwise distinct primes and , put and , and put . For put and .
is monic of degree , , and is irreducible in (The recursion defines a unique monic , of degree , is irreducible in for every ). Hence is the minimal polynomial of , so and are linearly independent over , and is a cyclotomic extension of of order (The cyclotomic extension as a splitting field of ).
Euler's totient is multiplicative on coprime arguments, so by induction on one has (Euler's totient is multiplicative: implies for positive ).
For each prime power the prime-power cyclotomic structure theorem gives with an integral basis of , and with the field discriminant satisfying for the integer (Prime-power cyclotomic ring, discriminant support and p factor).
Coprime-discriminant compositum: if are number fields inside a common algebraic closure with and , then , the products of an integral basis of and an integral basis of form an integral basis of , and (Integral basis and discriminant of a coprime-discriminant compositum).
Bézout: if have , there is with (Bézout's identity: for integers not both zero, is the least positive element of ; in particular has an integer solution, Coprime integers: ).
If satisfy , and , then ; consequently, if finitely many pairwise coprime integers each divide , their product divides (If and then ; and if , and then ).
An integral basis of is an ordered -basis of (Integral and power integral bases, Ring of integers).
Proof
For one has , , and , so and the single element is a -basis. For we keep the notation of the Given; each has order , because has order ; hence is a primitive -th root of unity and is a prime-power cyclotomic field as in [F4].
By induction on the compositum is and : for this is with degree by [F1]; and if it holds for , then by [F2] because , while by [F1] and [F3]. In particular and inside .
The two rings agree: . Indeed each lies in , which gives the inclusion . Conversely, for each the numbers and are coprime, so [F6] provides with ; since for , the integer is divisible by every , and these are pairwise coprime with product , so by [F7]. Hence , that is , giving the reverse inclusion.
Applying step 1.2 and the compositum theorem [F5] inductively on gives , with the products of the individual power bases as an integral basis, and is a product of powers of the distinct primes . Indeed, for this is [F4]; and for the induction step satisfies the degree hypothesis by step 1.2, while because the first discriminant is a product of powers of and the second is by [F4], so [F5] converts into and preserves the basis statement.
By steps 1.2, 1.3 and 2.1 with , . Every power is a -linear combination of : this is clear for , and the monic relation of degree expresses as such a combination, after which induction on handles all larger powers; hence spans the -module , and by [F1] these elements are also linearly independent over , hence over . A linearly independent spanning set of a -module is a -basis (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis), so is an ordered -basis of , that is, an integral basis by [F8].
Remarks
- Where coprimality is used. The prime-power discriminants are (up to sign) powers of the distinct primes , so the coprime-discriminant hypothesis of the compositum theorem holds at every step. The degree hypothesis is supplied by the compositum identity together with multiplicativity of on coprime arguments; neither hypothesis is automatic.
- The Bezout step is the only place where the product structure of enters additively. It shows that is a monomial in the , so the ring generated by all the local roots is already .
Depends on
- Prime-power cyclotomic ring, discriminant support and p factor
- Integral basis and discriminant of a coprime-discriminant compositum
- $K(\mu_m)K(\mu_n)=K(\mu_{\operatorname{lcm}(m,n)})$
- $\Phi_n$ is irreducible in $\mathbb Q[t]$ for every $n\ge1$
- The recursion defines a unique monic $\Phi_n\in\mathbb Z[t]$, of degree $\varphi(n)$
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- Integral and power integral bases
- Ring of integers
- Euler's totient is multiplicative: $\gcd(m,n)=1$ implies $\varphi(mn)=\varphi(m)\varphi(n)$ for positive $m,n$
- Bézout's identity: for integers $a, b$ not both zero, $\gcd(a,b)$ is the least positive element of $\{\, ax + by : x, y \in \mathbb{Z} \,\}$; in particular $ax + by = \gcd(a,b)$ has an integer solution
- If $\gcd(a,b) = 1$ and $a \mid bc$ then $a \mid c$; and if $a \mid c$, $b \mid c$ and $\gcd(a,b) = 1$ then $ab \mid c$
- Coprime integers: $\gcd(a,b) = 1$
- Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis
Used by
- First supplement from Frobenius on Q(i) Corollary
- Second supplement from Frobenius on Q(zeta₈) Corollary
- Total ramification at a prime-power cyclotomic level Corollary
- Arithmetic of Q(zeta₅) Example
- Arithmetic Frobenius is the power map in an unramified cyclotomic field Lemma
- Prime factorisation in a cyclotomic field Theorem
- Signed discriminant of a cyclotomic field Theorem
Dependency tree · two levels
105 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, Ch. 6, Theorem 6.4 and Remark 6.6 (standard reference, not scraped)
- Conrad-Landesman, Math 154 Algebraic Number Theory, Theorem 11.6 with Lemma 11.8 and Theorem 11.9 (standard reference, not scraped)