2000 character limit reached
$\mathbb{A}^1$-connectivity of motivic spaces
Published 11 Dec 2025 in math.AG, math.AT, and math.KT | (2512.10712v1)
Abstract: We prove an unstable version of Morel's $\mathbb{A}1$-connectivity theorem over arbitrary base schemes. In the stable setting, this recovers (and simplifies the proof of) the known connectivity bounds due to Morel, Schmidt--Strunk, Deshmukh--Hogadi--Kulkarni--Yadav, and Druzhinin, and extends them to possibly non-noetherian schemes. Using the recent work of Bachmann--Elmanto--Morrow, this also implies that the slice filtration on homotopy $K$-theory is convergent for qcqs schemes of finite valuative dimension.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.