Strong antichain

Strong antichain

In order theory, a subset "A" of a partially ordered set "X" is said to be a strong downwards antichain if no two elements have a common lower bound, that is,

:forall x, y in A mbox{such that } x ot= y otexists z x geq z and y geq z.

A strong upwards antichain is defined similarly.

Often authors will drop the upwards/downwards term and merely refer to strong antichains. Unfortunately, there is no common convention as to which version is called a strong antichain.

Because it is convenient to have a convention, and because the two are essentially equivalent concepts, we will adopt the convention that a strong antichain means a strong "downwards" antichain.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • Antichain — In mathematics, in the area of order theory, an antichain is a subset of a partially ordered set such that any two elements in the subset are incomparable. (Some authors use the term antichain to mean strong antichain, a subset such that there is …   Wikipedia

  • Mathematical jargon — The language of mathematics has a vast vocabulary of specialist and technical terms. It also has a certain amount of jargon: commonly used phrases which are part of the culture of mathematics, rather than of the subject. Jargon often appears in… …   Wikipedia

  • List of mathematical jargon — The language of mathematics has a vast vocabulary of specialist and technical terms. It also has a certain amount of jargon: commonly used phrases which are part of the culture of mathematics, rather than of the subject. Jargon often appears in… …   Wikipedia

  • Countable chain condition — See also: Forcing (set theory)#The countable chain condition In order theory, a partially ordered set X is said to satisfy the countable chain condition, or to be ccc, if every strong antichain in X is countable. There are really two conditions:… …   Wikipedia

  • List of mathematics articles (S) — NOTOC S S duality S matrix S plane S transform S unit S.O.S. Mathematics SA subgroup Saccheri quadrilateral Sacks spiral Sacred geometry Saddle node bifurcation Saddle point Saddle surface Sadleirian Professor of Pure Mathematics Safe prime Safe… …   Wikipedia

  • Stable model semantics — The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of several standard approaches to the meaning of negation in logic programming, along with program… …   Wikipedia

  • Axiom of choice — This article is about the mathematical concept. For the band named after it, see Axiom of Choice (band). In mathematics, the axiom of choice, or AC, is an axiom of set theory stating that for every family of nonempty sets there exists a family of …   Wikipedia

  • Suslin's problem — In mathematics, Suslin s problem is a question about totally ordered sets posed by Mikhail Yakovlevich Suslin in the early 1920s. [cite journal title=Problème 3 last= Souslin first=M. journal=Fundamenta Mathematicae volume=1 date=1920 pages=223]… …   Wikipedia

  • List of forcing notions — In mathematics, forcing is a method of constructing new models M[G] of set theory by adding a generic subset G of a poset P to a model M. The poset P used will determine what statements hold in the new universe (the extension ); to force a… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”