Infimum and supremum

In mathematics, the infimum (abbreviated inf; plural infima) of a subset S of a partially ordered set T is the greatest element in T that is less than or equal to all elements of S, if such an element exists.[1] Consequently, the term greatest lower bound (abbreviated as GLB) is also commonly used.[1]

A set T of real numbers (hollow and filled circles), a subset S of T (filled circles), and the infimum of S. Note that for finite, totally ordered sets the infimum and the minimum are equal.

A set A of real numbers (blue circles), a set of upper bounds of A (red diamond and circles), and the smallest such upper bound, that is, the supremum of A (red diamond).

The supremum (abbreviated sup; plural suprema) of a subset S of a partially ordered set T is the least element in T that is greater than or equal to all elements of S, if such an element exists.[1] Consequently, the supremum is also referred to as the least upper bound (or LUB).[1]

The infimum is in a precise sense dual to the concept of a supremum. Infima and suprema of real numbers are common special cases that are important in analysis, and especially in Lebesgue integration. However, the general definitions remain valid in the more abstract setting of order theory where arbitrary partially ordered sets are considered.

The concepts of infimum and supremum are similar to minimum and maximum, but are more useful in analysis because they better characterize special sets which may have no minimum or maximum. For instance, the positive real numbers ℝ⁺ (not including 0) does not have a minimum, because any given element of ℝ⁺ could simply be divided in half resulting in a smaller number that is still in ℝ⁺. There is, however, exactly one infimum of the positive real numbers: 0, which is smaller than all the positive real numbers and greater than any other real number which could be used as a lower bound.

Formal definition

supremum = least upper bound

A lower bound of a subset S of a partially ordered set (P,≤) is an element a of P such that

a ≤ x for all x in S.

A lower bound a of S is called an infimum (or greatest lower bound, or meet) of S if

for all lower bounds y of S in P, y ≤ a (a is larger than or equal to any other lower bound).

Similarly, an upper bound of a subset S of a partially ordered set (P,≤) is an element b of P such that

b ≥ x for all x in S.

An upper bound b of S is called a supremum (or least upper bound, or join) of S if

for all upper bounds z of S in P, z ≥ b (b is less than any other upper bound).

Existence and uniqueness

Infima and suprema do not necessarily exist. Existence of an infimum of a subset S of P can fail if S has no lower bound at all, or if the set of lower bounds does not contain a greatest element. However, if an infimum or supremum does exist, it is unique.

Consequently, partially ordered sets for which certain infima are known to exist become especially interesting. For instance, a lattice is a partially ordered set in which all nonempty finite subsets have both a supremum and an infimum, and a complete lattice is a partially ordered set in which all subsets have both a supremum and an infimum. More information on the various classes of partially ordered sets that arise from such considerations are found in the article on completeness properties.

If the supremum of a subset S exists, it is unique. If S contains a greatest element, then that element is the supremum; otherwise, the supremum does not belong to S (or does not exist). Likewise, if the infimum exists, it is unique. If S contains a least element, then that element is the infimum; otherwise, the infimum does not belong to S (or does not exist).

Relation to maximum and minimum elements

The infimum of a subset S of a partially ordered set P, assuming it exists, does not necessarily belong to S. If it does, it is a minimum or least element of S. Similarly, if the supremum of S belongs to S, it is a maximum or greatest element of S.

For example, consider the set of negative real numbers (excluding zero). This set has no greatest element, since for every element of the set, there is another, larger, element. For instance, for any negative real number x, there is another negative real number ${\tfrac {x}{2}}$ , which is greater. On the other hand, every real number greater than or equal to zero is certainly an upper bound on this set. Hence, 0 is the least upper bound of the negative reals, so the supremum is 0. This set has a supremum but no greatest element.

However, the definition of maximal and minimal elements is more general. In particular, a set can have many maximal and minimal elements, whereas infima and suprema are unique.

Whereas maxima and minima must be members of the subset that is under consideration, the infimum and supremum of a subset need not be members of that subset themselves.

Minimal upper bounds

Finally, a partially ordered set may have many minimal upper bounds without having a least upper bound. Minimal upper bounds are those upper bounds for which there is no strictly smaller element that also is an upper bound. This does not say that each minimal upper bound is smaller than all other upper bounds, it merely is not greater. The distinction between "minimal" and "least" is only possible when the given order is not a total one. In a totally ordered set, like the real numbers, the concepts are the same.

