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.

Prime-power cyclotomic ring, discriminant support and p factor

Statement

For a prime p and an integer a≥1 put K=Q(ζpa), e=φ(pa) and λ=1−ζpa. Then OK=Z[ζpa],(p)=(λ)e, the power basis 1,ζpa,…,ζpae−1 is an integral basis of OK, and the discriminant of that basis is a signed power of p with absolute value p pa−1(a(p−1)−1).

Facts & Assumptions

Given: A prime p, an integer a≥1, e:=φ(pa), a primitive pa-th root of unity ζ=ζpa in a fixed algebraic closure of Q, the field K:=Q(ζ), the element λ:=1−ζ, the subring R:=Z[ζ]⊆K, the polynomial Φ:=Φpa∈Z[t], and the index m:=[OK:R] of the order R in the ring of integers OK of K.

[F1]

Φ is monic of degree e=φ(pa), Φ(1)=p, and Φ(t) (tpa−1−1)=tpa−1 (Φpr(t)=∑k<ptkpr−1, and Φpr(t+1) is Eisenstein at p).

[F2]

Φ is irreducible over Q (Φn is irreducible in Q[t] for every n≥1), so Φ is the minimal polynomial of ζ over Q, K=Q[t]/(Φ), [K:Q]=deg⁡Φ=e, and 1,ζ,…,ζe−1 is a Q-basis of K (The cyclotomic extension K(μn) as a splitting field of tn−1).

[F3]

K/Q is Galois and Gal⁡(K/Q)≅(Z/pa)× via σj(ζ)=ζj; in particular for every integer j coprime to p there is σj∈Gal⁡(K/Q) with σj(ζ)=ζj ([Q(ζn):Q]=φ(n) and Gal⁡(Q(μn)/Q)≅(Z/n)×).

[F4]

ζ is integral over Z, being a root of the monic polynomial tpa−1, and the integral elements form a subring; hence R=Z[ζ]⊆OK (Integral elements over a commutative ring and algebraic integers, Integral elements over a nonzero base ring form a subring). A unital subring of OK that is free of rank [K:Q] as a Z-module is an order, every order has an integral basis and finite additive index in OK, and OK itself is free of rank [K:Q] (Order in a number field, Orders have integral bases and finite index, The ring of integers has rank the degree). Consequently R is an order in K, m is finite, and mOK⊆R: the quotient group OK/R is finite of order m and every element of a finite group of order m has order dividing m (The order of every element of a finite group divides the order of the group).

[F5]

Since K/Q is Galois of degree e, for x∈K the norm is NK/Q(x)=∏σ∈Gal⁡(K/Q)σ(x), and if x∈OK then NK/Q(x)∈Z (Norm and trace from embeddings, with the inseparable exponent in the norm formula, The rational algebraic integers are exactly the integers).

[F6]

disc⁡(1,ζ,…,ζe−1)=(−1)e(e−1)/2NK/Q(Φ′(ζ)) (Power-basis and polynomial discriminants), this is the discriminant disc⁡(R) of the order R, and disc⁡(R)=m2dK with dK:=disc⁡(OK) a nonzero integer (Discriminant of a basis and order, Order-index discriminant formula, Number-field discriminant is well-defined and nonzero).

[F7]

OK∩Q=Z: a rational number that is a root of a monic polynomial in Z[t] lies in Z (The rational algebraic integers are exactly the integers).

Proof

technique · direct
1.1F1F2F4given

Φ(ζ)=0 by [F1], so ζ is a root of the degree-e monic Φ, which is irreducible by [F2]; hence K has degree e over Q, the powers 1,ζ,…,ζe−1 form a Z-basis of R, and R is an order in OK with finite index m satisfying mOK⊆R.

1.2F1F2F3

For every integer j coprime to p the element ζj is a root of Φ: its order is pa, so (ζj)pa=1 while (ζj)pa−1≠1, and [F1] then forces Φ(ζj)=0; the e elements ζj with j∈(Z/pa)× are pairwise distinct, so comparison with the monic degree-e polynomial Φ gives Φ(X)=∏j∈(Z/pa)×(X−ζj) and p=Φ(1)=∏j∈(Z/pa)×(1−ζj).

2.1F1step 1.2

Each factor of the product in step 1.2 is a unit multiple of λ=1−ζ inside R: after replacing j by its least positive residue modulo pa the quotient (1−ζj)/(1−ζ)=1+ζ+⋯+ζj−1 lies in R, and if s satisfies js≡1(modpa) then ζ=(ζj)s and (1−ζ)/(1−ζj)=1+ζj+⋯+(ζj)s−1∈Z[ζj]⊆R; the two quotients are inverse to each other, so (1−ζj)/(1−ζ)∈R×. Hence p=uλe for some u∈R×, and consequently λeOK=pOK.

2.2F1F3F5step 1.2

Taking the product formula of [F5] over the Galois group identified in [F3] and substituting step 1.2 gives NK/Q(1−ζ)=∏σσ(1−ζ)=∏j∈(Z/pa)×(1−ζj)=Φ(1)=p; moreover NK/Q(ζ)∈Z by [F5] and NK/Q(ζ)pa=NK/Q(ζpa)=NK/Q(1)=1, so NK/Q(ζ)=±1, since the only integers whose pa-th power is 1 are ±1.

