Bourbaki

Exercise 21, § 1

Algebra, VI, p. 33

Bourbaki marks this one as harder than the rest.

An ordered group is called lattice orderable if it is isomorphic to a subgroup of a lattice ordered group. Show that it is necessary and sufficient for an ordered group to be lattice orderable that, for every integer n>0n > 0, the relation nx≥0nx \geq 0 imply x≥0x \geq 0 (to show that the condition is sufficient, use Ex. 20, b) and 19). Show that every lattice orderable group is isomorphic to a subgroup of a product of totally ordered groups.

Solution

No solution has been written yet.

Transcribed from the printed volume. Not translated.