Movatterモバイル変換


[0]ホーム

URL:


Jump to content
WikipediaThe Free Encyclopedia
Search

Groupoid

From Wikipedia, the free encyclopedia
Category where every morphism is invertible; generalization of a group
This article is about groupoids in category theory. For the algebraic structure with a single binary operation, seemagma (algebra).

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 typedg:AB{\displaystyle g:A\rightarrow B},h:BC{\displaystyle h:B\rightarrow C}, say. Composition is then a total function::(BC)(AB)(AC){\displaystyle \circ :(B\rightarrow C)\rightarrow (A\rightarrow B)\rightarrow (A\rightarrow C)}, so thathg:AC{\displaystyle h\circ g:A\rightarrow C}.

Special cases include:

Groupoids are often used to reason aboutgeometrical objects such asmanifolds.Heinrich Brandt (1927) introduced groupoids implicitly viaBrandt semigroups.[2]

Definitions

[edit]

Algebraic

[edit]

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 setG{\displaystyle G} with aunary operation1:GG{\displaystyle {}^{-1}:G\to G}, and apartial function:G×GG{\displaystyle *:G\times G\rightharpoonup G}. Here{\displaystyle *} is not abinary operation because it is not necessarily defined for all pairs of elements ofG{\displaystyle G}. The precise conditions under which{\displaystyle *} is defined are not articulated here and vary by situation.

The operations{\displaystyle \ast } and−1 have the following axiomatic properties: For alla{\displaystyle a},b{\displaystyle b}, andc{\displaystyle c} inG{\displaystyle G},

  1. Associativity: Ifab{\displaystyle a*b} andbc{\displaystyle b*c} are defined, then(ab)c{\displaystyle (a*b)*c} anda(bc){\displaystyle a*(b*c)} are defined and are equal. Conversely, if one of(ab)c{\displaystyle (a*b)*c} ora(bc){\displaystyle a*(b*c)} is defined, then they are both defined (and they are equal to each other), andab{\displaystyle a*b} andbc{\displaystyle b*c} are also defined.
  2. Inverse:a1a{\displaystyle a^{-1}*a} andaa1{\displaystyle a*{a^{-1}}} are always defined.
  3. Identity: Ifab{\displaystyle a*b} is defined, thenabb1=a{\displaystyle a*b*{b^{-1}}=a}, anda1ab=b{\displaystyle {a^{-1}}*a*b=b}. (The previous two axioms already show that these expressions are defined and unambiguous.)

Two easy and convenient properties follow from these axioms:

Category-theoretic

[edit]

A groupoid is asmall category in which everymorphism is anisomorphism, i.e., invertible.[1] More explicitly, a groupoidG{\displaystyle G} is a setG0{\displaystyle G_{0}} 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 asG1G0{\displaystyle G_{1}\rightrightarrows G_{0}}, whereG1{\displaystyle G_{1}} is the set of all morphisms, and the two arrowsG1G0{\displaystyle G_{1}\to G_{0}} represent the source and the target.

More generally, one can consider agroupoid object in an arbitrary category admitting finite fiber products.

Comparing the definitions

[edit]

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). Thencomp{\displaystyle \mathrm {comp} } andinv{\displaystyle \mathrm {inv} } become partial operations onG, andinv{\displaystyle \mathrm {inv} } will in fact be defined everywhere. We define ∗ to becomp{\displaystyle \mathrm {comp} } and−1 to beinv{\displaystyle \mathrm {inv} }, which gives a groupoid in the algebraic sense. Explicit reference toG0 (and hence toid{\displaystyle \mathrm {id} }) can be dropped.

Conversely, given a groupoidG in the algebraic sense, define an equivalence relation{\displaystyle \sim } on its elements byab{\displaystyle a\sim b} iffaa−1 =bb−1. LetG0 be the set of equivalence classes of{\displaystyle \sim }, i.e.G0:=G/{\displaystyle G_{0}:=G/\!\!\sim }. Denoteaa−1 by1x{\displaystyle 1_{x}} ifaG{\displaystyle a\in G} withxG0{\displaystyle x\in G_{0}}.

Now defineG(x,y){\displaystyle G(x,y)} as the set of all elementsf such that1xf1y{\displaystyle 1_{x}*f*1_{y}} exists. GivenfG(x,y){\displaystyle f\in G(x,y)} andgG(y,z){\displaystyle g\in G(y,z)}, their composite is defined asgf:=fgG(x,z){\displaystyle gf:=f*g\in G(x,z)}. To see that this is well defined, observe that since(1xf)1y{\displaystyle (1_{x}*f)*1_{y}} and1y(g1z){\displaystyle 1_{y}*(g*1_{z})} exist, so does(1xf1y)(g1z)=fg{\displaystyle (1_{x}*f*1_{y})*(g*1_{z})=f*g}. The identity morphism onx is then1x{\displaystyle 1_{x}}, 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.

