language-icon Old Web
English
Sign In

Lawvere theory

In category theory, a Lawvere theory (named after American mathematician William Lawvere) is a category which can be considered a categorical counterpart of the notion of an equational theory. In category theory, a Lawvere theory (named after American mathematician William Lawvere) is a category which can be considered a categorical counterpart of the notion of an equational theory. Let ℵ 0 {displaystyle aleph _{0}} be a skeleton of the category FinSet of finite sets and functions. Formally, a Lawvere theory consists of a small category L with (strictly associative) finite products and a strict identity-on-objects functor I : ℵ 0 op → L {displaystyle I:aleph _{0}^{ ext{op}} ightarrow L} preserving finite products. A model of a Lawvere theory in a category C with finite products is a finite-product preserving functor M : L → C. A morphism of models h : M → N where M and N are models of L is a natural transformation of functors. A map between Lawvere theories (L,I) and (L′,I′) is a finite-product preserving functor which commutes with I and I′. Such a map is commonly seen as an interpretation of (L,I) in (L′,I′). Lawvere theories together with maps between them form the category Law. Variations include multisorted (or multityped) Lawvere theory, infinitary Lawvere theory, Fermat theory (named Fermat's difference quotient), and finite-product theory.

[ "Monad (functional programming)", "Semantics" ]
Parent Topic
Child Topic
    No Parent Topic