Prime (order theory)
(Redirected from Prime (order theroy))
 | This article relies largely or entirely on a single source. (May 2024) |
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
[edit]References
[edit]- Roman, Steven (2008), Lattices and ordered sets, New York: Springer, p. 50, ISBN 978-0-387-78900-2, MR 2446182.
 | This algebra-related article is a stub. You can help Wikipedia by expanding it. |