Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablejudge 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.

The cyclotomic polynomials Φn∈Z[t], defined by ∏d∣nΦd=tn−1

Definition

The cyclotomic polynomials Φn∈Z[t] (The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution) are defined by recursion on n≥1:

Φ1:=t−1,Φn:=tn−1∏d∣n0<d<nΦd(n≥2),

the divisors being the positive divisors of n (Divisibility in Z: d∣a when a=dq for some integer q). The product is formed in the commutative ring Z[t] (Polynomial convolution makes R[x] a commutative ring containing R 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 Pn:=∏d∣n, d<nΦd is a product of monic polynomials in Z[t], 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 q,r∈Z[t] with tn−1=qPn+r and r=0 or deg⁡r<deg⁡Pn. The definition sets Φn:=q, and asserts r=0. That assertion, together with the consequences that each Φn is monic of degree φ(n) and that

∏d∣nΦd=tn−1

for every n≥1, is discharged by The recursion defines a unique monic Φn∈Z[t], of degree φ(n) ↗, which is why that theorem is a numbered result and not a parenthesis: the division is carried out over Z, not over a field, so exactness is a statement about integer coefficients and does not follow from the division algorithm.

Remarks

Depends on

Used by

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