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.
Choice-free prime factorisation for a monogenic number ring
Statement
Let be a number field with , and let be the monic minimal polynomial of . For a rational prime , factor the image of in as into distinct monic irreducibles. Let be the coefficientwise lift of with coefficients in . Then
The ideal is independent of the integer lift, since two lifts differ by a polynomial in . The are distinct primes of with residue degrees . This proof uses no Axiom of Choice.
Facts & Assumptions
Given: A number field with , its monic minimal polynomial , a rational prime , and a factorisation in into distinct monic irreducibles , where and , and their coefficientwise integer lifts as in the Statement.
Evaluation at identifies with (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element, First isomorphism theorem for rings: , The quotient ring with ). Reducing this presentation modulo gives .
Since is prime, is a field (For every prime , the two operations on make it a field). The powers are pairwise comaximal in , so the Chinese remainder theorem gives Each factor has unique prime ideal generated by the image of , and its residue field is (Bézout identity and the Euclidean algorithm for polynomials over a field, Chinese remainder theorem for pairwise comaximal ideals, For every field , is a unique factorisation domain).
Every nonzero integral ideal of a number field's ring of integers has a unique finite factorisation into powers of distinct nonzero prime ideals; the finite construction uses no Choice (Integral ideal factorisation in a number field, in ZF).
If is a prime ideal, is the localisation at the multiplicative set , and its maximal ideal is (Localisation at a prime ideal: , is local with unique maximal ideal ). Localisation commutes with quotient rings (Localisation commutes with quotient rings: ).
A prime lies above when , and its residue degree is (Primes above and residue degree).
Proof
Put . By [F1],
Since , apply [F3] to write with distinct nonzero primes and positive exponents .
Under this isomorphism, [F2] decomposes as the product of the local rings . The unique prime of is generated by and has residue field ; therefore the primes of containing are exactly the distinct inverse images .
It follows that , a field of degree over . Thus each is a nonzero prime above with residue degree by [F5].
The finite ring is the product in [F2], so every prime containing is maximal. Each contains and hence equals one of the by step 2.1. Conversely, each contains ; its primality implies for some , and maximality makes . Hence the list is exactly the list , with one exponent attached to each .
Fix and put and . Each other contains an element outside , which becomes a unit, so By [F4], is local with maximal ideal ; it is a domain because it is a localisation of the domain . Also , so each power of is finitely generated by the monomials in these two generators.
The ideal is nonzero: it contains . If , then . Among finite generating lists of , take one of minimum length , say . The equality gives with . Since is a unit in the local ring , this expresses in terms of the first generators, contradicting minimality. Hence . In the maximal ideal therefore has nilpotency index exactly , including .
By [F1] and [F4], Writing with , each factor of is a unit in . Thus the displayed local ring is . Its maximal ideal is generated by and has nilpotency index exactly : its -th power vanishes, while , since cancellation in the polynomial localisation domain would otherwise make the nonunit a unit. Comparing its nilpotency index with step 5.1 gives .
Substituting into the factorisation of step 1.2 yields The residue degrees are those proved in step 3.1, and . The polynomial factorisation and its CRT decomposition are finite; the only ideal-factorisation input [F3] explicitly uses finite least-coded choices and no Choice.
Remarks
- Repeated factors are retained. The multiplicities are recovered by localising the polynomial quotient at and comparing its nilpotency index with the local exponent in the ideal factorisation.
- Supplier route. This proof uses the published choice-free ideal-factorisation theorem Integral ideal factorisation in a number field, in ZF for existence of the ideal factorisation. The exact local nilpotency index is proved here using the explicit finite generators and a minimal generating list. It therefore no longer claims to avoid general ideal-factorisation theory.
- The monogenic hypothesis is essential. It identifies with the explicit quotient ; for a non-monogenic order, reduction of a minimal polynomial does not by itself describe the primes of .
Depends on
- Ring of integers
- Primes above and residue degree
- The ideal generated by a subset and principal ideals
- The quotient ring $R/I$ with $(r+I)(s+I)=rs+I$
- The polynomial ring over a commutative ring as finitely supported coefficient sequences with convolution
- Localisation at a prime ideal: $R_{\mathfrak p}=(R\setminus\mathfrak p)^{-1}R$
- For every prime $p$, the two operations on $\mathbb{Z}/p$ make it a field
- Bézout identity and the Euclidean algorithm for polynomials over a field
- Chinese remainder theorem for pairwise comaximal ideals
- $R_{\mathfrak p}$ is local with unique maximal ideal $\mathfrak pR_{\mathfrak p}$
- Localisation commutes with quotient rings: $S^{-1}R/S^{-1}I\cong \bar S^{-1}(R/I)$
- The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element
- First isomorphism theorem for rings: $R/\ker f\cong\operatorname{im}f$
- For every field $F$, $F[x]$ is a unique factorisation domain
- Integral ideal factorisation in a number field, in ZF
Used by
Dependency tree · two levels
65 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, Theorem 3.41 and proof, pp. 62-63 (standard reference, not scraped)