Exercise 28, § 1
Algebra, VI, p. 34
Let G be a lattice ordered group with positive elements P. Two elements x and y of P are said to be equivalent if any element coprime to one is also coprime to the other : the equivalence classes under this relation are called the threads of P ; let denote the thread containing x. a) Let and be threads ; let x, be elements of n and y, y, be elements of ; show that if every element coprime to x is also coprime to y, then every element coprime to is also coprime to . Define a relation in this way between a and b, written ; show that this is an ordering of the set F of threads. b) Show that F is a lattice under this ordering, and that
(use Cor. 3 of VI, p. 15). Show that F has a smallest element, namely the thread . c) Call two threads a, b coprime if . Show that if a and b are two threads , and if , then there exists a thread , coprime to a, such that . d) Call a thread m irreducible if it is a minimal element of the set of threads . Show that an irreducible thread is totally ordered (if a and b are two elements of , consider the threads containing a and and use b)). Show also that the union of , and is a totally ordered subgroup II() of G. e) Given a family of distinct irreducible threads of G, show that the subgroup H generated by the union of the is isomorphic to the direct sum of the groups H() (reduce to the case of a finite family, and argue by induction).
f) Show that in a product (resp. direct sum) of nonzero totally ordered groups, the elements of irreducible threads are those in which all the coordinates are zero except for one (which is positive). Deduce that an ordered group can be a product (resp. direct sum) of nonzero totally ordered groups in at most one way (in other words the factors are uniquely determined).
Solution
No solution has been written yet.