A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

CW Complexes

Research Depth 83 in the knowledge graph ☐ I know this ☆ Set as goal
9topics build on this
389prerequisites beneath it
See this on the map →
Delta-ComplexesQuotient Topology+1 more→→Cellular HomologyHigher Homotopy Groups+1 more
algebraic-topology cw-complexes cell-structures homotopy-theory

Core Idea

A CW complex is a topological space built inductively by attaching cells (disks) of increasing dimension via continuous maps on their boundaries. Starting from a discrete set of points (0-skeleton), we attach 1-cells (intervals) along their endpoints, then 2-cells (disks) along their boundary circles, and so on. CW complexes are the natural habitat of algebraic topology: they are general enough to model all reasonable topological spaces (every manifold, every polyhedron, every simplicial complex), yet structured enough that homology, cohomology, and homotopy groups can be computed efficiently via cellular methods.

Explainer

A CW complex is built by an inductive process of cell attachment. Start with a discrete set X0 of points (the 0-skeleton). The n-skeleton Xn is obtained from Xn-1 by attaching n-cells: for each n-cell e_alphan, take a copy of the closed n-disk Dn and glue it to Xn-1 along a continuous attaching map phi_alpha : Sn-1 = boundary(Dn) -> Xn-1. The resulting space is Xn = Xn-1 union_{phi_alpha} Dn (a quotient of the disjoint union that identifies each point of Sn-1 with its image under phi_alpha). The CW complex X is the union X = union Xn with the weak topology: a set is open in X if and only if its intersection with every Xn is open.

The key feature of CW complexes is the flexibility of the attaching maps. In a simplicial complex, simplices must be glued face-to-face with all vertices distinct. In a CW complex, the attaching map phi : Sn-1 -> Xn-1 can be any continuous map — it can collapse part of the boundary, wrap it around multiple times, or map it to a lower-dimensional skeleton. This flexibility allows extremely economical cell structures. The sphere Sn needs only two cells (one 0-cell and one n-cell), the torus needs one 0-cell, two 1-cells, and one 2-cell, and complex projective space CPn needs just one cell in each even dimension up to 2n.

The cellular chain complex of a CW complex gives the most efficient route to computing homology. The n-th cellular chain group is the free abelian group on the n-cells: C_nCW(X) = Znumber of n-cells. The cellular boundary operator d_n : C_nCW -> C_{n-1}^{CW} is determined by the degrees of the attaching maps: the coefficient of en-1_beta in d_n(en_alpha) is the degree of the composite map Sn-1 -> Xn-1 -> Xn-1/Xn-2 = wedge of (n-1)-spheres -> Sn-1_beta. The resulting homology H_nCW(X) is isomorphic to the singular homology H_n(X). For CPn, the cellular chain complex is 0 -> Z -> 0 -> Z -> 0 -> ... -> Z -> 0, and all boundary maps are zero (since there are no adjacent-dimension cells), immediately giving H_{2k}(CPn) = Z.

Two fundamental theorems in homotopy theory demonstrate the centrality of CW complexes. Whitehead's theorem states that a continuous map between CW complexes that induces isomorphisms on all homotopy groups is a homotopy equivalence. This fails for general spaces but holds for CW complexes because of their inductive cell structure. The CW approximation theorem states that every topological space is weakly homotopy equivalent to a CW complex — meaning there exists a CW complex with the same homotopy groups, homology groups, and cohomology groups. Together, these theorems mean that for the purposes of algebraic topology, CW complexes are the canonical class of spaces: every "algebraic topology question" can be answered within the world of CW complexes.

Practice Questions 4 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → De Morgan's Laws → Negation of Quantified Statements → Proof by Contradiction → Topological Spaces: Definition and Examples → Open Sets in Topological Spaces → Neighborhoods and Open Sets → Open Sets in Topological Spaces → Basis for a Topology → Neighborhoods and Local Properties → Limit Points and Convergence → Separation Axioms: T₀, T₁, and T₂ (Hausdorff) → Hausdorff Spaces → Introduction to Topological Manifolds → Simplicial Complexes → Delta-Complexes → CW Complexes

Longest path: 84 steps · 389 total prerequisite topics

Prerequisites (3)

Leads To (3)