Math 2.0

Algebraic topology Fixed points and degree Theorem

No-retraction theorem

Builds on Closed balln-sphereContinuous mapReduced homology

Statement

Let n≥1n \ge 1, let Dn={x∈ℝn:∥x∥≤1}D^n = \set{x \in \R^n : \norm{x} \le 1} be the closed unit ball, and let Sn−1={x∈ℝn:∥x∥=1}S^{n-1} = \set{x \in \R^n : \norm{x} = 1} be its boundary sphere. There is no continuous map r ⁣:Dn→Sn−1r \colon D^n \to S^{n-1} with r(x)=xr(x) = x for all x∈Sn−1x \in S^{n-1}.

Remarks

Suppose such a retraction rr exists, and let i ⁣:Sn−1→Dni \colon S^{n-1} \to D^n be the inclusion, so that r∘i=id⁡Sn−1r \circ i = \id_{S^{n-1}}. Apply reduced homology in degree n−1n - 1: the identity of H~n−1(Sn−1;ℤ)≅ℤ\tilde{H}_{n-1}(S^{n-1}; \Z) \cong \Z factors through H~n−1(Dn;ℤ)=0\tilde{H}_{n-1}(D^n; \Z) = 0, which is impossible. For n=1n = 1 the argument is simply that D1=[−1,1]D^1 = [-1, 1] is connected and S0={−1,1}S^0 = \set{-1, 1} is not. For smooth retractions there is also a proof by Sard's theorem: the preimage of a regular value would be a compact 11-manifold with only one boundary point.

Example of use: the theorem gives the Brouwer fixed-point theorem. If f ⁣:Dn→Dnf \colon D^n \to D^n had no fixed point, the ray from f(x)f(x) through xx would meet Sn−1S^{n-1} in a point r(x)r(x), and rr would be a retraction of DnD^n onto Sn−1S^{n-1}.

The ball cannot be replaced by any space: the cylinder Sn−1×[0,1]S^{n-1} \times [0, 1] retracts onto its end Sn−1×{0}S^{n-1} \times \set{0} by (x,t)↦(x,0)(x, t) \mapsto (x, 0).

Going deeper

For a student

The no-retraction theorem is equivalent to the Brouwer fixed-point theorem, and each implies the other with a short argument. In homotopy terms, it says that the identity map of Sn−1S^{n-1} is not null-homotopic, and so it is a statement about the degree of the identity. Similar retraction arguments, with homology or cohomology, show that the boundary of a compact manifold is never a retract of the manifold.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Closed ball concept
  2. Continuous map concept
  3. Reduced homology concept
  4. n-sphere object
  5. No-retraction theorem statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Brouwer_fixed-point_theorem
About this page
TagZ6JR1GN2RE
URIm2://Z6JR1GN2RE
Kindstatement, theorem
WritingW0 stub
MSC55M20, 54C15
StatusThis copy of the site has no build data. Run m2 status Z6JR1GN2RE.
AboutClosed ball, n-sphere
UsesClosed ball, n-sphere, Continuous map, Reduced homology
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.