Order, lattices, ordered algebraic structures Definition
Join-irreducible element
Builds on LatticeJoin and meetLeast element
Definition
Let be a lattice. An element is join-irreducible if:
- is not a least element of ;
- for all , if , then or .
An element is meet-irreducible if it satisfies the dual conditions, with the greatest element and the meet.
Remarks
Clause 2 says that is not the join of two elements strictly below it. Example: in the power set of a set , each singleton is join-irreducible. It is not , and if then or contains , so it equals . Non-example: with and , so clause 2 fails. In a chain, every element other than the least element is join-irreducible, since . In a finite lattice, every element is the join of the join-irreducible elements below it.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Join and meet concept
- Lattice concept
- Least element concept
- Join-irreducible element definition
Further reading
About this page
| Tag | CZ6ABG86WY |
|---|---|
| URI | m2://CZ6ABG86WY |
| Kind | definition |
| Writing | W0 stub |
| MSC | 06B05 |
| Defines | Join-irreducible element |
| Uses | Lattice, Join and meet, Least element |
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.