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.
Etale neighbourhoods and elementary etale neighbourhoods of a point
Definition
Let be a scheme (Schemes) and let be a point, with residue field (The residue field at a point of an affine scheme).
An 'etale neighbourhood of is a pair consisting of a scheme , a morphism of schemes that is 'etale (Étale morphism of schemes) and a point with . One writes . A morphism of 'etale neighbourhoods of is a morphism of -schemes (Schemes and morphisms over a base) with .
The 'etale neighbourhood is elementary if the canonical map of residue fields is an isomorphism, that is, if .
Three conventions belong to the definition. First, no affineness is required of ; in the arguments on this page the neighbourhoods produced are affine when this is useful, and the definition above is the general one of Stacks Definition 37.35.1. Second, the point need not be closed in , and the morphism is required to be 'etale as a morphism, not merely 'etale at the point ; a morphism that is 'etale only on an open neighbourhood of gives an 'etale neighbourhood after replacing by that neighbourhood. Third, if is an open neighbourhood of , then is an 'etale neighbourhood, and it is elementary since the residue field at is unchanged; the composition of two 'etale neighbourhoods of is again one, and the composition of elementary ones is elementary because both residue field maps are isomorphisms.
Depends on
Used by
Dependency tree · two levels
18 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
- The Stacks Project, More on Morphisms, Definition 37.35.1 (tag 02LE) and Section 37.35 (standard reference, not scraped)
- The Stacks Project, Morphisms of Schemes, Section 29.37 (etale morphisms) (standard reference, not scraped)