This article includes a list of general references, but it lacks sufficient corresponding inline citations. Please help to improve this article by introducing more precise citations. (June 2017) (Learn how and when to remove this template message)

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.


A subset I of a partially ordered set is an ideal, if the following conditions hold:[1][2]

  1. I is non-empty,
  2. for every x in I and y in P, yx implies that y is in I  (I is a lower set),
  3. for every x, y in I, there is some element z in I, such that xz and yz  (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 is an ideal if and only if it is a lower set that is closed under finite joins (suprema); that is, it is nonempty and for all x, y in I, the element of P is also in I.[3]

A weaker notion of order ideal is defined to be a subset of a poset P that satisfies the above conditions 1 and 2. In other words, an order ideal is simply a lower set. Similarly, an ideal can also be defined as a "directed lower set".

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

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 for a principal p is thus given by p = {xP | xp}.

Terminology confusion

The above definitions of "ideal" and "order ideal" are the standard ones, [3][4][5] but there is some confusion in terminology. Sometimes the words and definitions such as "ideal", "order ideal", "Frink ideal", or "partial order ideal" mean one another.[6][7]

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

  1. I is a proper ideal of P, and
  2. for all elements x and y of P, in I implies that xI or yI.

It is easily checked that this is indeed equivalent to stating that 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 a maximal ideal if it is proper and there is no proper ideal J that is a strict superset 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 (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.


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 ab in M but neither a nor b are in M. Consider the case that for all m in M, ma 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 | xma for some mM}. 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 ma in F. Now if any element n in M is such that nb is in F, one finds that (mn) ∨ b and (mn) ∨ a are both in F. But then their meet is in F and, by distributivity, (mn) ∨ (ab) 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.


The construction of ideals and filters is an important tool in many applications of order theory.


Ideals were introduced by Marshall H. Stone first for Boolean algebras,[8] where the name was derived 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.

Generalization to any posets was done by Frink.[9]

See also


  1. ^ Taylor (1999), p. 141: "A directed lower subset of a poset X is called an ideal"
  2. ^ 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. Vol. 93. Cambridge University Press. p. 3. ISBN 0521803381.
  3. ^ a b c Burris & Sankappanavar 1981, Def. 8.2.
  4. ^ Davey & Priestley 2002, pp. 20, 44.
  5. ^ Frenchman & Hart 2020, pp. 2, 7.
  6. ^ Partial Order Ideal, Wolfram MathWorld, 2002, retrieved 2023-02-26
  7. ^ George M. Bergman (2008), "On lattices and their ideal lattices, and posets and their ideal posets" (PDF), Tbilisi Math. J., 1: 89–103, arXiv:0801.0751
  8. ^ Stone (1934) and Stone (1935)
  9. ^ Frink (1954)


About history