TITLE: Do relatively prime polynomials $f$ and $g$ in $k[x,y]$ generate an ideal of finite codimension?
QUESTION [9 upvotes]: Let $k$ be a field and $f,g \in k[x,y]$ be two non-constant polynomials in two variables. Is it true that the following conditions are equivalent:

$f$ and $g$ are relatively prime in $k[x,y]$, in the sense that they have no non-constant common divisors, so if we have the identity $\alpha f + \beta g = 0$ in $k[x,y]$ for some polynomials $\alpha,\beta\in k[x,y]$, then $\alpha = -g \gamma$ and $\beta = f \gamma$ for some $\gamma \in k[x,y]$.

The ideal $(f,g)$ generated by $f,g$ is of finite codimension in $k[x,y]$ over $k$, i.e. $\dim_{k} k[x,y] / (f,g) < \infty$.


The following simple arguments prove that 2) implies 1).
Suppose $f = a q$ and $g = b q$ for some $a,b,q\in k[x,y]$ and $q$ is non-constant, so 1) fail.
Exchanging if necessary $x$ and $y$, one can assume that $q(x,y) \not= x^k$ for all $k$.
Then neither of the following infinite and linearly independent over $k$ family of polynomials $\{x^i\}_{i\geq0}$ belongs to $(q) \supset (f,g)$.
Whence $\dim_{k} k[x,y] / (f,g) \geq \dim_{k} k[x,y] / (q) = \infty$, and thus 2) fails as well.
Thus the question is whether 1) implies 2)?
Perhaps one should assume that $k$ has characteristic $0$.

REPLY [9 votes]: A standard undergraduate maths approach is via resultants.
I am not going to survey resultants here (but see below), I'll just say that an immediate consequence of 1) is that there exists a nonzero monic $u:=Res_y(f,g)\in k[x]\cap (f,g)$ and
a nonzero monic $v:=Res_x(f,g)\in k[y]\cap (f,g)$. Therefore, any monomial $x^s y^t$ in $h\in R:=k[x,y]/(f,g)$ satisfies $s<\deg u$, $t<\deg v$, as you can reduce $x$-degree below $\deg u$ by replacing $x^{\deg u}$ with $u(x)-x^{\deg u}$,
and analogously for $y$-degree (using $v$). Hence $R$ is finite-dimensional.

EDIT: Remarks, definitions and explanations.
Degree $d$ polynomials form $d+1$-dimensional vectorspace $k_d[t]\subset k[t]$ over $k$. The resultant $Res_t(p,q)$ of
$p\in k_d[t]$, $q\in k_e[t]$ is the determinant $\det M$ of the
linear map $M:k_d[t]\times k_e[t]\to k_{d+e}[t]$ defined by
$M(w,z)=wq+zp$ (here $w\in k_d[t]$, $z\in k_e[t]$) - I am cheating here a bit with dimensions, as $\dim (k_d[t]\times k_e[t])=\dim(k_{d+e}[t])+1$, but we don't want this extra 1, so we assume w.l.o.g. that $z$ is monic, i.e. $z(t)=t^e+z_{e-1}t^{e-1}+\dots +z_0$. Assuming that $p,q$ have a common root $t^*$ in the algebraic closure of $k$, we see that $M$ cannot be 1-1 in this case, as $M$ would be divisible by $t-t^*$ for any $w,z$, i.e. $\det M=Res_t(p,q)=0$. Usually $M$ is written using
monomial bases of $k_d[t]$ and $k_e[t]$, as Sylvester_matrix.
We see that it readily generalises to rings, e.g. if we replace $k$ with $k[x]$ then $\det M\in k[x]$, and we can think of $Res_y(f,g)\in k[y]$, vanishing at common roots of $f$ and $g$ in
the algebraic closure of $k$.