You can think of the pushout of two maps f : A → B, g : A → C in Set as computing the disjoint union of B and C with an identification f(a) = g(a) for each element a of A. We could imagine forming this as either the quotient by an equivalence relation, or by gluing in a segment joining f(a) to g(a) for each a, and taking π0 of the resulting space. If two elements a, a' of A satisfy f(a) = f(a') and g(a) = g(a'), the pushout is unaffected by removing a' from A. The homotopy pushout is formed by gluing in a segment joining f(a) to g(a) for each a and not forgetting the number of ways in which two elements of B ∐ C are identified; instead we take the entire space as the result. It is the "derived" version of the pushout.
In general you can think of the homotopy pushout of A → B, A → C as the "free" thing generated by B and C with "relations" coming from A. But it's important that the "relations" are imposed exactly once, since in the homotopical/derived setting we keep track of such things (and have "relations between relations" etc.)
Another, possibly more familiar example: In a derived category, the mapping cone of a morphism f : A → B is the homotopy pushout of f and the zero map A → 0. This certainly depends on A, even when B is the zero object: it is the suspension of A.
No comments:
Post a Comment