TheoremBase

Four elementary facts about comparisons with ±∞ give the order properties; suprema are found by cases according to whether ∞ lies in the set and whether its real part is empty, bounded or unbounded, and infima as suprema of the sets of lower bounds.

Proof

Write E=[−∞,∞]E=[-\infty,\infty]. By The Extended Real Line, Its Order, and [0,∞] (i), −∞∉R-\infty\notin\mathbb{R}, ∞∉R\infty\notin\mathbb{R} and −∞≠∞-\infty\neq\infty; by The Extended Real Line, Its Order, and [0,∞] (ii), every element of EE is real or equal to −∞-\infty or to ∞\infty.

Step 1: four facts. For all x,y∈Ex,y\in E: (a) −∞≤y-\infty\le y and x≤∞x\le\infty; (b) x≤−∞x\le-\infty if and only if x=−∞x=-\infty; (c) ∞≤y\infty\le y if and only if y=∞y=\infty; (d) if x,y∈Rx,y\in\mathbb{R}, then x≤yx\le y if and only if x≤yx\le y in R\mathbb{R}. Fact (a) is The Extended Real Line, Its Order, and [0,∞] (iii). For (b), if x≤−∞x\le-\infty, then by The Extended Real Line, Its Order, and [0,∞] (iii) x,−∞∈Rx,-\infty\in\mathbb{R} (impossible, as −∞∉R-\infty\notin\mathbb{R}), or x=−∞x=-\infty, or −∞=∞-\infty=\infty (impossible); so x=−∞x=-\infty, and the converse is (a). Fact (c) is proved in the same way, using ∞∉R\infty\notin\mathbb{R} and ∞≠−∞\infty\neq-\infty. Fact (d) is stated in The Extended Real Line, Its Order, and [0,∞] (iii).

Proof of (i). By The Extended Real Line, Its Order, and [0,∞] (iii), ≤\le is a subset of E×EE\times E, a relation on EE. Reflexive: for x∈Rx\in\mathbb{R} by (d) and reflexivity of the order of R\mathbb{R}; for x∈{−∞,∞}x\in\{-\infty,\infty\} by (a). Antisymmetric: let x≤yx\le y and y≤xy\le x. If x=−∞x=-\infty, then y≤−∞y\le-\infty gives y=−∞y=-\infty by (b); if x=∞x=\infty, then ∞≤y\infty\le y gives y=∞y=\infty by (c). If x∈Rx\in\mathbb{R}, then y≠−∞y\neq-\infty, since otherwise x≤−∞x\le-\infty and x=−∞x=-\infty by (b); and y≠∞y\neq\infty, since otherwise ∞≤x\infty\le x and x=∞x=\infty by (c); so y∈Ry\in\mathbb{R}, and x=yx=y by (d) and antisymmetry in R\mathbb{R}. Transitive: let x≤yx\le y and y≤zy\le z. If x=−∞x=-\infty or z=∞z=\infty, then x≤zx\le z by (a). Otherwise z≠−∞z\neq-\infty, since z=−∞z=-\infty would give y=−∞y=-\infty and then x=−∞x=-\infty by (b); so z∈Rz\in\mathbb{R}. Likewise x≠∞x\neq\infty, since x=∞x=\infty would give y=∞y=\infty and then z=∞z=\infty by (c); so x∈Rx\in\mathbb{R}. And y≠−∞y\neq-\infty (else x=−∞x=-\infty by (b)) and y≠∞y\neq\infty (else z=∞z=\infty by (c)), so y∈Ry\in\mathbb{R}. Then x≤zx\le z by (d) and transitivity in R\mathbb{R}. Total: for x,y∈Rx,y\in\mathbb{R}, x≤yx\le y or y≤xy\le x by (d), the order of R\mathbb{R} being total by The Real Numbers (i); if one of x,yx,y is −∞-\infty or ∞\infty, they are comparable by (a). Hence ≤\le is a partial order on EE that is total. The statement on x≤yx\le y for real x,yx,y is (d); for << it follows, as x<yx<y means x≤yx\le y and x≠yx\neq y both in EE (The Extended Real Line, Its Order, and [0,∞] (iii)) and in R\mathbb{R} (Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (ii)).

Proof of (ii). By (a), −∞∈E-\infty\in E lies below and ∞∈E\infty\in E above every element, so they are the least and the greatest element of EE by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iii); the last assertion is (b) and (c).