3.1F2F5step 2.2

For 0≤s≤a−1 one has NK/Q(1−ζps)=p ps: the element ζs:=ζps is a primitive pa−s-th root of unity in Ls:=Q(ζs), the computation of step 2.2 with a replaced by a−s gives NLs/Q(1−ζs)=p, and the embedding formula of [F5] applied to the tower Q⊆Ls⊆K gives NK/Q(1−ζps)=NLs/Q(1−ζs)[K:Ls]=p ps, since [K:Ls]=φ(pa)/φ(pa−s)=ps by [F2].

3.2F7step 2.1

Z∩λOK=pZ: step 2.1 gives p=uλe with u∈R×, so p∈λOK and pZ⊆Z∩λOK; conversely, if c∈Z∩λOK, then ce∈Z∩λeOK=Z∩pOK by step 2.1, say ce=pβ with β=ce/p∈OK, and β∈OK∩Q=Z by [F7], so p divides ce in Z and hence p divides c, that is c∈pZ.

4.1step 2.1step 3.2

(pOK)∩R=pR: the inclusion ⊇ is clear; for ⊆ let α∈pOK∩R and expand α=c0+c1λ+⋯+ce−1λe−1 with ci∈Z, which is possible because ζ=1−λ makes 1,λ,…,λe−1 a Z-basis of R as well. We show ci∈pZ for all i by induction: if α=∑i≥i0ciλi∈pOK with 0≤i0<e, then i0+1≤e and pOK=λeOK by step 2.1, so α∈λi0+1OK and α/λi0∈λOK; on the other hand α/λi0=ci0+λ∑i>i0ciλi−i0−1∈ci0+λOK, the bracket lying in R⊆OK. Hence ci0∈Z∩λOK=pZ by step 3.2, and subtracting ci0λi0∈pR⊆pOK from α leaves ∑i>i0ciλi∈pOK∩R for the next index. Thus all coefficients are multiples of p and α∈pR.

4.2F1F5F6step 2.2step 3.1

Differentiating the identity tpa−1=(tpa−1−1)Φ(t) of [F1] gives Φ′(t)(tpa−1−1)+Φ(t)pa−1tpa−1−1=patpa−1, and evaluating at t=ζ, where Φ(ζ)=0 and ζpa=1, yields Φ′(ζ)=paζpa−1/(ζpa−1−1). Taking norms with the product formula of [F5] and using multiplicativity of the norm together with step 3.1 at s=a−1 and NK/Q(ζ)=±1 from step 2.2 gives NK/Q(Φ′(ζ))=(pa)eNK/Q(ζ)pa−1/NK/Q(ζpa−1−1)=±p ae−pa−1=±p pa−1(a(p−1)−1), so [F6] gives disc⁡(R)=±pN with N:=pa−1(a(p−1)−1).

5.1F6step 4.2

Since disc⁡(R)=m2dK by [F6] and both disc⁡(R) and dK are nonzero integers, m2 divides disc⁡(R)=±pN in Z, so the positive index is m=pν for some integer ν≥0.

5.2step 4.1

OK∩p−1R=R: if β∈OK and pβ∈R, then pβ∈pOK∩R=pR by step 4.1, say pβ=pρ with ρ∈R, and cancelling p in the domain K gives β=ρ∈R; the reverse inclusion is trivial.

6.1step 5.2

By induction on j≥0 one has OK∩p−jR=R: the case j=0 is trivial and the case j=1 is step 5.2; if j≥1 and x∈OK satisfies pjx∈R, then pj−1(px)∈R with px∈OK, so the induction hypothesis gives px∈R, and then step 5.2 gives x∈R.

7.1step 1.1step 2.1step 4.2step 5.1step 6.1∎

By step 5.1 write the finite index as m=pν with ν≥0; then mOK=pνOK⊆R by step 1.1, so for any x∈OK we get pνx∈R and step 6.1 with j=ν gives x∈R. Hence OK=R=Z[ζ], and the equality p=uλe with u∈R× from step 2.1 is an equality of principal ideals (p)=(λ)e in OK; in particular the power basis 1,ζ,…,ζe−1 is an integral basis of OK whose discriminant, by step 4.2, equals ±p pa−1(a(p−1)−1). For pa=2 one has e=1, λ=2, K=Q and exponent 0, in agreement with the general computation.

Remarks

  • Both halves of the index argument are needed. The order-index formula alone gives only that the index m is a power of p; the descent through the coefficients of λ=1−ζ in steps 4.1 and 5.2 is what forces m=1. The unit identity p=uλe of step 2.1 is used in both places, through λeOK=pOK.
  • The boundary case pa=2 has K=Q, λ=2 and discriminant 1=20; the formulas Φ2(t)=t+1 and ζpa−1−1=ζ−1=−2 are consistent with the general computation in step 4.2, whose exponent is 0 there.

Depends on

Used by

Dependency tree · two levels

85 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