When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Partially ordered set - Wikipedia

    en.wikipedia.org/wiki/Partially_ordered_set

    A partially ordered set (poset for short) is an ordered pair = (,) consisting of a set (called the ground set of ) and a partial order on . When the meaning is clear from context and there is no ambiguity about the partial order, the set X {\displaystyle X} itself is sometimes called a poset.

  3. Maximal and minimal elements - Wikipedia

    en.wikipedia.org/wiki/Maximal_and_minimal_elements

    In the particular case of a partially ordered set, while there can be at most one maximum and at most one minimum there may be multiple maximal or minimal elements. [1] [2] Specializing further to totally ordered sets, the notions of maximal element and maximum coincide, and the notions of minimal element and minimum coincide.

  4. Complete partial order - Wikipedia

    en.wikipedia.org/wiki/Complete_partial_order

    The set of all linearly independent subsets of a vector space V, ordered by inclusion. The set of all partial choice functions on a collection of non-empty sets, ordered by restriction. The set of all prime ideals of a ring, ordered by inclusion. The specialization order of any sober space is a dcpo.

  5. List of order structures in mathematics - Wikipedia

    en.wikipedia.org/wiki/List_of_order_structures...

    Lattices, partial orders in which each pair of elements has a greatest lower bound and a least upper bound. Many different types of lattice have been studied; see map of lattices for a list. Partially ordered sets (or posets), orderings in which some pairs are comparable and others might not be

  6. Completeness (order theory) - Wikipedia

    en.wikipedia.org/wiki/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 ...

  7. Ideal (order theory) - Wikipedia

    en.wikipedia.org/wiki/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.

  8. Glossary of set theory - Wikipedia

    en.wikipedia.org/wiki/Glossary_of_set_theory

    An abbreviation for "partial order" or "poset" poset A set with a partial order positive set theory A variant of set theory that includes a universal set and possibly other non-standard axioms, focusing on what can be constructed or defined positively. Polish space A Polish space is a separable topological space homeomorphic to a complete ...

  9. Dedekind–MacNeille completion - Wikipedia

    en.wikipedia.org/wiki/Dedekind–MacNeille...

    A given partially ordered set may have several different completions. For instance, one completion of any partially ordered set S is the set of its downwardly closed subsets ordered by inclusion. S is embedded in this (complete) lattice by mapping each element x to the lower set of elements that are less than or equal to x.