The punctured right half-space of the complex plane is path connected
ProvedBraidsLinksMCG.rightRegion_pathConnectedLet be an integer and let be the complex plane with the first positive integers removed. The set in question is a punctured open half-space.
Every puncture lies on the real axis, so a point of the set with nonzero imaginary part is never a puncture. The proof therefore reduces to a three-way split on the imaginary part: the upper and lower open half-planes inside the region are convex and are traversed by a single segment, and a point on the real axis is joined directly to an off-axis anchor along a segment whose interior has strictly positive imaginary part and whose only real point is its base, a non-puncture by hypothesis.
This is one of the two convex regions used in an open cover of the punctured plane for the computation of its fundamental group.
Formalization Note The set is the intersection of the half-space with the complement of the range of the punctures, so a nonreal point is a non-puncture directly from Set.mem_compl_iff.
import Mathlib import Definitions.Def_BraidsLinksMCG_ConfigSpace import Definitions.Def_Hatcher_VanKampen
import Mathlib
import Definitions.Def_BraidsLinksMCG_ConfigSpace
import Definitions.Def_Hatcher_VanKampen
namespace BraidsLinksMCG
open Set
/-- The punctures of the plane `E_n = C \ {1, ..., n+1}`: all real, all at
most `n + 1`. -/
def punctures (n : ℕ) : Set ℂ :=
Set.range (fun j : Fin (n + 1) => ((j + 1 : ℕ) : ℂ))
/-- The punctured open right half-space `{z | n + 1/4 < z.re}`, which lies strictly beyond the last puncture apart from a margin of one quarter. -/
def rightRegion (n : ℕ) : Set ℂ :=
{z : ℂ | ((n : ℝ) + 1 : ℝ) - 3 / 4 < z.re} ∩ (punctures n)ᶜ
theorem rightRegion_pathConnected (n : ℕ) :
IsPathConnected (rightRegion n) := by sorry
end BraidsLinksMCG