§ Every ideal that is maximal wrt. being disjoint from a multiplicative subset is prime
I ran across this when reading another question on math.se, so I
posted this proof for verification just to be sure I wasn't missing
something.
We wish to characterise prime ideals as precisely those that are disjoint from
a multiplicative subset S⊆R. That is:
- An ideal P is prime iff P=R∖S, where S is a multiplicative subset that cannot be made larger (ie, is maximal wrt to the ⊆ ordering).
I'll be using the definition of prime as:
- An ideal P is prime if for all x,y∈R, xy∈P⟹x∈P∨y∈P.
§ Prime ideal implies complement is maximal multiplicative subset:
Let S=≡R∖P be the complement of the prime ideal P⊊R
in question.
- Since P=R, 1∈P. (if 1∈P, then every element x.1∈Psince P is an ideal, and must be closed under multiplication with the entire ring). Hence, 1∈S.
- For any x,y∈S, we need xy∈S for S to be mulitplicative.
- For contradiction, let us say that x,y∈S such that xy∈S. Translating to P, this means that x,y∈P such that xy∈P. This contradictions the definition of P being prime.
§ Ideal whose complement is maximal multiplicative subset implies ideal is prime.
- Let I be an ideal of the ring R such that its complement S≡R/Iis a maximal multiplicative subset.
- Let i1i2∈I. For I to be prime, we need to show that i1∈I or i2∈I.
- For contradiction, let i1,i2∈I. Thus, i1,i2∈S. Since S is multiplicative, i1i2∈S. That is, i1i2∈I (since I is disjoint from S).
- But this violates our assumption that i1i2∈I. Hence, contradiction.