Alphabeta Math
Pipeline-generated
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.

✓ 2 results · all verified · 0 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Prime Ideal Decomposition Ramification and the Different

1 · Prerequisites

2 · Summary

For number fields, integral ideal factorisation is handled through a finite quotient and finite local data. The different is the inverse trace dual; tame ramification has exponent exactly e−1, while wild ramification has only the stronger lower bound recorded here.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The absolute norm of an integral ideal

Definition

For a nonzero integral ideal a⊆OK, define its absolute norm by Na=∣OK/a∣. The next lemma establishes that this cardinality is finite.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A nonzero number-field ideal has finite quotient

Statement

Every nonzero integral ideal of OK has finite additive quotient.

Proof

Given: 0≠a⊆OK and an integral basis of rank n.

1.1givenconstruct

Choose 0≠a∈a. Multiplication by a is an injective endomorphism of the free rank-n lattice OK, with nonzero integral determinant.

2.1step 1.1algebra∎

Its image (a) has finite index, and (a)⊆a⊆OK; thus OK/a is a quotient of the finite group OK/(a).

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-30Open item page →

Integral ideal factorisation in a number field, in ZF

Statement

Every nonzero integral ideal a of OK has a unique finite factorisation a=∏i=1rpiei into distinct nonzero prime ideals, with ei>0. The finite choices in this construction are least-coded finite choices, so the assertion uses no Choice.

Facts & Assumptions

Given: A number field K, its ring of integers R=OK, and a nonzero integral ideal a⊆R.

[F1]

R is a free Z-module of finite rank n=[K:Q] (The ring of integers has rank the degree).

[F2]

Every subgroup of Z is dZ for a unique d≥0; when it is nonzero, d is its least positive element (Every subgroup of (Z,+) is ⟨n⟩=nZ for exactly one natural number n).

[F3]

Every nonzero integral ideal of R has finite additive quotient (A nonzero number-field ideal has finite quotient).

[F4]

Ideals of R/I correspond by inverse image to ideals of R containing I (Correspondence theorem: ideals of R/I correspond to ideals of R containing I).

[F5]

R is the integral closure of Z in K (Ring of integers), and an integral closure of a domain in a field extension is integrally closed (The integral closure of a domain in a field extension is integrally closed).

[F6]

Integral closure commutes with localization: if A is a domain and A‾ its integral closure in a field L, then for every multiplicative T⊆A∖{0} the integral closure of T−1A in L is T−1A‾ (Integrality and integral closure commute with localisation).

[F7]

For a prime ideal p of a domain, Rp is local with unique maximal ideal pRp; its units are exactly the fractions whose numerator is outside p (Rp is local with unique maximal ideal pRp).

[F8]

In a localization at a prime, x/1∈aRq implies sx∈a for some s∉q; this follows from the fraction equality criterion (Equality, vanishing, and the kernel of the localisation map).

[F9]

For a commutative ring and a positive-sized square matrix M, Madj⁡(M)=det⁡(M)I (For every positive-sized square matrix over a commutative ring, Aadj⁡(A)=adj⁡(A)A=det⁡(A)I).

[F10]

The localization fractions have the usual well-defined ring operations, the map r↦r/1 is a ring homomorphism, and every denominator class s/1 is a unit with inverse 1/s (The localisation relation is an equivalence relation and fraction arithmetic is well defined).

Proof

technique · direct finite-rank and finite-quotient construction
1.1F1F2givenconstruct

Work temporarily with one finite integral basis of R supplied by [F1]; fixing this single existential witness is not a choice from a family. It identifies the additive group of R with Zn, on which fix an explicit natural-number code (the usual sign code and a finite tuple-pairing code). An integral basis is Q-independent: clearing denominators in a rational relation gives an integer relation. Its [K:Q] elements therefore form a Q-basis of K. For any z∈K, clearing the finitely many rational coordinates gives a nonzero integer c with cz∈R; hence K=Frac⁡(R). We first prove by induction on m that every subgroup H≤Zm has a finite basis. The case m=0 is immediate. For m>0, project onto the first coordinate. By [F2], the image is either zero or dZ for its least positive element d. In the zero case apply induction to the kernel, viewed in the last m−1 coordinates. Otherwise take the least-coded h∈H with first coordinate d; the kernel has a finite basis by induction, and that basis together with h spans H. Their independence follows by taking first coordinates and then using independence in the kernel. This finite induction uses only least natural numbers and one least-coded lift at each nonzero stage.

