Proof of supremum and infemum of bounded functions

126 Views Asked by At

Is the following true:

$\sup(f+g)\ge \sup(f)+\inf (g)$?

If so prove it.

I think its true, but I don't know how to prove it

1

There are 1 best solutions below

0
On BEST ANSWER

Take an arbitrary $x$ in the domain of the functions, so that: $$f(x) + \inf g \leq f(x) + g(x) = (f+g)(x)\leq \sup (f+g), \quad \forall x.$$This directly yields $\sup f + \inf g \leq \sup(f+g)$. You can think that: $$f(x) \leq \sup(f+g) - \inf g, \quad \forall x,$$so you can take $\sup$ in the left side and then rearrange.