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.
Number Fields Rings of Integers and Discriminants
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Chain Conditions, Semisimple Modules and the Wedderburn–Artin Theorem
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Dedekind Domains and Ideal Classes
- Determinants of Matrices over a Commutative Ring
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Free Modules, Exact Sequences, Projective and Injective Modules
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Integral Extensions and Going Up
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Modules over a Principal Ideal Domain and the Canonical Forms
- Modules, Submodules, Quotient Modules and the Isomorphism Theorems
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Prime Spectra and Radicals
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Simple Field Extensions and the Construction of the Complex Numbers
- Solvability by Radicals and Kummer Theory
- Splitting Fields
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tensor Products of Modules
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Field of Fractions and Localisation
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The ZFC Axioms and the Basic Set Constructions
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
For a finite extension , this page separates its maximal order from arbitrary full-rank orders. Discriminants are first attached to ordered bases; the change-of-basis formula then makes the order and field invariants well defined. The embedding determinant always uses all embeddings.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Number field
Definition
A number field is a finite extension ; write .
Ring of integers
Definition
For a number field , its ring of integers is , the integral closure of in . It is not an arbitrary order.
Minimal-polynomial criterion for algebraic integers
Statement
For , if and only if its monic minimal polynomial over lies in .
Facts & Assumptions
Given: .
Integrality means satisfying a monic polynomial over the base ring (Integral ring maps and integral extensions).
Proof
If the minimal polynomial is monic over , [F1] gives .
Conversely, a monic integral polynomial annihilating is divisible by its monic minimal polynomial; Gauss's lemma makes the latter integral.
Clearing denominators for an algebraic number
Statement
For every , some positive integer satisfies ; hence .
Facts & Assumptions
Given: .
Proof
Write the monic minimal polynomial of as and choose a positive common denominator of the . Multiplying the equation for by shows that satisfies a monic polynomial in .
Thus , and lies in its fraction field; the reverse inclusion is contained in .
Trace and norm of an algebraic integer
Statement
If , then and belong to .
Facts & Assumptions
Given: .
Trace and norm are the trace and determinant of multiplication (The norm and trace of a finite field extension).
The monic minimal polynomial of an algebraic integer has coefficients in (Minimal-polynomial criterion for algebraic integers).
Proof
Let be the minimal polynomial of over . Fact [F2] gives .
Put . Regarding as a -vector space, multiplication by acts as the scalar on each of basis directions. Hence its characteristic polynomial over is . By [F1], which are integers.
Order in a number field
Definition
An order in is a unital subring whose additive group is free of rank .
Integral and power integral bases
Definition
Let be an order in a number field of degree . An integral basis of is an ordered -basis of . A power integral basis of is an integral basis of the form ; equivalently, . In the special case , this says , and then is called monogenic. A power integral basis is extra structure, not an assumption on an arbitrary order or number field.
The ring of integers has rank the degree
Statement
is a free -module of rank .
Facts & Assumptions
Given: A number field .
By definition, is a finite extension of degree (Number field).
The trace of is the matrix trace of multiplication by on the finite-dimensional -space (The norm and trace of a finite field extension).
Every element of has a positive integer multiple in (Clearing denominators for an algebraic number).
The trace of an algebraic integer in a number field is an integer (Trace and norm of an algebraic integer).
The integral elements over a nonzero base ring form a subring (Integral elements over a nonzero base ring form a subring).
Every additive subgroup of is for a unique , with the least positive member when the subgroup is nonzero (Every subgroup of is for exactly one natural number ).
A square matrix over a field is invertible exactly when its kernel is zero, and then each right-hand side has a unique solution (Invertible matrix theorem: invertibility, full pivot rank, RREF , trivial nullspace and unique solvability are equivalent).
Proof
Put and choose a -basis of . By [F1], is an -dimensional -vector space.
We prove by induction on that every additive subgroup has a finite -basis. For , the zero subgroup has the empty basis. Now let and assume the assertion for . Project to its first coordinate. By [F6], the image is either or for some positive integer .
Define . Multiplication in gives for , and matrix trace is linear; the same holds in the second variable since is commutative. Thus is a bilinear form.
For each , [F3] gives a positive integer such that . These elements remain a -basis. Set . By [F5], .
If the image is zero, identifies with a subgroup of and has a finite basis by induction. If the image is , its kernel identifies with a subgroup of and has a finite basis by induction. Choose one whose first coordinate is .
If , take . Then , because multiplication by is the identity on the -dimensional space . As in , this proves that the radical of is zero.
In the nonzero-image case of step 2.3, every has first coordinate for some , so ; hence span . If , its first coordinate gives , hence , and the independence of the basis of then gives every . Thus this spanning list is a basis. The induction uses only one lift for each fixed subgroup at this finite stage, not a choice of lifts for a family.
Let . If for , put . Then for every , and bilinearity makes for every , since the form a -basis. By step 3.1, , so . Thus has zero kernel and [F7] makes it invertible.
For each , solve over , where is the th standard coordinate vector, and put . By [F7], these solutions exist uniquely and satisfy for every .
The coordinates of the finitely many in the basis are rational. Choose a positive integer clearing all their denominators. Then for every .
If , the trace-dual equations give . The product is integral by [F5], so [F4] makes this trace an integer. Thus every , proving .
Since is a -basis of , the inclusion in step 7.1 identifies with an additive subgroup of . By the induction, it has a finite -basis .
The span over : their integral span contains , which spans . Their -independence implies -independence after clearing denominators. Thus they are a -basis and . This proves the claim.
Orders have integral bases and finite index
Statement
Every order has an integral basis and finite additive index in .
Facts & Assumptions
Given: An order .
is free of rank (The ring of integers has rank the degree).
Full-rank PID submodules admit simultaneous bases (Simultaneous bases for a submodule of a finite free module over a PID).
Proof
The order has full rank by definition, so [F1] makes it a rank- submodule of a free rank- group.
Apply [F2]: the quotient is a finite direct sum of , and the resulting basis of is integral.
Archimedean embeddings and signature
Definition
Let be a number field. Let be the number of field embeddings that fix , and let be the number of complex-conjugate pairs among the nonreal field embeddings that fix . The signature of is , with . Embedding determinants use all of these real and nonreal embeddings.
Discriminant of a basis and order
Definition
For an ordered -basis , set For an order , define to be the discriminant of any integral basis of . This is independent of the integral basis: the change matrix between two -bases is unimodular, and Change of basis for discriminants ↗ multiplies the discriminant by the square of its determinant, which is . Finally, ; the existence of an integral basis of is supplied by The ring of integers has rank the degree.
Change of basis for discriminants
Statement
If , then .
Facts & Assumptions
Given: Two ordered bases related by .
Proof
Bilinearity of trace gives for the trace Gram matrices.
Taking determinants gives the asserted square factor.
Embedding determinant formula
Statement
Let be the distinct embeddings . For every ordered -basis of , and the determinant is nonzero.
Facts & Assumptions
Given: An ordered basis of the number field.
In a separable extension, trace is the sum over the embeddings (Norm and trace from embeddings, with the inseparable exponent in the norm formula).
Distinct field embeddings are linearly independent as characters (Dedekind's linear independence theorem for distinct characters).
Proof
With , [F1] gives for the trace Gram matrix.
If were singular, a nonzero linear combination of its rows would vanish on the basis and hence on every element of , contradicting [F2]. Thus .
Taking determinants in step 1.1 gives , and step 1.2 gives the asserted nonvanishing.
Number-field discriminant is well-defined and nonzero
Statement
Integral bases give the same nonzero signed integer .
Facts & Assumptions
Given: Two integral bases of .
Change of basis squares its determinant (Change of basis for discriminants).
The embedding determinant formula holds (Embedding determinant formula).
Proof
The integral change matrix is unimodular, so [F1] gives basis independence; integral traces make the value integral.
Distinct embeddings make the matrix in [F2] invertible, so its square is nonzero.
Power-basis and polynomial discriminants
Statement
Let . If is the degree- monic minimal polynomial of , then
Facts & Assumptions
Given: and .
The basis discriminant is the square of its embedding determinant (Embedding determinant formula).
Proof
Fact [F1] makes the determinant the Vandermonde product of the conjugates of .
Squaring it and regrouping the root differences is the polynomial discriminant, equivalently the displayed derivative norm.
Order-index discriminant formula
Statement
For an order , .
Facts & Assumptions
Given: An order .
Simultaneous bases exist with finite index (Orders have integral bases and finite index).
Discriminants change by a determinant square (Change of basis for discriminants).
Proof
Choose the bases from [F1]; the absolute change determinant is the index.
Apply [F2] and square the determinant.
Squarefree power discriminant criterion
Statement
If integral generates and its power-basis discriminant is squarefree, then .
Facts & Assumptions
Given: The stated integral generator.
The index-discriminant formula holds (Order-index discriminant formula).
Proof
The power order is an order, and [F1] says its discriminant is the square of its index times .
A square index dividing a squarefree integer is , so the two orders coincide.
Integers in a quadratic field
Statement
For squarefree , if , and otherwise.
Facts & Assumptions
Given: Squarefree .
Integral elements have integral trace and norm (Trace and norm of an algebraic integer).
Proof
Write an integral element as in lowest terms. Fact [F1] forces .
These divisibilities force ; the case occurs exactly when , yielding the displayed bases.
Discriminant of a quadratic field
Statement
For squarefree , if , and otherwise.
Facts & Assumptions
Given: Squarefree .
The integral bases are known (Integers in a quadratic field).
Proof
In each basis of [F1], form the trace Gram matrix.
Its determinant is respectively and .
Rings of integers are Dedekind domains
Statement
Assume the Axiom of Choice. The ring of integers of every number field is a Dedekind domain.
Facts & Assumptions
Given: The Axiom of Choice and a number field .
The integers form a commutative ring with and no zero divisors, so they are an integral domain; the natural-number embedding into is injective and its image is the nonnegative integers (The integers form a commutative ring, The naturals embed in the integers, The integers have no zero divisors; multiplicative cancellation, Zero divisor, and integral domain: a commutative ring with and no zero divisors).
Every additive subgroup of is for a unique , with the generator positive when the subgroup is nonzero (Every subgroup of is for exactly one natural number ).
A rational number integral over is an integer (The rational algebraic integers are exactly the integers).
A number field is a finite extension of (Number field, The degree of a finite field extension).
Every field of characteristic zero is perfect (Fields of characteristic zero, finite fields, and algebraically closed fields are perfect).
Every algebraic extension of a perfect field is separable (Every algebraic extension of a perfect field is separable).
A Dedekind domain is a Noetherian integrally closed domain of Krull dimension (Dedekind domains).
Assuming the Axiom of Choice, the integral closure of a Dedekind domain in a finite separable extension of its fraction field is Dedekind (The Axiom of Choice, The integral closure of a Dedekind domain in a finite separable extension is Dedekind).
The ring of integers is the integral closure of in (Ring of integers).
The rationals are classes with and ; the canonical map is an injective ring map, is a field, and the fraction-field construction uses the localization relation for some nonzero (The rationals as equivalence classes of pairs of integers, The integers embed in the rationals, The rationals form a field, The field of fractions of an integral domain, Multiplicative subsets and the localisation as equivalence classes of fractions).
A module is Noetherian when all its submodules are finitely generated, and a ring is Noetherian when its left regular module is Noetherian (Noetherian modules: every submodule is finitely generated, Left and right Noetherian rings).
A domain is integrally closed when every element of its fraction field integral over it lies in the domain (Integral closure in an extension ring and integrally closed domains).
A prime ideal is proper and absorbs factors of products; means ; for , the Euclid property characterizes prime integers (Prime ideals and maximal ideals in a commutative ring, Divisibility in : when for some integer , For an integer : is prime if and only if, for all integers and , implies or ).
For a prime integer , is a field and is the quotient ring ; a quotient by an ideal is a field exactly when the ideal is maximal (For every prime , the two operations on make it a field, For every , the congruence-class ring is the quotient ring , is a field if and only if is a maximal ideal).
If and , then ; if , then (the integer-discreteness argument in the proof of If and then and ; hence the set of divisors of a nonzero integer is bounded above by ). For nonnegative , ; the integer order is antisymmetric and compatible with addition (If and then and ; hence the set of divisors of a nonzero integer is bounded above by , Absolute value in : ; exactly when ; ; ; ; and exactly when , The integers form a totally ordered ring, Order on the integers).
The natural embedding preserves order; the natural numerals satisfy , since , , and each successor is the immediate successor (The naturals embed in the integers, Discreteness: is the immediate successor, The natural numbers (von Neumann)).
By definition, an integer is prime exactly when and every positive divisor of is or (Prime and composite integers: is prime when and its only positive divisors are and ).
Every maximal ideal in a commutative ring is prime (Every maximal ideal of a commutative ring is prime).
Krull dimension is the supremum of the lengths of strict chains of prime ideals (Krull dimension of a nonzero ring).
Proof
By [F1], is a domain. A fraction equals in exactly when for some nonzero ; the domain property makes this equivalent to , the relation defining . The operations agree under , so this gives the canonical identification .
Let be an ideal of . It is an additive subgroup, so [F2] gives for some ; as a -module, is generated by that one element, including when . Every submodule of the left regular module is such an ideal. Therefore this module is Noetherian, and is a Noetherian ring by [F11].
The field has characteristic zero: for every positive integer , by the injectivity in [F10]. By [F5], is perfect.
Let be a nonzero prime ideal of . By [F2], for a positive integer ; since is proper, , so . If , then , and [F13] gives or , so or . The Euclid-property characterization therefore makes a prime integer.
If is integral over , step 1.1 identifies it with a rational number, and [F3] gives . Hence is integrally closed by [F12].
Put , which is finite and at least by [F4] and because is a field extension of . For each , the vectors in the -dimensional -vector space are linearly dependent, so a nonzero polynomial over vanishes at . Thus is algebraic; [F6] and step 1.3 make it separable.
For the prime from step 1.4, [F14] makes a field and identifies it with the quotient ring . The quotient criterion in [F14] then makes every nonzero prime ideal of maximal.
First, [F16] gives , so . If is any positive divisor of , [F15] gives . If , then ; translation compatibility of the order gives , and integer discreteness in [F15] gives . Hence , so antisymmetry and give . Thus the only positive divisors of are and , and [F17] proves that is prime. Now [F14] makes maximal, and [F18] makes it prime. Since is a domain, is prime; and by [F16], so . Every prime chain with positive length starts at and has length at most , because each nonzero prime is maximal by step 2.3. Thus [F19] gives .
Steps 1.1, 1.2, 2.1, and 3.1 show that is a Noetherian integrally closed domain of dimension . Hence [F7] makes a Dedekind domain.
By [F9], is the integral closure of in . Apply [F8] with , fraction field from step 1.1, and finite separable extension from step 2.2. Under the given Axiom of Choice, this proves that is Dedekind.
5 · Examples, counterexamples and false statements
None yet.
Sources
- Milne, Algebraic Number Theory, Chapter 2
- Milne, Definition 2.5
- Milne, Proposition 2.11
- Milne, Proposition 2.6
- Milne, Corollary 2.21
- Stein, Definition 2.3.17
- Milne, Bases section
- Milne, Proposition 2.29
- Stein, section 6.1
- Milne, Discriminants section
- Milne, Lemma 2.23
- Milne, Proposition 2.26
- Milne, Proposition 2.27
- Milne, Remark 2.28
- Milne, Remark 2.25
- Milne, Corollary 2.10
- Milne, Remark 2.12
- Milne, Theorem 3.1