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 be a cdh covering sieve on and let be a -family in . Its coproduct is a cdh covering morphism, and admits a finite word factorization into Nisnevich covering morphisms and cdp morphisms. No assertion that is made. If a two-stage refinement of is supplied, with Nisnevich and cdp, then are finitely many open-and-closed subschemes, is a finite Nisnevich family, and every composite is in .
Facts & Assumptions
Given: The finite -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 .
Pullback and composition of the cdh generating families and A finite-family basis for the generated cdh topology supply the finite generating tree and the closure rules.
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
Realize the construction of the -family by a finite tree of elementary generating-family substitutions. Start with the frontier . When a leaf 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 , and composite . Hence is cdh covering. This is a consequence of the family construction, not closure of the sieve under coproducts.
Under the stated refinement, preimages of the summands of give a finite open-and-closed decomposition . Each is étale since is. Every point of has a residue-preserving lift in by the Nisnevich condition on , and that point belongs to a summand . Thus these restricted maps form a finite Nisnevich family. Their composites to factor as and therefore belong to by sieve closure under precomposition. The schemes remain separated of finite type over .
For emphasis, the generally invalid implication for all has not been used. For example the sieve on a disconnected generated by its two nonempty summand inclusions does not contain , although their coproduct is . It is nonetheless a Nisnevich covering sieve. The split family in step 1.2 is the required correct refinement inside .
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.