Pattern Runs on Matter: The Free Monad Monad as a Module over the Cofree Comonad Comonad

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Libkind, Sophie, Spivak, David I.
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909805245890560
author Libkind, Sophie
Spivak, David I.
author_facet Libkind, Sophie
Spivak, David I.
contents Interviews run on people, programs run on operating systems, voting schemes run on voters, games run on players. Each of these is an example of the abstraction pattern runs on matter. Pattern determines the decision tree that governs how a situation can unfold, while matter responds with decisions at each juncture. In this article, we will give a straightforward and concrete construction of the free monad monad for the category of polynomial functors with the substitution monoidal product. Although the free monad has been well-studied in other contexts, the construction we give is streamlined and explicitly illustrates how the free monad represents terminating decision trees. We will also explore the naturally arising interaction between the free monad and cofree comonad. Again, while the interaction itself is known, the perspective we take is the free monad as a module over the cofree comonad. Lastly, we will give four applications of the module action to interviews, computer programs, voting, and games. In each example, we will see how the free monad represents pattern, the cofree comonad represents matter, and the module action represents runs on.
format Preprint
id arxiv_https___arxiv_org_abs_2404_16321
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Pattern Runs on Matter: The Free Monad Monad as a Module over the Cofree Comonad Comonad
Libkind, Sophie
Spivak, David I.
Category Theory
Interviews run on people, programs run on operating systems, voting schemes run on voters, games run on players. Each of these is an example of the abstraction pattern runs on matter. Pattern determines the decision tree that governs how a situation can unfold, while matter responds with decisions at each juncture. In this article, we will give a straightforward and concrete construction of the free monad monad for the category of polynomial functors with the substitution monoidal product. Although the free monad has been well-studied in other contexts, the construction we give is streamlined and explicitly illustrates how the free monad represents terminating decision trees. We will also explore the naturally arising interaction between the free monad and cofree comonad. Again, while the interaction itself is known, the perspective we take is the free monad as a module over the cofree comonad. Lastly, we will give four applications of the module action to interviews, computer programs, voting, and games. In each example, we will see how the free monad represents pattern, the cofree comonad represents matter, and the module action represents runs on.
title Pattern Runs on Matter: The Free Monad Monad as a Module over the Cofree Comonad Comonad
topic Category Theory
url https://arxiv.org/abs/2404.16321