Every finite connected sum of factors is a connected sum of a list of them
ProvedOpenGA.ConnectedSumClosure.exists_connectedSumListLet be a class of closed connected three-manifolds and let be its finite nonempty connected-sum closure, in the sense of OpenGA.ConnectedSumClosure. Then every member of is a connected sum of some finite list of -factors, in the sense of OpenGA.ConnectedSumList:
The list is the list of leaves of the binary tree of connected sums that witnesses the membership: reading a derivation of , 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.
import Definitions.Def_OpenGA_ConnectedSumList
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