Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $f: {\mathbb R}^{n+k} \rightarrow {\mathbb R}^n$ be a $C^1$ map. Suppose that $f(a)=0$ and $Df(a)$ has rank n. Show that if $c$ is a point in ${\mathbb R}^n$ sufficiently close to $0$, then the equation $f(x)=c$ has a solution.

I can only see that since $Df(a)$ has rank n, hence by implicit function thm, some n of the variables are actually functions of the remaining k variables, but I can't see how to use it.

Thanks in advance.

share|cite|improve this question

The Implicit Function Theorem allows you to write a fixed level set as a graph. I recommend trying to apply the Inverse Function Theorem. Write $\mathbb R^{n+k}=\mathbb R^n\times\mathbb R^k$ and write points as $(x,y)$. Assume the $n\times n$ matrix $\left[\dfrac{\partial f}{\partial x}(a)\right]$ is nonsingular, and consider $g\colon \mathbb R^{n+k}\to\mathbb R^{n+k}$ defined by $g(x,y)=\big(f(x,y),y\big)$. Note that $Dg(a)$ is invertible, so $g$ has a local $C^1$ inverse $G$. Use $G$ and $c$ somehow to get an $(x,y)$ near $a$ with $f(x,y)=c$.

share|cite|improve this answer
can you please clarify a little more? I am new to these things, and I can't understand how to proceed after that. – mathmansujo Aug 11 '13 at 19:08
I've added mire steps. Now you have to show me what you do with it. – Ted Shifrin Aug 11 '13 at 19:23

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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