Categories of frame-completions and join-specifications
Abstract
Given a poset , a join-specification for is a set of subsets of whose joins are all defined. The set of downsets closed under joins of sets in forms a complete lattice, and is, in a sense, the free -join preserving join-completion of . The main aim of this paper is to address two questions. First, given a join-specification , when is a frame? And second, given a poset , what is the structure of its set of frame-generating join-specifications? To answer the first question we provide a number of equivalent conditions, and we use these to investigate the second. In particular, we show that the set of frame-generating join-specifications for forms a complete lattice ordered by inclusion, and we describe its meet and join operations. We do the same for the set of `maximal' such join-specifications, for a natural definition of `maximal'. We also define functors from these lattices, considered as categories, into a suitably defined category of frame-completions of , and construct right adjoints for them.
Cite
@article{arxiv.1806.00642,
title = {Categories of frame-completions and join-specifications},
author = {Rob Egrot},
journal= {arXiv preprint arXiv:1806.00642},
year = {2018}
}
Comments
33 pages