<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/default.xsl"?>
<fr:tree xmlns:fr="http://www.forester-notes.org" xmlns:html="http://www.w3.org/1999/xhtml" xmlns:xml="http://www.w3.org/XML/1998/namespace" root="false" base-url="/">
  <fr:frontmatter>
    <fr:authors>
      <fr:author>
        <fr:link href="/eigil-rischel/" title="Eigil Fjeldgren Rischel" uri="https://erischel.com/eigil-rischel/" display-uri="eigil-rischel" type="local">Eigil Fjeldgren Rischel</fr:link>
      </fr:author>
    </fr:authors>
    <fr:date>
      <fr:year>2020</fr:year>
      <fr:month>10</fr:month>
      <fr:day>11</fr:day>
    </fr:date>
    <fr:uri>https://erischel.com/the-homotopy-theory-of-groups/</fr:uri>
    <fr:display-uri>the-homotopy-theory-of-groups</fr:display-uri>
    <fr:route>/the-homotopy-theory-of-groups/</fr:route>
    <fr:title text="The homotopy theory of groups">The homotopy theory of groups</fr:title>
  </fr:frontmatter>
  <fr:mainmatter>
    <html:p>
Context: <fr:link href="https://uni-muenster.sciebo.de/index.php/s/u8SREy5b5QGCGv0/download?path=/Papers&amp;files=Group theory.pdf" type="external">Krause and Nikolaus: Group Theory for Homotopy Theorists</fr:link> (pdf).
Krause and Nikolaus develop group theory using model categories (well, one model category).
This is obviously a joke, but I think it _is_ a very useful pedagogical joke. So I'm going to go through it and try to explain what's happening.
</html:p>
    <fr:tree show-metadata="false">
      <fr:frontmatter>
        <fr:authors>
          <fr:author>
            <fr:link href="/eigil-rischel/" title="Eigil Fjeldgren Rischel" uri="https://erischel.com/eigil-rischel/" display-uri="eigil-rischel" type="local">Eigil Fjeldgren Rischel</fr:link>
          </fr:author>
        </fr:authors>
        <fr:date>
          <fr:year>2020</fr:year>
          <fr:month>10</fr:month>
          <fr:day>11</fr:day>
        </fr:date>
        <fr:title text="Group presentations">Group presentations</fr:title>
      </fr:frontmatter>
      <fr:mainmatter>
        <html:p>
  If you've taken a course on group theory, you've probably learned about _presentations_ of a group.
  Here are some examples:
</html:p>
        <html:p>
  -   <fr:tex display="inline"><![CDATA[\langle  s,r | r^4, s^2 srsr \rangle ]]></fr:tex>
  -   <fr:tex display="inline"><![CDATA[\langle  a, b | \rangle ]]></fr:tex>
  -   <fr:tex display="inline"><![CDATA[\langle  a, b | aba^{-1}b^{-1} \rangle ]]></fr:tex>.
</html:p>
        <html:p>
  On the left of the pipe, we have a set <fr:tex display="inline"><![CDATA[S]]></fr:tex> of _generators_.
  On the right of the pipe, we have a different set <fr:tex display="inline"><![CDATA[R]]></fr:tex> of _relations_ - these are "group words" in the generators, i.e words involving both the generators and their inverses.
  The meaning of such a "presentation" is that it describes a group, namely the quotient of the free group on <fr:tex display="inline"><![CDATA[S]]></fr:tex> by the relations.
</html:p>
        <html:p>
  Every group <fr:tex display="inline"><![CDATA[G]]></fr:tex> has a presentation (in fact, many), for example given by taking <fr:tex display="inline"><![CDATA[S = G]]></fr:tex> and <fr:tex display="inline"><![CDATA[R]]></fr:tex> given by all words which evaluate to <fr:tex display="inline"><![CDATA[1]]></fr:tex> in <fr:tex display="inline"><![CDATA[G]]></fr:tex>. This leads to the idea that one could _define_ group theory out of presentations. This seems to work out well - in fact, given <fr:tex display="inline"><![CDATA[G,H]]></fr:tex> groups, if we take their "canonical" presentations as above, a group homomorphism <fr:tex display="inline"><![CDATA[G \to  H]]></fr:tex> is exactly the same thing as a function <fr:tex display="inline"><![CDATA[G \to  H]]></fr:tex> which takes those words in <fr:tex display="inline"><![CDATA[G]]></fr:tex> which evaluate to <fr:tex display="inline"><![CDATA[1]]></fr:tex> to words in <fr:tex display="inline"><![CDATA[H]]></fr:tex> which evaluate to <fr:tex display="inline"><![CDATA[1]]></fr:tex>.