Vertex groups and orbits

[edit]

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 pointxX{\displaystyle x\in X} is given by the sets(t1(x))X{\displaystyle s(t^{-1}(x))\subseteq X} containing every point that can be joined to x by a morphism in G. If two pointsx{\displaystyle x} andy{\displaystyle y} are in the same orbits, their vertex groupsG(x){\displaystyle G(x)} andG(y){\displaystyle G(y)} areisomorphic: iff{\displaystyle f} is any morphism fromx{\displaystyle x} toy{\displaystyle y}, then the isomorphism is given by the mappinggfgf1{\displaystyle g\to fgf^{-1}}.

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).

Subgroupoids and morphisms

[edit]

Asubgroupoid ofGX{\displaystyle G\rightrightarrows X} is asubcategoryHY{\displaystyle H\rightrightarrows Y} that is itself a groupoid. It is calledwide orfull if it iswide orfull as a subcategory, i.e., respectively, ifX=Y{\displaystyle X=Y} orG(x,y)=H(x,y){\displaystyle G(x,y)=H(x,y)} for everyx,yY{\displaystyle x,y\in Y}.

Agroupoid morphism is simply a functor between two (category-theoretic) groupoids.

Particular kinds of morphisms of groupoids are of interest. A morphismp:EB{\displaystyle p:E\to B} of groupoids is called afibration if for each objectx{\displaystyle x} ofE{\displaystyle E} and each morphismb{\displaystyle b} ofB{\displaystyle B} starting atp(x){\displaystyle p(x)} there is a morphisme{\displaystyle e} ofE{\displaystyle E} starting atx{\displaystyle x} such thatp(e)=b{\displaystyle p(e)=b}. A fibration is called acovering morphism orcovering of groupoids if further such ane{\displaystyle e} 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 groupoidB{\displaystyle B} is equivalent to the category of actions of the groupoidB{\displaystyle B} on sets.

Examples

[edit]

Topology

[edit]
Main article:Fundamental groupoid

Given atopological spaceX{\displaystyle X}, letG0{\displaystyle G_{0}} be the setX{\displaystyle X}. The morphisms from the pointp{\displaystyle p} to the pointq{\displaystyle q} areequivalence classes ofcontinuouspaths fromp{\displaystyle p} toq{\displaystyle q}, 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 ofX{\displaystyle X}, denotedπ1(X){\displaystyle \pi _{1}(X)} (or sometimes,Π1(X){\displaystyle \Pi _{1}(X)}).[5] The usual fundamental groupπ1(X,x){\displaystyle \pi _{1}(X,x)} is then the vertex group for the pointx{\displaystyle x}.

The orbits of the fundamental groupoidπ1(X){\displaystyle \pi _{1}(X)} are the path-connected components ofX{\displaystyle X}. 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π1(X,A){\displaystyle \pi _{1}(X,A)} whereAX{\displaystyle A\subset X} is a chosen set of "base points". Hereπ1(X,A){\displaystyle \pi _{1}(X,A)} is a (full) subgroupoid ofπ1(X){\displaystyle \pi _{1}(X)}, where one considers only paths whose endpoints belong toA{\displaystyle A}. The setA{\displaystyle A} may be chosen according to the geometry of the situation at hand.

Equivalence relation

[edit]

IfX{\displaystyle X} is asetoid, i.e. a set with anequivalence relation{\displaystyle \sim }, 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:

Examples

[edit]

Čech groupoid

[edit]
See also:Simplicial manifold andNerve of a covering

A Čech groupoid[6]p. 5 is a special kind of groupoid associated to an equivalence relation given by an open coverU={Ui}iI{\displaystyle {\mathcal {U}}=\{U_{i}\}_{i\in I}} of some manifoldX{\displaystyle X}. Its objects are given by the disjoint unionG0=Ui,{\displaystyle {\mathcal {G}}_{0}=\coprod U_{i},}and its arrows are the intersectionsG1=Uij.{\displaystyle {\mathcal {G}}_{1}=\coprod U_{ij}.}

The source and target maps are then given by the induced maps

