Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-6-sol)audited 2026-09-27
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 X 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 X is a finite union of irreducible closed subsets of X, and consequently X has only finitely many irreducible components.

Facts & Assumptions

[F1]

X is Noetherian if and only if every descending chain F0⊇F1⊇F2⊇⋯ of closed subsets of X stabilizes (Noetherian topological spaces via ACC on opens or DCC on closed subsets).

[F2]

X is irreducible when X≠∅ and every decomposition X=F1∪F2 into closed subsets has X=F1 or X=F2 (Irreducible topological spaces and irreducible subsets in the subspace topology).

[F4]

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).

[F5]

m∈P is a minimal element of P exactly when no element of P is strictly below it (Maximal element and greatest element).

[F6]

The Axiom of Dependent Choice says that for a nonempty set X, a relation R entire on X and a point a∈X there is a sequence x0=a, xnRxn+1 (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain).

[F7]

In ZF the Axiom of Choice implies the Axiom of Dependent Choice (AC implies DC implies countable choice).

[F8]

The Axiom of Choice is assumed in the statement (The Axiom of Choice).

[F9]

If X=X1∪⋯∪Xn with each Xi irreducible and closed in X and no Xi contained in ⋃j≠iXj, then the irreducible components of X are exactly X1,…,Xn (Existence and basic properties of irreducible components).

[F10]

An irreducible component of X is an irreducible subset maximal under inclusion (Irreducible components of a topological space).

Proof

Given: A Noetherian topological space X, the family of closed subsets of X that are not finite unions of irreducible closed subsets of X, and the Axiom of Choice of [F8].

1.1

Let A be the family of closed subsets of X which are not a finite union of irreducible closed subsets of X, and suppose A≠∅. I claim A has a minimal element [F5]. Otherwise every F∈A would have some F′∈A with F′⊊F, so the relation R on A with FRF′ exactly when F′⊊F would be entire on the nonempty set A; choosing F0∈A and applying dependent choice [F6], which is available by [F7] from the Axiom of Choice [F8] assumed in the statement, produces a sequence F0⊋F1⊋F2⊋⋯ of closed subsets of X, contradicting [F1]. Hence A has a minimal element F.

F1F5F6F7F8
2.1

Let F be a minimal element of A as in [step 1.1]. Then F≠∅, because the empty family is a finite union of irreducible closed subsets of X and so ∅∉A; and F is not irreducible, because an irreducible closed subset is the one-member union of itself. Since F≠∅, the failure of irreducibility [F2] supplies closed subsets F1,F2 of the subspace F with F=F1∪F2 and F1≠F≠F2; by [F3] there are closed subsets G1,G2⊆X with Fi=F∩Gi, so that F1 and F2 are closed in X [F4], and F1⊊F and F2⊊F.

F2F3F4step 1.1
3.1

By minimality of F in A, the strictly smaller closed subsets F1,F2 of [step 2.1] are not members of A, so each of them is a finite union of irreducible closed subsets of X; the union of those two finite unions exhibits F=F1∪F2 [F4] as a finite union of irreducible closed subsets of X, contradicting F∈A. Hence A=∅: every closed subset of X, and in particular X itself, is a finite union of irreducible closed subsets of X.

F4step 2.1
4.1

Write X=Y1∪⋯∪Ym with each Yi irreducible and closed in X, 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 X=X1∪⋯∪Xn in which each Xi is still irreducible and closed in X and no Xi is contained in ⋃j≠iXj. By [F9] the irreducible components of X are exactly X1,…,Xn; in particular X 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. ∎

F7F8F9F10step 1.1

Depends on

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