SearcharxivSearch

arXiv subjects

J. Velebil

Publications and source records attributed to J. Velebil.

3 recordsLinked to original sources

Quantitative Algebras and a Classification of Metric Monads

Quantitative algebras are $\Sigma$-algebras acting on metric spaces, where operations are nonexpanding. Mardare, Panangaden and Plotkin introduced 1-basic varieties as categories of quantitative algebras presented by quantitative equations. We prove that for the category $\mathsf{UMet}$ of ultrametric spaces such varieties bijectively correspond to strongly finitary monads on $\mathsf{UMet}$. The same holds for the category $\mathsf{Met}$ of metric spaces, provided that strongly finitary endofunctors are closed under composition. For uncountable cardinals $\lambda$ there is an analogous bijection between varieties of $\lambda$-ary quantitative algebras and monads that are strongly $\lambda$-accessible. Moreover, we present a bijective correspondence between $\lambda$-basic varieties as introduced by Mardare et al and enriched, surjections-preserving $\lambda$-accesible monads on $\mathsf{Met}$. Finally, for general enriched $\lambda$-accessible monads on $\mathsf{Met}$ a bijective correspondence to generalized varieties is presented.

math.CT

A categorical view of varieties of ordered algebras

It is well known that classical varieties of $Σ$-algebras correspond bijectively to finitary monads on $\mathsf{Set}$. We present an analogous result for varieties of ordered $Σ$-algebras, i.e., classes presented by inequations between $Σ$-terms. We prove that they correspond bijectively to strongly finitary monads on $\mathsf{Pos}$. That is, those finitary monads which preserve reflexive coinserters. We deduce that strongly finitary monads have a coinserter presentation, analogous to the coequaliser presentation of finitary monads due to Kelly and Power. We also show that these monads are liftings of finitary monads on $\mathsf{Set}$.

math.CT

On coalgebra based on classes

Every endofunctor of the category of classes is proved to be set-based in the sense of Aczel and Mendler, therefore, it has a final coalgebra. Other basic properties of these endofunctors are proved, e.g. the existence of a free completely iterative theory.

cs.LO