More Suprema and Density Practice

1.3.4, 1.3.5, 1.3.7, 1.3.9, 1.3.10, 1.4.6, 1.4.7

1.3.4 (check)

Question

Let A1,A2,A3,... be a collection of nonempty sets, each of which is bounded above.
a. Find a formula for sup(A1A2) and extend to k=1nAk
b. Consider sup(k=1Ak). Does the formula in (a) extend to the infinite case?

Proof
a.

sup(A1A2)=max(supA1,supA2)

Proof
Let β=max(supA1,supA2). Clearly the claim holds if A1=A2 so say A1A2. Then either A1A2 or A1A2, which are argued in similar ways.

Using the former then A1A2=A2 so then we just have to show supA2supA1. Notice if they equal then we are done since sup(A1A2)=supA2=supA1=max(). Now consider the case they don't equal. Then supA2supA1>0 so then choose ε>0 to be that positive number. Since supA2 then there is a aA2 where supA2ε=supA2(supA2supA1)=supA1<a. But since supA2 then aA2(asupA2), thus giving that supA1<asupA2supA1<supA2 as we wanted.

Using an inductive proof shows the following with ease:

sup(k=1nAk))=maxk=1nsupAk

b. It doesn't. Consider the collection A={AiR|Ai=[i,i+1]iN}. If you say that α=sup(k=1Ai) exists then then Ai such that αAi. But then that means that αsupAj for any jN. But then that means that αj for all j by the way we constructed Aj. This is a contradiction since that breaks the Cantor's Approach#^5404f9.

1.3.5

Question

Let AR be nonempty and bounded above, let cR. This time define the set cA={ca|aA}.
a. If c0 then show that sup(cA)=csup(A)
b. Postulate a similar type of statement for sup(cA) for the case that c<0.

Proof
a. Clearly sup(cA) exists since A is nonempty and bounded above. Start from cα=csup(A) and we'll show that it is sup(cA). For the c=0 case notice that then cA={0} so clearly sup(cA)=0=0sup(A). Thus, take c0:

  1. (cα is an upper bound for cA): Let acA be arbitrary. Then aA where a=ca. Then ac=a. Since α=sup(A) then aα so consequently acα as desired.
  2. (cα is the least upper bound for cA): Let α be another upper bound for cA. Assume that α<cα. Then αc<α so then since α=supA then αcA. Thus then aA where αc=aα=ca which contradicts α being an upper bound for cA.

b.

For c<0, then sup(cA)=inf(A).

1.3.7

Question

Prove that if a is an upper bound for A, and if a is also an element of A, then it must be that a=sup(A).

Proof
Clearly the upper bound for A property is satisfied so we just have to show that a is the least upper bound for A. Let a be another upper bound for A. Assume for contradiction that a<a. Then since aA that contradicts a being an upper bound for A, so then clearly aa as required.

1.3.9 (check)

Question

a. If supA<supB, then bB that is an upper bound for A.
b. Give an example to show that this is not always the case if we only assume supAsupB.

Proof
a.
Since supA<supBsupBsupA=ε>0 so then by the Suprema Lemma for sup(B) then bB such that supB(supBsupA)=supA<b. Thus b is clearly an upper bound for A.

b. If A={qI|q2<2} and B={qQ|q2<2} then clearly supA=supB=2 but if there was some bB that's an upper bound for A then we know that b is irrational and 2 is irrational, so since The Density of Q in R#^ca78a0, then qI where b<q<2, so clearly qA so clearly b is not an upper bound for A.

1.3.10 (FINISH, don't forget the other parts)

(Cut Property)

If A,B are nonempty, disjoint sets with AB=R and a<b for all aA,bB then cR such that xc whenever xA and xc whenever xB.

Proof

1.4.7 (TODO)