s=ϕj:UijUjt=ϕi:UijUi{\displaystyle {\begin{aligned}s=\phi _{j}:U_{ij}\to U_{j}\\t=\phi _{i}:U_{ij}\to U_{i}\end{aligned}}}

and the inclusion map

ε:UiUii{\displaystyle \varepsilon :U_{i}\to U_{ii}}

giving the structure of a groupoid. In fact, this can be further extended by setting

Gn=G1×G0×G0G1{\displaystyle {\mathcal {G}}_{n}={\mathcal {G}}_{1}\times _{{\mathcal {G}}_{0}}\cdots \times _{{\mathcal {G}}_{0}}{\mathcal {G}}_{1}}

as then{\displaystyle n}-iterated fiber product where theGn{\displaystyle {\mathcal {G}}_{n}} representsn{\displaystyle n}-tuples of composable arrows. The structure map of the fiber product is implicitly the target map, since

UijkUijUikUi{\displaystyle {\begin{matrix}U_{ijk}&\to &U_{ij}\\\downarrow &&\downarrow \\U_{ik}&\to &U_{i}\end{matrix}}}

is a cartesian diagram where the maps toUi{\displaystyle U_{i}} are the target maps. This construction can be seen as a model for some∞-groupoids. Also, another artifact of this construction isk-cocycles

[σ]Hˇk(U,A_){\displaystyle [\sigma ]\in {\check {H}}^{k}({\mathcal {U}},{\underline {A}})}

for some constantsheaf of abelian groups can be represented as a function

σ:Ui1ikA{\displaystyle \sigma :\coprod U_{i_{1}\cdots i_{k}}\to A}

giving an explicit representation of cohomology classes.

Group action

[edit]

If thegroupG{\displaystyle G} acts on the setX{\displaystyle X}, then we can form theaction groupoid (ortransformation groupoid) representing thisgroup action as follows:

More explicitly, theaction groupoid is a small category withob(C)=X{\displaystyle \mathrm {ob} (C)=X} andhom(C)=G×X{\displaystyle \mathrm {hom} (C)=G\times X} and with source and target mapss(g,x)=x{\displaystyle s(g,x)=x} andt(g,x)=gx{\displaystyle t(g,x)=gx}. It is often denotedGX{\displaystyle G\ltimes X} (orXG{\displaystyle X\rtimes G} for a right action). Multiplication (or composition) in the groupoid is then(h,y)(g,x)=(hg,x){\displaystyle (h,y)(g,x)=(hg,x)}, which is defined providedy=gx{\displaystyle y=gx}.

Forx{\displaystyle x} inX{\displaystyle X}, the vertex group consists of those(g,x){\displaystyle (g,x)} withgx=x{\displaystyle gx=x}, which is just theisotropy subgroup atx{\displaystyle x} 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 describeG{\displaystyle G}-sets is thefunctor category[Gr,Set]{\displaystyle [\mathrm {Gr} ,\mathrm {Set} ]}, whereGr{\displaystyle \mathrm {Gr} } is the groupoid (category) with one element andisomorphic to the groupG{\displaystyle G}. Indeed, every functorF{\displaystyle F} of this category defines a setX=F(Gr){\displaystyle X=F(\mathrm {Gr} )} and for everyg{\displaystyle g} inG{\displaystyle G} (i.e. for every morphism inGr{\displaystyle \mathrm {Gr} }) induces abijectionFg{\displaystyle F_{g}} :XX{\displaystyle X\to X}. The categorical structure of the functorF{\displaystyle F} assures us thatF{\displaystyle F} defines aG{\displaystyle G}-action on the setG{\displaystyle G}. The (unique)representable functorF:GrSet{\displaystyle F:\mathrm {Gr} \to \mathrm {Set} } is theCayley representation ofG{\displaystyle G}. In fact, this functor is isomorphic toHom(Gr,){\displaystyle \mathrm {Hom} (\mathrm {Gr} ,-)} and so sendsob(Gr){\displaystyle \mathrm {ob} (\mathrm {Gr} )} to the setHom(Gr,Gr){\displaystyle \mathrm {Hom} (\mathrm {Gr} ,\mathrm {Gr} )} which is by definition the "set"G{\displaystyle G} and the morphismg{\displaystyle g} ofGr{\displaystyle \mathrm {Gr} } (i.e. the elementg{\displaystyle g} ofG{\displaystyle G}) to the permutationFg{\displaystyle F_{g}} of the setG{\displaystyle G}. We deduce from theYoneda embedding that the groupG{\displaystyle G} is isomorphic to the group{FggG}{\displaystyle \{F_{g}\mid g\in G\}}, asubgroup of the group ofpermutations ofG{\displaystyle G}.

