Article contents
Any Spine of the Cube is 2-Collapsible
Published online by Cambridge University Press: 20 November 2018
Extract
1. Introduction. M. Cohen [1] denned a polyhedron K to be n-collapsible if K × In PL collapses. He proved that any spine of the cube B3 is 3-collapsible. This was a step directed toward the Zeeman Conjecture [4], which asserts that every compact contractible 2-polyhedron is 1-collapsible. In this paper we improve the result of Cohen by one dimension (Theorem 3): Any spine of the cube is 2-collapsible. The central question of 1-collapsibility remains unanswered.
Gillman and Rolfsen [3] have shown that any standard spine of the cube is 1-collapsible. Conjecture: If K is any spine of the cube, then K × I collapses to a standard spine of the cube. This would imply our main theorem. Lacking a proof of this conjecture, we must resort to an argument independent of [3].
THEOREM 1. Let A1, A2, …, Anbe a finite collection of pairwise disjoint contractible PL subsets of the cube. Then the decomposition obtained by shrinking each Ai to a point is 1-collapsible.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1983
References
- 1
- Cited by