← Back to arXiv
arXivLogicarXiv:2607.10323

A bitopological duality for some subordination Boolean algebras

Imagine you have a collection of mathematical objects with two kinds of structure layered on top of each other: a logical structure (a Boolean algebra, which captures the basic operations of "and," "or," and "not") and a relational structure (a subordination relation, which is a way of saying one element is "below" or "contained in" another in some generalized sense). The paper studies a particular class of these hybrid objects called S4-subordination algebras, which generalize classical closure algebras from modal logic. The central question is: can we faithfully represent these abstract algebraic structures as concrete geometric or topological spaces, so that algebraic properties become visible as spatial properties?

The authors answer yes, by constructing a representation using bitopological spaces. A bitopological space is simply a set equipped with two different topologies (two different notions of "open set") at the same time. One of the two topologies comes from classical Stone duality, a well-known tool that translates Boolean algebras into compact, totally disconnected topological spaces called Stone spaces. The second topology is a new one, specifically designed to encode the subordination relation geometrically. This dual picture lets the researchers translate algebraic questions into topological ones and vice versa. They use this framework to characterize stronger variants of these algebras (called S5-subordination algebras and lattice subordinations), and to understand which subsets of the Stone space correspond to congruences, which are the natural notion of "quotient" or "symmetry" in algebra.

This kind of result matters because duality theorems are powerful tools in logic, algebra, and theoretical computer science. They let researchers move between two worlds, solving hard problems in one by using intuition and techniques from the other. Subordination algebras arise naturally in modal logic and the study of rough sets and approximate reasoning, areas with applications in artificial intelligence and knowledge representation. By providing a clean topological model for these algebras, along with representations for two different notions of maps between them, the paper gives researchers new geometric leverage to study logical systems that involve both classical Boolean reasoning and some notion of approximation or containment.

Read original →