Published October 2013 | Version Published
Journal Article Open

Khovanov module and the detection of unlinks

Abstract

We study a module structure on Khovanov homology, which we show is natural under the Ozsváth–Szabó spectral sequence to the Floer homology of the branched double cover. As an application, we show that this module structure detects trivial links. A key ingredient of our proof is that the Λ∗H_1–module structure on Heegaard Floer homology detects S^1 × S^2 connected summands.

Additional Information

© 2013 Mathematical Sciences Publishers. Received: 6 May 2013; Accepted: 15 June 2013; Published: 17 October 2013. This work was initiated when the authors participated the "Homology Theories of Knots and Links" program at MSRI, and was carried out further when the authors visited the Simons Center for Geometry and Physics. We are grateful to Ciprian Manolescu and Tomasz Mrowka for helpful conversations. We also wish to thank Robert Lipshitz, Sucharit Sarkar and the referee for pointing out a mistake in the proof of Proposition 2.2. Special thanks are due to Sucharit Sarkar for suggesting a way to fix the mistake. The first author was partially supported by NSF grant numbers DMS-0906258 and DMS-1150872 and an Alfred P Sloan Research Fellowship. The second author was partially supported by an AIM Five-Year Fellowship, NSF grant numbers DMS-1021956, DMS-1103976 and an Alfred P Sloan Research Fellowship.

Attached Files

Published - Downloads-2.pdf

Files

Downloads-2.pdf

Files (570.1 kB)

Name Size
md5:407d661d20faed847d71623a53f7fa5d
570.1 kB Preview Download

Additional details

Identifiers

Eprint ID
43200
DOI
10.2140/gt.2013.17.3027
Resolver ID
CaltechAUTHORS:20140103-093828720

Related works

Funding

NSF
DMS-0906258
NSF
DMS-1150872
Alfred P. Sloan Foundation
AIM Five-Year Fellowship
NSF
DMS-1021956
NSF
DMS-1103976

Dates

Created
2014-01-03
Created from EPrint's datestamp field
Updated
2021-11-10
Created from EPrint's last_modified field

Caltech Custom Metadata

Caltech groups
Mathematics Department