Bounds on the Number of Modes of a Gaussian Mixture Density

We derive explicit upper bounds for the number of nondegenerate critical points of a $k$-component Gaussian mixture density in ${\mathbb{R}}^d$, and the number of modes when the modal set is finite, together with lower bounds. By normalizing the critical-point equations by a reference component, for $k\ge 2$ we get the direct Pfaffian bound $$U_{\mathrm{h}\mathrm{e}\mathrm{t}}(d,k)=2^{d+\left(\genfrac{}{}{0px}{}{k-1}{2}\right)}{(d+2\min (d,k-1)+1)}^{k-1}\mathrm{.}$$ For the same parameter range, an exact elimination augmented by an algebraic reciprocal variable gives the alternative bound $$U_{\mathrm{a}\mathrm{u}\mathrm{g}}(d,k)=2^{\left(\genfrac{}{}{0px}{}{k-1}{2}\right)}(d+1){((2k-1)d+2k-1)}^{k-1}\mathrm{.}$$ Thus, for $k\ge 2$, the best critical-point bound is their minimum. A Morse-theoretic argument improves the corresponding finite-mode upper bound to $$\lfloor \frac{\min \{U_{\mathrm{h}\mathrm{e}\mathrm{t}}(d,k),U_{\mathrm{a}\mathrm{u}\mathrm{g}}(d,k)\}+1}{2}\rfloor \mathrm{.}$$ In the homoscedastic case, for $k\ge 2$, the direct bound improves to $$U_{\mathrm{h}\mathrm{o}\mathrm{m}}(d,k)=2^{d+\left(\genfrac{}{}{0px}{}{k-1}{2}\right)}{(d+\min (d,k-1)+1)}^{k-1},$$ an affine-rank reduction replaces $d$ by the affine rank of the component means, and an augmented homoscedastic reduction gives the dimension-free bound $$U_{\mathrm{a}\mathrm{u}\mathrm{g},\mathrm{h}\mathrm{o}\mathrm{m}}(k)=2^{\left(\genfrac{}{}{0px}{}{k-1}{2}\right)+1}(2k{)}^{k-1}\mathrm{.}$$ On the lower-bound side, for $d,k\ge 2$ we obtain $$L_{\mathrm{b}\mathrm{i}\mathrm{n}}(d,k)=k+\underset{2\le r\le \min (d,k)}{\max }\left(\genfrac{}{}{0px}{}{k}{r}\right),$$ together with a padding-product family that in particular implies the linear lower bound $d+k-1$, and a seed-closure principle that packages product and padding constructions. We further give explicit bounds for the number of connected components of the critical set.