ScalingStacks

11.2. Morphisms induced by compositions[0MTQ]

Let WW be a Segal space. Given g∈map⁡(y,z)g\in\map(y,z), consider the zig-zag

map⁡(x,y)→{g}×1map⁡(y,z)×map⁡(x,y)←∼φ2map⁡(x,y,z)→d1map⁡(x,z);\map(x,y)\xrightarrow{\{g\}\times 1}\map(y,z)\times\map(x,y)\xleftarrow[\sim]{\varphi_{2}}\map(x,y,z)\xrightarrow{d_{1}}\map(x,z);

this induces a morphism g∗:map⁡(x,y)→map⁡(x,z)g_{*}\colon\map(x,y)\rightarrow\map(x,z) in the homotopy category of spaces. Likewise, given f∈map⁡(x,y)f\in\map(x,y), consider the zig-zag

map⁡(y,z)→1×{f}map⁡(y,z)×map⁡(x,y)←∼φ2map⁡(x,y,z)→d1map⁡(x,z);\map(y,z)\xrightarrow{1\times\{f\}}\map(y,z)\times\map(x,y)\xleftarrow[\sim]{\varphi_{2}}\map(x,y,z)\xrightarrow{d_{1}}\map(x,z);

this induces a morphism f∗:map⁡(y,z)→map⁡(x,z)f^{*}\colon\map(y,z)\rightarrow\map(x,z) in the homotopy category of spaces. Note that if f∈map⁡(x,y)f\in\map(x,y) and g∈map⁡(y,z)g\in\map(y,z), then g∗​([f])=f∗​(g)=[g∘f]g_{*}([f])=f^{*}(g)=[g\circ f] (using the notation of §5). We have the following.

[05VP]
  1. (1)

    Given f∈map⁡(x,y)f\in\map(x,y) and g∈map⁡(y,z)g\in\map(y,z), and g∘fg\circ f the result of a composition, then (g∘f)∗∼g∗∘f∗(g\circ f)_{*}\sim g_{*}\circ f_{*} and (g∘f)∗∼f∗∘g∗(g\circ f)^{*}\sim f^{*}\circ g^{*}.

  2. (2)

    Given x∈ob⁡Wx\in{\operatorname{ob}}W then (idx)∗∼(idx)∗∼idmap⁡(x,x)(\id_{x})_{*}\sim(\id_{x})^{*}\sim\id_{\map(x,x)}.

[05VQ]

Proof. To prove (1), let k∈map⁡(x,y,z)k\in\map(x,y,z) be a composition of ff and gg which results in a composite g∘fg\circ f. To show that (g∘f)∗∼g∗∘f∗(g\circ f)_{*}\sim g_{*}\circ f_{*}, it suffices to show that both sides of the equation are equal (in the homotopy category of spaces) to the zig-zag

map⁡(w,x)→{k}×1map⁡(x,y,z)×map⁡(w,x)←∼map⁡(w,x,y,z)→map⁡(w,z).\map(w,x)\xrightarrow{\{k\}\times 1}\map(x,y,z)\times\map(w,x)\xleftarrow{\sim}\map(w,x,y,z)\rightarrow\map(w,z).

The proof that (g∘f)∗∼f∗∘g∗(g\circ f)^{*}\sim f^{*}\circ g^{*} is similar.

The proof of (2) is straightforward. ∎

[05VR]

Proposition 11.4. Let f,g∈map⁡(x,y)f,g\in\map(x,y). Then f∼gf\sim g if and only if the maps f∗,g∗:map⁡(w,x)→map⁡(w,y)f_{*},g_{*}\colon\map(w,x)\rightarrow\map(w,y) are homotopic for all w∈ob⁡Ww\in{\operatorname{ob}}W, if and only if the maps f∗,g∗:map⁡(y,z)→map⁡(x,z)f^{*},g^{*}\colon\map(y,z)\rightarrow\map(x,z) are homotopic for all z∈ob⁡Wz\in{\operatorname{ob}}W.

[05VS]

Proof. The only if direction is straightforward. To prove the if direction, suppose that f∗f_{*} and g∗g_{*} are homotopic for all w∈ob⁡Ww\in{\operatorname{ob}}W. Then in particular they are homotopic for w=xw=x. The following commutative diagram demonstrates that f∗​(idx)∼ff_{*}(\id_{x})\sim f.

