A --gA[t]--> X| ^i || |v |B >-gB[0]---*The data is said to be a cofibration ( like an inclusion ) iff given any homotopy , and a map downstairs such that , we can extend into . We see that this is simply the HEP (homotopy extension property), where we have a homotopy of subspace , and a starting homotopy of , which can be extended to a full homotopy.
§ Lemma: Cofibration is always inclusion (Hatcher)
§ Pushouts
A <-i- P -β-> BThe pushout intuitively glues to along 's subspace . For this interpretation, let us say that is a subspace of (ie, is an injection). Then the result of the pushout is a space where we identify with . The pushout in Set is where we generate an equivalence relation from . In groups, the pushout is amalgamated free product.
-- | HoTT defnf :: C -> Ag :: C -> Binl :: Pushout A B C f ginr :: Pushout A B C f gglue :: Π(c: C) inl (f(c)) = inr(g(c))Suspension:
1 <- A -> 1Suspension can "add homotopies". Example, S1 = Susp(2).
A --f--> P| ||i |i'v vB -----> B Uf PWe want to show that is a cofibration if is a cofibration.
Reference: F. Faviona, more on HITs