## Number of generators of $m$-primary ideals in $k[x, y]$

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Let $R = k[x, y]$ with $k$ algebraically closed, and $m = (x, y)$. Suppose $I$ is an $m$-primary ideal of $R$, i.e., $(x, y)^n \subset I \subset (x, y)$ for some $n$. If $I_m$ is generated by a regular sequence of length 2, i.e., $I_m = aR_m + bR_m$ where $a, b$ is a regular sequence of $R_m$. What can we say about the number of generators of $I$ in this case?

All my examples show that $I$ is generated by a regular sequence of length 2, yet not a proof is found.

Thanks,

-

## 1 Answer

This is a standard result using elementary homological algebra. If $I$ is a height two local complete intersection ideal in $R=k[x,y]$, then it is a complete intersection. Under the hypothesis, it follows that $\mathrm{Ext}^1_R(I,R)$ is isomorphic to $R/I$, this being a local calculation and Chinese remainder theorem. The extension corresponding to $1\in R/I$ is $0\to R\to P\to I\to 0$ and one checks that $P$ is $R$-projective of rank two, since by choice $\mathrm{Ext}^1_R(P,R)=0$, and hence free (by Seshadri's theorem).

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 25, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.921327531337738, "perplexity_flag": "head"}