map⁡(x,x)\displaystyle{{\map(x,x)}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{f}×1\scriptstyle{\{f\}\times 1}pt\displaystyle{{{\operatorname{pt}}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}{idx}\scriptstyle{\{\id_{x}\}}{f}\scriptstyle{\{f\}}map⁡(x,y)×map⁡(x,x)\displaystyle{{\map(x,y)\times\map(x,x)}}map⁡(x,y)\displaystyle{{\map(x,y)}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}1×{idx}\scriptstyle{1\times\{\id_{x}\}}s0\scriptstyle{s_{0}}1\scriptstyle{1}map⁡(x,x,y)\displaystyle{{\map(x,x,y)}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}∼\scriptstyle{\sim}(d0,d2)\scriptstyle{(d_{0},d_{2})}d1\scriptstyle{d_{1}}map⁡(x,y)\displaystyle{{\map(x,y)}}

Similarly g∗​(idx)∼gg_{*}(\id_{x})\sim g, whence f∼gf\sim g using (11.3), as desired. ∎

[05VT]

Corollary 11.5. If f∈map⁡(x,y)f\in\map(x,y) is a homotopy equivalence (in the sense of (5.5)) then f∗f_{*} and f∗f^{*} are weak equivalences of spaces.

It is convenient to write map⁡(x,y)f\map(x,y)_{f} to denote the component of map⁡(x,y)\map(x,y) containing ff. More generally, we write map⁡(x0,…,xk)f1,…,fk\map(x_{0},\dots,x_{k})_{f_{1},\dots,f_{k}} for the component of map⁡(x0,…,xk)\map(x_{0},\dots,x_{k}) corresponding to the component of (f1,…,fk)(f_{1},\dots,f_{k}) in map⁡(x0,x1)×⋯×map⁡(xk−1,xk)\map(x_{0},x_{1})\times\dots\times\map(x_{k-1},x_{k}). The following lemma will be used in the proof of (11.1).

[05VU]

Lemma 11.6. Given a Segal space WW and f∈map⁡(x,y)f\in\map(x,y) and g∈map⁡(y,z)g\in\map(y,z) such that ff is a homotopy equivalence, the induced map

map⁡(x,y,z)f,g→(d1,d2)map⁡(x,z)g∘f×map⁡(x,y)f\map(x,y,z)_{f,g}\xrightarrow{(d_{1},d_{2})}\map(x,z)_{g\circ f}\times\map(x,y)_{f}

is a weak equivalence.

[05VV]

Proof. This follows from the diagram

map⁡(y,z)g×map⁡(x,y)f\displaystyle{{\map(y,z)_{g}\times\map(x,y)_{f}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces}1×Δ\scriptstyle{1\times\Delta}map⁡(y,z)g×map⁡(x,y)f×map⁡(x,y)f\displaystyle{{\map(y,z)_{g}\times\map(x,y)_{f}\times\map(x,y)_{f}}}map⁡(x,y,z)f,g\displaystyle{{\map(x,y,z)_{f,g}}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}(d0,d2)\scriptstyle{(d_{0},d_{2})}(d0,d2,d2)\scriptstyle{(d_{0},d_{2},d_{2})}(1,d2)\scriptstyle{(1,d_{2})}(d1,d2)\scriptstyle{(d_{1},d_{2})}map⁡(x,y,z)f,g×map⁡(x,y)f\displaystyle{\map(x,y,z)_{f,g}\times\map(x,y)_{f}\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces\ignorespaces}(d0,d2)×1\scriptstyle{(d_{0},d_{2})\times 1}∼\scriptstyle{\sim}d1×1\scriptstyle{d_{1}\times 1}map⁡(x,z)g∘f×map⁡(x,y)f\displaystyle{\map(x,z)_{g\circ f}\times\map(x,y)_{f}}

Here the vertical column is a weak equivalence since ff is a homotopy equivalence (restricting to the fiber over f∈map⁡(x,y)ff\in\map(x,y)_{f} of the projections to map⁡(x,y)f\map(x,y)_{f} gives exactly the zig-zag which defines f∗:map⁡(y,z)g→map⁡(x,z)g∘ff^{*}\colon\map(y,z)_{g}\rightarrow\map(x,z)_{g\circ f}). Since (d0,d2)(d_{0},d_{2}) is a weak equivalence, the lemma follows. ∎

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.

Charles Rezk

Original source: arXiv:math/9811037v3

Original source · math/9811037v3