Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-10-02
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 K=Q(α) be a number field with OK=Z[α], and let F be the monic minimal polynomial of α. For a rational prime p, factor the image Fˉ of F in Fp[t] as ∏igiai into distinct monic irreducibles. Let g~i∈Z[t] be the coefficientwise lift of gi with coefficients in {0,…,p−1}. Then

pOK=∏iPiai,Pi=(p, g~i(α)),

The ideal (p,g~i(α)) is independent of the integer lift, since two lifts differ by a polynomial in pZ[t]. The Pi are distinct primes of OK with residue degrees deg⁡gi. This proof uses no Axiom of Choice.

Facts & Assumptions

Given: A number field K=Q(α) with OK=Z[α], its monic minimal polynomial F∈Z[t], a rational prime p, and a factorisation Fˉ=∏i=1kgiai in Fp[t] into distinct monic irreducibles gi, where di:=deg⁡gi and ai≥1, and their coefficientwise integer lifts g~i as in the Statement.

[F1]

Evaluation at α identifies Z[t]/(F) with Z[α]=OK (The evaluation kernel and the unique monic irreducible minimal polynomial of an algebraic element, First isomorphism theorem for rings: R/ker⁡f≅im⁡f, The quotient ring R/I with (r+I)(s+I)=rs+I). Reducing this presentation modulo p gives OK/pOK≅Fp[t]/(Fˉ).

[F2]

Since p is prime, Fp is a field (For every prime p, the two operations on Z/p make it a field). The powers (giai) are pairwise comaximal in Fp[t], so the Chinese remainder theorem gives Fp[t]/(Fˉ)≅∏i=1kFp[t]/(giai). Each factor has unique prime ideal generated by the image of gi, and its residue field is Fp[t]/(gi) (Bézout identity and the Euclidean algorithm for polynomials over a field, Chinese remainder theorem for pairwise comaximal ideals, For every field F, F[x] is a unique factorisation domain).

[F3]

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).

[F4]

If P is a prime ideal, OK,P is the localisation at the multiplicative set OK∖P, and its maximal ideal is POK,P (Localisation at a prime ideal: Rp=(R∖p)−1R, Rp is local with unique maximal ideal pRp). Localisation commutes with quotient rings (Localisation commutes with quotient rings: S−1R/S−1I≅Sˉ−1(R/I)).

[F5]

A prime P⊆OK lies above (p) when P∩Z=(p), and its residue degree is [OK/P:Fp] (Primes above and residue degree).

Proof

technique · direct
1.1F1given

Put A:=OK=Z[α]. By [F1], A/pA≅Fp[t]/(Fˉ).

1.2F3given

Since pA≠0, apply [F3] to write pA=∏j=1rQjej with distinct nonzero primes Qj and positive exponents ej.

2.1F2step 1.1

Under this isomorphism, [F2] decomposes A/pA as the product of the local rings Bi:=Fp[t]/(giai). The unique prime of Bi is generated by gi and has residue field Fp[t]/(gi); therefore the primes of A containing pA are exactly the distinct inverse images Pi=(p,g~i(α)).

3.1F5step 1.1step 2.1

It follows that A/Pi≅Fp[t]/(gi), a field of degree di over Fp. Thus each Pi is a nonzero prime above (p) with residue degree di by [F5].

3.2step 2.1step 1.2

The finite ring A/pA is the product in [F2], so every prime containing pA is maximal. Each Qj contains pA and hence equals one of the Pi by step 2.1. Conversely, each Pi contains pA=∏jQjej; its primality implies Qj⊆Pi for some j, and maximality makes Qj=Pi. Hence the list Q1,…,Qr is exactly the list P1,…,Pk, with one exponent ei attached to each Pi.

4.1F4step 2.1step 3.2

Fix i and put S:=APi and m:=PiS. Each other Pj contains an element outside Pi, which becomes a unit, so pS=mei. By [F4], S is local with maximal ideal m; it is a domain because it is a localisation of the domain A. Also m=(p,g~i(α))S, so each power of m is finitely generated by the monomials in these two generators.

5.1F4step 4.1algebra

The ideal J:=mei−1 is nonzero: it contains pei−1≠0. If J⊆mei, then J=mJ. Among finite generating lists of J, take one of minimum length n≥1, say v1,…,vn. The equality J=mJ gives vn=∑j=1ncjvj with cj∈m. Since 1−cn is a unit in the local ring S, this expresses vn in terms of the first n−1 generators, contradicting minimality. Hence mei−1⊈mei. In S/pS=S/mei the maximal ideal therefore has nilpotency index exactly ei, including ei=1.

6.1F1F2F4step 5.1

By [F1] and [F4], APi/pAPi≅Fp[t](gi)/(Fˉ). Writing Fˉ=giaiui with ui=∏j≠igjaj, each factor of ui is a unit in Fp[t](gi). Thus the displayed local ring is Fp[t](gi)/(giai). Its maximal ideal is generated by gi and has nilpotency index exactly ai: its ai-th power vanishes, while giai−1∉(giai), since cancellation in the polynomial localisation domain would otherwise make the nonunit gi a unit. Comparing its nilpotency index with step 5.1 gives ei=ai.

7.1F3step 3.1step 1.2step 6.1∎

Substituting ei=ai into the factorisation of step 1.2 yields pOK=∏i=1kPiai,Pi=(p,g~i(α)). The residue degrees are those proved in step 3.1, and ∑iaidi=deg⁡Fˉ. 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 ai are recovered by localising the polynomial quotient at (gi) 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 OK with the explicit quotient Z[t]/(F); for a non-monogenic order, reduction of a minimal polynomial does not by itself describe the primes of OK.

Depends on

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