Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

No continuous retraction of the closed unit ball onto its boundary sphere

Proved
AGT.no_retraction_unitBall

by korbonits · Sep 4, 2026 · Mathlib c5ea003 (Lean v4.30.0)

algorithmic-game-theorybrouwerfixed-point-theoremtopology

The no-retraction theorem. Let n≥0n \ge 0n≥0, let B‾n={x∈Rn:∥x∥2≤1}\overline{B}^n = \{x \in \mathbb{R}^n : \|x\|_2 \le 1\}Bn={x∈Rn:∥x∥2​≤1} be the closed unit ball and Sn−1={x:∥x∥2=1}S^{n-1} = \{x : \|x\|_2 = 1\}Sn−1={x:∥x∥2​=1} its boundary sphere. There is no continuous retraction of the ball onto its boundary: no map r:B‾n→Sn−1r : \overline{B}^n \to S^{n-1}r:Bn→Sn−1 that is continuous and satisfies

r(x)=xfor every x∈Sn−1.r(x) = x \qquad \text{for every } x \in S^{n-1}.r(x)=xfor every x∈Sn−1.

Equivalently, the identity map of Sn−1S^{n-1}Sn−1 does not extend to a continuous map B‾n→Sn−1\overline{B}^n \to S^{n-1}Bn→Sn−1. This is the classical form in which Brouwer's fixed-point theorem is usually proved: in homological language it says that Sn−1S^{n-1}Sn−1 is not contractible via the ball (Hn−1(Sn−1)≠0H_{n-1}(S^{n-1}) \ne 0Hn−1​(Sn−1)=0 while Hn−1(B‾n)=0H_{n-1}(\overline{B}^n) = 0Hn−1​(Bn)=0); Milnor (1978) and Rogers (1980) give analytic proofs that avoid homology by smoothing rrr and computing the volume of the image of x↦x+t (r(x)−x)x \mapsto x + t\,(r(x) - x)x↦x+t(r(x)−x) as a polynomial in ttt. The theorem is equivalent to Brouwer's fixed-point theorem for the ball (AGT.brouwer_fixed_point_unitBall): a fixed-point-free continuous self-map fff of the ball yields the retraction sending xxx to the point where the ray from f(x)f(x)f(x) through xxx leaves the ball, and conversely a retraction rrr composed with the antipodal map is a fixed-point-free self-map.

A note on the hypotheses. For n=0n = 0n=0 the ball is a single point and the sphere is empty, so no map into the sphere exists at all and the statement holds vacuously; for n=1n = 1n=1 it is the intermediate value theorem. Continuity is only required on the ball; values of rrr outside the ball are irrelevant.

Formalization Note. The ambient space is EuclideanSpace ℝ (Fin n); the ball is Metric.closedBall 0 1 and the sphere Metric.sphere 0 1. The retraction is given as a total function r : ℝⁿ → ℝⁿ with ContinuousOn r (closedBall 0 1), Set.MapsTo r (closedBall 0 1) (sphere 0 1), and the fixed-point condition on the sphere; the conclusion is False.

Preamble
import Mathlib.Analysis.InnerProductSpace.PiL2
Formal statement
namespace AGT

/-- **No-retraction theorem.**  There is no continuous retraction of the closed
unit ball of Euclidean space `ℝⁿ` onto its boundary sphere: no map `r`,
continuous on the closed ball, taking values in the unit sphere, and fixing
every point of the sphere.  Equivalent to Brouwer's fixed-point theorem for the
ball; it is the statement proved by homological, analytic (Milnor, Rogers) and
combinatorial arguments. -/
theorem no_retraction_unitBall (n : ℕ)
    (r : EuclideanSpace ℝ (Fin n) → EuclideanSpace ℝ (Fin n))
    (hr : ContinuousOn r (Metric.closedBall 0 1))
    (hrS : Set.MapsTo r (Metric.closedBall 0 1) (Metric.sphere 0 1))
    (hfix : ∀ x ∈ Metric.sphere (0 : EuclideanSpace ℝ (Fin n)) 1, r x = x) : False := by
  sorry

end AGT
Source
J. Milnor, Analytic proofs of the "hairy ball theorem" and the Brouwer fixed point theorem, Amer. Math. Monthly 85 (1978), 521-524, p. 521 (the theorem that the unit sphere is not a retract of the closed ball, proved in Section 2); C. A. Rogers, A less strange version of Milnor's proof of Brouwer's fixed-point theorem, Amer. Math. Monthly 87 (1980), 525-527; classical form of L. E. J. Brouwer, Über Abbildungen von Mannigfaltigkeiten, Math. Ann. 71 (1911), 97-115, https://doi.org/10.1007/BF01456931. Supporting result for Theorem 1.8 of Nisan-Roughgarden-Tardos-Vazirani (eds.), Algorithmic Game Theory, Cambridge 2007, Ch. 1.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me