Order, lattices, ordered algebraic structures Definition
Pseudocomplement
Builds on Lattice
Definition
Let be a lattice with a least element , and let . An element is a pseudocomplement of if for every , The lattice is pseudocomplemented if every element has a pseudocomplement.
Remarks
Equivalently, is the greatest element of the set , so it is unique when it exists. In a pseudocomplemented lattice, and for all .
Example: the open sets of a topological space , ordered by inclusion. For an open set , put . An open set satisfies exactly when , that is, when , since is open.
Non-example: in the diamond lattice with atoms , the element has no pseudocomplement. The elements with are , and , and this set has no greatest element, since and .
Reading path
To understand this page from the ground up, read these 2 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Lattice concept
- Pseudocomplement definition
Further reading
About this page
| Tag | WXNCE8W5Q2 |
|---|---|
| URI | m2://WXNCE8W5Q2 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06D15 |
| Defines | Pseudocomplement |
| Uses | Lattice |
| Changed | 2 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
No page links to this page yet.