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.
Irreducibility is equivalent to every pair of nonempty open sets meeting
Statement
Let be an algebraically closed field, let , and let be a nonempty subset with the subspace Zariski topology. Then the following are equivalent:
- is irreducible.
- Every pair of nonempty open subsets of has nonempty intersection.
- Every nonempty open subset of is dense in .
Facts & Assumptions
Given: An algebraically closed field , an integer , and a nonempty subset with the subspace Zariski topology.
Proof
Assume is irreducible. If are nonempty open subsets with , then is a union of two proper closed subsets, contrary to irreducibility. Therefore every two nonempty open subsets of meet.
Conversely, assume every two nonempty open subsets of meet. If with and proper closed subsets, then and are nonempty disjoint open subsets, a contradiction. Hence is irreducible.
If every nonempty open subset of is dense and are nonempty open subsets, then , so meets the nonempty open set . Thus every pair of nonempty open subsets meets.
Assume every two nonempty open subsets of meet, and let be nonempty open. If , then is a nonempty open set disjoint from , contradiction. So is dense.
Steps 1.1 and 1.2 show that irreducibility is equivalent to pairwise intersection of nonempty opens, and steps 2.1 and 1.3 show that this is also equivalent to density of every nonempty open subset.
Depends on
Used by
Dependency tree · two levels
4 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, Chapter 2g (standard reference, not scraped)
- Donu Arapura, Notes on Basic Algebraic Geometry, §1.5 (standard reference, not scraped)