View source for Groupoid

{{About|groupoids in category theory|the algebraic structure with a single binary operation|magma (algebra)}}
<!-- Please see Talk page ("Disambiguation revisited") before modifying -->

In [[mathematics]], especially in [[category theory]] and [[homotopy theory]], a '''groupoid''' (less often '''Brandt groupoid''' or '''virtual group''') generalises the notion of [[group (mathematics)|group]] in several equivalent ways. A groupoid can be seen as a:
*''[[group (mathematics)|Group]]'' with a [[partial function]] replacing the [[binary operation]];
*''[[category theory|Category]]'' in which every [[morphism]] is invertible. A category of this sort can be viewed as augmented with a [[unary operation]], called ''inverse'' by analogy with [[group theory]].<ref name="dicks-ventura-96">{{cite book|author=Dicks & Ventura|year=1996|title=The Group Fixed by a Family of Injective Endomorphisms of a Free Group|url={{Google books|plainurl=y|id=3sWSRRfNFKgC|page=6|text=G has the structure of a graph}}|page=6}}</ref> Notice that a groupoid where there is only one object is a usual group.  

In the presence of [[Dependent_type|dependent typing]], a category in general can be viewed as a typed [[monoid]], 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 <math>g:A \rightarrow B</math>,  <math>h:B \rightarrow C</math>, say. Composition is then a total function: <math>\circ : (B \rightarrow C) \rightarrow (A \rightarrow B) \rightarrow A \rightarrow C </math>, so that <math>h \circ g : A \rightarrow C </math>. 

Special cases include:
*''[[Setoid]]s'': [[Set (mathematics)|sets]] that come with an [[equivalence relation]],
*''[[G-set]]s'': sets equipped with an [[Group action (mathematics)|action]] of a group <math>G</math>.

