Math 2.0

Order, lattices, ordered algebraic structures Lattices: basic notions Concept

Bounded lattice

Summary

A bounded lattice is a lattice with a greatest element 11 and a least element 00. These elements are the identities for the meet and the join: x∧1=xx \wedge 1 = x and x∨0=xx \vee 0 = x. Every finite nonempty lattice is bounded, and bounded lattices are the setting for complements, atoms and Boolean algebras.

Where this leads

5 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Bounded_lattice
About this page
Tag72V1Z82M5F
URIm2://72V1Z82M5F
Kindconcept
WritingW0 stub
MSC06B05
SpecializesLattice
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by

Definitions

Special cases