Given a Functor A -coalgebra is is called the carrier.

Call the category of algebras .

Morphisms

Given two coalgebras , , an algebra homomorphism is a arrow s.t. the following commutes:

\usepackage{tikz-cd}
\begin{document}
\begin{tikzcd}
X \arrow[r, "\theta"] \arrow[d, "\alpha"']
  & Y \arrow[d, "\beta"] \\
F X \arrow[r, "F\theta"']
  & F Y
\end{tikzcd} 
\end{document}

Terminal -coalgebra

Write for the terminal coalgebra of .

Pointed coalgebra

A -coalgebra .

This forms a category with the following arrows.

An -coalgebra over is the same thing as an -algebra over .

Coalgebra-to-algebra morphism

Created by Eppendahl. Never talk about algebra-to-coalgebra.

Need to check, this commutes, you can compose with a coalgebra morphism Other rules are required, such as composition of these arrows.

This is a Bimodule from one category to another.

Examples

Integer stream

Distribution: countably-supported set: countablly many non-zero values. Distribution operator is a functor

Powerset: is a functor

Unreliable Integer

Let be a set of errors. Let Then we have a set of behaviours

Have

Initial algebras are the minimal states

Generative Interactive Integer

G(X)=\mathbb{Z} {\texttimes} (\mathbb{Z} \to X)

\require{AMScd} \begin{CD} B{\texttimes} (A\to X) @>>> B{\texttimes} (A\to (A^* \to B))\\ @A{\zeta}AA @VVV\\ X @>f>> A^*{\texttimes} B \end{CD} $$ Where f is the unique [[Anamorphism]] that makes the diagram commute. ### Colorful Integers Let $C$ be a set of colors (rgb). $$ F(X) = \mathrm{List}(C)\to (C\to Set) $$ Idea: possible plays for m a tree The [[initial algebra]] is the [[W Type|Well-Founded Tree]]s. # Remarks Coalgebras are a generalization of certain kinds of [[Transition System|transition systems]] that may not terminate. ## See also [[Subfunctor]] [[Algebra (Category Theory)]] ## Resources https://pblevy.github.io/coalglect.pdf