Order, lattices, ordered algebraic structures Binary relations and basic order notions Concept
Upper bound
Summary
Let be a subset of a partially ordered set. An upper bound of is an element that is at least as large as each element of .
Where this leads
3 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Upper_and_lower_bounds, lead section
About this page
| Tag | 0S60DVMVPN |
|---|---|
| URI | m2://0S60DVMVPN |
| Aliases | lower-bound, bounded-above |
| Kind | concept |
| Writing | W1 stated |
| MSC | 06A06 |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.