Lawvere theory

Last updated

In category theory, a Lawvere theory (named after American mathematician William Lawvere) is a category that can be considered a categorical counterpart of the notion of an equational theory.

Contents

Definition

Let 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 preserving finite products.

A model of a Lawvere theory in a category C with finite products is a finite-product preserving functor M : LC. A morphism of modelsh : MN where M and N are models of L is a natural transformation of functors.

Category of Lawvere theories

A map between Lawvere theories (L, I) and (L′, I′) is a finite-product preserving functor that 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

Variations include multisorted (or multityped) Lawvere theory, infinitary Lawvere theory, and finite-product theory. [1]

See also

Notes

Related Research Articles

Cardinal number Generalization of natural numbers

In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets. The cardinality of a finite set is a natural number: the number of elements in the set. The transfinite cardinal numbers describe the sizes of infinite sets.

In mathematics, specifically category theory, a functor is a map between categories. Functors were first considered in algebraic topology, where algebraic objects are associated to topological spaces, and maps between these algebraic objects are associated to continuous maps between spaces. Nowadays, functors are used throughout modern mathematics to relate various categories. Thus, functors are important in all areas within mathematics to which category theory is applied.

In mathematics, the inverse limit is a construction that allows one to "glue together" several related objects, the precise manner of the gluing process being specified by morphisms between the objects. Inverse limits can be defined in any category, and they are a special case of the concept of a limit in category theory.

Ultrafilter maximal proper filter

In the mathematical field of set theory, an ultrafilter on a given partially ordered set (poset) P is a certain subset of P, namely a maximal filter on P, that is, a proper filter on P that cannot be enlarged to a bigger proper filter on P.

In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure of the categories involved. Hence, a natural transformation can be considered to be a "morphism of functors". Indeed, this intuition can be formalized to define so-called functor categories. Natural transformations are, after categories and functors, one of the most fundamental notions of category theory and consequently appear in the majority of its applications.

Universal algebra is the field of mathematics that studies algebraic structures themselves, not examples ("models") of algebraic structures. For instance, rather than take particular groups as the object of study, in universal algebra one takes the class of groups as an object of study.

In mathematics, a sheaf is a tool for systematically tracking locally defined data attached to the open sets of a topological space. The data can be restricted to smaller open sets, and the data assigned to an open set is equivalent to all collections of compatible data assigned to collections of smaller open sets covering the original one. For example, such data can consist of the rings of continuous or smooth real-valued functions defined on each open set. Sheaves are by design quite general and abstract objects, and their correct definition is rather technical. They are variously defined, for example, as sheaves of sets or sheaves of rings, depending on the type of data assigned to open sets.

In mathematics, a monoidal category is a category equipped with a bifunctor

In category theory, a branch of mathematics, a monad is an endofunctor, together with two natural transformations required to fulfill certain coherence conditions. Monads are used in the theory of pairs of adjoint functors, and they generalize closure operators on partially ordered sets to arbitrary categories.

In category theory, an abstract branch of mathematics, an equivalence of categories is a relation between two categories that establishes that these categories are "essentially the same". There are numerous examples of categorical equivalences from many areas of mathematics. Establishing an equivalence involves demonstrating strong similarities between the mathematical structures concerned. In some cases, these structures may appear to be unrelated at a superficial or intuitive level, making the notion fairly powerful: it creates the opportunity to "translate" theorems between different kinds of mathematical structures, knowing that the essential meaning of those theorems is preserved under the translation.

In mathematics, the simplex category is the category of non-empty finite ordinals and order preserving maps. It is used to define simplicial and cosimplicial objects.

In category theory, a branch of mathematics, Beck's monadicity theorem gives a criterion that characterises monadic functors, introduced by Jonathan Mock Beck (2003) in about 1964. It is often stated in dual form for comonads. It is sometimes called the Beck tripleability theorem because of the older term triple for a monad.

This is a glossary of properties and concepts in category theory in mathematics.

In category theory, a strict 2-category is a category with "morphisms between morphisms", that is, where each hom-set itself carries the structure of a category. It can be formally defined as a category enriched over Cat.

In mathematics, a free Boolean algebra is a Boolean algebra with a distinguished set of elements, called generators, such that:

  1. Each element of the Boolean algebra can be expressed as a finite combination of generators, using the Boolean operations, and
  2. The generators are as independent as possible, in the sense that there are no relationships among them that do not hold in every Boolean algebra no matter which elements are chosen.

In category theory, a monoidal monad is a monad on a monoidal category such that the functor is a lax monoidal functor and the natural transformations and are monoidal natural transformations. In other words, is equipped with coherence maps and satisfying certain properties, and the unit and multiplication are monoidal natural transformations. By monoidality of , the morphisms and are necessarily equal.

The theory of accessible categories is a part of mathematics, specifically of category theory. It attempts to describe categories in terms of the "size" of the operations needed to generate their objects.

Gregory Maxwell "Max" Kelly, mathematician, founded the thriving Australian school of category theory.

In mathematics, a topos is a category that behaves like the category of sheaves of sets on a topological space. Topoi behave much like the category of sets and possess a notion of localization; they are a direct generalization of point-set topology. The Grothendieck topoi find applications in algebraic geometry; the more general elementary topoi are used in logic.

In mathematics, especially in category theory, the codensity monad is a fundamental construction associating a monad to a wide class of functors.

References