Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > Groupoid


 Contents
In mathematics, especially in category theory and homotopy theory, a groupoid is a concept (first developed by Heinrich Brandt) that simultaneously generalises groups, equivalence relations on sets, and actions of groups on sets.

They are often used to capture information about geometrical objects such as manifolds.

The term "groupoid" is also used for a magma: a set with any sort of binary operation on it. We do not use the term for that concept in this encyclopedia.

1 Definitions

From one point of view, a groupoid is simply a category in which every morphism is an isomorphism (that is, invertible). To be explicit, a groupoid G is:

equipped with:

such that:

One can also define a groupoid as a certain algebraic structureIn abstract algebra, an algebraic structure consists of a set together with one or more operations on the set which satisfy certain axioms. In case there are no ambiguities, we usually identify the set with the algebraic structure. For example, a group G. To be specific, let G be a set and let comp be a partially definedIn mathematics and computer science, a partial function from the domain X to the codomain Y is a binary relation over X and Y which is functional that is, associates with every element in set X with at most one element in set Y''. If a partial function as binary operation on G. That is, given elements f and g of G, comp(f,g) may be an element of G, or it may be undefined. We write gf for comp(f,g). There is also a total (everywhere defined) functionIn mathematics, a function is a relation such that each element of a set (the domain is associated with a unique element of another (possibly the same) set (the codomain not to be confused with the range . The concept of a function is fundamental to virtu inv on G. We write f-1 for the inverse inv(f) of f. Then G is a groupoid if:

The relation between this definitions is as follows: Given a groupoid in the category-theoretic sense, let G be the disjoint union of all of the sets G(x,y). Then inv and comp become partially defined operations on G, and inv will in fact be defined everywhere. Explicit reference to G0 (and hence to id) can be dropped.

On the other hand, given a groupoid in the algebraic sense, let G0 be the set of all elements of the form ff-1 for some element f of G. In other words, the objects are identified with the identity morphisms, and idx is just x. Let G(x,y) be the set all elements f such that yfx is defined. Then inv and comp break up into several functions on the various G(x,y).

While we have referred to sets in the definitions above, one may instead want to use classes, in the same way as for other categories.



Read more »

Non User