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.

Existence and basic properties of irreducible components

Statement

Assume the Axiom of Choice (The Axiom of Choice). Let X be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), irreducible subsets being those of Irreducible topological spaces and irreducible subsets in the subspace topology and irreducible components those of Irreducible components of a topological space. Then:

  1. if T⊆X is irreducible, then the closure T‾ of T in X (Interior, closure, boundary, exterior, derived set and isolated point in a topological space) is irreducible;
  2. every irreducible component of X is a closed subset of X;
  3. every irreducible subset of X is contained in an irreducible component of X; in particular every point of X lies in an irreducible component, so X is the union of its irreducible components;
  4. if X is nonempty and irreducible, then X is the unique irreducible component of X;
  5. if X=X1∪⋯∪Xn with each Xi an irreducible closed subset of X, and no Xi is contained in ⋃j≠iXj, then the irreducible components of X are exactly X1,…,Xn;
  6. if C⊆X is irreducible and W⊆X is closed with X=C∪W and C⊈W, then X∖W is a nonempty subset of C whose closure in X is irreducible.

Facts & Assumptions

[F1]

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

[F2]

The closure of A⊆X is the intersection of all closed subsets containing A (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

[F3]

A‾ is closed, contains A, and is contained in every closed F⊆X with A⊆F, so it is the smallest closed superset of A (A point lies in the closure of A iff every basic neighbourhood of it meets A; the closure is the smallest closed superset and equals A together with its derived set).

[F5]
[F6]

A topology is closed under arbitrary unions, and closed subsets are the complements of open subsets (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[F7]

Under the Axiom of Choice, a nonempty poset in which every chain has an upper bound has a maximal element (Zorn's lemma).

[F8]

m∈P is maximal when there is no x∈P with m<x, equivalently when m≤x implies x=m (Maximal element and greatest element).

[F9]

The Axiom of Choice is assumed in the statement and is the hypothesis of Zorn's lemma (The Axiom of Choice).

[F10]

An irreducible component of X is an irreducible subset maximal under inclusion: if D⊆X is irreducible and C⊆D then D=C (Irreducible components of a topological space).

Proof

Given: A topological space X, the notions of irreducible subset and irreducible component of [F1] and [F10], and the Axiom of Choice of [F9].

1.1

Let T⊆X be irreducible and let T‾ be its closure in X [F2]. Suppose T‾=Z1∪Z2 with Z1,Z2 closed in the subspace T‾. By [F5] each Zi is the trace Zi=T‾∩Fi of a closed Fi⊆X, so each intersection T∩Zi is closed in T; and T=(T∩Z1)∪(T∩Z2). Since T is irreducible and nonempty by [F1], T=T∩Zi for at least one i, that is, T⊆Zi. The closure of T computed inside the subspace T‾ equals T‾ by [F4], and it is contained in Zi because Zi is closed in T‾ and contains T; hence Zi=T‾. So T‾ admits no decomposition into two proper closed subsets and is irreducible, which is clause 1.

F1F2F4F5
1.2

Let T⊆X be irreducible [F1] and let P be the poset of those irreducible T′ with T⊆T′⊆X, ordered by inclusion; P is nonempty because T∈P. Every chain in P has an upper bound in P: for a chain C⊆P put E:=⋃T′∈CT′, so that T⊆E, and E is irreducible, because if E=Z1∪Z2 with Zi closed in E [F5], then for every T′∈C the pair (T′∩Z1,T′∩Z2) is a decomposition of the irreducible nonempty set T′ into closed subsets [F1], so T′⊆Z1 or T′⊆Z2; if every T′ is contained in Z1 then E=Z1, and otherwise some T0′∈C satisfies T0′⊈Z1, whence T0′⊆Z2, and for any T′∈C either T′⊆T0′, which gives T′⊆Z2, or T0′⊆T′, in which case T′⊈Z1 and irreducibility of T′ gives T′⊆Z2; so E=Z2 in that case too. Thus every chain in P has an upper bound, and Zorn's lemma [F7], which is a consequence of the Axiom of Choice [F9] assumed in the statement, produces a maximal element C∈P [F8]. Then C is an irreducible component: it is irreducible and contains T, and if D is irreducible with C⊆D⊆X then T⊆D, so D∈P and maximality of C in P gives D=C.

F1F5F7F8F9
1.3

Let C⊆X be irreducible [F1] and let W⊆X be closed with X=C∪W and C⊈W. Then C∖W≠∅, and X∖W=C∖W⊆C because X=C∪W; in particular the set whose closure is taken in clause 6 is nonempty. Put Z′:=X∖W‾ [F2]. Then Z′ is closed in X by [F3], and C⊆Z′∪W, so C=(C∩Z′)∪(C∩W) with C∩Z′ and C∩W closed in C [F5]. Since C is irreducible and nonempty [F1], one of the two sets equals C; the alternative C=C∩W would give C⊆W, which is excluded, so C=C∩Z′ and C⊆Z′. Now suppose Z′=E1∪E2 with E1,E2 closed in Z′ and Ei≠Z′. Each Ei is a trace of a closed subset of X [F5], hence closed in X because Z′ is closed in X [F3]; and C=(C∩E1)∪(C∩E2) with each C∩Ei closed in C, so irreducibility and nonemptiness of C [F1] give C⊆Ei for some i. Then X∖W⊆C⊆Ei with Ei closed in X, so Z′=X∖W‾⊆Ei by [F3], whence Ei=Z′, contradicting Ei≠Z′. Therefore Z′ is irreducible, and together with the nonemptiness and the inclusion X∖W⊆C this is clause 6.

F1F2F3F5
2.1

Let C⊆X be an irreducible component [F10]. Then C is irreducible, so its closure C‾ is irreducible by [step 1.1], and C⊆C‾. Maximality in [F10] applied to the irreducible subset C‾ gives C‾=C, and C‾ is closed by [F3]; hence C is a closed subset of X, which is clause 2.

F3F10step 1.1
2.2

A singleton subset {x}⊆X is irreducible: it is nonempty, and in any decomposition {x}=F1∪F2 into closed subsets the point x lies in F1 or in F2, so the corresponding Fi equals {x} [F1]. Applying [step 1.2] to T={x} produces an irreducible component of X containing x; hence every point of X lies in an irreducible component and X is the union of its irreducible components, which completes clause 3. If moreover X is nonempty and irreducible, then X is itself an irreducible subset of X contained in no larger irreducible subset, so X is an irreducible component by [F10]; and every irreducible component C⊆X satisfies C=X by maximality in [F10]. Thus X is the unique irreducible component of X, which is clause 4.

F1F10step 1.2
3.1

Let X=X1∪⋯∪Xn with each Xi irreducible and closed in X, and suppose no Xi is contained in ⋃j≠iXj. Let C⊆X be an irreducible component. Then C=(C∩X1)∪⋯∪(C∩Xn), and each C∩Xi is closed in C because Xi is closed in X [F5]; since C is irreducible and nonempty [F1], C=C∩Xi for some i, that is C⊆Xi, and maximality in [F10] applied to the irreducible subset Xi gives C=Xi. Conversely, for a given i the set Xi is contained in an irreducible component C by [step 2.2], and C=Xj for some j by what was just proved; then Xi⊆Xj, and j≠i would put Xi inside the union of the other members, so j=i and Xi=C is an irreducible component. Hence the irreducible components of X are exactly X1,…,Xn, which is clause 5.

F1F5F10step 2.2
4.1

Clause 1 is [step 1.1], clause 2 is [step 2.1], clause 3 is [step 1.2] together with [step 2.2], clause 4 is [step 2.2], clause 5 is [step 3.1] and clause 6 is [step 1.3], so all six clauses are proved. The Axiom of Choice [F9] is used at exactly one point, in [step 1.2], through Zorn's lemma [F7] applied to the poset of irreducible subsets containing a fixed irreducible subset; the verification of the chain condition there is a direct computation with unions and closed subsets [F6], and the remaining arguments use no choice principle. ∎

F6F7F9step 1.1step 2.1step 1.2step 2.2step 3.1step 1.3

Depends on

Used by

Dependency tree · two levels

21 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