---
title: Cut-System Complex in Sutured Manifolds
url: https://www.emergentmind.com/topics/cut-system-complex
type: topic
---

# Cut-System Complex in Sutured Manifolds

Searching arXiv for the cited sutured Floer / Heegaard invariant background papers.
The cut-system complex, in the sutured-manifold sense, is the \(2\)-dimensional cell complex associated to a sutured compression body whose vertices are cut-systems, whose edges are elementary handleslides, and whose \(2\)-cells are attached along six basic handleslide loops. For a sutured compression body \(C(\delta)\), the resulting complex \(Y_2(C(\delta))\) is connected and simply connected after these six classes of \(2\)-cells are added. In the same framework, tight Heegaard invariants admit unique extensions to strong Heegaard invariants, yielding a combinatorial route to naturality results for Floer homology theories associated to sutured manifolds [2508.04042].

## 1. Sutured compression bodies and cut-systems

Fix a compact oriented surface \(\Sigma\), possibly disconnected, such that every boundary component is nonempty, and assume there are no special disks. A collection
\[
\delta=(\delta_1,\dots,\delta_k)
\]
of \(k\) disjoint simple closed curves in \(\operatorname{Int}(\Sigma)\) is an attaching set if each component of \(\Sigma\setminus \delta\) meets \(\partial\Sigma\) [2508.04042].

The associated sutured compression body \(C(\delta)\) is obtained by starting with \(\Sigma\times[0,1]\), attaching \(2\)-handles to \(\Sigma\times\{1\}\) along \(\delta\times\{1\}\), and taking the suture
\[
\gamma=\partial\Sigma\times[0,1].
\]
Its lower boundary is
\[
C_{-}(\delta)=\Sigma\times\{0\},
\]
and its upper boundary is
\[
C_{+}(\delta)=\partial C(\delta)\setminus\bigl(C_{-}(\delta)\cup\gamma\bigr).
\]

A meridian curve in \(\Sigma\) is a curve bounding a compressing disk in \(C(\delta)\). The collection \(\delta\) is a cut-system of \(C(\delta)\) if \(|\delta|\) equals the number of \(2\)-handles and cutting \(C(\delta)\) along the compressing disks for \(\delta\) produces a product sutured manifold \(C_{+}(\delta)\times I\). Equivalently, \(\delta\) is a cut-system if it is a maximal set of disjoint meridians and \(\Sigma\setminus\delta\) is a union of punctured spheres each meeting \(\partial\Sigma\).

This definition places the cut-system at the level of maximal compression data for the sutured compression body. A plausible implication is that the complex built from such data records not merely existence of compressions, but the full combinatorics of moving between maximal compression configurations by handleslides.

## 2. The cell complex \(Y_2(C(\delta))\)

