logo

Definition of CW Complex 📂Topological Data Analysis

Definition of CW Complex

Overview 1

20220117_175400.png

CW complexes are a type of complex also known as Cell Complexes, constructed through the following recursive procedure.

Definition

  1. A discrete set X0X^{0} \ne \emptyset is considered as a 00-cell.
  2. A nn-skeleton XnX^{n} is created by attaching nn-cells eαne_{\alpha}^{n} into ϕα:Sn1Xn1\phi_{\alpha} : S^{n-1} \to X^{n-1} from Xn1X^{n-1}.
  3. When X:=nNXnX := \bigcup_{n \in \mathbb{N}} X^{n} becomes a topological space with a weak topology, XX is called a cell complex.

Explanation

Though the definition may seem difficult and complex, it is more approachable than it appears. Honestly, one does not need to know in great detail about CW complexes, so don’t feel too pressured.

Generalization of Graphs

The 11-skeleton is a graph in itself. Here, the 00-cells X0=VX^{0} = V represent a set of vertices, and the 11-cells X1=EX^{1} = E represent a set of edges. eα1Ee_{\alpha}^{1} \in E is an edge that connects 00-cells according to an index α\alpha, and not necessarily all 00-cells need to be connected.

From this perspective, it is acceptable to consider cell complexes as a generalization of graphs, known as Hyper Graphs. Below is an illustration of a hypergraph, where the edges eke_{k} that connect multiple vertices simultaneously correspond to the cells eαe_{\alpha}2.

262px-Hypergraph-wikipedia.png

Origin of CW 3

Most literature does not use the term Cell Complex but commonly refers to them as CW complexes. Let’s delve into the definition to understand why.

Definition of Disks, Spheres, and Cells:

  1. A DnRnD^{n} \subset \mathbb{R}^{n} defined as follows is called a nn-Unit Disk: Dn:={xRn:x1} D^{n} := \left\{ \mathbf{x} \in \mathbb{R}^{n} : \left\| \mathbf{x} \right\| \le 1 \right\}
  2. A SnRn+1S^{n} \subset \mathbb{R}^{n+1} defined as follows is called a nn-Unit Sphere: Sn:={xRn+1:x=1} S^{n} := \left\{ \mathbf{x} \in \mathbb{R}^{n+1} : \left\| \mathbf{x} \right\| = 1 \right\}
  3. A DnDnD^{n} \setminus \partial D^{n} and its homeomorphic subset ene^{n} are also called a nn-Cell.

The boundary of a nn-disk is a nn-sphere. That is, the following holds: Dn=Sn1 \partial D^{n} = S^{n-1}

There should be no big issue with X0X^{0}. That a eαne_{\alpha}^{n} attaches to a n1n-1 skeleton is similar to how a generalized kk-edge in a hypergraph connects multiple vertices. To be more precise, we are creating a quotient space by assigning an equivalence relation xϕα(x) x \sim \phi_{\alpha} (x) to all points xDαnx \in \partial D_{\alpha}^{n} of the boundary through the map ϕα:Sn1Xn1\phi_{\alpha} : S^{n-1} \to X^{n-1} corresponding to the nn-cell eαne_{\alpha}^{n}. If this explanation is difficult, one might need to review undergraduate-level topology. The idea of applying an equivalence relation in topology - treating different elements as essentially the same - intuitively means ‘connecting spaces together’. The nn-skeleton Xn:=xn1αDαnX^{n} := x^{n-1} \cup \bigsqcup_{\alpha} D_{\alpha}^{n} under these quotient mappings ϕα\phi_{\alpha} is a quotient space, and nn-cell eαne_{\alpha}^{n} is homeomorphic to the image of DαnDαnD_{\alpha}^{n} \setminus \partial D_{\alpha}^{n} under the quotient mapping ϕα\phi_{\alpha}.

Meanwhile, the fact that XX has a weak topology means that AXA \subset X being open (closed) in XX is equivalent to AXnA \cap X^{n} being open (closed) in XnX^{n} for all nNn \in \mathbb{N}. There’s no need to strenuously relate this to the general concept of weak topology; if it’s unclear, it’s fine to just move on.

After all, the CW complex got its name from the following two characteristics:

  • Closure-finiteness: The closure of each cell intersects with only a finite number of other cells. This is related to compactness.
  • Weak topology: The definition guarantees the presence of a weak topology.

  1. Edelsbrunner, Harer. (2010). Computational Topology An Introduction: p5. ↩︎

  2. https://en.wikipedia.org/wiki/Hypergraph ↩︎

  3. Edelsbrunner, Harer. (2010). Computational Topology An Introduction: p520. ↩︎