首页> 外文期刊>Geometry & Topology >Filtering smooth concordance classes of topologically slice knots
【24h】

Filtering smooth concordance classes of topologically slice knots

机译:过滤拓扑切片结的平滑一致性类

获取原文
获取外文期刊封面目录资料

摘要

We propose and analyze a structure with which to organize the difference between a knot in S~3 bounding a topologically embedded 2-disk in B~4 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, {B_n}, 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 B_n/B_(n+1) has infinite rank. But our primary interest is in the induced filtration, {T_n}, on the subgroup, T, of knots that are topologically slice. We prove that T/T_0 is large, detected by gauge-theoretic invariants and the τ, s, ∈-invariants, while the nontriviality of T_0/T_1 can be detected by certain d-invariants. All of these concordance obstructions vanish for knots in T_1. Nonetheless, going beyond this, our main result is that T_1/T_2 has positive rank. Moreover under a "weak homotopy-ribbon" condition, we show that each T_n/T_(n+1) has positive rank. These results suggest that, even among topologically slice knots, the fundamental group is responsible for a wide range of complexity.
机译:我们提出并分析了一种结构,该结构可以用来组织S〜3中的结与B〜4中的拓扑嵌入的2个磁盘的边界与光滑嵌入的磁盘的边界之间的差异。归因于Cochran-Orr-Teichner,拓扑结一致组的n个可解过滤在某种意义上说是完整的,因为其术语相交处的任何结都可以在拓扑上进行切片。但是,这种过滤的自然扩展到所谓的平滑结一致性组的n-可溶过滤并不令人满意,因为任何拓扑切片结都位于过滤的每个阶段。为了改善这一点,我们研究了一种新的过滤{B_n},该过滤同时是对n可求解过滤的改进和对Gompf和Cochran研究的阳性概念的概括。我们证明每个B_n / B_(n + 1)具有无限的秩。但是我们的主要兴趣是在拓扑切片的结子T的子组T上诱导过滤{T_n}。我们证明,T / T_0很大,可以通过规范理论不变量和τ,s,∈不变量来检测,而T_0 / T_1的平凡性可以通过某些d不变量来检测。在T_1中,所有这些一致性障碍都会消失。尽管如此,除此以外,我们的主要结果是T_1 / T_2具有正排名。此外,在“弱同质带”条件下,我们显示每个T_n / T_(n + 1)具有正等级。这些结果表明,即使在拓扑切片结中,基本组也导致了广泛的复杂性。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号