Proposition 5.6.4 (Recognition principle for iterated loop spaces). For every \(n \geq 0\) there is an adjunction

Commutative diagram involving bB ncolon Mon (n)(An), \An_*noloc bOmega n.

which restricts to an equivalence

Commutative diagram involving bB ncolon Grp (n)(An), \An *,geq nnoloc bOmega n.

Proof. Consider the adjunction \(\bB \colon \Mon (\An ) \rightleftarrows \An _*\noloc \bOmega \). Since both functors preserve finite products (see Lemma 5.1.16), we may apply the monoid construction repeatedly and paste the resulting adjunctions. Using the equivalences \(\Mon (C_*) \simeq \Mon (C)\) from Remark 5.3.21 at the intermediate stages gives the displayed adjunction \(\bB ^n \dashv \bOmega ^n\).

The recognition principle for loop spaces, Theorem 5.2.1, says that at each stage this adjunction restricts to an equivalence between group objects and connected pointed objects. Iterating raises connectivity by one at every stage, and therefore identifies \(\Grp ^{(n)}(\An )\) with \(\An _{*,\geq n}\). โ–ก