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 recursion defines a unique monic , of degree
Statement
The recursion of The cyclotomic polynomials , defined by is well posed: for every the division defining is exact, is a monic element of ,
the product being over the positive divisors of , and
(The unit group and Euler's totient for ). Moreover is the only family of monic polynomials in satisfying the displayed product identity for every .
Facts & Assumptions
Given: The recursion of The cyclotomic polynomials , defined by ; the field , which is an ordered field (The rationals form a totally ordered field), so that and in particular for every , whence (The characteristic of a ring: the least with when one exists, and otherwise) and divides no (Divisibility in : when for some integer ).
Let be a commutative ring and monic. For every there are unique with and or (Division by a monic polynomial over a commutative ring).
is separable over exactly when ; and then a splitting field has cyclic of order ( is separable over exactly when the characteristic does not divide , and then a splitting field carries distinct -th roots of unity, The group of -th roots of unity in a field, and primitive -th roots of unity, is cyclic of order dividing , and has a primitive -th root of unity exactly when its order is ).
Every nonzero has a splitting field over (Every nonzero polynomial over a field has a splitting field); monic of degree splits over when with , repetitions allowed (Polynomials that split and splitting fields of a polynomial or a family of polynomials).
is separable over when it has no repeated root in any extension field, a repeated root of in being an with dividing the image of in (Repeated roots in extension fields and separable polynomials).
For an element of finite order in a group, if and only if (If then iff is an integer multiple of , the powers are distinct, and has exactly elements; if has infinite order then only for , The order of a finite group and the order of an element, with when no positive power of is the identity).
for every positive integer (For every positive integer , , The sum over a finite index set, and its product form).
If is an integral domain then so is (A polynomial ring over an integral domain is an integral domain), and for nonzero one has and (Over an integral domain, degrees add under multiplication of nonzero polynomials, Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree).
Proof
The assertion to be proved by strong induction on is: the division defining is exact, is monic, , and . At the recursion sets outright, the only positive divisor of is so the product is , and .
Inductive hypothesis: fix and assume the assertion for every with .
Since does not divide , [L2] and [L3] supply a splitting field of over in which is separable and is cyclic of order . For a positive divisor of put and , a monic polynomial of degree .
For every positive divisor of one has with : the polynomial divides in , since when , so it splits over by [L3], and a repeated root of in an extension would be a repeated root of there, which [L4] excludes; hence its roots are distinct and they are by definition the elements of .
For every positive divisor of , is the disjoint union of the over positive divisors of : an element has finite order dividing , and holds exactly when by [L5]. Hence by step 2.1.
For every positive divisor of with one has , by induction on through the divisors of : at both equal , since ; and if for every positive divisor of with , then step 1.2 and step 3.1 give , and cancelling the nonzero left factor in the integral domain ([L7]) yields .
Write , monic in by step 1.2 and [L7]. By step 4.1 and step 3.1 applied with , in one has .
The division of by in is exact and its quotient is : by [L1] over there are unique with and or ; this is also a division by the monic in , where step 5.1 exhibits the division with quotient and remainder , so the uniqueness clause of [L1] over forces and . Hence is monic in and .
Degrees: taking degrees in with [L7] gives , and by step 1.2 and [L7]; so by [L6].
This is the assertion at , so the strong induction is complete and the assertion holds for every . Uniqueness of the family follows by the same induction: if is monic in with for all , then , and if for all then with in the integral domain ([L7]), so .
Remarks
-
Why a splitting field over appears in a statement about . The exactness of the division is an identity between integer polynomials, but the only cheap reason for it is that the roots of partition by order. The passage to produces that partition; the passage back is the uniqueness clause of monic division, which holds over and over and pins the two computations to the same quotient.
-
The degree computation is where enters. Nothing before step 7.1 mentions Euler's totient; it appears only through For every positive integer , , and the same identity is what makes the count of primitive -th roots of unity match in Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity.
Depends on
- The cyclotomic polynomials $\Phi_n\in\mathbb Z[t]$, defined by $\prod_{d\mid n}\Phi_d=t^{n}-1$
- Division by a monic polynomial over a commutative ring
- For every positive integer $n$, $\sum_{d\mid n,\ d>0}\varphi(d)=n$
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
- Over an integral domain, degrees add under multiplication of nonzero polynomials
- A polynomial ring over an integral domain is an integral domain
- The sum $\sum_{i \in S} a_i$ over a finite index set, and its product form
- Every nonzero polynomial over a field has a splitting field
- Polynomials that split and splitting fields of a polynomial or a family of polynomials
- $t^{n}-1$ is separable over $K$ exactly when the characteristic does not divide $n$, and then a splitting field carries $n$ distinct $n$-th roots of unity
- $\mu_n(K)$ is cyclic of order dividing $n$, and has a primitive $n$-th root of unity exactly when its order is $n$
- The group $\mu_n(K)$ of $n$-th roots of unity in a field, and primitive $n$-th roots of unity
- If $\operatorname{ord}(g) = n$ then $g^{k} = e$ iff $k$ is an integer multiple of $n$, the powers $g^{0}, \dots, g^{n-1}$ are distinct, and $\langle g \rangle$ has exactly $n$ elements; if $g$ has infinite order then $g^{j} = g^{k}$ only for $j = k$
- The order $|G|$ of a finite group and the order $\operatorname{ord}(g)$ of an element, with $\operatorname{ord}(g) = \infty$ when no positive power of $g$ is the identity
- Repeated roots in extension fields and separable polynomials
- The rationals form a totally ordered field
- The characteristic of a ring: the least $n \ge 1$ with $n \cdot 1_R = 0$ when one exists, and $0$ otherwise
- Divisibility in $\mathbb{Z}$: $d \mid a$ when $a = dq$ for some integer $q$
- Degree, leading coefficient and monic polynomial, with the zero polynomial having no degree
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
- Φₙ is irreducible in ℚ[t] for every n≥1 Theorem
Cited to discharge well-definedness by The cyclotomic polynomials Φₙ∈ℤ[t], defined by ∏_d∣ nΦ_d=tⁿ-1.
Dependency tree · two levels
91 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), Theorem 5.2 (standard reference, not scraped)
- P. L. Clark, Field Theory (course notes/monograph), Proposition 9.6 (standard reference, not scraped)