Semialgebras and Weak Distributive Laws

by   Daniela Petri{ş}an, et al.

Motivated by recent work on weak distributive laws and their applications to coalgebraic semantics, we investigate the algebraic nature of semialgebras for a monad. These are algebras for the underlying functor of the monad subject to the associativity axiom alone-the unit axiom from the definition of an Eilenberg-Moore algebras is dropped. We prove that if the underlying category has coproducts, then semialgebras for a monad M are in fact the Eilenberg-Moore algebras for a suitable monad structure on the functor id + M , which we call the semifree monad M^s. We also provide concrete algebraic presentations for semialgebras for the maybe monad, the semigroup monad and the finite distribution monad. A second contribution is characterizing the weak distributive laws of the form M T ⇒ T M as strong distributive laws M^s T ⇒ T M^s subject to an additional condition.



There are no comments yet.


page 1

page 2

page 3

page 4


Algebraic Presentation of Semifree Monads

Monads and their composition via distributive laws have many application...

Weakening and Iterating Laws using String Diagrams

Distributive laws are a standard way of combining two monads, providing ...

Oracular information and the second law of thermodynamics

Patterns and processes - spatial and temporal correlations - are subject...

Interaction laws of monads and comonads

We introduce and study functor-functor and monad-comonad interaction law...

Uniform Approximation and Bracketing Properties of VC classes

We show that the sets in a family with finite VC dimension can be unifor...

Don't Try This at Home: No-Go Theorems for Distributive Laws

Beck's distributive laws provide sufficient conditions under which two m...

Convexity via Weak Distributive Laws

We study the canonical weak distributive law δ of the powerset monad ove...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.