arXiv math/01112822001-11-27math.RA

Balanced d-lattices are complemented

Martin Goldstern, Miroslav Ploscica

备注：: 4 pages, LaTeX2e

英文摘要：

We show that all balanced d-lattices must be complemented, answering a question of Chajda and Eigenthaler. (A bounded lattice is balanced if any two congruences agree on their 1-classes iff they agree on their 0-classes.) Our main tool is the characterization of d-lattices (a class of bounded lattices including the bounded distributive lattices, originally defined by a property of their compact congruences) as exactly those lattices in which all maximal filters/ideals are prime.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Linear representations of regular rings and complemented modular lattices with involution

Faithful representations of regular $\ast$-rings and modular complemented lattices with involution within orthosymmetric sesquilinear spaces are studied within the framework of Universal Algebra. In particular, the correspondence between classes of spaces and classes of representables is analyzed; for a class of spaces which is closed under ultraproducts and non-degenerate finite dimensional subspaces, the latter are shown to be closed under complemented [regular] subalgebras, homomorphic images, and ultraproducts and being generated by those members which are associated with finite dimensiona…

2016-04-24math.RA

有补模格与正则环中的透视性

Perspectivity in complemented modular lattices and regular rings

本文借助有补模格下截段部分同构系统的类比，证明正则环中有限高度相交的同构主右理想具有透视性，并据此得出正则环存在簇中单位正则性与直接有限性等价。

2025-02-19math.RA

Modal operators for meet-complemented lattices

We investigate some modal operators of necessity and possibility in the context of meet-complemented (not necessarily distributive) lattices. We proceed in stages. We compare our operators with others.

2016-03-08math.LOmath.RA

Coordinatization of lattices by regular rings without unit and Banaschewski functions

