Dedekind Domains and Factorization - Examples and Constructions
Concrete computations in Dedekind domains illustrate the power and subtlety of ideal-theoretic factorization.
The ring is not a UFD since gives two distinct element factorizations.
At the ideal level, let and . Then:
Thus uniquely, reconciling the two element factorizations.
In where , consider factoring . The polynomial factors modulo 11 as
This reveals splits completely: where for each root .
To find generators for an ideal in , use the Hermite normal form algorithm. For instance, in , the ideal can be written in matrix form and reduced:
Working modulo the -basis , we find with norm . This is the prime ideal above 2.
Modern computational algebra systems (SageMath, Magma, Pari/GP) implement efficient algorithms for:
- Factoring ideals into prime ideals
- Computing ideal norms and generators
- Testing ideal membership
- Computing in quotient rings
These rely on Hermite normal forms and lattice reduction algorithms.
The Hasse-Minkowski theorem exemplifies how local information determines global solvability. A quadratic form over represents zero non-trivially if and only if it represents zero over and all .
For the form , checking local conditions:
- Over : clearly has solutions
- Over : verify using Hensel's lemma
- Over for : use quadratic reciprocity
All local conditions satisfied implies existence of rational solutions, which can be found as .
In , compute as ideals:
Since is irreducible (norm 13 is prime), is prime. The ideal factors. Using in , we have
This intersection has norm .
Constructing Dedekind domains beyond rings of integers includes:
- Coordinate rings of smooth affine curves over fields
- Valuation rings of discrete valuations
- Completions: (the -adic integers) is a Dedekind domain with unique maximal ideal