congruence in algebraic number field
Definition. Let , and be integers (http://planetmath.org/AlgebraicInteger) of an algebraic number field![]()
and . One defines
| (1) |
if and only if , i.e. iff there is an integer of with
.
Theorem. The congruence![]()
“” modulo defined above is an equivalence relation
![]()
in the maximal order
of . There are only a finite amount of the equivalence classes
![]()
, the residue classes modulo .
Proof. For justifying the transitivity of “”, suppose (1) and ; then there are the integers and of such that ,
. Adding these equations we see that with the integer of . Accordingly, .
Let be an arbitrary integer of and a minimal basis of the field. Then we can write
where the ’s are rational integers. For , the division algorithm determines the rational integers and with
whence
So we have
| (2) |
where and are some integers of the field. If are the algebraic conjugates of , then
Hence, divides in the ring of integers of , and (2) implies
Since any number has different possible values , there exist different ordered tuplets . Therefore there exist at most different residues and residue classes in the ring.
| Title | congruence in algebraic number field |
|---|---|
| Canonical name | CongruenceInAlgebraicNumberField |
| Date of creation | 2013-03-22 18:17:11 |
| Last modified on | 2013-03-22 18:17:11 |
| Owner | pahio (2872) |
| Last modified by | pahio (2872) |
| Numerical id | 8 |
| Author | pahio (2872) |
| Entry type | Theorem |
| Classification | msc 13B22 |
| Synonym | congruence in number field |
| Related topic | CongruenceRelationOnAnAlgebraicSystem |
| Related topic | ChineseRemainderTheoremInTermsOfDivisorTheory |
| Related topic | Congruences |
| Defines | residue class |