arXiv subjects

Christina Vasilakopoulou

Publications and source records attributed to Christina Vasilakopoulou.

At least 19 recordsLinked to original sources

arXiv2026

On categories of monads and comonads in double categories

As is well known in the literature, the category Mon(V) of monoids in a monoidal category V satisfies various fundamental categorical properties, at least when the monoidal base V is correspondingly well-behaved. In particular, Mon(V) is monadic over V as soon as free monoids exist, while if V is cocomplete or locally presentable and its tensor b is sufficiently compatible with the appropriate colimits, then Mon(V) inherits the analogous property. In the present work, we extend such results to the context of double categories. More precisely, we identify conditions on a double category D under which one can show that the category Mnd(D) of monads in D is monadic over the category of endomorphisms End(D), is cocomplete or even locally presentable. We also tackle the issue of local presentability in the dual case Cmd(D) of comonads. In these results, our assumptions on the double category D revolve around notions of colimit, in particular those of parallel and stable local colimits, as well as a notion of local presentability of a double category which has been introduced in previous work.

math.CT↗

arXiv2026

Measuring Comodules and Enrichment

This paper extends the theory of universal measuring comonoids to modules and comodules in braided monoidal categories. We generalise the universal measuring comodule Q(M,N), originally introduced for modules over k-algebras when k is a field, to arbitrary braided monoidal categories. In order to establish its existence, we prove a representability theorem for presheaves on opfibred categories and an adjoint functor theorem for opfibred functors. The global categories of modules and comodules, fibred and opfibred over monoids and comonoids respectively, are shown to exhibit an enrichment of modules in comodules. Additionally, we use our framework to study higher derivations of algebras and modules, defining along the way the non-commutative Hasse-Schmidt algebra.

math.CT↗

arXiv2025

A unified treatment of commuting tensor products of categories, operads, symmetric multicategories and their bimodules

We provide a unified treatment of several commuting tensor products considered in the literature, including the tensor product of enriched categories and the Boardman-Vogt tensor product of operads and symmetric multicategories, subsuming work of Elmendorf and Mandell. We then show how a commuting tensor product extends to bimodules, generalising results of Dwyer and Hess. In particular, we construct a double category of symmetric multicategories, symmetric multifunctors and bimodules and show that it admits a symmetric oplax monoidal structure. These applications are obtained as instances of a general construction of commuting tensor products on double categories of monads, monad morphisms and bimodules.

math.CT↗

arXiv2025

Sweedler theory for double categories

In this work, we establish certain enrichments of dual algebraic structures in the setting of monoidal double categories. In more detail, we obtain a tensored and cotensored enrichment of monads in comonads, as well as a tensored and cotensored enrichment of modules in comodules, under very general conditions on the surrounding double category. These include `monoidal closedness' and `local presentability', leading classical notions which are here introduced in the double categorical context. Furthermore, we show that in this setting, the actual fibration of modules over monads is itself enriched in the opfibration of comodules over comonads. Applying this abstract double categorical framework to the setting of V-matrices, one directly obtains a many-object generalization of the known enrichment of modules over monoids in comodules over comonoids in a monoidal category V, which was originally induced by Sweedler's measuring k-coalgebras in vector spaces. In the present setting the result involves V-enriched modules of V-categories and V-enriched comodules of V-cocategories.

math.CT↗

arXiv2025

Algebraic Databases

Databases have been studied category-theoretically for decades. The database schema -- whose purpose is to arrange high-level conceptual entities -- is generally modeled as a category or sketch. The data itself, often called an instance, is generally modeled as a set-valued functor, assigning to each conceptual entity a set of examples. While mathematically elegant, these categorical models have typically struggled with representing concrete data such as integers or strings. In the present work, we propose an extension of the set-valued functor model, making use of multisorted algebraic theories (a.k.a. Lawvere theories) to incorporate concrete data in a principled way. This also allows constraints and queries to make use of operations on data, such as multiplication or comparison of numbers, helping to bridge the gap between traditional databases and programming languages. We also show how all of the components of our model -- including schemas, instances, change-of-schema functors, and queries - fit into a single double categorical structure called a proarrow equipment (a.k.a. framed bicategory).

math.CT↗

arXiv2024

Monoidal Kleisli Bicategories and the Arithmetic Product of Coloured Symmetric Sequences

We extend the arithmetic product of species of structures and symmetric sequences studied by Maia and Mendez and by Dwyer and Hess to coloured symmetric sequences and show that it determines a normal oplax monoidal structure on the bicategory of coloured symmetric sequences. In order to do this, we establish general results on extending monoidal structures to Kleisli bicategories. Our approach uses monoidal double categories, which help us to attack the difficult problem of verifying the coherence conditions for a monoidal bicategory in an efficient way.

math.CT↗

