I was wondering if someone could explain what is the difference between the max of a finite number of functions and the max of a finite number of function values.
For instance, as shown here, given real-valued continuous functions $f,g$, the following inequality holds.
$\max(f+g)(z)\leq \max f(z)+\max g(z), \forall z \in Z$.
However, if I define the functions $ g= \max_{i \in I}\{g_i\}$, $ h= \max_{j \in J}\{h_j\}$, and let $f= g+h$, then $f$ can be represented as
$ f = \max_{i \in I,j \in J}\{g_i+h_j\}$
rather than writing as
$f = \max_{i \in I}\{g_i\} + \max_{j \in J}\{h_j\} \leq \max_{i \in I,j \in J}\{g_i+h_j\}$.
My question is why equality holds when we work with indices. What exactly am I misinterpreting?
Best Answer
Note that (1) is not an inequality of functions but an inequality of real numbers. We have \begin{align*} \max\{f+g\}&=\max_{x\in[a,b]}\{(f+g)(x)\}=\max_{x\in[a,b]}\{f(x)+g(x)\}\in\mathbb{R}\\ \max\{f\}&=\max_{x\in[a,b]}\{f(x)\}\in\mathbb{R}\\ \max\{g\}&=\max_{x\in[a,b]}\{g(x)\}\in\mathbb{R}\\ \end{align*} Each of the three maxima above specifies a maximum of the values of a single function with domain $[a,b]$, namely $f+g,f$ and $g$.
We have a different situation when we consider a (finite) family $\left(g_i\right)_{i\in I}$ of functions $g_i$ with $I$ finite. In this case the symbol \begin{align*} \max_{i\in I}\{g_i\}\tag{2} \end{align*} denotes often not a maximum of real values, but rather a maximum of functions $g_i, i\in I$ instead. We also need an order relation on the function-space $\mathcal{C}_{\mathbb{R}}\left([a,b]\right)$ of real-valued continuous functions on $[a,b]$ in order to be able to talk about maxima.