Order, lattices, ordered algebraic structures Definition
Co-Heyting algebra
Builds on Bounded latticeHeyting algebra
Definition
Let be a bounded lattice with order . A co-Heyting algebra structure on is a binary operation on such that for all , So is the least element with . A co-Heyting algebra is a bounded lattice with such an operation.
Remarks
The operation is unique when it exists, since it is a least element. A bounded lattice is a co-Heyting algebra if and only if its order dual is a Heyting algebra. The element is called the supplement of ; it is the least with .
Example: let be a topological space and its family of closed sets, ordered by inclusion. For closed , put , the closure of the set difference. If with closed, then , so . If , then . So the defining equivalence holds.
Non-example: the diamond lattice , with atoms , is bounded but has no such operation. Every co-Heyting algebra is distributive, and is not, since while . Directly: the elements with are , and , and they have no least one.
In Mathlib the notion is CoheytingAlgebra, with difference \ and supplement ¬.
Reading path
To understand this page from the ground up, read these 3 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Bounded lattice concept
- Heyting algebra concept
- Co-Heyting algebra definition
Further reading
About this page
| Tag | 3H5SDW6JTX |
|---|---|
| URI | m2://3H5SDW6JTX |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06D20, 03G10 |
| Defines | Co-Heyting algebra |
| Uses | Bounded lattice, Heyting algebra |
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.