−Table of Contents
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: x≤y⟹uxv≤uyv
Remark: xy=x⋅y, x≤y⟺x∧y=x and x≤y⟺x∨y=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(x∨y)v=uxv∨uyv
Remark: x∧y=(x−1∨y−1)−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: x−1=e/x=x∖e, x/y=xy−1 and x∖y=x−1y
Morphisms
Let L and M be ℓ-groups. A morphism from L to M is a function f:L→M that is a homomorphism: f(x∨y)=f(x)∨f(y), f(x∧y)=f(x)∧f(y), f(x⋅y)=f(x)⋅f(y), f(x−1)=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
Classtype | variety |
---|---|
Equational theory | decidable1) |
Quasiequational theory | undecidable2) |
First-order theory | hereditarily undecidable3) 4) |
Congruence distributive | yes, see lattices |
Congruence extension property | |
Congruence n-permutable | yes, n=2, see groups |
Congruence regular | yes, see groups |
Congruence uniform | yes, see groups |
Definable principal congruences | |
Equationally def. pr. cong. | |
Amalgamation property | no |
Strong amalgamation property | no |
Epimorphisms are surjective |
Finite nontrivial members
None