Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Free
Faster access than browser!
 

Partially ordered set

Index Partially ordered set

In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. [1]

98 relations: Antichain, Antimatroid, Antisymmetric relation, Asymmetric relation, Bijection, Binary relation, Birkhoff's representation theorem, Cartesian product, Category (mathematics), Causal sets, Closed set, Comparability, Comparability graph, Complete partial order, Complex number, Computer science, Converse relation, Covering relation, Directed acyclic graph, Directed set, Distributive lattice, Dover Publications, Duality (order theory), Equivalence of categories, Fence (mathematics), Field (mathematics), Function composition, Function space, Genealogy, Google Books, Graded poset, Greatest and least elements, Hasse diagram, Identity function, Incidence algebra, Initial and terminal objects, Injective function, Integer, Interval (mathematics), Interval order, Isomorphism of categories, Isomorphism-closed subcategory, Lattice (order), Lexicographical order, Light cone, Limit of a sequence, Linear extension, Linear subspace, Locally finite poset, Mathematics, ..., Maximal and minimal elements, Monotonic function, Natural number, On-Line Encyclopedia of Integer Sequences, Order embedding, Order isomorphism, Order theory, Ordered vector space, Partially ordered group, Poset topology, Power set, Preorder, Prime number, Prime power, Product order, Product topology, Rational number, Reachability, Real number, Reflexive closure, Reflexive relation, Scott continuity, Semilattice, Semiorder, Sequence, Sequence space, Series-parallel partial order, Set (mathematics), Singleton (mathematics), Special relativity, Stochastic dominance, String (computer science), Subsequence, Subset, Substring, Symmetric relation, Topological sorting, Topological space, Total order, Transitive closure, Transitive relation, Trichotomy (mathematics), Up to, Upper and lower bounds, Vector space, Weak ordering, Well-order, Zorn's lemma. Expand index (48 more) »

Antichain

In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two distinct elements in the subset are incomparable.

New!!: Partially ordered set and Antichain · See more »

Antimatroid

In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included.

New!!: Partially ordered set and Antimatroid · See more »

Antisymmetric relation

In mathematics, a binary relation R on a set X is anti-symmetric if there is no pair of distinct elements of X each of which is related by R to the other.

New!!: Partially ordered set and Antisymmetric relation · See more »

Asymmetric relation

In mathematics, an asymmetric relation is a binary relation on a set X where.

New!!: Partially ordered set and Asymmetric relation · See more »

Bijection

In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set.

New!!: Partially ordered set and Bijection · See more »

Binary relation

In mathematics, a binary relation on a set A is a set of ordered pairs of elements of A. In other words, it is a subset of the Cartesian product A2.

New!!: Partially ordered set and Binary relation · See more »

Birkhoff's representation theorem

In mathematics, Birkhoff's representation theorem for distributive lattices states that the elements of any finite distributive lattice can be represented as finite sets, in such a way that the lattice operations correspond to unions and intersections of sets.

New!!: Partially ordered set and Birkhoff's representation theorem · See more »

Cartesian product

In set theory (and, usually, in other parts of mathematics), a Cartesian product is a mathematical operation that returns a set (or product set or simply product) from multiple sets.

New!!: Partially ordered set and Cartesian product · See more »

Category (mathematics)

In mathematics, a category (sometimes called an abstract category to distinguish it from a concrete category) is an algebraic structure similar to a group but without requiring inverse or closure properties.

New!!: Partially ordered set and Category (mathematics) · See more »

Causal sets

The causal sets program is an approach to quantum gravity.

New!!: Partially ordered set and Causal sets · See more »

Closed set

In geometry, topology, and related branches of mathematics, a closed set is a set whose complement is an open set.

New!!: Partially ordered set and Closed set · See more »

Comparability

In mathematics, any two elements x and y of a set P that is partially ordered by a binary relation ≤ are comparable when either x ≤ y or y ≤ x. If it is not the case that x and y are comparable, then they are called incomparable.

New!!: Partially ordered set and Comparability · See more »

Comparability graph

In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order.

New!!: Partially ordered set and Comparability graph · See more »

Complete partial order

In mathematics, the phrase complete partial order is variously used to refer to at least three similar, but distinct, classes of partially ordered sets, characterized by particular completeness properties.

New!!: Partially ordered set and Complete partial order · See more »

Complex number

A complex number is a number that can be expressed in the form, where and are real numbers, and is a solution of the equation.

New!!: Partially ordered set and Complex number · See more »

Computer science

Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.

New!!: Partially ordered set and Computer science · See more »

