summaryrefslogtreecommitdiffstats
path: root/content/zettel/2e1a1.md
blob: c6ec0d9c81e11433c001ea9b410e69fb8ba5f65f (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
+++
title = "Semilattice"
author = "Yann Herklotz"
tags = []
categories = []
backlinks = ["2e1a"]
forwardlinks = []
zettelid = "2e1a1"
+++

-   partially ordered set that has either a join or a meet
-   There are join-semilattice (least upper bound, supremum)
-   There are meet-semilattice (greatest lower bound, infimum)
-   a lattice is both a meet-semilattice and a join-semilattice
-   A set with finite elements is always a lattice, because if we take
    two distinct elements, one will be the least element (join) and the
    other will be most element (meet)