Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.4: the Fadell–Neuwirth exact sequence for the plane

Proved
BraidsLinksMCG.thm_1_4_fadell_neuwirth_exact

by LG · Sep 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-topologyconfiguration-spacesfundamental-group

Theorem 1.4 (for M=E2M = E^2M=E2). Let π:F0,n+1E2→F0,nE2\pi : F_{0,n+1}E^2 \to F_{0,n}E^2π:F0,n+1​E2→F0,n​E2 be the projection (1-4) deleting the last point, and let jjj be the inclusion (1-6) of the punctured plane E2−{1,…,n}E^2 - \{1,\dots,n\}E2−{1,…,n} into F0,n+1E2F_{0,n+1}E^2F0,n+1​E2 as the last coordinate, z↦(1,…,n,z)z \mapsto (1,\dots,n,z)z↦(1,…,n,z). Then the sequence

1⟶π1(E2−{1,…,n})→  j∗  π1F0,n+1E2→  π∗  π1F0,nE2⟶11 \longrightarrow \pi_1\bigl(E^2 - \{1,\dots,n\}\bigr) \xrightarrow{\;j_*\;} \pi_1 F_{0,n+1}E^2 \xrightarrow{\;\pi_*\;} \pi_1 F_{0,n}E^2 \longrightarrow 11⟶π1​(E2−{1,…,n})j∗​​π1​F0,n+1​E2π∗​​π1​F0,n​E2⟶1

is exact: j∗j_*j∗​ is injective, π∗\pi_*π∗​ is surjective, and the image of j∗j_*j∗​ is the kernel of π∗\pi_*π∗​. Base points are the configuration (1,2,…,k)(1,2,\dots,k)(1,2,…,k) in each configuration space and the point n+1n+1n+1 in the punctured plane.

The plane satisfies the hypothesis of the general theorem, namely that the complement of a finite point set has vanishing π0\pi_0π0​, π2\pi_2π2​ and π3\pi_3π3​; the statement is indexed by n+1n+1n+1 rather than nnn so that the projection is stated without truncated subtraction.

Preamble
import Mathlib
import Definitions.Def_BraidsLinksMCG_ConfigSpace
Formal statement
namespace BraidsLinksMCG

theorem thm_1_4_fadell_neuwirth_exact (n : ℕ) :
    Function.Injective (FundamentalGroup.mapOfEq (configIncl n) (configIncl_base n)) ∧
      Function.Surjective (FundamentalGroup.mapOfEq (configForget n) (configForget_base n)) ∧
      (FundamentalGroup.mapOfEq (configIncl n) (configIncl_base n)).range =
        (FundamentalGroup.mapOfEq (configForget n) (configForget_base n)).ker := by sorry

end BraidsLinksMCG
Source
Joan S. Birman, *Braids, Links, and Mapping Class Groups*, Annals of Mathematics Studies 82, Princeton University Press, 1974, Chapter 1, p. 14, Theorem 1.4 (sequence (1-7)), with the maps (1-4) and (1-6); specialized to M=E2M = E^2M=E2, which satisfies the hypothesis π2(M−Qm)=π3(M−Qm)=π0(M−Qm)=1\pi_2(M - Q_m) = \pi_3(M - Q_m) = \pi_0(M - Q_m) = 1π2​(M−Qm​)=π3​(M−Qm​)=π0​(M−Qm​)=1
Read-back

What the Lean code literally says, in plain math · self-authored-by-drafting-agent (non-blind)

Provenance: non-blind read-back. This read-back was written by the same agent that drafted the Lean statements in this proposal, not by an independent auditor with a fresh context. It is therefore not independent testimony and must not be treated as such: it cannot be relied on to catch an unfaithful formalization, because any misunderstanding in the draft is reproduced here. Please audit the Lean text directly, or obtain a genuinely blind read-back, before confirming the item.

Fix a natural number n≥0n \ge 0n≥0 and consider three spaces, all built from C\mathbb{C}C:

  • Fn+1={ p:{0,…,n}→C:p injective }F_{n+1} = \{\,p : \{0,\dots,n\} \to \mathbb{C} : p \text{ injective}\,\}Fn+1​={p:{0,…,n}→C:p injective}, based at (1,2,…,n+1)(1, 2, \dots, n+1)(1,2,…,n+1);
  • FnF_nFn​, defined likewise with nnn points, based at (1,2,…,n)(1, 2, \dots, n)(1,2,…,n);
  • P=C∖{1,2,…,n}P = \mathbb{C}\setminus\{1,2,\dots,n\}P=C∖{1,2,…,n}, based at n+1n+1n+1.

Two continuous maps are used: π:Fn+1→Fn\pi : F_{n+1} \to F_nπ:Fn+1​→Fn​ deleting the last coordinate, and j:P→Fn+1j : P \to F_{n+1}j:P→Fn+1​, j(z)=(1,2,…,n,z)j(z) = (1, 2, \dots, n, z)j(z)=(1,2,…,n,z). Both carry base point to base point, and the induced homomorphisms of fundamental groups at those base points are denoted π∗\pi_*π∗​ and j∗j_*j∗​.

The statement is the conjunction of three assertions:

  1. j∗:π1(P,n+1)→π1(Fn+1,(1,…,n+1))j_* : \pi_1(P, n+1) \to \pi_1(F_{n+1}, (1,\dots,n+1))j∗​:π1​(P,n+1)→π1​(Fn+1​,(1,…,n+1)) is injective;
  2. π∗:π1(Fn+1,(1,…,n+1))→π1(Fn,(1,…,n))\pi_* : \pi_1(F_{n+1}, (1,\dots,n+1)) \to \pi_1(F_n, (1,\dots,n))π∗​:π1​(Fn+1​,(1,…,n+1))→π1​(Fn​,(1,…,n)) is surjective;
  3. the image of j∗j_*j∗​ equals the kernel of π∗\pi_*π∗​, as subgroups of π1(Fn+1,(1,…,n+1))\pi_1(F_{n+1}, (1,\dots,n+1))π1​(Fn+1​,(1,…,n+1)).

Together these say that 1→π1(P)→π1(Fn+1)→π1(Fn)→11 \to \pi_1(P) \to \pi_1(F_{n+1}) \to \pi_1(F_n) \to 11→π1​(P)→π1​(Fn+1​)→π1​(Fn​)→1 is a short exact sequence for these two specific maps.

Exact logical strength. Nothing is asserted about the isomorphism type of any of the three groups — in particular freeness of π1(P)\pi_1(P)π1​(P) is not claimed here — nor about the sequence splitting, nor about naturality in nnn, nor about the maps being fibrations. Equality in (3) is equality of subgroups, i.e. containment in both directions.

Degenerate cases. n=0n = 0n=0 is included: then P=CP = \mathbb{C}P=C based at 111, F1=CF_1 = \mathbb{C}F1​=C, F0F_0F0​ is a one-point space, and all three assertions hold with all groups trivial.

Human review
  • Endorsed by Shuze Chen · Sep 13, 2026

  • Endorsed by LG · Sep 13, 2026

    Confirmed by the mission captain (proposal self-audit).

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