KEVOS
ArticlesServicesCase studiesAboutContact
ArticlesServicesCase studiesAboutContact
← ArticlesOrders in Number FieldsEngineering · Engineering MathematicsLesson 785/884← PrevNext →
ArticlePublished 7 Aug 20262 min readBy Kevin Joginorderequation ordermaximal orderring of integers
On this page

Ask about this page

KEVOS AIOrders in Number Fields

KEVOS knowledge first · trusted web sources when needed

Orders, Ideals and Prime Decomposition

Orders in Number Fields

Orders as subrings that are full-rank lattices, the equation order, the maximal order, and the index that separates them.

Engineering / MathematicsOrders, Ideals and Prime Decomposition2 min readKV-MATH-0583

An order is a subring of a number field that is also a lattice of full rank. The maximal one is the ring of integers, and it is the only order in which ideal factorisation behaves properly.

Definition

Order
A subring containing one, finitely generated as a module, spanning the field over the rationals.
Equation order
The order generated by the powers of the defining polynomial's root. Immediate from the presentation and generally not maximal.
Maximal order
The ring of all algebraic integers in the field. Unique, and contains every other order.
Conductor
The largest ideal of the maximal order contained in a given order. Measures how far the order is from maximal.

Why maximality matters

Key point

Unique factorisation of ideals into prime ideals holds in the maximal order and fails in general orders. Every algorithm in the ideal and class group streams assumes maximality, and the failure in a non-maximal order is silent — products and factorisations still compute, they are simply wrong.

Maximal versus general orders
PropertyMaximal orderGeneral order
Unique ideal factorisationHoldsFails
Every non-zero ideal invertibleYesOnly those coprime to the conductor
Integrally closedYesNo
Class groupThe ideal class groupA ring class group; coarser

The index

An order sits inside the maximal order with finite index, and that index relates the two discriminants.

disc(order) = index^2 * disc(field)See discriminants and integral bases.

Key point

Because the index appears squared, only primes whose square divides the polynomial discriminant can divide the index. This is what makes maximal order computation tractable: the set of primes needing attention is small and identifiable.

Representation

An order is represented by a basis expressed relative to the power basis of the defining polynomial, in Hermite normal form with a common denominator. Multiplication tables are precomputed from the multiplication matrices of the basis elements.

Pitfall

A module that is not closed under multiplication is not an order. Closure must be verified when an order is constructed by enlargement, by checking that every pairwise product of basis elements lies in the module.

Computing the maximal order

The computation is the subject of the maximal order stream, via the Dedekind criterion and the Round 2 algorithm.

Source. Henri Cohen, A Course in Computational Algebraic Number Theory, Springer GTM 138 — 4.6.1. Structural reference unverified: the source file was not available during authoring; chapter and section numbers are taken from the published edition and have not been checked against a physical copy.

Related pages

  • Discriminants and Integral Bases
  • The Maximal Order Problem
  • The Round 2 Maximal Order Algorithm
  • Ideals of the Maximal Order

Continue learning

Field Isomorphism and the Normal ClosureArticle · Engineering MathematicsNEXT LESSON →Ideals of the Maximal OrderArticle · Engineering MathematicsThe Subfield ProblemArticle · Engineering MathematicsModule Representation by Hermite Normal FormArticle · Engineering Mathematics
KEVOS · Engineering, manufacturing and project improvement
ArticlesServicesCase studiesAboutContact
© 2026 KEVOS®