Prove $\sup(f+g) \le \sup f + \sup g$ Suppose $D$ is a nonempty bounded subset of reals. Let $f:D \to \mathbb R$ and $g:D \to \mathbb R$. Define $(f+g)(x)=f(x)+g(x)$. Prove $\sup(f+g)(D) \le \sup f(D) + \sup g(D)$ (also prove that $\sup (f+g)$ exists).


I understand why this is the case, just not how to prove it. Left side is pretty much $\sup  (f(x)+g(x))$ and right side is $\sup (f(x) + g(y))$ for $x,\,y \in D$. Basically $f+g$ has to use the same variable and $f(D)+g(D)$ use different ones. But I don't know how to go about proving this.


  The second part of the question is to find a specific example where strict inequality holds. 


Let $D=\{a,b\}$ and $f: a \to 1,\, b\to 0, \,g: a \to 0,\, b\to 1$. $\sup f(D) = 1,\, \sup g(D) = 1,\, \sup f(D) + \sup g(D) = 2.$ $\sup (f+g)(D) = 1$ (if we choose a, $f+g = 1+0,\, b,\, f+g=0+1$).
Consider $x\in D$. Then $f(x)\le \sup f$ and $g(x)\le \sup g$, hence $(f+g)(x)=f(x)+g(x)\le \sup f+\sup g$.
Therefore, $\sup f + \sup g$ is some upper bound, but the least upper bound may be smaller.

Your example for strictness is fine.
To show that $\sup(f+g)\leq \sup(f) +\sup(g)$, suppose that $\sup(f)=A$ and $\sup(g)=B$, where $A$ and $B$ are the highest point of function $f$ and $g$ respectively.

If we add $f$ and $g$, then only two posibility happen:

1: If $A$ and $B$ are in same x, then $f(x)=A$ and $g(x)=B$. Then, we have that $(f+g)(t)=A+B$. Hence, $$\sup(f+g)=\sup(f)+\sup(g).$$

2: If $A$ and $B$ are not in same $x$, then $f(p)=A$ and $\ g(q)=B$. Hence, $$\sup(f+g)\leq A+B$$

From 1 and 2, we have that $$\sup(f+g)\leq\sup(f)+\sup(g).$$