1.2givenalgebra

If a=R, its factorisation is the empty product. A nonempty finite product of proper prime ideals is contained in any one of its factors, so it cannot equal R. Hence this factorisation is unique.

2.1step 1.1F7F10algebra

Every ideal I⊆R is an additive subgroup of Zn; step 1.1 gives it a finite Z-basis, which also generates it as an R-ideal because Z⊆R. If S=Rp and J⊆S is an ideal, its contraction I=J∩R is finitely generated by step 1.1, and J=IS: for r/s∈J with s∉p, the unit s/1 gives r/1∈J∩R, and the reverse inclusion is immediate. Consequently every ideal of S is finitely generated. Any ascending chain of ideals of S stabilizes: its union is an ideal, hence has finitely many generators. If the union is zero, every member is zero. Otherwise its finite generating list is nonempty, and its generators all lie in one common chain member, which then equals the union. No maximal-condition or dependent-choice implication is used.

2.2F3F4step 1.1construct

Now suppose 0≠a⊊R. Put A=R/a; [F3] makes A finite. The fixed basis code on R gives each coset of a the least code of its representatives. Order the finite set A by these codes. Code each subset of A by its bit mask in this ordering; this gives a definite code to every ideal of A. The maximal ideals of A form a finite nonempty set: among its proper ideals, take the least bit-mask code among those of greatest finite cardinality. List all maximal ideals in increasing bit-mask order. By [F4], their inverse images are exactly the maximal ideals of R containing a. Every nonzero prime containing a is on this list: its quotient is finite by [F3] and is a domain, hence a field, so that prime is maximal. Conversely every maximal ideal is prime. The list is therefore exact, finite, and canonically ordered.

2.3F5F6F7step 1.1

Fix a prime p in this list and put S=Rp and m=pS. This is a local domain by [F7], and m≠0 because p contains a≠0 and localization of the domain R is injective. By [F5], R is integrally closed; applying [F6] with base domain R, field K=Frac⁡(R) from step 1.1, integral closure R from [F5], and multiplicative set R∖p shows that S is integrally closed in K. Step 1.1 also gives a finite generating list for p, whose images generate m.

3.1F3F7F8F10step 2.3constructalgebra

Code a fraction in S by the least code of a representing pair (r,s)∈R×(R∖p), using the fixed code on R. Thus every nonempty subset of S has a least-coded element. Take the least-coded nonzero x∈m and write x=a/s with 0≠a∈p and s∉p; then xS=aS. The map from the localization of R/aR at the image of R∖p to S/aS sending (r+aR)/(s+aR) to r/s+xS is a surjective ring homomorphism by [F10]. If its value is zero, then r/s∈aS=xS; since s/1 is a unit, r/1∈aS, and [F8] gives some t∉p with tr∈aR. Thus (r+aR)/(s+aR) is already zero in that localization, so the map is injective. The source is finite because it is represented by pairs from the two finite sets R/aR and the image of R∖p, using [F3]. Code its classes by least codes of representing pairs. It is local with maximal ideal n=m/xS: every class outside n has a representative outside m, hence a unit by [F7]. For any y∈n, two powers repeat in this finite ring, say yi=yi+ℓ with ℓ>0. Since 1−yℓ is outside n, it is a unit, so yi=0; necessarily i>0, since 1∉n. The finite set n, ordered by these class codes, has a list y1,…,yq; take for each the least positive nilpotence exponent ki. Every product of 1+∑i(ki−1) elements of n contains some yi at least ki times. Thus nN=0 for some positive N, and mN⊆xS.

4.1F7F9step 2.3step 3.1algebra

Take the least positive N with mN⊆xS. If N=1, then m=xS. If N>1, choose the least-coded y∈mN−1∖xS and put z=y/x∈K. Then z∉S and zm⊆S. If zm⊆m, take finite generators h1,…,hq of m from step 2.3 and take for each i the least-coded coefficient tuple (aij)j∈Sq with zhi=∑jaijhj. The matrix zI−(aij) kills the column of generators. By [F9] its adjugate shows that det⁡(zI−(aij))hi=0 for every i. Some hi≠0, so the domain property gives det⁡(zI−(aij))=0. The polynomial det⁡(TI−(aij)) is monic over S, making z integral over S, contrary to its integral closedness and z∉S. Thus take the least-coded h∈m with zh∉m. Then zh∈S∖m is a unit by [F7], and for every t∈m, t/h=(zt)/(zh)∈S. Hence m=hS. In either case m=(π) for a nonzero nonunit π, chosen by the least codes just specified.

