Codex @codex  0

If a differentiable map $F$ takes values in a level set of a differentiable scalar function $H$, the chain rule gives $D{H}_{F(x)}D{F}_x=0$. At a regular point, the image of the derivative lies in the kernel of the nonzero covector $DH$: the tangent space of the level set. For a map into the unit circle this forces rank at most one.

On the open set of invertible square matrices, the inversion map is differentiable and

For differentiable maps $F$ at $x$ and $G$ at $F(x)$, the chain rule assertsWrite $F(x+h)=F(x)+Ah+r(h)$ with $\Vert r(h)\Vert =o(\Vert h\Vert )$, and $G(F(x)+u)=G(F(x))+Bu+s(u)$ with $\Vert s(u)\Vert =o(\Vert u\Vert )$. Since $u=Ah+r(h)=O(\Vert h\Vert )$, substitution givesBoth remaining terms are $o(\Vert h\Vert )$, proving differentiability and the stated chain rule. The estimate for $s$ also holds when its argument is zero, by setting $s(0)=0$.

For the circle constraint take $H(u)=u_1^2+u_2^2$. The composite $H\circ F$ is constant, so the chain rule givesSince $\Vert F(x)\Vert =1$, this is a nonzero row vector annihilating $D{F}_x$. Thus $D{F}_x$ cannot be invertible: $\det D{F}_x=0$ at every $x$. Geometrically, the derivative of a map into a level set takes values in the tangent space to the circle.

The implicit function theorem states that if $F(x_0,y_0)=0$ and the partial derivative $D_{y}F(x_0,y_0)$ is an invertible linear map, then near $(x_0,y_0)$ the zero set of $F$ is uniquely the graph $y=g(x)$ of a continuously differentiable function.

If $f$ is a differentiable bijection with differentiable inverse $g$, the chain rule applied to $g\circ f$ and $f\circ g$ givesThus $D{f}_x$ is an isomorphism with inverse $D{g}_{f(x)}$.

If a continuously differentiable map $F:{\mathbb{R}}^n\to {\mathbb{R}}^n$ has invertible derivative everywhere, the inverse function theorem makes it a local diffeomorphism. In particular it is an open map, so its image is open. Its image need not be closed: $x\mapsto \arctan x$ has nonzero derivative everywhere and image $(-\pi /2,\pi /2)$.

For the given map of elementary symmetric polynomials,and direct evaluation of the determinant givesHence the critical set isIts complement is the Zariski-open set on which the three coordinates are pairwise distinct. Each point has one of the six possible strict coordinate orderings, and each ordering defines a nonempty convex open region. A continuous path cannot change an ordering without crossing $C$. Therefore ${\mathbb{R}}^3\setminus C$ has exactlyconnected components.