Lemma 115.24.3. Let $(S, \delta )$ be as in Chow Homology, Situation 42.7.1. Let $X$ be locally of finite type over $S$. Assume $X$ integral and $\dim _\delta (X) = n$. Let $\{ D_ j\} _{j \in J}$ be a locally finite collection of effective Cartier divisors on $X$. Let $n_ j, m_ j \geq 0$ be collections of nonnegative integers. Set $D = \sum n_ j D_ j$ and $D' = \sum m_ j D_ j$. Assume that $\dim _\delta (D_ j \cap D_{j'}) = n - 2$ for every $j \not= j'$. Then $D \cdot [D']_{n - 1} = D' \cdot [D]_{n - 1}$ in $\mathop{\mathrm{CH}}\nolimits _{n - 2}(X)$.
Proof. This lemma is a trivial consequence of Lemmas 115.23.10 and 115.24.2 in case the sums are finite, e.g., if $X$ is quasi-compact. Hence we suggest the reader skip the proof.
Here is the proof in the general case. Let $i_ j : D_ j \to X$ be the closed immersions Let $p : \coprod D_ j \to X$ denote coproduct of the morphisms $i_ j$. Let $\{ Z_ a\} _{a \in A}$ be the collection of irreducible components of $\bigcup D_ j$. For each $j$ we write
By Lemma 115.23.10 we have
By Lemma 115.24.1 we have
As in the definition of the Gysin homomorphisms (see Chow Homology, Definition 42.29.1) we choose cycles $\beta _{a, j}$ on $D_ j \cap Z_ a$ representing $i_ j^*[Z_ a]$. (Note that in fact $\beta _{a, j} = [D_ j \cap Z_ a]_{n - 2}$ if $Z_ a$ is not contained in $D_ j$, i.e., there is no choice in that case.) Now since $p$ is a closed immersion when restricted to each of the $D_ j$ we can (and we will) view $\beta _{a, j}$ as a cycle on $X$. Plugging in the formulas for $[D]_{n - 1}$ and $[D']_{n - 1}$ obtained above we see that
Moreover, with the same conventions we also have
In these terms Lemma 115.24.2 (see also its proof) says that for $j \not= j'$ the cycles $\sum d_{j', a} \beta _{a, j}$ and $\sum d_{j, a} \beta _{a, j'}$ are equal as cycles! Hence we see that
and we win. $\square$
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).
All contributions are licensed under the GNU Free Documentation License.
Comments (2)
Comment #97 by Pieter Belmans on
Comment #100 by Johan on