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!
== Existence and uniqueness == Infima and suprema do not necessarily exist. Existence of an infimum of a subset <math>S</math> of <math>P</math> can fail if <math>S</math> has no lower bound at all, or if the set of lower bounds does not contain a greatest element. (An example of this is the subset <math>\{ x \in \mathbb{Q} : x^2 < 2 \}</math> of <math>\mathbb{Q}</math>. It has upper bounds, such as 1.5, but no supremum in <math>\mathbb{Q}</math>.) Consequently, partially ordered sets for which certain infima are known to exist become especially interesting. For instance, a [[Lattice (order)|lattice]] is a partially ordered set in which all {{em|nonempty finite}} subsets have both a supremum and an infimum, and a [[complete lattice]] is a partially ordered set in which {{em|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 (order theory)|completeness properties]]. If the supremum of a subset <math>S</math> exists, it is unique. If <math>S</math> contains a greatest element, then that element is the supremum; otherwise, the supremum does not belong to <math>S</math> (or does not exist). Likewise, if the infimum exists, it is unique. If <math>S</math> contains a least element, then that element is the infimum; otherwise, the infimum does not belong to <math>S</math> (or does not exist).
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)