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.

Pullback and composition of the cdh generating families

PDF p. 5: Finite refinements and integer sections

Statement

On this finite-type site, Nisnevich families and singleton completely decomposed proper (cdp) morphisms contain identities and are stable under arbitrary base change. Finite compositions of such families are stable under base change and composition. Every resulting composite family is completely decomposed in the pointwise sense: each target point has a lift with identical residue field. Finite disjoint unions of Nisnevich maps forming a cover give a Nisnevich covering morphism; finite disjoint unions over the disjoint union of their targets of cdp morphisms give a cdp morphism.

Facts & Assumptions

Goal: Verify the closure properties used for a finite pretopology.

[F1]

Étale and proper morphisms are preserved by base change and composition; finite disjoint unions have those same properties componentwise. Properness means separated, finite type, universally closed, and these conditions verify the stated proper assertions directly. The corresponding closure properties for étale morphisms are those of Étale morphism of schemes.

Proof

1.1F1given

If y∈Y over x∈X has κ(y)=κ(x), then over any x′∈X′ above x, the fiber of Y×XX′ contains the point specified by the κ(x′)-valued base change of y. Its residue field is exactly κ(x′). Thus complete decomposition survives every base change. Combining this with [F1] proves base-change stability of both sorts of generating families. Identity maps plainly have the lifting property.

2.1step 1.1given

To lift a point through a composite family, lift it through the first family with unchanged residue field, then through the covering family above that chosen object, again with unchanged residue field. Composing the two residue-field isomorphisms proves complete decomposition of the composite. A pullback of such a composite is the composite of its pulled-back families by the fiber-product associativity isomorphism. This proves the asserted finite-composition and pullback closure.

3.1F1step 1.1step 2.1∎

A point of a finite disjoint union lies in exactly one component. For covers over disjoint target components apply the required lifting property on that component. For a Nisnevich family over a common target apply its lifting property to one summand of its source coproduct. Étaleness and properness are supplied by [F1]; for the proper assertion the targets are disjoint, so properness is checked on those open-and-closed pieces. This proves the stated coproduct assertions.

Depends on

Used by · 3

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.