Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-26
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.

Over a field whose characteristic does not divide n, the roots of Φn are exactly the primitive roots of unity

Statement

Facts & Assumptions

Given: A field K, an integer n≥1 with char⁡K∤n, a splitting field E of tn−1 over K, and the convention that for every finite subset T⊆E the product ∏ζ∈T(t−ζ)∈E[t] means the finite product along any enumeration of T; because E[t] is a commutative ring, the value is independent of the enumeration (The product g0g1⋯gn−1 of a finite list in a monoid, by recursion, with the empty product (n=0) equal to the identity, Generalised associativity: in a monoid the product of a finite list does not depend on the bracketing, and in a commutative monoid it does not depend on the order of the factors either, Polynomial convolution makes R[x] a commutative ring containing R as its constant subring). In particular, for each positive divisor d of n, let Sd:={ζ∈μn(E):ord⁡(ζ)=d} and Ψd:=∏ζ∈Sd(t−ζ)∈E[t].

[L2]

For every m≥1 one has ∏d∣mΦd=tm−1 in Z[t], each Φd monic of degree φ(d) (The recursion defines a unique monic Φn∈Z[t], of degree φ(n)); reduction into K[t] preserves this identity.

[L3]

A monic f of degree m splits over E when f=∏j=1m(t−αj) with αj∈E, repetitions allowed, and a splitting field is generated over K by the roots (Polynomials that split and splitting fields of a polynomial or a family of polynomials).

[L4]

f is separable over K when no extension field of K contains an a with (t−a)2 dividing the image of f (Repeated roots in extension fields and separable polynomials).

[L6]

R[x] is an integral domain when R is (A polynomial ring over an integral domain is an integral domain); and f(a)=0 if and only if x−a divides f (Factor theorem over a commutative ring).

Proof

technique · direct
1.1L1L3

By [L1] the polynomial tn−1 is separable over K and μn(E) is cyclic of order n; so tn−1 has n distinct roots in E, namely the elements of μn(E), and tn−1=∏ζ∈μn(E)(t−ζ) by [L3].

1.2L5given

Each ζ∈μn(E) has order dividing n by [L5], and for a positive divisor m of n the condition ζm=1 says exactly ord⁡(ζ)∣m; so μm(E) is the disjoint union of the Sd over positive divisors d of m.

2.1step 1.1L3L4algebra

For every positive divisor m of n the polynomial tm−1 divides tn−1 in Z[t], since tn−1=(tm−1)(tn−m+tn−2m+⋯+1); hence it splits over E with distinct roots, which are the elements of μm(E), and tm−1=∏ζ∈μm(E)(t−ζ) with ∣μm(E)∣=m.

3.1step 2.1step 1.2

Consequently ∏d∣mΨd=∏ζ∈μm(E)(t−ζ)=tm−1 for every positive divisor m of n.

4.1step 3.1L2L6

For every positive divisor d of n the image of Φd in E[t] is Ψd, by induction on d through the divisors of n: at d=1 both are t−1, since S1={1}; and if the claim holds for every positive divisor e of d with e<d, then [L2] and step 3.1 give (∏e∣d, e<dΨe)Φd=td−1=(∏e∣d, e<dΨe)Ψd, and cancelling the nonzero left factor in the integral domain E[t] ([L6]) gives Φd=Ψd.

5.1step 4.1L1L2

Taking d=n: the image of Φn in E[t] is ∏ζ∈Sn(t−ζ), so Φn splits over E and its roots there are exactly the elements of Sn, which are the elements of order n in μn(E), that is the primitive n-th roots of unity in E; there are φ(n) of them by [L1], in agreement with deg⁡Φn=φ(n) from [L2].

6.1L1L2L4algebra∎

Φn is separable over K. The product identity [L2] shows that the image of Φn divides tn−1 in K[t]. If an extension field L/K contained an a for which (t−a)2 divided the image of Φn, then the same square would divide the image of tn−1 in L[t], making a a repeated root of tn−1. This contradicts the separability of tn−1 supplied by [L1]. Thus [L4] applies.

Remarks

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