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.
Prime factorisation in a cyclotomic field
Statement
Let be a reduced index, that is, is odd or . Let be a rational prime, write with (so is the -adic valuation of , , and when ), and put , , the multiplicative order of modulo , and , with the conventions and . Let be a primitive -th root of unity and . Then with pairwise distinct primes of residue degree , and .
Facts & Assumptions
Given: A reduced index , a rational prime , the factorisation with , the numbers , , (with the conventions and ), a primitive -th root of unity , the field , and, for , the image of in .
is monic of degree with , its roots in a field of characteristic not dividing are exactly the primitive -th roots of unity, and is irreducible over ; hence is the minimal polynomial of over , and is a cyclotomic extension of order (The recursion defines a unique monic , of degree , Over a field whose characteristic does not divide , the roots of are exactly the primitive roots of unity, is irreducible in for every , The cyclotomic extension as a splitting field of ).
Monogenic factorisation: if is a number field with and monic minimal polynomial of , and if the image of in factors as into distinct monic irreducibles, then with pairwise distinct primes of residue degree , where is the coefficientwise lift of with coefficients in ; the argument uses no Axiom of Choice (Choice-free prime factorisation for a monogenic number ring, Primes above and residue degree).
For every , in , and is monic of degree ; in particular (The recursion defines a unique monic , of degree , The cyclotomic polynomials , defined by ).
Finite-field factorisation: if and , then is a product of pairwise distinct monic irreducible polynomials in , each of degree , and there are of them (For the reduction of in is a product of distinct monic irreducibles, each of degree the order of modulo , The order of a finite group and the order of an element, with when no positive power of is the identity, The unit group and Euler's totient for ).
Euler's totient is multiplicative on coprime arguments: when (Euler's totient is multiplicative: implies for positive ).
is an integral domain (indeed a unique factorisation domain), so a product identity with implies (For every field , is a unique factorisation domain).
Total ramification in a prime-power cyclotomic field: for , with , and is the unique prime above , with residue field (Total ramification at a prime-power cyclotomic level).
Proof
Assume . Since , the divisors of are exactly the with and ; reducing the product identity of [F4] at and at modulo and using in therefore gives and . The second product is the part of the first, and , so cancelling this common factor in the domain gives .
Applied to , which is coprime to , [F5] gives with , where the are pairwise distinct monic irreducible elements of of degree ; in particular .
Claim: for our fixed , in for every with . This is proved by strong induction on . For , step 1.1 with gives , while by [F4], so . For , assume the claim for every proper divisor , ; step 1.1 with gives , and [F4] gives , so substituting for the proper divisors yields ; the common factor is a nonzero product of nonzero monic polynomials, so cancellation in the domain gives .
Since , [F6] gives , so .
In all cases one has in , a product of pairwise distinct monic irreducibles of degree with common multiplicity : if this is step 2.1 at combined with step 1.2, and if then and , so the same formula is step 1.2 itself.
By [F1], [F2] the element has and monic minimal polynomial , so the monogenic factorisation [F3] applies with to the factorisation of step 3.1: with pairwise distinct primes of residue degree , where is the coefficientwise integer lift modulo , and .
Edge cases. If then , , and , so steps 3.1 and 4.1 give , and step 2.2 gives ; if and then and , so , while [F8] with , gives with the unique prime above ; the two descriptions agree by uniqueness of the prime above .
Remarks
- Where reducedness enters. The factorisation argument itself only uses ; the reduced-index hypothesis is the standing convention for cyclotomic conductors in this pair, and it is exactly what excludes the degenerate shape with odd, where yet and is unramified, so the companion ramification criterion needs the reduced index as stated.
- Unramified case. When the theorem specialises to with primes of residue degree , the form in which the unramified-decomposition corollary of this page reads off the residue degree of the arithmetic Frobenius (Decomposition of an unramified prime in a cyclotomic field).
- Choice. The proof's only structural inputs are the choice-free monogenic reduction [F3] and finite polynomial arithmetic; the monograph-level finite field factorisation [F5] is quoted as a published interface.
Depends on
- Ring of integers of every cyclotomic field
- Total ramification at a prime-power cyclotomic level
- For $\gcd(n,q)=1$ the reduction of $\Phi_n$ in $\mathbb F_q[t]$ is a product of distinct monic irreducibles, each of degree the order of $[q]$ modulo $n$
- The recursion defines a unique monic $\Phi_n\in\mathbb Z[t]$, of degree $\varphi(n)$
- Choice-free prime factorisation for a monogenic number ring
- $\Phi_n$ is irreducible in $\mathbb Q[t]$ for every $n\ge1$
- Over a field whose characteristic does not divide $n$, the roots of $\Phi_n$ are exactly the primitive roots of unity
- Euler's totient is multiplicative: $\gcd(m,n)=1$ implies $\varphi(mn)=\varphi(m)\varphi(n)$ for positive $m,n$
- For every field $F$, $F[x]$ is a unique factorisation domain
- Primes above and residue degree
- The cyclotomic extension $K(\mu_n)$ as a splitting field of $t^{n}-1$
- The cyclotomic polynomials $\Phi_n\in\mathbb Z[t]$, defined by $\prod_{d\mid n}\Phi_d=t^{n}-1$
- 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
- The unit group $(\mathbb{Z}/n)^\times$ and Euler's totient $\varphi(n)=\lvert(\mathbb{Z}/n)^\times\rvert$ for $n\ge1$
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
- J. S. Milne, Algebraic Number Theory, Ch. 3 and Ch. 6 (standard reference, not scraped)
- J. S. Milne, Algebraic Number Theory, Ch. 8, Example 8.18 (standard reference, not scraped)
- Conrad-Landesman, Math 154 Algebraic Number Theory, Chs. 10-11 (standard reference, not scraped)