In mathematicalorder theory, an ideal is a special subset of a partially ordered set. Although this term historically was derived from the notion of a ring ideal of abstract algebra, it has subsequently been generalized to a different notion. Ideals are of great importance for many constructions in order and lattice theory.
Basic definitions
A subset I of a partially ordered set is an ideal, if the following conditions hold:
for every x in I, any y in P and y ≤ x implies that y is in I., and
for every x, y in I, there is some element z in I, such that x ≤ z and y ≤ z..
While this is the most general way to define an ideal for arbitrary posets, it was originally defined for lattices only. In this case, the following equivalent definition can be given: a subset I of a lattice is an ideal if and only if it is a lower set that is closed under finite joins, i.e., it is nonempty and for all x, y in I, the element ofP is also in I. The dual notion of an ideal, i.e., the concept obtained by reversing all ≤ and exchanging with, is a filter. Some authors use the term ideal to mean a lower set, i.e., they include only condition 2 above, while others use the term order ideal for this weaker notion. With the weaker definition, an ideal of a lattice seen as a poset is not closed under joins, so it is not necessarily an ideal of the lattice. Wikipedia uses only "ideal/filter " and "lower/upper set" to avoid confusion. Frink ideals, pseudoideals and Doyle pseudoideals are different generalizations of the notion of a lattice ideal. An ideal or filter is said to be proper if it is not equal to the whole set P. The smallest ideal that contains a given element p is a principal ideal and p is said to be a principal element of the ideal in this situation. The principal ideal for a principal p is thus given by =.
Prime ideals
An important special case of an ideal is constituted by those ideals whose set-theoretic complements are filters, i.e. ideals in the inverse order. Such ideals are called prime ideals. Also note that, since we require ideals and filters to be non-empty, every prime ideal is necessarily proper. For lattices, prime ideals can be characterized as follows: A subset I of a lattice is a prime ideal, if and only if
for all elements x and y of P, x'y in I implies that x is in I or y is in I.
It is easily checked that this is indeed equivalent to stating that P \ I is a filter. For a complete lattice the further notion of a completely prime ideal' is meaningful. It is defined to be a proper ideal I with the additional property that, whenever the meet of some arbitrary set A is in I, some element of A is also in I''. So this is just a specific prime ideal that extends the above conditions to infinite meets. The existence of prime ideals is in general not obvious, and often a satisfactory amount of prime ideals cannot be derived within ZF. This issue is discussed in various prime ideal theorems, which are necessary for many applications that require prime ideals.
Maximal ideals
An ideal I is maximal if it is proper and there is no proper ideal J that is a strict superset set of I. Likewise, a filter F is maximal if it is proper and there is no proper filter that is a strict superset. When a poset is a distributive lattice, maximal ideals and filters are necessarily prime, while the converse of this statement is false in general. Maximal filters are sometimes called ultrafilters, but this terminology is often reserved for Boolean algebras, where a maximal filter is a filter that contains exactly one of the elements, for each element a of the Boolean algebra. In Boolean algebras, the terms prime ideal and maximal ideal coincide, as do the terms prime filter and maximal filter. There is another interesting notion of maximality of ideals: Consider an ideal I and a filter F such that I is disjoint from F. We are interested in an ideal M that is maximal among all ideals that contain I and are disjoint from F. In the case of distributive lattices such an M is always a prime ideal. A proof of this statement follows. However, in general it is not clear whether there exists any ideal M that is maximal in this sense. Yet, if we assume the axiom of choice in our set theory, then the existence of M for every disjoint filter–ideal-pair can be shown. In the special case that the considered order is a Boolean algebra, this theorem is called the Boolean prime ideal theorem. It is strictly weaker than the axiom of choice and it turns out that nothing more is needed for many order-theoretic applications of ideals.
Applications
The construction of ideals and filters is an important tool in many applications of order theory.
Order theory knows many completion procedures, to turn posets into posets with additional completeness properties. For example, the ideal completion of a given partial orderP is the set of all ideals of P ordered by subset inclusion. This construction yields the freedcpo generated by P. An ideal is principal if and only if it is compact in the ideal completion, so the original poset can be recovered as the sub-poset consisting of compact elements. Furthermore, every algebraic dcpo can be reconstructed as the ideal completion of its set of compact elements.
History
Ideals were introduced first by Marshall H. Stone, who derived their name from the ring ideals of abstract algebra. He adopted this terminology because, using the isomorphism of the categories of Boolean algebras and of Boolean rings, the two notions do indeed coincide.
Literature
Ideals and filters are among the most basic concepts of order theory. See the introductory books given for order theory and lattice theory, and the literature on the Boolean prime ideal theorem.
