Alphabeta Math
LemmaStatement: Literature-sourcedProof: 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.

Finite constant cdh sections

PDF p. 5: Proof of Lemma 2.4, YA and equation (2.5)

Statement

Assume the Axiom of Choice. Let k be an algebraically closed field, X a separated seminormal scheme of finite type over k, and A a finite set. Put YA=∐a∈ASpec⁡k. On the big cdh site of separated finite-type k-schemes, the constant cdh sheaf associated to A is canonically isomorphic to hYAcdh, the cdh sheafification of T↦Hom⁡k(T,YA). Consequently there are natural bijections Γcdh(X,A)≅Hom⁡k(X,YA)≅Map⁡(π0(X),A). These assertions include the empty set and empty scheme cases.

Here the constant cdh sheaf associated to A is the sheafification of the constant presheaf with value A and identity restriction maps. Sections Γcdh(X,A) mean its value at X. The set π0(X) consists of the connected components of the underlying topological space; a connected component is a maximal subset that cannot be partitioned into two nonempty relatively open subsets. A finite-type k-scheme has a finite affine cover by spectra of finitely generated k-algebras; separated means that its diagonal is a closed immersion. Seminormal means that every point has an affine neighbourhood with coordinate ring R such 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, a separated seminormal finite-type k-scheme X, and a finite set A.

Goal: Identify the constant cdh sheaf with hYAcdh and obtain the displayed natural bijections.

[F1]

The big cdh site has separated finite-type k-schemes as objects, and its coverings include Nisnevich coverings. In particular, an open cover is a cdh covering family: open immersions are étale and each point has a lift with unchanged residue field. Completely decomposed proper covers and the cdh topology

[F2]

Sheafification is left adjoint to the inclusion of sheaves into presheaves. A sheaf assigns a unique amalgamation to every compatible family on a covering sieve. Scheme sites and sheafification

[F3]

For a perfect field k and separated finite-type k-schemes T,Y, the cdh sheafification of hY evaluated at a seminormal T is naturally Hom⁡k(T,Y). A field is perfect when every algebraic extension is separable. Representable cdh sheaves and seminormalization Seminormality and seminormalization

[F4]

Under the Axiom of Choice, if T is a Noetherian k-scheme, morphisms T→YA correspond naturally to functions π0(T)→A. A Noetherian scheme has a Noetherian underlying space, meaning that descending chains of closed subsets stabilize. Maps to finite disjoint unions of the base The Axiom of Choice

Proof

technique · Use the universal property of sheafification and the open decomposition induced by a map to the finite disjoint union, then apply the two stated suppliers
1.1givenconstruct

Let CA be the constant presheaf. There is a natural map CA→hYA sending a∈A to the composite T→Spec⁡k→YA through the summand labelled a. The same definition covers A=∅, when the map has empty domain at each object.

2.1F1F2step 1.1construct

For any cdh sheaf F, restriction along this map gives a function Hom⁡(hYA,F)→Hom⁡(CA,F). It is bijective. Indeed, given a presheaf map u:CA→F and a morphism f:T→YA, write Ta for the inverse image of the a-summand. The Ta are pairwise disjoint open-and-closed subschemes covering T; because A is finite, they are objects of the site. On Ta take uTa(a). These sections agree on all overlaps: the overlaps are empty, and the sheaf axiom for the empty open cover gives F(∅) exactly one element. By the sheaf axiom they glue uniquely to an element of F(T). Pullback of this decomposition and uniqueness of gluing show that the construction is natural in T, hence defines a presheaf map hYA→F. If A is empty, a map T→YA=∅ exists only for T=∅, and the same empty-cover argument applies.

3.1F2step 1.1step 2.1

The construction in step 2.1 restricts to u: the constant morphism labelled a has Ta=T and all other inverse images empty. Conversely, any presheaf map hYA→F must take f to the glued section in step 2.1, since its restriction to each Ta is determined by naturality and the constant map labelled a. Thus the two operations are inverse. By [F2], the induced map acdhCA→acdhhYA is an isomorphism: both sheaves represent the same natural functor of cdh sheaves. This proves the asserted canonical identification of sheaves.

4.1F3givenstep 3.1

The finite disjoint union YA is separated and of finite type over k, including when it is empty. An algebraically closed field is perfect, since every algebraic extension is the field itself. Thus [F3] applies to the given X and YA, and the seminormality hypothesis gives hYAcdh(X)≅Hom⁡k(X,YA). Together with step 3.1 this yields the first displayed bijection.

5.1F4givenstep 4.1

A finite-type scheme over a field is Noetherian: its finite affine cover has finitely generated coordinate algebras, which are Noetherian by the Hilbert basis theorem, and a finite union of Noetherian open subspaces is Noetherian. Applying [F4] to X gives the second displayed bijection. The two bijections are natural in X and A: the first is induced by natural sheaf maps and the natural comparison in [F3], and the second is natural by [F4].

6.1F4step 3.1step 4.1step 5.1∎

Steps 3.1, 4.1 and 5.1 prove the sheaf identification and both claimed bijections, including the empty cases covered by the constructions and [F4].

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