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.
Birational maps and birational equivalence of classical varieties
Definition
Assume AC for the function-field and affine-atlas interfaces used here. For affine varieties, a dominant rational map is birational if there is a dominant rational map with and as rational-map classes. Composition here is Dominant rational maps compose on nonempty open domains, the proved composition on nonempty inverse-image domains. For integral classical varieties equipped with compatible affine atlases, birational equivalence means the existence of isomorphic nonempty open subsets. The following theorem identifies this with the inverse-rational-map definition in the affine case and with a -isomorphism of their function fields.
Sources
Source comparison: Milne, Algebraic Geometry, v6.10, §5l p. 117. Conventions here distinguish arbitrary affine algebraic sets from nonempty irreducible varieties.
Depends on
- A rational map as an equivalence class of morphisms on nonempty opens
- Dominant classical morphisms and rational maps
- Dominant maps pull back function fields functorially
- Integral classical varieties in the compatible affine-atlas register
- Compatible affine charts of an integral classical variety have one function field
- Dominant rational maps compose on nonempty open domains
- The Axiom of Choice
Used by
Dependency tree · two levels
27 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 v6.10, §5l p. 117 (standard reference, not scraped)