Alphabeta Math
CorollaryStatement: AI-adaptedProof: AI-generatedprecheck 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.

The connected subspaces of R with its usual topology are exactly the order-convex subsets, the published characterisation transported by the identification of the two descriptions of "open in R"

Statement

Give R its usual topology, the metric topology of dR(s,t)=∣s−t∣ (The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, The metric topology: a set is open when every one of its points has a ball around it inside the set; closed means open complement, Metrizable space: a topological space whose topology is induced by some metric; metrizability is topological, the metric is not), and let E⊆R carry 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). Then E is a connected subset of R (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets) if and only if E is order-convex (Intervals of R: the nine order-convex forms, nondegeneracy, and length, The order topology of a linearly ordered set, with the open rays as a subbasis; order-convex sets, order-density, the least upper bound property, and linear continua), that is

x,z∈E and x≤w≤z  ⟹  w∈E.

In particular each of the nine interval forms of Intervals of R: the nine order-convex forms, nondegeneracy, and length is connected, and so are ∅ and every singleton.

What has to be checked, and it is not the mathematics. The characterisation itself is the published A subset of R is connected if and only if it is order-convex, that is, an interval, which is stated for the connectedness of Separated sets, disconnection, and connected subset of R — a condition phrased with the open sets of Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen and the closure of Interior, closure, boundary and exterior of a subset of R. The present corollary says the same thing for the connectedness of Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets in the topological space R. What licenses the transport is that the two descriptions of "open in R" are the same condition word for word, which is unfolded in the proof rather than quoted.

Facts & Assumptions

Given: R with its usual topology and a subset E⊆R with the subspace topology.

[A1]

B(x,r)={ y:∣x−y∣<r }=(x−r, x+r)=Nr(x) for every x∈R and every real r>0: the three descriptions are the same set, being defined by the same condition ∣y−x∣<r (Open ball, closed ball and sphere in a metric space, The absolute value makes R a metric space: d(x,y)=∣x−y∣ is a metric, its open balls are the intervals (x−r,x+r), and it is unbounded, The ε-neighbourhood and the punctured ε-neighbourhood of a point of R, Intervals of R: the nine order-convex forms, nondegeneracy, and length).

[A3]

U⊆R is open in the sense of Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen exactly when every x∈U has some real ε>0 with Nε(x)⊆U; a set is closed there exactly when its complement is open.

[A4]

The closure of A⊆R in the sense of Interior, closure, boundary and exterior of a subset of R is the intersection of all closed supersets of A, and A, B are separated in the sense of Separated sets, disconnection, and connected subset of R when each misses the other's closure; a disconnection of E is a pair of nonempty separated sets with union E, and E is connected in that sense when none exists.

Proof

technique · direct
1.1

The two openness conditions coincide: by [A1] the ball B(x,r) and the neighbourhood Nr(x) are the same set, so "some r>0 with B(x,r)⊆U" and "some ε>0 with Nε(x)⊆U" are the same requirement on U at x, and [A2] and [A3] then quantify it over the same points.

A1A2A3
2.1

Hence the usual topology of R and the family of open sets of Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen are one and the same family of subsets of R, and therefore so are the two families of closed sets, each being the complements of the other family.

step 1.1A2A3
3.1

Consequently the closure operator of Interior, closure, boundary and exterior of a subset of R and the closure operator of the topological space R agree: each is defined as the intersection of all closed supersets, and by step 2.1 the two notions of closed set coincide, so the two intersections are over the same family.

step 2.1A4
4.1

Therefore "A and B are separated" means the same in [A4] and in [A5], so a disconnection of E in the sense of Separated sets, disconnection, and connected subset of R is exactly a decomposition of E into two nonempty sets separated in the topological space R.

step 3.1A4A5
5.1

So E is connected in the sense of Separated sets, disconnection, and connected subset of R if and only if E is a connected subset of the topological space R, both being the nonexistence of the same object by step 4.1 and [A5].

step 4.1A5
6.1

Combining step 5.1 with [A6], E is a connected subset of R if and only if E is order-convex; and each of the nine interval forms, the empty set and every singleton is order-convex, hence connected.

step 5.1A6∎

Remarks

  • Nothing here re-proves the hard direction. The mathematical content — that order-convexity is exactly connectedness on the line — is A subset of R is connected if and only if it is order-convex, that is, an interval, whose proof uses the least upper bound property. This corollary only checks that the vocabulary of the general definition and the vocabulary of the real-line definition denote the same conditions, so that the published theorem may be quoted afterwards without a translation step each time.

  • "Interval" is read as "order-convex" throughout. The published theorem records that the converse classification — that every order-convex subset of R is empty or one of the nine written forms — is not proved, and Intervals of R: the nine order-convex forms, nondegeneracy, and length records the same omission. The statement above is therefore written with order-convexity and not with a list of forms.

  • The identification is one sentence and is deliberately not routed through a conventions remark. A dependency edge onto a remark that itself points at material developed further on would mark every consequence of this corollary as resting on later material, which would be false of everything on this page. The computation B(x,r)=(x−r,x+r)=Nr(x) is short enough to carry in the open.

Depends on

Used by

Dependency tree · two levels

62 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