Alphabeta Math
LemmaStatement: AI-adaptedProof: 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.

Integer cdh sections on seminormal schemes

PDF p. 5: Lemma 2.4

Statement

Assume the Axiom of Choice. Let k be an algebraically closed field and X a separated seminormal scheme of finite type over k. Then there is a canonical isomorphism of abelian groups Hcdh0(X,Z)≅Zπ0(X). In particular, if X is nonempty and connected, this group is canonically Z.

Here π0(X) is the set of connected components of the underlying topological space: a connected component is a maximal nonempty connected subset, and connected means that the subset has no partition into two nonempty relatively open subsets. In particular, π0(∅)=∅. The group Zπ0(X) consists of all functions from that set to Z, with pointwise addition; for the empty set it is the zero group. The cdh site used here is the big site of separated finite-type k-schemes with the cdh topology. The constant integer cdh sheaf is the sheafification of the constant presheaf with value Z, and Hcdh0(X,Z) is its group of sections over X. Seminormality means that each point has an affine neighbourhood whose coordinate ring R has the property that each pair x,y∈R satisfying x3=y2 has a unique a∈R with a2=x and a3=y.

Facts & Assumptions

Given: The Axiom of Choice, an algebraically closed field k, and a separated seminormal finite-type k-scheme X.

Goal: Construct the stated canonical group isomorphism, including the empty-scheme case.

[F1]

For every finite set A, the constant cdh sheaf A‾ has a natural bijection A‾(X)≅Map⁡(π0(X),A) under these hypotheses and the Axiom of Choice. This bijection is natural in maps of finite sets. Finite constant cdh sections

[F2]

Every section of the constant integer cdh sheaf over X factors through A‾(X) for some finite subset A⊆Z. Finite refinement for integer cdh sections

[F3]

Sheafification of a set-valued presheaf is the twofold plus construction: a plus section is represented by a matching family on a covering sieve, and two families represent the same section when they agree on a common covering subsieve. Restriction uses pullback of sieves. The sheafification is functorial and left adjoint to inclusion of sheaves. Scheme sites and sheafification

[F4]

A finite-type scheme over a field is Noetherian, and under the Axiom of Choice its connected components are finite in number and clopen. In particular every integer-valued function on π0(X) has finite image. Maps to finite disjoint unions of the base The Axiom of Choice

Proof

technique · Pass from finite constant sets to integers, using finite local values and the natural finite-set identifications
1.1F3construct

A pointwise injective map of presheaves F→G induces a pointwise injective map F+→G+. Indeed, if two matching families from F have equal images in G+(T), their images agree on some common covering subsieve by [F3]. Pointwise injectivity makes the original families agree there, so they represent the same element of F+(T). Applying the same argument again shows that sheafification preserves such injections. In particular, for every inclusion of sets A⊆B, the induced map A‾→B‾ is pointwise injective.

2.1F1step 1.1

For finite A⊆Z, [F1] identifies A‾(X) with functions π0(X)→A. By naturality, whenever A⊆B are finite subsets of Z, the map between these section sets corresponds to inclusion of the corresponding function sets. By step 1.1, the map from each A‾(X) into Z‾(X) is injective. Moreover, the images for two finite subsets A,B are both contained in the image for the finite union A∪B.

3.1F1F2step 2.1

By [F2], the images in step 2.1 cover Z‾(X). They therefore give a well-defined bijection from Z‾(X) to the set of finite-image functions π0(X)→Z: if a section is represented using two finite subsets, injectivity into the integer sheaf and passage to their union show that the two representations coincide there, and [F1] then gives the same function. Conversely every finite-image function is obtained from [F1] using its finite image as A. This also handles an empty image and an empty scheme.

4.1F1F3step 3.1construct

The bijection respects addition. If sections are represented by finite-value functions with values in A and B, their sum is represented by the induced map of sheaves A‾×B‾→C‾, where C={a+b:a∈A,b∈B}, followed by C‾→Z‾. This follows locally from the addition map of constant presheaves and the sheaf axiom; its value on each component is the sum of the two values. Thus the bijection is a group isomorphism onto the finite-image functions.

5.1F4step 4.1∎

By [F4], π0(X) is finite, so every function on it has finite image. Step 4.1 is consequently the claimed isomorphism to Zπ0(X). The construction uses natural sheaf maps and the natural bijections in [F1], so it is canonical. If X is nonempty and connected, it has exactly one connected component and the target is Z; if X is empty, the target is the zero group.

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