Math 2.0

Order, lattices, ordered algebraic structures Definition

Set bounded above

Definition

Let (P,≤)(P, \le) be a partially ordered set and let SS be a subset of PP. An element MM of PP is an upper bound of SS when s≤Ms \le M for each ss in SS. The set SS is bounded above when it has at least one upper bound in PP. Similarly, mm is a lower bound of SS when m≤sm \le s for each ss in SS. The set SS is bounded below when it has a lower bound.

Remarks

In ℝ\mathbb{R}, the interval [0,1)[0, 1) is bounded above. Each number M≥1M \ge 1 is an upper bound. The set ℕ\mathbb{N} is not bounded above in ℝ\mathbb{R}, by the Archimedean property. An upper bound of SS does not need to be an element of SS.

Where this leads

418 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Upper_and_lower_bounds, lead section
About this page
Tag0B5H2V4JW8
URIm2://0B5H2V4JW8
Kinddefinition
WritingW0 stub
MSC06A06
DefinesSet bounded above

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by