Converse relation

In mathematics, the converse relation, or transpose, of a binary relation is the relation that occurs when the order of the elements is switched in the relation.

New!!: Partially ordered set and Converse relation · See more »

Covering relation

In mathematics, especially order theory, the covering relation of a partially ordered set is the binary relation which holds between comparable elements that are immediate neighbours.

New!!: Partially ordered set and Covering relation · See more »

Directed acyclic graph

In mathematics and computer science, a directed acyclic graph (DAG), is a finite directed graph with no directed cycles.

New!!: Partially ordered set and Directed acyclic graph · See more »

Directed set

In mathematics, a directed set (or a directed preorder or a filtered set) is a nonempty set A together with a reflexive and transitive binary relation ≤ (that is, a preorder), with the additional property that every pair of elements has an upper bound.

New!!: Partially ordered set and Directed set · See more »

Distributive lattice

In mathematics, a distributive lattice is a lattice in which the operations of join and meet distribute over each other.

New!!: Partially ordered set and Distributive lattice · See more »

Dover Publications

Dover Publications, also known as Dover Books, is an American book publisher founded in 1941 by Hayward Cirker and his wife, Blanche.

New!!: Partially ordered set and Dover Publications · See more »

Duality (order theory)

In the mathematical area of order theory, every partially ordered set P gives rise to a dual (or opposite) partially ordered set which is often denoted by Pop or Pd.

New!!: Partially ordered set and Duality (order theory) · See more »

Equivalence of categories

In category theory, an abstract branch of mathematics, an equivalence of categories is a relation between two categories that establishes that these categories are "essentially the same".

New!!: Partially ordered set and Equivalence of categories · See more »

Fence (mathematics)

In mathematics, a fence, also called a zigzag poset, is a partially ordered set in which the order relations form a path with alternating orientations: or A fence may be finite, or it may be formed by an infinite alternating sequence extending in both directions.

New!!: Partially ordered set and Fence (mathematics) · See more »

Field (mathematics)

In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined, and behave as when they are applied to rational and real numbers.

New!!: Partially ordered set and Field (mathematics) · See more »

Function composition

In mathematics, function composition is the pointwise application of one function to the result of another to produce a third function.

New!!: Partially ordered set and Function composition · See more »

Function space

In mathematics, a function space is a set of functions between two fixed sets.

New!!: Partially ordered set and Function space · See more »

Genealogy

Genealogy (from γενεαλογία from γενεά, "generation" and λόγος, "knowledge"), also known as family history, is the study of families and the tracing of their lineages and history.

New!!: Partially ordered set and Genealogy · See more »

Google Books

Google Books (previously known as Google Book Search and Google Print and by its codename Project Ocean) is a service from Google Inc. that searches the full text of books and magazines that Google has scanned, converted to text using optical character recognition (OCR), and stored in its digital database.

New!!: Partially ordered set and Google Books · See more »

Graded poset

In mathematics, in the branch of combinatorics, a graded poset is a partially ordered set (poset) P equipped with a rank function ρ from P to N satisfying the following two properties.

New!!: Partially ordered set and Graded poset · See more »

Greatest and least elements

In mathematics, especially in order theory, the greatest element of a subset S of a partially ordered set (poset) is an element of S that is greater than every other element of S. The term least element is defined dually, that is, it is an element of S that is smaller than every other element of S. Formally, given a partially ordered set (P, ≤), an element g of a subset S of P is the greatest element of S if Hence, the greatest element of S is an upper bound of S that is contained within this subset.

New!!: Partially ordered set and Greatest and least elements · See more »

Hasse diagram

In order theory, a Hasse diagram is a type of mathematical diagram used to represent a finite partially ordered set, in the form of a drawing of its transitive reduction.

New!!: Partially ordered set and Hasse diagram · See more »

Identity function

Graph of the identity function on the real numbers In mathematics, an identity function, also called an identity relation or identity map or identity transformation, is a function that always returns the same value that was used as its argument.

New!!: Partially ordered set and Identity function · See more »

Incidence algebra

In order theory, a field of mathematics, an incidence algebra is an associative algebra, defined for every locally finite partially ordered set and commutative ring with unity.

New!!: Partially ordered set and Incidence algebra · See more »

Initial and terminal objects

In category theory, a branch of mathematics, an initial object of a category C is an object I in C such that for every object X in C, there exists precisely one morphism I → X. The dual notion is that of a terminal object (also called terminal element): T is terminal if for every object X in C there exists a single morphism X → T. Initial objects are also called coterminal or universal, and terminal objects are also called final.

