Generalized Euclidean algorithms (Q1805515): Difference between revisions

A set \(M\) of fractional ideals of an algebraic number field is said to be an euclidean system, if the equality \[ \bigcup_{c\in M} E_ c\cup m=K \] holds where \(m= \bigcap_{c\in M} c\neq \{0\}\) and \(E_ c\) denotes the set of all \(\alpha\in K\setminus c\) for which there exists an element \(\beta\) of \(c\) satisfying \(| N(\alpha- \beta)| <1\). In the case of a one-element set \(M\) this definition goes back to \textit{H. W. Lenstra jun.} [Astérisque 61, 121-131 (1979; Zbl 0401.12005)]. The author states that every euclidean system generates the class group of \(K\) and this class group is trivial if and only if the set \(H\) of all inverses of non-zero integral principal ideals of \(K\) forms an euclidean system. In this case already a finite subset of \(H\) is an euclidean system and under certain further assumptions one can effectively find such a subset. No proofs are given.