TheoremBase

Proof

Throughout we use the axioms of a total order: reflexivity, antisymmetry, transitivity and comparability. By the definition of the maximum, exactly one of the following two cases occurs.

Case A: a≤ba\le b. Then max⁡{a,b}=b\max\{a,b\}=b.

Case B: a≤ba\le b does not hold. Then max⁡{a,b}=a\max\{a,b\}=a, and comparability gives b≤ab\le a.

Claim 2. In Case A the maximum is bb and in Case B it is aa, so in either case it is aa or bb.

Claim 1. In Case A we have a≤b=max⁡{a,b}a\le b=\max\{a,b\}, and b≤b=max⁡{a,b}b\le b=\max\{a,b\} by reflexivity. In Case B we have a≤a=max⁡{a,b}a\le a=\max\{a,b\} by reflexivity, and b≤a=max⁡{a,b}b\le a=\max\{a,b\} as noted above.

Claim 3. Suppose max⁡{a,b}≤c\max\{a,b\}\le c. By claim 1 we have a≤max⁡{a,b}a\le\max\{a,b\} and b≤max⁡{a,b}b\le\max\{a,b\}, so transitivity gives a≤ca\le c and b≤cb\le c. Conversely, suppose a≤ca\le c and b≤cb\le c. By claim 2 the element max⁡{a,b}\max\{a,b\} is aa or bb, and in either case max⁡{a,b}≤c\max\{a,b\}\le c.

Claim 4. In Case A we have max⁡{a,b}=b\max\{a,b\}=b. If b≤ab\le a also holds, then antisymmetry gives a=ba=b, and max⁡{b,a}\max\{b,a\} is aa or bb by claim 2, hence equals bb; if b≤ab\le a does not hold, then by the definition of the maximum max⁡{b,a}=b\max\{b,a\}=b. In either case max⁡{b,a}=b=max⁡{a,b}\max\{b,a\}=b=\max\{a,b\}.

In Case B we have max⁡{a,b}=a\max\{a,b\}=a and b≤ab\le a, so by the definition of the maximum max⁡{b,a}=a=max⁡{a,b}\max\{b,a\}=a=\max\{a,b\}.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…