bn:13919837n
Noun Concept
Categories: Order theory
EN
infimum and supremum  supremum  greatest lower bound  infima  infima and suprema
EN
In mathematics, the infimum of a subset S {\displaystyle S} of a partially ordered set P {\displaystyle P} is the greatest element in P {\displaystyle P} that is less than or equal to each element of S, {\displaystyle S,} if such an element exists. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, the infimum of a subset S {\displaystyle S} of a partially ordered set P {\displaystyle P} is the greatest element in P {\displaystyle P} that is less than or equal to each element of S, {\displaystyle S,} if such an element exists. Wikipedia
When it exists, the least element of a partially ordered set which is greater than or equal to all elements; the least of majoring elements of a set in itself Wikidata
least (resp. greatest) of majoring (resp. minoring) elements of a partially ordered set (not necessarily existing in all sets) Wikidata