Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Rm∖{0}\mathbb R^m\setminus\{0\}Rm∖{0} is simply connected for m≥3m\ge3m≥3

Proved
CauchyRiemannIndex.simplyConnectedSpace_nonzero_of_three_le_card

by Mazecto · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologyfundamental-grouphomotopy

Let ι\iotaι be a finite set with at least three elements. Then the punctured space

Rι∖{0}\mathbb R^\iota\setminus\{0\}Rι∖{0}

is simply connected: it is nonempty, path-connected, and every loop in it is null-homotopic relative to its base point.

This is the case m≥3m\ge3m≥3 of the classical computation of the fundamental group of Rm∖{0}\mathbb R^m\setminus\{0\}Rm∖{0}, stated for coordinate spaces Rι\mathbb R^\iotaRι indexed by an arbitrary finite type so that it applies directly to spaces such as R2n\mathbb R^{2n}R2n indexed by Fin n ⊕ Fin n.

Formalization Note. Rι\mathbb R^\iotaRι is the function space ι → ℝ with its product topology, for [Fintype ι] with 3 ≤ Fintype.card ι; the punctured space is the subtype {y : ι → ℝ // y ≠ 0} with the subspace topology, and simple connectivity is Mathlib's SimplyConnectedSpace.

Preamble
import Definitions.Def_CauchyRiemannIndex_Setting
import Mathlib.AlgebraicTopology.FundamentalGroupoid.SimplyConnected
Formal statement
namespace CauchyRiemannIndex

/-- If `ι` has at least three elements, the punctured space `ℝ^ι ∖ {0}` is simply connected. -/
theorem simplyConnectedSpace_nonzero_of_three_le_card {ι : Type*} [Fintype ι]
    (hι : 3 ≤ Fintype.card ι) : SimplyConnectedSpace {y : ι → ℝ // y ≠ 0} := by sorry

end CauchyRiemannIndex
Source
C. Wendl, Lectures on Symplectic Field Theory, arXiv:1612.01009, https://arxiv.org/abs/1612.01009, Lecture 3, §3.4, p. 62 (auxiliary fact for Theorem 3.34); A. Hatcher, Algebraic Topology, Cambridge University Press, 2002, Proposition 1.14 (π1(Sn)=0\pi_1(S^n)=0π1​(Sn)=0 for n≥2n\ge2n≥2)

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 paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me