TheoremBase

The Maximum and Minimum of Two Elements of a Total Order

In a totally ordered set, any two elements a and b have a maximum and a minimum, which are the larger and the smaller of the two, and they are the least upper and greatest lower bounds of a and b.

Statement

In the setting of Sets and Maps: Ordinary Notation, let ≤\le be a total order on a set XX, and let a,b,c∈Xa,b,c\in X.

The subset {a,b}\{a,b\} of XX has a greatest element max⁡{a,b}\max\{a,b\} and a least element min⁡{a,b}\min\{a,b\}.

If a≤ba\le b, then max⁡{a,b}=b\max\{a,b\}=b and min⁡{a,b}=a\min\{a,b\}=a; if b≤ab\le a, then max⁡{a,b}=a\max\{a,b\}=a and min⁡{a,b}=b\min\{a,b\}=b.

min⁡{a,b}≤a≤max⁡{a,b}\min\{a,b\}\le a\le\max\{a,b\} and min⁡{a,b}≤b≤max⁡{a,b}\min\{a,b\}\le b\le\max\{a,b\}.

max⁡{a,b}≤c\max\{a,b\}\le c if and only if a≤ca\le c and b≤cb\le c.

c≤min⁡{a,b}c\le\min\{a,b\} if and only if c≤ac\le a and c≤bc\le b.

c<max⁡{a,b}c<\max\{a,b\} if and only if c<ac<a or c<bc<b; and min⁡{a,b}<c\min\{a,b\}<c if and only if a<ca<c or b<cb<c.

Proofs

Log in to submit a proof.

Loading...

Citations

Loading…

Dependencies

Loading…

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

Log in to comment.

Loading…