Equational closure operator and forbidden semidistributive lattices

Dedicated to the memory of A. I. Mal'tsev.     

Valuations and closure operators on finite lattices

Let L be a lattice. A function f:L→R (usually called evaluation) is submodular if f(x∧y)+f(x∨y)≤f(x)+f(y), supermodular if f(x∧y)+f(x∨y)≥f(x)+f(y), and modular if it is both submodular and supermodular. Modular functions on a finite lattice form a finite dimensional vector space. For finite distributive lattices, we compute this (modular) dimension. This turns out to be another characterization of distributivity (Theorem 3.9). We also present a correspondence between isotone submodular evaluations and closure operators on finite lattices (Theorem 5.5). This interplay between closure operators and evaluations should be understood as building a bridge between qualitative and quantitative data analysis.     

Interior and closure operators on bounded residuated lattices

Bounded integral residuated lattices form a large class of algebras containing some classes of algebras behind many valued and fuzzy logics. In the paper we introduce and investigate multiplicative interior and additive closure operators (mi- and ac-operators) generalizing topological interior and closure operators on such algebras. We describe connections between mi- and ac-operators, and for residuated lattices with Glivenko property we give connections between operators on them and on the residuated lattices of their regular elements.     

Order topology in vector lattices with closure by one step

An order topology in vector lattices and Boolean algebras is studied under the additional condition of “closure by one step” that generalizes the well-known “regularity” property of Boolean algebras and K-spaces. It is proved that in a vector lattice or a Boolean algebra possessing such a property there exists a basis of solid neighborhoods of zero with respect to an order topology. An example of a Boolean algebra without basis of solid neighborhoods of zero (an algebra of regular open subsets of the interval (0, 1)) is given. Bibliography: 3 titles. Translated fromProblemy Matematicheskogo Analiza, No. 15 1995, pp. 213–220.     

Weakly unimodal domains,anti-exchange properties,and coalitional strategy-proofness of aggregation rules

It is shown that simple and coalitional strategy-proofness of an aggregation rule on any rich weakly unimodal domain of an idempotent interval space are equivalent properties if that space satisfies interval anti-exchange, a basic property also shared by a large class of convex geometries including–but not reducing to–trees and Euclidean convex spaces. Therefore, strategy-proof location problems in a vast class of networks fall under the scope of that proposition.It is also established that a much weaker minimalanti-exchangeproperty is necessary to ensure equivalence of simple and coalitional strategy-proofness in that setting. An immediate corollary to that result is that such equivalence fails to hold both in certain median interval spaces including those induced by bounded distributive lattices that are not chains, and in certain non-median interval spaces including those induced by partial cubes that are not trees.Thus, it turns out that anti-exchange properties of the relevant interval space provide a powerful general common principle that explains the varying relationship between simple and coalitional strategy-proofness of aggregation rules for rich weakly unimodal domains across different interval spaces, both median and non-median.     

Dual banach lattices and Banach lattices with the Radon-Nikodym property

We construct a separable dual Banach latticeE such that no non-trivial order interval of its dual is weakly compact. HenceE has the Radon-Nikodym property without being in some sense a dual in a natural way. The final draft of this paper was written while the author held a grant from NATO to visit the Ohio State University.     

Finite distributive lattices are congruence lattices of almost-geometric lattices

A semimodular lattice L of finite length will be called an almost-geometric lattice if the order J(L) of its nonzero join-irreducible elements is a cardinal sum of at most two-element chains. We prove that each finite distributive lattice is isomorphic to the lattice of congruences of a finite almost-geometric lattice.     

Catalytic distributive lattices and compact zero-dimensional topological lattices

The (Priestley) dual spaces ofD ₀₁-catalytic lattices are analysed and shown to be precisely the compact zero-dimensional topological lattices. This characterisation is used to prove that a bounded distributive lattice isD ₀₁-catalytic if and only if it is a retract of one freely generated by an ordered set.Presented by I. Rival.     

Congruence lattices of function lattices

Thefunction lattice L ^P is the lattice of all isotone maps from a posetP into a latticeL.D. Duffus, B. Jónsson, and I. Rival proved in 1978 that for afinite poset P, the congruence lattice ofL ^P is a direct power of the congruence lattice ofL; the exponent is |P|.This result fails for infiniteP. However, utilizing a generalization of theL ^P construction, theL[D] construction (the extension ofL byD, whereD is a bounded distributive lattice), the second author proved in 1979 that ConL[D] is isomorphic to (ConL) [ConD] for afinite lattice L.In this paper we prove that the isomorphism ConL[D](ConL)[ConD] holds for a latticeL and a bounded distributive latticeD iff either ConL orD is finite.The research of the first author was supported by the NSERC of Canada.The research of the second author was supported by the Hungarian National Foundation for Scientific Research, under Grant No. 1903.     

Dichotomic lattices and local discretization for Galois lattices

The present paper deals with supervised classification methods based on Galois lattices and decision trees. Such ordered structures require attributes discretization and it is known that, for decision trees, local discretization improves the classification performance compared with global discretization. While most literature on discretization for Galois lattices relies on global discretization, the presented work introduces a new local discretization algorithm for Galois lattices which hinges on a property of some specific lattices that we introduce as dichotomic lattices. Their properties, co-atomicity and \(\vee \)-complementarity are proved along with their links with decision trees. Finally, some quantitative and qualitative evaluations of the local discretization are proposed.     

On quasiorder lattices and topology lattices of algebras

In this paper, it is shown that the dual [(\textQord)\tilde]\mathfrakA \widetilde{\text{Qord}}\mathfrak{A} of the quasiorder lattice of any algebra \mathfrakA \mathfrak{A} is isomorphic to a sublattice of the topology lattice á( \mathfrakA ) \Im \left( \mathfrak{A} \right) . Further, if \mathfrakA \mathfrak{A} is a finite algebra, then [(\textQord)\tilde]\mathfrakA @ á( \mathfrakA ) \widetilde{\text{Qord}}\mathfrak{A} \cong \Im \left( \mathfrak{A} \right) . We give a sufficient condition for the lattices [(\textCon)\tilde]\mathfrakA\text, [(\textQord)\tilde]\mathfrakA \widetilde{\text{Con}}\mathfrak{A}{\text{,}} \widetilde{\text{Qord}}\mathfrak{A} , and á( \mathfrakA ) \Im \left( \mathfrak{A} \right) . to be pairwise isomorphic. These results are applied to investigate topology lattices and quasiorder lattices of unary algebras.     

Free lattices over join-trivial partial lattices

Presented by Alan Day.