Ideal (order theory)

In mathematical order theory, an ideal is a special subset of a partially ordered set (poset). 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 (P,≤) is an ideal, if the following conditions hold:^[1]^[2]

I is non-empty,
for every x in I, y ≤ x implies that y is in I. (I is a lower set), and
for every x, y in I, there is some element z in I, such that x ≤ z and y ≤ z. (I is a directed set).

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 (P,≤) is an ideal if and only if it is a lower set that is closed under finite joins (suprema), i.e., it is nonempty and for all x, y in I, the element x $\vee$ y of P is also in I.^[3]

The dual notion of an ideal, i.e., the concept obtained by reversing all ≤ and exchanging $\vee$ with $\wedge$ , is a filter.

Some authors use the term ideal to mean a lower set, i.e., they include only condition 2 above.^[4]^[5]^[6] With this 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.^[6] Wikipedia uses only "ideal/filter (of order theory)" 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.^[3]

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 $\downarrow$ p for a principal p is thus given by $\downarrow$ p = {x in P | x ≤ p}.

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 (P,≤) is a prime ideal, if and only if

I is a proper ideal of P, and
for every elements x and y of P, x $\wedge$ 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 (which is then also prime, in the dual sense).

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 (infimum) 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 (Zermelo–Fraenkel set theory without the axiom of choice). 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 strictly greater set than I. Likewise, a filter F is maximal if it is proper and there is no proper filter that is strictly greater.

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 (ideal) is a filter (ideal) that contains exactly one of the elements {a, ¬a}, 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.

Proof. Assume the ideal M is maximal with respect to disjointness from the filter F. Suppose for a contradiction that M is not prime, i.e. there exists a pair of elements a and b such that a

\wedge

b in M but neither a nor b are in M. Consider the case that for all m in M, m

\vee

a is not in F. One can construct an ideal N by taking the downward closure of the set of all binary joins of this form, i.e. N = { x | x≤ m

\vee

a for some m in M}. It is readily checked that N is indeed an ideal disjoint from F which is strictly greater than M. But this contradicts the maximality of M and thus the assumption that M is not prime.

For the other case, assume that there is some m in M with m

\vee

a in F. Now if any element n in M is such that n

\vee

b is in F, one finds that (m

\vee

\vee

b and (m

\vee

\vee

a are both in F. But then their meet is in F and, by distributivity, (m

\vee

\vee

\wedge

b) is in F too. On the other hand, this finite join of elements of M is clearly in M, such that the assumed existence of n contradicts the disjointness of the two sets. Hence all elements n of M have a join with b that is not in F. Consequently one can apply the above construction with b in place of a to obtain an ideal that is strictly greater than M while being disjoint from F. This finishes the proof.

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.

In Stone's representation theorem for Boolean algebras, the maximal ideals (or, equivalently via the negation map, ultrafilters) are used to obtain the set of points of a topological space, whose clopen sets are isomorphic to the original Boolean algebra.
Order theory knows many completion procedures, to turn posets into posets with additional completeness properties. For example, the ideal completion of a given partial order P is the set of all ideals of P ordered by subset inclusion. This construction yields the free dcpo 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.

Notes

↑ Taylor (1999), p. 141: "A directed lower subset of a poset X is called an ideal"
↑ Gierz, G.; Hofmann, K. H.; Keimel, K.; Lawson, J. D.; Mislove, M. W.; Scott, D. S. (2003). Continuous Lattices and Domains. Encyclopedia of Mathematics and its Applications. 93. Cambridge University Press. p. 3. ISBN 0521803381.
1 2 Burris & Sankappanavar 1981, Def. 8.2.
↑ Lawson (1998), p. 22
↑ Stanley (2002), p. 100
1 2 Davey & Priestley, Introduction to Lattices and Order (Second Edition), 2002, p. 20 and 44

References

Burris, Stanley N.; Sankappanavar, Hanamantagouda P. (1981). A Course in Universal Algebra. Springer-Verlag. ISBN 3-540-90578-2.
Lawson, M.V. (1998). Inverse semigroups: the theory of partial symmetries. World Scientific. ISBN 978-981-02-3316-7.
Stanley, R.P. (2002). Enumerative combinatorics. Cambridge studies in advanced mathematics. 1. Cambridge University Press. ISBN 978-0-521-66351-9.
Taylor, Paul (1999), Practical foundations of mathematics, Cambridge Studies in Advanced Mathematics, 59, Cambridge University Press, Cambridge, ISBN 0-521-63107-6, MR 1694820

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.