Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCoproducts of Monads on Set
229
0
0.0
(
0
)
Added by
Jiri Adamek
Publication date
2014
fields
Informatics Engineering
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
Coproducts of monads on Set have arisen in both the study of computational effects and universal algebra. We describe coproducts of consistent monads on Set by an initial algebra formula, and prove also the converse: if the coproduct exists, so do the required initial algebras. That formula was, in the case of ideal monads, also used by Ghani and Uustalu. We deduce that coproduct embeddings of consistent monads are injective; and that a coproduct of injective monad morphisms is injective. Two consistent monads have a coproduct iff either they have arbitrarily large common fixpoints, or one is an exception monad, possibly modified to preserve the empty set. Hence a consistent monad has a coproduct with every monad iff it is an exception monad, possibly modified to preserve the empty set. We also show other fixpoint results, including that a functor (not constant on nonempty sets) is finitary iff every sufficiently large cardinal is a fixpoint.
rate research
Read More
The category of all monads over many-sorted sets (and over other set-like categories) is proved to have coequalizers and strong cointersections. And a general diagram has a colimit whenever all the monads involved preserve monomorphisms and have arbitrarily large joint pre-fixpoints. In contrast, coequalizers fail to exist e.g. for monads over the (presheaf) category of graphs. For more general categories we extend the results on coproducts of monads from [2]. We call a monad separated if, when restricted to monomorphisms, its unit has a complement. We prove that every collection of separated monads with arbitrarily large joint pre-fixpoints has a coproduct. And a concrete formula for these coproducts is presented.
In this paper, we give precise mathematical form to the idea of a structure whose data and axioms are faithfully represented by a graphical calculus; some prominent examples are operads, polycategories, properads, and PROPs. Building on the established presentation of such structures as algebras for monads on presheaf categories, we describe a characteristic property of the associated monads---the shapeliness of the title---which says that any two operations of the same shape agree. An important part of this work is the study of analytic functors between presheaf categories, which are a common generalisation of Joyals analytic endofunctors on sets and of the parametric right adjoint functors on presheaf categories introduced by Diers and studied by Carboni--Johnstone, Leinster and Weber. Our shapely monads will be found among the analytic endofunctors, and may be characterised as the submonads of a universal analytic monad with exactly one operation of each shape. In fact, shapeliness also gives a way to define the data and axioms of a structure directly from its graphical calculus, by generating a free shapely monad on the basic operations of the calculus. In this paper we do this for some of the examples listed above; in future work, we intend to do so for graphical calculi such as Milners bigraphs, Lafonts interaction nets, or Girards multiplicative proof nets, thereby obtaining canonical notions of denotational model.
We give a leisurely introduction to our abstract framework for operational semantics based on cellular monads on transition categories. Furthermore, we relate it for the first time to an existing format, by showing that all Positive GSOS specifications generate cellular monads whose free algebras are all compositional. As a consequence, we recover the known result that bisimilarity is a congruence in the generated labelled transition system.
We study a composition operation on monads, equivalently presented as large equational theories. Specifically, we discuss the existence of tensors, which are combinations of theories that impose mutual commutation of the operations from the component theories. As such, they extend the sum of two theories, which is just their unrestrained combination. Tensors of theories arise in several contexts; in particular, in the semantics of programming languages, the monad transformer for global state is given by a tensor. We present two main results: we show that the tensor of two monads need not in general exist by presenting two counterexamples, one of them involving finite powerset (i.e. the theory of join semilattices); this solves a somewhat long-standing open problem, and contrasts with recent results that had ruled out previously expected counterexamples. On the other hand, we show that tensors with bounded powerset monads do exist from countable powerset upwards.
We generalise Flo{}ystads theorem on the existence of monads on the projective space to a larger set of projective varieties. We consider a variety $X$, a line bundle $L$ on $X$, and a base-point-free linear system of sections of $L$ giving a morphism to the projective space whose image is either arithmetically Cohen-Macaulay (ACM), or linearly normal and not contained in a quadric. We give necessary and sufficient conditions on integers $a$, $b$, and $c$ for a monad of type [ 0to(L^vee)^atomathcal{O}_{X}^{,b}to L^cto0 ] to exist. We show that under certain conditions there exists a monad whose cohomology sheaf is simple. We furthermore characterise low-rank vector bundles that are the cohomology sheaf of some monad as above. Finally, we obtain an irreducible family of monads over the projective space and make a description on how the same method could be used on an ACM smooth projective variety $X$. We establish the existence of a coarse moduli space of low-rank vector bundles over an odd-dimensional $X$ and show that in one case this moduli space is irreducible.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
