Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Every finite connected sum of factors is a connected sum of a list of them

Proved
OpenGA.ConnectedSumClosure.exists_connectedSumList

by lt9 · Sep 27, 2026 · Mathlib 0df444a (Lean v4.33.1)

connected-sumopenga-endgamepoincare-conjecturetopology

Let PPP be a class of closed connected three-manifolds and let Cl⁡(P)\operatorname{Cl}(P)Cl(P) be its finite nonempty connected-sum closure, in the sense of OpenGA.ConnectedSumClosure. Then every member of Cl⁡(P)\operatorname{Cl}(P)Cl(P) is a connected sum of some finite list of PPP-factors, in the sense of OpenGA.ConnectedSumList:

M∈Cl⁡(P)⟹∃L,  M∈Sum⁡(L),L a finite list of P-factors.M \in \operatorname{Cl}(P) \qquad\Longrightarrow\qquad \exists L,\; M \in \operatorname{Sum}(L),\quad L \text{ a finite list of } P\text{-factors}.M∈Cl(P)⟹∃L,M∈Sum(L),L a finite list of P-factors.

The list is the list of leaves of the binary tree of connected sums that witnesses the membership: reading a derivation of M∈Cl⁡(P)M \in \operatorname{Cl}(P)M∈Cl(P), a leaf contributes a one-element list, a homeomorphism step leaves the list unchanged, and a binary sum step concatenates the two lists. Since concatenation is free, this normal form is the reason why the closure is closed under the connected sum it is generated from, and it is used in the direct proof of OpenGA.ConnectedSumClosure.sum_closure.

The statement is not merely a restatement: ConnectedSumClosure carries no tree, so the existence of a bracketing with a prescribed leaf list is additional information, and it is what allows the two derivations of a connected sum of two members of the closure to be combined without reassociating the connected sum itself.

Preamble
import Definitions.Def_OpenGA_ConnectedSumList
Formal statement
namespace OpenGA

universe u

/-- Every member of the finite connected-sum closure of `P` is a connected sum of
some finite list of `P`-factors. -/
theorem ConnectedSumClosure.exists_connectedSumList {P : ClosedThreeManifold.{u} → Prop}
    {M : ClosedThreeManifold.{u}} (h : ConnectedSumClosure P M) :
    ∃ L : List ClosedThreeManifold.{u}, ConnectedSumList P L M := by sorry

end OpenGA
Source
Kleiner-Lott, Notes on Perelman's papers, https://arxiv.org/pdf/math/0605667v5, Lemma 73.4, p. 140, and Lemma 81.2, p. 160. Built on the platform definition OpenGA_ConnectedSumList (Definitions.Def_OpenGA_ConnectedSumList) and the closure predicates of OpenGA_SurgeryTopologyEvolution (Definitions.Def_OpenGA_SurgeryTopologyEvolution).

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