5.1F7step 2.1step 4.1algebra

Every nonzero s∈S has a unique expression s=uπk with u outside m and k≥0. Divide by π whenever the current element lies in m; the quotient is unique because S is a domain. If division never stopped, the resulting principal ideals would form a strictly ascending chain: equality at a step would make π a unit. Step 2.1 rules out such a chain, so division stops at a unit. Uniqueness follows by cancellation: if two exponents differ, a unit would be a multiple of π, which lies in m. The recursive divisions are unique, not choices from families.

6.1step 2.1step 5.1algebra

The ideal aS is nonzero and finitely generated by step 2.1. Write each nonzero generator in the form of step 5.1 and take the least of the finitely many exponents, say ep. Among the finite listed generators attaining that exponent take the least-coded one; it yields πep∈aS after multiplying by a unit inverse; every generator is divisible by that power. Thus aS=(πep)=mep. Since a⊆p, this ideal is proper and ep>0. If e<f and (πe)=(πf), cancellation of the nonzero πe would make 1 a multiple of π, impossible because π∈m. Thus the exponent is unique.

7.1step 5.1step 6.1algebra

For every r≥0, multiplication by πr induces a surjection S/m→mr/mr+1; its kernel is exactly m, since cancellation of the nonzero πr shows cπr∈πr+1S exactly when c∈πS. Thus each layer is one-dimensional over the residue field. Also the maximal ideal of S/aS has nilpotency index exactly ep: its ep-th power vanishes, while its preceding power does not, because the powers of m are strictly distinct as shown in step 6.1. These local quotient facts support the norm and Dedekind--Kummer uses of the local calculation.

7.2F7step 2.2step 6.1construct

In the canonical finite order of step 2.2 define b=∏p⊇apep. This product is nonzero: choose a least-coded nonzero element in each of its finitely many prime factors and multiply them in the domain R. At Rp for a listed prime, every other listed prime becomes the unit ideal (distinct maximal ideals are incomparable), so [step 6.1] gives bRp=aRp. At any maximal ideal q not on the list, a⊈q; take the least-coded element of a∖q, which becomes a unit. Each listed prime is distinct from q, so take its least-coded element outside q; every factor becomes the unit ideal. Thus the same local equality holds there.

8.1F3F4F8step 7.2algebra

If x∈b∖a, its class in the finite ring R/a is nonzero, so its annihilator is proper. The finite, nonempty set of proper ideals containing this annihilator includes the annihilator itself. Take the least bit-mask code among its members of greatest finite cardinality; it is inclusion-maximal among proper ideals, hence a maximal ideal of R/a. By [F4], its inverse image is a maximal ideal q of R containing a. The local equality in step 7.2 puts x/1 in aRq by [F8], so take the least-coded s∉q with sx∈a. This puts the class of s in the annihilator, a contradiction. Hence b⊆a. For the reverse inclusion, b≠0 by step 7.2, so [F3] makes R/b finite; for a hypothetical x∈a∖b, its nonzero class has a proper annihilator in R/b. The nonempty finite set of proper ideals containing that annihilator includes the annihilator itself. Take the least-bit-mask member of greatest cardinality, using the same quotient coding from step 2.2; it is maximal, and by [F4] its inverse image is a maximal ideal q of R. The local equality puts x/1 in bRq by [F8], so take the least-coded s∉q with sx∈b. Then s lies in the annihilator, a contradiction. Thus a⊆b and a=b.

9.1step 2.2step 6.1step 7.2step 8.1discharge-construct∎

Suppose a second finite factorisation into distinct nonzero prime ideals is given. Each factor contains a, so every such prime is maximal by step 2.2. Localizing at any maximal ideal p, all distinct prime factors become units; the product is proper exactly when p occurs, and then its local exponent is the unique exponent of the power of pRp. The local equality with a therefore forces exactly the same primes and exponents as in step 6.1. The prime list was sorted by least codes, the exponents are unique, and the finite auxiliary choices above were also least-coded. Thus the factorisation is unique and uses no Choice.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The norm of a principal integral ideal

Statement

