The Stacks project

Lemma 90.18.1. Let $F, G: \mathcal{C}_\Lambda \to \textit{Sets}$ be deformation functors. Let $\varphi : F \to G$ be a smooth morphism which induces an isomorphism $d\varphi : TF \to TG$ of tangent spaces. Then $\varphi $ is an isomorphism.

Proof. We prove $F(A) \to G(A)$ is a bijection for all $A \in \mathop{\mathrm{Ob}}\nolimits (\mathcal{C}_\Lambda )$ by induction on $\text{length}_ A(A)$. For $A = k$ the statement follows from the assumption that $F$ and $G$ are deformation functors. Suppose that the statement holds for rings of length less than $n$ and let $A'$ be a ring of length $n$. Choose a small extension $f : A' \to A$. We have a commutative diagram

\[ \xymatrix{ F(A') \ar[r] \ar[d]_{F(f)} & G(A') \ar[d]^{G(f)} \\ F(A) \ar[r]^{\sim } & G(A) } \]

where the map $F(A) \to G(A)$ is a bijection. By smoothness of $F \to G$, $F(A') \to G(A')$ is surjective (Lemma 90.8.8). Thus we can check bijectivity by checking it on fibers $F(f)^{-1}(x) \to G(f)^{-1}(\varphi (x))$ for $x \in F(A)$ such that $F(f)^{-1}(x)$ is nonempty. These fibers are precisely $\text{Lift}(x, A')$ and $\text{Lift}(\varphi (x), A')$ and by assumption we have an isomorphism $d\varphi \otimes \text{id} : TF \otimes _ k \mathop{\mathrm{Ker}}(f) \to TG \otimes _ k \mathop{\mathrm{Ker}}(f)$. Thus, by Lemma 90.17.5 and Remark 90.17.6, for $x \in F(A)$ such that $F(f)^{-1}(x)$ is nonempty the map $F(f)^{-1}(x) \to G(f)^{-1}(\varphi (x))$ is a map of sets commuting with free transitive actions by $TF \otimes _ k \mathop{\mathrm{Ker}}(f)$. Hence it is bijective. $\square$


Comments (0)


Post a comment

Your email address will not be published. Required fields are marked.

In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).

Unfortunately JavaScript is disabled in your browser, so the comment preview function will not work.

All contributions are licensed under the GNU Free Documentation License.




In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder, this is tag 06JL. Beware of the difference between the letter 'O' and the digit '0'.