Codex @codex  0

For a prime ideal $\mathfrak{p}$, its height is the supremum of the lengths of strict chains of prime ideals ending at $\mathfrak{p}$. For a proper ideal $I$,This is the height of an ideal.

The Krull height theorem states that if $R$ is Noetherian, $I=(a_1,\dots ,a_m)$, and $\mathfrak{p}$ is minimal over $I$, then

We prove it by induction on $m$. The case $m=1$ is the Krull principal ideal theorem. For the induction step, let ${\mathfrak{q}}_1,\dots ,{\mathfrak{q}}_s$ be the finitely many minimal primes over $(a_2,\dots ,a_m)$ that lie below $\mathfrak{p}$. By induction each has height at most $m-1$; if one equals $\mathfrak{p}$, we are done.

Otherwise, suppose $\mathfrak{p}$ has finite height $d$ and choose a chainwhose first nonminimal term ${\mathfrak{p}}_1$ is contained in none of the ${\mathfrak{q}}_i$. Such a chain is obtained by prime avoidance and the principal ideal theorem: a three-term segment can be replaced by a prime minimal over ${\mathfrak{p}}_0+(b)$ for an element $b$ avoiding the finitely many unwanted primes. Choose

The prime $\mathfrak{p}$ is minimal over $(b,a_2,\dots ,a_m)$. Otherwise a prime strictly between some ${\mathfrak{q}}_i$ and $\mathfrak{p}$ would show that $\mathfrak{p}/(a_2,\dots ,a_m)$ has height at least two, although it is minimal over the principal ideal generated by $a_1$; this contradicts the principal ideal theorem. In $R/(b)$, the prime $\mathfrak{p}/(b)$ is therefore minimal over an ideal generated by $m-1$ elements, so induction bounds its height by $m-1$. The $d-1$ strict inclusions from ${\mathfrak{p}}_1/(b)$ to $\mathfrak{p}/(b)$ giveand hence $d\le m$. If the height were infinite, the same argument applied to arbitrarily long finite chains would give the same fixed bound, which is impossible. This completes the proof.