Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Beilinson-Parshin adeles via solid algebraic geometry (2403.08472v2)

Published 13 Mar 2024 in math.AG

Abstract: In this paper, we apply Clausen-Scholze's theory of solid modules to the existence of adelic decompositions for schemes of finite type over $\mathbb{Z}$. Specifically, we use the six-functor formalism for solid modules to define the skeletal filtration of a scheme, and then we show that decomposing a quasi-coherent sheaf with respect to this filtration gives rise to a new construction of the Beilinson-Parshin adelic resolution. As an application of the adelic decomposition combined with some nice completeness properties of the solid tensor product, we prove a version of adelic descent for solid quasi-coherent sheaves.

Citations (1)

Summary

We haven't generated a summary for this paper yet.