ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Applied categorical structures 2 (1994), S. 219-244 
    ISSN: 1572-9095
    Keywords: Primary: 18A32 ; Secondary: 06A15, 54B30 ; Galois connection ; polarity ; closure operator ; separated object ; dense morphism ; composable pair of morphisms ; factorization structure for sinks
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In an 〈E,M〉-categoryX for sinks, we identify necessary conditions for Galois connections from the power collection of the class of (composable pairs) of morphisms inM to factor through the “lattice” of all closure operators onM, and to factor through certain sublattices. This leads to the notion ofregular 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. (One of these factorizations constituted the main result of an earlier paper by the same authors). 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 ofX-objects as separated objects. The same relation that is used in Salbany's relative dominion construction induces classical regular closure operators as described above. Many other types of closure operators can be obtained by this technique; particular instances of this are the idempotent and modal closure operators that in a Grothendieck topos correspond to the Grothendieck topologies.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...