For 0≠α∈OK, N((α))=∣NK/Q(α)∣.

Proof

Given: 0≠α∈OK and an integral basis.

1.1givenalgebra

Multiplication by α is an injective integer matrix on the integral lattice, and its image is (α).

2.1step 1.1algebra∎

The index of the image of an injective integer matrix is the absolute determinant; that determinant is the field norm. Hence the quotient cardinality has the asserted value.

TheoremStatement: Literature-sourcedProof: AI-generatedaudited 2026-09-07Open item page →

Ideal norm is multiplicative

Statement

For nonzero integral ideals a,b of OK, N(ab)=Na Nb.

Proof

Given: nonzero integral ideals a,b.

1.1givenalgebra

Factor both ideals over their finite union of prime supports. The DVR calculation in the factorisation proof makes pr/pr+1 one-dimensional over OK/p, so every successive quotient has cardinality Np.

2.1step 1.1algebra∎

Hence N(pr+s)=N(pr)N(ps) at every prime; multiply over the finite support to obtain the claim.

CorollaryStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The norm of a prime ideal

Statement

For a nonzero prime P⊆OK, there is a rational prime p and an integer f≥1 with P∩Z=(p) and NP=pf.

Proof

Given: a nonzero prime ideal P.

1.1givenalgebra

The finite domain OK/P is a finite field; its characteristic is a rational prime p and its kernel on Z is (p).

2.1step 1.1algebra∎

As a finite-dimensional vector space over Fp, that field has pf elements for some f≥1, which is exactly NP.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Primes above and residue degree

Definition

For finite L/K, a nonzero prime P⊆OL lies above p when P∩OK=p. Its residue degree is f(P/p)=[OL/P:OK/p].

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-07Open item page →

Ramification index

Definition

Let L/K be a finite extension of number fields and let p be a nonzero prime of OK. In the factorisation pOL=∏P∣pPe(P/p), the positive exponent e(P/p) is the ramification index of P over p.

Here P∣p means contraction to p, as in Primes above and residue degree. The factorisation exists and its exponents are unique by Integral ideal factorisation in a number field, in ZF. For completeness, the extended ideal is proper: a finite integral basis of OL over Z also generates it over OK (The ring of integers has rank the degree). If pOL=OL, these generators satisfy v=Av with all entries of A in p. The adjugate identity makes det⁡(I−A) annihilate OL, hence 1; this contradicts det⁡(I−A)≡1(modp). Every prime factor contains pOL, so its contraction contains p and equals it by maximality. Conversely, a prime above p contains that finite product, hence contains one of its prime factors and equals it. Here nonzero primes are maximal because their quotient rings are finite domains. Thus the displayed product indexes exactly the primes above p, using only finite algebra.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The fundamental identity for primes

Statement

For finite L/K and nonzero p⊆OK, ∑P∣pe(P/p)f(P/p)=[L:K].

Proof

Given: the finite factorisation of pOL.

1.1givenalgebra

Localise OL at p. It is a finite torsion-free module over the DVR (OK)p, hence free of rank [L:K]. Filtering its reduction modulo p by the finite prime-power factors, the e(P/p) layers at P are copies of its residue field.

2.1step 1.1algebra∎

Taking dimensions over OK/p gives the left side, while the free rank in step 1.1 gives [L:K] for the same quotient.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Splitting and ramification terminology

Definition

A prime p is unramified in L if every e(P/p)=1, and ramified otherwise. It splits completely if it is unramified and every residue degree is 1; it is inert if there is one prime above it and its residue degree is [L:K].

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Ramification and residue degrees in towers

Statement

For M/L/K and Q∣P∣p, e(Q/p)=e(Q/P)e(P/p),f(Q/p)=f(Q/P)f(P/p).

Proof

Given: the indicated tower and primes.

1.1givenalgebra

Substitute the prime factorisation of pOL into its extension to OM and compare the exponent of Q.

2.1step 1.1algebra∎

The three residue fields form a finite tower, so the dimensions multiply. These are exactly the two asserted equalities.

TheoremStatement: Literature-sourcedProof: AI-generatedaudited 2026-09-07Open item page →

Dedekind--Kummer prime factorisation

Statement

