55 819
Assignments Done
97,1%
Successfully Done
In December 2017
Your physics homework can be a real challenge, and the due date can be really close — feel free to use our assistance and get the desired result.
Be sure that math assignments completed by our experts will be error-free and done according to your instructions specified in the submitted order form.
Our experts will gladly share their knowledge and help you with programming homework. Keep up with the world’s newest programming trends.

Answer on Real Analysis Question for sneha tambe

Question #11860
let S be a non-empty bounded set in real numbers a) let a>0 , and let aS:={as; s belongs to S} prove that inf(aS)=a inf S, sup(aS)= a sup S
Expert's answer
Let s belongs to S, so
inf(S) <= s <= sup(S),
whence

a*inf(S) <= a*s <= a*sup(S),
and therefore
a*inf(S) <=
inf(aS) and sup(aS) <= a*sup(S).

We should prove the inverse
inequalities:

a*inf(S) >= inf(aS) and sup(aS) >=
a*sup(S).



1) Suppose a*inf(S) < inf(aS), so

inf(S)
< inf(aS) / a

Therefore there exists s from S such that


inf(S) <= s < inf(aS) / a,

whence

(*) a*s <
inf(aS).

But a*s belongs to aS, and so the inequality (*) is
impossible.
Hence a*inf(S) = inf(aS).



2) The proof that
sup(aS) >= a*sup(S) is similar.

Suppose sup(aS) < a*sup(S),
so

sup(aS)/a < sup(S)

Therefore there exists s from S such
that

sup(aS)/a < s <= sup(S)

whence

(**)
sup(aS) < a*s.

But a*s belongs to aS, and so the inequality (**) is
impossible.
Hence sup(aS) = a*sup(S).

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be first!

Leave a comment

Ask Your question