typical contexts
The codiscrete groupoid on a set is the groupoid whose objects are the elements of the set and which has a unique morphism for every ordered pair of objects.
This is also called the pair groupoid of and sometimes also the chaotic groupoid (this is explained below), indiscrete groupoid, or coarse groupoid on , in older literature also Brandt groupoid.
(codiscrete groupoid)
For , the codiscrete groupoid of is the groupoid
whose object of objects is
whose objects of morphisms is the Cartesian product of with itself
whose source and target morphism are the two canonical projections out of the product, and whose composition operation is the unique one compatible with this:
Def. manifestly makes sense in the generality of internal groupoids internal to any category with finite limits (in fact only finite products are involved in the definition of codiscrete groupoids).
Every codiscrete groupoid on an inhabited set is contractible: equivalent to the terminal groupoid (the point). More generally, any codiscrete groupoid is equivalent to a truth value.
For a finite set of cardinality , the category algebra of is the algebra of matrices. The contractibility of is reflected in the fact that this algebra is Morita equivalent to the ground ring, which is the category algebra of the point.
This maybe serves to illustrate: even though codiscrete groupoids are pretty trivial, they are not too trivial to be entirely without interest. Often it is useful to have big puffed-up versions of the point available (see cofibrant resolution).
The underlying directed graph of a codiscrete groupoid is a complete graph (in that there is one and only one edge between any ordered pair of vertices).
The 1-category Grpd of groupoids is related to Set by an adjoint quadruple of functors
Here
sends a groupoid to its set of objects.
The right adjoint to this functor sends a set to its codiscrete groupoid according to Def. . To see this, observe the hom-isomorphism that reflects this adjunction:
For Grpd and for Set, a morphism of groupoids (i.e. a functor) of the form
is uniquely determined as soon as its component function
is chose, because for every morphism there is one and only one morphism that it may be sent to, and making this unique choice for each does constitute a functor for every choice of .
This association there gives a natural bijection of hom-sets
and hence witnesses the claimed adjunction
It has been argued in Lawvere 1984 that such codiscrete object-constructions, right adjoint to forgetful functors, deserve to be called “chaotic”.
Correspondingly, nerves of codiscrete groupoids are precisely the codiscrete objects in sSet, regarded as a cohesive topos over Set.
{Example}
(chaotic groupoids as models for universal principal bundles)
For a group, the pair groupoid on is isomorphic
to the action groupoid of the right (say) group action of on itself by right group-multiplication:
The nerve of the latter is equal to the standard incarnation (since we chose right action) of the universal principal simplicial complex :
The residual left multiplication action of on itself makes a -action object internal to Grpd
Since the nerve operation is a right adjoint (this Prop.) it preserves action objects, and the result
is the standard -action on the universal principal simplicial complex of .
The quotient of the group action on yields the delooping groupoid of
While the nerve operation does not in general preserve colimits (this Exp.) it does preserve (by this Exp.) this particular colimit coprojection (1). The resulting Kan fibration
is the universal simplicial principal bundle with structure group regarded as a simplicial group.
Finally, the geometric realization of this into compactly generated topological spaces is the standard model for the universal principal bundle of :
over its classifying space (which here is an Eilenberg-MacLane space, since was assumed to be discrete group – but this was just for simplicitiy of exposition, the analogous discussion applies to the chaotic topological groupoid of a topological group ).
Last revised on March 5, 2024 at 06:24:47. See the history of this page for a list of all contributions to it.