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.
Irreducible components of a topological space
Definition
Let be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), and let irreducible subsets be as in Irreducible topological spaces and irreducible subsets in the subspace topology.
An irreducible component of is an irreducible subset which is maximal among the irreducible subsets of under inclusion (Maximal element and greatest element): if is irreducible and , then .
The empty space has no irreducible components, because an irreducible space is required to be nonempty; a one-point space has exactly one irreducible component, namely the point itself, because the only nonempty subset of a one-point space is the space itself. Assuming the Axiom of Choice (The Axiom of Choice), for a nonempty space the irreducible components exist, they are closed subsets whose union is , every irreducible subset of is contained in an irreducible component, and is irreducible exactly when is its own unique irreducible component. A Noetherian space has only finitely many irreducible components. These statements are proved under that hypothesis in Existence and basic properties of irreducible components and A Noetherian space is a finite union of irreducible closed subsets.
Depends on
Used by
Dependency tree · two levels
7 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
- The Stacks Project, Topology (standard reference, not scraped)