Papers
Topics
Authors
Recent
Search
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.

Authors (2)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.