arXiv2023

Proceedings of the Sixth International Conference on Applied Category Theory 2023

The Sixth International Conference on Applied Category Theory took place at the University of Maryland, 31 July -- 4 August 2023. This conference follows the previous meetings at Leiden (2018), Oxford (2019), MIT (2020, fully online), Cambridge (2021) and Glasgow (2022). The conference comprised contributed talks, a poster session, an industry showcase session, and a session where junior researchers who had attended the Adjoint School presented the results of their research at the school. Information regarding the conference may be found at (https://act2023.github.io/). The contributions to ACT2023 ranged from pure to applied and included contributions in a wide range of disciplines in science and engineering. Submission to ACT 2023 had three tracks: extended abstracts, software demonstrations, and proceedings. Only papers submitted to the proceedings track were considered for publication in this volume.

cs.LO↗

arXiv2022

Structured versus Decorated Cospans

One goal of applied category theory is to understand open systems. We compare two ways of describing open systems as cospans equipped with extra data. First, given a functor $L \colon \mathsf{A} \to \mathsf{X}$, a "structured cospan" is a diagram in $\mathsf{X}$ of the form $L(a) \rightarrow x \leftarrow L(b)$. If $\mathsf{A}$ and $\mathsf{X}$ have finite colimits and $L$ preserves them, it is known that there is a symmetric monoidal double category whose objects are those of $\mathsf{A}$ and whose horizontal 1-cells are structured cospans. Second, given a pseudofunctor $F \colon \mathsf{A} \to \mathbf{Cat}$, a "decorated cospan" is a diagram in $\mathsf{A}$ of the form $a \rightarrow m \leftarrow b$ together with an object of $F(m)$. Generalizing the work of Fong, we show that if $\mathsf{A}$ has finite colimits and $F \colon (\mathsf{A},+) \to (\mathsf{Cat},\times)$ is symmetric lax monoidal, there is a symmetric monoidal double category whose objects are those of $\mathsf{A}$ and whose horizontal 1-cells are decorated cospans. We prove that under certain conditions, these two constructions become isomorphic when we take $\mathsf{X} = \int F$ to be the Grothendieck category of $F$. We illustrate these ideas with applications to electrical circuits, Petri nets, dynamical systems and epidemiological modeling.

math.CT↗

arXiv2021

Monoidal Grothendieck construction

We lift the standard equivalence between fibrations and indexed categories to an equivalence between monoidal fibrations and monoidal indexed categories, namely weak monoidal pseudofunctors to the 2-category of categories. In doing so, we investigate the relation between this `global' monoidal structure where the total category is monoidal and the fibration strictly preserves the structure, and a `fibrewise' one where the fibres are monoidal and the reindexing functors strongly preserve the structure, first hinted by Shulman. In particular, when the domain is cocartesian monoidal, lax monoidal structures on the functor to the 2-category of categories correspond to lifts of the functor to the 2-category of monoidal categories. Finally, we give examples where this correspondence appears, spanning from the fundamental and family fibrations to network models and systems.

math.CT↗

arXiv2021

Categorical Semantics of Cyber-Physical Systems Theory

Cyber-physical systems require the construction and management of various models to assure their correct, safe, and secure operation. These various models are necessary because of the coupled physical and computational dynamics present in cyber-physical systems. However, to date the different model views of cyber-physical systems are largely related informally, which raises issues with the degree of formal consistency between those various models of requirements, system behavior, and system architecture. We present a category-theoretic framework to make different types of composition explicit in the modeling and analysis of cyber-physical systems, which could assist in verifying the system as a whole. This compositional framework for cyber-physical systems gives rise to unified system models, where system behavior is hierarchically decomposed and related to a system architecture using the systems-as-algebras paradigm. As part of this paradigm, we show that an algebra of (safety) contracts generalizes over the state of the art, providing more uniform mathematical tools for constraining the behavior over a richer set of composite cyber-physical system models, which has the potential of minimizing or eliminating hazardous behavior.

cs.LO↗

arXiv2021

Compositional Cyber-Physical Systems Modeling

Assuring the correct behavior of cyber-physical systems requires significant modeling effort, particularly during early stages of the engineering and design process when a system is not yet available for testing or verification of proper behavior. A primary motivation for `getting things right' in these early design stages is that altering the design is significantly less costly and more effective than when hardware and software have already been developed. Engineering cyber-physical systems requires the construction of several different types of models, each representing a different view, which include stakeholder requirements, system behavior, and the system architecture. Furthermore, each of these models can be represented at different levels of abstraction. Formal reasoning has improved the precision and expanded the available types of analysis in assuring correctness of requirements, behaviors, and architectures. However, each is usually modeled in distinct formalisms and corresponding tools. Currently, this disparity means that a system designer must manually check that the different models are in agreement. Manually editing and checking models is error prone, time consuming, and sensitive to any changes in the design of the models themselves. Wiring diagrams and related theory provide a means for formally organizing these different but related modeling views, resulting in a compositional modeling language for cyber-physical systems. Such a categorical language can make concrete the relationship between different model views, thereby managing complexity, allowing hierarchical decomposition of system models, and formally proving consistency between models.

eess.SY↗

arXiv2020

A Larson-Sweedler Theorem for Hopf V-Categories

The aim of this paper is to extend the classical Larson-Sweedler theorem, namely that a k-bialgebra has a non-singular integral (and in particular is Frobenius) if and only if it is a finite dimensional Hopf algebra, to the `many-object' setting of Hopf categories. To this end, we provide new characterizations of Frobenius V-categories and we develop the integral theory for Hopf V-categories. Our results apply to Hopf algebras in any braided monoidal category as a special case, and also relate to Turaev's Hopf group algebras and particular cases of weak and multiplier Hopf algebras.

math.CT↗

arXiv2020

Oplax Hopf Algebras

We introduce the notion of an oplax Hopf monoid in any braided monoidal bicategory, generalizing that of a Hopf monoid in a braided monoidal category in an appropriate way. We show that Hopf V-categories introduced in [BCV16] are a particular type of oplax Hopf monoids in the monoidal bicategory Span|V described in [Böh17]. Finally, we introduce Frobenius V-categories as the Frobenius objects in the same monoidal bicategory.

math.CT↗

arXiv2020

Duoidal categories, measuring comonoids and enrichment

We extend the theory of Sweeder's measuring comonoids to the framework of duoidal categories: categories equipped with two compatible monoidal structures. We use one of the tensor products to endow the category of monoids for the other with an enrichment in the category of comonoids. The enriched homs are provided by the universal measuring comonoids. We study a number of duoidal structures on categories of graded objects and of species and the associated enriched categories, such as an enrichment of graded (twisted) monoids in graded (twisted) comonoids, as well as two enrichments of symmetric operads in symmetric cooperads.

math.CT↗

arXiv2019

Dynamical Systems and Sheaves

A categorical framework for modeling and analyzing systems in a broad sense is proposed. These systems should be thought of as `machines' with inputs and outputs, carrying some sort of signal that occurs through some notion of time. Special cases include continuous and discrete dynamical systems (e.g. Moore machines). Additionally, morphisms between the different types of systems allow their translation in a common framework. A central goal is to understand the systems that result from arbitrary interconnection of component subsystems, possibly of different types, as well as establish conditions that ensure totality and determinism compositionally. The fundamental categorical tools used here include lax monoidal functors, which provide a language of compositionality, as well as sheaf theory, which flexibly captures the crucial notion of time.

math.CT↗

arXiv2018

Enriched Duality in Double Categories: V-categories and V-cocategories

In this work, we explore a double categorical framework for categories of enriched graphs, categories and the newly introduced notion of cocategories. A fundamental goal is to establish an enrichment of V-categories in V-cocategories, which generalizes the so-called Sweedler theory relatively to an enrichment of algebras in coalgebras. The language employed is that of V-matrices, and an interplay between the double categorical and bicategorical perspective provides a high-level flexibility for demonstrating essential features of these dual structures. Furthermore, we investigate an enriched fibration structure involving categories of monads and comonads in fibrant double categories a.k.a. proarrow equipments, which leads to natural applications for their materialization as categories and cocategories in the enriched matrices setting.

math.CT↗

arXiv2018

On Enriched Fibrations

We introduce the notion of an enriched fibration, i.e. a fibration whose total category and base category are enriched in those of a monoidal fibration in an appropriate way. Furthermore, we provide a way to obtain such a structure, starting from actions of monoidal categories with parameterized adjoints. The motivating goal is to capture certain example cases, like the fibration of modules over algebras enriched in the opfibration of comodules over coalgebras.

math.CT↗

arXiv2016

Hopf measuring comonoids and enrichment

We study the existence of universal measuring comonoids $P(A,B)$ for a pair of monoids $A$, $B$ in a braided monoidal closed category, and the associated enrichment of a category of monoids over the monoidal category of comonoids. In symmetric categories, we show that if $A$ is a bimonoid and $B$ is a commutative monoid, then $P(A,B)$ is a bimonoid; in addition, if $A$ is a cocommutative Hopf monoid then $P(A,B)$ always is Hopf. If $A$ is a Hopf monoid, not necessarily cocommutative, then $P(A,B)$ is Hopf if the fundamental theorem of comodules holds; to prove this we give an alternative description of the dualizable $P(A,B)$-comodules and use the theory of Hopf (co)monads. We explore the examples of universal measuring comonoids in vector spaces and graded spaces.

math.CT↗