Boundedness: Prove that M'-m' =< M-m

[Runty_Grunty]

Homework Statement

Suppose that f(x) is a bounded function on [a,b]. If M, M&#039; denote the least upper bounds and m, m&#039; denote the greatest lower bounds of f, |f| respectively, prove that M&#039;-m&#039;\leq M-m.

2. The attempt at a solution
(these are the only things I have; most are properties found online)
For this, we assume that f is integrable.
If f is a bounded and integrable function on [a,b], and if M and m are the least upper and greatest lower bounds of f over [a,b], then
m(b-a)\leq \int_a^b f(x)dx\leq M(b-a) if a\leq b, and
m(b-a)\geq \int_a^b f(x)dx\geq M(b-a) if b\leq a.
Also, since f is both a bounded and integrable function on [a,b], then |f| is also bounded and integrable over [a,b].

I haven't been able to determine how to obtain the least upper and greatest lower bounds of |f|, due to how complicated the very idea is.

 

[Outlined]

Is the function continuous?

Note that the case that f is negative (\le 0) is trivial, the same when f is positive (\ge 0). This leaves the case that there are positive and negative function values. This might give you a lot of help.

 

[Runty_Grunty]

Is the function continuous?

Note that the case that f is negative (\le 0) is trivial, the same when f is positive (\ge 0). This leaves the case that there are positive and negative function values. This might give you a lot of help.

I listed the question word-for-word in the opening post, so it doesn't say anything about continuity. I guess I could assume it is continuous, but I don't know how relevant that would be.

I'm also not sure how that bit on "positive and negative function values" is supposed to be implemented (or I'm not interpreting it correctly). Could you please give a little more detail as to what you mean?

Our class is covering higher-level integration right now, and I always get tripped up on complicated proofs and the like. Then again, I was given very bad course advice...

 

[Outlined]

f : X \longrightarrow \textbf{R}it is about the mixed case where there are x, y \in X such that f(x) &lt; 0 and f(y) &gt; 0. Therefore M &gt; 0 and m &lt; 0. We have 0 \le M&#039; \le \max(M, |m|). Combined with m &lt; 0 and m&#039; \ge 0 this gives

M&#039;- m&#039; \le \max(M, |m|) \le M - m