Notes on sectionally complemented lattices. II

Summary G. Grätzer and H. Lakser proved in 1986 that for the finite distributive lattices D and E, with |D| > 1, and for the {0, 1}-homomorphism φ of D into E, there exists a finite lattice L and an ideal I of L such that D ≡ Con L, E ≡ Con I, and φ is represented by the restriction map. In their recent survey of finite congruence lattices, G. Grätzer and E. T. Schmidt ask whether this result can be improved by requiring that L be sectionally complemented. In this note, we provide an affirmative answer. The key to the solution is to generalize the 1960 sectional complement (see Part I) from finite orders to finite preorders.     

On the number of join-irreducibles in a congruence representation of a finite distributive lattice

For a finite lattice L, let $ \trianglelefteq_L $ denote the reflexive and transitive closure of the join-dependency relation on L, defined on the set J(L) of all join-irreducible elements of L. We characterize the relations of the form $ \trianglelefteq_L $, as follows: Theorem. Let $ \trianglelefteq $ be a quasi-ordering on a finite set P. Then the following conditions are equivalent:(i) There exists a finite lattice L such that $ \langle J(L), \trianglelefteq_L $ is isomorphic to the quasi-ordered set $ \langle P, \trianglelefteq \rangle $.(ii) $ |\{x\in P|p \trianglelefteq x\}| \neq 2 $, for any $ p \in P $.For a finite lattice L, let $ \mathrm{je}(L) = |J(L)|-|J(\mathrm{Con} L)| $ where Con L is the congruence lattice of L. It is well-known that the inequality $ \mathrm{je}(L) \geq 0 $ holds. For a finite distributive lattice D, let us define the join- excess function:$ \mathrm{JE}(D) =\mathrm{min(je} (L) | \mathrm{Con} L \cong D). $We provide a formula for computing the join-excess function of a finite distributive lattice D. This formula implies that $ \mathrm{JE}(D) \leq (2/3)| \mathrm{J}(D)|$ , for any finite distributive lattice D; the constant 2/3 is best possible.A special case of this formula gives a characterization of congruence lattices of finite lower bounded lattices.Dedicated to the memory of Gian-Carlo Rota     

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.     

Notes on sectionally complemented lattices. I

Summary In 1944, R.P. Dilworth proved (unpublished) that every finite distributive lattice D can be represented as the congruence lattice of a finite lattice L. In 1960, G. Grätzer and E. T. Schmidt improved this result by constructing a finite sectionally complemented lattice L whose congruence lattice represents D. In L, sectional complements do not have to be unique. The one sectional complement constructed by G. Grätzer and E. T. Schmidt in 1960, we shall call the 1960 sectional complement. This paper examines it in detail. The main result is an algebraic characterization of the 1960 sectional complement.     

Finite lattices as relative congruence lattices of finite algebras

Let A be a finite algebra and a quasivariety. By A is meant the lattice of congruences θ on A with . For any positive integer n, we give conditions on a finite algebra A under which for any n-element lattice L there is a quasivariety such that . The author was supported by INTAS grant 03-51-4110.     

Idempotent matrix lattices over distributive lattices

In this paper, the partially ordered set of idempotent matrices over distributive lattices with the partial order induced by a set of lattice matrices is studied. It is proved that this set is a lattice; the formulas for meet and join calculation are obtained. In the lattice of idempotent matrices over a finite distributive lattice, all atoms and coatoms are described. We prove that the lattice of quasi-orders over an n-element set Qord(n) is not graduated for n ≥ 3 and calculate the greatest and least lengths of maximal chains in this lattice. We also prove that the interval ([I, J]_≤, ≤) of idempotent (n × n)-matrices over {ie879-01}-lattices is isomorphic to the lattice of quasi-orders Qord(n). Using this isomorphism, we calculate the lattice height of idempotent {ie879-02}-matrices. We obtain a structural criterion of idempotent matrices over distributive lattices. __________ Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 13, No. 4, pp. 121–144, 2007.     

Quasiorder lattices of varieties

The set \({{\mathrm{Quo}}}(\mathbf {A})\) of compatible quasiorders (reflexive and transitive relations) of an algebra \(\mathbf {A}\) forms a lattice under inclusion, and the lattice \({{\mathrm{Con}}}(\mathbf {A})\) of congruences of \(\mathbf {A}\) is a sublattice of \({{\mathrm{Quo}}}(\mathbf {A})\). We study how the shape of congruence lattices of algebras in a variety determine the shape of quasiorder lattices in the variety. In particular, we prove that a locally finite variety is congruence distributive [modular] if and only if it is quasiorder distributive [modular]. We show that the same property does not hold for meet semi-distributivity. From tame congruence theory we know that locally finite congruence meet semi-distributive varieties are characterized by having no sublattice of congruence lattices isomorphic to the lattice \(\mathbf {M}_3\). We prove that the same holds for quasiorder lattices of finite algebras in arbitrary congruence meet semi-distributive varieties, but does not hold for quasiorder lattices of infinite algebras even in the variety of semilattices.     

Radicals in pseudocomplemented lattices