New!!: Partially ordered set and Initial and terminal objects · See more »

Injective function

In mathematics, an injective function or injection or one-to-one function is a function that preserves distinctness: it never maps distinct elements of its domain to the same element of its codomain.

New!!: Partially ordered set and Injective function · See more »

Integer

An integer (from the Latin ''integer'' meaning "whole")Integer 's first literal meaning in Latin is "untouched", from in ("not") plus tangere ("to touch").

New!!: Partially ordered set and Integer · See more »

Interval (mathematics)

In mathematics, a (real) interval is a set of real numbers with the property that any number that lies between two numbers in the set is also included in the set.

New!!: Partially ordered set and Interval (mathematics) · See more »

Interval order

In mathematics, especially order theory, the interval order for a collection of intervals on the real line is the partial order corresponding to their left-to-right precedence relation—one interval, I1, being considered less than another, I2, if I1 is completely to the left of I2.

New!!: Partially ordered set and Interval order · See more »

Isomorphism of categories

In category theory, two categories C and D are isomorphic if there exist functors F: C → D and G: D → C which are mutually inverse to each other, i.e. FG.

New!!: Partially ordered set and Isomorphism of categories · See more »

Isomorphism-closed subcategory

In category theory, a branch of mathematics, a subcategory \mathcal of a category \mathcal is said to be isomorphism closed or replete if every \mathcal-isomorphism h:A\to B with A\in\mathcal belongs to \mathcal.

New!!: Partially ordered set and Isomorphism-closed subcategory · See more »

Lattice (order)

A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.

New!!: Partially ordered set and Lattice (order) · See more »

Lexicographical order

In mathematics, the lexicographic or lexicographical order (also known as lexical order, dictionary order, alphabetical order or lexicographic(al) product) is a generalization of the way words are alphabetically ordered based on the alphabetical order of their component letters.

New!!: Partially ordered set and Lexicographical order · See more »

Light cone

In special and general relativity, a light cone is the path that a flash of light, emanating from a single event (localized to a single point in space and a single moment in time) and traveling in all directions, would take through spacetime.

New!!: Partially ordered set and Light cone · See more »

Limit of a sequence

As the positive integer n becomes larger and larger, the value n\cdot \sin\bigg(\frac1\bigg) becomes arbitrarily close to 1.

New!!: Partially ordered set and Limit of a sequence · See more »

Linear extension

In order theory, a branch of mathematics, a linear extension of a partial order is a total order (or linear order) that is compatible with the partial order.

New!!: Partially ordered set and Linear extension · See more »

Linear subspace

In linear algebra and related fields of mathematics, a linear subspace, also known as a vector subspace, or, in the older literature, a linear manifold, is a vector space that is a subset of some other (higher-dimension) vector space.

New!!: Partially ordered set and Linear subspace · See more »

Locally finite poset

In mathematics, a locally finite poset is a partially ordered set P such that for all x, y ∈ P, the interval consists of finitely many elements.

New!!: Partially ordered set and Locally finite poset · See more »

Mathematics

Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.

New!!: Partially ordered set and Mathematics · See more »

Maximal and minimal elements

In mathematics, especially in order theory, a maximal element of a subset S of some partially ordered set (poset) is an element of S that is not smaller than any other element in S. A minimal element of a subset S of some partially ordered set is defined dually as an element of S that is not greater than any other element in S. The notions of maximal and minimal elements are weaker than those of greatest element and least element which are also known, respectively, as maximum and minimum.

New!!: Partially ordered set and Maximal and minimal elements · See more »

Monotonic function

In mathematics, a monotonic function (or monotone function) is a function between ordered sets that preserves or reverses the given order.

New!!: Partially ordered set and Monotonic function · See more »

Natural number

In mathematics, the natural numbers are those used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country").

New!!: Partially ordered set and Natural number · See more »

On-Line Encyclopedia of Integer Sequences

The On-Line Encyclopedia of Integer Sequences (OEIS), also cited simply as Sloane's, is an online database of integer sequences.

New!!: Partially ordered set and On-Line Encyclopedia of Integer Sequences · See more »

Order embedding

In mathematical order theory, an order embedding is a special kind of monotone function, which provides a way to include one partially ordered set into another.

New!!: Partially ordered set and Order embedding · See more »

Order isomorphism

In the mathematical field of order theory an order isomorphism is a special kind of monotone function that constitutes a suitable notion of isomorphism for partially ordered sets (posets).

