Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Infimum and supremum
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
=== Suprema === * The supremum of the set of numbers <math>\{1, 2, 3\}</math> is <math>3.</math> The number <math>4</math> is an upper bound, but it is not the least upper bound, and hence is not the supremum. * <math>\sup \{ x \in \R : 0 < x < 1\} = \sup \{ x \in \R : 0 \leq x \leq 1\} = 1.</math> * <math>\sup \left\{ (-1)^n - \tfrac{1}{n} : n = 1, 2, 3, \ldots \right\} = 1.</math> * <math>\sup \{ a + b : a \in A, b \in B \} = \sup A + \sup B.</math> * <math>\sup \left\{ x \in \Q : x^2 < 2 \right\} = \sqrt{2}.</math> In the last example, the supremum of a set of [[Rational number|rationals]] is [[Irrational number|irrational]], which means that the rationals are [[Complete space|incomplete]]. One basic property of the supremum is <math display=block>\sup \{ f(t) + g(t) : t \in A \} ~\leq~ \sup \{ f(t) : t \in A \} + \sup \{ g(t) : t \in A \}</math> for any [[Functional (mathematics)|functionals]] <math>f</math> and <math>g.</math> The supremum of a subset <math>S</math> of <math>(\N, \mid\,)</math> where <math>\,\mid\,</math> denotes "[[Divisor|divides]]", is the [[lowest common multiple]] of the elements of <math>S.</math> The supremum of a set <math>S</math> containing subsets of some set <math>X</math> is the [[Union (set theory)|union]] of the subsets when considering the partially ordered set <math>(P(X), \subseteq)</math>, where <math>P</math> is the [[power set]] of <math>X</math> and <math>\,\subseteq\,</math> is [[subset]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)