Theorem 2.47 — connected subsets of the line
ProvedRudin.ch02_connected_iff_intervaltopology
A subset of is connected if and only if it is order-convex: whenever and , also .
Preamble
import Mathlib
Formal statement
namespace Rudin
/-- Rudin, Theorem 2.47: a subset `E` of the real line is connected if and only if it is
order-convex: whenever `x, y ∈ E` and `x < z < y`, also `z ∈ E`. -/
theorem ch02_connected_iff_interval (E : Set ℝ) :
IsPreconnected E ↔ ∀ x ∈ E, ∀ y ∈ E, ∀ z : ℝ, x < z → z < y → z ∈ E := by sorry
end RudinSource
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 2, p. 42, Theorem 2.47
Read-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
For an arbitrary subset , the following are asserted to be equivalent:
- is preconnected: it cannot be split by two open sets that both meet , cover , and whose intersection misses . (This is the connectedness condition without the nonemptiness requirement, so the empty set qualifies.)
- is order-convex: for all , all and all real , if and then .
Both inequalities in the convexity condition are strict, and , are not assumed ordered in advance — the condition is vacuous unless . The equivalence is claimed for every , including and singletons.
Human review
Confirmed by the mission captain (proposal self-audit).