Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passaudited 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.

Ring of integers of every cyclotomic field

Statement

For every n≥1, with ζn a primitive n-th root of unity in a fixed algebraic closure of Q, OQ(ζn)=Z[ζn], and 1,ζn,…,ζnφ(n)−1 is an integral basis of OQ(ζn).

Facts & Assumptions

Given: An integer n≥1 and a primitive n-th root of unity ζn in a fixed algebraic closure Ω of Q. When n>1, write n=p1a1⋯prar,i=1,…,r, with p1,…,pr pairwise distinct primes and ai≥1, put mi:=n/piai and ζi:=ζn mi, and put Ki:=Q(ζi). For j=1,…,r put nj:=p1a1⋯pjaj and Mj:=K1⋯Kj.

[F1]

Φn∈Z[t] is monic of degree φ(n), Φn(ζn)=0, and Φn is irreducible in Q[t] (The recursion defines a unique monic Φn∈Z[t], of degree φ(n), Φn is irreducible in Q[t] for every n≥1). Hence Φn is the minimal polynomial of ζn, so [Q(ζn):Q]=φ(n) and 1,ζn,…,ζnφ(n)−1 are linearly independent over Q, and Q(ζn) is a cyclotomic extension of Q of order n (The cyclotomic extension K(μn) as a splitting field of tn−1).

[F2]

For a field F and positive integers m,m′ such that char⁡F divides neither m nor m′, the compositum inside a splitting field of tlcm⁡(m,m′)−1 satisfies F(μm)F(μm′)=F(μlcm⁡(m,m′)); over F=Q, the characteristic hypothesis is vacuous (K(μm)K(μn)=K(μlcm⁡(m,n))).

[F3]

Euler's totient is multiplicative on coprime arguments, so by induction on j one has φ(nj)=φ(p1a1)⋯φ(pjaj) (Euler's totient is multiplicative: gcd⁡(m,n)=1 implies φ(mn)=φ(m)φ(n) for positive m,n).

[F4]

For each prime power piai the prime-power cyclotomic structure theorem gives OKi=Z[ζi], with 1,ζi,…,ζiφ(piai)−1 an integral basis of OKi, and with the field discriminant satisfying ∣dKi∣=pi Ni for the integer Ni:=piai−1(ai(pi−1)−1)≥0 (Prime-power cyclotomic ring, discriminant support and p factor).

[F5]

Coprime-discriminant compositum: if K,L are number fields inside a common algebraic closure with [KL:Q]=[K:Q][L:Q] and gcd⁡(dK,dL)=1, then OKL=OKOL, the products of an integral basis of OK and an integral basis of OL form an integral basis of OKL, and dKL=dK[L:Q]dL[K:Q] (Integral basis and discriminant of a coprime-discriminant compositum).

[F7]

If a,b,c∈Z satisfy a∣c, b∣c and gcd⁡(a,b)=1, then ab∣c; consequently, if finitely many pairwise coprime integers each divide c, their product divides c (If gcd⁡(a,b)=1 and a∣bc then a∣c; and if a∣c, b∣c and gcd⁡(a,b)=1 then ab∣c).

[F8]

An integral basis of OK is an ordered Z-basis of OK (Integral and power integral bases, Ring of integers).

Proof

technique · direct
1.1F1F4given

For n=1 one has ζ1=1, φ(1)=1, Q(ζ1)=Q and OQ=Z, so OQ(ζ1)=Z[ζ1]=Z and the single element 1=ζ10 is a Z-basis. For n>1 we keep the notation of the Given; each ζi=ζnmi has order piai, because ζn has order n; hence ζi is a primitive piai-th root of unity and Ki=Q(ζi) is a prime-power cyclotomic field as in [F4].

1.2F1F2F3

By induction on j the compositum is Mj=Q(ζnj) and [Mj:Q]=φ(nj)=∏i≤jφ(piai): for j=1 this is K1=Q(ζp1a1) with degree φ(p1a1) by [F1]; and if it holds for j−1, then Mj=Mj−1Kj=Q(μnj−1)Q(μpjaj)=Q(μnj) by [F2] because lcm⁡(nj−1,pjaj)=nj, while [Mj:Q]=φ(nj)=φ(nj−1)φ(pjaj)=[Mj−1:Q][Kj:Q] by [F1] and [F3]. In particular [Mr:Q]=φ(n)=[Q(ζn):Q] and Mr=Q(ζn) inside Ω.

1.3F6F7given

The two rings agree: Z[ζ1]⋯Z[ζr]=Z[ζn]. Indeed each ζi=ζnmi lies in Z[ζn], which gives the inclusion ⊆. Conversely, for each i the numbers mi and piai are coprime, so [F6] provides ei∈Z with eimi≡1(modpiai); since piai∣mj for j≠i, the integer ∑jejmj−1 is divisible by every piai, and these are pairwise coprime with product n, so n∣∑jejmj−1 by [F7]. Hence ζn∑jejmj=ζn, that is ζn=∏j(ζnmj)ej=∏jζjej∈Z[ζ1]⋯Z[ζr], giving the reverse inclusion.

2.1F4F5step 1.2

Applying step 1.2 and the compositum theorem [F5] inductively on j gives OMj=OK1⋯OKj=Z[ζ1]⋯Z[ζj], with the products of the individual power bases as an integral basis, and ∣dMj∣=∏i≤jpi Ni⋅[Mj:Ki] is a product of powers of the distinct primes p1,…,pj. Indeed, for j=1 this is [F4]; and for the induction step Mj=Mj−1Kj satisfies the degree hypothesis by step 1.2, while gcd⁡(dMj−1,dKj)=1 because the first discriminant is ± a product of powers of p1,…,pj−1 and the second is ±pj Nj by [F4], so [F5] converts OMj−1OKj into OMj and preserves the basis statement.

3.1F1F8step 1.2step 1.3step 2.1∎

By steps 1.2, 1.3 and 2.1 with j=r, OQ(ζn)=OMr=Z[ζ1]⋯Z[ζr]=Z[ζn]. Every power ζnk is a Z-linear combination of 1,ζn,…,ζnφ(n)−1: this is clear for k<φ(n), and the monic relation Φn(ζn)=0 of degree φ(n) expresses ζnφ(n) as such a combination, after which induction on k handles all larger powers; hence 1,ζn,…,ζnφ(n)−1 spans the Z-module Z[ζn]=OQ(ζn), and by [F1] these φ(n) elements are also linearly independent over Q, hence over Z. A linearly independent spanning set of a Z-module is a Z-basis (Basis of a vector space: a linearly independent spanning subset; and ordered basis: an injective finite list whose image is a basis), so 1,ζn,…,ζnφ(n)−1 is an ordered Z-basis of OQ(ζn), 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 pi, so the coprime-discriminant hypothesis of the compositum theorem holds at every step. The degree hypothesis is supplied by the compositum identity Mj=Q(ζnj) together with multiplicativity of φ on coprime arguments; neither hypothesis is automatic.
  • The Bezout step is the only place where the product structure of n enters additively. It shows that ζn is a monomial in the ζi, so the ring generated by all the local roots is already Z[ζn].

Depends on

Used by

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