Theorem 1.11 — the least-upper-bound property implies the greatest-lower-bound property
ProvedRudin.ch01_glb_from_lubLet be an ordered set with the least-upper-bound property and let be nonempty and bounded below. Let be the set of lower bounds of . Then exists and equals : there is an element that is simultaneously the least upper bound of and the greatest lower bound of . Consequently every ordered set with the least-upper-bound property automatically has the greatest-lower-bound property.
import Mathlib import Definitions.Def_Rudin_ch01_order
namespace Rudin
/-- Rudin, Theorem 1.11: an ordered set with the least-upper-bound property also has the
greatest-lower-bound property, and the infimum of a set `B` bounded below is the supremum
of the set of lower bounds of `B`. -/
theorem ch01_glb_from_lub {S : Type*} [LinearOrder S]
(hS : HasLeastUpperBoundProperty S) (B : Set S) (hne : B.Nonempty) (hbdd : BddBelow B) :
∃ x : S, IsLUB (lowerBounds B) x ∧ IsGLB B x := by sorry
end RudinRead-back
What the Lean code literally says, in plain math · Aristotle (Harmonic)
Let be a type equipped with a linear order (a total order: any two elements are comparable). Assume:
- has the least-upper-bound property, i.e. every nonempty subset of that is bounded above possesses a least upper bound in ;
- is a subset that is nonempty and bounded below, i.e. there is some with for all .
Then there exists an element satisfying both of the following simultaneously:
where is the set of lower bounds of . Being a least upper bound of means is an upper bound of and for every upper bound of ; being a greatest lower bound of means for all and for every lower bound of .
The conclusion is a bare existence statement (no uniqueness is asserted, although in a linear order such an is in fact unique). The hypothesis that have the least-upper-bound property is an assumption about all nonempty bounded-above subsets of , not only those arising from .
Confirmed by the mission captain (proposal self-audit).