</html:p>
        <html:p>
  However, this doesn't work in general - most group presentations don't have "enough generators" to represent all group homomorphisms into the presented group. And there are many maps which "should" be group isomorphisms which don't have an inverse on the level of presentations.
</html:p>
      </fr:mainmatter>
    </fr:tree>
    <fr:tree show-metadata="false">
      <fr:frontmatter>
        <fr:authors>
          <fr:author>
            <fr:link href="/eigil-rischel/" title="Eigil Fjeldgren Rischel" uri="https://erischel.com/eigil-rischel/" display-uri="eigil-rischel" type="local">Eigil Fjeldgren Rischel</fr:link>
          </fr:author>
        </fr:authors>
        <fr:date>
          <fr:year>2020</fr:year>
          <fr:month>10</fr:month>
          <fr:day>11</fr:day>
        </fr:date>
        <fr:title text="Model categories">Model categories</fr:title>
      </fr:frontmatter>
      <fr:mainmatter>
        <html:p>
  The basic things you can do in a model category are:
</html:p>
        <html:p>
  -   Invert certain maps that "should" be isomorphisms (or "equivalences")
  -   Replace an object with a "better behaved" one which is "equivalent" in that sense.
</html:p>
        <html:p>
  Let's take a more classical example from "real" homotopy theory: Simplicial sets.
  In this context, we think of a simplicial set <fr:tex display="inline"><![CDATA[X]]></fr:tex> as a "model" for a topological space, its geometric realization <fr:tex display="inline"><![CDATA[|X|]]></fr:tex>.
  A map <fr:tex display="inline"><![CDATA[X \to  Y]]></fr:tex> is a simplicial homotopy equivalence if the map of spaces <fr:tex display="inline"><![CDATA[|X| \to  |Y|]]></fr:tex> is a homotopy equivalence of spaces.
  However, in many cases, such an equivalence can't be inverted, even up to (simplicial) homotopy.
  Similarly, there are often maps between geometric realizations which can't be represented by maps between the simplicial sets, even up to homotopy.
</html:p>
        <html:p>
  The basic solution to this is to work with certain nice simplicial sets called _Kan complexes_. A Kan complex has "enough simplexes" so that all the maps between them that "should" exist, do.
  Now we _could_ simply work with the category of Kan complexes - but this is an inconvenient category. Its main deficiency is probably that it does not have all colimits. This is compared to the full category of simplicial sets, which is as nice as they come.
</html:p>
        <html:p>
  So we use a powerful piece of technology called a _model structure_, making simplicial sets into a model category.
  (This is usually called the Kan model structure, or the Kan-Quillen model structure).
</html:p>
        <html:p>
  The upshot of this is that every simplicial set is homotopy equivalent to a Kan complex, in a very structured way which lets you use the technically convenient structure of the whole category of simplicial sets to describe "the homotopy theory of Kan complexes".
</html:p>
      </fr:mainmatter>
    </fr:tree>
    <fr:tree show-metadata="false">
      <fr:frontmatter>
        <fr:authors>
          <fr:author>
            <fr:link href="/eigil-rischel/" title="Eigil Fjeldgren Rischel" uri="https://erischel.com/eigil-rischel/" display-uri="eigil-rischel" type="local">Eigil Fjeldgren Rischel</fr:link>
          </fr:author>
        </fr:authors>
        <fr:date>
          <fr:year>2020</fr:year>
          <fr:month>10</fr:month>
          <fr:day>11</fr:day>
        </fr:date>
        <fr:title text="Back to groups">Back to groups</fr:title>
      </fr:frontmatter>
      <fr:mainmatter>
        <html:p>
  Now we are going to try to adapt the above to groups.
</html:p>
        <html:p>
  The way to do this is to describe the _trivial cofibrations_ - essentially, these will be those maps which are "morally group isomorphisms".
</html:p>
        <html:p>
  Using the machinery of model categories, we can get away with specifying only a small "generating family".
  These are on page 2 of the paper.
</html:p>
        <html:p>
  Now here's a fun fact: this small list pins down exactly the "proper" presentations of groups, in this sense:
</html:p>
        <html:p>
  **Theorem**: The following two are equivalent for a presentation <fr:tex display="inline"><![CDATA[\langle  S \mid  R \rangle ]]></fr:tex></html:p>
        <html:p>
  -   The map <fr:tex display="inline"><![CDATA[S \to  F(S)/R]]></fr:tex> is bijective, and <fr:tex display="inline"><![CDATA[R]]></fr:tex> contains every word which is zero in <fr:tex display="inline"><![CDATA[F(S)/R]]></fr:tex>.
  -   For every diagram
