A CW complex is built inductively by attaching discs along maps from their boundary spheres. Its -skeleton contains all cells of dimension at most .
A compact subset of a CW complex is contained in a finite CW complex that is a subcomplex of the original complex. Otherwise choose one point in each of infinitely many cells met by the subset. The closure-finiteness axiom makes each closed cell meet the chosen set in finitely many points. The weak topology axiom then makes the chosen set, and each of its subsets, closed. It is consequently an infinite closed discrete subspace of the compact subset, a contradiction. Only finitely many cells are met; their closures form a finite subcomplex containing the subset.
The -skeleton of a CW complex is the subcomplex consisting of its topological cells of dimension at most . A cellular map preserves these skeleta. The cellular approximation theorem lets continuous maps respect this filtration up to homotopy.
An open -cell of a CW complex is a copy of an open -dimensional ball. Its characteristic map is a map from a closed ball whose interior parametrizes that cell and whose boundary lands in the preceding skeleton. The characteristic map need not be injective on the boundary. Each oriented cell gives one generator of the cellular chain complex.
A CW pair consists of a CW complex and a subcomplex . Its inclusion is a cofibration, so homotopies on extend across . The relative lifting property of a Serre fibration for such pairs allows specified boundary lifts to be retained while lifting a homotopy.
Attaching a -cell along forms the quotient of identifying each boundary point with its image under . A constant attaching map gives . An attaching map can affect the cohomology ring even when it does not change the additive cohomology groups.
Attaching cells of dimension to a connected CW complex, for , preserves all homotopy groups below degree . In degree it takes the quotient by the subgroup generated by the attaching maps and their translates under the fundamental group action. This follows from the relative homotopy sequence and the generation of the first nonzero relative group by the new cells. In particular, a single attaching map representing a generator of kills that group even when the fundamental group is nontrivial. Higher attachments can create higher homotopy groups, which may then be killed at later stages.
The weak topology of a CW complex is determined by its closed cells: a subset is closed if and only if its inverse image under every characteristic map from a closed cell is closed. A map out of the complex is continuous when its restrictions along those characteristic maps are continuous. This is distinct from the weak topology of a vector space. Taking the product with a locally finite CW complex, such as a closed interval with its finite cell structure, retains the corresponding CW weak topology.
A topological graph is a CW complex with only zero-cells and one-cells, called vertices and edges. Edge endpoints attach to vertices; loops, multiple edges and infinitely many edges are allowed. A subgraph in this setting is a CW subcomplex. A connected acyclic graph is a tree and is a contractible space.
A CW subcomplex is a union of cells of a CW complex containing the attaching boundary of every included cell. In a combinatorial 2-complex, including a two-cell therefore includes every edge in its boundary. A connected CW subcomplex has a connected 1-skeleton, whose intrinsic path metric may differ from the ambient graph metric.
The one-skeleton of a CW complex is the union of its zero-cells and one-cells. It is a graph. The unit-edge path metric measures the infimum of lengths of paths in this graph; it is different from metrics that allow paths through two-cell interiors.
A two-dimensional CW complex has cells only in dimensions zero, one and two. In a combinatorial two-complex the two-cells are polygons attached by combinatorial edge paths. Its 1-skeleton carries the path metric assigning length one to each edge. Compact combinatorial complexes have finitely many cells, so their cell-boundary lengths have a finite maximum.
A disc diagram over a combinatorial 2-complex is a finite contractible planar combinatorial complex together with a combinatorial map to that complex. Its exterior boundary circuit records a null-homotopic path. Tree portions and cut vertices are allowed; the diagram need not be an embedded disk or map injectively. Its area is its number of two-cells.
A ladder is a disc diagram whose blocks form a linear chain, each block a two-cell or a connecting edge, with cells attached successively along interior arcs. Its boundary consists of two opposite side paths between its ends. Every cell meets both side paths. If cell perimeters are bounded by , each point of one side is within of the other by traveling around a cell boundary; connecting edge paths coincide on the two sides.
A spur is an exposed degree-one vertex and its incident edge in a disc diagram. The exterior boundary runs out along that edge and immediately back. Thus a spur in the interior of a boundary side contradicts that side being a reduced combinatorial path or a metric geodesic. A diagram with no two-cells may be a tree and have spurs rather than shells.
A shell is an exposed two-cell in a disc diagram, with perimeter split as an exterior boundary arc and an interior path . An -shell has consisting of interior pieces. Under , an -shell with has , so removal replaces a long exterior path by a strictly shorter path.
A closed combinatorial path in a 2-complex is null-homotopic exactly when it is the boundary path of a disc diagram over that complex. A finite cellular null-homotopy can be arranged into such a planar diagram; conversely the contractible diagram supplies a null-homotopy. In a group presentation, this is the geometric form of expressing a trivial word as a product of conjugates of relators.
A disc diagram is reduced if it has no adjacent pair of two-cells that can be folded together across their common boundary and removed while preserving the outside boundary. A minimum-area diagram is reduced. Among diagrams of minimum area, minimizing the number of edges removes unnecessary tree portions. Internal common arcs in a reduced diagram satisfy the applicable small cancellation theory piece bounds.
A cellular map between CW complexes satisfies for every skeleton. It induces a chain map .
A continuous map between CW complexes is homotopic to a cellular map. If the map is already cellular on a subcomplex, the homotopy can be taken relative to that subcomplex. In particular, a map from a -dimensional CW complex can be deformed into the -skeleton of the target. This permits finite cellular chain complexes to compute induced homology maps, and turns maps to Complex projective space into maps to an appropriate finite-dimensional projective skeleton.
A map from the -sphere to a CW complex can be homotoped into its -skeleton. By compact subsets of CW complexes lie in finite subcomplexes, its image lies in a finite subcomplex. For a top-dimensional cell of dimension , use smooth approximation of maps into Euclidean space in its interior, with a cutoff supported away from the cell boundary. The Sard theorem supplies a point in a smaller interior ball omitted by the smoothed map; the cutoff is chosen so the transition region also avoids that point. Radial retraction from the omitted point pushes the image into the cell boundary and fixes all other cells. Repeating over the finitely many higher-dimensional cells proves the assertion, without assuming the initial continuous image has measure zero.
A finite CW complex has finitely many cells. Its cellular chain complex consists of finitely generated free abelian groups and vanishes outside finitely many degrees, so its integral homology groups are finitely generated.
Suppose a compact skeleton embeds as . Attach a disk by and extend its boundary coordinate map radially by . Map the disk to and to . The boundary identifications agree; a positive last coordinate recovers each interior point. This defines a continuous injection of the compact quotient into Euclidean space, hence an embedding. Repeating proves Hausdorffness and Euclidean embeddability for every finite CW complex, without assuming triangulability of arbitrary attaching maps.
A CW approximation of a space is a CW complex with a weak homotopy equivalence . The realization of the singular simplicial set of supplies one functorially.
For simply connected with finitely generated integral homology in every degree, the Hurewicz theorem modulo a Serre class gives finitely generated homotopy groups. Realize finite generating sets of successive relative homotopy groups by attaching finitely many cells at each stage. The resulting weak equivalence has finitely many cells in each dimension.
Start with a finite -dimensional -connected approximation. Its degree- homology kernel is finite free. Realize a basis via the Relative Hurewicz theorem and attach -cells; their boundary is injective, so they kill precisely that kernel without adding top homology. The homological Whitehead theorem gives a finite weak equivalence of dimension at most .
A CW filtration builds a CW complex by its skeleta
where each quotient is a wedge of -spheres, one for each -cell.
For an abelian group and an integer , a Moore space is a CW complex whose reduced homology is in degree and zero in every other degree.
Attach an -cell to by a degree- map, with and . The integral cellular differential is multiplication by , while its modulo- reduction is zero. Lifting the degree- generator modulo and applying the differential gives , so the Bockstein homomorphism sends that generator to the degree- generator. This supplies a nonzero example in every positive degree.
Attaching a two-cell to by a map of degree gives the Moore space . Its positive-dimensional cellular chain complex is
so and all its other reduced integral homology groups vanish.

Ancestors (5)

  1. Algebraic topology
  2. Geometry and topology
  3. Area of mathematics
  4. Mathematics
  5. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

A CW complex (pronounced "C-W complex") is a type of topological space that is particularly useful in algebraic topology. The term "CW" stands for "cellular" and "weak," referring to the construction method used to create such complexes. A CW complex is constructed using "cells," which are basic building blocks, typically in the shape of disks of different dimensions.