The Stacks project

41.8 Cycles

Since we are not assuming our schemes are quasi-compact we have to be a little careful when defining cycles. We have to allow infinite sums because a rational function may have infinitely many poles for example. In any case, if $X$ is quasi-compact then a cycle is a finite sum as usual.

Definition 41.8.1. Let $(S, \delta )$ be as in Situation 41.7.1. Let $X$ be locally of finite type over $S$. Let $k \in \mathbf{Z}$.

  1. A cycle on $X$ is a formal sum

    \[ \alpha = \sum n_ Z [Z] \]

    where the sum is over integral closed subschemes $Z \subset X$, each $n_ Z \in \mathbf{Z}$, and the collection $\{ Z; n_ Z \not= 0\} $ is locally finite (Topology, Definition 5.28.4).

  2. A $k$-cycle on $X$ is a cycle

    \[ \alpha = \sum n_ Z [Z] \]

    where $n_ Z \not= 0 \Rightarrow \dim _\delta (Z) = k$.

  3. The abelian group of all $k$-cycles on $X$ is denoted $Z_ k(X)$.

In other words, a $k$-cycle on $X$ is a locally finite formal $\mathbf{Z}$-linear combination of integral closed subschemes of $\delta $-dimension $k$. Addition of $k$-cycles $\alpha = \sum n_ Z[Z]$ and $\beta = \sum m_ Z[Z]$ is given by

\[ \alpha + \beta = \sum (n_ Z + m_ Z)[Z], \]

i.e., by adding the coefficients.


Comments (0)


Post a comment

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.




In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 02QQ. Beware of the difference between the letter 'O' and the digit '0'.