Bourbaki

Remark

Tag 06WO, permanent. Cite it as [Bourbaki, Tag 06WO].

Algebra, chapter VI, § 1. Ordered groups. Divisibility

— By virtue of the condition P+P⊂PP + P \subset P, the relation x≥0x \geq 0 in an ordered group implies that nx≥0nx \geq 0 for every natural number nn. If in addition the positive element xx of GG has finite order nn, then −x=(n−1)x-x = (n-1)x is positive ; since

P∩(−P)={0}, P \cap (-P) = \{0\},

this implies that x=0x = 0. In particular, if every element of GG has finite order, then P={0}P = \{0\}; the relation x≤yx \leq y is then equivalent to x=yx = y (the discrete ordering).

Bourbaki puts the proof directly after the statement, so what is above is the statement and its proof together.

Cited by

Nothing.

Cites

Nothing.

Transcribed from the printed edition, 2003, Springer. Not translated.