For a pseudocomplemented latticeL, we prove that the filter D_n(L), 1n<, generated by then-strongly dense elements is contained in everyn-normal filter. Hence, D_n(L)=G_n(L)=Rad_n (L), where G_n(L) is the intersection of all n-normal filters, and Rad_n (L) is the intersection of alln-normal prime filters. Moreover, we prove that a prime filterP is n-normal iff D_n(L)=P. Consequently, for , we have D_n(L)=G_n(L)=Rad_n (L) and therefore iff Rad_n(L)={1} (or iff G_n(L)={1}).Considering the skeleton S(L) ofL, a complete clarification of the relationship between filters ofL and S(L) is given by studying th correspondence FFS(L).We state that D(L) (and that D₁(L), if is an irredundant intersection of maximal filters (resp. of *-maximal filters) iff S(L) is finite.Finally, for we state that the least *-congruence for which is that one generated by D_n(L).Presented by B. Jónsson.Research supported by the I.N.I:C, (Centro de Algebra da Universidade de Lisboa).     

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.     

A short proof of the congruence representation theorem of rectangular lattices

In a 1998 paper with H. Lakser, the authors proved that every finite distributive lattice D can be represented as the congruence lattice of a finite semimodular lattice. Some ten years later, the first author and E. Knapp proved a much stronger result, proving the representation theorem for rectangular lattices. In this note we present a short proof of these results.     

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.     

Definability in substructure orderings, III: Finite distributive lattices

Let ${{\mathcal D}}$ be the ordered set of isomorphism types of finite distributive lattices, where the ordering is by embeddability. We study first-order definability in this ordered set. We prove among other things that for every finite distributive lattice D, the set {d, d ^opp} is definable, where d and d ^opp are the isomorphism types of D and its opposite (D turned upside down). We prove that the only non-identity automorphism of ${{\mathcal D}}$ is the opposite map. Then we apply these results to investigate definability in the closely related lattice of universal classes of distributive lattices. We prove that this lattice has only one non-identity automorphism, the opposite map; that the set of finitely generated and also the set of finitely axiomatizable universal classes are definable subsets of the lattice; and that for each element K of the two subsets, {K, K ^opp} is a definable subset of the lattice.     

Characterizing fully principal congruence representable distributive lattices

Motivated by a recent paper of G. Grätzer, a finite distributive lattice D is called fully principal congruence representable if for every subset Q of D containing 0, 1, and the set J(D) of nonzero join-irreducible elements of D, there exists a finite lattice L and an isomorphism from the congruence lattice of L onto D such that Q corresponds to the set of principal congruences of L under this isomorphism. A separate paper of the present author contains a necessary condition of full principal congruence representability: D should be planar with at most one join-reducible coatom. Here we prove that this condition is sufficient. Furthermore, even the automorphism group of L can arbitrarily be stipulated in this case. Also, we generalize a recent result of G. Grätzer on principal congruence representable subsets of a distributive lattice whose top element is join-irreducible by proving that the automorphism group of the lattice we construct can be arbitrary.     

On the mean lattice point discrepancy of a convex disc

For a convex planar domain D \cal {D} , with smooth boundary of finite nonzero curvature, we consider the number of lattice points in the linearly dilated domain t D t \cal {D} . In particular the lattice point discrepancy P_D(t) P_{\cal {D}}(t) (number of lattice points minus area), is investigated in mean-square over short intervals. We establish an asymptotic formula for¶¶ ò_{T - L}^{T + L}(P_D(t))²dt \int\limits_{T - \Lambda}^{T + \Lambda}(P_{\cal {D}}(t))^2\textrm{d}t ,¶¶ for any L = L(T) \Lambda = \Lambda(T) growing faster than logT.     

Distributive lattices determined by weighted double skeletons

Related to his S-glued sum construction, the skeleton S(L) of a finite lattice L was introduced by C. Herrmann in 1973. Our theorem asserts that if D is a finite distributive lattice and its second skeleton, S(S(D)), is the trivial lattice, then D is characterized by its weighted double skeleton, introduced by the second author in 2006. The assumption on the second skeleton is essential.     

Separation in distributive congruence lattices

We define separable sets in algebraic lattices. For a finitely generated congruence distributive variety V \mathcal{V} , we show a close connection between non-separable sets in congruence lattices of algebras in V \mathcal{V} and the structure of subdirectly irreducible algebras in V \mathcal{V} . We apply the general results to some lattice varieties.     

Finite lattices and congruences. A survey

In the early forties, R.P. Dilworth proved his famous result: Every finite distributive lattice D can be represented as the congruence lattice of a finite lattice L. In one of our early papers, we presented the first published proof of this result; in fact we proved: Every finite distributive lattice D can be represented as the congruence lattice of a finite sectionally complemented lattice L.We have been publishing papers on this topic for 45 years. In this survey paper, we are going to review some of our results and a host of related results by others: Making L nice.If being nice is an algebraic property such as being semimodular or sectionally complemented, then we have tried in many instances to prove a stronger form of these results by verifying that every finite lattice has a congruence-preserving extension that is nice. We shall discuss some of the techniques we use to construct nice lattices and congruence-preserving extensions.We shall describe some results on the spectrum of a congruence of a finite sectionally complemented lattice, measuring the sizes of the congruence classes. It turns out that with very few restrictions, these can be as bad as we wish.We shall also review some results on simultaneous representation of two distributive lattices. We conclude with the magic wand construction, which holds out the promise of obtaining results that go beyond what can be achieved with the older techniques.In Celebration of the Sixtieth Birthday of Ralph N. McKenzieReceived November 26, 2002; accepted in final form June 18, 2004.     

Lattices of quotients of completely distributive lattices

In this paper, we consider the complete lattice Q(L) of all quotients of a completely distributive lattice L. We show that Q(L) is not a completely distributive lattice even for L a completely distributive algebraic lattice. Some necessary and sufficient conditions for Q(L) to be a completely distributive lattice are given. Received February 26, 2003; accepted in final form January 17, 2005.