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.
Projections on primes, stalks and residue fields
Statement
For , put . Given , its projections are and . Their contractions to coincide at . The stalk maps are They are local and induce embeddings agreeing on .
Facts & Assumptions
Given: The objects, hypotheses and conventions in the statement above.
Let and be maps of commutative unital rings, allowing the zero ring. In the category of all schemes, The projections correspond to and . (Affine fibre products are spectra of tensor products)
For , there is a canonical isomorphism . (The stalk of the affine structure sheaf at a prime is A_p)
Let , let , and put . The induced stalk homomorphism is local. (The stalk maps induced by a ring map are local)
Proof
F1 identifies the projection ring maps with the two tensor inclusions. Contraction therefore gives the stated primes, and their contractions to agree because .
Elements outside the contracted primes map outside and hence become units in . F2 identifies these localizations as stalks, and F3 shows that the displayed maps are local.
Quotient each local map by maximal ideals. The resulting unital maps between fields are injective: their kernels are proper ideals of a field, hence zero. The maps agree on and then on its residue field after localization and quotient. If there is no prime , so the pointwise assertion is vacuous.
Depends on
Used by
Dependency tree · two levels
14 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
- Stacks 26.17.2 and 26.17.5 (standard reference, not scraped)