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.
A morphism of ringed spaces need not be a morphism of locally ringed spaces
Statement refuted
Every morphism of ringed spaces between locally ringed spaces is automatically a morphism of locally ringed spaces.
Facts & Assumptions
Given: A field , the local ring , and the field .
A morphism of ringed spaces between one-point spaces is exactly a ring map between their stalk rings (Morphisms of ringed spaces).
A morphism of locally ringed spaces must induce local maps on stalks (Morphisms of locally ringed spaces).
A local ring has a unique maximal ideal (A local ring is a nonzero commutative ring with a unique maximal ideal).
Counterexample
Regard and as one-point ringed spaces. The assignment defines a ring homomorphism , so by [F1] it defines a morphism of ringed spaces
The unique maximal ideal of is by [L1], while the unique maximal ideal of the field is . Under the stalk map , the element goes to the nonzero element , hence to a unit of . Therefore the image of is not contained in , so the stalk map is not local. By [F2], the morphism is not a morphism of locally ringed spaces.
This gives a morphism of ringed spaces between locally ringed spaces that is not locally ringed. The statement is false.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
11 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
- Ravi Vakil, The Rising Sea, Exercise 6.2.E (standard reference, not scraped)
- The Stacks Project, Section 26.2 (standard reference, not scraped)