Loading [MathJax]/jax/output/CommonHTML/jax.js

Lattice-ordered groups

Abbreviation: LGrp

Definition

A \emph{lattice-ordered group} (or \emph{-group}) is a structure L=L,,,,1,e such that

L,, is a lattice

L,,1,e is a group

is order-preserving: xyuxvuyv

Remark: xy=xy, xyxy=x and xyxy=y

Definition

A \emph{lattice-ordered group} (or \emph{-group}) is a structure L=L,,,1,e such that

L, is a semilattice

L,,1,e is a group

is join-preserving: u(xy)v=uxvuyv

Remark: xy=(x1y1)1

Definition

A \emph{lattice-ordered group} (or \emph{-group}) is a residuated lattice L=L,,,,,/,e that satisfies the identity x(e/x)=e.

Remark: x1=e/x=xe, x/y=xy1 and xy=x1y

Morphisms

Let L and M be -groups. A morphism from L to M is a function f:LM that is a homomorphism: f(xy)=f(x)f(y), f(xy)=f(x)f(y), f(xy)=f(x)f(y), f(x1)=f(x)1, and f(e)=e.

Examples

Aut(C),max,min,,1,idC, the group of order-automorphisms of a Chains C, with max and min (applied pointwise), composition, inverse, and identity automorphism.

Basic results

The lattice reducts of lattice-ordered groups are distributive lattices.

Properties

Finite nontrivial members

None

Subclasses

Superclasses

References


1) W. Charles Holland, Stephen H. McCleary, \emph{Solvability of the word problem in free lattice-ordered groups}, Houston J. Math., \textbf{5} 1979, 99–105 MRreviewZMATH [http://www.chapman.edu/~jipsen/lgroups/lgroupDecisionProc.html implementation]
2) A. M. W. Glass, Yuri Gurevich, \emph{The word problem for lattice-ordered groups}, Trans. Amer. Math. Soc., \textbf{280} 1983, 127–138 MRreviewZMATH
3) Yuri Gurevic, \emph{Hereditary undecidability of a class of lattice-ordered Abelian groups}, Algebra i Logika Sem., \textbf{6}, 1967, 45–62
4) Stanley Burris, \emph{A simple proof of the hereditary undecidability of the theory of lattice-ordered abelian groups}, Algebra Universalis, \textbf{20}, 1985, 400–401, http://www.math.uwaterloo.ca/~snburris/htdocs/MYWORKS/PAPERS/HerUndecLOAG.pdf

QR Code
QR Code lattice-ordered_groups (generated for current page)