Uncomputable trisection invariants of 4-manifolds
summary
The gist
Trisection invariants of 4-manifolds are uncomputable because two specific invariants defined by trisections, namely the trisection genus and the Kirby–Thompson L-invariant…
In short
This paper proves that two invariants derived from trisections of 4-manifolds—the trisection genus and the Kirby–Thompson L-invariant—are uncomputable by any algorithm. The proof uses classical undecidability results related to manifold recognition, showing that computing these values would allow one to solve problems currently considered impossible for algorithms.
Key concepts
- Trisection Genus (g(X))
- This is the minimum genus of a triple intersection surface found among all possible trisections of a 4-manifold X. It measures the complexity associated with how X can be decomposed into three pieces using specific surfaces, and its computation is shown to be undecidable.
- Kirby–Thompson L-invariant (LX)
- This invariant is defined by minimizing the curve-complex complexity of a trisection diagram for a manifold X. If LX > 0, it implies X cannot be written as a connected sum of specific simple manifolds like S4 or CP2, suggesting an algorithmic barrier to calculating its value.
- Unrecognizability
- This is the idea that there is no algorithm that can reliably tell if one manifold is diffeomorphic to another based on their triangulations. The paper uses results like Markov's theorem and Gordon's construction to show that computing the trisection genus or L-invariant would lead to an algorithm capable of solving these undecidable recognition problems.
Terminology used across episodes
This episode discusses
- Uncomputable trisection invariants of 4-manifolds · Paper Radio
- Multisections of higher-dimensional manifolds
- Algorithms in 4-manifold topology · Paper Radio
- Kirby-Thompson distance for trisections of knotted surfaces
- Reflections on trisection genus
- Multisections and bridge positions in arbitrary dimensions
- The Unsolvability of the Homeomorphism Problem
- Trisecting 4-manifolds
- Simpler algorithmically unrecognizable 4-manifolds
The paper
Uncomputable trisection invariants of 4-manifolds · Read on arXiv
University of Illinois Urbana-Champaign · Universidad de Sevilla · Stanford University
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "Uncomputable trisection invariants of 4-manifolds".
Emmy: Here's the gist of the paper. Trisection invariants of 4-manifolds are uncomputable because two specific invariants defined by trisections, namely the trisection genus and the Kirby–Thompson L-invariant, cannot be computed by an algorithm for a given triangulated closed orientable 4-manifold.
Ada: The paper establishes that two invariants derived from smooth 4-manifolds using trisections are uncomputable: the trisection genus and the Kirby–Thompson L-invariant.
Emmy: The trisection genus, denoted as g(X), is defined as the minimal genus of a triple intersection surface Σ among all possible trisections of X.
Ada: Furthermore, the Kirby and Thompson L-invariant (LX) is introduced by minimizing the curve-complex complexity of a trisection diagram over all trisections of X.
Paper summary: Ada: So we're looking at this paper titled "Uncomputable trisection invariants of four-manifolds <ref:2608.27811#pg1,trisection invariants of 4-manifolds>." It claims that two specific invariants derived from trisections, the trisection genus and the Kirby–Thompson L-invariant, are uncomputable. This means there is no algorithm that can take a triangulation of a closed orientable four-manifold and give you one of these quantities <ref:2608.27811#pg1,closed orientable 4-manifold and>.
Emmy: That’s right. The paper establishes this by showing that both the trisection genus, which is the minimal genus of a triple intersection surface among all possible trisections, and the Kirby–Thompson L-invariant, which minimizes the curve-complex complexity of a trisection diagram over all possible trisections, are uncomputable.
Kolya: So if an algorithm existed for these invariants, what would it actually be doing? Would it be classifying these four-manifolds in some way <ref:2608.27811#pg1>?
Ada: Exactly. The paper says the proof relies on relating the Kirby–Thompson L-invariant to whether a manifold is diffeomorphic to a connected sum of specific manifolds. If you can compute L, you can tell if the manifold belongs to that specific family of connected sums.
Emmy: And it goes further, according to Theorem one point two, which deals with the PL multisection genus, there's no algorithm for any dimension n greater than or equal to four to output this PL (n minus one)-section genus given a triangulation of a PL n-manifold X <ref:2608.27811#pg2,of a PL n-manifold X>.
Ada: So we have two main results here: the L-invariant is uncomputable, and the multisection genus is uncomputable in dimensions four and higher. This means these invariants are fundamentally beyond what any algorithm can compute for these manifolds.
Kolya: What does this mean for someone who just looks at four-manifolds <ref:2608.27811#pg1>? It suggests that even with a triangulation, you can't always find out these important geometric properties algorithmically.
Ada: It points to a deeper level of complexity in the structure of these manifolds than we might expect. The proof for the L-invariant shows that if L is greater than zero, then the manifold isn't diffeomorphic to a connected sum of S4, CP2, CP2, S1 times S3 and S2 times S2.
Emmy: And if L is zero, it means the manifold *is* one of those specific connected sums. But determining which one it is can be done using its homology groups and intersection form.
Kolya: So the difficulty isn't just calculating a number, but identifying which class of objects you are looking at based on that number.
Ada: Right. And for the multisection genus in dimension four, they use Gordon’s construction. They show that an algorithm computing this genus would be able to tell which members of a specific family of smooth four-manifolds are diffeomorphic to twelve times the connected sum of S2 times S2 <ref:2608.27811#pg3>.
Emmy: That would contradict the fact that those manifolds are not recognizable by any algorithm, which is what Markov and Gordon showed for homeomorphism. This shows that the undecidability property isn't just theoretical; it applies to these geometric properties in both smooth and PL categories.
Kolya: So the proof for Theorem one point two for dimension four is quite concrete, linking the genus value directly to a known undecidable problem about manifold recognition <ref:2608.27811#pg2>.
Ada: It really shows how deep these invariants are rooted in classical unrecognizability results, like Markov's result about the number of moves in S2 times S2 being unrecognizable Mar. This makes you think about what kind of computational limits exist for geometric topology.
Emmy: And this work connects the smooth and PL categories, which is interesting because sometimes those two categories behave very differently under algorithmic scrutiny. The paper points out that while Tancer's results apply in the topological category, this new improvement applies only in the PL category Tan.
Kolya: I wonder about the practical implications here. If we are trying to use these invariants to distinguish manifolds, this paper says we can't build a universal computational tool for them.
Ada: That’s exactly it. The paper is titled "Uncomputable trisection invariants of four-manifolds" because it proves that two specific invariants defined by trisections, the trisection genus and the Kirby–Thompson L-invariant, cannot be computed by an algorithm for a given triangulated closed orientable four-manifold <ref:2608.27811#pg1,the trisection genus and the Kirby–Thompson L-invariant>.
Emmy: It’s about showing that even with the powerful structure theorems provided by trisections—like Gay and Kirby's result that every smooth four-manifold admits one GK—the resulting invariants aren't computable <ref:2608.27811#pg1>.
Kolya: So, to wrap up this segment, we see that the L-invariant is uncomputable because it relates to manifold classification in a way that implies an algorithm recognizing a specific family of connected sums.
Ada: And the multisection genus is uncomputable because for dimension four and higher, it can be used to distinguish members of Gordon's family, which are known not to be algorithmically recognizable.
Emmy: The implication is that these geometric properties defined by trisections are inherently more complex than what a computer can handle through an algorithm given a triangulation.
Kolya: It seems like this paper highlights the boundary between computable geometry and deep topological structure, especially in higher dimensions where we rely on results like Novikov's work on spheres VKF.
Ada: So for someone who just listens to this, the main point is that these key quantities derived from trisections are fundamentally uncomputable for four-manifolds <ref:2608.27811#pg1>. That's what the paper is about.
Conclusion: Ada: So we've looked at how these two specific quantities derived from trisections—the genus and that Kirby Thompson L-invariant—are fundamentally uncomputable for four-manifolds.
Emmy: It really boils down to the fact that even with all the structure trisections give us, we can't always calculate these invariants using a fixed algorithm.
Kolya: That means if you have a triangulation of a four-manifold right now, there’s no guaranteed way for your computer to tell you what that genus or L-invariant actually is.
Ada: Exactly. The paper is about showing these invariants are uncomputable and tying it back to deep recognition problems in topology.
Emmy: It suggests a limit on what we can expect from algorithmic tools trying to fully classify these higher dimensional spaces based on their trisection structure.
Kolya: So, the real question is, how does this affect our ability to study four-manifolds computationally? Does it mean certain geometric questions are just out of reach for current methods?
Ada: It suggests that for these specific invariants, the answer is no. It's not that we lack tools; it's that the structure itself imposes a computational barrier.
Emmy: The authors, Aribi, Courte, Golla, and Moussard specifically point out how these results connect to Gordon’s construction and Markov’s original work on unrecognizability.
Kolya: That link to those classical results is important because it shows this isn't just a new quirk; it fits into the larger picture of what we already know about algorithmic limits in topology.
Ada: It does. It frames the problem not as a lack of ingenuity, but as a fundamental property of these invariants themselves that resists computation by any method we can devise right now.
Emmy: And this whole discussion leads us to think about where else these kinds of structural limitations show up in other areas of mathematics and physics.
More episodes
- 2509.05860-Concentration Inequalities for Branching Random Walks
- 2509.19309-Small Prime Primitive Roots in Arithmetic Progressions
- 2509.21830-Noncollapsing for Curvature Flows with Inhomogeneous Speeds
- 2510.08346-Separability and Submetrizability in Locally Convex Spaces
- 2510.27290-Borel Combinatorics of Schreier Graphs of Z-actions
- 2511.13500-Sampling Density for Gabor Phase Retrieval
- 2511.19161-Linear dynamics of random products of weighted shifts
- 2511.21548-Metastability of diffusion processes in narrow tubes
- 2512.01536-Abelian approximations for bicrossed products
- 2601.02524-Lagrangian slice disks with symplectomorphic exteriors