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 linear continuum is connected in its order topology, and so is every order-convex subset of it
Statement
Let be a linear continuum: a linearly ordered set with at least two elements that is order-dense and has the least upper bound property (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). Give its order topology. Then:
- is connected (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets).
- Every order-convex , with the subspace topology, is connected. In particular every interval , , , and every ray of is connected.
Claim 2 covers the degenerate cases: and every singleton are order-convex and connected.
Facts & Assumptions
Given: A linear continuum with its order topology, and an order-convex .
The order is linear, so any two elements are comparable and exactly one of , , holds; is transitive and antisymmetric (Partial order and partially ordered set).
Order-density: for in there is with . Least upper bound property: a nonempty subset with an upper bound has a least upper bound , which is an upper bound and is every upper bound (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, Upper bound, least upper bound, and strict upper bound).
is a basis for the order topology, so every open set containing a point contains a member of that family containing it (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, Basis and subbasis for a topology, and the topology generated by a family of sets).
A separation of a space is a pair of open, nonempty, disjoint sets whose union is the space; a space is connected when none exists; and every one-point space are connected (Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets, Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison).
For an order-convex the subspace topology on is the order topology of the restricted order (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, 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).
Proof
Suppose, for contradiction, that is a separation of : both open and nonempty, disjoint, with .
Fix and . They are distinct, and being disjoint, so by [A1] one is below the other; relabelling and if necessary, which is legitimate because the hypothesis of step 1.1 is symmetric in them, assume .
Put . It is nonempty, containing , and is an upper bound of it, so exists by [A2] and satisfies , since and is an upper bound.
Suppose . Then , since and the two sets are disjoint, so by [A1] and . By [A3] there is a basic open with ; is neither nor a set , since either would contain , giving . So is or with , and in both cases .
Suppose instead . Then , so by [A1] and . By [A3] there is a basic open with ; is neither nor a set , since either would contain , giving . So is or with , and in both cases ; moreover , since and would otherwise put in .
In the case of step 4.1, , so is not an upper bound of by [A2] and there is with ; then and , contradicting .
In the case of step 4.2, order-density gives with by [A2]; then , and , so while , contradicting that is an upper bound of .
By step 1.1 the point lies in , so one of the two cases applies, and each is contradictory by steps 5.1 and 5.2. Hence no separation of exists and is connected; this is claim 1.
For claim 2 let be order-convex. If has at most one element it is connected by [A4]. Otherwise carries the order topology of its restricted order by [A5], and is itself a linear continuum: it has at least two elements; it is order-dense, because for in the element with given by [A2] lies in by order-convexity; and it has the least upper bound property, because a nonempty with an upper bound has in by [A2], and for any puts in by order-convexity, where it is again the least upper bound. So claim 1 applies to .
Remarks
-
Both hypotheses are spent, each exactly once. The least upper bound property produces at step 3.1, and order-density produces the point at step 5.2. Neither may be dropped. An ordered set with a jump, a pair with , is separated by the two open sets and , which is what density forbids; and the rationals, which are order-dense but lack the least upper bound property, are separated by and its complement, both open.
-
Why the argument is asymmetric between the two cases. Case 4.1 needs only that is a least upper bound; case 4.2 needs a point strictly above inside , and only density supplies one. That asymmetry is intrinsic: a supremum can be approached from below in any ordered set, and stepping strictly above it while staying inside a small open set is what requires there to be no gaps.
-
Claim 2 is proved by re-reading as a continuum, not by a second argument. The two facts that make this legal are that an order-convex subset carries its own order topology as a subspace, and that order-density and the least upper bound property are inherited by order-convex subsets. Both are established at step 7.1 rather than assumed.
Depends on
- 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
- Separation of a topological space, connected and disconnected spaces, clopen sets, and connected subsets
- Upper bound, least upper bound, and strict upper bound
- Partial order and partially ordered set
- Topology on a set, open and closed sets, clopen sets, the closed-set axiomatisation, and the coarser/finer comparison
- 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
- Basis and subbasis for a topology, and the topology generated by a family of sets
Used by
- The long ray is connected and locally connected, every proper initial segment is order-convex and connected, and, assuming countable choice, no at most countable subset is cofinal Example
- The long ray is a linear continuum, hence connected; every one of its at most countable subsets is bounded above, assuming countable choice Theorem
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 67 results over 14 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
- Linear continuum (Wikipedia) (standard reference, not scraped)