Categories of frame-completions and join-specifications
Abstract
Given a poset P, a join-specification U for P is a set of subsets of P whose joins are all defined. The set I U of downsets closed under joins of sets in U forms a complete lattice, and is, in a sense, the free U-join preserving join-completion of P. The main aim of this paper is to address two questions. First, given a join-specification U, when is I U a frame? And second, given a poset P, 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 P 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 P, and construct right adjoints for them.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.