Groupoid
≈ 9 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In mathematics, especially in category theory and homotopy theory, a groupoid (less often Brandt groupoid or virtual group) generalises the notion of group in several equivalent ways. A groupoid can be seen as a: * Group with a partial function replacing the binary operation; * Category in which every morphism is invertible. A category of this sort can be viewed as augmented with a unary operation on the morphisms, called inverse by analogy with group theory. A groupoid where there is only one object is a usual group. In the presence of 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 , , say. Composition is then a total function: , so that . Special cases include: * Setoid: a set that comes with an equivalence relation, * G-set: a set equipped with an action of a group . Groupoids are often used to reason about geometrical objects such as manifolds. introduced groupoids implicitly via Brandt semigroups.
In mathematics, especially in category theory and homotopy theory, a groupoid (less often Brandt groupoid or virtual group) generalises the notion of group in several equivalent ways. A groupoid can be seen as a: Group with a partial function replacing the binary operation; Category in which every morphism is invertible. A category of this sort can be viewed as augmented with a unary operation on the morphisms, called inverse by analogy with group theory. A groupoid where there is only one object is a usual group. In the presence of 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 , , say. Composition is then a total function: , so that . Special cases include: Setoid: a set that comes with an equivalence relation, G-set: a set equipped with an action of a group . Groupoids are often used to reason about geometrical objects such as manifolds. introduced groupoids implicitly via Brandt semigroups. Identity: If a * b is defined, then {{tmath|1= a * b * {b^{-1} } = a }}, and {{tmath|1= {a^{-1} } * a * b = b }}. (The previous two axioms already show that these expressions are defined and unambiguous.) Two convenient properties follow from these axioms: , If a * b is defined, then . h(g f) = (h g)f for every object , a designated element \mathrm{id}_x of satisfying, for any morphism and ; for each pair of objects , , a function \mathrm{inv}: G(x, y) \rightarrow G(y, x): f \mapsto f^{-1} satisfying, for any : f f^{-1} = \mathrm{id}_y and . If the requirement that inverses exist is removed while keeping everything else, this is then the definition of a category. Thus, a groupoid is a category in which every morphism has an inverse. If is an element of , then is called the source of , written , and is called the target of , written . A groupoid is sometimes denoted as , where G_1 is the set of all morphisms, and the two arrows G_1 \to G_0 represent the source and the target. More generally, one can consider a groupoid object in an arbitrary category admitting finite fiber products. A subgroupoid of G \rightrightarrows X is a subcategory H \rightrightarrows Y that is itself a groupoid. It is called wide or full if it is wide or full as a subcategory, i.e., respectively, if X = Y or G(x,y)=H(x,y) for every . A groupoid morphism is simply a functor between two (category-theoretic) groupoids. Particular kinds of morphisms of groupoids are of interest. A morphism p: E \to B of groupoids is called a fibration if for each object x of E and each morphism b of B starting at p(x) there is a morphism e of E starting at x such that . A fibration is called a covering morphism or covering of groupoids if further such an e is unique. The covering morphisms of groupoids are especially useful because they can be used to model covering maps of spaces. It is also true that the category of covering morphisms of a given groupoid B is equivalent to the category of actions of the groupoid B on sets. If f: X_0 \to Y is a smooth surjective submersion of smooth manifolds, then X_0\times_YX_0 \subset X_0\times X_0 is an equivalence relation since Y has a topology isomorphic to the quotient topology of X_0 under the surjective map of topological spaces. If we write, X_1 = X_0\times_YX_0 then we get a groupoid X_1 \rightrightarrows X_0, which is sometimes called the banal groupoid of a surjective submersion of smooth manifolds. If we relax the reflexivity requirement and consider partial equivalence relations, then it becomes possible to consider semidecidable notions of equivalence on computable realisers for sets. This allows groupoids to be used as a computable approximation to set theory, called PER models. Considered as a category, PER models are a cartesian closed category with natural numbers object and subobject classifier, giving rise to the effective topos introduced by Martin Hyland. A Čech groupoid p. 5 is a special kind of groupoid associated to an equivalence relation given by an open cover \mathcal{U} = \{U_i\}_{i\in I} of some manifold . Its objects are given by the disjoint union \mathcal{G}_0 = \coprod U_i , and its arrows are the intersections \mathcal{G}_1 = \coprod U_{ij} . The source and target maps are then given by the induced maps \begin{align} s = \phi_j: U_{ij} \to U_j\\ t = \phi_i: U_{ij} \to U_i \end{align} and the inclusion map \varepsilon: U_i \to U_{ii} giving the structure of a groupoid. In fact, this can be further extended by setting \mathcal{G}_n = \mathcal{G}_1\times_{\mathcal{G}_0} \cdots \times_{\mathcal{G}_0}\mathcal{G}_1 as the n -iterated fiber product where the \mathcal{G}_n represents n -tuples of composable arrows. The structure map of the fiber product is implicitly the target map, since \begin{matrix} U_{ijk} & \to & U_{ij} \\ \downarrow & & \downarrow \\ U_{ik} & \to & U_{i} \end{matrix} is a cartesian diagram where the maps to U_i are the target maps. This construction can be seen as a model for some -groupoids. Also, another artifact of this construction is -cocycles [\sigma] \in \check{H}^k(\mathcal{U}, \underline{A}) for some constant sheaf of abelian groups can be represented as a function \sigma:\coprod U_{i_1\cdots i_k} \to A giving an explicit representation of cohomology classes. More explicitly, the action groupoid is a small category with \mathrm{ob}(C)=X and \mathrm{hom}(C)=G\times X and with source and target maps s(g,x) = x and . It is often denoted G \ltimes X (or X\rtimes G for a right action). Multiplication (or composition) in the groupoid is then , which is defined provided . For x in , the vertex group consists of those (g,x) with , which is just the isotropy subgroup at x for the given action (which is why vertex groups are also called isotropy groups). Similarly, the orbits of the action groupoid are the orbit of the group action, and the groupoid is transitive if and only if the group action is transitive. Another way to describe G -sets is the functor category , where \mathrm{Gr} is the groupoid (category) with one element and isomorphic to the group . Indeed, every functor F of this category defines a set X=F(\mathrm{Gr}) and for every g in G (i.e. for every morphism in ) induces a bijection F_g : . The categorical structure of the functor F assures us that F defines a G -action on the set . The (unique) representable functor F : \mathrm{Gr} \to \mathrm{Set} is the Cayley representation of . In fact, this functor is isomorphic to \mathrm{Hom}(\mathrm{Gr},-) and so sends \mathrm{ob}(\mathrm{Gr}) to the set \mathrm{Hom}(\mathrm{Gr},\mathrm{Gr}) which is by definition the "set" G and the morphism g of \mathrm{Gr} (i.e. the element g of ) to the permutation F_g of the set . We deduce from the Yoneda embedding that the group G is isomorphic to the group , a subgroup of the group of permutations of . Consider the group action of \Z/2\Z on the finite set X = \{-2, -1, 0, 1, 2\} where 1 acts by taking each number to its negative, so -2 \mapsto 2 and . The quotient groupoid [X/G] is the set of equivalence classes from this group action , and [0] has a group action of \Z/2\Z on it. t(c_1 + c_0) = d(c_1) + c_0. Of course, if the abelian category is the category of coherent sheaves on a scheme, then this construction can be used to form a presheaf of groupoids.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1377919483 under CC BY-SA 4.0; modifications have been made.