Ring of integers
Template:Short description Template:Sidebar with collapsible lists In mathematics, the ring of integers of an algebraic number field is the ring of all algebraic integers contained in .Template:Sfn An algebraic integer is a root of a monic polynomial with integer coefficients: .Template:Sfn This ring is often denoted by or . Since any integer belongs to and is an integral element of , the ring is always a subring of .
The ring of integers is the simplest possible ring of integers.Template:Efn Namely, where is the field of rational numbers.Template:Sfn And indeed, in algebraic number theory the elements of are often called the "rational integers" because of this.
The next simplest example is the ring of Gaussian integers , consisting of complex numbers whose real and imaginary parts are integers. It is the ring of integers in the number field of Gaussian rationals, consisting of complex numbers whose real and imaginary parts are rational numbers. Like the rational integers, is a Euclidean domain.
The ring of integers of an algebraic number field is the unique maximal order in the field. It is always a Dedekind domain.Template:Sfn
Properties
The ring of integers Template:Math is a finitely-generated Template:Math-module. Indeed, it is a free Template:Math-module, and thus has an integral basis, that is a basis Template:Math of the Template:Math-vector space Template:Mvar such that each element Template:Mvar in Template:Math can be uniquely represented as
with Template:Math.[1] The rank Template:Mvar of Template:Math as a free Template:Math-module is equal to the degree of Template:Mvar over Template:Math.
Examples
Computational tool
A useful tool for computing the integral closure of the ring of integers in an algebraic field Template:Math is the discriminant. If Template:Math is of degree Template:Math over Template:Math, and form a basis of Template:Math over Template:Math, set . Then, is a submodule of the Template:Nowrap spanned by .[2] pg. 33 In fact, if Template:Math is square-free, then forms an integral basis for .[2] pg. 35
Cyclotomic extensions
If Template:Mvar is a prime, Template:Math is a Template:Mvarth root of unity and Template:Math is the corresponding cyclotomic field, then an integral basis of Template:Math is given by Template:Math.Template:Sfn
Quadratic extensions
If is a square-free integer and is the corresponding quadratic field, then is a ring of quadratic integers and its integral basis is given by Template:Math if Template:Math and by Template:Math if Template:Math.Template:Sfn This can be found by computing the minimal polynomial of an arbitrary element where .
Multiplicative structure
In a ring of integers, every element has a factorization into irreducible elements, but the ring need not have the property of unique factorization: for example, in the ring of integers Template:Math, the element 6 has two essentially different factorizations into irreducibles:Template:Sfn[3]
A ring of integers is always a Dedekind domain, and so has unique factorization of ideals into prime ideals.Template:Sfn
The units of a ring of integers Template:Math is a finitely generated abelian group by Dirichlet's unit theorem. The torsion subgroup consists of the roots of unity of Template:Math. A set of torsion-free generators is called a set of fundamental units.Template:Sfn
Generalization
One defines the ring of integers of a non-archimedean local field Template:Math as the set of all elements of Template:Math with absolute value Template:Math; this is a ring because of the strong triangle inequality.Template:Sfn If Template:Math is the completion of an algebraic number field, its ring of integers is the completion of the latter's ring of integers. The ring of integers of an algebraic number field may be characterised as the elements which are integers in every non-archimedean completion.Template:Sfn
For example, the [[p-adic integer|Template:Mvar-adic integers]] Template:Math are the ring of integers of the [[p-adic number|Template:Mvar-adic numbers]] Template:Math.
See also
- Minimal polynomial (field theory)
- Integral closure – gives a technique for computing integral closures
Notes
Citations
References
- ↑ Cassels (1986) p. 193
- ↑ 2.0 2.1 Template:Cite web
- ↑ Template:Cite book