Math 2.0

Category theory; homological algebra Definition

Algebra over a monad

Builds on MonadFree monoidMonoid

Definition

Let (T,ฮท,ฮผ)(T, \eta, \mu) be a monad on a category ๐’ž\mathcal{C}. A TT-algebra is a pair (A,a)(A, a) of an object AA of ๐’ž\mathcal{C} and a morphism aโ€‰โฃ:T(A)โ†’Aa \colon T(A) \to A with these two properties.

  1. Unit law: aโˆ˜ฮทA=idโกAa \circ \eta_A = \id_A.
  2. Associativity law: aโˆ˜T(a)=aโˆ˜ฮผAa \circ T(a) = a \circ \mu_A as morphisms T(T(A))โ†’AT(T(A)) \to A.

A morphism of TT-algebras fโ€‰โฃ:(A,a)โ†’(B,b)f \colon (A, a) \to (B, b) is a morphism fโ€‰โฃ:Aโ†’Bf \colon A \to B of ๐’ž\mathcal{C} with fโˆ˜a=bโˆ˜T(f)f \circ a = b \circ T(f).

Remarks

Example: let TT be the list monad on sets, so T(X)T(X) is the free monoid of finite words in XX. For a monoid MM, let aa send a word (m1,โ€ฆ,mn)(m_1, \dots, m_n) to the product m1m2โ‹ฏmnm_1 m_2 \cdots m_n in MM, with the empty word sent to the identity. The unit law holds since a one-letter word mm evaluates to mm. The associativity law holds since multiplying the blocks of a word of words and then multiplying the results gives the product of the concatenated word. Every TT-algebra arises in this way, so TT-algebras are the same as monoids.

Non-example: for the same monad, let aโ€‰โฃ:T(โ„•)โ†’โ„•a \colon T(\N) \to \N send a word to its length. Then a(ฮทโ„•(5))=1โ‰ 5a(\eta_{\N}(5)) = 1 \ne 5, so the unit law fails.

For every object XX, the pair (T(X),ฮผX)(T(X), \mu_X) is a TT-algebra, the free TT-algebra on XX.

Reading path

To understand this page from the ground up, read these 4 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Free monoid concept
  2. Monad concept
  3. Monoid concept
  4. Algebra over a monad definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Monad_(category_theory)
About this page
TagCZWDNA1HA7
URIm2://CZWDNA1HA7
Kinddefinition
WritingW0 stub
MSC18C20, 18C15
DefinesAlgebra over a monad
UsesMonad, Free monoid, Monoid

Markdown ยท JSON ยท Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.