New!!: Partially ordered set and Order isomorphism · See more »

Order theory

Order theory is a branch of mathematics which investigates the intuitive notion of order using binary relations.

New!!: Partially ordered set and Order theory · See more »

Ordered vector space

In mathematics, an ordered vector space or partially ordered vector space is a vector space equipped with a partial order that is compatible with the vector space operations.

New!!: Partially ordered set and Ordered vector space · See more »

Partially ordered group

In abstract algebra, a partially ordered group is a group (G,+) equipped with a partial order "≤" that is translation-invariant; in other words, "≤" has the property that, for all a, b, and g in G, if a ≤ b then a+g ≤ b+g and g+a ≤ g+b.

New!!: Partially ordered set and Partially ordered group · See more »

Poset topology

In mathematics, the poset topology associated with a partially ordered set S (or poset for short) is the Alexandrov topology (open sets are upper sets) on the poset of finite chains of S, ordered by inclusion.

New!!: Partially ordered set and Poset topology · See more »

Power set

In mathematics, the power set (or powerset) of any set is the set of all subsets of, including the empty set and itself, variously denoted as, 𝒫(), ℘() (using the "Weierstrass p"),,, or, identifying the powerset of with the set of all functions from to a given set of two elements,.

New!!: Partially ordered set and Power set · See more »

Preorder

In mathematics, especially in order theory, a preorder or quasiorder is a binary relation that is reflexive and transitive.

New!!: Partially ordered set and Preorder · See more »

Prime number

A prime number (or a prime) is a natural number greater than 1 that cannot be formed by multiplying two smaller natural numbers.

New!!: Partially ordered set and Prime number · See more »

Prime power

In mathematics, a prime power is a positive integer power of a single prime number.

New!!: Partially ordered set and Prime power · See more »

Product order

In mathematics, given two ordered sets A and B, one can induce a partial ordering on the Cartesian product.

New!!: Partially ordered set and Product order · See more »

Product topology

In topology and related areas of mathematics, a product space is the cartesian product of a family of topological spaces equipped with a natural topology called the product topology.

New!!: Partially ordered set and Product topology · See more »

Rational number

In mathematics, a rational number is any number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator.

New!!: Partially ordered set and Rational number · See more »

Reachability

In graph theory, reachability refers to the ability to get from one vertex to another within a graph.

New!!: Partially ordered set and Reachability · See more »

Real number

In mathematics, a real number is a value of a continuous quantity that can represent a distance along a line.

New!!: Partially ordered set and Real number · See more »

Reflexive closure

In mathematics, the reflexive closure of a binary relation R on a set X is the smallest reflexive relation on X that contains R. For example, if X is a set of distinct numbers and x R y means "x is less than y", then the reflexive closure of R is the relation "x is less than or equal to y".

New!!: Partially ordered set and Reflexive closure · See more »

Reflexive relation

In mathematics, a binary relation R over a set X is reflexive if every element of X is related to itself.

New!!: Partially ordered set and Reflexive relation · See more »

Scott continuity

In mathematics, given two partially ordered sets P and Q, a function f \colon P \rightarrow Q between them is Scott-continuous (named after the mathematician Dana Scott) if it preserves all directed suprema, i.e. if for every directed subset D of P with supremum in P its image has a supremum in Q, and that supremum is the image of the supremum of D: that is, \sqcup f.

New!!: Partially ordered set and Scott continuity · See more »

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.

New!!: Partially ordered set and Semilattice · See more »

Semiorder

In order theory, a branch of mathematics, a semiorder is a type of ordering that may be determined for a set of items with numerical scores by declaring two items to be incomparable when their scores are within a given margin of error of each other, and by using the numerical comparison of their scores when those scores are sufficiently far apart.

New!!: Partially ordered set and Semiorder · See more »

Sequence

In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed.

New!!: Partially ordered set and Sequence · See more »

Sequence space

In functional analysis and related areas of mathematics, a sequence space is a vector space whose elements are infinite sequences of real or complex numbers.

New!!: Partially ordered set and Sequence space · See more »

Series-parallel partial order

In order-theoretic mathematics, a series-parallel partial order is a partially ordered set built up from smaller series-parallel partial orders by two simple composition operations.

New!!: Partially ordered set and Series-parallel partial order · See more »

Set (mathematics)

In mathematics, a set is a collection of distinct objects, considered as an object in its own right.

New!!: Partially ordered set and Set (mathematics) · See more »

Singleton (mathematics)

In mathematics, a singleton, also known as a unit set, is a set with exactly one element.

