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.
Split augmented simplicial schemes and matching objects
Definition
Fix a base scheme and work in the category of -schemes (Schemes), in which finite limits and coproducts exist (Fibre product of schemes, Products and initial and terminal S-schemes). An augmented simplicial -scheme is a simplicial object in this category (Simplicial objects, simplicial commutative rings and homotopy groups) augmented over : -schemes for with face maps and degeneracy maps satisfying the simplicial identities, together with structure morphisms compatible with all of them; write for the augmentation. A -truncated such object consists of the data in degrees .
For the matching object is the finite limit over the boundary of : there is one copy of for every order-preserving injection with . For , compatibility is imposed by the structure map , where and . Equivalently, , the value at of the right adjoint of the -skeleton truncation; set . The canonical boundary map is the morphism whose components are the structure maps of , and it exists by the universal property of the limit.
A splitting consists of subobjects , called the nondegenerate parts, such that the degeneracy maps induce isomorphisms for every . The surjections are order-preserving, and the identity surjection contributes , not the whole . Each component map is ; in particular . The object is split (Deligne: s-scinde) if it admits such a splitting; for a -truncated object the same condition is required only for . For schemes these subobjects are open-and-closed coproduct summands. Thus the -construction records nondegenerate parts, rather than adding copies of already degenerate simplices a second time.
An augmented simplicial -scheme is a proper hypercover of if the augmentation and every canonical boundary map , , is proper and surjective (Proper morphisms). Neither smoothness, separatedness, finiteness nor properness of the individual terms is part of the definition; those enter as hypotheses where they are used.
Remarks
- Nondegenerate parts. Relative to the splitting, every geometric -simplex is uniquely for a nondegenerate simplex and a surjection . Split degeneracies do not require an extra degeneracy or a section of the augmentation.
- Matching objects as closed subschemes. The limit computing can be formed from finitely many fibre products of the terms , . If all the lower terms are separated over , then is a closed subscheme of a finite fibre product of the : the conditions comparing two composites of structure maps are equalities into a separated target, hence closed (Separated morphism of schemes). In particular a matching object of a hypercover over a separated field-scheme with terms projective over the field is itself projective over that field: the fibre products over are closed in the field-products by the closed diagonal of .
- The extension data. A split -truncated object with its specified splitting, its matching object and a morphism are the data from which Deligne's proposition (SGA 4 V bis 5.1.3; Deligne (6.2.3)-(6.2.4)) reconstructs, up to unique isomorphism preserving these data, a -truncated split extension whose degree- term restricts to on the nondegenerate part; the construction is carried out in the proof of the hyperresolution theorem on the page of this item, and no further splitting is chosen there.
Depends on
Used by
Dependency tree · two levels
26 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Pierre Deligne, Theorie de Hodge III, Publ. Math. IHES 44 (1974) 5-77, (6.2.1)-(6.2.4) (standard reference, not scraped)
- The Stacks Project, Simplicial Methods, Sections 14.2-14.3 and 14.19 (standard reference, not scraped)