For a prime ideal , its height is the supremum of the lengths of strict chains of prime ideals ending at . For a proper ideal ,This is the height of an ideal.
We prove it by induction on . The case is the Krull principal ideal theorem. For the induction step, let be the finitely many minimal primes over that lie below . By induction each has height at most ; if one equals , we are done.
Otherwise, suppose has finite height and choose a chainwhose first nonminimal term is contained in none of the . 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 for an element avoiding the finitely many unwanted primes. Choose
The prime is minimal over . Otherwise a prime strictly between some and would show that has height at least two, although it is minimal over the principal ideal generated by ; this contradicts the principal ideal theorem. In , the prime is therefore minimal over an ideal generated by elements, so induction bounds its height by . The strict inclusions from to giveand hence . 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.
Articles by others on the same topic
There are currently no matching articles.