Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck 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 n1 with charKn, a splitting field E of tn1 over K, and the convention that for every finite subset TE 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 g0g1gn1 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 m1 one has dmΦd=tm1 in Z[t], each Φd monic of degree φ(d) (The recursion defines a unique monic ΦnZ[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 αjE, 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 (ta)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 xa divides f (Factor theorem over a commutative ring).

Proof

technique · direct
1.1

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

L1L3
1.2

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.

L5given
2.1

For every positive divisor m of n the polynomial tm1 divides tn1 in Z[t], since tn1=(tm1)(tnm+tn2m++1); hence it splits over E with distinct roots, which are the elements of μm(E), and tm1=ζμm(E)(tζ) with μm(E)=m.

step 1.1L3L4algebra
3.1

Consequently dmΨd=ζμm(E)(tζ)=tm1 for every positive divisor m of n.

step 2.1step 1.2
4.1

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 t1, 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 (ed,e<dΨe)Φd=td1=(ed,e<dΨe)Ψd, and cancelling the nonzero left factor in the integral domain E[t] ([L6]) gives Φd=Ψd.

step 3.1L2L6
5.1

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].

step 4.1L1L2
6.1

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

L1L2L4algebra

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