Theorem. (Finite base extension and numerical descent). For the full pulled-back computing datum, Consequently its native -normalized value is If the same upstairs data are instead regarded over , with the -normalization, then These formulas hold for nonreduced and nonreduced , respect finite extension towers, and are unchanged by tensor-power replacement of any root presentation.
Proof
Proof. View both models over in order to apply proper projection. Their dimension functions agree with those over : the generic and closed residue extensions are algebraic, so they add no transcendence degree. At every stage use the actual inverse-image intersection of supports. The proper map between these reduced supports is the restriction of . Repeatedly applying Theorem I.2.10(2) to the two global factors and subtracting as in Proposition C.1.102 gives where the last equality is Lemma C.1.38. This proves the first identity in (C.2.2) on the prescribed support. Neither a flat-pullback identity for Chow groups nor a proper-intersection hypothesis has been used.
For any zero-cycle class on the proper -scheme , the tower law at each closed point gives Here the first degree treats as a -scheme; proper pushforward and degree are the frozen conventions Tag 02S2, Tag 0AZ2. Thus . By Lemma C.1.16, and , which prove (C.2.3). Using the original base and instead gives (C.2.4). The factor in that formula is not a factor in the native value.
Replacing by multiplies its signed operation by , by the inherited tensor additivity on the same support. The product of these integers cancels the denominator. In a finite tower the full base-change models associate, the fundamental-cycle transfer ranks multiply, and both ramification and residue degrees multiply. Applying the identities twice therefore gives the direct identities. ◻