4
$\begingroup$

A set of polynomials $\{f_1,\ldots,f_m\}$ in $k[x_1,\ldots,x_n]$ are algebraically independent over $k$ iff for all polynomials $p \in k[y_1,\ldots,y_m]$, $p(f_1,\ldots,f_m) = 0$ implies that $p = 0$.

In linear algebra, the dimension of a subspace of $k^n$ defined by $m$ linearly independent equations is $n - m$. Is the analogous statement in algebraic geometry true: that the dimension of a variety in $k^n$ defined by $m$ algebraically independent polynomials is $n - m$?

Thanks!

  • 0
    Finally, as a partial converse, we can say that if a prime ideal $\mathfrak p$ is of height $m$, then we can find $n-m$ algebraically independent elements defining functions over $k[X_1,\ldots,X_n]/\mathfrak p$. This is possible thanks to the refined Noether's normalization Lemma proved for example in Eisenbud's *Commutative Algebra with a view towards Algebraic Geometry*, Theorem 13.3 page 283.2012-12-04

1 Answers 1

4

One definition of dimension for an algebraic variety is the transcendence degree of its function field (which, for an affine variety, is the fraction field of its coordinate ring). Intuitively, each polynomial you use to define a variety in an n-dimensional ambient space reduces dimension by 1, but as YACP's comment above illustrates, this is not always the case even if the polynomials are algebraically independent.

  • 3
    The point is that the right notion is not the algebraic independence, but the one of regular sequence. If you start with a regular sequence, then modding out an element lowers the dimension exactly by 1.2012-12-04