Alphabeta Math
TheoremStatement: 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.

Prime factorisation in a cyclotomic field

Statement

Let f≥1 be a reduced index, that is, f is odd or 4∣f. Let ℓ be a rational prime, write f=ℓam with gcd⁡(ℓ,m)=1 (so a is the ℓ-adic valuation of f, m=f/ℓa, and m=f when ℓ∤f), and put e:=φ(ℓa), d:=ord⁡m(ℓ), the multiplicative order of ℓ modulo m, and g:=φ(m)/d, with the conventions φ(1)=1 and ord⁡1(ℓ)=1. Let ζf be a primitive f-th root of unity and K=Q(ζf). Then ℓOK=(P1⋯Pg)e with pairwise distinct primes P1,…,Pg of residue degree d, and edg=φ(f).

Facts & Assumptions

Given: A reduced index f≥1, a rational prime ℓ, the factorisation f=ℓam with gcd⁡(ℓ,m)=1, the numbers e=φ(ℓa), d=ord⁡m(ℓ), g=φ(m)/d (with the conventions φ(1)=1 and ord⁡1(ℓ)=1), a primitive f-th root of unity ζ=ζf, the field K=Q(ζ), and, for n≥1, the image Φˉn of Φn in Fℓ[t].

[F2]

Φf is monic of degree φ(f) with Φf(ζ)=0, its roots in a field of characteristic not dividing f are exactly the primitive f-th roots of unity, and Φf is irreducible over Q; hence Φf is the minimal polynomial of ζ over Q, and K=Q(μf) is a cyclotomic extension of order f (The recursion defines a unique monic Φn∈Z[t], of degree φ(n), Over a field whose characteristic does not divide n, the roots of Φn are exactly the primitive roots of unity, Φn is irreducible in Q[t] for every n≥1, The cyclotomic extension K(μn) as a splitting field of tn−1).

[F3]

Monogenic factorisation: if K=Q(α) is a number field with OK=Z[α] and monic minimal polynomial F of α, and if the image of F in Fp[t] factors as ∏ihiai into distinct monic irreducibles, then pOK=∏iPiai with pairwise distinct primes Pi=(p,h~i(α)) of residue degree deg⁡hi, where h~i∈Z[t] is the coefficientwise lift of hi with coefficients in {0,…,p−1}; the argument uses no Axiom of Choice (Choice-free prime factorisation for a monogenic number ring, Primes above and residue degree).

[F4]

For every n≥1, ∏j∣nΦj=tn−1 in Z[t], and Φn is monic of degree φ(n); in particular Φ1=t−1 (The recursion defines a unique monic Φn∈Z[t], of degree φ(n), The cyclotomic polynomials Φn∈Z[t], defined by ∏d∣nΦd=tn−1).

[F6]

Euler's totient is multiplicative on coprime arguments: φ(uv)=φ(u)φ(v) when gcd⁡(u,v)=1 (Euler's totient is multiplicative: gcd⁡(m,n)=1 implies φ(mn)=φ(m)φ(n) for positive m,n).

[F7]

Fℓ[t] is an integral domain (indeed a unique factorisation domain), so a product identity A⋅B=A⋅C with A≠0 implies B=C (For every field F, F[x] is a unique factorisation domain).

[F8]

Total ramification in a prime-power cyclotomic field: for b≥1, pOQ(ζpb)=(λ)φ(pb) with λ=1−ζpb, and λOQ(ζpb) is the unique prime above p, with residue field Fp (Total ramification at a prime-power cyclotomic level).

Proof

technique · direct
1.1F4F7

Assume a≥1. Since gcd⁡(ℓ,m)=1, the divisors of ℓam are exactly the ℓjm′ with 0≤j≤a and m′∣m; reducing the product identity of [F4] at n=ℓam and at n=ℓa−1m modulo ℓ and using (Xm)ℓj−1=(Xm−1)ℓj in Fℓ[t] therefore gives ∏j=0a∏m′∣mΦˉℓjm′=(Xm−1)ℓa and ∏j=0a−1∏m′∣mΦˉℓjm′=(Xm−1)ℓa−1. The second product is the part j≤a−1 of the first, and (Xm−1)ℓa−1≠0, so cancelling this common factor in the domain Fℓ[t] gives ∏m′∣mΦˉℓam′=(Xm−1)ℓa−ℓa−1=(Xm−1)φ(ℓa).

