Orders and Ideals in Number Fields

Executive summary

Elements lose unique factorisation; ideals recover it

In a general ring of integers, elements do not factor uniquely into irreducibles. Dedekind's resolution is to work with ideals instead: in the maximal order every non-zero ideal factors uniquely into prime ideals. Computationally an ideal is a full-rank ℤ-submodule, stored as a Hermite normal form against the integral basis, with the norm available on the diagonal. Multiplication is a module product followed by a re-reduction to HNF.

Learning objectives

Define an order and the maximal order, and distinguish them.
State the unique factorisation property of ideals in a Dedekind domain.
Represent an ideal by a Hermite normal form and by two elements.
Multiply, invert and test containment of ideals.
Explain the significance of the failure of unique factorisation for elements.

Section 01Orders

An order in K is a subring that is also a ℤ-module of full rank n. The ring of integers ℤ_K contains every order and is the unique maximal one. The equation order ℤ[θ] is the most obvious example and generally not maximal.

Non-maximal orders behave badly

Unique factorisation of ideals holds only in the maximal order. In a non-maximal order the ideals dividing the conductor are not invertible, factorisation fails, and results computed as though it held are wrong. Establishing maximality — or restricting attention to ideals coprime to the conductor — is a precondition, not a detail.

Non-maximal orders are nevertheless important: the theory of binary quadratic forms of non-fundamental discriminant is exactly the theory of ideals in a non-maximal quadratic order, and Shanks's class group methods operate there.

Section 02Ideals and unique factorisation

ℤ_K is a Dedekind domain: Noetherian, integrally closed, and of dimension one. The consequence that matters is

𝔼 = ∏_i 𝔽_i^e_i, unique up to order

Fractional ideals form a group under multiplication, with the inverse of 𝔼 given by {x ∈ K : x𝔼 ⊆ ℤ_K}. The class group measures how far this group is from consisting only of principal ideals.

ElementsUnique factorisation can fail

In ℤ[√−5], the number 6 factors as 2·3 and as (1+√−5)(1−√−5), with all four factors irreducible. The factorisations are genuinely different.

IdealsUnique factorisation always holds

The same example resolves: each of those elements generates a product of prime ideals, and the two element factorisations are two groupings of the same four prime ideals.

Section 03Representation and arithmetic

An ideal is a full-rank sublattice of ℤ_K, so it is stored as the Hermite normal form of its coordinate matrix against the integral basis.

Ideal operations
Operation	Method	Cost
Storage	n×n HNF matrix, often with a common denominator for fractional ideals	O(n²) integers
Norm	Product of the HNF diagonal entries	Free — already computed
Equality	Compare HNFs entry by entry	O(n²)
Membership	Solve against the HNF and require integer coordinates	O(n²)
Sum 𝔼 + 𝔽	HNF of the stacked generator matrices	One HNF
Product 𝔼𝔽	All n² pairwise products, then HNF	O(n³) plus an HNF — the expensive operation
Inverse	Via the different, or by solving a linear system	One HNF plus a solve

Two-element representation

Every ideal in a Dedekind domain is generated by two elements, one of which can be taken to be any non-zero rational integer in the ideal — usually its norm. Storing 𝔼 = (a, α) needs O(n) data rather than O(n²) and makes multiplication far cheaper, at the cost of a conversion whenever a canonical form is needed. Production systems keep both forms.

Section 04Ideal reduction

Repeated multiplication makes ideal coefficients grow. Reduction replaces an ideal by a small ideal in the same class: find a short element α in 𝔼 using LLL on the lattice of 𝔼 under the embedding, then take (α)𝔼⁻¹.

Why reduction makes class group computation possible

Without it, the ideals produced during relation collection grow until arithmetic becomes impossible. Reduction keeps every ideal bounded by roughly the square root of the discriminant, which is what makes sub-exponential class group algorithms practical.

ReferenceFrequently asked questions

Why is the two-element representation always possible?

It is a standard consequence of the Dedekind property together with the Chinese remainder theorem: choose an element whose valuation is exactly right at each prime dividing the norm, and it generates the ideal together with the norm.

How do I factor an ideal into primes?

Factor its norm as a rational integer, then for each rational prime p dividing the norm compute the primes above p and determine the valuation of the ideal at each. The factoring of the norm is the expensive step.

What breaks in a non-maximal order?

Ideals dividing the conductor are not invertible, so the fractional ideals no longer form a group and factorisation into primes fails. Algorithms designed for the maximal order will return confident, wrong answers if applied there.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Orders and Ideals in Number Fields. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Orders and Ideals in Number Fields as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—ideals, section, orders, number, order—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Orders and Ideals in Number Fields?