The cut-system complex begins with a graph \(Y_1(C(\delta))\). Its vertices are all cut-systems
\[
u=\{\alpha_1,\dots,\alpha_g\},
\]
where \(g=|\delta|\). Its edges are elementary handleslides: there is an edge \(u\to v\) whenever
\[
u=\{\alpha,\alpha_2,\dots,\alpha_g\},\qquad
v=\{\alpha',\alpha_2,\dots,\alpha_g\},
\]
and \(\alpha'\) is obtained from \(\alpha\) by sliding over one of the other curves along an embedded arc disjoint from the remaining \(\alpha_i\)'s [2508.04042].

Thus \(Y_1(C(\delta))\) is the graph of cut-systems and single handleslides. The full complex \(Y_2(C(\delta))\) is obtained by attaching \(2\)-cells along six distinguished handleslide loops.

The construction is explicitly \(2\)-dimensional: it does not attempt to encode all higher homotopy data directly. Instead, it identifies a finite list of local handleslide relations sufficient to force simple connectivity. This is the essential structural content of the complex.

## 3. The six handleslide \(2\)-cells

Let \(\vec\alpha\) denote a fixed collection of \((g-2)\) curves. The six basic loops in \(Y_1(C(\delta))\) are the following, each filled by a \(2\)-cell [2508.04042].

| Loop type | Configuration | Cell attached along |
|---|---|---|
| Slide-triangle | \(\alpha_1,\alpha_2,\alpha_3\) cobound a pair of pants disjoint from \(\vec\alpha\) | A \(3\)-cycle of slides |
| Type I square | Sliding \(\alpha_1\leftrightarrow\alpha_2\) is independent of sliding \(\alpha_3\leftrightarrow\alpha_4\) | A commutative square |
| Type II square | \(\alpha_1\) and \(\alpha_3\) both slide over \(\alpha_2\) from opposite sides | A commutative square |
| Type III square | Sliding \(\alpha_1\) over either \(\alpha_2\) or \(\alpha_3\) gives the same result up to homotopy | A square |
| Type IV square | \(\alpha_1\) slides over \(\alpha_2\) in two distinct commuting ways | A square |
| Slide pentagon | Five curves bound a disk with five marked boundary intervals | A \(5\)-cycle |

The slide-triangle is written explicitly as
\[
(\alpha_1,\alpha_2,\vec\alpha)\longrightarrow
(\alpha_2,\alpha_3,\vec\alpha)\longrightarrow
(\alpha_3,\alpha_1,\vec\alpha)\longrightarrow
(\alpha_1,\alpha_2,\vec\alpha).
\]

For the square and pentagon relations, the paper identifies Type II, Type III, Type IV, and the pentagon with the corresponding configurations labeled as cases \((\mathrm{A1c})\), \((\mathrm{A1b})\), \((\mathrm{A1d})\), and \((\mathrm{A2})\) of Juhász–Thurston–Zemke [2508.04042].

The role of these \(2\)-cells is local but decisive: they kill precisely the elementary cycles generated by compatible or competing handleslide operations. This suggests that the global topology of the cut-system complex is controlled by a small, finite list of move relations.

## 4. Connectivity and simple connectivity

The main theorem states:

> Let \(C(\delta)\) be any sutured compression body and let \(Y_2(C(\delta))\) be the \(2\)-dimensional cell complex obtained by starting from the \(1\)-skeleton of cut-systems and elementary handleslides and then attaching the six kinds of \(2\)-cells listed above. Then \(Y_2(C(\delta))\) is connected and simply connected [2508.04042].

The proof has three stated components. First, connectivity is immediate from the fact that any two compression-equivalent attaching sets differ by a sequence of handleslides, cited to Juhász–Thurston–Zemke, Lemma 2.11. Second, simple connectivity is reduced to an adaptation of Wajnryb’s complex \(X_2(C(\delta))\), whose vertices are cut-systems and whose edges are simple moves, meaning replacement of one \(\alpha\)-curve by another disjoint one. That complex carries triangular and square \(2\)-cells and is shown to be simply connected by induction on the number of curves. Third, a minimal resolution argument replaces each simple-move edge in \(X_2(C(\delta))\) by a canonical path of handleslides in \(Y_2(C(\delta))\), unique up to the \(2\)-cell relations already listed. Each \(2\)-cell in \(X_2\) is then expressed as a composition of slide-triangles, squares, and pentagons in \(Y_2\) [2508.04042].

The theorem gives a presentation-level control of handleslide monodromy. In practical terms, any loop in the handleslide graph can be reduced using the six basic \(2\)-cell relations. A plausible implication is that the complex functions as a coherence object for diagrammatic moves in sutured Floer theory.

## 5. Tight and strong Heegaard invariants

In the Heegaard-theoretic application, Juhász–Thurston–Zemke package a Floer-type assignment to each sutured Heegaard diagram as a functor on a graph \(G\) of diagrams and moves, including \(\alpha/\beta\)-equivalences, stabilizations, and diffeomorphisms. Over \(\mathbb F_2\), the \(\alpha/\beta\)-equivalences suffice, but over \(\mathbb Z\) one must work with \(\alpha/\beta\)-handleslides to avoid sign-ambiguities. Replacing equivalences by handleslides yields a subgraph \(G'\) [2508.04042].

A tight Heegaard invariant is a functor
\[
F' : G' \to \mathcal C
\]
that commutes around exactly the six slide-loops above, together with stabilization-slides. The simple connectivity of \(Y_2(C(\delta))\) implies that any such tight invariant extends uniquely to a strong invariant on the full graph \(G\).

The consequence recorded in the paper is that sutured Floer homology, link Floer homology, and multi-pointed Heegaard Floer homology admit unique strong refinements, proving their naturality over \(\mathbb Z\); equivalently, there is no monodromy around any loop of Heegaard moves. Within this framework, the cut-system complex provides the combinatorial backbone for existence and uniqueness of strong Heegaard invariants.

A common misconception is that naturality in Floer theory is purely formal once diagrammatic moves are known. The result here is more specific: the passage from tight to strong invariants depends on the simple connectivity of the handleslide-based cut-system complex and on the six explicit slide relations.

## 6. Terminological scope and adjacent usages

The term “cut-system complex” is not uniform across the literature. In graph theory, “total cut complexes” and “cut complexes” denote simplicial complexes associated to a finite graph \(G\), written \(\Delta_k^t(G)\) and \(\Delta_k(G)\), with faces determined by complements containing independent \(k\)-sets or disconnected induced \(k\)-vertex subgraphs. For grid graphs \(G_{2\times n}\) and \(G_{3\times n}\), these complexes are studied via Alexander duality, shellability, and discrete Morse theory, and theorems are given describing wedge-of-spheres decompositions and shellability in the \(2\times n\) and \(3\times n\) cases [2408.07646].

In convex optimization, the “complex cut polytope” is a different object again:
\[
\CUT_n^{(m)}=\operatorname{conv}\{xx^H\mid x\in\mathcal B_m^n\},
\]
the convex hull of rank-one Hermitian matrices determined by \(m\)th roots of unity. That literature concerns valid inequalities, semidefinite liftings, and relaxations for problems such as \(\mathrm{MAX\text{-}3\text{-}CUT}\), MIMO detection, and angular synchronization [2402.04731].

These usages are mathematically unrelated to the sutured-manifold cut-system complex except at the level of nomenclature. This suggests that, in the present topic, “cut-system complex” should be understood specifically as a handleslide complex for cut-systems of a sutured compression body, not as a graph-theoretic simplicial complex or a polyhedral object.

Source: https://www.emergentmind.com/topics/cut-system-complex