# Extrema of $f(x_1,\ldots,x_n) = (1+x_1)\cdots(1+x_n)$

Consider $$f: (\mathbb R_+)^n \to \mathbb R$$ defined by

$$f(x_1,\ldots,x_n) = (1+x_1)\cdots(1+x_n)$$

I am looking for local or global extrema under the condition $$x_1\cdots x_n=a^n, a >0$$ using the method of Lagrange multipliers.

First of all I applied $$\ln$$ and I ended up with the function

$$H(x_1,\ldots,x_n,\lambda)=\sum_{i=1}^{n}\ln(1+x_i)+\lambda(\sum_{i=1}^{n}\ln(x_i)-n\ln(a))$$

So we get

$$\frac{\partial H}{\partial x_i}=\frac{1}{1+x_i}+\lambda\frac{1}{x_i}$$ and $$\frac{\partial H}{\partial \lambda}=\sum_{i=1}^{n}\ln(x_i)-n\ln(a)$$

Setting the 2nd equation equal to zero, we receive $$x_i=a,\forall i$$ and plugging in $$x_i=a$$ in the first equation delivers $$\lambda=-\frac{a}{1+a}$$

Is that correct so far?

How can I argue that this is indeed a extremum? I would like to use Cauchy-Schwarz inequality if possible.

• You cannot conclude that $x_i=a$ for all $i$ unless you have some stronger conditions on the the range of the $x_i's$. For example, take $a=1$, $n=2, x_1=2, x_2=1/2$. Then $ln(x_1)+ln(x_2)-2.ln(a)=0$ but $x_1$ and $x_2$ are different from $a$ – GreginGre Aug 30 '19 at 8:19
• A related question: What is the minimum value of $(1 + a_1)(1 + a_2). . .(1 + a_n)$? – Minus One-Twelfth Aug 30 '19 at 8:23

For, example, it's enough to prove that $$\sum_{i=1}^n\left(\ln(1+x_i)-\ln(1+a)-\frac{a}{1+a}(\ln{x_i}-\ln{a})\right)\geq0,$$ for which it's enough to prove that: $$\ln(1+x_i)-\ln(1+a)-\frac{a}{1+a}(\ln{x_i}-\ln{a})\geq0$$ or $$\left(\frac{1+x_i}{1+a}\right)^{1+a}\geq\left(\frac{x_i}{a}\right)^a,$$ which is true by AM-GM: $$\left(\frac{1+x_i}{1+a}\right)^{1+a}=\left(\frac{1+a\cdot\frac{x_i}{a}}{1+a}\right)^{1+a}\geq\left(\frac{(1+a)\left(1\cdot\left(\frac{x_i}{a}\right)^a\right)^{\frac{1}{a+1}}}{1+a}\right)^{1+a}=\left(\frac{x_i}{a}\right)^a.$$
• So when checking if the possible extremum is indeed an extremum we can do this by working with the function $H$? I found that a bit confusing because the function we wanted to maximize or minimize is $f$ instead of $H$ – user700332 Oct 4 '19 at 5:36
• @user700332 If we'll find a minimum of $H$, so we'll find a minimum of $f$. They are equivalent problems. – Michael Rozenberg Oct 4 '19 at 6:47