How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Classical Chow relations and Bloch boundaries
PDF p. 13: Proof of Proposition 6.1: ordinary CH3 identification and degree-seven vanishing
Statement
Let be a field, a smooth finite-type -scheme, and . Let be the subgroup generated by principal divisors , for integral closed of codimension and nonzero rational functions ; for this subgroup is zero. Here a principal divisor is the codimension-one cycle of orders of , defined using lengths of local rings, pushed forward from to . Then , with the degree-zero boundary subgroup. The classical Chow group is .
Statement references
Facts & Assumptions
Given: The field , smooth finite-type scheme and in the statement; separatedness is not assumed.
Goal: Prove both inclusions between the principal-divisor relations and the degree-one boundaries.
On use , so the alternating boundary is the fiber at minus the fiber at , with the local-length multiplicities. Degree-zero cycles are . Bloch cycle complexes and higher Chow groups, Degree-zero Bloch cycles are ordinary cycles, Boundaries in degree zero
Proper generically finite pushforward carries a principal divisor to the divisor of its norm. Graph closure gives the zero-minus-pole formula, with the same local-length orders, without separatedness over the field. Proper norm and graph formulas for principal divisors
A smooth finite-type scheme over a field is noetherian and regular and has finitely many disjoint integral open-and-closed components. Indeed it has finitely many irreducible components, and two cannot meet because every regular local ring is a domain. We may calculate cycles separately on these components. The finite-type dimension, codimension and Cartier-divisor formulas and regular-local-domain fact are imported with their exact hypotheses in Regularity and dimensions for finite-type cycle arguments. In particular a proper dominant projection has dimension difference equal to its function-field transcendence degree. The regularity input there justifies the clopen decomposition without a perfect-field assumption.
Proof
Work on one integral component of of dimension . Let be an admissible codimension- generator, so . Let be its reduced closure in and let be the reduced image under projection. The projection is proper, so is closed and integral; its factorization through the reduced is proper by base change along . Its generic fiber is a closed integral subscheme of , and hence has dimension zero or one; these are also the possible transcendence degrees of . The dimension formula in [F3] gives or . If the latter holds, is an integral closed subset of of its full dimension, hence equals that product; its two face cycles are both , and its boundary is zero. This also handles every possible generator when , since then .
Conversely, for let be integral of codimension and . Form the graph closure of [F2]. Remove the fiber and use to identify with . If , this open part of is a nonempty integral closed codimension- subscheme of . Its intersections are . Each is empty or an effective Cartier divisor of pure codimension one on the integral finite-type , so the cycle is admissible. Its boundary equals by the graph formula. If , the divisor is zero and no generator is needed. Thus every principal-divisor relation is a boundary.
For the equal-dimensional case of step 1.1 is proper dominant generically finite and has codimension . The rational function on is nonzero and defined as a rational function because admissibility excludes from either endpoint. Its divisor is the zero fiber minus the one fiber, with exactly the lengths in [F1]; it is invertible near infinity. By the norm formula, pushing this cycle to gives . Thus every boundary lies in , with zero as already shown in the product case.
The two inclusions prove for , and step 1.1 proves it for because . The finite clopen decomposition of [F3] gives the equality on and the stated ordinary rational-equivalence quotient.
Source notes
The old MVW import covered separated schemes only. The current argument retains the original smooth finite-type scope by using precise proper-divisor formulas that impose no separatedness over the field. It does not invoke localization or an identification with a separately constructed motivic theory.
Depends on
Dependency tree · 3 levels
Arrows run from prerequisites to the items that use them. External source nodes link directly to the cited text. The view shows up to three dependency steps; open a prerequisite to continue.
Sources
- Mazza–Voevodsky–Weibel, Lecture notes on motivic cohomology, December 2005 author PDF · December 2005 xprova author PDF, printed p. 5 (PDF p. 16), Definition 17.1 and discussion, printed pp. 141–142 (PDF pp. 152–153); retrieved 2026-11-09