Searcharxiv⌕ Search

arXiv subjects

Jiří Velebil

Publications and source records attributed to Jiří Velebil.

6 recordsLinked to original sources

Sifted Colimits, Strongly Finitary Monads and Continuous Algebras

We characterize strongly finitary monads on categories $\mathsf{Pos}$, $\mathsf{CPO}$ and $\mathsf{DCPO}$ as precisely those preserving sifted colimits. Or, equivalently, enriched finitary monads preserving reflexive coinserters. We study sifted colimits in general enriched categories. For $\mathsf{CPO}$ and $\mathsf{DCPO}$ we characterize varieties of continuous algebras as precisely the monadic categories for strongly finitary monads.

math.CT↗

Varieties of Quantitative or Continuous Algebras (Extended Abstract)

Quantitative algebras are algebras enriched in the category $\mathsf{Met}$ of metric spaces so that all operations are nonexpanding. Mardare, Plotkin and Panangaden introduced varieties (aka $1$-basic varieties) as classes of quantitative algebras presented by quantitative equations. We prove that they bijectively correspond to strongly finitary monads $T$ on $\mathsf{Met}$. This means that $T$ is the Kan extension of its restriction to finite discrete spaces. An analogous result holds in the category $\mathsf{CMet}$ of complete metric spaces. Analogously, continuous algebras are algebras enriched in $\mathsf{CPO}$, the category of $ω$-cpos, so that all operations are continuous. We introduce equations between extended terms, and prove that varieties (classes presented by such equations) correspond bijectively to strongly finitary monads $T$ on $\mathsf{CPO}$. This means that $T$ is the Kan extension of its restriction to finite discrete cpos. (The two results have substantially different proofs.) An analogous result is also presented for monads on $\mathsf{DCPO}$. We also characterize strong finitarity in all the categories above by preservations of certain weighted colimits. As a byproduct we prove that directed colimits commute with finite products in all cartesian closed categories.

math.CT↗

Extending set functors to generalised metric spaces

For a commutative quantale $\mathcal{V}$, the category $\mathcal{V}-cat$ can be perceived as a category of generalised metric spaces and non-expanding maps. We show that any type constructor $T$ (formalised as an endofunctor on sets) can be extended in a canonical way to a type constructor $T_{\mathcal{V}}$ on $\mathcal{V}-cat$. The proof yields methods of explicitly calculating the extension in concrete examples, which cover well-known notions such as the Pompeiu-Hausdorff metric as well as new ones. Conceptually, this allows us to to solve the same recursive domain equation $X\cong TX$ in different categories (such as sets and metric spaces) and we study how their solutions (that is, the final coalgebras) are related via change of base. Mathematically, the heart of the matter is to show that, for any commutative quantale $\mathcal{V}$, the `discrete' functor $D:\mathsf{Set}\to \mathcal{V}-cat$ from sets to categories enriched over $\mathcal{V}$ is $\mathcal{V}-cat$-dense and has a density presentation that allows us to compute left-Kan extensions along $D$.

math.CT↗

Positive fragments of coalgebraic logics

Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond. In this paper, we provide a coalgebraic analysis of this theorem, which not only gives a conceptual proof based on duality theory, but also generalizes Dunn's result from Kripke frames to coalgebras for weak-pullback preserving functors. To facilitate this analysis we prove a number of category theoretic results on functors on the categories $\mathsf{Set}$ of sets and $\mathsf{Pos}$ of posets: Every functor $\mathsf{Set} \to \mathsf{Pos}$ has a $\mathsf{Pos}$-enriched left Kan extension $\mathsf{Pos} \to \mathsf{Pos}$. Functors arising in this way are said to have a presentation in discrete arities. In the case that $\mathsf{Set} \to \mathsf{Pos}$ is actually $\mathsf{Set}$-valued, we call the corresponding left Kan extension $\mathsf{Pos} \to \mathsf{Pos}$ its posetification. A $\mathsf{Set}$-functor preserves weak pullbacks if and only if its posetification preserves exact squares. A $\mathsf{Pos}$-functor with a presentation in discrete arities preserves surjections. The inclusion $\mathsf{Set} \to \mathsf{Pos}$ is dense. A functor $\mathsf{Pos} \to \mathsf{Pos}$ has a presentation in discrete arities if and only if it preserves coinserters of `truncated nerves of posets'. A functor $\mathsf{Pos} \to \mathsf{Pos}$ is a posetification if and only if it preserves coinserters of truncated nerves of posets and discrete posets. A locally monotone endofunctor of an ordered variety has a presentation by monotone operations and equations if and only if it preserves $\mathsf{Pos}$-enriched sifted colimits.

math.CT↗

An elementary characterisation of sifted weights

Sifted colimits (those that commute with finite products in sets) play a major role in categorical universal algebra. For example, varieties of (many-sorted) algebras are precisely the free cocompletions under sifted colimits of (many-sorted) Lawvere theories. Such a characterisation does not depend on the existence of finite products in algebraic theories, but on the above fact that these products commute with sifted colimits and another condition: finite products form a sound class of limits. In this paper we study the notion of soundness for general classes of weights in enriched category theory. We show that soundness of a given class of weights is equivalent to having a `nice' characterisation of flat weights for that class. As an application, we give an elementary characterisation of sifted weights for the enrichment in categories and in preorders. We also provide a number of examples of sifted weights using our elementary criterion.

math.CT↗

Algebraic Theories over Nominal Sets

We investigate the foundations of a theory of algebraic data types with variable binding inside classical universal algebra. In the first part, a category-theoretic study of monads over the nominal sets of Gabbay and Pitts leads us to introduce new notions of finitary based monads and uniform monads. In a second part we spell out these notions in the language of universal algebra, show how to recover the logics of Gabbay-Mathijssen and Clouston-Pitts, and apply classical results from universal algebra.

cs.LO↗