As an example, let S be the set of all finite subsets of natural numbers and consider the partially ordered set obtained by taking all sets from S together with the set of integers ℤ and the set of positive real numbers ℝ⁺, ordered by subset inclusion as above. Then clearly both ℤ and ℝ⁺ are greater than all finite sets of natural numbers. Yet, neither is ℝ⁺ smaller than ℤ nor is the converse true: both sets are minimal upper bounds but none is a supremum.

Least-upper-bound property

The least-upper-bound property is an example of the aforementioned completeness properties which is typical for the set of real numbers. This property is sometimes called Dedekind completeness.

If an ordered set S has the property that every nonempty subset of S having an upper bound also has a least upper bound, then S is said to have the least-upper-bound property. As noted above, the set ℝ of all real numbers has the least-upper-bound property. Similarly, the set ℤ of integers has the least-upper-bound property; if S is a nonempty subset of ℤ and there is some number n such that every element s of S is less than or equal to n, then there is a least upper bound u for S, an integer that is an upper bound for S and is less than or equal to every other upper bound for S. A well-ordered set also has the least-upper-bound property, and the empty subset has also a least upper bound: the minimum of the whole set.

An example of a set that lacks the least-upper-bound property is ℚ, the set of rational numbers. Let S be the set of all rational numbers q such that q² < 2. Then S has an upper bound (1000, for example, or 6) but no least upper bound in ℚ: If we suppose p ∈ ℚ is the least upper bound, a contradiction is immediately deduced because between any two reals x and y (including √2 and p) there exists some rational p′, which itself would have to be the least upper bound (if p > √2) or a member of S greater than p (if p < √2). Another example is the hyperreals; there is no least upper bound of the set of positive infinitesimals.

There is a corresponding 'greatest-lower-bound property'; an ordered set possesses the greatest-lower-bound property if and only if it also possesses the least-upper-bound property; the least-upper-bound of the set of lower bounds of a set is the greatest-lower-bound, and the greatest-lower-bound of the set of upper bounds of a set is the least-upper-bound of the set.

If in a partially ordered set P every bounded subset has a supremum, this applies also, for any set X, in the function space containing all functions from X to P, where f ≤ g if and only if f(x) ≤ g(x) for all x in X. For example, it applies for real functions, and, since these can be considered special cases of functions, for real n-tuples and sequences of real numbers.

The least-upper-bound property is an indicator of the suprema.

Infima and suprema of real numbers

In analysis, infima and suprema of subsets S of the real numbers are particularly important. For instance, the negative real numbers do not have a greatest element, and their supremum is 0 (which is not a negative real number).[1] The completeness of the real numbers implies (and is equivalent to) that any bounded nonempty subset S of the real numbers has an infimum and a supremum. If S is not bounded below, one often formally writes inf(S) = −∞. If S is empty, one writes inf(S) = +∞.

Properties

The following formulas depend on a notation that conveniently generalizes arithmetic operations on sets: Let the sets $A, B \subseteq ℝ,$ and scalar $λ \in ℝ$ . Define

$λ\cdotA = {λ\cdota : a \in A};$ the scalar product of a set is just the scalar multiplied by every element in the set.
$A + B = {a + b : a \in A, b \in B};$ the arithmetic sum of two sets is the sum of all possible pairs of numbers, one from each set.
$A\cdotB = {a\cdotb : a \in A, b \in B};$ the arithmetic product of two sets is all products of pairs of elements, one from each set.

In those cases where the infima and suprema of the sets $A$ and $B$ exist, the following identities hold:

$p = inf A$ if and only if for every $ε > 0$ there is an $x \in A$ with $x < p + ε$ , and $x \geq p$ for every $x \in A$ .
$p = sup A$ if and only if for every $ε > 0$ there is an $x \in A$ with $x > p - ε,$ and $x \leq p$ for every $x \in A .$
If $A \subseteq B$ then $inf A \geq inf B$ and $sup A \leq sup B .$

