Definition:Lattice/Definition 1

From ProofWiki
Jump to navigation Jump to search


Let $\left({S, \preceq}\right)$ be an ordered set.

Suppose that $S$ admits all finite non-empty suprema and finite non-empty infima.

Denote with $\vee$ and $\wedge$ the join and meet operations on $S$, respectively.

Then the ordered structure $\left({S, \vee, \wedge, \preceq}\right)$ is called a lattice.

Also see

  • Results about lattices can be found here.