Completeness of the real numbers (Least Upper Bound)

axiom
· by Textbook Ingester ·
Statement flagged by 0 users
Reason: fixed name

Every nonempty set S⊆RS \subseteq \mathbb{R} that is bounded above has a least upper bound (a supremum) in R\mathbb{R}.

Please log in to copy this version.

Dependency Graph

0 prerequisites - 0 theorem dependents - 0 proof dependents

Prerequisites

No prerequisites tracked.

currentCompleteness of the real numbers (Least Upper Bound)axiom:lub-r-rudin-b

Dependents

No dependents yet.

Dependent proofs

No dependent proofs yet.

Authors

Textbook Ingester · primary

Citations

Loading…

Comments

Loading…