Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (z-ai/glm-5.2)verified 2026-07-29 (claude-fable-5)
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.

Connected components, quasicomponents, and totally disconnected spaces

Definition

Let (X,T)(X, \mathcal{T}) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), with subsets carrying the subspace topology (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) and connectedness as in Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets. Let xXx \in X.

  • The connected component of xx is C(x)  :=  {AX:xA and A is connected}.C(x) \;:=\; \bigcup \{\, A \subseteq X : x \in A \text{ and } A \text{ is connected} \,\} . A component of XX is a set of the form C(x)C(x) for some xXx \in X.
  • The quasicomponent of xx is Q(x)  :=  {KX:xK and K is clopen in X}.Q(x) \;:=\; \bigcap \{\, K \subseteq X : x \in K \text{ and } K \text{ is clopen in } X \,\} . A quasicomponent of XX is a set of the form Q(x)Q(x).
  • XX is totally disconnected when C(x)={x}C(x) = \{x\} for every xXx \in X.

Both are well posed, and the obligations are discharged here. The family united in the definition of C(x)C(x) is nonempty, since the singleton {x}\{x\} is connected: a singleton admits no separation, a separation requiring two disjoint nonempty pieces. Every member of that family contains xx, so A union of connected subspaces with a point in common is connected, and so is a union of a family in which every member meets a fixed connected member claim 1 applies and C(x)C(x) is connected; being a union of every connected set through xx, it contains each of them, so C(x)C(x) is the largest connected subset of XX containing xx. The family intersected in the definition of Q(x)Q(x) is nonempty as well, since XX itself is clopen (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison), so the intersection is a set; it contains xx, every member doing so.

Both notions are defined by a property of XX, not of an ambient space. A component of a subspace SXS \subseteq X means a component of the space SS, and is written CS(y)C_S(y) when the space needs naming. The same holds for quasicomponents.

Totally disconnected, spelled out. XX is totally disconnected exactly when every connected subset of XX has at most one point: if some connected AA had two points xyx \ne y then AC(x)A \subseteq C(x) would give C(x){x}C(x) \ne \{x\}, and conversely if C(x){x}C(x) \ne \{x\} then C(x)C(x) is a connected set with at least two points. The empty space is totally disconnected, having no point to test.

A discrete space is totally disconnected. Let XX carry the discrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies) and let AXA \subseteq X have two distinct points x,yx, y. Every subset of AA is open in AA, so ({x},A{x})(\{x\}, A \setminus \{x\}) is a pair of open, disjoint, nonempty sets covering AA, that is a separation. Hence no connected subset has two points and every component is a singleton. The converse fails: total disconnectedness does not force the topology to be discrete.

Remarks

  • Why two notions and not one. The component of xx is built from the connected sets through xx and the quasicomponent from the clopen sets containing xx. One is an inner approximation, assembled from below out of pieces known to be connected; the other is an outer approximation, cut down from above by every partition of XX into two clopen pieces. They always satisfy C(x)Q(x)C(x) \subseteq Q(x), and they can differ; both facts are theorems on this page, and the difference is exactly the gap between "cannot be split by a clopen set" and "is connected".

  • Quasicomponents are what a separation argument actually produces. A proof that two points cannot be separated typically produces a clopen set containing both or neither, which is a statement about QQ, not about CC. Naming the weaker notion keeps such an argument honest instead of letting it be read as a connectedness claim.

  • The definition of totally disconnected is stated with components, not with quasicomponents. The condition "every quasicomponent is a singleton" is a different and strictly stronger property, usually called total separatedness. Nothing on this page asserts that the two agree.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 51 results over 20 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources