Classification of Links Up to 0-Solvability
Abstract
The n-solvable filtration of the m-component smooth (string) link concordance group, … ⊂ Fmn+1 ⊂ Fmn.5 ⊂ Fmn … ⊂ Fm1 ⊂ Fm0.5 ⊂ Fm0 ⊂ Fm-0.5 ⊂ Cm, as defined by Cochran, Orr, and Teichner, is a tool for studying smooth knot and link concordance that yields important results in low-dimensional topology. The focus of this paper is to give a characterization of the set of 0-solvable links. We introduce a new equivalence relation on links called 0-solve equivalence and establish both an algebraic and a geometric classification of L0m, the set of links up to 0-solve equivalence. We show that L0m has a group structure isomorphic to the quotient F-0.5/F0 of concordance classes of string links and classify this group, showing that L0m F-0.5m/F0m Z2m Zm 3 Z2m 2. Finally, using results of Conant, Schneiderman, and Teichner, we show that 0-solvable links are precisely the links that bound class 2 gropes and support order 2 Whitney towers in the 4-ball.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.