Alphabeta Math
LemmaStatement: AI-generatedProof: AI-generated
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 k be a field, X a smooth finite-type k-scheme, and r≥0. Let Rr(X)⊂Zr(X) be the subgroup generated by principal divisors div⁡Y(f), for integral closed Y⊂X of codimension r−1 and nonzero rational functions f∈k(Y)×; for r=0 this subgroup is zero. Here a principal divisor is the codimension-one cycle of orders of f, defined using lengths of local rings, pushed forward from Y to X. Then Rr(X)=Br(X), with Br(X)=im⁡(∂1) the degree-zero boundary subgroup. The classical Chow group is CHr(X)=Zr(X)/Rr(X).

Statement references

Facts & Assumptions

Given: The field k, smooth finite-type scheme X and r≥0 in the statement; separatedness is not assumed.

Goal: Prove both inclusions between the principal-divisor relations and the degree-one boundaries.

[F1]

On Δ1 use t=t0, so the alternating boundary is the fiber at t=0 minus the fiber at t=1, with the local-length multiplicities. Degree-zero cycles are Zr(X). Bloch cycle complexes and higher Chow groups, Degree-zero Bloch cycles are ordinary cycles, Boundaries in degree zero

[F2]

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

[F3]

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

1.1F1F3

Work on one integral component of X of dimension d. Let W⊂X×At1 be an admissible codimension-r generator, so dim⁡W=d−r+1. Let W‾ be its reduced closure in X×Pt1 and let Y⊂X be the reduced image under projection. The projection is proper, so Y is closed and integral; its factorization through the reduced Y is proper by base change along Y↪X. Its generic fiber is a closed integral subscheme of Pk(Y)1, and hence has dimension zero or one; these are also the possible transcendence degrees of k(W)/k(Y). The dimension formula in [F3] gives dim⁡Y=dim⁡W or dim⁡W−1. If the latter holds, W is an integral closed subset of Y×A1 of its full dimension, hence equals that product; its two face cycles are both [Y], and its boundary is zero. This also handles every possible generator when r=0, since then dim⁡W=d+1.

1.2F1F2F3

Conversely, for r>0 let Y⊂X be integral of codimension r−1 and f∈k(Y)×. Form the graph closure G⊂Y×Pu1 of [F2]. Remove the fiber u=1 and use t=u/(u−1) to identify Pu1∖{1} with At1. If f≠1, this open part of G is a nonempty integral closed codimension-r subscheme of X×At1. Its t=0,1 intersections are G0,G∞. Each is empty or an effective Cartier divisor of pure codimension one on the integral finite-type G, so the cycle is admissible. Its boundary equals div⁡Y(f) by the graph formula. If f=1, the divisor is zero and no generator is needed. Thus every principal-divisor relation is a boundary.

2.1F1F2step 1.1

For the equal-dimensional case of step 1.1 W‾→Y is proper dominant generically finite and Y has codimension r−1. The rational function h=t/(t−1) on W‾ is nonzero and defined as a rational function because admissibility excludes W 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 X gives ∂[W]=div⁡Y(Nm⁡k(W)/k(Y)h). Thus every boundary lies in Rr(X), with zero as already shown in the product case.

3.1F3step 1.1step 1.2step 2.1∎

The two inclusions prove Rr(X)=Br(X) for r>0, and step 1.1 proves it for r=0 because R0(X)=0. The finite clopen decomposition of [F3] gives the equality on X 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

Used by · 1

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