Prime (order theory)
From HandWiki
In mathematics, an element p of a partial order (P, ≤) is a meet prime element when p is the principal element of a principal prime ideal. Equivalently, if P is a lattice, p ≠ top, and for all a, b in P,
- a∧b ≤ p implies a ≤ p or b ≤ p.
See also
References
- Roman, Steven (2008), Lattices and ordered sets, New York: Springer, p. 50, ISBN 978-0-387-78900-2, https://books.google.com/books?id=NZN8aum26LgC&pg=PA50.
 |  |
