Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.11 — the least-upper-bound property implies the greatest-lower-bound property

Proved
Rudin.ch01_glb_from_lub

by LG · Sep 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

analysisorder-theory

Let SSS be an ordered set with the least-upper-bound property and let B⊆SB \subseteq SB⊆S be nonempty and bounded below. Let LLL be the set of lower bounds of BBB. Then sup⁡L\sup LsupL exists and equals inf⁡B\inf BinfB: there is an element xxx that is simultaneously the least upper bound of LLL and the greatest lower bound of BBB. Consequently every ordered set with the least-upper-bound property automatically has the greatest-lower-bound property.

Preamble
import Mathlib
import Definitions.Def_Rudin_ch01_order
Formal statement
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 Rudin
Source
Walter Rudin, Principles of Mathematical Analysis, 3rd edition, McGraw-Hill, 1976, Chapter 1, p. 5, Theorem 1.11
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

Let SSS be a type equipped with a linear order (a total order: any two elements are comparable). Assume:

  • SSS has the least-upper-bound property, i.e. every nonempty subset of SSS that is bounded above possesses a least upper bound in SSS;
  • B⊆SB \subseteq SB⊆S is a subset that is nonempty and bounded below, i.e. there is some a∈Sa \in Sa∈S with a≤ba \le ba≤b for all b∈Bb \in Bb∈B.

Then there exists an element x∈Sx \in Sx∈S satisfying both of the following simultaneously:

x is a least upper bound of L(B),x is a greatest lower bound of B,x \text{ is a least upper bound of } L(B), \qquad x \text{ is a greatest lower bound of } B,x is a least upper bound of L(B),x is a greatest lower bound of B,

where L(B)={ a∈S:a≤b for all b∈B }L(B) = \{\, a \in S : a \le b \text{ for all } b \in B \,\}L(B)={a∈S:a≤b for all b∈B} is the set of lower bounds of BBB. Being a least upper bound of L(B)L(B)L(B) means xxx is an upper bound of L(B)L(B)L(B) and x≤cx \le cx≤c for every upper bound ccc of L(B)L(B)L(B); being a greatest lower bound of BBB means x≤bx \le bx≤b for all b∈Bb \in Bb∈B and a≤xa \le xa≤x for every lower bound aaa of BBB.

The conclusion is a bare existence statement (no uniqueness is asserted, although in a linear order such an xxx is in fact unique). The hypothesis that SSS have the least-upper-bound property is an assumption about all nonempty bounded-above subsets of SSS, not only those arising from BBB.

Human review
  • Endorsed by Shuze Chen · Sep 12, 2026

  • Endorsed by LG · Sep 12, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me