Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (z-ai/glm-5.2)audited 2026-07-26
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.

A subset of R is connected if and only if it is order-convex, that is, an interval

Statement

Let E⊆R. Then E is connected (Separated sets, disconnection, and connected subset of R) if and only if E is order-convex (Intervals of R: the nine order-convex forms, nondegeneracy, and length), that is, if and only if

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

On the word "interval". Order-convexity is exactly the defining property that Intervals of R: the nine order-convex forms, nondegeneracy, and length proves for each of its nine forms, and in that sense the theorem says that the connected subsets of R are the intervals. The converse classification, that every order-convex subset of R is empty or one of the nine forms, is true and is explicitly not proved anywhere in this library; Intervals of R: the nine order-convex forms, nondegeneracy, and length records that omission in its own remarks. So the statement proved below is the equivalence with order-convexity, and the phrase "is an interval" is to be read as "is order-convex" throughout this page.

Facts & Assumptions

Given: A subset E⊆R.

[L1]

Separated sets, disconnection, connectedness; separated sets are disjoint (Separated sets, disconnection, and connected subset of R).

[L2]

A‾ is the smallest closed superset of A, so A⊆B gives A‾⊆B‾ and A‾⊆F for every closed F⊇A; and A‾ is exactly the set of points every neighbourhood of which meets A (The closure equals the set together with its limit points, equals the set of points every neighbourhood of which meets it, and is the smallest closed superset; a set is closed iff it contains its limit points, Interior, closure, boundary and exterior of a subset of R).

[L3]

Order-convexity, and the interval forms: (−∞,w] and [w,∞) are closed sets, (−∞,w) and (w,∞) are open sets, and the order is total and transitive (Intervals of R: the nine order-convex forms, nondegeneracy, and length, Open subset of R (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Ordered field, Complete ordered field (least-upper-bound property)).

[L4]

Least-upper-bound property: a nonempty subset of R bounded above has a unique least upper bound (Complete ordered field (least-upper-bound property), Suprema and infima are unique, Lower bound, bounded below, bounded set).

[L5]

Epsilon characterisation: for nonempty S bounded above and c=sup⁡S, every ε>0 admits s∈S with c−ε<s (Epsilon characterisation of the supremum).

[L6]

Nε(x)={ y:∣y−x∣<ε } (The ε-neighbourhood and the punctured ε-neighbourhood of a point of R).

[L7]

Every nonempty finite set of reals has a minimum, which is one of its members (Every nonempty finite set of reals has a maximum and a minimum, Maximum and minimum of a set).

[L8]

Ordered-field arithmetic: 0<1, so 2:=1+1>0 and 2−1>0; for d>0 one has 0<d⋅2−1<d; adding a constant preserves an inequality (The multiplicative identity is positive, Order is preserved by adding a constant and by adding inequalities, Sign rules for products and monotonicity of multiplication, Ordered field). These order-arithmetic facts are stated by their sources for the strict order only; the nonstrict forms used below follow by adjoining the equality case, in which the two sides coincide.

Proof

technique · direct
1.1

Suppose E is not order-convex: there are x,z∈E and w∈R with x≤w≤z and w∉E; then w≠x and w≠z, so x<w<z. Put A:=E∩(−∞,w) and B:=E∩(w,∞); then x∈A and z∈B, so both are nonempty, and A∪B=E because no element of E equals w.

assume-hypL3
1.2

Suppose instead that E is order-convex and that (A,B) is a disconnection of E; fix p∈A and q∈B. Separated sets are disjoint by [L1], so p≠q, and interchanging the names A and B if necessary, which is legitimate because the hypotheses on the pair are symmetric, we may assume p<q.

assume-hypL1choose
1.3

For a nonempty S⊆R bounded above, sup⁡S∈S‾: for every real ε>0 the fact [L5] supplies s∈S with sup⁡S−ε<s≤sup⁡S, so ∣s−sup⁡S∣<ε and s∈Nε(sup⁡S)∩S; thus every neighbourhood of sup⁡S meets S, and [L2] gives sup⁡S∈S‾.

L2L4L5L6
2.1

In the situation of step 1.1 the pair (A,B) is a disconnection: (−∞,w] is a closed set containing A, so A‾⊆(−∞,w] by [L2], whence A‾∩B⊆(−∞,w]∩(w,∞)=∅; symmetrically B‾⊆[w,∞) and A∩B‾=∅. So A and B are separated, nonempty, and their union is E, and E is disconnected.

step 1.1L1L2L3
2.2

In the situation of step 1.2 put S:=A∩[p,q]; it is nonempty because p∈A and p≤p≤q, and it is bounded above by q, so c:=sup⁡S exists by [L4], and p≤c≤q since p∈S and q is an upper bound.

step 1.2L3L4
3.1

c∈A: from S⊆A and [L2] we get S‾⊆A‾, and c∈S‾ by step 1.3, so c∈A‾ and hence c∉B because A‾∩B=∅; on the other hand p≤c≤q with p,q∈E and E order-convex gives c∈E=A∪B, so c∈A.

step 1.2step 1.3step 2.2L1L2
4.1

c<q, since c∈A and q∈B are distinct by [L1] while c≤q; and every v with c<v≤q lies in B: such a v satisfies p≤c<v≤q, so v∈E by order-convexity, and v∉A, for otherwise v∈A∩[p,q]=S would force v≤c.

step 1.2step 2.2step 3.1L1L3
5.1

c∈B‾, which is impossible: given a real ε>0, put t:=min⁡{ε⋅2−1, (q−c)⋅2−1}, a positive real by [L7] and [L8] since q−c>0, and v:=c+t; then c<v and v≤c+(q−c)⋅2−1<q, so v∈B by step 4.1, while ∣v−c∣=t≤ε⋅2−1<ε, so v∈Nε(c)∩B. Hence every neighbourhood of c meets B and c∈B‾ by [L2]; but c∈A by step 3.1 and A∩B‾=∅ by [L1]. So the assumed disconnection cannot exist and an order-convex E is connected.

step 3.1step 4.1L1L2L6L7L8
6.1

Step 2.1 shows that a set which is not order-convex is disconnected, hence a connected set is order-convex; step 5.1 shows that an order-convex set admits no disconnection, hence is connected. The two together are the asserted equivalence.

step 2.1step 5.1∎

Remarks

  • Where completeness is spent. Only in step 2.2, which produces sup⁡(A∩[p,q]); no other step uses the least-upper-bound property, and the rest is the order, ordered-field arithmetic and the definition of separation. The obstruction over an incomplete ordered field is traceable to the failure of that supremum to exist, and it is visible in Q∩[0,2] is bounded and disconnected, so being an interval of Q is not enough ↗: the set Q∩[0,2] contains all the rationals between its endpoints and is nevertheless disconnected as a subset of R, split at an irrational point that Q does not see.

  • The two directions are of different characters. "Not order-convex implies disconnected" is a construction, step 1.1, and needs nothing beyond the order. "Order-convex implies connected" is where the work sits, and the supremum c produced in step 2.2 is the point at which the two pieces would have to meet; the contradiction is that it is adherent to both.

  • The theorem is about subsets of R and its statement is written in order vocabulary, so it cannot even be stated where no order is present; Which results on this page use the order of R and therefore have no general-topological analogue collects the results on this page with that feature.

Depends on

Used by

Dependency tree · two levels

29 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