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.
A Noetherian space is a finite union of irreducible closed subsets
Statement
Assume the Axiom of Choice (The Axiom of Choice). Let be a Noetherian topological space (Noetherian topological spaces via ACC on opens or DCC on closed subsets) and let irreducible components be those of Irreducible components of a topological space. Then is a finite union of irreducible closed subsets of , and consequently has only finitely many irreducible components.
Facts & Assumptions
is Noetherian if and only if every descending chain of closed subsets of stabilizes (Noetherian topological spaces via ACC on opens or DCC on closed subsets).
is irreducible when and every decomposition into closed subsets has or (Irreducible topological spaces and irreducible subsets in the subspace topology).
A subset of a subspace is closed in if and only if for some closed (Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace).
A topology is closed under finite intersections, so the complements of finite unions of closed subsets are open and finite unions of closed subsets are closed (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
is a minimal element of exactly when no element of is strictly below it (Maximal element and greatest element).
The Axiom of Dependent Choice says that for a nonempty set , a relation entire on and a point there is a sequence , (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
In ZF the Axiom of Choice implies the Axiom of Dependent Choice (AC implies DC implies countable choice).
The Axiom of Choice is assumed in the statement (The Axiom of Choice).
If with each irreducible and closed in and no contained in , then the irreducible components of are exactly (Existence and basic properties of irreducible components).
An irreducible component of is an irreducible subset maximal under inclusion (Irreducible components of a topological space).
Proof
Given: A Noetherian topological space , the family of closed subsets of that are not finite unions of irreducible closed subsets of , and the Axiom of Choice of [F8].
Let be the family of closed subsets of which are not a finite union of irreducible closed subsets of , and suppose . I claim has a minimal element [F5]. Otherwise every would have some with , so the relation on with exactly when would be entire on the nonempty set ; choosing and applying dependent choice [F6], which is available by [F7] from the Axiom of Choice [F8] assumed in the statement, produces a sequence of closed subsets of , contradicting [F1]. Hence has a minimal element .
Let be a minimal element of as in [step 1.1]. Then , because the empty family is a finite union of irreducible closed subsets of and so ; and is not irreducible, because an irreducible closed subset is the one-member union of itself. Since , the failure of irreducibility [F2] supplies closed subsets of the subspace with and ; by [F3] there are closed subsets with , so that and are closed in [F4], and and .
By minimality of in , the strictly smaller closed subsets of [step 2.1] are not members of , so each of them is a finite union of irreducible closed subsets of ; the union of those two finite unions exhibits [F4] as a finite union of irreducible closed subsets of , contradicting . Hence : every closed subset of , and in particular itself, is a finite union of irreducible closed subsets of .
Write with each irreducible and closed in , as [step 3.1] provides. If some member is contained in the union of the others, delete the one of least index; each deletion lowers the number of members by one, so after finitely many deletions no choice is needed and one arrives at a subfamily in which each is still irreducible and closed in and no is contained in . By [F9] the irreducible components of are exactly ; in particular has finitely many irreducible components, and the theorem together with the definition [F10] is proved. The Axiom of Choice is used at exactly one point, in [step 1.1], where it provides dependent choice [F7]; the splitting, the finite-union arguments and the deletion process use no choice principle. ∎
Depends on
- Noetherian topological spaces via ACC on opens or DCC on closed subsets
- Irreducible topological spaces and irreducible subsets in the subspace topology
- Irreducible components of a topological space
- Existence and basic properties of irreducible components
- Subspace topology: the traces of the open sets, its closed sets and its bases, the continuity of the inclusion, and the characteristic property of a map into a subspace
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- Maximal element and greatest element
- The Axiom of Choice
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- AC implies DC implies countable choice
Used by
Dependency tree · two levels
25 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)