If $λ \geq 0,$ then $inf (λ\cdotA) = λ \cdot( inf A)$ and $sup (λ\cdotA) = λ \cdot( sup A).$
If $λ \leq 0,$ then $inf (λ\cdotA) = λ \cdot( sup A)$ and $sup (λ\cdotA) = λ \cdot( inf A).$
$inf (A + B) = ( inf A) + ( inf B),$ and $sup (A + B) = ( sup A) + ( sup B).$
If $A, B$ are nonempty sets of positive real numbers then $inf (A\cdotB) = ( inf A)\cdot( inf B);$ similarly for suprema.[2]

Duality

If one denotes by P^op the partially-ordered set P with the opposite order relation, i.e.

x ≤ y in P^op if and only if x ≥ y in P,

then infimum of a subset S in P equals the supremum of S in P^op and vice versa.

For subsets of the real numbers, another kind of duality holds: inf S = −sup(−S), where −S = { −s | s ∈ S }.

Examples

Infima

The infimum of the set of numbers ${2, 3, 4}$ is $2$ . The number $1$ is a lower bound, but not the greatest lower bound, and hence not the infimum.
More generally, if a set has a smallest element, then the smallest element is the infimum for the set. In this case, it is also called the minimum of the set.
$\inf\{1,2,3,\ldots \}=1.$
$\inf\{x\in \mathbb {R} \mid 0<x<1\}=0.$
$\inf \left\{x\in \mathbb {Q} \mid x^{3}>2\right\}={\sqrt[{3}]{2}}.$
$\inf \left\{(-1)^{n}+{\tfrac {1}{n}}\mid n=1,2,3,\ldots \right\}=-1.$
If $x n$ is a decreasing sequence with limit $x$ , then $inf x n = x$ .

Suprema

The supremum of the set of numbers ${1, 2, 3}$ is $3$ . The number $4$ is an upper bound, but it is not the least upper bound, and hence is not the supremum.
$\sup\{x\in \mathbb {R} \mid 0<x<1\}=\sup\{x\in \mathbb {R} \mid 0\leq x\leq 1\}=1.$
$\sup \left\{(-1)^{n}-{\tfrac {1}{n}}\mid n=1,2,3,\ldots \right\}=1.$
$\sup\{a+b\mid a\in A,b\in B\}=\sup A+\sup B.$
$\sup\{x\in \mathbb {Q} \mid x^{2}<2\}={\sqrt {2}}.$

In the last example, the supremum of a set of rationals is irrational, which means that the rationals are incomplete.

One basic property of the supremum is

\sup\{f(t)+g(t)\mid t\in A\}\leq \sup\{f(t)\mid t\in A\}+\sup\{g(t)\mid t\in A\}

for any functionals f and g.

The supremum of a subset S of (ℕ,|) where | denotes "divides", is the lowest common multiple of the elements of S.

The supremum of a subset S of (P,⊆), where P is the power set of some set, is the supremum with respect to ⊆ (subset) of a subset S of P is the union of the elements of S.

gollark: I told it "Beware apioforms." and:> Beware apioforms. We have more than 90% reliable.<|endoftext|>oh no.<|endoftext|>hd!histohist Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson Gibson

gollark: It's the library I'm using to train Gollarious GPT-2/mgollark with no actual AI knowledge.

gollark: Bad?

gollark: Gollarious NN data and usage instructions (it's basically trivial because someone else did all the work) available on request.

gollark: I KNEW Scala was a lie perpetuated by Java users in denial.

References

Rudin, Walter (1976). ""Chapter 1 The Real and Complex Number Systems"". Principles of Mathematical Analysis ("print") (3rd ed.). McGraw-Hill. p. 4. ISBN 0-07-054235-X.
Zakon, Elias (2004). Mathematical Analysis I. Trillia Group. pp. 39–42.

External links

"Upper and lower bounds", Encyclopedia of Mathematics, EMS Press, 2001 [1994]
Breitenbach, Jerome R. and Weisstein, Eric W. "Infimum and supremum". MathWorld.CS1 maint: multiple names: authors list (link)

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[BabyRudin-1] Rudin, Walter (1976). ""Chapter 1 The Real and Complex Number Systems"". Principles of Mathematical Analysis ("print") (3rd ed.). McGraw-Hill. p. 4. ISBN 0-07-054235-X.

[2] Zakon, Elias (2004). Mathematical Analysis I. Trillia Group. pp. 39–42.