TheoremBase

Arbitrary Positive Slack, and Approximation of Suprema and Infima, in the Real Numbers

In the real numbers, an inequality that holds up to every positive slack holds exactly, a nonnegative number below every positive number is zero, and the supremum or infimum of a nonempty set bounded above or below is approached by elements of the set, strictly and within every positive tolerance.

Statement

In the setting of The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness, let x,y∈Rx,y\in\mathbb{R}.

If x≤y+εx\le y+\varepsilon for every real ε>0\varepsilon>0, then x≤yx\le y.

If y−ε≤xy-\varepsilon\le x for every real ε>0\varepsilon>0, then y≤xy\le x.

If 0≤x0\le x and x≤εx\le\varepsilon for every real ε>0\varepsilon>0, then x=0x=0.

Let now SS be a nonempty subset of R\mathbb{R}, with bounds, suprema and infima as in Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order.

If SS is bounded above, then for every b∈Rb\in\mathbb{R} with b<sup⁡Sb<\sup S there is s∈Ss\in S with b<sb<s.

If SS is bounded above, then for every real ε>0\varepsilon>0 there is s∈Ss\in S with sup⁡S−ε<s\sup S-\varepsilon<s.

If SS is bounded below, then for every b∈Rb\in\mathbb{R} with inf⁡S<b\inf S<b there is s∈Ss\in S with s<bs<b.

If SS is bounded below, then for every real ε>0\varepsilon>0 there is s∈Ss\in S with s<inf⁡S+εs<\inf S+\varepsilon.

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…