Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

I know this question is almost trivial because the truth of this statement is completely intuitive, but I'm looking for a nice and as formal as possible proof for $$\max (a_i + b_i) \leq \max a_i + \max b_i$$ with $i=1,\ldots,n$

Thanks in advance,


share|cite|improve this question
Let $\max a_i=A$ and $\max b_i=B$. Then $\dots$. – André Nicolas Sep 1 '11 at 18:35
"Take some of the subexpressions of the formula, and abbreviate them as single letters". Not much of a hint, I'd say. – Henning Makholm Sep 1 '11 at 18:44
$\dots a_i\le A$ and $b_i\le B$, and therefore $a_i+b_i \le A+B$. – André Nicolas Sep 1 '11 at 18:50
up vote 5 down vote accepted

Choose $j$ so that $a_j=\max a_i$ and $k$ so that $b_k=\max b_i$ (where it is possible that $j=k$). Then for each $i$, $a_i+b_i \le a_j+b_k$, so $\max a_i+b_i \le a_j+b_k=\max a_i + \max b_i$

share|cite|improve this answer

For any choice of $j$ in $1,2,\ldots,n$, we have that $$a_j\leq\max\{a_i\}\quad\text{and}\quad b_j\leq\max\{b_i\}$$ by the very definition of "$\max$". Then, by additivity of inequalities, we have that for each $j$, $$a_j+b_j\leq\max\{a_i\}+\max\{b_i\}.$$ But because this is true for all $j$, it is true in particular for the largest out of the $a_j+b_j$'s; that is, $$\max\{a_i + b_i\} \leq \max\{a_i\} + \max\{b_i\}$$

share|cite|improve this answer

$$ \max_{1\le i \le n} (a_i + b_i) \le \max_{1\le i \le n}( \max_{1\le k \le n}(a_k) + b_i) = \max_{1\le k \le n}(a_k) + \max_{1\le i \le n}(b_i) $$

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.