Motivated by this question asked earlier, I was wondering whether one can prove easily that the local maxima of the sum of Gaussians:
$$f_n(x):= \sum_{i=1}^{n}e^{-(x-x_i)^2}, \quad x_1 < x_2 < \dots < x_n$$
are always strict local maxima, i.e. there's a punctured neighborhood $U^*$ around each local maximum $x^*$, so that the $\forall x \in U^*, f(x)< f(x^*),$ (instead of $f(x)\le f(x^*).$)
I don't know of any analytical expression for the local maxima of the sum of Gaussians.
Of course when $n=1$, one can show that the unique local and global maximum is $x_1$. For $n=3$, I took $x_1= 1, x_2=5, x_3=8,$ and I got the following graph:
which clearly shows that the local maxima happen near the $x_i$'s (but not necessarily at the $x_i$'s). It also seems from the graph that my intuition is correct: all local maxima of the sum of Gaussians are indeed strict local maxima. But I was wondering whether there's a rigorous proof?
I guess one way to proceed might be by first observing that when $x< x_1$ or $x> x_n, f_n(x) > 0, f'(x) < 0$ respectively. So this means that we just need to show that when $x \in [x_1, x_n], f(x)$ is at most a $2n$-to-$1$ function, i.e. the preimage of any point can have at most $2n$ elements (this is intuitively thought out by the fact that for $n=1, f_1(x)$ is even, and for $n=3, f_3(x)$ is at most a $6$-to-$1$ function, and same behavior is observed for other values of $n$. Once proved, this will show that all local maxima of $f$ are indeed strict, as otherwise, it'd contradict that the preimage $f_n^{-1}(y), y \in \mathbb{R}$ of any $y$ can have at most $2n$ elements. But I'm not sure how to show this...Next step will be to generalize it to multiple dimensions.