-complex / semi-simplicial set
Anchor (Master): Hatcher §2.1 (combinatorial form); Rourke-Sanderson 1971 *$\Delta$-sets I/II* (Quart. J. Math. Oxford 22); May 1967 *Simplicial Objects in Algebraic Topology*; Goerss-Jardine *Simplicial Homotopy Theory*
Intuition [Beginner]
A -complex is a recipe for building a topological space from standard simplices — points, line segments, triangles, tetrahedra, and their higher cousins — by gluing entire faces of one simplex to entire faces of another. The data is purely combinatorial: a list of simplices in each dimension, together with the rule for how each simplex's faces sit inside lower-dimensional simplices. Once you specify this data, the actual space is determined.
The semi-simplicial set is the same data presented as a category-theoretic object. For each dimension you list a set of abstract -simplices, and for each face inclusion you record where each abstract -simplex sends that face. There is no requirement that two abstract simplices be embedded the same way or even injectively — you can glue a triangle's three edges into a single circle, and the resulting space is the dunce cap.
Why bother with this if CW complexes already exist? Because the gluing for a -complex is along combinatorial faces, not arbitrary continuous maps. The combinatorial structure means homology can be computed directly from the abstract simplex-counting data, with no extra work to set up cellular boundaries. This combinatorial accessibility is the reason simplicial methods preceded CW methods historically and remain the workhorse for computer-assisted computations.
Visual [Beginner]
A schematic showing a square with its four edges identified pairwise: the top edge with the bottom edge (with matching arrows pointing the same direction) and the left edge with the right edge (also matching). The square is divided by one diagonal into two triangles, and each triangle is labelled as an abstract -simplex. The two triangles share the diagonal as one of their edges, and the boundary edges get identified into a single horizontal edge and a single vertical edge. The resulting space is the torus.
The picture captures the essence: two -simplices, three -simplices (the two boundary edges and the diagonal), and one -simplex (every corner of the square becomes the same point after identification). The combinatorial data is one vertex, three edges, two triangles — the same numbers you would write down on a piece of paper. Replacing the matching-arrow rule for the top and bottom edges by an opposite-arrow rule gives the Klein bottle instead, with the same vertex-edge-face count.
Worked example [Beginner]
Build the two-sphere as a -complex and check the count of simplices.
Step 1. Take two -simplices and (the north and south poles), two -simplices and (the eastern and western halves of the equator, each running from to ), and two -simplices and (the northern and southern hemispheres).
Step 2. Each hemisphere is a triangle with two boundary edges along the equator and the third boundary edge collapsed to the pole opposite to it. So has boundary on one side, on another, and a constant path at on the third; symmetrically for with in place of .
Step 3. Count the simplices and check the Euler characteristic: $$ \chi(S^2) = (\text{vertices}) - (\text{edges}) + (\text{faces}) = 2 - 2 + 2 = 2, $$ matching the known .
What this tells us: the combinatorial data of a -complex is purely finite — two vertices, two edges, two faces realise a sphere — and the Euler characteristic is the basic check that the data realises the intended space. The torus, Klein bottle, and each have a standard simplest -structure, and learning to recognise these standard forms is the first practical skill.
Check your understanding [Beginner]
Formal definition [Intermediate+]
Let denote the category whose objects are the finite linearly ordered sets for and whose morphisms are the order-preserving injections. This is the wide subcategory of the simplex category obtained by discarding the order-preserving surjections.
Definition (semi-simplicial set). A semi-simplicial set (equivalently, a -set in the sense of Rourke-Sanderson) is a functor . Concretely, this is a sequence of sets together with face maps for satisfying the simplicial identities $$ d_i d_j = d_{j-1} d_i \quad \text{for } i < j. $$ A morphism of semi-simplicial sets is a natural transformation: a family of maps commuting with all face maps. The resulting category is denoted .
Definition (geometric realisation). Let denote the standard topological -simplex, and let denote the -th face inclusion . The geometric realisation of a semi-simplicial set is the topological space $$ |X_\bullet| = \left( \coprod_{n \geq 0} X_n \times \Delta^n \right) \bigg/ \sim $$ where for every and , equipped with the quotient topology from the discrete topology on each and the standard topology on each .
Definition (-complex structure on a space). A -complex structure on a topological space is a collection of characteristic maps such that:
- (i) The restriction to the open interior is injective, and every point of lies in the image of exactly one such open interior.
- (ii) Each face equals a characteristic map for some of dimension .
- (iii) A subset is open if and only if is open in for every .
A space carrying a -complex structure is called a -complex. Equivalently and more efficiently: a -complex on is a semi-simplicial set together with a homeomorphism .
Examples.
Torus. Take , , . Face maps: , , , , , . All face maps from to send their argument to . The geometric realisation is the two-torus , presented as a square with opposite edges identified and one diagonal dividing it into the two triangles and .
Klein bottle. The same simplex counts ( vertex, edges, triangles) with one face map flipped: replaced by but with the opposite orientation, encoded by relabelling. Concretely: , , , with , , , , , . The geometric realisation is the Klein bottle.
Sphere (the two-simplex form). Take one -simplex and one -simplex whose entire boundary is collapsed to : every face map sends to the unique -simplex which is itself a face of some lower-dimensional simplex with everything collapsing to . The geometric realisation is the suspension of a point, iteratively — that is, .
Real projective space . Take one simplex in each dimension from to , with face maps coming from the standard antipodal-identification cell structure. The semi-simplicial set has for , with for every , and the realisation is .
Counterexamples to common slips
- The dunce cap (a -simplex with all three edges identified to a single -simplex, all in the same orientation) is a -complex but is contractible — the combinatorial data does not match the naive geometric expectation. Each face map is forced; only the identification of edges differs from the torus example.
- A pair of disjoint open simplices identified along a single boundary face is a -complex; a pair of disjoint open simplices glued along a partial face (say half of an edge) is not — -attaching is along entire faces, not partial subsets.
- A simplicial complex in the older Munkres sense (vertices form a set, simplices are subsets of vertices) is a special case of a -complex with the extra rigidity that each -simplex is determined by its set of vertices and is embedded in its realisation. Most -complexes are not simplicial complexes in this older sense: the torus's standard -structure has both -simplices sharing the same triple of vertices (the unique -simplex repeated three times).
- A -complex carries no degeneracy maps. The induced full simplicial set obtained by formally adjoining degeneracies (the free degeneracy completion) has the same geometric realisation but distinct categorical data.
Key theorem with proof [Intermediate+]
Theorem (geometric realisation is CW; Hatcher §2.1). Let be a semi-simplicial set. The geometric realisation is a CW complex with one -cell for each element of . The interior of each characteristic map is an open -cell, and the characteristic maps are the attaching maps.
Proof. Define to be the image in of under the quotient map. We claim is the -skeleton of a CW structure with one -cell for each element of .
Cells and attaching maps. For each and , define the characteristic map $$ \sigma_x : \Delta^n \to |X_\bullet|, \qquad t \mapsto [x, t]. $$ The restriction is injective by the equivalence-relation analysis: two points and with in open interiors and in the quotient must have and , since every generating relation moves the simplex-coordinate from an open interior of dimension to a boundary point of dimension , never between two open interiors. The complement lies in because is the image of the face paired with . So each has the structure of a characteristic map for an -cell with attaching map into .
Disjointness of open cells. The previous paragraph shows distinct produce disjoint open cells and in , and that the union of open cells covers . So the cell decomposition is well-defined.
Closure-finiteness (C). Each closed cell meets only finitely many open cells: the -cell itself, plus the open cells of that lie in . The boundary is the union of closed faces, each contributing finitely many lower-dimensional cells by induction on . So each closed cell meets finitely many open cells in total.
Weak topology (W). By construction, the topology on is the quotient topology from . A subset is closed in this quotient if and only if is closed for every and every . This is exactly the weak-topology condition: is closed if and only if is closed in each closed cell.
Combining: is a Hausdorff space (the open cells separate points by the open-interior injectivity argument) with a cell decomposition satisfying (C) and (W), hence a CW complex.
Corollary. Every -complex is a CW complex. Singular homology, cellular homology, and simplicial -homology of a -complex all agree.
The first sentence is immediate from the theorem. The second follows from the comparison theorem (Hatcher 2.27) identifying simplicial -homology with singular homology, together with the cellular-equals-singular agreement (Hatcher 2.35) on any CW complex.
Bridge. This theorem builds toward the entire combinatorial-topology infrastructure of the chapter: every space with a -structure inherits a CW structure, and the cellular boundary formula on that CW structure agrees with the alternating-sum face boundary on the underlying semi-simplicial chain complex. The foundational reason this works is that the open interiors of the standard simplices already provide disjoint open cells and the face inclusions already provide the attaching data, so no additional choices need to be made. This is exactly the pattern that appears again in 03.12.13 (cellular homology) where cellular chains are read off directly from the cell decomposition without computing singular chains. Putting these together, the bridge is the recognition that the combinatorial face data of a semi-simplicial set is rich enough to determine the CW structure, the cellular chain complex, and the homology, all without invoking the singular complex. The central insight is that semi-simplicial sets are the universal combinatorial source for CW homology with one cell per simplex: anything one wants to compute from the cell structure factors through the semi-simplicial data, and this same combinatorial-to-homotopical translation appears again in 03.12.12 (simplicial homology) where the comparison chain map identifies -homology with singular homology.
Exercises [Intermediate+]
Advanced results [Master]
Theorem (combinatorial equivalence of the two pictures; Hatcher §2.1, Rourke-Sanderson 1971). The functor sending a -complex structure on a topological space to its underlying semi-simplicial set, and the functor sending a semi-simplicial set to its geometric realisation equipped with the canonical -structure, are inverse to each other up to natural homeomorphism on the realisations and natural isomorphism on the semi-simplicial sets.
This is the abstract content of the geometric-realisation construction: -complexes and semi-simplicial sets are two presentations of the same data, and any combinatorial assertion about one transfers to the other. Rourke-Sanderson formulated the modern category-theoretic version; Hatcher works in the geometric language throughout.
Theorem (semi-simplicial homology equals singular homology; Hatcher Theorem 2.27). Let be a topological space with a -complex structure realised by the semi-simplicial set . The chain map sending each -simplex to its characteristic map , viewed as a singular -simplex, induces an isomorphism on homology.
The proof packages a relative argument using the skeletal filtration and the long exact sequence of the pair . The induction step uses excision and the fact that is a wedge of -spheres, one per -simplex.
Theorem (failure of the model-structure transfer; Goerss-Jardine §I). The category of semi-simplicial sets does not admit a model structure for which the geometric-realisation functor is a left Quillen functor producing the standard Quillen-Serre model structure on . The obstruction is exactly the absence of degeneracies, which are required for the lifting properties of Kan fibrations.
The full simplicial set theory has degeneracies precisely so that the Kan-complex / Kan-fibration framework supports a Quillen model structure (Quillen 1967 Homotopical Algebra SLN 43). Semi-simplicial sets are adequate for chain-level constructions and singular-homology-style computations, but not for the higher-categorical machinery. The free degeneracy completion is the left adjoint that bridges the two settings whenever the model-theoretic structure is needed.
Theorem (nerve characterisation). Let act as a category on its own; the resulting functor category . The Yoneda embedding sends to the representable presheaf whose geometric realisation is the standard topological -simplex. The realisation functor extends uniquely (up to natural isomorphism) to the colimit-preserving functor classified by the nerve adjunction.
This is the abstract justification for the explicit coend formula , identifying the geometric realisation as the left Kan extension of along the Yoneda embedding.
Theorem (semi-simplicial replacement of ). For every topological space , the forgetful functor sends the singular simplicial set to a semi-simplicial set whose chain complex, with the alternating-sum boundary, recovers the singular chain complex of exactly. Consequently the chain-level homology of is singular homology.
The proof is direct: the chain group equals the singular chain group , and the boundary maps coincide on the nose. The point is that the chain-level construction does not see degeneracies: the alternating-sum boundary uses only face maps. This is the deepest reason that semi-simplicial sets suffice for ordinary homology.
Theorem (degeneracy completion preserves realisation). Let denote the left adjoint to the forgetful functor . For every semi-simplicial set , the canonical map is a homeomorphism.
The degeneracies introduced by are formal and collapse under realisation, by the degeneracy-quotient relation in the simplicial-set realisation. This makes the bridge between semi-simplicial and full simplicial pictures coherent on realisations while differing categorically.
Theorem (compatibility with the standard -structures). The standard -structures on , , the orientable genus- surface , and the non-orientable genus- surface are explicit semi-simplicial sets whose chain complexes recover the known integer homologies. For : one -simplex, one -simplex, zero in between, giving for and zero otherwise. For : one simplex per dimension, with boundary , giving the standard projective homology. For : the simplex counts from the octagon subdivision with the prescribed face maps, giving and .
These computations are direct: write the chain complex, compute kernel and image of each boundary, read off the homology. The point is that the semi-simplicial framework reduces the computation of homology of any space with a -structure to a finite-rank linear-algebra problem over .
Synthesis. The -complex / semi-simplicial set picture is the foundational reason that singular homology factors through a combinatorial intermediate: any space with a -structure has its homology determined by the face data of finitely many simplices, and this data is exactly what the semi-simplicial framework records. The central insight is that the chain-level boundary uses only face maps, so the entire degeneracy machinery of the full simplicial-set theory is overhead for ordinary homology. Putting these together, the bridge from combinatorial face data to topological homology runs through three identifications: semi-simplicial chain homology equals simplicial -homology, -homology equals singular homology (Hatcher 2.27), and singular homology equals cellular homology on the CW structure inherited from the -decomposition (Hatcher 2.35). The construction here is dual to the full simplicial-set theory in the categorical sense that the forgetful functor has the free-degeneracy-completion functor as its left adjoint, with homeomorphic to . This same combinatorial-to-homotopical mechanism appears again in 03.12.13 (cellular homology), where the cellular chain complex is read off directly from the cell structure with no recourse to singular chains — generalising the -picture to arbitrary cell decompositions. The bridge is the recognition that combinatorial chain data is the right intermediate between geometry and homological algebra, and the appropriate categorical level depends on what one wants to compute: homology requires only faces, homotopy requires faces and degeneracies — the Kan-complex / Quillen-model story in 03.12.10 (CW complex) and beyond.
Full proof set [Master]
Proposition (simplicial identities are necessary and sufficient). A functor is the same data as a sequence of sets for together with face maps for satisfying for .
Proof. Every morphism in is a composition of the elementary face inclusions skipping the -th element. The defining relations among compositions of 's are exactly for , which dualise on to for . A functor on is determined by its action on each and on each , subject to the dual relation. So the functor and the face-map data are interchangeable.
Proposition (geometric realisation is functorial). The construction extends to a functor . For every morphism of semi-simplicial sets , the induced map is continuous and natural.
Proof. Define on representatives by for and . This descends to the quotient because commutes with face maps: if , then , so the relation is preserved. Continuity on the quotient follows from continuity on , which is automatic since carries the discrete topology and is a function. Naturality and functoriality are direct from the formula.
Proposition (realisation commutes with colimits). The realisation functor preserves all small colimits.
Proof. A diagram of semi-simplicial sets has colimit computed levelwise: . The realisation of this colimit is . By the universal property of colimits, (using that is left adjoint to the function-space functor on for compact Hausdorff, hence preserves all colimits). The quotient by the equivalence relation commutes with colimits because the relation is generated by levelwise compatible identifications. Combining, .
Proposition (singular complex factorisation). The singular complex functor composed with the forgetful functor produces a functor whose chain complex with the alternating-sum boundary coincides with the singular chain complex.
Proof. The chain group equals by definition the singular chain group . The semi-simplicial boundary is where is the restriction of to the -th face. This is the same formula as the singular boundary. So the two chain complexes coincide on the nose, and their homologies — semi-simplicial chain homology of and singular homology of — are identical.
Proposition (Hatcher Theorem 2.27, sketch). Let be a topological space with a -structure . The chain map sending each -simplex to its characteristic map induces an isomorphism $i_ : H_n^\Delta(X) \to H_n^{\mathrm{sing}}(X)n$.*
Proof sketch. Filter by its skeleta . Apply the long exact sequence of the pair in both -homology and singular homology, together with the chain map . The relative chain groups are zero for and equal to for . The relative singular chain groups are zero for and equal to for , by excision and the standard computation of relative singular homology of a sphere pair. The chain map identifies these relative groups, so by induction on and the five lemma, is an isomorphism on for every and every . Passing to the colimit over gives the result on .
Proposition (free degeneracy completion exists and is left adjoint to ). The forgetful functor has a left adjoint , called the free degeneracy completion, given on -simplices by .
Proof. Define as stated. A simplicial-set face map on is determined as follows: for a pair , the composition factors uniquely as an injection followed by a surjection, where and . Set , where is the image of under the appropriate face map. The simplicial degeneracy sends to . Checking the simplicial identities is a finite verification; the universal property is the statement that simplicial-set morphisms are in natural bijection with semi-simplicial morphisms , by sending to the restriction .
Connections [Master]
Simplicial homology
03.12.12. The chain complex of a semi-simplicial set with alternating-sum boundary is the same object as the simplicial -homology chain complex of the underlying -complex. The two units describe the same data from two perspectives: the present unit constructs the combinatorial object and its realisation, while the simplicial-homology unit develops the chain-complex theory and computes the resulting invariants. The comparison theorem (Hatcher 2.27) bridging -homology and singular homology lives in the simplicial-homology unit; the present unit establishes the underlying combinatorial framework.CW complex
03.12.10. Every -complex is canonically a CW complex via the geometric-realisation theorem above. The converse fails: a generic CW complex with arbitrary attaching maps need not carry any -structure. The class of spaces admitting a -structure is precisely the class of CW complexes whose attaching maps factor through the standard simplex boundary inclusions — a strictly smaller class than all CW complexes. Most spaces of interest in algebraic topology (compact manifolds, finite CW complexes, classifying spaces of discrete groups) admit -structures; some pathological CW complexes do not.Cellular homology
03.12.13. When a space carries both a -structure and the induced CW structure, the cellular chain complex and the -chain complex coincide as chain complexes of free abelian groups. The cellular boundary is the alternating sum of face inclusions, which is the -boundary; the cells are the simplices of . So cellular homology on the induced CW structure equals -homology equals singular homology, and the computation is the same in all three pictures. The cellular-homology unit develops the more general case where the cells need not be standard simplices.Singular homology
03.12.11. The singular complex of any topological space is a semi-simplicial set after forgetting degeneracies, and the resulting chain complex with alternating-sum boundary is the singular chain complex of . This is the deepest reason that singular homology is well-defined: it factors through the semi-simplicial category, and the chain-level boundary uses no degeneracy data. The full simplicial-set structure on is needed only for the Kan-complex / Quillen-model framework, not for ordinary homology.Eilenberg-Zilber theorem. The semi-simplicial framework supports the Eilenberg-Zilber theorem on the chain complex of a product: as chain complexes up to chain homotopy. This is the algebraic input to the Künneth formula on the product of two spaces, both presented as -complexes. The combinatorial pairing of simplices in with simplices in to produce simplices in uses an explicit shuffle formula, originating in the 1950 Eilenberg-Zilber paper on semi-simplicial complexes.
Eilenberg-MacLane spaces and the iterated bar construction
03.12.05,03.08.04. The Eilenberg-MacLane space admits a canonical simplicial model: as the geometric realisation of the iterated bar construction on an abelian group , with the standard semi-simplicial classifying space of the group regarded as a one-object category, and obtained by -fold iteration. The construction is the foundational reason that as a topological space — every -simplex of is a coherent tuple of group elements, and the face maps are the bar-construction face maps inherited from May's Simplicial Objects in Algebraic Topology. This identifies the cohomological invariants of as simplicial cochains on a specific semi-simplicial set, and the classifying-space picture in03.08.04is the discrete-group instance () of the same iterated-bar machine.Simplicial sets and geometric realisation
03.12.25. The full simplicial-set framework — adjoining the degeneracy maps to the present face-only data — is developed in03.12.25as the upgrade required for the Kan extension condition, the adjunction, and the Quillen model structure on . The forgetful functor of the present unit's Exercise 7 has the free-degeneracy completion as its left adjoint, and the degeneracy-completion theorem above states : the topology is unchanged, but the categorical input gains exactly the structure absent here. The relationship is bidirectional: every assertion at the chain-complex level transfers between the two frameworks because the alternating-sum boundary uses only face data, while assertions about Kan fibrations, horn-fillers, and higher homotopy live only on the simplicial-set side. The semi-simplicial framework is the chain-level shadow appropriate for ordinary homology; the simplicial-set framework is the universal home for combinatorial homotopy theory. The failure-of-model-structure-transfer theorem above identifies the structural reason this split is unavoidable.Quillen model category
03.12.31. The failure-of-model-structure-transfer theorem alluded to above is sharpened in03.12.31into a positive statement: the Kan-Quillen model structure on lifts the present semi-simplicial framework to the full categorical home needed for the Quillen calculus, and the Reedy-type model structure on semi-simplicial sets sits one level beneath it. The small-object argument used to factorise maps as cofibrations followed by acyclic fibrations requires the degeneracy data, and is the structural reason the model-categorical machinery is cleanest on the full . The present face-only framework is therefore the natural setting for ordinary-homology computations; the upgrade to model-categorical machinery happens at03.12.25and03.12.31.
Notation crosswalk. May 1967 Simplicial Objects in Algebraic Topology uses for the simplex category, for the geometric realisation, for the total singular complex, and for the face maps. The modern Hatcher / Goerss-Jardine notation used throughout this unit is (or for the semi-simplicial subcategory), for geometric realisation, for the total singular complex, and for face maps. The translation is direct and notation-only; no content is gained or lost in the change.
Historical & philosophical context [Master]
The combinatorial picture of a space built from simplices with glued faces goes back to Poincaré's 1895 Analysis Situs and its supplements (1899-1904) [Poincaré 1895], where simplicial subdivisions and their associated chain complexes were introduced as the basic tool for computing homology. The terminology simplicial complex in the modern sense — a set of vertices together with a collection of subsets ("simplices") closed under taking subsets — was codified by Alexandroff in the 1920s and by Lefschetz in his 1930 monograph Topology (AMS Colloq. Publ. 12).
The semi-simplicial framework — face maps without degeneracies — emerged in the 1940s and 1950s as the combinatorial substrate of singular homology. Eilenberg and Zilber's 1950 paper Semi-simplicial complexes and singular homology (Ann. of Math. (2) 51, 499-513) [Eilenberg-Zilber 1950] formalised the semi-simplicial object and proved the Eilenberg-Zilber theorem on the chain complex of a product. The companion 1952 monograph Foundations of Algebraic Topology by Eilenberg and Steenrod (Princeton) [Eilenberg-Steenrod 1952] developed the singular-homology theory in this framework, treating -complexes implicitly as the combinatorial source for singular chains.
The shift to the full simplicial-set theory — adding degeneracies to obtain a Kan-complex / Quillen-model framework — was carried out by Kan in a series of papers from 1957 onward and packaged in May's 1967 monograph Simplicial Objects in Algebraic Topology (University of Chicago Press) [May 1967]. The full simplicial-set theory subsumes the semi-simplicial theory via the free-degeneracy-completion adjunction, and provides the model-theoretic framework needed for higher homotopy theory. Quillen's 1967 Homotopical Algebra (Springer Lecture Notes 43) [Quillen 1967] established the Kan-Quillen model structure on simplicial sets, and the equivalence with the standard model structure on topological spaces.
The modern semi-simplicial framework was revived by Rourke and Sanderson in their 1971 papers -sets I/II (Quart. J. Math. Oxford (2) 22, 321-338 and 465-485) [Rourke-Sanderson 1971], which reformulated the theory in categorical language and developed the homotopy theory of semi-simplicial sets directly without passing through the full simplicial-set theory. Hatcher's 2002 Algebraic Topology introduced the geometric -complex terminology for the realisation, and this is the language most graduate students encounter today.
The distinction between semi-simplicial and full simplicial — face maps with or without degeneracies — reflects the distinction between the chain-level and homotopy-level theories. Chain-level constructions (singular homology, ordinary cohomology, the universal coefficient theorem) use only the face data; homotopy-level constructions (Kan complexes, fibrations, the Quillen model structure, -categories) require the degeneracies. The semi-simplicial framework is the right level for the chapter on homology; the full simplicial-set framework is the right level for higher homotopy theory.
Bibliography [Master]
@article{Poincare1895,
author = {Poincar{\'e}, Henri},
title = {Analysis Situs},
journal = {Journal de l'{\'E}cole Polytechnique},
volume = {(2) 1},
year = {1895},
pages = {1--121}
}
@article{EilenbergZilber1950,
author = {Eilenberg, Samuel and Zilber, Joseph A.},
title = {Semi-simplicial complexes and singular homology},
journal = {Ann. of Math. (2)},
volume = {51},
year = {1950},
pages = {499--513}
}
@book{EilenbergSteenrod1952,
author = {Eilenberg, Samuel and Steenrod, Norman E.},
title = {Foundations of Algebraic Topology},
publisher = {Princeton University Press},
year = {1952}
}
@book{May1967,
author = {May, J. Peter},
title = {Simplicial Objects in Algebraic Topology},
publisher = {University of Chicago Press},
year = {1967},
note = {Reprinted in the Chicago Lectures in Mathematics series, 1992.}
}
@book{Quillen1967,
author = {Quillen, Daniel G.},
title = {Homotopical Algebra},
series = {Lecture Notes in Mathematics},
volume = {43},
publisher = {Springer-Verlag},
year = {1967}
}
@article{RourkeSanderson1971a,
author = {Rourke, Colin P. and Sanderson, Brian J.},
title = {$\Delta$-Sets I: Homotopy Theory},
journal = {Quart. J. Math. Oxford Ser. (2)},
volume = {22},
year = {1971},
pages = {321--338}
}
@article{RourkeSanderson1971b,
author = {Rourke, Colin P. and Sanderson, Brian J.},
title = {$\Delta$-Sets II: Block Bundles and Block Fibrations},
journal = {Quart. J. Math. Oxford Ser. (2)},
volume = {22},
year = {1971},
pages = {465--485}
}
@book{HatcherAlgebraicTopology,
author = {Hatcher, Allen},
title = {Algebraic Topology},
publisher = {Cambridge University Press},
year = {2002}
}
@book{GoerssJardine1999,
author = {Goerss, Paul G. and Jardine, John F.},
title = {Simplicial Homotopy Theory},
series = {Progress in Mathematics},
volume = {174},
publisher = {Birkh{\"a}user},
year = {1999}
}
@book{tomDieckAlgebraicTopology,
author = {tom Dieck, Tammo},
title = {Algebraic Topology},
publisher = {European Mathematical Society},
year = {2008}
}
@book{Lefschetz1930,
author = {Lefschetz, Solomon},
title = {Topology},
series = {AMS Colloquium Publications},
volume = {12},
publisher = {American Mathematical Society},
year = {1930}
}