Filtering smooth concordance classes of topologically slice knots

Date
2013
Journal Title
Journal ISSN
Volume Title
Publisher
msp
Abstract

We propose and analyze a structure with which to organize the difference between a knot in S3 bounding a topologically embedded 2–disk in B4 and it bounding a smoothly embedded disk. The n–solvable filtration of the topological knot concordance group, due to Cochran–Orr–Teichner, may be complete in the sense that any knot in the intersection of its terms may well be topologically slice. However, the natural extension of this filtration to what is called the n–solvable filtration of the smooth knot concordance group, is unsatisfactory because any topologically slice knot lies in every term of the filtration. To ameliorate this we investigate a new filtration, fBng, that is simultaneously a refinement of the n–solvable filtration and a generalization of notions of positivity studied by Gompf and Cochran. We show that each Bn=BnC1 has infinite rank. But our primary interest is in the induced filtration, fTng, on the subgroup, T , of knots that are topologically slice. We prove that T =T0 is large, detected by gauge-theoretic invariants and the , s , –invariants, while the nontriviality of T0=T1 can be detected by certain d –invariants. All of these concordance obstructions vanish for knots in T1 . Nonetheless, going beyond this, our main result is that T1=T2 has positive rank. Moreover under a “weak homotopy-ribbon” condition, we show that each Tn=TnC1 has positive rank. These results suggest that, even among topologically slice knots, the fundamental group is responsible for a wide range of complexity.

Description
Advisor
Degree
Type
Journal article
Keywords
Citation

Cochran, Tim D., Harvey, Shelly and Horn, Peter. "Filtering smooth concordance classes of topologically slice knots." Geometry & Topology, 17, (2013) msp: 2103-2162. http://dx.doi.org/10.2140/gt.2013.17.2103.

Has part(s)
Forms part of
Rights
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Link to license
Citable link to this page