Let L/K be a finite extension of number fields, let α∈OL with OL=OK[α], and let F∈OK[X] be its monic minimal polynomial over K. Let p be a nonzero prime ideal of OK, not dividing the index of this power order (the index is 1 under the stated monogeneity hypothesis). If Fˉ=∏igˉiei with distinct monic irreducibles over OK/p, then pOL=∏iPiei,Pi=(p,gi(α)),f(Pi/p)=deg⁡gˉi, Here gi∈OK[X] are any monic lifts of gˉi, and the last f denotes the residue degree from Primes above and residue degree.

Proof

Given: monogeneity, the index hypothesis, and the displayed factorisation.

1.1givenalgebra

Put A=OK, B=OL and k=A/p. Monic division by F shows that the kernel of A[X]→B, X↦α, is (F): a remainder of degree less than deg⁡F vanishing at α is zero by minimality over K. Monogeneity gives surjectivity, hence B/pB≃k[X]/(Fˉ).

2.1step 1.1algebra

The maximal ideals of this quotient are exactly those generated by the gˉi; their inverse images in B are Pi=(p,gi(α)). They are independent of the chosen lifts. Their residue fields are k[X]/(gˉi), of degree deg⁡gˉi, and their contractions are p. Thus they are exactly the primes above p.

3.1step 1.1step 2.1algebra∎

The local factorisation theorem Integral ideal factorisation in a number field, in ZF writes pB=∏iPiai. In the DVR BPi used in that theorem's proof, the maximal ideal of BPi/pBPi has nilpotency index exactly ai. On the polynomial side of step 1.1, localisation at (gˉi) gives k[X](gˉi)/(gˉiei), whose maximal ideal has nilpotency index exactly ei: its ei-th power vanishes and its (ei−1)-st power does not. Thus ai=ei, proving the ideal factorisation and the stated ramification and residue degrees.

CorollaryStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

An Eisenstein prime is totally ramified

Statement

If L=K(α) is generated by a monic Eisenstein polynomial of degree n at p, then pOL=Pn for one prime P; thus it is totally ramified.

Proof

Given: the Eisenstein polynomial at p.

1.1givenalgebra

Let P∣p have ramification index e. Comparing the valuations of the terms in the Eisenstein equation forces nvP(α)=e; in particular e≤[L:K]≤n.

2.1step 1.1algebra∎

The inequalities in step 1.1 are therefore equalities, so vP(α)=1 and e=n. The resulting factorisation is pOL=(p,α)n; hence this is the unique prime factor and the prime is totally ramified.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-10-01Open item page →

Ramification is detected by the number-field discriminant

Statement

A rational prime p ramifies in K/Q if and only if p∣dK.

Facts & Assumptions

Given: A number field K/Q and a rational prime p.

[F1]

The ring of integers OK is a commutative ring and is a free Z-module of rank n=[K:Q]; any integral basis α1,…,αn is also a Q-basis of K (Number field, Ring of integers, Integral elements over a nonzero base ring form a subring, The ring of integers has rank the degree).

[F3]

For every finite field extension L/F, the field trace Tr⁡L/F(z) is the trace of the F-linear multiplication map mz:x↦zx; below this is applied to K/Q and to finite extensions of Fp (The norm NK/F and trace Tr⁡K/F of a finite field extension).

[F4]

For an integral basis, the discriminant dK is the determinant of its trace-pairing matrix, independent of the chosen integral basis (Discriminant of a basis and order).

[F5]

Every nonzero integral ideal of OK has a unique finite factorisation into powers of distinct nonzero prime ideals, constructed in ZF. For pOK=∏iPiei, the Pi are exactly the primes above (p), ei=e(Pi/p), and p is unramified exactly when every ei=1 (Integral ideal factorisation in a number field, in ZF, Primes above and residue degree, Ramification index, Splitting and ramification terminology).

[F7]

Pairwise comaximal ideals satisfy the Chinese remainder theorem (Chinese remainder theorem for pairwise comaximal ideals).

[F8]

If E/Fq is a finite extension of finite fields of degree f, then its Galois group is cyclic of order f, generated by the relative Frobenius σq(x)=xq (A finite extension of a finite field of order q is Galois with cyclic Galois group generated by x↦xq, The relative Frobenius x↦xq of an extension of finite fields).

[F9]

A finite family of distinct homomorphisms from a group into a field's multiplicative group is linearly independent over the field (Dedekind's linear independence theorem for distinct characters).

[F10]

A f-dimensional vector space over a field of q elements has qf elements; a nonzero degree-d polynomial over a field has at most d roots (A d-dimensional vector space over a field with q elements has exactly qd elements, A nonzero polynomial of degree n over an integral domain has at most n distinct roots).

[F11]
[F12]

In finite dimension, an independent set extends to a basis of any containing subspace without a choice principle; a bilinear form is nondegenerate exactly when its matrix is invertible, and a square matrix is invertible exactly when its determinant is a unit (If dim⁡FV=n and U is a linear subspace of V, then U is finite-dimensional, dim⁡FU≤n, and dim⁡FU=n if and only if U=V, The matrix, left and right radicals, rank, and nondegeneracy of a bilinear form on a finite-dimensional space, A positive-sized square matrix over a commutative ring is invertible if and only if its determinant is a unit).

[F13]

The field trace of every algebraic integer in a number field is an integer (Trace and norm of an algebraic integer).

Proof

technique · direct
1.1F1F2F5F11algebra

Fix an integral basis α1,…,αn as in [F1], and put A:=OK/pOK. The classes αˉ1,…,αˉn form an Fp-basis of A, since OK is free over Z with that basis. Thus dim⁡FpA=n≥1, so pOK is proper; it is nonzero because p≠0 in the characteristic zero field K. By [F5], write pOK=∏i=1rPiei with distinct nonzero prime ideals and positive exponents. The list is nonempty because pOK is proper. Define Tr⁡A(a):=tr⁡(ma) for the Fp-linear multiplication map on A, and TA(x,y):=Tr⁡A(xy); matrix-trace linearity makes TA a bilinear form.

1.2F6algebra

Each Pi is maximal. Indeed, [F6] makes OK/Pi finite, and [F6] also makes it an integral domain. For any nonzero class, multiplication by it is injective on this finite set, hence surjective, so the class has an inverse and the quotient is a field; [F6] then gives maximality. Therefore distinct Pi,Pj are comaximal. Choose u∈Pi and v∈Pj with u+v=1. In the expansion of (u+v)ei+ej−1, a term ukvei+ej−1−k lies in Piei if k≥ei, and otherwise its exponent of v is at least ej, so it lies in Pjej. The sum is 1; hence the powers Piei and Pjej are comaximal.

1.3F2F5F6F7algebra

Put Ai:=OK/Piei. Applying [F7] to the pairwise comaximal powers gives A≅∏i=1rAi. If ei=1, then Ai=OK/Pi is a finite field. Since Pi lies above (p), the map Z/pZ→Ai induced by inclusion of Z is injective: its kernel is (Pi∩Z)/(p)=0. Thus Ai/Fp is a finite field extension, of degree fi=f(Pi/p) by definition.

1.4F8F9algebra

We first prove that the trace pairing of every finite extension E/Fp of finite fields is nondegenerate, without passing to an algebraic closure. Let f=[E:Fp] and σ(x)=xp. By [F8], σ0,…,σf−1 are the distinct automorphisms of E over Fp. Fix an Fp-basis b1,…,bf and form the square matrix C=(σj(bk))0≤j<f, 1≤k≤f. If a row combination with coefficients cj∈E vanishes, then ∑jcjσj(bk)=0 for each basis vector. Each σj is Fp-linear, so ∑jcjσj(x)=0 for every x∈E, and in particular for every x∈E×. The restrictions σj∣E× are distinct group homomorphisms E×→E×; [F9] makes them E-linearly independent, so every cj=0. Hence C is invertible.

For z∈E, let Mz be the matrix of multiplication by z in this basis and let Dz be diagonal with entries σj(z). Since every entry of Mz lies in Fp, each σj fixes those entries, and applying σj to zbk=∑ℓ(Mz)ℓkbℓ gives CMz=DzC. Thus Mz=C−1DzC. By [F11] and the definition of field trace, Tr⁡E/Fp(z)=tr⁡(Mz)=∑j=0f−1σj(z)=∑j=0f−1zpj. The polynomial X+Xp+⋯+Xpf−1 is nonzero of degree pf−1. By [F10], ∣E∣=pf and this polynomial has at most pf−1 roots, so there is w∈E with Tr⁡E/Fp(w)≠0. For any x≠0, taking y=x−1w gives Tr⁡E/Fp(xy)≠0. This proves nondegeneracy of the trace pairing on E. The argument includes f=1 and p=2. [F3, F8, F9, F10, F11, algebra]

2.1F7step 1.3step 1.4algebra

