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.

Finite coproducts and refinement inside a sieve

PDF p. 5: Finite refinements and integer sections

Statement

Let S be a cdh covering sieve on X and let {ui:Ui→X}i=1m be a B-family in S. Its coproduct u:W=∐iUi→X is a cdh covering morphism, and admits a finite word factorization into Nisnevich covering morphisms and cdp morphisms. No assertion that u∈S is made. If a two-stage refinement of u is supplied, V→qX′→pX,h:V→W,pq=uh, with q Nisnevich and p cdp, then Vi=h−1(Ui) are finitely many open-and-closed subschemes, {Vi→X′} is a finite Nisnevich family, and every composite Vi→X is in S.

Facts & Assumptions

Given: The finite B-family, and only for the last assertion the displayed refinement as an explicit premise.

Goal: Make the cover morphism available for a source refinement theorem while keeping final arrows inside S.

[F2]

Finite coproducts exist in the site; their summand inclusions are open-and-closed immersions. Such inclusions form a Nisnevich family: they are étale and uniquely lift their component points with unchanged residue fields. Nisnevich covers and distinguished squares

Proof

1.1F1

Realize the construction of the B-family by a finite tree of elementary generating-family substitutions. Start with the frontier X. When a leaf A is replaced by a generating family over it, take its source coproduct and leave all other leaves unchanged using their identities. The new frontier coproduct maps to the old one. For a Nisnevich substitution this is a Nisnevich covering morphism; for a cdp substitution it is cdp, by [F1] and the disjoint target components. Finitely many substitutions give a finite word with final frontier W, and composite u. Hence u is cdh covering. This is a consequence of the family construction, not closure of the sieve S under coproducts.

1.2F2given

Under the stated refinement, preimages of the summands of W give a finite open-and-closed decomposition V=∐iVi. Each Vi→X′ is étale since q is. Every point of X′ has a residue-preserving lift in V by the Nisnevich condition on q, and that point belongs to a summand Vi. Thus these restricted maps form a finite Nisnevich family. Their composites to X factor as Vi→Ui→uiX and therefore belong to S by sieve closure under precomposition. The schemes Vi remain separated of finite type over k.

2.1F2step 1.2∎

For emphasis, the generally invalid implication ui∈S for all i⇒∐ui∈S has not been used. For example the sieve on a disconnected X=A⨿B generated by its two nonempty summand inclusions does not contain idX, although their coproduct is idX. It is nonetheless a Nisnevich covering sieve. The split family in step 1.2 is the required correct refinement inside S.

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.