Papers
Topics
Authors
Recent
Search
2000 character limit reached

Incidence equivalence and the Bloch-Beilinson filtration

Published 31 Jan 2025 in math.AG | (2501.19147v1)

Abstract: Let $X$ be a smooth projective variety of dimension $d$ over an arbitrary base field $k$ and $CHn(X)_{\mathbb Q}$ be the $\mathbb Q$-vector space of codimension $n$ algebraic cycles of $X$ modulo rational equivalence, $1\leq n \leq d$. Consider the $\mathbb Q$-vector subspaces $CHn(X)_{\mathbb Q} \supseteq CHn_{\mathrm{alg}}(X)_{\mathbb Q} \supseteq CHn_{\mathrm{inc}}(X)_{\mathbb Q}$ of algebraic cycles which are, respectively, algebraically and incident (in the sense of Griffiths) equivalent to zero. Our main result computes $CHd_{\mathrm{inc}}(X)_{\mathbb Q}$ (which coincides with the Albanese kernel $T(X){\mathbb Q}$ when $k$ is algebraically closed) in terms of Voevodsky's triangulated category of motives $DM_k$, namely, we show that $CHd{\mathrm{inc}}(X){\mathbb Q}$ is given by the second step of the orthogonal filtration $F{\bullet}$ on $CHd(X){\mathbb Q}$, i.e. $F2 CHd (X){\mathbb Q}= CHd{\mathrm{inc}}(X){\mathbb Q}$. The orthogonal filtration $F\bullet$ on $CHn(X){\mathbb Q}$ was introduced by the first author, and is an unconditionally finite filtration satisfying several of the properties of the still conjectural Bloch-Beilinson filtration. We also prove that the exterior product and intersection product of algebraic cycles algebraically equivalent to zero is contained in the second step of the orthogonal filtration. Furthermore, if we assume that the field $k$ is either finite or the algebraic closure of a finite field, then the main result holds in any codimension, i.e. $F2 CHn_{\mathrm{alg}}(X)_{\mathbb Q}= CHn_{\mathrm{inc}}(X)_{\mathbb Q}$. We also compute in the whole Chow group, $CHn(X)_{\mathbb Q}$, the second step of the orthogonal filtration $F2 CHn(X)_{\mathbb Q}$ in terms of the vanishing of several intersection pairings.

Summary

Paper to Video (Beta)

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.

Authors (2)

Collections

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