1.2F5

Applied to n=m, which is coprime to ℓ, [F5] gives Φˉm=∏i=1ghi with g=φ(m)/d, where the hi are pairwise distinct monic irreducible elements of Fℓ[t] of degree d=ord⁡m(ℓ); in particular Φˉm≠0.

2.1step 1.1F4F7

Claim: for our fixed a≥1, Φˉℓan=Φˉnφ(ℓa) in Fℓ[t] for every n≥1 with gcd⁡(n,ℓ)=1. This is proved by strong induction on n. For n=1, step 1.1 with m=1 gives Φˉℓa=(X−1)φ(ℓa), while Φˉ1=X−1 by [F4], so Φˉℓa=Φˉ1φ(ℓa). For n>1, assume the claim for every proper divisor m′∣n, m′≠n; step 1.1 with m=n gives ∏m′∣nΦˉℓam′=(Xn−1)φ(ℓa), and [F4] gives ∏m′∣nΦˉm′=Xn−1, so substituting Φˉℓam′=Φˉm′φ(ℓa) for the proper divisors yields Φˉℓan⋅∏m′∣n, m′<nΦˉm′φ(ℓa)=Φˉnφ(ℓa)⋅∏m′∣n, m′<nΦˉm′φ(ℓa); the common factor is a nonzero product of nonzero monic polynomials, so cancellation in the domain Fℓ[t] gives Φˉℓan=Φˉnφ(ℓa).

2.2F6step 1.2

Since gcd⁡(ℓa,m)=1, [F6] gives φ(f)=φ(ℓam)=φ(ℓa)φ(m), so edg=φ(ℓa)⋅d⋅(φ(m)/d)=φ(ℓa)φ(m)=φ(f).

3.1step 1.2step 2.1

In all cases a≥0 one has Φˉf=Φˉℓam=∏i=1ghie in Fℓ[t], a product of pairwise distinct monic irreducibles of degree d with common multiplicity e: if a≥1 this is step 2.1 at n=m combined with step 1.2, and if a=0 then e=φ(1)=1 and m=f, so the same formula is step 1.2 itself.

4.1F1F2F3step 3.1

By [F1], [F2] the element α:=ζ has OK=Z[α] and monic minimal polynomial Φf, so the monogenic factorisation [F3] applies with p=ℓ to the factorisation of step 3.1: ℓOK=∏i=1gPie with pairwise distinct primes Pi=(ℓ,h~i(ζ)) of residue degree deg⁡hi=d, where h~i is the coefficientwise integer lift modulo ℓ, and ∏i=1gPie=(P1⋯Pg)e.

5.1F8step 4.1step 2.2∎

Edge cases. If f=1 then a=0, m=1, e=d=g=1 and Φˉ1=X−1, so steps 3.1 and 4.1 give ℓZ=(ℓ), and step 2.2 gives edg=1=φ(1); if m=1 and a≥1>0 then g=d=1 and P1=(ℓ,ζ−1), so ℓOK=P1 φ(ℓa), while [F8] with p=ℓ, b=a gives ℓOK=(λ)φ(ℓa) with λ=1−ζ the unique prime above ℓ; the two descriptions agree by uniqueness of the prime above ℓ.

Remarks

  • Where reducedness enters. The factorisation argument itself only uses gcd⁡(ℓ,m)=1; the reduced-index hypothesis is the standing convention for cyclotomic conductors in this pair, and it is exactly what excludes the degenerate shape f=2m with m odd, where 2∣f yet Q(ζf)=Q(ζm) and 2 is unramified, so the companion ramification criterion needs the reduced index as stated.
  • Unramified case. When a=0 the theorem specialises to ℓOK=P1⋯Pg with g=φ(f)/ord⁡f(ℓ) primes of residue degree ord⁡f(ℓ), the form in which the unramified-decomposition corollary of this page reads off the residue degree of the arithmetic Frobenius (Decomposition of an unramified prime in a cyclotomic field).
  • Choice. The proof's only structural inputs are the choice-free monogenic reduction [F3] and finite polynomial arithmetic; the monograph-level finite field factorisation [F5] is quoted as a published interface.

Depends on

Used by

Dependency tree · two levels

92 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