If every ei=1, then [F7] identifies A with the product of the finite fields Ai from step 1.3. Multiplication by (xiyi)i on this product is block diagonal, so its trace is ∑iTr⁡Ai/Fp(xiyi). The form on A is therefore the orthogonal direct sum of the finite field trace pairings from step 1.4. Each is nondegenerate, so the product pairing is nondegenerate: for a nonzero vector, choose a nonzero component and pair it with a witness in that factor, taking zero in all other factors.

2.2F5step 1.3algebra

If some ei>1, then Piei⊊Pi. The containment is immediate; equality would contradict uniqueness in [F5], because the factorizations of Pi and Piei have exponents 1 and ei. Choose a∈Pi∖Piei. Its class in Ai is nonzero and nilpotent, since its ei-th power is zero. Through the product isomorphism in step 1.3, it gives a nonzero nilpotent η∈A. For any y∈A, u=ηy is nilpotent, so multiplication T=mu on the finite-dimensional Fp-space A is nilpotent.

To compute its trace without eigenvalues, let Tm=0 and set Vj=ker⁡(Tj) for 0≤j≤m, with V0=0 and Vm=A. Successively extend a basis of Vj−1 to a basis of Vj; these are finite-dimensional subspaces, so [F12] provides each extension without a choice principle. Order the resulting basis by these layers. Since T(Vj)⊆Vj−1, each new basis vector maps into the span of earlier vectors. The matrix of T is strictly triangular and has trace zero. Therefore tr⁡(mηy)=0 for every y∈A, so the nonzero η lies in the radical of the trace pairing on A. The pairing is degenerate. [F12, step 1.3, algebra]

3.1F5step 2.1step 2.2

Steps 2.1 and 2.2 show that the trace pairing on A is nondegenerate exactly when every ei=1. By [F5], this is exactly when p is unramified; equivalently, the pairing is degenerate exactly when p ramifies.

4.1F1F2F3F4F11F12F13step 1.1step 3.1algebra∎

For z∈OK, multiplication by z on OK has an integer matrix in the integral basis α1,…,αn. Viewed over Q, the same matrix represents multiplication by z on K, so [F3] makes its matrix trace Tr⁡K/Q(z). Reducing the integer matrix modulo p gives multiplication by zˉ on A; hence tr⁡Fp(mzˉ)=Tr⁡K/Q(z)(modp). Consequently the matrix of TA in the basis αˉ1,…,αˉn is the reduction modulo p of G=(Tr⁡K/Q(αiαj))i,j. Since each αiαj∈OK by [F1], [F13] makes every entry of G an integer, and [F4] gives det⁡G=dK. By [F12], the trace pairing TA is degenerate exactly when its matrix is not invertible, equivalently when det⁡G mod p=0; this is equivalent to p∣dK. Combining with step 3.1 proves that p ramifies exactly when p∣dK.

CorollaryStatement: Literature-sourcedProof: AI-generatedaudited 2026-09-07Open item page →

Only finitely many primes ramify

Statement

Only finitely many rational primes ramify in a number field.

Proof

Given: the discriminant criterion.

1.1given

The field discriminant is a fixed nonzero integer.

2.1step 1.1algebra∎

It has only finitely many prime divisors, and the criterion identifies these exactly with the ramified rational primes.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Trace duals and the codifferent

Definition

For a lattice A⊂K, set A∨={x∈K:Tr⁡K/Q(xA)⊆Z}. The codifferent is OK∨; the definition is intrinsic, not basis-dependent.

LemmaStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The codifferent is a fractional ideal

Statement

For every nonzero fractional ideal A of OK, A∨ is a fractional ideal and (cA)∨=c−1A∨ for c∈K×.

Proof

Given: a fractional ideal A and c∈K×.

1.1givenalgebra

In a Z-basis of the full lattice A, nondegeneracy of trace gives a dual basis, so A∨ is again a full lattice and is stable under OK.

2.1step 1.1algebra∎

The condition Tr⁡(xcA)⊆Z is equivalent to cx∈A∨, proving (cA)∨=c−1A∨ and the fractional-ideal claim.

DefinitionDefinition: Literature-sourcedProof: Not applicableaudited 2026-09-07Open item page →

The different of a number field

Definition

