Statements (24)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
supremum
least upper bound |
| gptkbp:appliesTo |
lattice
partially ordered set |
| gptkbp:category |
gptkb:algebra
|
| gptkbp:defines |
The least element that is greater than or equal to each element of a subset in a partially ordered set.
|
| gptkbp:field |
gptkb:Order_theory
Lattice theory |
| gptkbp:hasDual |
Meet (infimum, ∧)
|
| https://www.w3.org/2000/01/rdf-schema#label |
Join (supremum, ∨)
|
| gptkbp:notation |
sup A
∨_{i∈I} a_i |
| gptkbp:property |
may not exist for all subsets
unique if it exists |
| gptkbp:relatedTo |
least element
upper bound |
| gptkbp:symbol |
∨
|
| gptkbp:usedIn |
gptkb:algebra
gptkb:Heyting_algebra complete lattice poset |
| gptkbp:bfsParent |
gptkb:Lattice_(order)
|
| gptkbp:bfsLayer |
8
|