Article · Wikipedia archive · Last revised Jul 13, 2026

Collapse (topology)

In topology, a branch of mathematics, a collapse reduces a simplicial complex to a homotopy-equivalent subcomplex. Collapses, like CW complexes themselves, were invented by J. H. C. Whitehead. Collapses find applications in computational homology.

Last revised
Jul 13, 2026
Read time
≈ 2 min
Length
370 w
Citations
4
Source

In topology, a branch of mathematics, a collapse reduces a simplicial complex (or more generally, a CW complex) to a homotopy-equivalent subcomplex. Collapses, like CW complexes themselves, were invented by J. H. C. Whitehead.1 Collapses find applications in computational homology.2

Definition

Let K {\displaystyle K} be an abstract simplicial complex.

Suppose that τ , σ {\displaystyle \tau ,\sigma } are two simplices of K {\displaystyle K} such that the following two conditions are satisfied:

  1. τ σ , {\displaystyle \tau \subsetneq \sigma ,} in particular dim τ < dim σ ; {\displaystyle \dim \tau <\dim \sigma ;}
  2. σ {\displaystyle \sigma } is a maximal face of K {\displaystyle K} and no other maximal face of K {\displaystyle K} contains τ , {\displaystyle \tau ,}

then τ {\displaystyle \tau } is called a free face.

A simplicial collapse of K {\displaystyle K} is the removal of all simplices γ {\displaystyle \gamma } such that τ γ σ , {\displaystyle \tau \subseteq \gamma \subseteq \sigma ,} where τ {\displaystyle \tau } is a free face. If additionally we have dim τ = dim σ 1 , {\displaystyle \dim \tau =\dim \sigma -1,} then this is called an elementary collapse.

A simplicial complex that has a sequence of collapses leading to a point is called collapsible. Every collapsible complex is contractible, but the converse is not true.

This definition can be extended to CW-complexes and is the basis for the concept of simple-homotopy equivalence.3

Examples

See also

See also

References

References

  1. Whitehead, J.H.C. (1938). "Simplicial spaces, nuclei and m-groups". Proceedings of the London Mathematical Society. 45: 243–327.
  2. Kaczynski, Tomasz (2004). Computational homology. Mischaikow, Konstantin Michael, Mrozek, Marian. New York: Springer. ISBN 9780387215976. OCLC 55897585.
  3. Cohen, Marshall M. (1973) A Course in Simple-Homotopy Theory, Springer-Verlag New York