Take as a reference the clasical statement for the Lagrange multiplier theorem (which I took exactly from the book "Nonlinear programing" by Dimitry Bertsekas):
Proposition 3.1.1 (Lagrange Multiplier Theorem - Necesary Conditions) Let $x^*$ be a local minimum of $f$ subject to $h(x)=(h_1(x),\dots,h_m(x))=0$ and assume that the gradients $\nabla h_1(x^*),\dots,\nabla h_m(x^*)$ are linearly independent. Then, there exists a unique vector $\lambda^*=(\lambda_1^*,\dots,\lambda_m^*)$ called Lagrange multiplier vector such that $$ \nabla f(x^*) + \sum_{i=1}^m\lambda_i^*\nabla h_i(x^*) =0 \quad \quad \quad \quad \quad \quad (3.3) $$
Of course, this is a classical and well known statement, but I'm interested in trying to understand the small details, particularly the "linearly independent" part.
My question is: Assume that $\nabla h_m(x^*)$ IS a linear combination of $\nabla h_1(x^*),\dots,\nabla h_{m-1}(x^*)$. Then, can I remove the constraint $h_m(x)=0$ and obtain the same $x^*$ for the new problem? This is, is it that new local minima points $x^*$ (without the last constraint) will be a local minima of the original problem, satisfying all constraints?
My intuition is that if $\nabla h_m(x^*) = \alpha \nabla h_{m-1}(x^*)$ for example, then, $$ \sum_{i=1}^m\lambda_i^*\nabla h_i(x^*) = \sum_{i=1}^{m-2}\lambda_i^*\nabla h_i(x^*) + (\lambda_{m-1}^*+\alpha\lambda_{m}^*)\nabla h_{m-1}(x^*) $$ Hence, we can consider only $m-1$ conditions, and the last Lagrange multiplier will be $\bar{\lambda}_{m-1}^*:=(\lambda_{m-1}^*+\alpha\lambda_{m}^*)$ instead. However, I'm not sure how this traduces in the fact that $x^*$ will comply with $h_m(x^*)$ even when we removed it from the problem.