How can I prove that

$|x_1 x_2 - y_1 y_2| \leq L\big(|x_1 - y_1| + |x_2 - y_2|\big)$


$x_1,y_1 \in [0,K]$

$x_2,y_2 \in [0,M]$

$K$ and $M$ are some constant

$L$ is constant from Lipschitz condition

  • $\begingroup$ Hint: $ab-cd=ab-cb+cb-cd=(ab-cb)+(cb-cd)$. $\endgroup$ – Ian Jun 12 '17 at 14:15

Instead of using the mean value theorem, we can instead just use the triangle inequality $$\begin{align} |x_1 x_2 - y_1y_2| &\leq |x_1x_2-x_1y_2+x_1y_2-y_1y_2|\\ &\leq |x_1(x_2-y_2)+y_2(x_1-y_1)| \\ &\leq|x_1(x_2-y_2)|+|y_2(x_1-y_1)| \\ &=|x_1||x_2-y_2|+|y_2||x_1-y_1| \\ &\leq M |x_1 - y_1| + K |x_2 - y_2| \\ &\leq L \big(|x_1 - y_1| + |x_2 - y_2|\big) \end{align}$$

where $L = \max(K, M)$.


Let $f(x) = x_1x_2$, note that $Df(x)h = x_2 h_1 + x_1 h_2$ and so $\|Df(x)\| \le \|x\|$.

Let $L = \max_{x \in [0,K]\times [0,M]} \|x\|$, then the mean value theorem gives $|f(x)-f(y)| \le L \|x-y\|$.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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