A Banaschewski function on a bounded lattice L is an antitone self-map of L that picks a complement for each element of L. We prove a set of results that include the following: (1) Every countable complemented modular lattice has a Banaschewski function with Boolean range, the latter being unique up to isomorphism. (2) Every (not necessarily unital) von Neumann regular ring R has a map e from R to the idempotents of R such that xR=e(x)R and e(xy)=e(x)e(xy)e(x) for all x,y in R. (3) Every sectionally complemented modular lattice with a ``Banaschewski trace'' (a weakening of the notion of a Bana…

2009-06-05math.RA

Varieties corresponding to classes of complemented posets

As algebraic semantics of the logic of quantum mechanics there are usually used orthomodular posets, i.e. bounded posets with a complementation which is an antitone involution and where the join of orthogonal elements exists and the orthomodular law is satisfied. When we omit the condition that the complementation is an antitone involution, then we obtain skew-orthomodular posets. To each such poset we can assign a bounded lambda-lattice in a non-unique way. Bounded lambda-lattices are lattice-like algebras whose operations are not necessarily associative. We prove that any of the following pr…

2019-11-12math.RA

On Nontrivial Weak Dicomplementations and the Lattice Congruences that Preserve Them

We study the existence of nontrivial and of representable (dual) weak complementations, along with the lattice congruences that preserve them, in different constructions of bounded lattices, then use this study to determine the finite (dual) weakly complemented lattices with the largest numbers of congruences, along with the structures of their congruence lattices. It turns out that, if $n\geq 7$ is a natural number, then the four largest numbers of congruences of the $n$--element (dual) weakly complemented lattices are: $2^{n-2}+1$, $2^{n-3}+1$, $5\cdot 2^{n-6}+1$ and $2^{n-4}+1$. For smaller…

2021-02-04math.RA

更多相关论文收起更多论文

Biordered sets of lattices and homogeneous basis

In this paper we discuss the properties of the biordered set obtained from a complemented modular lattice and defines an operation using the sandwich elements of the biordered set. Further we describe a biordered subset satisfying certain conditions, so that the complemented modular lattice admits a homogeneous basis. Finally analogous to von Neumann coordinatization theorem we describe the coordinatization theorem for complemented modular lattice using the biordered set of idempotents.

2020-06-03math.GRmath.RA

A non-coordinatizable sectionally complemented modular lattice with a large Jónsson four-frame

A sectionally complemented modular lattice L is coordinatizable if it is isomorphic to the lattice L(R) of all principal right ideals of some von Neumann regular (not necessarily unital) ring R. We say that L has a large 4-frame if it has a homogeneous sequence (a_0,a_1,a_2,a_3) such that the neutral ideal generated by a_0 is L. Jónsson proved in 1962 that if L has a countable cofinal sequence and a large 4-frame, then it is coordinatizable; whether the cofinal sequence assumption could be dispensed with was left open. We solve this problem by finding a non-coordinatizable sectionally compleme…

2010-08-16math.CTmath.GMmath.LO

Biordered Sets of Regular Rings

The set of idempotents of a regular semigroup is given an abstract characterization as a regular biordered set in [2], and in [4] it is shown how a biordered set can be associated with a complemented modular lattice. Von Neumann has shown earlier that any complemented modular lattice of order greater than 3 can be realized as the lattice of principal right ideals of a regular ring (see [3]). Here we try to connect these ideas to get a characterization of the biordered sets of a class of regular rings.

2020-10-18math.RA

Representing finite distributive lattices as congruence lattices of lattices

Dilworth's theorem. Every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice $L$. We want: Every finite distributive lattice $D$ can be represented as the congruence lattice of a nice finite lattice $L$. nice = sectionally complemented, uniform, semimodular, given automorphism group, regular, uniform, isoform

2013-09-28math.RA

Stone Commutator Lattices and Baer Rings

In this paper, we transfer Davey`s characterization for $κ$--Stone bounded distributive lattices to lattices with certain kinds of quotients, in particular to commutator lattices with certain properties, and obtain related results on prime, radical, complemented and compact elements, annihilators and congruences of these lattices. We then apply these results to certain congruence lattices, in particular to those of semiprime members of semi--degenerate congruence--modular varieties, and use this particular case to transfer Davey`s Theorem to commutative unitary rings.

2020-03-29math.RA

Finite distributive nearlattices

Our main goal is to develop a representation for finite distributive nearlattices through certain ordered structures. This representation generalizes the well-known representation given by Birkhoff for finite distributive lattices through finite posets. We also study finite distributive nearlattices through the concepts of dual atoms, boolean elements, complemented elements and irreducible elements. We prove that the sets of boolean elements and complemented elements form semi-boolean algebras. We show that the set of boolean elements of a finite distributive lattice is a boolean lattice.

2021-06-01math.LOmath.RA

On lattices with a smallest set of aggregation functions

Given a bounded lattice $L$ with bounds $0$ and $1$, it is well known that the set $\mathsf{Pol}_{0,1}(L)$ of all $0,1$-preserving polynomials of $L$ forms a natural subclass of the set $\mathsf{C}(L)$ of aggregation functions on $L$. The main aim of this paper is to characterize all finite lattices $L$ for which these two classes coincide, i.e. when the set $\mathsf{C}(L)$ is as small as possible. These lattices are shown to be completely determined by their tolerances, also several sufficient purely lattice-theoretical conditions are presented. In particular, all simple relatively complement…

2018-10-09math.RA

On principal congruences and the number of congruences of a lattice with more ideals than filters

Let $λ$ and $κ$ be cardinal numbers such that $κ$ is infinite and either $2\leq λ\leq κ$, or $λ=2^κ$. We prove that there exists a lattice $L$ with exactly $λ$ many congruences, $2^κ$ many ideals, but only $κ$ many filters. Furthermore, if $λ\geq 2$ is an integer of the form $2^m\cdot 3^n$, then we can choose $L$ to be a modular lattice generating one of the minimal modular nondistributive congruence varieties described by Ralph Freese in 1976, and this $L$ is even relatively complemented for $λ=2$. Related to some earlier results of George Grätzer and the first author, we also prove that if $…

2017-11-17math.RA