nLab
Dwyer-Kan loop groupoid

Dywer–Kan loop groupoid

Idea

The Dwyer–Kan loop groupoid of a simplicial set K is a simplically enriched groupoid whose objects are the vertices of K and the simplicial set of paths between two such picks up the composable ‘strings’ of higher dimensional simplices where the zeroth vertex is thought of as the domain vertex and the first vertex as the codomain.

Definition

The loop groupoid functor of Dwyer and Kan is a functor

G:SimpSetSimpSetGroupoid,G: \Simp\Set \to \Simp\Set\Groupoid,

which takes the simplicial set K to the simplicial groupoid GK, where (GK) n is the free groupoid on the quiver given by a pair of arrows

s,t:K n+1K 0,s,t: K_{n+1}\rightarrow K_0,

where the two functions, s, source, and t, target, are s=(d 1) n+1 and t=d 0(d 2) n with relations s 0x=id for xK n.

The face and degeneracy maps are given on generators by

  • s i GK(x)=s i+1 K(x),
  • d i GK(x)=d i+1 K(x), for xK n+1, 1<in, and
  • d 0 GK(x)=(d 0 K(x)) 1(d 1 K(x)).

Remarks

  • This simplicial groupoid is a simplicially enriched groupoid, as the face and degeneracy operators are constant on the objects.

  • The loop groupoid functor has a right adjoint, W¯, called the (simplicial) classifying space functor. This is given in more detail in the entry on simplicial group.

  • The original reference is

    • W. G. Dwyer and D. M. Kan, Homotopy theory and simplicial groupoids, Nederl. Akad. Wetensch. Indag. Math., 46, (1984), 379 – 385,

    but beware, there are some typographic errors in key formula, so more recent sources should be compared with it as a check.

Revised on February 13, 2011 20:02:37 by Toby Bartels (75.88.68.70)