PlanetMath (more info)
 Math for the people, by the people. Sponsor PlanetMath
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
Owner confidence rating: Medium Entry average rating: High
infimum (Definition)

The infimum of a set $S$ is the greatest lower bound of $S$ and is denoted $\inf(S)$

Let $A$ be a set with a partial order $\leq$ and let $S \subseteq A$ For any $x \in A$ $x$ is a lower bound of $S$ if $x \leq y$ for any $y \in S$ The infimum of $S$ denoted $\inf(S)$ is the greatest such lower bound; that is, if $b$ is a lower bound of $S$ then $b \leq \inf(S)$

Note that it is not necessarily the case that $\inf(S) \in S$ Suppose $S = (0, 1)$ then $\inf(S) = 0$ but $0 \not\in S$

Also note that a set does not necessarily have an infimum. See the attachments to this entry for examples.




"infimum" is owned by vampyr. [ full author list (2) ]
(view preamble | get metadata)

View style:

See Also: supremum, Lebesgue outer measure, minimal and maximal number, infimum and supremum for real numbers, limit of nondecreasing sequence

Keywords:  real analysis

Attachments:
sets that do not have an infimum (Example) by sleske
Log in to rate this entry.
(view current ratings)

Cross-references: lower bound, partial order, greatest lower bound
There are 15 references to this entry.

This is version 6 of infimum, born on 2001-10-18, modified 2008-06-29.
Object id is 339, canonical name is Infimum.
Accessed 16422 times total.

Classification:
AMS MSC06A06 (Order, lattices, ordered algebraic structures :: Ordered sets :: Partial order, general)

Pending Errata and Addenda
None.
[ View all 4 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)