×

Semiprime ideals and separation theorems for posets. (English) Zbl 1155.06003

Let \(P\) be a poset and let \(A\) be a subset of \(P\). Define \(A^{u}:=\{x\in P : x\geq a \text{ for every } a\in A\}\). Dually define \(A^{l}:=\{x\in P : x\leq a \text{ for every } a\in A\}\). Then \(A^{ul}\) means \(\{A^{u}\}^l\) and \(A^{lu}\) means \(\{A^{l}\}^u\).
A subset \(I\) of \(P\) is called an ideal if \(a,b\in I\) implies that \(\{a,b\}^{ul}\subseteq I\). A proper ideal \(I\) is called prime if \(\{a,b\}^{l}\subseteq I\) implies that either \(a\in I\) or \(b\in I\). Dually define filter and prime filter. These notions are due, respectively, to R. Halaš [“Characterization of distributive sets by generalized annihilators”, Arch. Math., Brno 30, No. 1, 25–27 (1994; Zbl 0805.06001)] and R. Halaš and J. Rachůnek [“Polars and prime ideals in ordered sets”, Discuss. Math., Algebra Stoch. Methods 15, No. 1, 43–59 (1995; Zbl 0840.06003)].
In [“The theory of representations for Boolean algebras”, Trans. Am. Math. Soc. 40, 37–111 (1936; Zbl 0014.34002 and JFM 62.0033.04)], M. H. Stone proved a separation theorem in the case of distributive lattices: Let \(L\) be a distributive lattice, let \(I\) be an ideal, let \(D\) be a filter of \(L\) such that \(I\cap D=\emptyset\). Then there exists a prime ideal \(P\) of \(L\) such that \(I\subseteq P\) and \(P\cap D=\emptyset\).
In [“Semiprime ideals in general lattices”, J. Pure Appl. Algebra 56, No. 2, 105–118 (1989; Zbl 0665.06006)], Y. Rav proved an analogue of Stone’s Theorem for semiprime ideals in lattices. An ideal \(I\) of a lattice \(L\) is semiprime if \(x\wedge y\in I\) and \(x\wedge z\in I\) together imply \(x\wedge(y\vee z)\).
In the paper under review the authors generalize the notion of semiprime ideal in lattices to posets as follows. An ideal \(I\) of a poset \(P\) is semiprime if \(\{a,b\}^{l}\subseteq I\) and \(\{a,c\}^{l}\subseteq I\) together imply \(\{a,\{b,c\}^{u}\}^{l}\subseteq I\). The authors then prove theorems analoguous to Stone’s and Rav’s in finite posets. The authors observe by means of counterexamples that their results do not extend to infinite posets.

MSC:

06A06 Partial orders, general
Full Text: DOI

References:

[1] Frink, O.: Ideals in partially ordered sets. Amer. Math. Monthly 61, 223–234(1954) · Zbl 0055.25901 · doi:10.2307/2306387
[2] Grätzer, G.: General Lattice Theory, 2nd edn. Birkhauser Verlag (1998) · Zbl 0909.06002
[3] Halas, R.: Characterization of distributive sets by generalized annihilators. Arch. Math. (Brno) 30, 25–27 (1994) · Zbl 0805.06001
[4] Halas, R.: Decomposition of directed sets with zero. Math. Slovaca 45(1), 9–17 (1995)
[5] Halas, R., Rachunek, J.: Polars and prime ideals in ordered sets. Discussiones Mathematicae, Algebra and Stochastic Methods 15, 43–50 (1995)
[6] Kharat, V.S., Mokbel, K.A.: Primeness and semiprimeness in posets. Math. Bohem. (in press) · Zbl 1212.06001
[7] Krull, W.: Idealtheorie in Ringen ohne Endlichke-itsbedingungen. Math. Ann. 101, 729–751 (1929) · JFM 55.0681.01 · doi:10.1007/BF01454872
[8] Larmerová, J., Rachunek, J.: Translations of modular and distributive ordered sets. Acta Univ. Palack. Olomouc, Fac. Rer. Nat. 91, Math. 27, 13–23 (1988) · Zbl 0693.06003
[9] MacNeille, H.: Partially ordered sets. Trans. Amer. Math. Soc. 42, 416–460 (1937) · Zbl 0017.33904 · doi:10.1090/S0002-9947-1937-1501929-X
[10] Rav, Y.: Semiprime ideals in general lattices. J. Pure Appl. Algebra, 56, 105–118 (1989) · Zbl 0665.06006 · doi:10.1016/0022-4049(89)90140-0
[11] Stone, M.H.: The theory of representations for Boolean algebras. Trans. Amer. Math. Soc. 40, 37–111 (1936) · Zbl 0014.34002
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.