TheoremBase

The slack clauses follow by contradiction, taking half the gap as the slack; the approximation clauses obtain sup S and inf S from the completeness of the reals and argue that otherwise b would be an upper, respectively lower, bound beating the supremum or infimum.

Proof

Each result cited is universally quantified over the data in its own statement.

By The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §reals, R\mathbb{R} is an ordered field, so its order is a total order (Ordered Fields §ordered-field). We use Rules of Arithmetic and Order in an Ordered Field for R\mathbb{R}.

Slack above. Suppose x≤y+εx\le y+\varepsilon for every real ε>0\varepsilon>0, and suppose that x≤yx\le y fails. Then y<xy<x by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation. Adding −y-y gives 0<x−y0<x-y (Rules of Arithmetic and Order in an Ordered Field §order-sum). Let ε=(x−y)/2\varepsilon=(x-y)/2; by Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares §halving, 0<ε<x−y0<\varepsilon<x-y. Adding yy gives y+ε<(x−y)+y=xy+\varepsilon<(x-y)+y=x (Rules of Arithmetic and Order in an Ordered Field §order-sum; as (x−y)+y=x(x-y)+y=x). Together with x≤y+εx\le y+\varepsilon, Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares §mixed gives x<xx<x, contradicting Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-irreflexive. Hence x≤yx\le y.

Slack below. Suppose y−ε≤xy-\varepsilon\le x for every real ε>0\varepsilon>0. Adding ε≤ε\varepsilon\le\varepsilon gives y=(y−ε)+ε≤x+εy=(y-\varepsilon)+\varepsilon\le x+\varepsilon (Rules of Arithmetic and Order in an Ordered Field §order-sum; as (y−ε)+ε=y(y-\varepsilon)+\varepsilon=y). So y≤xy\le x by Slack above, with the roles of xx and yy exchanged.

Vanishing. Suppose 0≤x0\le x and x≤ε=0+εx\le\varepsilon=0+\varepsilon for every real ε>0\varepsilon>0. Then x≤0x\le0 by Slack above with y=0y=0, so x=0x=0 by antisymmetry (Partial and Total Orders on a Set and the Associated Strict Relation §partial).

Strict above. Let SS be bounded above. As SS is a nonempty subset of R\mathbb{R} that is bounded above, it has a supremum by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §supremum, so sup⁡S\sup S is defined. Let b∈Rb\in\mathbb{R} with b<sup⁡Sb<\sup S. Suppose there were no s∈Ss\in S with b<sb<s. Then for every s∈Ss\in S, b<sb<s fails, so s≤bs\le b by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation. Thus bb is an upper bound of SS (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounds). Since sup⁡S\sup S is the least element of the set of upper bounds (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum), sup⁡S≤b\sup S\le b. From b<sup⁡Sb<\sup S and sup⁡S≤b\sup S\le b, Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares §mixed gives b<bb<b, contradicting Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-irreflexive.

Epsilon above. Let SS be bounded above, so that sup⁡S\sup S is defined as in Strict above, and let ε\varepsilon be real with 0<ε0<\varepsilon. Adding −ε-\varepsilon to 0<ε0<\varepsilon gives −ε<0-\varepsilon<0 (Rules of Arithmetic and Order in an Ordered Field §order-sum), so sup⁡S−ε<sup⁡S+0=sup⁡S\sup S-\varepsilon<\sup S+0=\sup S by Rules of Arithmetic and Order in an Ordered Field §order-sum. Apply Strict above with b=sup⁡S−εb=\sup S-\varepsilon.

Strict below. Let SS be bounded below. As SS is a nonempty subset of R\mathbb{R} that is bounded below, it has an infimum by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness §infimum, so inf⁡S\inf S is defined. Let b∈Rb\in\mathbb{R} with inf⁡S<b\inf S<b. Suppose there were no s∈Ss\in S with s<bs<b. Then for every s∈Ss\in S, s<bs<b fails, so b≤sb\le s by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation. Thus bb is a lower bound of SS (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounds). Since inf⁡S\inf S is the greatest element of the set of lower bounds (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum), b≤inf⁡Sb\le\inf S. From b≤inf⁡Sb\le\inf S and inf⁡S<b\inf S<b, Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares §mixed gives b<bb<b, contradicting Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-irreflexive.

Epsilon below. Let SS be bounded below, so that inf⁡S\inf S is defined as in Strict below, and let ε\varepsilon be real with 0<ε0<\varepsilon. Then inf⁡S=inf⁡S+0<inf⁡S+ε\inf S=\inf S+0<\inf S+\varepsilon by Rules of Arithmetic and Order in an Ordered Field §order-sum. Apply Strict below with b=inf⁡S+εb=\inf S+\varepsilon.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…