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.
Normalization of the node is two-to-one over the node
Statement refuted
False claim: the normalization morphism of a classical variety is injective.
Facts & Assumptions
Assume the Axiom of Choice.
Given: AC, an algebraically closed field of characteristic not two, the nodal curve , and its normalization .
The normalization of the node is , , a finite birational morphism, and the fibre of over the node consists exactly of the two distinct points and (Normalizing the nodal plane curve, The normalization of an irreducible affine variety, Normalization is finite, surjective and birational).
The fibre is the set-theoretic preimage of the point under (Images and fibres of a regular map).
AC is inherited through the classical localization, normalization, or finite-morphism suppliers cited above (The Axiom of Choice).
Counterexample
By [F1] the fibre of the normalization over the node has the two distinct elements and , so by [F2] the set-theoretic preimage has two elements.
The map therefore sends two distinct points of to the same point of , so it is not injective; the claim is refuted. In dimension one a normalization need not be injective; in contrast, when the target is normal the normalization is an isomorphism and hence injective.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
40 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
- J. S. Milne, Algebraic Geometry (2025 version), Ch. 8 Example 8.6(b): the node has two branches (standard reference, not scraped)