Ah, right! Great. I don't have motivation to generalize that far for now :)
Now a bit of a different question. I'm thinking of the extended Euclidean algorithm for finding a gcd of $f,g$ in terms of row-reducing their Sylvester matrix. For example I computed the polynomials $x^2+7,x^3+3x+6\in \mathbb Z[x]$ admit $74$ as a gcd with respective coefficients $−2x^2−3x+8,2x+3$.
Morally, I'd like to say the degree of the gcd should equal "the" rank of the Sylvester matrix. But I recall the rank of matrices over domains to be undefined (though I don't know why). Does it make sense to claim the de…