Commutative Algebra/Intersection and prime chains or Krull theory

From testwiki
Jump to navigation Jump to search

Template:TextBox

Template:TextBox

Proof 1:

We prove the theorem directly. First consider the case n=2. Let aJI1 and bJI2. Then aI2, bI1 and a+bJ. In case a+bI1, we have aI1 and in case a+bI2 we have bI2. Both are contradictions.

Now consider the case n>2. Without loss of generality, we may assume I1,I2 are not prime and all the other ideals are prime. If JI1I2, the claim follows by what we already proved. Otherwise, there exists an element bJ(I3In(I1I2)). Without loss of generality, we may assume bJ(I3(I1I2)). We claim that JI3. First assume

Assume otherwise. If there exists aI1 (or I2), then .

INCOMPLETE

Proof 2:

We prove the theorem by induction on n. The case n=2 we take from the preceding proof. Let n>2. By induction, we have that J is not contained within any of I1Ik^In, where the hat symbol means that the k-th ideal is not counted in the union, for each k{1,,n}. Hence, we may choose for each k{1,,n} akJI1Ik^In. Since n>2, at least one of the ideals I1,,In is prime; say Im is this prime ideal. Consider the element of J

b:=am+a1am1am+1an.

For jm, b is not contained in Ij because otherwise am would be contained within Ij. For j=m, b is also not contained within Ij, this time because otherwise a1am1am+1anIj=Im, contradicting Im being prime. Hence, we have a contradiction to the hypothesis.

Template:BookCat