Proof of the suprema in (iii), and of (iv) and (v). Let A⊆EA\subseteq E and B=A∩RB=A\cap\mathbb{R}, and let Ub⁡(A)\operatorname{Ub}(A) and Lb⁡(A)\operatorname{Lb}(A) be as in Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (i), formed in EE. Exactly one of the following four cases occurs.

Case (i): ∞∈A\infty\in A. Then ∞∈Ub⁡(A)\infty\in\operatorname{Ub}(A) by (a), and every b∈Ub⁡(A)b\in\operatorname{Ub}(A) satisfies ∞≤b\infty\le b, so b=∞b=\infty by (c). Thus Ub⁡(A)={∞}\operatorname{Ub}(A)=\{\infty\}, whose least element is ∞\infty, and sup⁡A=∞\sup A=\infty by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv).

Case (ii): ∞∉A\infty\notin A and B=∅B=\emptyset. Then every element of AA equals −∞-\infty, so every b∈Eb\in E is an upper bound of AA by (a): Ub⁡(A)=E\operatorname{Ub}(A)=E, whose least element is −∞-\infty by (ii). So sup⁡A=−∞\sup A=-\infty; in particular sup⁡∅=−∞\sup\emptyset=-\infty.

Case (iii): ∞∉A\infty\notin A, and BB is nonempty and bounded above in R\mathbb{R}. Then s=sup⁡RBs=\sup_{\mathbb{R}}B exists by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (vii). It is an upper bound of AA in EE: each x∈Ax\in A is −∞≤s-\infty\le s by (a), or lies in BB, so x≤sx\le s in R\mathbb{R} and hence in EE by (d). Let b∈Ub⁡(A)b\in\operatorname{Ub}(A), and pick x∈Bx\in B; then x≤bx\le b, so b≠−∞b\neq-\infty by (b), as x∈Rx\in\mathbb{R}. If b=∞b=\infty, then s≤bs\le b by (a). If b∈Rb\in\mathbb{R}, then by (d) bb is an upper bound of BB in R\mathbb{R}, so s≤bs\le b in R\mathbb{R}, hence in EE. Thus ss is the least element of Ub⁡(A)\operatorname{Ub}(A), and sup⁡A=s\sup A=s.

Case (iv): ∞∉A\infty\notin A, and BB is not bounded above in R\mathbb{R}. Then B≠∅B\neq\emptyset, as every real number is an upper bound of ∅\emptyset; pick x∈Bx\in B. By (a), ∞∈Ub⁡(A)\infty\in\operatorname{Ub}(A). No b∈Rb\in\mathbb{R} lies in Ub⁡(A)\operatorname{Ub}(A), since by (d) it would be an upper bound of BB in R\mathbb{R}; and −∞∉Ub⁡(A)-\infty\notin\operatorname{Ub}(A), since x≤−∞x\le-\infty would give x=−∞x=-\infty by (b). So Ub⁡(A)={∞}\operatorname{Ub}(A)=\{\infty\} and sup⁡A=∞\sup A=\infty.

Hence sup⁡A\sup A exists in every case. Case (iii) gives (iv), and Cases (i) and (iv) give (v); for A⊆RA\subseteq\mathbb{R} nonempty and bounded above in R\mathbb{R}, we have ∞∉A\infty\notin A and B=AB=A, so Case (iii) applies.

Proof of the infima in (iii). Let A⊆EA\subseteq E, and let m=sup⁡Lb⁡(A)m=\sup\operatorname{Lb}(A), which exists by the above, as Lb⁡(A)⊆E\operatorname{Lb}(A)\subseteq E by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (i). Every a∈Aa\in A is an upper bound of Lb⁡(A)\operatorname{Lb}(A), so m≤am\le a, as mm is the least upper bound; thus m∈Lb⁡(A)m\in\operatorname{Lb}(A). Every b∈Lb⁡(A)b\in\operatorname{Lb}(A) satisfies b≤mb\le m, as mm is an upper bound of Lb⁡(A)\operatorname{Lb}(A). So mm is the greatest element of Lb⁡(A)\operatorname{Lb}(A), and inf⁡A=m\inf A=m by Bounds, Least and Greatest Elements, Suprema and Infima for a Partial Order (iv). For A=∅A=\emptyset, every element of EE is a lower bound, so Lb⁡(∅)=E\operatorname{Lb}(\emptyset)=E, whose greatest element is ∞\infty by (ii); hence inf⁡∅=∞\inf\emptyset=\infty. The notation sup⁡nun\sup_{n}u_{n} is a definition and needs no proof.

