On the semigroup of closure operations (Q1825970)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4122240
Language Label Description Also known as
default for all languages
No label defined
    English
    On the semigroup of closure operations
    scientific article; zbMATH DE number 4122240

      Statements

      On the semigroup of closure operations (English)
      0 references
      0 references
      1990
      0 references
      Let (M,\(\leq)\) be a partially ordered set and denote by \({\mathcal T}_ M\) the full transformation semigroup on M. An element \(u\in {\mathcal T}_ M\) is a closure operation on M if it is idempotent, preserves order and, in addition, satisfies the condition that \(x\leq u(x)\) for all x. Denote by \(C_ M\) the family of all closure operations on M. In general, \(C_ M\) is not a subsemigroup of \({\mathcal T}_ M\) and when it is, \(C_ M\) is a semilattice. An element x of a complete lattice L is said to be \(\bigvee\)-irreducible if for each \(H\subseteq L\) such at \(x\leq \sup H\), then \(x\leq y\) for some \(y\in H\). It is shown that for a given semilattice S, there exists a partially ordered set M such that \(C_ M\) is isomorphic to S if and only if S is a complete lattice, under the usual ordering, in which every element is a supremum of \(\bigvee\)-irreducible elements. This, in turn, is equivalent to the proposition that there exists a complete ring of sets R such that S is isomorphic to the semilattice (R,\(\cap)\).
      0 references
      partially ordered set
      0 references
      full transformation semigroup
      0 references
      closure operations
      0 references
      semilattice
      0 references
      complete lattice
      0 references
      \(\bigvee \)-irreducible elements
      0 references
      complete ring of sets
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references