Search arXivSearch

arXiv · 2606.13471

Khovanov homology: pro-tangles, derived colimits and spectral sequences

Abstract

This paper introduces \emph{pro-tangles}, a natural generalization of classical tangles, which are functors from the Boolean cube to Bar-Natan's cobordism category. By employing the simplicial Yoneda embedding, we construct the Khovanov simplicial presheaf of a pro-tangle as the total homotopy cofiber over the punctured Boolean cube, and prove that this simplicial presheaf is representable, with representing object the classical Khovanov simplicial object. We establish a fully faithful embedding showing that the weak equivalence class of this simplicial presheaf is determined by the chain homotopy type of the Khovanov complex. Furthermore, we utilize Boolean cube decompositions to construct an algebraic spectral sequence for pro-tangles. This spectral sequence converges to the total Khovanov homology, and its $E_1$ page is explicitly expressed in terms of the Khovanov homology of reduced tangles. This categorical setup yields a functorial interpretation of Reidemeister invariance in terms of morphisms of spectral sequences. By applying the tangle TQFT construction, we study this spectral sequence for Hopf clasps, the fundamental structural building blocks in tangle and link theory. We show that the spectral sequence collapses at the $E_3$ page, which further specializes to an $E_2$-collapse under the restriction to Hopf sums. Finally, we investigate connected sums of pro-tangles and pro-links. To address the module-action dependencies arising from tensor products in multi-connected sums, we introduce a state-dependent modified tensor operator and prove a structural decomposition theorem that generalizes the classical result at the chain complex level.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jian Liu, Kefeng Liu, Li Shen. 2026-09-05. Khovanov homology: pro-tangles, derived colimits and spectral sequences. https://arxiv.org/abs/2606.13471

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT