Alphabeta Math
DefinitionDefinition: AI-generatedProof: Not applicable
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.

Bloch cycle complexes and higher Chow groups

PDF p. 4: Smooth comparison with Bloch cycles

Definition

Let k be a field, X smooth of finite type over k, and r≥0. For n≥0 put Δn=Spec⁡k[t0,…,tn]/(∑ata−1). A nonempty coordinate face is obtained by setting a proper subset of the coordinates to zero. An integral closed subscheme W⊂X×Δn of codimension r is admissible if every component of its intersection with every such face has codimension r in that face; empty intersections are allowed. Codimension is measured on the ambient irreducible component containing the generic point. Define zr(X,n) as the free abelian group on the admissible subschemes.

For n≥1, identify {ti=0} with Δn−1 by retaining the remaining coordinates in increasing order and set din[W]=∑TℓOW,ηT(OW,ηT/(ti))[T], where T ranges over the components of W∩{ti=0} and ηT is its generic point. The empty sum is zero. Extend by integral linearity and set ∂n=∑i=0n(−1)idin. Put zr(X,n)=0 for n<0 and ∂n=0:zr(X,n)→zr(X,n−1) for every n≤0. The resulting homological complex is Bloch's cycle complex zr(X,∙), and its higher Chow groups are CHr(X,n)=Hn(zr(X,∙))=ker⁡∂n/im⁡∂n+1. In particular they vanish for n<0. This is the unnormalized complex; no quotient by degenerate simplices is taken.

Facts & Assumptions

Given: k,X,r as above.

Goal: Justify the coefficients, differential and homology quotient.

[F1]

The admissible face lemma supplies finite coefficients, admissible face images and the identities didj=dj−1di for i<j. Admissible face restrictions and their cycle identities

[F2]

Alternating face sums form a chain complex, whose homology is the displayed quotient and vanishes in negative degrees. Alternating face boundaries square to zero, Homology object of a chain complex

Justification

The local rings in the coefficient formula need not be discrete valuation rings and the cycles need not be smooth. The proper single-face calculation in [F1] supplies exactly the finite lengths shown. The cycle-level compatibility in [F1] uses the explicitly imported simplicial-cycle input locally on integral smooth affine opens; no quotient by rational equivalence is used. Thus all face maps are defined, and [F2] gives ∂2=0 and makes the homology quotient well-defined. This definition does not assert the separate comparison with motivic cohomology or the identification of degree zero with the classical Chow group.

Depends on

Used by · 19

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.