The slack clauses are proved by contradiction: half of a positive gap gives too small a slack. The supremum and infimum clauses use the fact that, under a total order, an element below the supremum is not an upper bound.
The order of is a total order (Ordered Fields §ordered-field). We use Rules of Arithmetic and Order in an Ordered Field and Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares for .
Slack above. Suppose for every positive , and suppose that fails. Then by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation. Adding gives (Rules of Arithmetic and Order in an Ordered Field §order-sum). Let ; by Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares §halving, . Adding gives (Rules of Arithmetic and Order in an Ordered Field §order-sum; as ). Together with , Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares §mixed gives , contradicting Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-irreflexive. Hence .
Slack below. Suppose for every positive . Adding gives (Rules of Arithmetic and Order in an Ordered Field §order-sum; as ). So by Slack above, with the roles of and exchanged.
Vanishing. Suppose and for every positive . Then by Slack above with , so by antisymmetry (Partial and Total Orders on a Set and the Associated Strict Relation §partial).
Strict above. Let have a supremum and let . Suppose there were no with . Then for every , fails, so by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation. Thus is an upper bound of (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounds). Since is the least element of the set of upper bounds (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum), . From and , Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares §mixed gives , contradicting Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §strict-irreflexive.
Epsilon above. Let . Adding to gives (Rules of Arithmetic and Order in an Ordered Field §order-sum), so by Rules of Arithmetic and Order in an Ordered Field §order-sum. Apply Strict above with .
Strict below. Let have an infimum and let . Suppose there were no with . Then for every , fails, so by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders §total-negation. Thus is a lower bound of (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §bounds). Since is the greatest element of the set of lower bounds (Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order §supremum), . Then Inequalities in an Ordered Field: Mixed Transitivity, Strict Sums, Signs, Products, Natural Numbers, Halving, Reciprocals, Absolute Values and Squares §mixed gives , a contradiction.
Epsilon below. Let . Then by Rules of Arithmetic and Order in an Ordered Field §order-sum. Apply Strict below with .
Loading…