Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passjudge 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.

For a topological space the following agree: no separation exists, the only clopen subsets are ∅ and X, and every continuous map to the two-point discrete space is constant

Statement

Let (X,T) be a topological space (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison) and let 2={0,1} carry the discrete topology (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies). Call a map χ:X→2 constant when χ(x)=χ(y) for all x,y∈X.

1. The following four conditions are equivalent.

2. For A⊆X with 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), A is a connected subset of X if and only if the only subsets of A that are clopen in (A,TA) are ∅ and A, if and only if every continuous map A→2 is constant.

Claim 2 is claim 1 applied to the space (A,TA) and is stated separately because it is the form used in every later proof on this page: a connected set is tested by showing that a continuous two-valued function on it cannot take both values.

Facts & Assumptions

Given: A topological space (X,T) and the two-point discrete space 2={0,1}.

[A1]

A separation of X is a pair (U,V) of open, nonempty, disjoint sets with U∪V=X; X is connected when none exists; a subset carries the subspace topology and is connected when it is connected as a space (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, 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).

[A2]

A set is closed exactly when its complement is open, clopen when it is both open and closed; ∅ and X are clopen (Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).

[A3]

Every subset of 2 is open, hence also closed; the subsets of 2 are ∅, {0}, {1} and 2 (The discrete, indiscrete, cofinite, cocountable, particular-point and Sierpinski topologies).

[A5]

int⁡(A)⊆A⊆A‾ and ∂A=A‾∖int⁡(A); A is open exactly when A=int⁡(A) and closed exactly when A=A‾ (Interior, closure, boundary, exterior, derived set and isolated point in a topological space).

Proof

technique · direct
1.1

If C⊆X is clopen with C≠∅ and C≠X, then C and X∖C are both open by [A2], both nonempty, disjoint, and their union is X; so (C,X∖C) is a separation of X.

A1A2
1.2

If χ:X→2 is continuous, then χ−1[{0}] and χ−1[{1}] are clopen in X, since {0} and {1} are both open and closed in 2 by [A3] and preimages of open sets are open and of closed sets closed by [A4].

A3A4
1.3

If (U,V) is a separation of X, then χU,V:X→2 taking the value 0 on U and 1 on V is a well-defined function, because U and V are disjoint and cover X by [A1]; it is continuous, because the preimages of ∅, {0}, {1}, 2 are ∅, U, V, X, all open by [A1] and [A2], so [A4] and [A3] apply; and it is not constant, because U and V are nonempty.

A1A2A3A4
1.4

For A⊆X the conditions ∂A=∅ and "A is clopen" agree: by [A5] ∂A=∅ says A‾=int⁡(A), which together with int⁡(A)⊆A⊆A‾ forces A=int⁡(A)=A‾, that is A open and closed; conversely if A is clopen then int⁡(A)=A=A‾ and ∂A=∅.

A5
2.1

(a) implies (b): if (b) fails there is a clopen C∉{∅,X}, and step 1.1 turns it into a separation of X, so (a) fails.

step 1.1
2.2

(b) implies (c): let χ:X→2 be continuous; by step 1.2 the set χ−1[{0}] is clopen, hence by (b) it is ∅ or X; in the first case χ takes only the value 1 and in the second only the value 0, so χ is constant.

step 1.2
2.3

(c) implies (a): if (a) fails there is a separation (U,V) of X, and step 1.3 produces a continuous χU,V:X→2 that is not constant, so (c) fails.

step 1.3
2.4

(b) and (d) are the same condition, by step 1.4 applied to each subset of X.

step 1.4
3.1

Steps 2.1, 2.2 and 2.3 give (a) implies (b) implies (c) implies (a), so (a), (b) and (c) are equivalent, and step 2.4 adjoins (d); this is claim 1.

step 2.1step 2.2step 2.3step 2.4
4.1

Claim 2 is claim 1 applied to the topological space (A,TA), whose connectedness is by [A1] the definition of A being a connected subset of X.

step 3.1A1∎

Remarks

  • Which clause is used where. Clause (c) is the workhorse: it converts a connectedness claim into a statement about functions, so it composes with continuous maps and with unions, which is what makes the theorems after it short. Clause (b) is the one to use when a candidate clopen set is already in hand. Clause (d) is stated because a boundary computation is often the quickest route in a concrete space.

  • Why 2 and not an arbitrary discrete space. Any discrete space with at least two points would serve for clause (c), since a non-constant map into it composes with a retraction onto two of its points. Fixing 2 avoids having to say which two, and every use below needs no more.

  • The empty space satisfies all four clauses. Its only subset is ∅=X, which is clopen and has empty boundary; the unique map ∅→2 is constant vacuously; and no separation exists, since a separation needs a nonempty piece. So the convention of Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets is consistent with every clause here rather than being an exception to them.

Depends on

Used by

Dependency tree · two levels

22 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