Finite set

[edit]

Consider the group action ofZ/2{\displaystyle \mathbb {Z} /2} on the finite setX={2,1,0,1,2}{\displaystyle X=\{-2,-1,0,1,2\}} where 1 acts by taking each number to its negative, so22{\displaystyle -2\mapsto 2} and11{\displaystyle 1\mapsto -1}. The quotient groupoid[X/G]{\displaystyle [X/G]} is the set of equivalence classes from this group action{[0],[1],[2]}{\displaystyle \{[0],[1],[2]\}}, and[0]{\displaystyle [0]} has a group action ofZ/2{\displaystyle \mathbb {Z} /2} on it.

Quotient variety

[edit]

Any finite groupG{\displaystyle G} that maps toGL(n){\displaystyle GL(n)} gives a group action on theaffine spaceAn{\displaystyle \mathbb {A} ^{n}} (since this is the group of automorphisms). Then, a quotient groupoid can be of the form[An/G]{\displaystyle [\mathbb {A} ^{n}/G]}, which has one point with stabilizerG{\displaystyle G} at the origin. Examples like these form the basis for the theory oforbifolds. Another commonly studied family of orbifolds areweighted projective spacesP(n1,,nk){\displaystyle \mathbb {P} (n_{1},\ldots ,n_{k})} and subspaces of them, such asCalabi–Yau orbifolds.

Fiber product of groupoids

[edit]

Given a diagram of groupoids with groupoid morphisms

XYZ{\displaystyle {\begin{aligned}&&X\\&&\downarrow \\Y&\rightarrow &Z\end{aligned}}}

wheref:XZ{\displaystyle f:X\to Z} andg:YZ{\displaystyle g:Y\to Z}, we can form the groupoidX×ZY{\displaystyle X\times _{Z}Y} whose objects are triples(x,ϕ,y){\displaystyle (x,\phi ,y)}, wherexOb(X){\displaystyle x\in {\text{Ob}}(X)},yOb(Y){\displaystyle y\in {\text{Ob}}(Y)}, andϕ:f(x)g(y){\displaystyle \phi :f(x)\to g(y)} inZ{\displaystyle Z}. Morphisms can be defined as a pair of morphisms(α,β){\displaystyle (\alpha ,\beta )} whereα:xx{\displaystyle \alpha :x\to x'} andβ:yy{\displaystyle \beta :y\to y'} such that for triples(x,ϕ,y),(x,ϕ,y){\displaystyle (x,\phi ,y),(x',\phi ',y')}, there is a commutative diagram inZ{\displaystyle Z} off(α):f(x)f(x){\displaystyle f(\alpha ):f(x)\to f(x')},g(β):g(y)g(y){\displaystyle g(\beta ):g(y)\to g(y')} and theϕ,ϕ{\displaystyle \phi ,\phi '}.[7]

Homological algebra

[edit]

A two term complex

C1 d C0{\displaystyle C_{1}~{\overset {d}{\rightarrow }}~C_{0}}

of objects in aconcreteAbelian category can be used to form a groupoid. It has as objects the setC0{\displaystyle C_{0}} and as arrows the setC1C0{\displaystyle C_{1}\oplus C_{0}}; the source morphism is just the projection ontoC0{\displaystyle C_{0}} while the target morphism is the addition of projection ontoC1{\displaystyle C_{1}} composed withd{\displaystyle d} and projection ontoC0{\displaystyle C_{0}}. That is, givenc1+c0C1C0{\displaystyle c_{1}+c_{0}\in C_{1}\oplus C_{0}}, we have

t(c1+c0)=d(c1)+c0.{\displaystyle t(c_{1}+c_{0})=d(c_{1})+c_{0}.}

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.

Puzzles

[edit]

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.

Mathieu groupoid

[edit]

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.

Relation to groups

[edit]
Group-like structures
TotalAssociativeIdentityDivisibleCommutative
Partial magmaUnneededUnneededUnneededUnneededUnneeded
SemigroupoidUnneededRequiredUnneededUnneededUnneeded
Small categoryUnneededRequiredRequiredUnneededUnneeded
GroupoidUnneededRequiredRequiredRequiredUnneeded
CommutativegroupoidUnneededRequiredRequiredRequiredRequired
MagmaRequiredUnneededUnneededUnneededUnneeded
CommutativemagmaRequiredUnneededUnneededUnneededRequired
QuasigroupRequiredUnneededUnneededRequiredUnneeded
CommutativequasigroupRequiredUnneededUnneededRequiredRequired
Unital magmaRequiredUnneededRequiredUnneededUnneeded
Commutativeunital magmaRequiredUnneededRequiredUnneededRequired
LoopRequiredUnneededRequiredRequiredUnneeded
CommutativeloopRequiredUnneededRequiredRequiredRequired
SemigroupRequiredRequiredUnneededUnneededUnneeded
CommutativesemigroupRequiredRequiredUnneededUnneededRequired
AssociativequasigroupRequiredRequiredUnneededRequiredUnneeded
Commutative-and-associativequasigroupRequiredRequiredUnneededRequiredRequired
MonoidRequiredRequiredRequiredUnneededUnneeded
Commutative monoidRequiredRequiredRequiredUnneededRequired
GroupRequiredRequiredRequiredRequiredUnneeded
Abelian groupRequiredRequiredRequiredRequiredRequired

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)(G,X){\displaystyle (G,X)}. 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 objectx0{\displaystyle x_{0}}, agroup isomorphismh{\displaystyle h} fromG(x0){\displaystyle G(x_{0})} toG{\displaystyle G}, and for eachx{\displaystyle x} other thanx0{\displaystyle x_{0}}, a morphism inG{\displaystyle G} fromx0{\displaystyle x_{0}} tox{\displaystyle x}.

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 groupsG{\displaystyle G} and setsX{\displaystyle X} 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 setsX{\displaystyle X}, but only the groupsG{\displaystyle G}. 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 eachG(x){\displaystyle G(x)} 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 pointp{\displaystyle p} to each pointq{\displaystyle q} 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 subgroupH{\displaystyle H} of a groupG{\displaystyle G} yields an action ofG{\displaystyle G} on the set ofcosets ofH{\displaystyle H} inG{\displaystyle G} and hence a covering morphismp{\displaystyle p} from, say,K{\displaystyle K} toG{\displaystyle G}, whereK{\displaystyle K} is a groupoid withvertex groups isomorphic toH{\displaystyle H}. In this way, presentations of the groupG{\displaystyle G} can be "lifted" to presentations of the groupoidK{\displaystyle K}, and this is a useful way of obtaining information about presentations of the subgroupH{\displaystyle H}. For further information, see the books by Higgins and by Brown in the References.

Category of groupoids

[edit]

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 groupoidsH,K{\displaystyle H,K} we can construct a groupoidGPD(H,K){\displaystyle \operatorname {GPD} (H,K)} whose objects are the morphismsHK{\displaystyle H\to K} and whose arrows are the natural equivalences of morphisms. Thus ifH,K{\displaystyle H,K} are just groups, then such arrows are the conjugacies of morphisms. The main result is that for any groupoidsG,H,K{\displaystyle G,H,K} there is a natural bijection

Grpd(G×H,K)Grpd(G,GPD(H,K)).{\displaystyle \operatorname {Grpd} (G\times H,K)\cong \operatorname {Grpd} (G,\operatorname {GPD} (H,K)).}

This result is of interest even if all the groupoidsG,H,K{\displaystyle G,H,K} are just groups.

Another important property ofGrpd is that it is bothcomplete andcocomplete.

Relation toCat

[edit]

The inclusioni:GrpdCat{\displaystyle i:\mathbf {Grpd} \to \mathbf {Cat} } has both a left and a rightadjoint:

homGrpd(C[C1],G)homCat(C,i(G)){\displaystyle \hom _{\mathbf {Grpd} }(C[C^{-1}],G)\cong \hom _{\mathbf {Cat} }(C,i(G))}
homCat(i(G),C)homGrpd(G,Core(C)){\displaystyle \hom _{\mathbf {Cat} }(i(G),C)\cong \hom _{\mathbf {Grpd} }(G,\mathrm {Core} (C))}

Here,C[C1]{\displaystyle C[C^{-1}]} denotes thelocalization of a category that inverts every morphism, andCore(C){\displaystyle \mathrm {Core} (C)} denotes the subcategory of all isomorphisms.

Relation tosSet

[edit]

Thenerve functorN:GrpdsSet{\displaystyle N:\mathbf {Grpd} \to \mathbf {sSet} } 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

homGrpd(π1(X),G)homsSet(X,N(G)){\displaystyle \hom _{\mathbf {Grpd} }(\pi _{1}(X),G)\cong \hom _{\mathbf {sSet} }(X,N(G))}

