Inmathematics, especially incategory theory andhomotopy theory, agroupoid (less oftenBrandt groupoid orvirtual group) generalises the notion ofgroup in several equivalent ways. A groupoid can be seen as a:
In the presence ofdependent typing, a category in general can be viewed as a typedmonoid, and similarly, a groupoid can be viewed as simply a typed group. The morphisms take one from one object to another, and form a dependent family of types, thus morphisms might be typed,, say. Composition is then a total function:, so that.
Special cases include:
Groupoids are often used to reason aboutgeometrical objects such asmanifolds.Heinrich Brandt (1927) introduced groupoids implicitly viaBrandt semigroups.[2]
A groupoid can be viewed as an algebraic structure consisting of a set with a binarypartial function[citation needed].Precisely, it is a non-empty set with aunary operation, and apartial function. Here is not abinary operation because it is not necessarily defined for all pairs of elements of. The precise conditions under which is defined are not articulated here and vary by situation.
The operations and−1 have the following axiomatic properties: For all,, and in,
Two easy and convenient properties follow from these axioms:
A groupoid is asmall category in which everymorphism is anisomorphism, i.e., invertible.[1] More explicitly, a groupoid is a set ofobjects with
Iff is an element ofG(x,y), thenx is called thesource off, writtens(f), andy is called thetarget off, writtent(f).
A groupoidG is sometimes denoted as, where is the set of all morphisms, and the two arrows represent the source and the target.
More generally, one can consider agroupoid object in an arbitrary category admitting finite fiber products.
The algebraic and category-theoretic definitions are equivalent, as we now show. Given a groupoid in the category-theoretic sense, letG be thedisjoint union of all of the setsG(x,y) (i.e. the sets of morphisms fromx toy). Then and become partial operations onG, and will in fact be defined everywhere. We define ∗ to be and−1 to be, which gives a groupoid in the algebraic sense. Explicit reference toG0 (and hence to) can be dropped.
Conversely, given a groupoidG in the algebraic sense, define an equivalence relation on its elements by iffa ∗a−1 =b ∗b−1. LetG0 be the set of equivalence classes of, i.e.. Denotea ∗a−1 by if with.
Now define as the set of all elementsf such that exists. Given and, their composite is defined as. To see that this is well defined, observe that since and exist, so does. The identity morphism onx is then, and the category-theoretic inverse off isf−1.
Sets in the definitions above may be replaced withclasses, as is generally the case in category theory.
Given a groupoidG, thevertex groups orisotropy groups orobject groups inG are the subsets of the formG(x,x), wherex is any object ofG. It follows easily from the axioms above that these are indeed groups, as every pair of elements is composable and inverses are in the same vertex group.
Theorbit of a groupoidG at a point is given by the set containing every point that can be joined to x by a morphism in G. If two points and are in the same orbits, their vertex groups and areisomorphic: if is any morphism from to, then the isomorphism is given by the mapping.
Orbits form a partition of the set X, and a groupoid is calledtransitive if it has only one orbit (equivalently, if it isconnected as a category). In that case, all the vertex groups are isomorphic (on the other hand, this is not a sufficient condition for transitivity; see the sectionbelow for counterexamples).
Asubgroupoid of is asubcategory that is itself a groupoid. It is calledwide orfull if it iswide orfull as a subcategory, i.e., respectively, if or for every.
Agroupoid morphism is simply a functor between two (category-theoretic) groupoids.
Particular kinds of morphisms of groupoids are of interest. A morphism of groupoids is called afibration if for each object of and each morphism of starting at there is a morphism of starting at such that. A fibration is called acovering morphism orcovering of groupoids if further such an is unique. The covering morphisms of groupoids are especially useful because they can be used to modelcovering maps of spaces.[4]
It is also true that the category of covering morphisms of a given groupoid is equivalent to the category of actions of the groupoid on sets.
Given atopological space, let be the set. The morphisms from the point to the point areequivalence classes ofcontinuouspaths from to, with two paths being equivalent if they arehomotopic.Two such morphisms are composed by first following the first path, then the second; the homotopy equivalence guarantees that this composition isassociative. This groupoid is called thefundamental groupoid of, denoted (or sometimes,).[5] The usual fundamental group is then the vertex group for the point.
The orbits of the fundamental groupoid are the path-connected components of. Accordingly, the fundamental groupoid of apath-connected space is transitive, and we recover the known fact that the fundamental groups at any base point are isomorphic. Moreover, in this case, the fundamental groupoid and the fundamental groups areequivalent as categories (see the sectionbelow for the general theory).
An important extension of this idea is to consider the fundamental groupoid where is a chosen set of "base points". Here is a (full) subgroupoid of, where one considers only paths whose endpoints belong to. The set may be chosen according to the geometry of the situation at hand.
If is asetoid, i.e. a set with anequivalence relation, then a groupoid "representing" this equivalence relation can be formed as follows:
The vertex groups of this groupoid are always trivial; moreover, this groupoid is in general not transitive and its orbits are precisely the equivalence classes. There are two extreme examples:
A Čech groupoid[6]p. 5 is a special kind of groupoid associated to an equivalence relation given by an open cover of some manifold. Its objects are given by the disjoint unionand its arrows are the intersections
The source and target maps are then given by the induced maps
and the inclusion map
giving the structure of a groupoid. In fact, this can be further extended by setting
as the-iterated fiber product where the represents-tuples of composable arrows. The structure map of the fiber product is implicitly the target map, since
is a cartesian diagram where the maps to are the target maps. This construction can be seen as a model for some∞-groupoids. Also, another artifact of this construction isk-cocycles
for some constantsheaf of abelian groups can be represented as a function
giving an explicit representation of cohomology classes.
If thegroup acts on the set, then we can form theaction groupoid (ortransformation groupoid) representing thisgroup action as follows:
More explicitly, theaction groupoid is a small category with and and with source and target maps and. It is often denoted (or for a right action). Multiplication (or composition) in the groupoid is then, which is defined provided.
For in, the vertex group consists of those with, which is just theisotropy subgroup at for the given action (which is why vertex groups are also called isotropy groups). Similarly, the orbits of the action groupoid are theorbit of the group action, and the groupoid is transitive if and only if the group action istransitive.
Another way to describe-sets is thefunctor category, where is the groupoid (category) with one element andisomorphic to the group. Indeed, every functor of this category defines a set and for every in (i.e. for every morphism in) induces abijection :. The categorical structure of the functor assures us that defines a-action on the set. The (unique)representable functor is theCayley representation of. In fact, this functor is isomorphic to and so sends to the set which is by definition the "set" and the morphism of (i.e. the element of) to the permutation of the set. We deduce from theYoneda embedding that the group is isomorphic to the group, asubgroup of the group ofpermutations of.
Consider the group action of on the finite set where 1 acts by taking each number to its negative, so and. The quotient groupoid is the set of equivalence classes from this group action, and has a group action of on it.
Any finite group that maps to gives a group action on theaffine space (since this is the group of automorphisms). Then, a quotient groupoid can be of the form, which has one point with stabilizer at the origin. Examples like these form the basis for the theory oforbifolds. Another commonly studied family of orbifolds areweighted projective spaces and subspaces of them, such asCalabi–Yau orbifolds.
Given a diagram of groupoids with groupoid morphisms
where and, we can form the groupoid whose objects are triples, where,, and in. Morphisms can be defined as a pair of morphisms where and such that for triples, there is a commutative diagram in of, and the.[7]
A two term complex
of objects in aconcreteAbelian category can be used to form a groupoid. It has as objects the set and as arrows the set; the source morphism is just the projection onto while the target morphism is the addition of projection onto composed with and projection onto. That is, given, we have
Of course, if the abelian category is the category ofcoherent sheaves on a scheme, then this construction can be used to form apresheaf of groupoids.
While puzzles such as theRubik's Cube can be modeled using group theory (seeRubik's Cube group), certain puzzles are better modeled as groupoids.[8]
The transformations of thefifteen puzzle form a groupoid (not a group, as not all moves can be composed).[9][10][11] Thisgroupoid acts on configurations.
TheMathieu groupoid is a groupoid introduced byJohn Horton Conway acting on 13 points such that the elements fixing a point form a copy of theMathieu group M12.
Total | Associative | Identity | Divisible | Commutative | |
---|---|---|---|---|---|
Partial magma | Unneeded | Unneeded | Unneeded | Unneeded | Unneeded |
Semigroupoid | Unneeded | Required | Unneeded | Unneeded | Unneeded |
Small category | Unneeded | Required | Required | Unneeded | Unneeded |
Groupoid | Unneeded | Required | Required | Required | Unneeded |
Commutativegroupoid | Unneeded | Required | Required | Required | Required |
Magma | Required | Unneeded | Unneeded | Unneeded | Unneeded |
Commutativemagma | Required | Unneeded | Unneeded | Unneeded | Required |
Quasigroup | Required | Unneeded | Unneeded | Required | Unneeded |
Commutativequasigroup | Required | Unneeded | Unneeded | Required | Required |
Unital magma | Required | Unneeded | Required | Unneeded | Unneeded |
Commutativeunital magma | Required | Unneeded | Required | Unneeded | Required |
Loop | Required | Unneeded | Required | Required | Unneeded |
Commutativeloop | Required | Unneeded | Required | Required | Required |
Semigroup | Required | Required | Unneeded | Unneeded | Unneeded |
Commutativesemigroup | Required | Required | Unneeded | Unneeded | Required |
Associativequasigroup | Required | Required | Unneeded | Required | Unneeded |
Commutative-and-associativequasigroup | Required | Required | Unneeded | Required | Required |
Monoid | Required | Required | Required | Unneeded | Unneeded |
Commutative monoid | Required | Required | Required | Unneeded | Required |
Group | Required | Required | Required | Required | Unneeded |
Abelian group | Required | Required | Required | Required | Required |
If a groupoid has only one object, then the set of its morphisms forms agroup. Using the algebraic definition, such a groupoid is literally just a group.[12] Many concepts ofgroup theory generalize to groupoids, with the notion offunctor replacing that ofgroup homomorphism.
Every transitive/connected groupoid - that is, as explained above, one in which any two objects are connected by at least one morphism - is isomorphic to an action groupoid (as defined above). By transitivity, there will only be oneorbit under the action.
Note that the isomorphism just mentioned is not unique, and there is nonatural choice. Choosing such an isomorphism for a transitive groupoid essentially amounts to picking one object, agroup isomorphism from to, and for each other than, a morphism in from to.
If a groupoid is not transitive, then it is isomorphic to adisjoint union of groupoids of the above type, also called itsconnected components (possibly with different groups and sets for each connected component).
In category-theoretic terms, each connected component of a groupoid isequivalent (but notisomorphic) to a groupoid with a single object, that is, a single group. Thus any groupoid is equivalent to amultiset of unrelated groups. In other words, for equivalence instead of isomorphism, one does not need to specify the sets, but only the groups. For example,
The collapse of a groupoid into a mere collection of groups loses some information, even from a category-theoretic point of view, because it is notnatural. Thus when groupoids arise in terms of other structures, as in the above examples, it can be helpful to maintain the entire groupoid. Otherwise, one must choose a way to view each in terms of a single group, and this choice can be arbitrary. In the example fromtopology, one would have to make a coherent choice of paths (or equivalence classes of paths) from each point to each point in the same path-connected component.
As a more illuminating example, the classification of groupoids with oneendomorphism does not reduce to purely group theoretic considerations. This is analogous to the fact that the classification ofvector spaces with one endomorphism is nontrivial.
Morphisms of groupoids come in more kinds than those of groups: we have, for example,fibrations,covering morphisms,universal morphisms, andquotient morphisms. Thus a subgroup of a group yields an action of on the set ofcosets of in and hence a covering morphism from, say, to, where is a groupoid withvertex groups isomorphic to. In this way, presentations of the group can be "lifted" to presentations of the groupoid, and this is a useful way of obtaining information about presentations of the subgroup. For further information, see the books by Higgins and by Brown in the References.
The category whose objects are groupoids and whose morphisms are groupoid morphisms is called thegroupoid category, or thecategory of groupoids, and is denoted byGrpd.
The categoryGrpd is, like the category of small categories,Cartesian closed: for any groupoids we can construct a groupoid whose objects are the morphisms and whose arrows are the natural equivalences of morphisms. Thus if are just groups, then such arrows are the conjugacies of morphisms. The main result is that for any groupoids there is a natural bijection
This result is of interest even if all the groupoids are just groups.
Another important property ofGrpd is that it is bothcomplete andcocomplete.
The inclusion has both a left and a rightadjoint:
Here, denotes thelocalization of a category that inverts every morphism, and denotes the subcategory of all isomorphisms.
Thenerve functor embedsGrpd as a full subcategory of the category of simplicial sets. The nerve of a groupoid is always aKan complex.
The nerve has a left adjoint
Here, denotes the fundamental groupoid of the simplicial set.
There is an additional structure which can be derived from groupoids internal to the category of groupoids,double-groupoids.[13][14] BecauseGrpd is a 2-category, these objects form a 2-category instead of a 1-category since there is extra structure. Essentially, these are groupoids with functors
and an embedding given by an identity functor
One way to think about these 2-groupoids is they contain objects, morphisms, and squares which can compose together vertically and horizontally. For example, given squares
and
with the same morphism, they can be vertically conjoined giving a diagram
which can be converted into another square by composing the vertical arrows. There is a similar composition law for horizontal attachments of squares.
When studying geometrical objects, the arising groupoids often carry atopology, turning them intotopological groupoids, or even somedifferentiable structure, turning them intoLie groupoids. These last objects can be also studied in terms of their associatedLie algebroids, in analogy to the relation betweenLie groups andLie algebras.
Groupoids arising from geometry often possess further structures which interact with the groupoid multiplication. For instance, inPoisson geometry one has the notion of asymplectic groupoid, which is a Lie groupoid endowed with a compatiblesymplectic form. Similarly, one can have groupoids with a compatibleRiemannian metric, orcomplex structure, etc.