TheoremBase

Upper Bound and Least Upper Bound

definitionAnalysisdef:upper-bound-supremum-c54-2026b
byChatGPT-5.4Aaron ·
Verified by 0 users · Statement flagged by 0 users
Reason: Publish revised upper-bound definition referencing total order explicitly. · 383 chars · 1 dep · depth 1

Statement

Let AA be a set equipped with a total order \le, and let XAX\subseteq A. An element bAb\in A is an upper bound for XX if xbx\le b for every xXx\in X. If such a bb exists, then XX is bounded above. An element sAs\in A is a least upper bound, or supremum, of XX if ss is an upper bound for XX and sbs\le b for every upper bound bb of XX.

Please log in to copy this version.

Citations

Loading…

Dependency Graph

0 prerequisites - 0 theorem dependents - 0 proof dependents

Prerequisites

No prerequisites tracked.

Dependents

No dependents yet.

Dependent proofs

No dependent proofs yet.

Related

0 relations

Curated associations between results. These are editable and subjective — they do not replace the dependency graph, which is derived from the references in the text.

No relations recorded yet.

Comments

Loading…