A function between posets and is said to preserve suprema (joins), if, for all subsets of that have a supremum sup in , we find that sup{(): in } exists and is equal to (sup ). Such a function is also called join-preserving. Analogously, one says that preserves finite, non-empty, directed, or arbitrary joins (or meets). The converse property is called join-reflecting.