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.
is bounded and disconnected, so being an interval of is not enough
Statement refuted
Refuted claim: the set of rationals between and is connected (Separated sets, disconnection, and connected subset of ), where is the copy of inside (The rationals embed densely in the reals).
is bounded, and it contains every rational lying between its two endpoints, so it is order-convex as a subset of the ordered field : it is an interval of that field. As a subset of it is nevertheless disconnected, split at the irrational point . So the equivalence of A subset of is connected if and only if it is order-convex, that is, an interval genuinely uses the completeness of , and "is an interval of the order it carries from " is not enough to make a set connected.
Facts & Assumptions
Given: The copy of in , the set , and the real with and .
The refuted claim: is connected.
Separated sets, disconnection and connectedness (Separated sets, disconnection, and connected subset of ).
is the smallest closed superset of , so for every closed (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 ).
Each of and is a closed set and each of and is an open set (Open subset of (every point has a neighbourhood inside it), closed subset (complement open), and clopen, Intervals of : the nine order-convex forms, nondegeneracy, and length).
In a complete ordered field every has a unique with (Square roots exist: a unique with ; the positives are ).
No rational squares to (FALSE: some rational number squares to 2); the map is an injective embedding of ordered fields, so it preserves sums, products and the order (The rationals embed densely in the reals, The rationals as equivalence classes of pairs of integers).
Squaring is strictly monotone on the nonnegatives: gives (Squaring is monotone on the nonnegatives); and the order is total and transitive (The multiplicative identity is positive, Ordered field, Complete ordered field (least-upper-bound property)).
A set is bounded when it has an upper and a lower bound (Lower bound, bounded below, bounded set).
Counterexample
By [L4] there is a unique real with , and : indeed since , while would give by [L6].
: if for a rational , then by [L5], and injectivity of the embedding gives in , contradicting [L5].
is bounded, since for every by the definition of .
Put and . Then , because every satisfies by step 1.2 and hence or ; and both are nonempty, since and by step 1.1, both being rationals in .
and are separated: is closed and contains , so by [L2] and hence ; symmetrically and . Hence is a disconnection of and is disconnected, so the claim [A1] is refuted.
Remarks
-
What the witness shows about A subset of is connected if and only if it is order-convex, that is, an interval. That theorem says a subset of is connected exactly when it is order-convex in . is not order-convex in : the point lies between and and is not in . So no contradiction arises, and the example locates precisely what "interval" has to mean in the theorem: order-convex with respect to the complete order, not with respect to the order of a dense subfield.
-
Where completeness is spent in the theorem, and why it is absent here. The proof of A subset of is connected if and only if it is order-convex, that is, an interval produces a supremum, and that supremum is the point at which the two pieces of a would-be disconnection must meet. For the corresponding supremum is , which exists in and not in ; inside there is no point at which to detect the split, which is exactly why looks like an interval there.
-
The same phenomenon in a different guise is is closed and bounded in and is not compact: a set that behaves well inside because the real number that would spoil it is missing from . In both cases the missing number is .
Depends on
- A subset of $\mathbb{R}$ is connected if and only if it is order-convex, that is, an interval
- Separated sets, disconnection, and connected subset of $\mathbb{R}$
- FALSE: some rational number squares to 2
- Square roots exist: a unique $\sqrt{a} \ge 0$ with $(\sqrt{a})^2 = a$; the positives are $\{x^2 : x \neq 0\}$
- The rationals as equivalence classes of pairs of integers
- The rationals embed densely in the reals
- Intervals of $\mathbb{R}$: the nine order-convex forms, nondegeneracy, and length
- Interior, closure, boundary and exterior of a subset of $\mathbb{R}$
- Open subset of $\mathbb{R}$ (every point has a neighbourhood inside it), closed subset (complement open), and clopen
- 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
- Squaring is monotone on the nonnegatives
- Lower bound, bounded below, bounded set
- Ordered field
- Complete ordered field (least-upper-bound property)
- The multiplicative identity is positive
Used by
Nothing in the library uses this result yet.
Dependency tree · next 3 levels
Direct dependencies and their dependencies through the next three levels: 66 results over 29 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
- Connected space (Wikipedia) (standard reference, not scraped)
- Square root of 2 (Wikipedia) (standard reference, not scraped)
- W. Rudin, Principles of Mathematical Analysis, 3rd ed., Ch. 2 (Example 2.44) (standard reference, not scraped)