Partially ordered group

Revision as of 12:40, 24 May 2025 by imported>OAbot (Open access bot: url-access updated in citation with #oabot.)
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Template:Short description Template:Redirect In abstract algebra, a partially ordered group is a group (G, +) equipped with a partial order "≤" that is translation-invariant; in other words, "≤" has the property that, for all a, b, and g in G, if ab then a + gb + g and g + ag + b.

An element x of G is called positive if 0 ≤ x. The set of elements 0 ≤ x is often denoted with G+, and is called the positive cone of G.

By translation invariance, we have ab if and only if 0 ≤ -a + b. So we can reduce the partial order to a monadic property: Template:Nobreak if and only if Template:Nobreak

For the general group G, the existence of a positive cone specifies an order on G. A group G is a partially orderable group if and only if there exists a subset H (which is G+) of G such that:

  • 0 ∈ H
  • if aH and bH then a + bH
  • if aH then -x + a + xH for each x of G
  • if aH and -aH then a = 0

A partially ordered group G with positive cone G+ is said to be unperforated if n · gG+ for some positive integer n implies gG+. Being unperforated means there is no "gap" in the positive cone G+.

If the order on the group is a linear order, then it is said to be a linearly ordered group. If the order on the group is a lattice order, i.e. any two elements have a least upper bound, then it is a lattice-ordered group (shortly l-group, though usually typeset with a script l: ℓ-group).

A Riesz group is an unperforated partially ordered group with a property slightly weaker than being a lattice-ordered group. Namely, a Riesz group satisfies the Riesz interpolation property: if x1, x2, y1, y2 are elements of G and xiyj, then there exists zG such that xizyj.

If G and H are two partially ordered groups, a map from G to H is a morphism of partially ordered groups if it is both a group homomorphism and a monotonic function. The partially ordered groups, together with this notion of morphism, form a category.

Partially ordered groups are used in the definition of valuations of fields.

ExamplesEdit

  • The integers with their usual order
  • An ordered vector space is a partially ordered group
  • A Riesz space is a lattice-ordered group
  • A typical example of a partially ordered group is Zn, where the group operation is componentwise addition, and we write (a1,...,an) ≤ (b1,...,bn) if and only if aibi (in the usual order of integers) for all i = 1,..., n.
  • More generally, if G is a partially ordered group and X is some set, then the set of all functions from X to G is again a partially ordered group: all operations are performed componentwise. Furthermore, every subgroup of G is a partially ordered group: it inherits the order from G.
  • If A is an approximately finite-dimensional C*-algebra, or more generally, if A is a stably finite unital C*-algebra, then K0(A) is a partially ordered abelian group. (Elliott, 1976)

PropertiesEdit

ArchimedeanEdit

The Archimedean property of the real numbers can be generalized to partially ordered groups.

Property: A partially ordered group <math>G</math> is called Archimedean when for any <math>a, b \in G</math>, if <math>e \le a \le b</math> and <math>a^n \le b</math> for all <math>n \ge 1</math> then <math>a=e</math>. Equivalently, when <math>a \neq e</math>, then for any <math>b \in G</math>, there is some <math>n\in \mathbb{Z}</math> such that <math>b < a^n</math>.

Integrally closedEdit

A partially ordered group G is called integrally closed if for all elements a and b of G, if anb for all natural n then a ≤ 1.<ref name=Glass>Template:Harvtxt </ref>

This property is somewhat stronger than the fact that a partially ordered group is Archimedean, though for a lattice-ordered group to be integrally closed and to be Archimedean is equivalent.<ref>Template:Harvtxt</ref> There is a theorem that every integrally closed directed group is already abelian. This has to do with the fact that a directed group is embeddable into a complete lattice-ordered group if and only if it is integrally closed.<ref name=Glass/>

See alsoEdit

NoteEdit

Template:Reflist

ReferencesEdit

  • M. Anderson and T. Feil, Lattice Ordered Groups: an Introduction, D. Reidel, 1988.
  • Template:Cite journal
  • M. R. Darnel, The Theory of Lattice-Ordered Groups, Lecture Notes in Pure and Applied Mathematics 187, Marcel Dekker, 1995.
  • L. Fuchs, Partially Ordered Algebraic Systems, Pergamon Press, 1963.
  • Template:Cite book
  • Template:Cite book
  • V. M. Kopytov and A. I. Kokorin (trans. by D. Louvish), Fully Ordered Groups, Halsted Press (John Wiley & Sons), 1974.
  • V. M. Kopytov and N. Ya. Medvedev, Right-ordered groups, Siberian School of Algebra and Logic, Consultants Bureau, 1996.
  • Template:Cite book
  • R. B. Mura and A. Rhemtulla, Orderable groups, Lecture Notes in Pure and Applied Mathematics 27, Marcel Dekker, 1977.
  • Template:Cite book, chap. 9.
  • Template:Cite journal

Further readingEdit

Template:Cite journal

External linksEdit

| This article incorporates material from the following PlanetMath articles, which are licensed under the Creative Commons Attribution/Share-Alike License: {{#if: PartiallyOrderedGroup | partially ordered group | {{#if: | partially ordered group | [{{{sourceurl}}} partially ordered group] }} }}, {{#if: | {{{title2}}} | {{#if: | {{{title2}}} | [{{{sourceurl2}}} {{{title2}}}] }} }}{{#if: | , {{#if: | {{{title3}}} | {{#if: | {{{title3}}} | [{{{sourceurl3}}} {{{title3}}}] }} }} }}{{#if: | , {{#if: | {{{title4}}} | {{#if: | {{{title4}}} | [{{{sourceurl4}}} {{{title4}}}] }} }} }}{{#if: | , {{#if: | {{{title5}}} | {{#if: | {{{title5}}} | [{{{sourceurl5}}} {{{title5}}}] }} }} }}{{#if: | , {{#if: | {{{title6}}} | {{#if: | {{{title6}}} | [{{{sourceurl6}}} {{{title6}}}] }} }} }}{{#if: | , {{#if: | {{{title7}}} | {{#if: | {{{title7}}} | [{{{sourceurl7}}} {{{title7}}}] }} }} }}{{#if: | , {{#if: | {{{title8}}} | {{#if: | {{{title8}}} | [{{{sourceurl8}}} {{{title8}}}] }} }} }}{{#if: | , {{#if: | {{{title9}}} | {{#if: | {{{title9}}} | [{{{sourceurl9}}} {{{title9}}}] }} }} }}. | This article incorporates material from {{#if: PartiallyOrderedGroup | partially ordered group | partially ordered group}} on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License. }}