Order, lattices, ordered algebraic structures Definition
Upper set
Builds on Partial orderSubset
Definition
Let be a partially ordered set and let be a subset of . The set is an upper set when, for all , if and , then . Dually, a subset of is a lower set when, for all , if and , then .
Remarks
In , the set is an upper set: if and , then . The set of even numbers is not an upper set of , since is in it, , and is not. A subset is an upper set if and only if its complement is a lower set. Unions and intersections of any family of upper sets are upper sets. Other names are up-set and upward closed set for upper sets, and down-set, decreasing set and order ideal for lower sets. The smallest lower set containing a subset is its down-closure.
Reading path
To understand this page from the ground up, read these 16 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Antisymmetric relation definition
- Reflexive relation definition
- Transitive relation definition
- Preorder definition
- Partial order definition
- Upper set definition
Where this leads
2 pages build on this one.
Further reading
About this page
| Tag | BWYFKCWRW5 |
|---|---|
| URI | m2://BWYFKCWRW5 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06A06 |
| Defines | Upper set |
| Uses | Partial order, Subset |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.