Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-generatedprecheck passverified 2026-08-04 (gpt-5.6-sol-codex-subscription)
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.

The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies placed in the connectedness hierarchy

Example

Let X be a set carrying one of the six topologies of The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies. The table records where each sits, with connectedness as in Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, local connectedness as in Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point and path-connectedness as in Paths, path-connected spaces and path components.

topologyconnectedlocally connectedpath-connectedcomponents
discreteonly if X has at most one pointyesonly if X has at most one pointthe singletons
indiscreteyesyesyesX
cofinite, X infiniteyesyesnot decided hereX
cocountable, X uncountableyesyesnot decided hereX
particular point pyesyesyesX
SierpinskiyesyesyesS

Sierpinski space is the particular-point topology on a two-point set (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies), so its row is an instance of the row above it and is not verified separately.

The component column reads at nonempty X; the empty space is connected and has no components at all, there being no points (The components of a space are its maximal connected subsets, they partition it, and each of them is closed).

Two entries are deliberately left open. No item among this page's declared prerequisites settles whether the cofinite topology on an infinite X, or the cocountable topology on an uncountable X, is path-connected, so the table says nothing either way.

Facts & Assumptions

Given: A set X carrying one of the six standard topologies.

[A2]

The open sets are: all subsets (discrete); ∅ and X (indiscrete); ∅ and the sets of finite complement (cofinite); ∅ and the sets of at most countable complement (cocountable); ∅ and the sets containing p (particular point). A union of two finite sets is finite (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies, Finite, countably infinite, countable, uncountable).

[A3]

X is locally connected when every open U and every x∈U admit an open connected V with x∈V⊆U; a component of X is the largest connected set through a point, and the components partition X (Locally connected and locally path-connected spaces: a neighbourhood base of open connected, respectively open path-connected, sets at every point, Connected components, quasicomponents, and totally disconnected spaces, The components of a space are its maximal connected subsets, they partition it, and each of them is closed).

[A5]

A nonempty set is at most countable exactly when some surjection N→ it exists; there is a bijection N→N×N; R is uncountable (A nonempty set is at most countable iff it is a surjective image of N, N×N≈N, R is uncountable (Cantor's nested intervals, 1874), Finite, countably infinite, countable, uncountable).

Verification

technique · direct
1.1

Discrete. If X has two distinct points x,y then ({x},X∖{x}) is a separation by [A2] and [A1], so X is disconnected; every connected subset therefore has at most one point, the subspace topology on a subset again being discrete, so the components are the singletons by [A3], and X is not path-connected, a path being in particular a connected image. Every singleton is open and connected, so X is locally connected by [A3].

A1A2A3
1.2

Indiscrete. The only open sets are ∅ and X by [A2], so no two nonempty open sets are disjoint and X is connected by [A1]; hence, for nonempty X, its only component is X by [A3], and X itself is an open connected set containing every point, so X is locally connected by [A3].

A1A2A3
1.3

Indiscrete, path-connectedness. Every function γ:[0,1]→X is continuous by [A4], the preimages of ∅ and X being ∅ and [0,1]; so for x,y∈X the function with γ(0)=x and γ(t)=y for t>0 is a path from x to y, and X is path-connected.

A2A4
1.4

Cofinite, X infinite. Let U,V be nonempty open sets, with complements CU, CV finite by [A2]. Then X∖(U∩V)=CU∪CV is finite by [A2], so U∩V≠∅, X being infinite. Hence no separation exists and X is connected by [A1].

A1A2
1.5

Cocountable, X uncountable, and X a subset of R or any uncountable set. Suppose (U,V) were a separation. By [A2] the complements of U and of V are at most countable, and those complements are V and U respectively, so both U and V are nonempty and at most countable with U∪V=X.

A1A2
1.6

Particular point p. Every nonempty open set contains p by [A2], so two nonempty open sets meet and X is connected by [A1]; its only component is X by [A3].

A1A2A3
2.1

In the situation of step 1.5, [A5] gives surjections f,g:N→U and N→V, and h:N×N→X with h(0,k):=f(k) and h(m,k):=g(k) for m≠0 is onto U∪V=X; composing with a bijection N→N×N from [A5] shows X at most countable, contrary to hypothesis. So the cocountable topology on an uncountable X is connected.

step 1.5A5
2.2

Particular point is locally connected and path-connected. Every nonempty open U contains p and carries as a subspace the particular-point topology on U with the same p, hence is connected by step 1.6, so [A3] is witnessed by U itself. For x,y∈X define γ(0):=x, γ(1):=y and γ(t):=p for 0<t<1; the preimage of an open V is ∅ if V=∅, and otherwise contains (0,1) and is one of (0,1), [0,1), (0,1], [0,1], all open in [0,1] by [A6]. So γ is continuous by [A4] and is a path from x to y.

step 1.6A2A3A4A6
3.1

Cofinite and cocountable are locally connected. A nonempty open U carries as a subspace the cofinite, respectively cocountable, topology on U by [A2] and [A1]; U is infinite, respectively uncountable, its complement being finite, respectively at most countable, while X is not. So U is connected by step 1.4, respectively step 2.1, and being open and containing each of its points it witnesses [A3].

step 1.4step 2.1A1A2A3
4.1

Sierpinski space is the particular-point topology on a two-point set with particular point its open point, by [A2], so steps 1.6 and 2.2 apply to it verbatim; and every nonempty connected space has its whole underlying set as its unique component by [A3]. This completes the table.

step 1.1step 1.2step 1.3step 1.4step 2.1step 2.2step 3.1A2A3∎

Remarks

  • Connectedness is cheap when there are few open sets. Four of the six topologies are connected for the same structural reason: no two nonempty open sets are disjoint. That is immediate for the indiscrete and particular-point topologies, and for the cofinite and cocountable ones it is the statement that the ambient set is not a union of two small sets.

  • Local connectedness here is never informative. In every connected case above, every nonempty open subspace is again of the same kind and hence connected, so local connectedness holds for free. A space where local connectedness carries information must have open sets that are not themselves connected, which is what happens in R2 and its subspaces.

  • Why two cells are left blank. A path in the cofinite or cocountable topology is a continuous map out of [0,1], and deciding whether a non-constant one exists needs machinery this page's declared prerequisites do not supply: for the cofinite case a comparison of ∣X∣ with the cardinality of R, and for the cocountable case an argument about the image of a dense countable subset. Neither is available here, so the honest entry is that the question is not settled.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

75 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