The different of K is DK=(OK∨)−1={x∈K:xOK∨⊆OK}. Here K is a number field and OK∨ is its nonzero fractional codifferent (The codifferent is a fractional ideal). To justify the inverse using Integral ideal factorisation in a number field, in ZF, let p be a nonzero prime and choose 0≠a∈p. Factor (a) into finitely many nonzero prime ideals. Since their product lies in p, one factor lies in p and equals it: nonzero primes of OK are maximal, as their quotients are finite domains. Thus (a)=pb for an integral ideal b, and p(a−1b)=OK. Factoring an arbitrary nonzero integral ideal now gives an inverse by taking the finite product of these prime inverses; clearing a denominator gives an inverse for every nonzero fractional ideal. All choices are finite. By Invertible fractional ideals this inverse is the displayed colon ideal. Also OK⊆OK∨, since traces of algebraic integers are integers. Multiplying this inclusion by (OK∨)−1 gives DK⊆OK, so the different is an integral ideal.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The different in the monogenic case

Statement

If OK=Z[α] and f is the monic minimal polynomial of α, then DK=(f′(α)).

Proof

Given: the power integral basis 1,α,…,αn−1.

1.1givenalgebra

Lagrange interpolation in the conjugates shows that the trace-dual lattice has Z-basis 1f′(α),αf′(α),…,αn−1f′(α).

2.1step 1.1algebra∎

Thus OK∨=f′(α)−1OK; taking its fractional-ideal inverse yields (f′(α)).

TheoremStatement: Literature-sourcedProof: AI-generatedaudited 2026-09-07Open item page →

The discriminant is the norm of the different

Statement

NDK=∣dK∣.

Proof

Given: an integral basis and its trace Gram matrix G.

1.1givenalgebra

The dual lattice is obtained from the original basis by the inverse matrix G−1, hence its index relative to OK has absolute determinant ∣det⁡G∣.

2.1step 1.1algebra∎

Since det⁡G=dK and the different is the inverse codifferent, its norm is that same positive index.

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The prime support of the different is ramification

Statement

A nonzero prime P of OK lying over the rational prime p divides DK if and only if e(P/p)>1, that is, if and only if P itself ramifies.

Facts & Assumptions

Given: P∣p and e=e(P/p).

[L1]

Theorem 4.13 in the cited source says that the exponent of P in the different is e−1 when p∤e, and is at least e when p∣e.

Proof

1.1givenalgebra

Put d=vP(DK). The prime P divides the different exactly when d>0.

2.1L1step 1.1cases∎

If e=1, then p∤e and [L1] gives d=e−1=0. If e>1, then [L1] gives either d=e−1>0 or d≥e>0, according as p∤e or p∣e. This proves the stated local equivalence.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Tame and wild ramification

Definition

For P∣p, ramification is tame if p∤e(P/p) and wild if p∣e(P/p).

TheoremStatement: Literature-sourcedProof: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Different exponents in tame and wild ramification

Statement

For P∣p, vP(DK)≥e(P/p)−1. Equality holds when ramification is tame; when it is wild, vP(DK)≥e(P/p).

Facts & Assumptions

[L1]

Lemma 4.12 and the proof of Theorem 4.13 in the cited source give the trace criterion for divisibility by powers of P and apply it to the filtration of OK/Pe.

Proof

Given: a prime P∣p and its ramification index e.

1.1L1givenalgebra

That trace criterion first gives vP(DK)≥e−1. For the next power, the successive quotients Pi/Pi+1 are all isomorphic to the residue field as modules, so the relevant trace is e Tr⁡OK/P / Fp.

2.1L1step 1.1cases∎

The trace of a finite separable field extension is not the zero map. Hence the display in step 1.1 vanishes identically exactly when p∣e. Thus p∤e gives exact exponent e−1, while p∣e gives exponent at least e, which are precisely the tame and wild cases.

CorollaryStatement: Literature-sourcedProof: AI-generatedaudited 2026-09-07Open item page →

Discriminant valuations from different exponents

Statement

For a rational prime p, vp(dK)=∑P∣pf(P/p)vP(DK).

Proof

Given: the prime-ideal factorisation of the different.

1.1givenalgebra

Factor DK into its finite prime powers and apply norm multiplicativity, using NP=pf(P/p) over p.

2.1step 1.1algebra∎

The norm-of-the-different identity makes the p-adic valuation of that product vp(dK), which is the displayed sum.

5 · Examples, counterexamples and false statements

None yet.

Sources