Complete lattice
id:
complete-lattice-173-10207783
title:
Complete lattice
text:
In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). A conditionally complete lattice satisfies at least one of these properties for bounded subsets. For comparison, in a general lattice, only pairs of elements need to have a supremum and an infimum. Every non-empty finite lattice is complete, but infinite lattices may be incomplete. Complete lattices appear in many applications in mathematics and computer science.
brand slug:
wiki
category slug:
encyclopedia
description:
Partially ordered set in which all subsets have both a supremum and infimum
original url:
https://en.wikipedia.org/wiki/Complete_lattice
date created:
2002-03-18T07:00:38Z
date modified:
2024-09-02T09:07:54Z
main entity:
{"identifier":"Q2362924","url":"https://www.wikidata.org/entity/Q2362924"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/7/76/Subgroup_Lattice_of_D4.png","width":1546,"height":847}
fields total:
13
integrity:
16