In mathematics, and specifically in topology, a CW complex (also cellular complex or cell complex) is a topological space that is built by gluing together topological balls (so-called cells) of different dimensions in specific ways. It generalizes both manifolds and simplicial complexes and has particular significance for algebraic topology.[1] It was initially introduced by J. H. C. Whitehead to meet the needs of homotopy theory.[2] CW complexes have better categorical properties than simplicial complexes, but still retain a combinatorial nature that allows for computation (often with a much smaller complex).
The C in CW stands for "closure-finite", and the W for "weak" topology.[2]
Definition
CW complex
A CW complex is constructed by taking the union of a sequence of topological spaces such that each is obtained from by gluing copies of k-cells , each homeomorphic to the open -ball , to by continuous gluing maps . The maps are also called attaching maps. Thus as a set, .
Each is called the k-skeleton of the complex.
The topology of is weak topology: a subset is open iff is open for each k-skeleton .
In the language of category theory, the topology on is the direct limit of the diagram The name "CW" stands for "closure-finite weak topology", which is explained by the following theorem:
Theorem — A Hausdorff space X is homeomorphic to a CW complex iff there exists a partition of X into "open cells" , each with a corresponding closure (or "closed cell") that satisfies:
- For each , there exists a continuous surjection from the -dimensional closed ball such that
- The restriction to the open ball is a homeomorphism.
- (closure-finiteness) The image of the boundary is covered by a finite number of closed cells, each having cell dimension less than k.
- (weak topology) A subset of X is closed if and only if it meets each closed cell in a closed set.
This partition of X is also called a cellulation.
The construction, in words
The CW complex construction is a straightforward generalization of the following process:
- A 0-dimensional CW complex is just a set of zero or more discrete points (with the discrete topology).
- A 1-dimensional CW complex is constructed by taking the disjoint union of a 0-dimensional CW complex with one or more copies of the unit interval. For each copy, there is a map that "glues" its boundary (its two endpoints) to elements of the 0-dimensional complex (the points). The topology of the CW complex is the topology of the quotient space defined by these gluing maps.
- In general, an n-dimensional CW complex is constructed by taking the disjoint union of a k-dimensional CW complex (for some ) with one or more copies of the n-dimensional ball. For each copy, there is a map that "glues" its boundary (the -dimensional sphere) to elements of the -dimensional complex. The topology of the CW complex is the quotient topology defined by these gluing maps.
- An infinite-dimensional CW complex can be constructed by repeating the above process countably many times. Since the topology of the union is indeterminate, one takes the direct limit topology, since the diagram is highly suggestive of a direct limit. This turns out to have great technical benefits.
Regular CW complexes
A regular CW complex is a CW complex whose gluing maps are homeomorphisms. Accordingly, the partition of X is also called a regular cellulation.
A loopless graph is represented by a regular 1-dimensional CW-complex. A closed 2-cell graph embedding on a surface is a regular 2-dimensional CW-complex. Finally, the 3-sphere regular cellulation conjecture claims that every 2-connected graph is the 1-skeleton of a regular CW-complex on the 3-dimensional sphere.[3]
Relative CW complexes
Roughly speaking, a relative CW complex differs from a CW complex in that we allow it to have one extra building block that does not necessarily possess a cellular structure. This extra-block can be treated as a (-1)-dimensional cell in the former definition.[4][5][6]
Examples
0-dimensional CW complexes
Every discrete topological space is a 0-dimensional CW complex.
1-dimensional CW complexes
Some examples of 1-dimensional CW complexes are:[7]
- An interval. It can be constructed from two points (x and y), and the 1-dimensional ball B (an interval), such that one endpoint of B is glued to x and the other is glued to y. The two points x and y are the 0-cells; the interior of B is the 1-cell. Alternatively, it can be constructed just from a single interval, with no 0-cells.
- A circle. It can be constructed from a single point x and the 1-dimensional ball B, such that both endpoints of B are glued to x. Alternatively, it can be constructed from two points x and y and two 1-dimensional balls A and B, such that the endpoints of A are glued to x and y, and the endpoints of B are glued to x and y too.
- A graph. Given a graph, a 1-dimensional CW complex can be constructed in which the 0-cells are the vertices and the 1-cells are the edges of the graph. The endpoints of each edge are identified with the incident vertices to it. This realization of a combinatorial graph as a topological space is sometimes called a topological graph.
- 3-regular graphs can be considered as generic 1-dimensional CW complexes. Specifically, if X is a 1-dimensional CW complex, the attaching map for a 1-cell is a map from a two-point space to X, . This map can be perturbed to be disjoint from the 0-skeleton of X if and only if and are not 0-valence vertices of X.
- The standard CW structure on the real numbers has as 0-skeleton the integers and as 1-cells the intervals . Similarly, the standard CW structure on has cubical cells that are products of the 0 and 1-cells from . This is the standard cubic lattice cell structure on .
Finite-dimensional CW complexes
Some examples of finite-dimensional CW complexes are:[7]
- An n-dimensional sphere. It admits a CW structure with two cells, one 0-cell and one n-cell. Here the n-cell is attached by the constant mapping from its boundary to the single 0-cell. An alternative cell decomposition has one (n-1)-dimensional sphere (the "equator") and two n-cells that are attached to it (the "upper hemi-sphere" and the "lower hemi-sphere"). Inductively, this gives a CW decomposition with two cells in every dimension k such that .
- The n-dimensional real projective space. It admits a CW structure with one cell in each dimension.
- The terminology for a generic 2-dimensional CW complex is a shadow.[8]
- A polyhedron is naturally a CW complex.
- Grassmannian manifolds admit a CW structure called Schubert cells.
- Differentiable manifolds, algebraic and projective varieties have the homotopy type of CW complexes.
- The one-point compactification of a cusped hyperbolic manifold has a canonical CW decomposition with only one 0-cell (the compactification point) called the Epstein–Penner Decomposition. Such cell decompositions are frequently called ideal polyhedral decompositions and are used in popular computer software, such as SnapPea.
Infinite-dimensional CW complexes
This section is empty. You can help by adding to it. (September 2024) |
Non CW-complexes
- An infinite-dimensional Hilbert space is not a CW complex: it is a Baire space and therefore cannot be written as a countable union of n-skeletons, each of which being a closed set with empty interior. This argument extends to many other infinite-dimensional spaces.
- The hedgehog space is homotopy equivalent to a CW complex (the point) but it does not admit a CW decomposition, since it is not locally contractible.
- The Hawaiian earring has no CW decomposition, because it is not locally contractible at origin. It is also not homotopy equivalent to a CW complex, because it has no good open cover.
Properties
- CW complexes are locally contractible.[9]
- If a space is homotopy equivalent to a CW complex, then it has a good open cover.[10] A good open cover is an open cover, such that every nonempty finite intersection is contractible.
- CW complexes are paracompact. Finite CW complexes are compact. A compact subspace of a CW complex is always contained in a finite subcomplex.[11][12]
- CW complexes satisfy the Whitehead theorem: a map between CW complexes is a homotopy equivalence if and only if it induces an isomorphism on all homotopy groups.
- A covering space of a CW complex is also a CW complex.[13]
- The product of two CW complexes can be made into a CW complex. Specifically, if X and Y are CW complexes, then one can form a CW complex X × Y in which each cell is a product of a cell in X and a cell in Y, endowed with the weak topology. The underlying set of X × Y is then the Cartesian product of X and Y, as expected. In addition, the weak topology on this set often agrees with the more familiar product topology on X × Y, for example if either X or Y is finite. However, the weak topology can be finer than the product topology, for example if neither X nor Y is locally compact. In this unfavorable case, the product X × Y in the product topology is not a CW complex. On the other hand, the product of X and Y in the category of compactly generated spaces agrees with the weak topology and therefore defines a CW complex.
- Let X and Y be CW complexes. Then the function spaces Hom(X,Y) (with the compact-open topology) are not CW complexes in general. If X is finite then Hom(X,Y) is homotopy equivalent to a CW complex by a theorem of John Milnor (1959).[14] Note that X and Y are compactly generated Hausdorff spaces, so Hom(X,Y) is often taken with the compactly generated variant of the compact-open topology; the above statements remain true.[15]
- Cellular approximation theorem
Homology and cohomology of CW complexes
Singular homology and cohomology of CW complexes is readily computable via cellular homology. Moreover, in the category of CW complexes and cellular maps, cellular homology can be interpreted as a homology theory. To compute an extraordinary (co)homology theory for a CW complex, the Atiyah–Hirzebruch spectral sequence is the analogue of cellular homology.
Some examples:
- For the sphere, take the cell decomposition with two cells: a single 0-cell and a single n-cell. The cellular homology chain complex and homology are given by:
- since all the differentials are zero.
- Alternatively, if we use the equatorial decomposition with two cells in every dimension
- and the differentials are matrices of the form This gives the same homology computation above, as the chain complex is exact at all terms except and
- For we get similarly
Both of the above examples are particularly simple because the homology is determined by the number of cells—i.e.: the cellular attaching maps have no role in these computations. This is a very special phenomenon and is not indicative of the general case.
Modification of CW structures
There is a technique, developed by Whitehead, for replacing a CW complex with a homotopy-equivalent CW complex that has a simpler CW decomposition.
Consider, for example, an arbitrary CW complex. Its 1-skeleton can be fairly complicated, being an arbitrary graph. Now consider a maximal forest F in this graph. Since it is a collection of trees, and trees are contractible, consider the space where the equivalence relation is generated by if they are contained in a common tree in the maximal forest F. The quotient map is a homotopy equivalence. Moreover, naturally inherits a CW structure, with cells corresponding to the cells of that are not contained in F. In particular, the 1-skeleton of is a disjoint union of wedges of circles.
Another way of stating the above is that a connected CW complex can be replaced by a homotopy-equivalent CW complex whose 0-skeleton consists of a single point.
Consider climbing up the connectivity ladder—assume X is a simply-connected CW complex whose 0-skeleton consists of a point. Can we, through suitable modifications, replace X by a homotopy-equivalent CW complex where consists of a single point? The answer is yes. The first step is to observe that and the attaching maps to construct from form a group presentation. The Tietze theorem for group presentations states that there is a sequence of moves we can perform to reduce this group presentation to the trivial presentation of the trivial group. There are two Tietze moves:
- 1) Adding/removing a generator. Adding a generator, from the perspective of the CW decomposition consists of adding a 1-cell and a 2-cell whose attaching map consists of the new 1-cell and the remainder of the attaching map is in . If we let be the corresponding CW complex then there is a homotopy equivalence given by sliding the new 2-cell into X.
- 2) Adding/removing a relation. The act of adding a relation is similar, only one is replacing X by where the new 3-cell has an attaching map that consists of the new 2-cell and remainder mapping into . A similar slide gives a homotopy-equivalence .
If a CW complex X is n-connected one can find a homotopy-equivalent CW complex whose n-skeleton consists of a single point. The argument for is similar to the case, only one replaces Tietze moves for the fundamental group presentation by elementary matrix operations for the presentation matrices for (using the presentation matrices coming from cellular homology. i.e.: one can similarly realize elementary matrix operations by a sequence of addition/removal of cells or suitable homotopies of the attaching maps.
'The' homotopy category
The homotopy category of CW complexes is, in the opinion of some experts, the best if not the only candidate for the homotopy category (for technical reasons the version for pointed spaces is actually used).[16] Auxiliary constructions that yield spaces that are not CW complexes must be used on occasion. One basic result is that the representable functors on the homotopy category have a simple characterisation (the Brown representability theorem).
See also
- Abstract cell complex
- The notion of CW complex has an adaptation to smooth manifolds called a handle decomposition, which is closely related to surgery theory.
References
Wikiwand in your browser!
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.