Partially-ordered group

Partially-ordered group

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 element if 0 ≤ x. The set of elements 0 ≤ x is often denoted with G+, and it is called the positive cone of G. So we have ab if and only if -a+bG+.

By the definition, we can reduce the partial order to a monadic property: ab if and only if 0-a+b.

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

  • 0H
  • 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 natural number 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.

A Riesz group is a 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.

Contents

Examples

  • 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.

References

  • M. Anderson and T. Feil, Lattice Ordered Groups: an Introduction, D. Reidel, 1988.
  • 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.
  • A. M. W. Glass, Ordered Permutation Groups, London Math. Soc. Lecture Notes Series 55, Cambridge U. Press, 1981.
  • 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.
  • V. M. Kopytov and N. Ya. Medvedev, The Theory of Lattice-Ordered Groups, Mathematics and its Applications 307, Kluwer Academic Publishers, 1994.
  • R. B. Mura and A. Rhemtulla, Orderable groups, Lecture Notes in Pure and Applied Mathematics 27, Marcel Dekker, 1977.
  • T.S. Blyth, Lattices and Ordered Algebraic Structures, Springer, 2005, ISBN 1-85233-905-5, chap. 9.

See also

  • Partially-ordered ring

External links


Wikimedia Foundation. 2010.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Ordered group — In abstract algebra, an ordered group is a group (G,+) equipped with a partial order ≤ which is translation invariant ; in other words, ≤ has the property that, for all a , b , and g in G , if a ≤ b then a+g ≤ b+g and g+a ≤ g+b . Note that… …   Wikipedia

  • Partially ordered set — The Hasse diagram of the set of all subsets of a three element set {x, y, z}, ordered by inclusion. In mathematics, especially order theory, a partially ordered set (or poset) formalizes and generalizes the intuitive concept of an ordering,… …   Wikipedia

  • Cyclically ordered group — In mathematics, a cyclically ordered group is a set with both a group structure and a cyclic order, such that left and right multiplication both preserve the cyclic order. Cyclically ordered groups were first studied in depth by Ladislav Rieger… …   Wikipedia

  • Profinite group — In mathematics, profinite groups are topological groups that are in a certain sense assembled from finite groups; they share many properties with their finite quotients. Definition Formally, a profinite group is a Hausdorff, compact, and totally… …   Wikipedia

  • Outline of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

  • Ordinal optimization — In mathematical optimization, ordinal optimization is the maximization of functions taking values in a partially ordered set ( poset ). Ordinal optimization has applications in the theory of queuing networks. Contents 1 Mathematical foundations 1 …   Wikipedia

  • List of algebraic structures — In universal algebra, a branch of pure mathematics, an algebraic structure is a variety or quasivariety. Abstract algebra is primarily the study of algebraic structures and their properties. Some axiomatic formal systems that are neither… …   Wikipedia

  • Cyclic order — In mathematics, a cyclic order is a way to arrange a set of objects in a circle.[nb] Unlike most structures in order theory, a cyclic order cannot be modeled as a binary relation a < b . One does not say that east is more clockwise than west.… …   Wikipedia

  • Galois connection — In mathematics, especially in order theory, a Galois connection is a particular correspondence between two partially ordered sets (posets). Galois connections generalize the correspondence between subgroups and subfields investigated in Galois… …   Wikipedia

  • Refinement monoid — In mathematics, a refinement monoid is a commutative monoid M such that for any elements a0, a1, b0, b1 of M such that a0+a1=b0+b1, there are elements c00, c01, c10, c11 of M such that a0=c00+c01, a1=c10+c11, b0=c00+c10, and b1=c01+c11. A… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”