Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

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 am curious what is the precise math reasoning behind this:

$$ \sup \{ a_i^T u | \lVert u\rVert_2 \leq r \} = r \lVert a_i \rVert_2$$

It is on page 148, last line, of Boyd's Convex Optimization text.

I realize the statement is saying: the supremum of a dot b is equal to the length of a times the maximum length of b, but I was wondering if there was any other way to explain the reasoning.

Thank you all.

share|cite|improve this question
up vote 2 down vote accepted

You ought to specify what space $a_i$ and $u$ are coming from, and what $\|\cdot\|_2$ is, but I'll assume the space is $\mathbb{C}^n$ or $\mathbb{R}^n$ and $\|\cdot\|_2$ is the Euclidean norm.

$$\sup \{a_i^Tu\ |\ \|u\|_2\leq r\} \geq a_i^T[(r/\|a_i\|_2)a_i] = r\|a_i\|_2$$

The key there was to realize the _dot product is maximized when $u$ is in the same direction as $a_i$_, so we take $u$ in the same direction as $a_i$ with length $r$. On the other hand:

$$\sup \{a_i^Tu\ |\ \|u\|_2\leq r\} \leq \{|a_i^Tu|\ |\ \|u\|_2\leq r\} \leq \{\|a_i\|_2\|u\|_2\ |\ \|u\|_2\leq r\} = r\|a_i\|_2$$

Where the second inequality follows from Cauchy-Schwarz.

share|cite|improve this answer
Thank you. I believe the first argument was in one of the problems of the text in chapter 2, and the 2nd argument is somewhat new to me. – jrand Apr 23 '11 at 19:06

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.