jaj•a•person's notes

  • Complete lattice

Poset

Complete lattice

A complete lattice is a poset for which the least upper bound or join and the greatest upper bound or meet exists for any arbitrary collection of elements, order whereas for a Lattice order these need only exist for pairs of elements. Viewed as a Posetal category, all Products and coproducts exist.


develop | en | sembr


Graph View

Backlinks

  • Dedekind-MacNeille completion
  • Every vector space has a basis
  • Lattice order
  • Vector subspace

Created with Quartz v4.5.2 © 2026