15 Arietis: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Bibcode Bot
m Adding 1 arxiv eprint(s), 0 bibcode(s) and 0 doi(s). Did it miss something? Report bugs, errors, and suggestions at User talk:Bibcode Bot
 
en>Trappist the monk
Line 1: Line 1:
Hello and welcome. My name is Numbers Wunder. The preferred hobby for my kids and me is to play baseball but I haven't made a dime with it. Puerto Rico is exactly where he's usually been living but she needs to move because of her family. Supervising is my profession.<br><br>Also visit my blog ... home std test ([http://btcsoc.com/index.php?do=/profile-4621/info/ Recommended Web page])
[[Image:Upset.svg|thumb|
The powerset algebra of the set <math>\{1,2,3,4\}</math> with the upset <math>\uparrow\{1\}</math> colored green.]]
In [[mathematics]], an '''upper set''' (also called an '''upward [[Closure (mathematics)#Closed sets|closed]]''' set or just an '''upset''') of a [[partially ordered set]] (''X'',&le;) is a subset ''U'' with the property that, if ''x'' is in ''U'' and ''x''≤''y'', then ''y'' is in ''U''.  
 
The [[duality (order theory)|dual]] notion is '''lower set''' (alternatively, '''down set''', '''decreasing set''', '''initial segment'''; the set is '''downward closed'''), which is a subset ''L'' with the property that, if ''x'' is in ''L'' and ''y''≤''x'', then ''y'' is in ''L''.  
 
== Properties ==
*Every partially ordered set is an upper set of itself.
*The [[intersection (set theory)|intersection]] and the [[union (set theory)|union]] of upper sets is again an upper set.
*The [[complement (set theory)|complement]] of any upper set is a lower set, and vice versa.
*Given a partially ordered set (''X'',&le;), the family of lower sets of ''X'' ordered with the [[inclusion (set theory)|inclusion]] relation is a [[complete lattice]], the '''down-set lattice''' O(''X'').
*Given an arbitrary subset ''Y'' of an ordered set ''X'', the smallest upper set containing ''Y'' is denoted using an up arrow as &uarr;''Y''.
**Dually, the smallest lower set containing ''Y'' is denoted using a down arrow as &darr;''Y''.
*A lower set is called '''principal''' if it is of the form &darr;{''x''} where ''x'' is an element of ''X''.
*Every lower set ''Y'' of a finite ordered set ''X'' is equal to the smallest lower set containing all [[maximal element]]s of ''Y'': ''Y''&nbsp;=&nbsp;&darr;Max(''Y'') where Max(''Y'') denotes the set containing the maximal elements of ''Y''.
*A [[directed set|directed]] lower set is called an [[order ideal]].
*The [[minimal element]]s of any upper set form an [[antichain]].
**Conversely any antichain ''A'' determines an upper set {''x'': for some ''y'' in ''A'', ''x'' ≥ ''y''}. For partial orders satisfying the [[descending chain condition]] this correspondence between antichains and upper sets is 1-1, but for more general partial orders this is not true.
 
==Ordinal numbers==
An [[ordinal number]] is usually identified with the set of all smaller ordinal numbers. Thus each ordinal number forms a lower set in the class of all ordinal numbers, which are totally ordered by set inclusion.
 
==See also==
* [[Cofinal set]] – a subset ''U'' of a partially ordered set (''P'',≤) that contains for every element ''x'' of ''P'' an element ''y'' such that ''x'' ≤ ''y''
 
==References==
*Blanck, J. (2000) "Domain representations of topological spaces". Theoretical Computer Science, '''247''', 229–255.
*Hoffman, K. H. (2001), [http://www.mathematik.tu-darmstadt.de:8080/Math-Net/Lehrveranstaltungen/Lehrmaterial/SS2003/Topology/separation.pdf ''The low separation axioms (T<sub>0</sub>) and (T<sub>1</sub>)'']
* {{cite book
| author = Davey, B.A., and Priestley, H. A.
| year = 2002
| title = Introduction to Lattices and Order
| edition = 2nd
| publisher = Cambridge University Press
| isbn = 0-521-78451-4
}}
 
[[Category:Order theory]]
 
[[ru:Частично упорядоченное множество#Верхнее и нижнее множество]]

Revision as of 16:08, 6 January 2014

The powerset algebra of the set {1,2,3,4} with the upset {1} colored green.

In mathematics, an upper set (also called an upward closed set or just an upset) of a partially ordered set (X,≤) is a subset U with the property that, if x is in U and xy, then y is in U.

The dual notion is lower set (alternatively, down set, decreasing set, initial segment; the set is downward closed), which is a subset L with the property that, if x is in L and yx, then y is in L.

Properties

  • Every partially ordered set is an upper set of itself.
  • The intersection and the union of upper sets is again an upper set.
  • The complement of any upper set is a lower set, and vice versa.
  • Given a partially ordered set (X,≤), the family of lower sets of X ordered with the inclusion relation is a complete lattice, the down-set lattice O(X).
  • Given an arbitrary subset Y of an ordered set X, the smallest upper set containing Y is denoted using an up arrow as ↑Y.
    • Dually, the smallest lower set containing Y is denoted using a down arrow as ↓Y.
  • A lower set is called principal if it is of the form ↓{x} where x is an element of X.
  • Every lower set Y of a finite ordered set X is equal to the smallest lower set containing all maximal elements of Y: Y = ↓Max(Y) where Max(Y) denotes the set containing the maximal elements of Y.
  • A directed lower set is called an order ideal.
  • The minimal elements of any upper set form an antichain.
    • Conversely any antichain A determines an upper set {x: for some y in A, xy}. For partial orders satisfying the descending chain condition this correspondence between antichains and upper sets is 1-1, but for more general partial orders this is not true.

Ordinal numbers

An ordinal number is usually identified with the set of all smaller ordinal numbers. Thus each ordinal number forms a lower set in the class of all ordinal numbers, which are totally ordered by set inclusion.

See also

  • Cofinal set – a subset U of a partially ordered set (P,≤) that contains for every element x of P an element y such that xy

References

ru:Частично упорядоченное множество#Верхнее и нижнее множество