From Surf Wiki (app.surf) — the open knowledge base
Pseudoideal
In the theory of partially ordered sets, a pseudoideal is a subset characterized by a bounding operator LU.
Basic definitions
LU(A) is the set of all lower bounds of the set of all upper bounds of the subset A of a partially ordered set.
A subset I of a partially ordered set (P, ≤) is a Doyle pseudoideal, if the following condition holds:
For every finite subset S of P that has a supremum in P, if S\subseteq I then \operatorname{LU}(S)\subseteq I.
A subset I of a partially ordered set (P, ≤) is a pseudoideal, if the following condition holds:
For every subset S of P having at most two elements that has a supremum in P, if S \subseteq I then LU(S) \subseteq I.
Remarks
- Every Frink ideal I is a Doyle pseudoideal.
- A subset I of a lattice (P, ≤) is a Doyle pseudoideal if and only if it is a lower set that is closed under finite joins (suprema).
References
- Abian, A., Amin, W. A. (1990) "Existence of prime ideals and ultrafilters in partially ordered sets", Czechoslovak Math. J., 40: 159–163.
- Doyle, W.(1950) "An arithmetical theorem for partially ordered sets", Bulletin of the American Mathematical Society, 56: 366.
- Niederle, J. (2006) "Ideals in ordered sets", Rendiconti del Circolo Matematico di Palermo 55: 287–295.
This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page.
Ask Mako anything about Pseudoideal — get instant answers, deeper analysis, and related topics.
Research with MakoFree with your Surf account
Create a free account to save articles, ask Mako questions, and organize your research.
Sign up freeThis content may have been generated or modified by AI. CloudSurf Software LLC is not responsible for the accuracy, completeness, or reliability of AI-generated content. Always verify important information from primary sources.
Report