Topological Decomposition of Metric Gluings

18 concepts6 papers

When we combine two mathematical objects, we often hope that the properties of the resulting whole are simply the sum of the properties of its parts. In topology and graph theory, however, the act of "gluing" two spaces together frequently introduces new, emergent structures. A simple connection can inadvertently create a "shortcut" across a metric space, forming a new hole or cycle that didn't exist in either original component.

Research into metric gluings seeks to define the precise conditions under which a large, complex space can be decomposed into smaller, manageable pieces without losing or gaining topological information.

The Problem of Metric Shortcuts

The fundamental challenge in topological assembly is the emergence of unintended cycles. Imagine two separate graphs. If you join them at a single point—a "metric wedge sum"—the topology remains predictable. As Adamaszek et al. (2017) demonstrate, the Vietoris-Rips complex of such a wedge sum is homotopy equivalent to the wedge sum of the individual complexes. In this case, the "whole" truly is the sum of its parts.

However, complexity arises when the connection is more extensive than a single point. When merging metric graphs along a shared path, the length of that path becomes critical. If the path is too long, it can act as a bridge that creates a new shortest path between distant points in the graph. These shortcuts can create new topological features, such as voids, that disrupt the persistent homology of the system.

Constraints for Stable Assembly

To prevent these shortcuts, researchers have identified specific distance constraints that must be maintained during the gluing process.

  • The One-Third Rule: Adamaszek et al. (2017) establish that a decomposition along a shared path is valid if the path length is less than one-third of the shortest cycle in the graph. This constraint ensures that the global topology can be accurately reconstructed from the constituent subgraphs.
  • Boundary Separation: In the context of graph coloring and Steinberg’s Conjecture, Hebdige et al. (2017) show that merging subgraphs requires a minimum distance between all contact points. By enforcing this distance, the authors prevent the formation of forbidden short cycles at the boundaries where subgraphs meet.
  • Gate Vertices: Another mechanism for preserving metric properties is the "gate-sum" operation. As described by Wang & Wang (2020), this involves merging graphs through a shared subgraph where every external node has a unique "gate" vertex. This gate acts as a mandatory entry point for all shortest paths, effectively blocking the emergence of shortcuts across the interface and preserving the graph's embeddability.

From Local Patches to Global Signatures

If these gluing constraints are met, we can use powerful algebraic tools to understand the global space. Kerber & Edelsbrunner (2011) utilize Mayer-Vietoris sequences to relate the persistent homology of a global manifold to its decomposed patches and their intersections. This allows local persistence diagrams—which track how topological features appear and disappear across scales—to be aggregated into a single global signature.

Similarly, Adamaszek et al. (2020) generalize these findings, proving that for metric spaces glued along a common isometric subset, the combined Vietoris-Rips complex remains homotopy equivalent to the union of the individual complexes, provided the gluing process is sufficiently constrained.

By breaking down complex structures into simpler components like "wedges of spheres," as explored by Levi et al. (2020), researchers can systematically analyze the stable homotopy types of intricate networks, ranging from neural connectivity in the brain to large-scale data manifolds. The core insight across these works is that by controlling the geometry of the interface, we can guarantee the topological integrity of the assembly.

Key Foundational Work

Vietoris-Rips and Cech Complexes of Metric Gluings (2017) — contributed 5 concept elements to this direction.
Steinberg's Conjecture is false (2017) — contributed 3 concept elements to this direction.
Alexander Duality for Functions: the Persistent Behavior of Land and Water and Shore (2011) — contributed 1 concept elements to this direction.
History & citationVersion 1 · 2026-10-04

Current · Permanent link

View frozen version 1

Cite this direction

Latest version (a living page):

@misc{lacuna_inter_gadget_distance_constraints_222ac0ab,
  title = {inter-gadget distance constraints},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/inter-gadget-distance-constraints/rdr_222ac0ab4b2a4562bb76f051ba429196},
  note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}

This exact version (version 1, frozen text):

@misc{lacuna_inter_gadget_distance_constraints_222ac0ab_v1,
  title = {inter-gadget distance constraints},
  author = {{Lacuna}},
  howpublished = {Lacuna research direction},
  year = {2026},
  url = {https://lacuna.tiptreesystems.com/direction/inter-gadget-distance-constraints/rdr_222ac0ab4b2a4562bb76f051ba429196/v/1},
  note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}

See something wrong? Report a mistake