Upper set

1

In mathematics, an upper set (also called an upward closed set, an upset, or an isotone set in X) of a partially ordered set (X, \leq) is a subset with the following property: if s is in S and if x in X is larger than s (that is, if s < x), then x is in S. In other words, this means that any x element of X that is ,\geq, to some element of S is necessarily also an element of S. The term lower set (also called a downward closed set, down set, decreasing set, initial segment, or semi-ideal) is defined similarly as being a subset S of X with the property that any element x of X that is ,\leq, to some element of S is necessarily also an element of S.

Definition

Let (X, \leq) be a preordered set. An**** ' in X (als**o called**** an**** ', an , or an **** set)** is**** a subset**** that**** is**** "closed under going up****", in**** the sense that**** The dual notion is a **' (also called a ****', ****', ****', ****', **or '), which is a subset that is "closed under going down", in the sense that The terms **' or **' are sometimes used as synonyms for lower set. This choice of terminology fails to reflect the notion of an ideal of a lattice because a lower set of a lattice is not necessarily a sublattice.

Properties

Upper closure and lower closure

Given an element x of a partially ordered set (X, \leq), the upper closure or upward closure of x, denoted by or is defined by while the lower closure or downward closure of x, denoted by or is defined by The sets and are, respectively, the smallest upper and lower sets containing x as an element. More generally, given a subset define the upper/upward closure and the lower/downward closure of A, denoted by and respectively, as and In this way, and where upper sets and lower sets of this form are called principal. The upper closure and lower closure of a set are, respectively, the smallest upper set and lower set containing it. The upper and lower closures, when viewed as functions from the power set of X to itself, are examples of closure operators since they satisfy all of the Kuratowski closure axioms. As a result, the upper closure of a set is equal to the intersection of all upper sets containing it, and similarly for lower sets. (Indeed, this is a general phenomenon of closure operators. For example, the topological closure of a set is the intersection of all closed sets containing it; the span of a set of vectors is the intersection of all subspaces containing it; the subgroup generated by a subset of a group is the intersection of all subgroups containing it; the ideal generated by a subset of a ring is the intersection of all ideals containing it; and so on.)

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.

This article is derived from Wikipedia and licensed under CC BY-SA 4.0. View the original article.

Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc.
Bliptext is not affiliated with or endorsed by Wikipedia or the Wikimedia Foundation.

Edit article