New!!: Partially ordered set and Singleton (mathematics) · See more »

Special relativity

In physics, special relativity (SR, also known as the special theory of relativity or STR) is the generally accepted and experimentally well-confirmed physical theory regarding the relationship between space and time.

New!!: Partially ordered set and Special relativity · See more »

Stochastic dominance

Stochastic dominance is a partial order between random variables.

New!!: Partially ordered set and Stochastic dominance · See more »

String (computer science)

In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.

New!!: Partially ordered set and String (computer science) · See more »

Subsequence

In mathematics, a subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order of the remaining elements.

New!!: Partially ordered set and Subsequence · See more »

Subset

In mathematics, a set A is a subset of a set B, or equivalently B is a superset of A, if A is "contained" inside B, that is, all elements of A are also elements of B. A and B may coincide.

New!!: Partially ordered set and Subset · See more »

Substring

A substring is a contiguous sequence of characters within a string.

New!!: Partially ordered set and Substring · See more »

Symmetric relation

In mathematics and other areas, a binary relation R over a set X is symmetric if it holds for all a and b in X that a is related to b if and only if b is related to a. In mathematical notation, this is: Symmetry, along with reflexivity and transitivity, are the three defining properties of an equivalence relation.

New!!: Partially ordered set and Symmetric relation · See more »

Topological sorting

In the field of computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.

New!!: Partially ordered set and Topological sorting · See more »

Topological space

In topology and related branches of mathematics, a topological space may be defined as a set of points, along with a set of neighbourhoods for each point, satisfying a set of axioms relating points and neighbourhoods.

New!!: Partially ordered set and Topological space · See more »

Total order

In mathematics, a linear order, total order, simple order, or (non-strict) ordering is a binary relation on some set X, which is antisymmetric, transitive, and a connex relation.

New!!: Partially ordered set and Total order · See more »

Transitive closure

In mathematics, the transitive closure of a binary relation R on a set X is the smallest relation on X that contains R and is transitive.

New!!: Partially ordered set and Transitive closure · See more »

Transitive relation

In mathematics, a binary relation over a set is transitive if whenever an element is related to an element and is related to an element then is also related to.

New!!: Partially ordered set and Transitive relation · See more »

Trichotomy (mathematics)

In mathematics, the law of trichotomy states that every real number is either positive, negative, or zero.

New!!: Partially ordered set and Trichotomy (mathematics) · See more »

Up to

In mathematics, the phrase up to appears in discussions about the elements of a set (say S), and the conditions under which subsets of those elements may be considered equivalent.

New!!: Partially ordered set and Up to · See more »

Upper and lower bounds

In mathematics, especially in order theory, an upper bound of a subset S of some partially ordered set (K, ≤) is an element of K which is greater than or equal to every element of S. The term lower bound is defined dually as an element of K which is less than or equal to every element of S. A set with an upper bound is said to be bounded from above by that bound, a set with a lower bound is said to be bounded from below by that bound.

New!!: Partially ordered set and Upper and lower bounds · See more »

Vector space

A vector space (also called a linear space) is a collection of objects called vectors, which may be added together and multiplied ("scaled") by numbers, called scalars.

New!!: Partially ordered set and Vector space · See more »

Weak ordering

In mathematics, especially order theory, a weak ordering is a mathematical formalization of the intuitive notion of a ranking of a set, some of whose members may be tied with each other.

New!!: Partially ordered set and Weak ordering · See more »

Well-order

In mathematics, a well-order (or well-ordering or well-order relation) on a set S is a total order on S with the property that every non-empty subset of S has a least element in this ordering.

New!!: Partially ordered set and Well-order · See more »

Zorn's lemma

Zorn's lemma, also known as the Kuratowski–Zorn lemma, after mathematicians Max Zorn and Kazimierz Kuratowski, is a proposition of set theory that states that a partially ordered set containing upper bounds for every chain (that is, every totally ordered subset) necessarily contains at least one maximal element.

New!!: Partially ordered set and Zorn's lemma · See more »

Redirects here:

Interval (partial order), Non-strict order, Ordered collection, Ordered n-tuple, Ordinal sum, Partial Order, Partial order, Partial ordering, Partial ordering relation, PartialOrder, PartialOrderedSet, Partially ordered, Partially ordered sets, Poset, Poset category, Strict order, Strict ordering, Strict partial order, Strict partial ordering.

References

[1] https://en.wikipedia.org/wiki/Partially_ordered_set

OutgoingIncoming
Hey! We are on Facebook now! »