Doubling tolerances and coalition lattices

zbMATH Open1529.06009arXiv1909.09539MaRDI QIDQ6325696FDOQ6325696

Gábor Czédli

Publication date: 20 September 2019

Abstract: If every block of a (compatible) tolerance (relation) $T$ on a modular lattice $L$ of finite length consists of at most two elements, then we call $T$ a emph{doubling tolerance} on $L$. We prove that, in this case, $L$ and $T$ determines a modular lattice of size $2|L|$. This construction preserves distributivity and modularity. In order to give an application of the new construct, let $P$ be a partially ordered set (poset). Following a 1995 paper by G. Poll'ak and the present author, the subsets of $P$ are called the emph{coalitions} of $P$. For coalitions $X$ and $Y$ of $P$, let $XleqY$ mean that there exists an injective map $f$ from $X$ to $Y$ such that $xleqf(x)$ for every $xinX$. If $P$ is a finite chain, then its coalitions form a distributive lattice by the 1995 paper; we give a new proof of its distributivity by means of doubling tolerances.

Mathematics Subject Classification ID

Modular lattices, Desarguesian lattices (06C05)

This page was built for publication: Doubling tolerances and coalition lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6325696)