Further Prime Ideal Theorems
The prototypical properties that were discussed for Boolean algebras in the above section can easily be modified to include more general lattices, such as distributive lattices or Heyting algebras. However, in these cases maximal ideals are different from prime ideals, and the relation between PITs and MITs is not obvious.
Indeed, it turns out that the MITs for distributive lattices and even for Heyting algebras are equivalent to the axiom of choice. On the other hand, it is known that the strong PIT for distributive lattices is equivalent to BPI (i.e. to the MIT and PIT for Boolean algebras). Hence this statement is strictly weaker than the axiom of choice. Furthermore, observe that Heyting algebras are not self dual, and thus using filters in place of ideals yields different theorems in this setting. Maybe surprisingly, the MIT for the duals of Heyting algebras is not stronger than BPI, which is in sharp contrast to the abovementioned MIT for Heyting algebras.
Finally, prime ideal theorems do also exist for other (not order-theoretical) abstract algebras. For example, the MIT for rings implies the axiom of choice. This situation requires to replace the order-theoretic term "filter" by other concepts—for rings a "multiplicatively closed subset" is appropriate.
Read more about this topic: Boolean Prime Ideal Theorem
Famous quotes containing the words prime and/or ideal:
“In time, after a dozen years of centering their lives around the games boys play with one another, the boys’ bodies change and that changes everything else. But the memories are not erased of that safest time in the lives of men, when their prime concern was playing games with guys who just wanted to be their friendly competitors. Life never again gets so simple.”
—Frank Pittman (20th century)
“There is no absolute point of view from which real and ideal can be finally separated and labelled.”
—T.S. (Thomas Stearns)