Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Ideal (order theory)
Summary
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:
I is non-empty,
for every x in I and y in P, y ≤ x implies that y is in I (I is a lower set),
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 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.
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.
The smallest ideal that contains a given element p is a and p is said to be a of the ideal in this situation. The principal ideal for a principal p is thus given by ↓ p = .
The above definitions of "ideal" and "order ideal" are the standard ones, 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.
An important special case of an ideal is constituted by those ideals whose set-theoretic complements are filters, i.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
Related courses (24)
MATH-215: Rings and fields
C'est un cours introductoire dans la théorie d'anneau et de corps.
MATH-311: Algebra IV - rings and modules
Ring and module theory with a major emphasis on commutative algebra and a minor emphasis on homological algebra.
MATH-310: Algebra
This is an introduction to modern algebra: groups, rings and fields.
Related publications (32)
Related people (2)
Related concepts (18)
Completeness (order theory)
In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). The most familiar example is the completeness of the real numbers. A special use of the term refers to complete partial orders or complete lattices. However, many other interesting notions of completeness exist. The motivation for considering completeness properties derives from the great importance of suprema (least upper bounds, joins, "") and infima (greatest lower bounds, meets, "") to the theory of partial orders.
Lattice (order)
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra. It consists of a partially ordered set in which every pair of elements has a unique supremum (also called a least upper bound or join) and a unique infimum (also called a greatest lower bound or meet). An example is given by the power set of a set, partially ordered by inclusion, for which the supremum is the union and the infimum is the intersection.
Semilattice
In mathematics, a join-semilattice (or upper semilattice) is a partially ordered set that has a join (a least upper bound) for any nonempty finite subset. Dually, a meet-semilattice (or lower semilattice) is a partially ordered set which has a meet (or greatest lower bound) for any nonempty finite subset. Every join-semilattice is a meet-semilattice in the inverse order and vice versa.