Namespaces
Variants
Actions

Difference between revisions of "Totally ordered group"

From Encyclopedia of Mathematics
Jump to: navigation, search
(Importing text file)
 
(TeX)
 
Line 1: Line 1:
An [[Algebraic system|algebraic system]] <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934901.png" /> that is a [[Group|group]] with respect to multiplication, a [[Totally ordered set|totally ordered set]] with respect to a binary order relation <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934902.png" /> and satisfies the following axiom: For any elements <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934903.png" />, from <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934904.png" /> it follows that <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934905.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934906.png" />.
+
{{TEX|done}}
 +
An [[Algebraic system|algebraic system]] $G$ that is a [[Group|group]] with respect to multiplication, a [[Totally ordered set|totally ordered set]] with respect to a binary order relation $\leq$ and satisfies the following axiom: For any elements $x,y,z\in G$, from $x\leq y$ it follows that $xz\leq yz$ and $zx\leq zy$.
  
The set of positive elements <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934907.png" /> of a totally ordered group <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934908.png" /> has the following properties: 1) <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t0934909.png" />; 2) <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t09349010.png" />; 3) <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t09349011.png" />; and 4) <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t09349012.png" />. Conversely, if in a group <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t09349013.png" /> there is a set <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t09349014.png" /> satisfying conditions 1)–4), then <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t09349015.png" /> can be made into a totally ordered group with <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/legacyimages/t/t093/t093490/t09349016.png" /> as set of positive elements.
+
The set of positive elements $P=\{x\in G\colon x\geq e\}$ of a totally ordered group $G$ has the following properties: 1) $PP\subseteq P$; 2) $P\cap P^{-1}=e$; 3) $g^{-1}Pg\subseteq P$; and 4) $P\cup P^{-1}=G$. Conversely, if in a group $G$ there is a set $P$ satisfying conditions 1)–4), then $G$ can be made into a totally ordered group with $P$ as set of positive elements.
  
 
There is a large number of criteria for a group to be orderable. Orderable groups are torsion-free groups with unique root extraction. The following groups are orderable: torsion-free Abelian groups, torsion-free nilpotent groups, free groups, and free solvable groups. Simple non-Hopfian totally ordered groups exist. The quotient group of an orderable group by its centre is orderable.
 
There is a large number of criteria for a group to be orderable. Orderable groups are torsion-free groups with unique root extraction. The following groups are orderable: torsion-free Abelian groups, torsion-free nilpotent groups, free groups, and free solvable groups. Simple non-Hopfian totally ordered groups exist. The quotient group of an orderable group by its centre is orderable.

Latest revision as of 19:18, 17 August 2014

An algebraic system $G$ that is a group with respect to multiplication, a totally ordered set with respect to a binary order relation $\leq$ and satisfies the following axiom: For any elements $x,y,z\in G$, from $x\leq y$ it follows that $xz\leq yz$ and $zx\leq zy$.

The set of positive elements $P=\{x\in G\colon x\geq e\}$ of a totally ordered group $G$ has the following properties: 1) $PP\subseteq P$; 2) $P\cap P^{-1}=e$; 3) $g^{-1}Pg\subseteq P$; and 4) $P\cup P^{-1}=G$. Conversely, if in a group $G$ there is a set $P$ satisfying conditions 1)–4), then $G$ can be made into a totally ordered group with $P$ as set of positive elements.

There is a large number of criteria for a group to be orderable. Orderable groups are torsion-free groups with unique root extraction. The following groups are orderable: torsion-free Abelian groups, torsion-free nilpotent groups, free groups, and free solvable groups. Simple non-Hopfian totally ordered groups exist. The quotient group of an orderable group by its centre is orderable.

The direct product, the complete direct product and the free product, and also the wreath product, of totally ordered groups can be totally ordered by extending the orders of the factors. A group that can be approximated by orderable groups is itself orderable. For orderable groups there is a local theorem (see Mal'tsev local theorems). A totally ordered group can be imbedded in the multiplicative group of a totally ordered skew-field and in a simple totally ordered group. The class of orderable groups is axiomatizable. A totally ordered group is a topological group with respect to the interval topology. A totally ordered group is called Archimedean if and only if it does not have non-trivial convex subgroups. Any Archimedean totally ordered group is isomorphic to a subgroup of the additive group of real numbers with the natural order. The set of all convex subgroups of a totally ordered group forms a complete infra-invariant system with Archimedean factors, and so totally ordered groups have solvable normal systems (see Subgroup system).

Specific for the theory of totally ordered groups are questions connected with the extension of partial orders (see Pre-orderable group). There is a number of generalizations of the concept of a totally ordered group.

References

[1] A.I. Kokorin, V.M. Kopytov, "Fully ordered groups" , Israel Program Sci. Transl. (1974) (Translated from Russian)
[2] L. Fuchs, "Partially ordered algebraic systems" , Pergamon (1963)
[3] N. Bourbaki, "Algèbre" , Eléments de mathématiques , Masson (1981) pp. Chapts. IV-VI


Comments

References

[a1] M. Anderson, T. Feil, "Lattice-ordered groups. An introduction" , Reidel (1988) pp. 35; 38ff
How to Cite This Entry:
Totally ordered group. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Totally_ordered_group&oldid=13813
This article was adapted from an original article by A.I. KokorinV.M. Kopytov (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article