×

Weak relative pseudo-complements of closure operators. (English) Zbl 0901.06003

Let \(\mathcal L=\langle L,\leq ,\wedge \rangle \) be a meet semilattice, \(x\), \(y\in L\), \(y\leq x.\) A weak relative pseudocomplement of \(x\) w.r.t. \(y,\) if it exists, is the unique element \(\operatorname {wr}(x,y)\in L\) s.t.
{(i)} \(x\wedge \big (\operatorname {wr}(x,y)\big)=y\)
{(ii)} for each \(z\in L,\) if \(x\wedge z=y,\) then \(z\leq \operatorname {wr}(x,y).\)
This notion is strictly weaker than relative pseudocomplement and stronger than pseudocomplement. For a complete lattice \(\mathcal L\) an upper closure operator on \(\mathcal L\) is a mapping \(\rho \: L\to L\) s.t. \(x\leq \rho (x)\), \(\rho \big (\rho (x)\big)=\rho (x)\) and \(x\leq y\Rightarrow \rho (x) \leq \rho (y).\) Now \(\rho \) is called continuous if \(\rho (\vee C)=\vee \rho (c)\) for any chain \(C\) in \(L.\) The set \(\operatorname {uco} (\mathcal L)\) of all closure operators form a complete lattice with respect to the natural pointwise ordering \(\sqsubseteq .\) The main result is the following Theorem: If \(\mathcal L\) is a complete, meet-continuous lattice, then for all \(\rho \), \(\eta \in \operatorname {uco} (\mathcal L)\) such that \(\eta \sqsubseteq \rho \) and \(\eta \) is continuous, there exists \(\operatorname {wr}(\rho ,\eta).\)
Reviewer: R.Halaš (Olomouc)

MSC:

06A15 Galois correspondences, closure operators (in relation to ordered sets)
06B23 Complete lattices, completions
06A12 Semilattices
06D15 Pseudocomplemented lattices
PDF BibTeX XML Cite
Full Text: DOI

References:

[1] Birkhoff, G.,Lattice Theory. AMS Colloquium Publications vol. XXV, 3rd edition, 1967.
[2] Cortesi, A.,Fil?, G.,Giacobazzi, R.,Palamidessi, C. andRanzato, F.,Complementation in abstract interpretation. In A. Mycroft, ed.,Proc. of the 2nd Static Analysis Symposium, Lecture Notes in Computer Science 983, pp. 100-117. Springer Verlag, 1995.
[3] Cousot, P. andCousot, R.,Systematic design of program analysis frameworks. InConference Record of the 6th ACM Symposium on Principles of Programming Languages, pp. 269-282. ACM Press, 1979.
[4] Dwinger, P.,On the closure operators of a complete lattice. Indagationes Math.,16 (1954), 560-563. · Zbl 0056.26204
[5] Gierz, G.,Hofmann, K. H.,Keimel, K.,Lawson, J. D.,Mislove, M. andScott, D. S.,A Compendium of Continuous Lattices. Springer Verlag, 1980. · Zbl 0452.06001
[6] Morgado, J.,On complete congruences of complete lattices. Portugal. Math.,21 (1) (1962), 11-25. · Zbl 0107.25303
[7] Morgado, J.,Note on complemented closure operators of complete lattices. Portugal. Math.,21 (3) (1962), 135-142. · Zbl 0107.25302
[8] Varlet, J.,Contribution ? l’?tude des treillis pseudo-compl?ment?s et des treillis de Stone. M?moires de la Soci?t? Royale des Sciences de Li?ge, 5eme s?rie,8(4), 71 pages, 1963.
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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.