# Connectedness and Intervals in R ... Another Question ... Stromberg, Theorem 3.47 ... ...

#### Peter

##### Well-known member
MHB Site Helper
I am reading Karl R. Stromberg's book: "An Introduction to Classical Real Analysis". ... ...

I am focused on Chapter 3: Limits and Continuity ... ...

I need further help in order to fully understand the proof of Theorem 3.47 on page 107 ... ...

Theorem 3.47 and its proof read as follows: In the third paragraph of the above proof by Stromberg we read the following:

" ... ... But $$\displaystyle U \cap V \cap [a, b] \ \subset \ U \cap V \cap S = \emptyset$$, and so $$\displaystyle c''$$ is an upper bound for $$\displaystyle U \cap [a, b]$$ ... ... "

My question is as follows:

Can someone please demonstrate rigorously how/why ...

$$\displaystyle U \cap V \cap [a, b] \ \subset \ U \cap V \cap S = \emptyset \Longrightarrow c''$$ is an upper bound for $$\displaystyle U \cap [a, b]$$ ...

Help will be appreciated ...

Peter

Last edited:

#### GJA

##### Well-known member
MHB Math Scholar
Hi Peter ,

By the definition of $c$, $[p,c]\cap\left(U\cap [a,b]\right)\neq\emptyset$ for all $p<c.$ However, $c''<c$ and, by the choice for $c''$, $$[c'',c]\cap\left(U\cap [a,b]\right)\subset U\cap V\cap [a,b]=\emptyset.$$ Hence, $[c'',c]\cap\left(U\cap [a,b]\right)=\emptyset,$ contradicting the definition of $c$.

#### Peter

##### Well-known member
MHB Site Helper
Hi Peter ,

By the definition of $c$, $[p,c]\cap\left(U\cap [a,b]\right)\neq\emptyset$ for all $p<c.$ However, $c''<c$ and, by the choice for $c''$, $$[c'',c]\cap\left(U\cap [a,b]\right)\subset U\cap V\cap [a,b]=\emptyset.$$ Hence, $[c'',c]\cap\left(U\cap [a,b]\right)=\emptyset,$ contradicting the definition of $c$.