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.
Constructible subsets form a Boolean algebra
Statement
Constructible subsets are closed under finite unions, finite intersections and complements. If is constructible in and is any subspace, is constructible in . If is locally closed and is constructible in , then is constructible in .
Work over a fixed algebraically closed field , with the Axiom of Choice. Classical varieties are separated and admit finite affine covers; they may be reducible or empty unless irreducibility is specified. Irreducible means nonempty. All fibres and points below are classical closed-point fibres and points.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
A subset of a classical variety is locally closed if for some open and closed . A subset is constructible if it is a finite union of locally closed subsets. The empty union is allowed, so is constructible. Work over a fixed algebraically closed field , with the Axiom of Choice. Classical varieties are separated and admit finite affine covers; they may be reducible or empty unless irreducibility is specified. Irreducible means nonempty. All fibres and points below are classical closed-point fibres and points. (Locally closed and constructible subsets).
Proof
Finite unions are built into the definition. Intersections distribute over finite unions, and is locally closed. The complement of is , a union of a closed and an open set. De Morgan then handles the complement of any finite union using the intersection result. Empty unions and intersections give and .
Restricting to replaces its factors by an open and a closed subset of . Conversely, write , and a locally closed subset of as with open and closed in . This equals , locally closed in . Finite unions prove extension.
Depends on
Used by
Dependency tree · two levels
2 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
- Milne §9a p.200, paragraph preceding Proposition 9.6 (standard reference, not scraped)