</html:p>
        <html:img src="/bafkrmic5qkhuiaveuvhzsl3s7dgvlbxfjovurscmte4xi3qdv7pzxd5xyy.png" title="" />
        <html:p>
  if <fr:tex display="inline"><![CDATA[f]]></fr:tex> is in the generating list, there exists an extension like the dashed arrow making the triangle commute.
</html:p>
        <html:p>
  **Proof**:
  First, it's easy to check for each type of generating arrow that this holds:
</html:p>
        <html:p>
  -   <fr:tex display="inline"><![CDATA[a]]></fr:tex> and <fr:tex display="inline"><![CDATA[b]]></fr:tex> must be sent to the same element (by injectivity), so we can simply send <fr:tex display="inline"><![CDATA[c]]></fr:tex> there as well.
  -   We can extend the map by sending <fr:tex display="inline"><![CDATA[a]]></fr:tex> to whatever element <fr:tex display="inline"><![CDATA[w^{-1}]]></fr:tex> evaluates to.
  -   The remaining three maps simply add relations which are derivable from the existing ones - hence their images must already be in <fr:tex display="inline"><![CDATA[R]]></fr:tex>.
</html:p>
        <html:p>
  Now for the other direction, suppose <fr:tex display="inline"><![CDATA[a,b \in  S]]></fr:tex> go to the same element in <fr:tex display="inline"><![CDATA[F(S)/R]]></fr:tex>.
  Then the map <fr:tex display="inline"><![CDATA[\langle  a,b \mid  ab^{-1} \rangle  \to  \langle  S \mid  R \rangle ]]></fr:tex> does not have an extension over the first generating map.
  Hence that map is injective.
  Suppose <fr:tex display="inline"><![CDATA[w \in  F(S)/R]]></fr:tex> is not in <fr:tex display="inline"><![CDATA[S]]></fr:tex>.
  Then the map <fr:tex display="inline"><![CDATA[\langle  S \mid  \emptyset  \rangle  \to  \langle  S \mid  R \rangle ]]></fr:tex> does not extend over <fr:tex display="inline"><![CDATA[\langle  S \sqcup  \{a\} \mid  a w^{-1} \rangle ]]></fr:tex> - there is nowhere to send <fr:tex display="inline"><![CDATA[a]]></fr:tex> (since it must be sent to something that goes to <fr:tex display="inline"><![CDATA[w]]></fr:tex>, for the property to hold).
  The statement that <fr:tex display="inline"><![CDATA[R]]></fr:tex> contains every word that goes to zero means that <fr:tex display="inline"><![CDATA[R]]></fr:tex> is stable under certain operations, which can similarly be proved from the morphisms.
</html:p>
        <html:p>
  It follows from the general theory of model categories that there always exists a map <fr:tex display="inline"><![CDATA[\langle  S \mid  R \rangle  \to  P]]></fr:tex> into a "nice" (in technical terms, fibrant) presentation, which is itself a trivial cofibration.
  Understanding what the trivial cofibrations are in technical terms is more complicated - an argument going in the other direction from the one above will show that they are exactly those which correspond to group isomorphisms, but this might be a bit tricky.
</html:p>
      </fr:mainmatter>
    </fr:tree>
  </fr:mainmatter>
  <fr:backmatter>
    <fr:tree show-metadata="false" hidden-when-empty="true">
      <fr:frontmatter>
        <fr:authors />
        <fr:title text="References">References</fr:title>
      </fr:frontmatter>
      <fr:mainmatter />
    </fr:tree>
    <fr:tree show-metadata="false" hidden-when-empty="true">
      <fr:frontmatter>
        <fr:authors />
        <fr:title text="Context">Context</fr:title>
      </fr:frontmatter>
      <fr:mainmatter />
    </fr:tree>
    <fr:tree show-metadata="false" hidden-when-empty="true">
      <fr:frontmatter>
        <fr:authors />
        <fr:title text="Backlinks">Backlinks</fr:title>
      </fr:frontmatter>
      <fr:mainmatter />
    </fr:tree>
    <fr:tree show-metadata="false" hidden-when-empty="true">
      <fr:frontmatter>
        <fr:authors />
        <fr:title text="Related">Related</fr:title>
      </fr:frontmatter>
      <fr:mainmatter />
    </fr:tree>
    <fr:tree show-metadata="false" hidden-when-empty="true">
      <fr:frontmatter>
        <fr:authors />
        <fr:title text="Contributions">Contributions</fr:title>
      </fr:frontmatter>
      <fr:mainmatter />
    </fr:tree>
  </fr:backmatter>
</fr:tree>
