arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2301.01099math.AGmath.KT
收藏

具紧支撑的对数动机

Logarithmic motives with compact support

Nikolai Opdan

AI总结:

本文为域上的对数概形发展了具紧支撑的动机理论,通过定义具紧支撑的有限对数对应,建立了 Gysin 序列与 K{ü}nneth 公式,并证明了 $\overline{\square}$-不变性、对偶定理与消约定理,进而提出了新的同调与上同调理论。

摘要:

我们为域上的对数概形发展了具紧支撑的动机理论。从具紧支撑的有限对数对应的概念出发,我们定义了类似于概形经典情形的具紧支撑的对数动机。随后,我们建立了 Gysin 序列的类似物,并在假设奇点消解的前提下,证明了 K{ü}nneth 公式。这蕴含了我们的理论是 $\overline{\square}$-不变的,该性质呈现了经典情形中所缺失的关键特征。进一步假设奇点消解,我们证明了对数概形的对偶定理,并借此为底层概形为固有的对数概形建立了消约定理。此外,基于我们的结果,我们讨论了 log smooth fs 对数概形的全新同调与上同调理论。

英文摘要:

We develop a theory of motives with compact support for logarithmic schemes over a field. Starting from the notion of finite logarithmic correspondences with compact support, we define the logarithmic motive with compact support analogous to the classical case for schemes. We then establish an analog of a Gysin sequence and, assuming resolution of singularities, a K{ü}nneth formula. This implies that our theory is $\overline{\square}$-invariant, which presents a critical feature that is absent in the classical case. Further assuming resolution of singularities, we prove a duality theorem for log schemes which we use to establish a cancellation theorem for log schemes whose underlying scheme is proper. Moreover, we discuss new homology and cohomology theories for log smooth fs logarithmic schemes based on our results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