arXiv subjects

Jiri Velebil

Publications and source records attributed to Jiri Velebil.

6 recordsLinked to original sources

arXiv2013

Kan injectivity in order-enriched categories

Continuous lattices were characterised by Martin Escardo as precisely the objects that are Kan-injective w.r.t. a certain class of morphisms. We study Kan-injectivity in general categories enriched in posets. For every class H of morphisms we study the subcategory of all objects Kan-injective w.r.t. H and all morphisms preserving Kan-extensions. For categories such as Top_0 and Pos we prove that whenever H is a set of morphisms, the above subcategory is monadic, and the monad it creates is a Kock-Zoeberlein monad. However, this does not generalise to proper classes: we present a class of continuous mappings in Top_0 for which Kan-injectivity does not yield a monadic category.

cs.LO↗

arXiv2013

Relation lifting, with an application to the many-valued cover modality

We introduce basic notions and results about relation liftings on categories enriched in a commutative quantale. We derive two necessary and sufficient conditions for a 2-functor T to admit a functorial relation lifting: one is the existence of a distributive law of T over the "powerset monad" on categories, one is the preservation by T of "exactness" of certain squares. Both characterisations are generalisations of the "classical" results known for set functors: the first characterisation generalises the existence of a distributive law over the genuine powerset monad, the second generalises preservation of weak pullbacks. The results presented in this paper enable us to compute predicate liftings of endofunctors of, for example, generalised (ultra)metric spaces. We illustrate this by studying the coalgebraic cover modality in this setting.

cs.LO↗

arXiv2012

Relation Liftings on Preorders and Posets

The category Rel(Set) of sets and relations can be described as a category of spans and as the Kleisli category for the powerset monad. A set-functor can be lifted to a functor on Rel(Set) iff it preserves weak pullbacks. We show that these results extend to the enriched setting, if we replace sets by posets or preorders. Preservation of weak pullbacks becomes preservation of exact lax squares. As an application we present Moss's coalgebraic over posets.

cs.LO↗

arXiv2011

Semantics of Higher-Order Recursion Schemes

Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of λ-calculus in which the terminals are interpreted as continuous operations. For the uninterpreted semantics based on infinite λ-terms we follow the idea of Fiore, Plotkin and Turi and work in the category of sets in context, which are presheaves on the category of finite sets. Fiore et al showed how to capture the type of variable binding in λ-calculus by an endofunctor Hλand they explained simultaneous substitution of λ-terms by proving that the presheaf of λ-terms is an initial Hλ-monoid. Here we work with the presheaf of rational infinite λ-terms and prove that this is an initial iterative Hλ-monoid. We conclude that every guarded higher-order recursion scheme has a unique uninterpreted solution in this monoid.

cs.LO↗

arXiv2009

Final coalgebras in accessible categories

We give conditions on a finitary endofunctor of a finitely accessible category to admit a final coalgebra. Our conditions always apply to the case of a finitary endofunctor of a locally finitely presentable (l.f.p.) category and they bring an explicit construction of the final coalgebra in this case. On the other hand, there are interesting examples of final coalgebras beyond the realm of l.f.p. categories to which our results apply. We rely on ideas developed by Tom Leinster for the study of self-similar objects in topology.

math.CT↗

arXiv2006

Elgot Algebras

Denotational semantics can be based on algebras with additional structure (order, metric, etc.) which makes it possible to interpret recursive specifications. It was the idea of Elgot to base denotational semantics on iterative theories instead, i.e., theories in which abstract recursive specifications are required to have unique solutions. Later Bloom and Esik studied iteration theories and iteration algebras in which a specified solution has to obey certain axioms. We propose so-called Elgot algebras as a convenient structure for semantics in the present paper. An Elgot algebra is an algebra with a specified solution for every system of flat recursive equations. That specification satisfies two simple and well motivated axioms: functoriality (stating that solutions are stable under renaming of recursion variables) and compositionality (stating how to perform simultaneous recursion). These two axioms stem canonically from Elgot's iterative theories: We prove that the category of Elgot algebras is the Eilenberg-Moore category of the monad given by a free iterative theory.

cs.LO↗