Here,π1(X){\displaystyle \pi _{1}(X)} denotes the fundamental groupoid of the simplicial setX{\displaystyle X}.

Groupoids in Grpd

[edit]
Main article:Double groupoid

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 groupoidsG1,G0{\displaystyle {\mathcal {G}}_{1},{\mathcal {G}}_{0}} with functors

s,t:G1G0{\displaystyle s,t:{\mathcal {G}}_{1}\to {\mathcal {G}}_{0}}

and an embedding given by an identity functor

i:G0G1{\displaystyle i:{\mathcal {G}}_{0}\to {\mathcal {G}}_{1}}

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

a{\displaystyle {\begin{matrix}\bullet &\to &\bullet \\\downarrow &&\downarrow \\\bullet &\xrightarrow {a} &\bullet \end{matrix}}} anda{\displaystyle {\begin{matrix}\bullet &\xrightarrow {a} &\bullet \\\downarrow &&\downarrow \\\bullet &\to &\bullet \end{matrix}}}

witha{\displaystyle a} the same morphism, they can be vertically conjoined giving a diagram

a{\displaystyle {\begin{matrix}\bullet &\to &\bullet \\\downarrow &&\downarrow \\\bullet &\xrightarrow {a} &\bullet \\\downarrow &&\downarrow \\\bullet &\to &\bullet \end{matrix}}}

which can be converted into another square by composing the vertical arrows. There is a similar composition law for horizontal attachments of squares.

Groupoids with geometric structures

[edit]

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.

See also

[edit]

Notes

[edit]
  1. ^abDicks & Ventura (1996).The Group Fixed by a Family of Injective Endomorphisms of a Free Group. p. 6.
  2. ^"Brandt semi-group",Encyclopedia of Mathematics,EMS Press, 2001 [1994],ISBN 1-4020-0609-8
  3. ^Proof of first property: from 2. and 3. we obtaina−1 =a−1 *a *a−1 and (a−1)−1 = (a−1)−1 *a−1 * (a−1)−1. Substituting the first into the second and applying 3. two more times yields (a−1)−1 = (a−1)−1 *a−1 *a *a−1 * (a−1)−1 = (a−1)−1 *a−1 *a =a. ✓
    Proof of second property: sincea *b is defined, so is (a *b)−1 *a *b. Therefore (a *b)−1 *a *b *b−1 = (a *b)−1 *a is also defined. Moreover sincea *b is defined, so isa *b *b−1 =a. Thereforea *b *b−1 *a−1 is also defined. From 3. we obtain (a *b)−1 = (a *b)−1 *a *a−1 = (a *b)−1 *a *b *b−1 *a−1 =b−1 *a−1. ✓
  4. ^J.P. May,A Concise Course in Algebraic Topology, 1999, The University of Chicago PressISBN 0-226-51183-9 (see chapter 2)
  5. ^"fundamental groupoid in nLab".ncatlab.org. Retrieved2017-09-17.
  6. ^abBlock, Jonathan; Daenzer, Calder (2009-01-09). "Mukai duality for gerbes with connection".arXiv:0803.1529 [math.QA].
  7. ^"Localization and Gromov-Witten Invariants"(PDF). p. 9.Archived(PDF) from the original on February 12, 2020.
  8. ^An Introduction to Groups, Groupoids and Their Representations: An Introduction; Alberto Ibort, Miguel A. Rodriguez; CRC Press, 2019.
  9. ^Jim Belk (2008)Puzzles, Groups, and Groupoids, The Everything Seminar
  10. ^The 15-puzzle groupoid (1)Archived 2015-12-25 at theWayback Machine, Never Ending Books
  11. ^The 15-puzzle groupoid (2)Archived 2015-12-25 at theWayback Machine, Never Ending Books
  12. ^Mapping a group to the corresponding groupoid with one object is sometimes called delooping, especially in the context ofhomotopy theory, see"delooping in nLab".ncatlab.org. Retrieved2017-10-31..
  13. ^Cegarra, Antonio M.; Heredia, Benjamín A.; Remedios, Josué (2010-03-19). "Double groupoids and homotopy 2-types".arXiv:1003.3820 [math.AT].
  14. ^Ehresmann, Charles (1964)."Catégories et structures : extraits".Séminaire Ehresmann. Topologie et géométrie différentielle.6:1–31.

References

[edit]
Retrieved from "https://en.wikipedia.org/w/index.php?title=Groupoid&oldid=1277874945"
Categories:
Hidden categories:

[8]ページ先頭

©2009-2025 Movatter.jp