Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2608.08723

Approximate homomorphisms on orthomodular lattices

Tomasz Kania
View original source ↗Read source document ↗Export metadata ↓

Abstract

The stability programme initiated by Ulam asks when approximate solutions to algebraic identities must lie near exact ones. For lattices, this leads to the question of when a map that nearly preserves joins and meets can be approximated by a genuine lattice homomorphism. Badora--Kochanek--Przebieracz developed a neighbourhood-based framework for distributive lattices, centred on a separation (sandwich) lemma that constructs an exact join homomorphism between a join-subhomomorphism and a join-superhomomorphism via an order envelope. We revisit this mechanism and identify the single step at which distributivity is used: a decomposition identity for elements lying below a join. Without distributivity, separation can fail already in the modular lattice $M_3$ and in a small finite orthomodular lattice. On the positive side, we show that separation holds in arbitrary lattices whenever the lower bounding map is isotone. For orthomodular lattices---algebraic models of quantum logic---we develop a blockwise stability theory on Boolean blocks. Approximate identities on compatible pairs yield exact homomorphic selections on each block (for joins, for meets, and for both operations under bi-admissibility). We present several gluing criteria for assembling blockwise selections, and we give a concrete finite example showing that gluing can fail when block overlaps are non-trivial. Finally, in the spirit of Kalton--Roberts, we obtain blockwise approximation results for nearly additive functions on orthomodular lattices by finitely additive measures, with an illustration on finite-dimensional projection lattices.

Explore related subjects

math.LO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Tomasz Kania. 2026-08-09. Approximate homomorphisms on orthomodular lattices. https://arxiv.org/abs/2608.08723

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