Proof of (vi) and (vii). Let A⊆EA\subseteq E and B=A∩RB=A\cap\mathbb{R}. If −∞∈A-\infty\in A, then −∞∈Lb⁡(A)-\infty\in\operatorname{Lb}(A) by (a), and every b∈Lb⁡(A)b\in\operatorname{Lb}(A) satisfies b≤−∞b\le-\infty, so b=−∞b=-\infty by (b); so Lb⁡(A)={−∞}\operatorname{Lb}(A)=\{-\infty\} and inf⁡A=−∞\inf A=-\infty. Let now −∞∉A-\infty\notin A. If BB is nonempty and bounded below in R\mathbb{R}, then t=inf⁡RBt=\inf_{\mathbb{R}}B exists by The Real Numbers, with the Natural Numbers, Integers and Rationals Identified with Subsets of the Reals, and Completeness (viii). Each x∈Ax\in A is ∞≥t\infty\ge t by (a), or lies in BB, so t≤xt\le x in R\mathbb{R} and in EE by (d); thus t∈Lb⁡(A)t\in\operatorname{Lb}(A). Let b∈Lb⁡(A)b\in\operatorname{Lb}(A) and pick x∈Bx\in B; then b≤xb\le x, so b≠∞b\neq\infty by (c). If b=−∞b=-\infty, then b≤tb\le t by (a); if b∈Rb\in\mathbb{R}, it is a lower bound of BB in R\mathbb{R} by (d), so b≤tb\le t. Hence inf⁡A=t\inf A=t. If BB is not bounded below in R\mathbb{R}, then B≠∅B\neq\emptyset; pick x∈Bx\in B. Then −∞∈Lb⁡(A)-\infty\in\operatorname{Lb}(A) by (a), no b∈Rb\in\mathbb{R} lies in Lb⁡(A)\operatorname{Lb}(A) by (d), and ∞∉Lb⁡(A)\infty\notin\operatorname{Lb}(A), as ∞≤x\infty\le x would give x=∞x=\infty by (c). So Lb⁡(A)={−∞}\operatorname{Lb}(A)=\{-\infty\} and inf⁡A=−∞\inf A=-\infty.

Proof of (viii). If x∈[0,∞]x\in[0,\infty], then either x∈Rx\in\mathbb{R} with 0≤x0\le x in R\mathbb{R}, so 0≤x0\le x by (d), or x=∞x=\infty and 0≤x0\le x by (a). Conversely let x∈Ex\in E with 0≤x0\le x. Then x≠−∞x\neq-\infty, since 0≤−∞0\le-\infty would give 0=−∞0=-\infty by (b), while 0∈R0\in\mathbb{R}. If x=∞x=\infty, then x∈[0,∞]x\in[0,\infty]; if x∈Rx\in\mathbb{R}, then 0≤x0\le x in R\mathbb{R} by (d), and x∈[0,∞]x\in[0,\infty] by The Extended Real Line, Its Order, and [0,∞] (ii).

Proof of (ix). Let A⊆[0,∞]A\subseteq[0,\infty]. Then 00 is a lower bound of AA, so 0≤inf⁡A0\le\inf A, and inf⁡A∈[0,∞]\inf A\in[0,\infty]. If A≠∅A\neq\emptyset, pick a∈Aa\in A; then 0≤a≤sup⁡A0\le a\le\sup A, so 0≤sup⁡A0\le\sup A by (i), and sup⁡A∈[0,∞]\sup A\in[0,\infty].

Proof of (x). Let t<sup⁡At<\sup A, and suppose that no a∈Aa\in A satisfies t<at<a. Then a≤ta\le t for every a∈Aa\in A, by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (vii) and (i); so t∈Ub⁡(A)t\in\operatorname{Ub}(A) and sup⁡A≤t\sup A\le t. Together with t≤sup⁡At\le\sup A this gives t=sup⁡At=\sup A by antisymmetry, contradicting t≠sup⁡At\neq\sup A. Likewise, let inf⁡A<t\inf A<t and suppose that no a∈Aa\in A satisfies a<ta<t. Then t≤at\le a for every a∈Aa\in A by Uniqueness of Least and Greatest Elements, Properties of the Strict Order, and Trichotomy for Total Orders (vii), so t∈Lb⁡(A)t\in\operatorname{Lb}(A) and t≤inf⁡At\le\inf A; with inf⁡A≤t\inf A\le t this gives t=inf⁡At=\inf A, a contradiction.

Citations

Loading…

Dependencies

Uses0

Loading…

Comments

Log in to comment.

Loading…