Math 2.0

Real functions Proposition

Approximation property of the supremum

Builds on SupremumCompleteness axiom

Statement

Let SS be a nonempty subset of the real numbers that is bounded above, and let b=sup⁡Sb = \sup S be its supremum. For each real number c<bc < b, there is an element ss of SS with c<s≤bc < s \le b.

Remarks

Proof: if no such ss exists, then cc is an upper bound of SS that is less than bb. This contradicts the definition of the supremum. An equivalent form: for each ε>0\varepsilon > 0, there is ss in SS with b−ε<sb - \varepsilon < s. For an infimum a=inf⁡Sa = \inf S and each c>ac > a, there is ss in SS with a≤s<ca \le s < c.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Real numbers object
  2. Set bounded above definition
  3. Supremum definition
  4. Completeness axiom statement
  5. Approximation property of the supremum statement

Further reading

  1. Web https://en.wikipedia.org/wiki/Infimum_and_supremum, Identifying infima and suprema
About this page
Tag0M8TGGP9JP
URIm2://0M8TGGP9JP
Kindstatement, proposition
WritingW0 stub
MSC26A03
StatusThis copy of the site has no build data. Run m2 status 0M8TGGP9JP.
UsesSupremum, Completeness axiom

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

No page links to this page yet.