Groupoids are often used to reason about [[geometrical]] objects such as [[manifold]]s. {{harvs|txt|first=Heinrich |last=Brandt|authorlink=Heinrich Brandt|year=1927}} introduced groupoids implicitly via [[Brandt semigroup]]s.<ref>[http://eom.springer.de/b/b017600.htm Brandt semigroup] in Springer Encyclopaedia of Mathematics - {{ISBN|1-4020-0609-8}}</ref>

== Definitions ==

A groupoid is an algebraic structure <math>(G,\ast)</math> consisting of a non-empty set <math>G</math> and a binary [[partial function]]  '<math>\ast</math>'  defined on <math>G</math>.

=== Algebraic ===

A groupoid is a set <math>G</math> with a [[unary operation]] <math>{}^{-1}:G\to G,</math> and a [[partial function]]  <math>*:G\times G \rightharpoonup G</math>.  Here * is not a [[binary operation]] because it is not necessarily defined for all pairs of elements of <math>G</math>.  The precise conditions under which <math>*</math> is defined are not articulated here and vary by situation.

<math>\ast</math> and <sup>−1</sup> have the following axiomatic properties:  For all <math>a</math>, <math>b</math>, and <math>c</math> in <math>G</math>,
# ''[[Associativity]]'': If <math>a*b</math> and <math>b*c</math> are defined, then <math>(a * b) * c</math> and <math>a * (b * c)</math> are defined and are equal.  Conversely, if one of <math>(a * b) * c</math> and <math>a * (b * c)</math> is defined, then so are both <math>a*b</math> and <math>b*c</math> as well as <math>(a * b) * c</math> = <math>a * (b * c)</math>.
# ''[[Multiplicative inverse|Inverse]]'': <math>a^{-1} * a</math> and <math>a*{a^{-1}}</math> are always defined.
# ''[[Identity (mathematics)|Identity]]'': If <math>a*b</math> is defined, then <math>a*b*{b^{-1}} = a</math>, and <math>{a^{-1}} * a * b = b</math>.  (The previous two axioms already show that these expressions are defined and unambiguous.)

Two easy and convenient properties follow from these axioms:
* <math>(a^{-1})^{-1} = a</math>,
* If <math>a*b</math> is defined, then <math>(a*b)^{-1} = b^{-1} * a^{-1}</math>.<ref>

Proof of first property: from 2. and 3. we obtain ''a''<sup>−1</sup> = ''a''<sup>−1</sup> * ''a'' * ''a''<sup>−1</sup> and (''a''<sup>−1</sup>)<sup>−1</sup> = (''a''<sup>−1</sup>)<sup>−1</sup> * ''a''<sup>−1</sup> * (''a''<sup>−1</sup>)<sup>−1</sup>. Substituting the first into the second and applying 3. two more times yields (''a''<sup>−1</sup>)<sup>−1</sup> = (''a''<sup>−1</sup>)<sup>−1</sup> * ''a''<sup>−1</sup> * ''a'' * ''a''<sup>−1</sup> * (''a''<sup>−1</sup>)<sup>−1</sup> = (''a''<sup>−1</sup>)<sup>−1</sup> * ''a''<sup>−1</sup> * ''a'' = ''a''.  ✓ <br />
Proof of second property: since ''a'' * ''b'' is defined, so is (''a'' * ''b'')<sup>−1</sup> * ''a'' * ''b''.  Therefore (''a'' * ''b'')<sup>−1</sup> * ''a'' * ''b'' * ''b''<sup>−1</sup> = (''a'' * ''b'')<sup>−1</sup> * ''a'' is also defined.  Moreover since ''a'' * ''b'' is defined, so is ''a'' * ''b'' * ''b''<sup>−1</sup> = ''a''.  Therefore ''a'' * ''b'' * ''b''<sup>−1</sup> * ''a''<sup>−1</sup> is also defined.  From 3. we obtain (''a'' * ''b'')<sup>−1</sup> = (''a'' * ''b'')<sup>−1</sup> * ''a'' * ''a''<sup>−1</sup> = (''a'' * ''b'')<sup>−1</sup> * ''a'' * ''b'' * ''b''<sup>−1</sup> * ''a''<sup>−1</sup> = ''b''<sup>−1</sup> * ''a''<sup>−1</sup>.  ✓</ref>

===Category theoretic===
A groupoid is a [[category (mathematics)|small category]] in which every [[morphism]] is an [[isomorphism]], i.e. invertible.<ref name="dicks-ventura-96"/> More precisely, a groupoid ''G'' is:
* A set ''G''<sub>0</sub> of ''objects'';
* For each pair of objects ''x'' and ''y'' in ''G''<sub>0</sub>, there exists a (possibly empty) set ''G''(''x'',''y'') of ''morphisms'' (or ''arrows'') from ''x'' to ''y''. We write ''f'' : ''x'' → ''y'' to indicate that ''f'' is an element of ''G''(''x'',''y'').
* For every object ''x'', a designated element <math>\mathrm{id}_x</math> of ''G''(''x'',''x'');
* For each triple of objects ''x'', ''y'', and ''z'', a [[function (mathematics)|function]] <math>\mathrm{comp}_{x,y,z} : G(y, z)\times G(x, y) \rightarrow G(x, z): (g, f) \mapsto gf</math>;
* For each pair of objects ''x'', ''y'' a function <math>\mathrm{inv}: G(x, y) \rightarrow G(y, x): f \mapsto f^{-1}</math>;

satisfying, for any ''f'' : ''x'' → ''y'', ''g'' : ''y'' → ''z'', and ''h'' : ''z'' → ''w'':
* <math>f\ \mathrm{id}_x = f</math> and <math>\mathrm{id}_y\ f = f</math>;
* <math>(h g) f = h (g f)</math>;
* <math>f f^{-1} = \mathrm{id}_y</math> and <math>f^{-1} f = \mathrm{id}_x</math>.

If ''f'' is an element of ''G''(''x'',''y'') then ''x'' is called the '''source''' of ''f'', written ''s''(''f''), and ''y'' is called the '''target''' of ''f'', written ''t''(''f'').

More generally, one can consider a [[groupoid object]] in an arbitrary category admitting finite fiber products.

===Comparing the definitions===
The algebraic and category-theoretic definitions are equivalent, as we now show. Given a groupoid in the category-theoretic sense, let ''G'' be the [[disjoint union]] of all of the sets ''G''(''x'',''y'') (i.e. the sets of morphisms from ''x'' to ''y''). Then <math>\mathrm{comp}</math> and <math>\mathrm{inv}</math> become partial operations on ''G'', and <math>\mathrm{inv}</math> will in fact be defined everywhere. We define ∗ to be <math>\mathrm{comp}</math> and <sup>−1</sup> to be <math>\mathrm{inv}</math>, which gives a groupoid in the algebraic sense. Explicit reference to ''G''<sub>0</sub> (and hence to <math>\mathrm{id}</math>) can be dropped.

Conversely, given a groupoid ''G'' in the algebraic sense, define an equivalence relation <math>\sim</math> on its elements by
<math>a \sim b</math> iff ''a'' ∗ ''a''<sup>−1</sup> = ''b'' ∗ ''b''<sup>−1</sup>. Let ''G''<sub>0</sub> be the set of equivalence classes of <math>\sim</math>, i.e. <math>G_0:=G/\!\!\sim</math>. Denote  ''a'' ∗ ''a''<sup>−1</sup> by <math>1_x</math> if <math>a\in x</math> with <math>x\in G_0</math>.

Now define <math>G(x, y)</math> as the set of all elements ''f'' such that <math>1_x*f*1_y</math> exists. Given <math>f \in G(x,y)</math> and <math>g \in G(y, z),</math> their composite is defined as <math>gf:=f*g \in G(x,z)</math>. To see that this is well defined, observe that since <math>(1_x*f)*1_y</math> and <math>1_y*(g*1_z)</math> exist, so does <math>(1_x*f*1_y)*(g*1_z)=f*g</math>. The identity morphism on ''x'' is then <math>1_x</math>, and the category-theoretic inverse of ''f'' is ''f''<sup>−1</sup>.

''Sets'' in the definitions above may be replaced with [[class (set theory)|class]]es, as is generally the case in category theory.

===Vertex groups===
Given a groupoid ''G'', the '''vertex groups''' or '''isotropy groups''' or '''object groups''' in ''G'' are the subsets of the form ''G''(''x'',''x''), where ''x'' is any object of ''G''.  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.

===Category of groupoids===
A '''subgroupoid''' is a [[subcategory]] that is itself a groupoid. A '''groupoid morphism''' is simply a functor between two (category-theoretic) groupoids. The category whose objects are groupoids and whose morphisms are groupoid morphisms is called the '''groupoid category''', or the '''category of groupoids''', denoted '''Grpd'''.

It is useful that this category is, like the category of small categories,  [[Cartesian closed]]. That is, we can construct  for any groupoids <math>H,K</math> a groupoid  <math>\operatorname{GPD}(H,K)</math> whose objects are the morphisms <math> H \to K </math> and whose arrows are the natural equivalences  of morphisms. Thus if <math> H,K </math> are just groups, then such arrows are the conjugacies of morphisms. The main result is that for any groupoids <math> G,H,K </math> there is a natural bijection

<math>\operatorname{Grpd}(G \times H, K) \cong \operatorname{Grpd}(G, \operatorname{GPD}(H,K)).</math>

This result is of interest even if all the groupoids <math> G,H,K </math> are just groups.

===Fibrations and coverings===
Particular kinds of morphisms of groupoids are of interest. A morphism <math>p: E \to B</math> of groupoids is called a [[fibration]] if for each object <math>x</math> of <math>E</math> and each morphism <math>b</math> of <math>B</math> starting at <math>p(x)</math> there is a morphism <math>e</math> of <math>E</math> starting at <math>x</math>  such that <math>p(e)=b</math>. A fibration is called a [[covering morphism]] or [[covering of groupoids]] if further such an <math>e</math> is unique. The covering morphisms of groupoids are especially useful because they can be used to model [[covering map]]s of spaces.<ref>J.P. May, ''A Concise Course in Algebraic Topology'', 1999, The University of Chicago Press {{ISBN|0-226-51183-9}} (''see chapter 2'')</ref>

It is also true that the category of covering morphisms of a given groupoid <math>B</math> is equivalent to the category of actions of the groupoid <math>B</math> on sets.

== Examples ==

===Linear algebra===
Given a [[field (algebra)|field]] ''K'', the corresponding '''general linear groupoid''' ''GL''<sub>*</sub>(''K'') consists of all [[matrix inversion|invertible]] [[matrix (mathematics)|matrices]], of any size, whose entries range over ''K''. [[Matrix multiplication]] interprets composition. If ''G'' = ''GL''<sub>*</sub>(''K''), then the set of [[natural number]]s is a [[proper subset]] of ''G''<sub>0</sub>, since for each [[natural number]] ''n'', there is a corresponding [[identity matrix]] of dimension ''n''.  ''G''(''m'',''n'') is [[empty set|empty]] unless ''m''=''n'', in which case it is the set of all ''n''x''n'' invertible matrices.

===Topology===
{{Main|Fundamental groupoid}}
Given a [[topological space]] <math>X</math>, let <math>G_0</math> be the set <math>X</math>. The morphisms from the point <math>p</math> to the point <math>q</math> are [[equivalence class]]es of [[continuous function (topology)|continuous]] [[path (topology)|path]]s from <math>p</math> to <math>q</math>, with two paths being equivalent if they are [[homotopic]].
Two such morphisms are composed by first following the first path, then the second; the homotopy equivalence guarantees that this composition is [[associative]]. This groupoid is called the [[fundamental groupoid]] of <math>X</math>, denoted <math>\pi_1(X)</math> (or sometimes, <math>\Pi_1(X)</math>).<ref>{{Cite web|url=https://ncatlab.org/nlab/show/fundamental+groupoid|title=fundamental groupoid in nLab|website=ncatlab.org|access-date=2017-09-17}}</ref>  The usual fundamental group <math>\pi_1(X,x)</math> is then the vertex group for the point <math>x</math>.

An important extension of this idea is to consider the fundamental groupoid <math>\pi_1(X,A)</math> where <math>A\subset X</math> is a chosen set of "base points". Here, one considers only paths whose endpoints belong to <math>A</math>. <math>\pi_1(X,A)</math> is a sub-groupoid of <math>\pi_1(X)</math>. The set <math>A</math> may be chosen according to the geometry of the situation at hand.

===Equivalence relation===
If <math>X</math> is a set with an [[equivalence relation]] denoted by [[infix]] <math>\sim</math>, then a groupoid "representing" this equivalence relation can be formed as follows:
* The objects of the groupoid are the elements of <math>X</math>;
*For any two elements <math>x</math> and <math>y</math> in <math>X</math>, there is a single morphism from <math>x</math> to <math>y</math> [[if and only if]] <math>x\sim y</math>.

===Group action===
If the [[group (mathematics)|group]] <math>G</math> acts on the set <math>X</math>, then we can form the '''action groupoid''' (or '''transformation groupoid''') representing this [[Group action (mathematics)|group action]] as follows:
*The objects are the elements of <math>X</math>;
*For any two elements <math>x</math> and <math>y</math> in <math>X</math>, the [[morphism]]s from <math>x</math> to <math>y</math> correspond to the elements <math>g</math> of <math>G</math> such that <math>gx = y</math>;
*[[Function composition|Composition]] of morphisms interprets the [[binary operation]] of <math>G</math>.

More explicitly, the ''action groupoid'' is a small category with  <math>\mathrm{ob}(C)=X</math> and <math>\mathrm{hom}(C)=G\times X</math> with source and target maps <math>s(g,x) = x</math> and <math>t(g,x) = gx</math>.  It is often denoted <math>G \ltimes X</math> (or <math>X\rtimes G</math>). Multiplication (or composition) in the groupoid is then <math>(h,y)(g,x) = (hg,x)</math> which is defined provided <math>y=gx</math>.

For <math>x</math> in <math>X</math>, the vertex group consists of those <math>(g,x)</math> with <math>gx=x</math>, which is just the isotropy subgroup at <math>x</math> for the given action (which is why vertex groups are also called isotropy groups).

Another way to describe <math>G</math>-sets is the [[functor category]] <math>[\mathrm{Gr},\mathrm{Set}]</math>, where <math>\mathrm{Gr}</math> is the groupoid (category) with one element and [[isomorphism|isomorphic]] to the group <math>G</math>. Indeed, every functor <math>F</math> of this category defines a set <math>X=F(\mathrm{Gr})</math> and for every <math>g</math> in <math>G</math> (i.e. for every morphism in <math>\mathrm{Gr}</math>) induces a [[bijection]] <math>F_g</math> : <math>X\to X</math>. The categorical structure of the functor <math>F</math> assures us that <math>F</math> defines a <math>G</math>-action on the set <math>G</math>. The (unique) [[representable functor]] <math>F</math> : <math>\mathrm{Gr}</math>→<math>\mathrm{Set}</math> is the [[Cayley's theorem|Cayley representation]] of <math>G</math>. In fact, this functor is isomorphic to <math>\mathrm{Hom}(\mathrm{Gr},-)</math> and so sends <math>\mathrm{ob}(\mathrm{Gr})</math> to the set <math>\mathrm{Hom}(\mathrm{Gr},\mathrm{Gr})</math> which is by definition the "set" <math>G</math> and the morphism <math>g</math> of <math>\mathrm{Gr}</math> (i.e. the element <math>g</math> of <math>G</math>) to the permutation <math>F_g</math> of the set <math>G</math>. We deduce from the [[Yoneda embedding]] that the group <math>G</math> is isomorphic to the group <math>\{F_g\mid g\in G\}</math>, a [[subgroup]] of the group of [[permutation group|permutation]]s of <math>G</math>.

===Fifteen puzzle===

The transformations of the [[fifteen puzzle]] form a groupoid (not a group, as not all moves can be composed).<ref>Jim Belk (2008) [https://cornellmath.wordpress.com/2008/01/27/puzzles-groups-and-groupoids/ Puzzles, Groups, and Groupoids], The Everything Seminar</ref><ref>[http://www.neverendingbooks.org/the-15-puzzle-groupoid-1 The 15-puzzle groupoid (1)], Never Ending Books</ref><ref>[http://www.neverendingbooks.org/the-15-puzzle-groupoid-2 The 15-puzzle groupoid (2)], Never Ending Books</ref> This [[Group action (mathematics)#Variants_and_generalizations|groupoid acts]] on configurations.

===Mathieu groupoid===

The [[Mathieu groupoid]] is a groupoid introduced by [[John Horton Conway]] acting on 13 points such that the elements fixing a point form a copy of the [[Mathieu group]] M<sub>12</sub>.

== Relation to groups ==
{{Group-like structures}}
If a groupoid has only one object, then the set of its morphisms forms a [[group (algebra)|group]]. Using the algebraic definition, such a groupoid is literally just a group.<ref>Mapping a group to the corresponding groupoid with one object is sometimes called delooping, especially in the context of [[Homotopy|homotopy theory]], see {{Cite web|url=https://ncatlab.org/nlab/show/delooping#delooping_of_a_group_to_a_groupoid|title=delooping in nLab|website=ncatlab.org|access-date=2017-10-31}}.</ref> Many concepts of [[group theory]] generalize to groupoids, with the notion of [[functor]] replacing that of [[group homomorphism]].

If <math>x</math> is an object of the groupoid <math>G</math>, then the set of all morphisms from <math>x</math> to <math>x</math> forms a group <math>G(x)</math> (called the vertex group, defined above). If there is a morphism <math>f</math> from <math>x</math> to <math>y</math>, then the groups <math>G(x)</math> and <math>G(y)</math> are [[group isomorphism|isomorphic]], with an isomorphism given by the [[map (mathematics)|mapping]] <math>g\to fgf^{-1}</math>.

Every [[connected (category theory)|connected]] groupoid - that is, one in which any two objects are connected by at least one morphism - is isomorphic to an action groupoid (as defined above) <math>(G, X)</math>. By connectedness, there will only be one [[orbit (group theory)|orbit]] under the action. If the groupoid is not connected, then it is isomorphic to a [[disjoint union]] of groupoids of the above type (possibly with different groups <math>G</math> and sets <math>X</math> for each connected component).

Note that the isomorphism described above is not unique, and there is no [[natural equivalence|natural]] choice. Choosing such an isomorphism for a connected groupoid essentially amounts to picking one object <math>x_0</math>, a [[group isomorphism]] <math>h</math> from <math>G(x_0)</math> to <math>G</math>, and for each <math>x</math> other than <math>x_0</math>, a morphism in <math>G</math> from <math>x_0</math> to <math>x</math>.

In category-theoretic terms, each connected component of a groupoid is [[equivalent categories|equivalent]] (but not [[isomorphic categories|isomorphic]]) to a groupoid with a single object, that is, a single group. Thus any groupoid is equivalent to a [[multiset]] of unrelated groups. In other words, for equivalence instead of isomorphism, one need not specify the sets <math>X</math>, only the groups <math>G</math>.

Consider the examples in the previous section. The general linear groupoid is both equivalent and isomorphic to the disjoint union of the various [[general linear group]]s <math>GL_n(F)</math>. On the other hand:
*The fundamental groupoid of <math>X</math> is equivalent to the collection of the [[fundamental group]]s of each [[path-connected component]] of <math>X</math>, but an isomorphism requires specifying the set of points in each component;
*The set <math>X</math> with the equivalence relation <math>\sim</math> is equivalent (as a groupoid) to one copy of the [[trivial group]] for each [[equivalence class]], but an isomorphism requires specifying what each equivalence class is:
*The set <math>X</math> equipped with an [[Group action (mathematics)|action]] of the group <math>G</math> is equivalent (as a groupoid) to one copy of <math>G</math> for each [[orbit (group theory)|orbit]] of the action, but an [[isomorphism]] requires specifying what set each orbit is.

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 not [[natural (category theory)|natural]]. Thus when groupoids arise in terms of other structures, as in the above examples, it can be helpful to maintain the full groupoid. Otherwise, one must choose a way to view each <math>G(x)</math> in terms of a single group, and this choice can be arbitrary. In our example from [[topology]], you would have to make a coherent choice of paths (or equivalence classes of paths) from each point <math>p</math> to each point <math>q</math> in the same path-connected component.

As a more illuminating example, the classification of groupoids with one [[endomorphism]] does not reduce to purely group theoretic considerations. This is analogous to the fact that the classification of [[vector space]]s with one endomorphism is nontrivial.

Morphisms of groupoids come in more kinds than those of groups: we have, for example,  [[fibration]]s, [[covering morphism]]s, [[universal morphism]]s, and [[quotient morphism]]s. Thus a subgroup <math>H</math> of a group <math>G</math> yields an action of <math>G</math> on the set of [[coset]]s of <math>H</math> in <math>G</math> and hence a covering morphism <math>p</math> from, say, <math>K</math> to <math>G</math>, where <math>K</math> is a groupoid with [[#Vertex groups|vertex group]]s isomorphic to <math>H</math>. In this way, presentations of the group <math>G</math> can be "lifted" to presentations of the groupoid <math>K</math>, and this is a useful way of obtaining information about presentations of the subgroup <math>H</math>. For further information, see the books by Higgins and by Brown in the References.

== Properties of the category Grpd ==

* '''Grpd''' is both complete and cocomplete
* '''Grpd''' is a cartesian closed category

=== Relation to [[Category of small categories|Cat]] ===

The inclusion <math>i : \mathbf{Grpd} \to \mathbf{Cat}</math> has both a left and a right adjoint:

:<math> \hom_{\mathbf{Grpd}}(C[C^{-1}], G) \cong \hom_{\mathbf{Cat}}(C, i(G)) </math>
:<math> \hom_{\mathbf{Cat}}(i(G), C) \cong \hom_{\mathbf{Grpd}}(G, \mathrm{Core}(C)) </math>

Here, <math>C[C^{-1}]</math> denotes the [[localization of a category]] that inverts every morphism, and <math>\mathrm{Core}(C)</math> denotes the subcategory of all isomorphisms.

=== Relation to [[Simplicial set|sSet]] ===

The [[Nerve (category theory)|nerve functor]] <math>N :  \mathbf{Grpd} \to \mathbf{sSet}</math> embeds '''Grpd''' as a full subcategory of the category of simplicial sets. The nerve of a groupoid is always Kan complex.

The nerve has a left adjoint
:<math> \hom_{\mathbf{Grpd}}(\pi_1(X), G) \cong \hom_{\mathbf{sSet}}(X, N(G)) </math>
Here, <math>\pi_1(X)</math> denotes the fundamental groupoid of the simplicial set X.

== Lie groupoids and Lie algebroids ==

When studying geometrical objects, the arising groupoids often carry some [[differentiable structure]], turning them into [[Lie groupoid]]s.
These can be studied in terms of [[Lie algebroid]]s, in analogy to the relation between [[Lie group]]s and [[Lie algebra]]s.

== See also ==
*[[∞-groupoid]]
*[[Homotopy type theory]]
*[[Inverse category]]
*[[groupoid algebra]] (not to be confused with [[algebraic groupoid]])
*[[R-algebroid]]

== Notes ==
{{reflist}}

==References==

*{{citation|title=Über eine Verallgemeinerung des Gruppenbegriffes|journal=Mathematische Annalen 
|volume=96|issue=1 |pages=360–366|year=1927|doi=10.1007/BF01209171|first=H|last=Brandt}}
*Brown, Ronald, 1987, "[https://groupoids.org.uk/pdffiles/groupoidsurvey.pdf From groups to groupoids: a brief survey,]" ''Bull. London Math. Soc.'' '''19''': 113-34. Reviews the history of groupoids up to 1987, starting with the work of Brandt on quadratic forms. The downloadable version updates the many references.
* &mdash;, 2006. ''[http://arquivo.pt/wayback/20160514115224/http://www.bangor.ac.uk/r.brown/topgpds.html Topology and groupoids.]'' Booksurge. Revised and extended edition of a book previously published in 1968 and 1988. Groupoids are introduced in the context of their topological application.
* &mdash;, [https://archive.is/20120723235509/http://www.bangor.ac.uk/r.brown/hdaweb2.htm Higher dimensional group theory ] Explains how the groupoid concept has led to higher-dimensional homotopy groupoids, having applications in [[homotopy theory]] and in group [[cohomology]]. Many references.
* {{citation |last1=Dicks |first1=Warren  |authorlink1= |last2=Ventura |first2=Enric |authorlink2= |title=The group fixed by a family of injective endomorphisms of a free group |series=Mathematical Surveys and Monographs |volume=195 |year=1996 |publisher=AMS Bookstore |location= |isbn=978-0-8218-0564-0 }}
* {{cite journal |last1=Dokuchaev |first1=M. |last2=Exel |first2=R. |last3=Piccione |first3=P. |year=2000 |title=Partial Representations and Partial Group Algebras |journal=Journal of Algebra |volume=226 |issue= |pages=505–532 |publisher=Elsevier |issn=0021-8693 |doi= 10.1006/jabr.1999.8204|url=|arxiv= math/9903129
}}
*F. Borceux, G. Janelidze, 2001, ''[http://www.cup.cam.ac.uk/catalogue/catalogue.asp?isbn=9780521803090 Galois theories.]{{dead link|date=October 2017 |bot=InternetArchiveBot |fix-attempted=yes }}'' Cambridge Univ. Press. Shows how generalisations of [[Galois theory]] lead to [[Galois groupoid]]s.
* [[Ana Cannas da Silva|Cannas da Silva, A.]], and [[Alan Weinstein|A. Weinstein]], ''[http://www.math.ist.utl.pt/~acannas/Books/models_final.pdf Geometric Models for Noncommutative Algebras.]'' Especially Part VI.
*[[Marty Golubitsky|Golubitsky, M.]], Ian Stewart, 2006, "[http://www.ams.org/bull/2006-43-03/S0273-0979-06-01108-6/S0273-0979-06-01108-6.pdf Nonlinear dynamics of networks: the groupoid formalism]", ''Bull. Amer. Math. Soc.'' '''43''': 305-64
* {{springer|title=Groupoid|id=p/g045360}}
* Higgins, P. J., "The fundamental groupoid of a [[graph of groups]]", J. London Math. Soc. (2) 13 (1976) 145—149.
* Higgins, P. J. and Taylor, J., "The fundamental groupoid and the homotopy crossed complex of   an [[orbit space]]",  in Category theory (Gummersbach, 1981), Lecture Notes   in Math., Volume 962. Springer, Berlin (1982), 115—122.
*Higgins, P. J., 1971.  ''Categories and groupoids.'' Van Nostrand Notes in Mathematics. Republished in ''Reprints in Theory and Applications of Categories'', No. 7 (2005) pp.&nbsp;1–195; [http://www.tac.mta.ca/tac/reprints/articles/7/tr7abs.html freely downloadable]. Substantial introduction to [[category theory]] with special emphasis on groupoids. Presents applications of groupoids in group theory, for example to a generalisation of [[Grushko's theorem]], and in topology, e.g. [[fundamental groupoid]].
*Mackenzie, K. C. H., 2005. ''[https://web.archive.org/web/20050310034123/http://www.shef.ac.uk/~pm1kchm/gt.html General theory of Lie groupoids and Lie algebroids.]'' Cambridge Univ. Press.
*Weinstein, Alan, "[http://www.ams.org/notices/199607/weinstein.pdf Groupoids: unifying internal and external symmetry &mdash; A tour through some examples.]" Also available in [http://math.berkeley.edu/~alanw/Groupoids.ps Postscript.], Notices of the AMS, July 1996, pp.&nbsp;744–752.
* Weinstein, Alan, "[https://arxiv.org/abs/math/0208108 The Geometry of Momentum]" (2002)
* R.T. Zivaljevic. "Groupoids in combinatorics&mdash;applications of a theory of local symmetries". In ''Algebraic and geometric combinatorics'', volume 423 of  ''Contemp. Math''., 305–324.  Amer. Math. Soc., Providence, RI (2006)
* {{nlab|id=fundamental+groupoid|title=fundamental groupoid}}
* {{nlab|id=core|title=core}}

[[Category:Algebraic structures]]
[[Category:Category theory]]
[[Category:Homotopy theory]]