Regular closure operators (Q5906576)

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 626367
Language Label Description Also known as
default for all languages
No label defined
    English
    Regular closure operators
    scientific article; zbMATH DE number 626367

      Statements

      Regular closure operators (English)
      0 references
      0 references
      0 references
      0 references
      20 November 1994
      0 references
      In an \((E,{\mathcal M})\)-category \({\mathcal X}\) for sinks, we identify necessary conditions for Galois connections from the power collection of the class of (composable pairs) of morphisms in \({\mathcal M}\) to factor through the ``lattice'' of all closure operators on \({\mathcal M}\), and to factor through certain sublattices. This leads to the notion of regular closure operator. As one byproduct of these results we not only arrive (in a novel way) at the Pumplün-Röhrl polarity between collections of morphisms and collections of objects in such a category, but obtain many factorizations of that polarity as well. Another byproduct is the clarification of the Salbany construction (by means of relative dominions) of the largest idempotent closure operator that has a specified class of \({\mathcal X}\)-objects as separated objects. -- From the authors' abstract. For the work of \textit{D. Pumplün} and \textit{H. Röhrl} see Manuscr. Math. 50, 145-183 (1985; Zbl 0594.46064); for \textit{S. Salbany}, Lect. Notes Math. 540, 548-565 (1976; Zbl 0335.54003).
      0 references
      \((E,{\mathcal M})\)-category
      0 references
      Galois connections
      0 references
      Pumplün-Röhrl polarity
      0 references
      factorizations
      0 references
      Salbany construction
      0 references
      closure operator
      0 references
      0 references

      Identifiers

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