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.
The rational-map equivalence relation is transitive
Statement
Let and be classical affine varieties. The relation used in Rational maps between irreducible classical affine varieties is transitive: if are representatives with and , then .
Facts & Assumptions
Given: Classical affine varieties and , representatives on nonempty affine opens , and witnesses and with on and on .
A rational-map representative is defined on a nonempty affine open subset of , and two representatives are equivalent when they agree on a nonempty affine open subset of the overlap (Rational maps between irreducible classical affine varieties).
Every nonempty open subset of a classical affine variety is dense (Every nonempty open subset of an affine variety is dense).
Principal opens form a basis, and the intersection of two principal opens is again principal (Principal opens form a basis for the Zariski topology on an affine variety).
Proof
The sets and are nonempty open subsets of by [L1]. By [L2], both are dense in , so their intersection is nonempty.
The set is open in . Since both and are affine opens, [L3] identifies their intersection as another affine open subset. On that common open we have .
Step 2.1 gives a nonempty affine open subset of on which and agree. Therefore .
Depends on
Used by
Cited to discharge well-definedness by Rational maps between irreducible classical affine varieties.
Dependency tree · two levels
9 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, rational-map discussion in Chapter 5l (standard reference, not scraped)
- Donu Arapura, Notes on Basic Algebraic Geometry, rational-map discussion in §3.2 (standard reference, not scraped)