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.
The cyclotomic polynomials , defined by
Definition
The cyclotomic polynomials (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution) are defined by recursion on :
the divisors being the positive divisors of (Divisibility in : when for some integer ). The product is formed in the commutative ring (Polynomial convolution makes a commutative ring containing as its constant subring): multiply the finitely many factors in any enumeration of the divisor set. Associativity and commutativity make the result independent of that enumeration.
What the fraction means. The denominator is a product of monic polynomials in , hence itself monic (Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree), so Division by a monic polynomial over a commutative ring supplies a unique pair with and or . The definition sets , and asserts . That assertion, together with the consequences that each is monic of degree and that
for every , is discharged by The recursion defines a unique monic , of degree ↗, which is why that theorem is a numbered result and not a parenthesis: the division is carried out over , not over a field, so exactness is a statement about integer coefficients and does not follow from the division algorithm.
Remarks
-
Why not define by its roots. The usual definition takes to be the monic polynomial whose roots are the primitive -th roots of unity in , or the minimal polynomial over of a primitive -th root of unity. Neither is available at this point in the reading order, and neither would serve: the minimal-polynomial version makes is irreducible in for every a tautology rather than a theorem, and over a base field where the reduction of is reducible it no longer controls the factorisation there (For the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo ). The recursion above is a statement about alone, and the description of the roots is then a theorem (Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity).
-
Reduction into another field. For a field the image of under the coefficientwise ring homomorphism induced by the canonical map and fixing is again written when no confusion arises; the identity is preserved, since a ring homomorphism preserves finite products.
Depends on
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- Polynomial convolution makes $R[x]$ a commutative ring containing $R$ as its constant subring
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
- Division by a monic polynomial over a commutative ring
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
Used by
- The reduction of Φₙ is irreducible over F_q exactly when [q] generates (ℤ/n)^× Corollary
- Φ₁ through Φ₁₂ computed from the divisor recursion Example
- FALSE: every cyclotomic polynomial has all coefficients in {-1,0,1} False statement
- If p is a prime not dividing n, a rational minimal polynomial of a primitive n-th root of unity also kills its p-th power Lemma
- Φ₁(0)=-1 and Φₙ(0)=1 for n≥2 Lemma
- Φ_pʳ(t)=∑_k<pt^kpʳ⁻¹, and Φ_pʳ(t+1) is Eisenstein at p Proposition
- Φₙ is irreducible over K exactly when [K(ζₙ):K]=φ(n), exactly when the embedding into (ℤ/n)^× is onto Proposition
- For every n≥1 there are infinitely many primes p with p≡1 (mod n) Theorem
- For gcd(n,q)=1 the reduction of Φₙ in F_q[t] is a product of distinct monic irreducibles, each of degree the order of [q] modulo n Theorem
- Over a field whose characteristic does not divide n, the roots of Φₙ are exactly the primitive roots of unity Theorem
- The recursion defines a unique monic Φₙ∈ℤ[t], of degree φ(n) Theorem
- Φₙ is irreducible in ℚ[t] for every n≥1 Theorem
Dependency tree · two levels
16 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
- K. Conrad, Cyclotomic Extensions (expository blurb), Section 5 (standard reference, not scraped)
- P. L. Clark, Field Theory (course notes/monograph), Section 9.1.2 (standard reference, not scraped)