Answer:
.
.
Explanation:
When factored, 
 is equivalent to 
.
 whenever 
.
Typically, the supremum and infimum of open intervals are the two endpoints. In this question, 
 whereas 
. 
Below is a proof of the claim that 
. The proof for 
 is similar.
In simple words, the supremum of a set is the smallest upper bound of that set. (An upper bound of a set is greater than any element of the set.)
It is easy to see that 
 is an upper bound of 
: 
- For any 
, 
. Hence, any number that's greater than 
 could not be a member 
.  - Conversely, 
 would be greater than all elements of 
 and would thus be an upper bound of this set. 
To see that 
 is the smallest upper bound of 
, assume by contradiction that there exists some 
 for which 
 (which is smaller than 
) is also an upper bound of 
. 
The next step is to show that 
 could not be a lower bound of 
.
There are two situations to consider:
- The value of 
 might be very large, such that 
 is smaller than all elements of 
. - Otherwise, the value of 
 ensures that 
. 
Either way, it would be necessary to find (or construct) an element 
 of 
 such that 
.
For the first situation, it would be necessary that 
, such that 
. Let 
 (or any other number between 
 and 
.)
- Apparently 
.  
- At the same time, 
.  
- Hence, 
 would not be an upper bound of 
 when 
. 
With the first situation 
 accounted for, the second situation may assume that 
. 
Claim that 
 (which is strictly greater than 
) is also an element of 
. 
- To verify that 
, set 
 and evaluate the expression: 
. - This expression is smaller than 
 whenever 
.  - The assumption for this situation 
 ensures that 
 is indeed satisfied.  - Hence, 
, such that 
. - At the same time, 
. Hence, 
 would not be an upper bound of 
. 
Either way, 
 would not be an upper bound of 
. Contradiction.
Hence, 
 is indeed the smallest upper bound of 
. By definition, 
.
The proof for 
 is similar and is omitted because of the character limit.