From Multirelations to Meet-Relations: A Relational Duality for Semilattices with Adjunctions
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.
Ada: We're looking at the paper: "From Multirelations to Meet-Relations".
Title and authors: Emmy: The title itself tells you a lot about the goal, moving from multirelations to meet-relations for semilattices with adjunctions. It suggests a refinement of the underlying structure.
Ada: And what they achieve is showing that under a certain normality condition, this new relational framework based on meet-relations can perfectly reconstruct the original multirelational semantics.
Kolya: So, if you have that specific normality condition met for the dual spaces, you can take your complex multirelational data and just use a binary meet-relation to recreate it exactly.
Emmy: That's the core idea of this work. It’s establishing a canonical reconstruction method. It’s not just some loose correspondence; it’s a precise mapping back and forth between the two systems.
Ada: And what they really nail is proving that the category RelSP, which is built using these A-relations for adjoint pairs, isn't just equivalent to the multirelational category SLataSp, but actually isomorphic to it.
Emmy: That isomorphism means they are fundamentally the same structure from a categorical standpoint once you impose that normality condition. It simplifies the picture significantly.
The paper's summary: Ada: To summarize the main thrust of 'From Multirelations to Meet-Relations: A Relational Duality for Semilattices with Adjunctions', they develop a relational duality centered on binary meet-relations.
Emmy: They first set up the machinery by looking at a relational semantics for modal semilattices, which involves operators that preserve the meet structure. This gives them the initial tools like compatible morphisms and functorial constructions.
Kolya: Then they build on that by introducing A-relations, or adjoint-relations, to specifically handle those adjoint pairs on the semilattice. This gets you into the category RelSP, which is their new relational setting for SLatas.
Ada: And here’s the key finding: under a suitable normality condition on the associated dual spaces, they show that every relevant multirelational structure can be canonically recovered from an associated meet-relation and vice versa.
Emmy: That means you don't need the full complexity of the original multirelational semantics; a simpler binary relation is enough if you have that specific condition to guarantee reconstruction.
The paper's improvements: Ada: The paper suggests a major improvement by showing that the categories SLataSp and RelSP are not just dually equivalent, but they are actually isomorphic. That’s a stronger structural statement.
Kolya: So it means the two mathematical descriptions—the old multirelational one and this new meet-relation one—are fundamentally identical under the right conditions.
Emmy: They also provide a concrete way to recover the left adjoint operation of an SLata by showing it is completely determined by its modal reduct. This links the algebraic structure directly to the relational data.
Ada: And for someone who only cares about the structure of an SLata-space, they show that everything—the adjunction itself—is entirely captured by the pair of operators, mI and mE.
Emmy: That’s a very clean way to state it. The relational structure completely dictates the adjoint pairs on a semilattice. It’s a powerful reduction of complexity into these fundamental operators.
Conclusion: Ada: So, to wrap up, this paper 'From Multirelations to Meet-Relations: A Relational Duality for Semilattices with Adjunctions' provides a way to translate the complex multirelational semantics into a simpler binary meet-relation structure.
Emmy: The most important result is that when you have that normality condition, the categories RelSP and SLataSp are isomorphic, meaning they represent the exact same mathematical object under those circumstances.
Kolya: From a probabilistic standpoint, this means if you are looking at a system governed by an SLata with adjoints, you can use this meet-relation framework to analyze it without needing the full multirelational apparatus.
Ada: The implication is that the relational structure of an SLata-space is completely determined by its adjunction, specifically by the operators mI and mE.
Emmy: It gives us a robust relational topological representation for semilattices equipped with those adjoints. We’re looking forward to seeing how this framework connects with other areas of mathematics soon.
B. Gimenez, W. Zuluaga
Departamento de Matemítica, Facultad de Ciencias Exactas (UNLP) · Facultad de Ciencias Exactas (UNCPBA)
math.LO, math.CT
Submitted: 2026-05-20
Updated: 2026-11-18
License: http://creativecommons.org/licenses/by/4.0/
Importance score: 77/100
The gist: From Multirelations to Meet-Relations: A Relational Duality for Semilattices with Adjunctions develops a relational duality for semilattices with adjunctions (SLatas) based on binary meet-relations…
Key concepts
- Meet-Relation
- A binary relation defined on S-spaces where the composition is associative and the dual specialization order yields identity morphisms. This serves as the fundamental relational structure used to define a semantics for modal semilattices, providing a basic framework for relational representation.
- mS-space
- A structure consisting of an S-space (a set with a partial order) and a multirelation R that relates elements to their dual specialization. These spaces are enriched with specific relations like A-relations and $\sigma$mS-spaces, which help model the adjoint structure.
- Normality Condition
- A condition imposed on the associated dual spaces (mS-spaces) that isolates the essential structural content of modal semilattices. This condition is crucial because it guarantees that every relevant multirelational structure can be canonically recovered from its associated meet-relation.
- SLataSp and RelSP
- These are two categories: SLataSp represents the algebraic structures (semilattices with adjunctions) using modal operators, while RelSP represents the relational structures using binary meet-relations. The paper proves these two categories are isomorphic under certain conditions, showing they describe the same underlying mathematical objects.
Terminology
Summary
From Multirelations to Meet-Relations: A Relational Duality for Semilattices with Adjunctions develops a relational duality for semilattices with adjunctions (SLatas) based on binary meet-relations, proving that under a suitable normality condition, the multirelational semantics can be canonically reconstructed from a meet-relation and establishing an isomorphism between the categories SLataSp and SLataSp
Core Contribution
The main contribution is to show that, under a suitable normality condition on the associated dual spaces, the multirelational semantics introduced in [3] can be canonically reconstructed from binary meet-relations. More precisely, we define a category RelSP of relational S-spaces and establish a dual equivalence between SLata and RelSP. p. 0 Our
main contribution is to show that, under a suitable normality condition on the associated dual spaces, the
multirelational semantics introduced in [3] can be canonically reconstructed from binary meet-relations. More precisely, we define a category RelSP of relational S-spaces and establish a dual equivalence between SLata and RelSP. More precisely, we define a category RelSP of relational S-spaces and establish a dual equivalence between SLata and RelSP. Furthermore, we prove that RelSP is not merely equivalent to the multirelational
category SLataSp introduced in [3], but actually isomorphic to it.Where the paper says it
Where the paper says it
Relational Framework Development
The strategy proceeds in two stages. First, we develop a relational semantics for modal semilattices, namely semilattices equipped with a meet-preserving operator. p. 1 Our strategy proceeds in two stages. First, we develop a relational semantics for modal semilattices,
namely semilattices equipped with a meet-preserving operator. To this end, we introduce the category
MoSsp of MoS-spaces and establish its dual equivalence with the algebraic category MoSL. This provides the fundamental relational machinery—meet-relations, compatible morphisms, and the associated
functorial constructions—that will later be extended to the adjoint setting. This provides the fundamental relational machinery—meet-relations, compatible morphisms, and the associated
functorial constructions—that will later be extended to the adjoint setting. In the second stage, we enrich this framework in order to represent adjoint pairs on semilattices. In the second stage, we enrich this framework in order to represent adjoint pairs on semilattices. For
this purpose, we introduce A-relations (adjoint-relations) and adjoint-preserving morphisms, obtaining
the category RelSP and the corresponding duality for SLatas. For
this purpose, we introduce A-relations (adjoint-relations) and adjoint-preserving morphisms, obtaining
the category RelSP and the corresponding duality for SLatas. We then introduce the notion of normal
mS-space and prove that every relevant multirelational structure can be canonically recovered from an
associated meet-relation.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Categorical Duality Results
The paper establishes several key dual equivalences. Theorem 3.1 states that the categories MoSL and MoSsp are dually equivalent. p. 8 Therefore, we obtain the following duality theorem. 1 The categories MoSL and MoSsp are dually equivalent. Hence, MoS-spaces provide relational representations of modal semilattices. Proposition 3. □
Propositions 3. 8 show that the functors F and G are mutually inverse up to natural isomorphism. Therefore, we obtain the following duality theorem. 1 The categories MoSL and MoSsp are dually equivalent.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Isomorphism Proof Details
The final result, Theorem 4.4, proves that the categories SLataSp and RelSP are isomorphic. p. 0 To compare this framework with the multirelational semantics
previously developed for SLatas, we introduce the notion of normal mS-space and show that, under
this condition, the multirelational structure can be canonically recovered from a meet-relation, and
conversely. As a consequence, we prove that the categories RelSP and SLataSp are isomorphic. Moreover,
for every SLata-space ⟨X, K, I, E⟩, the dual of the specialization order ⊒⊆ X × X is an SLata-relation
and acts as the identity. Consequently, SLata-spaces together with SLata-relations form a category, denoted by SLataSp. Finally, from Lemma 9 in [1], the map HX : X → X (S(X))
defined as in (1) is an isomorphism of mS-spaces. Therefore, we obtain:
Proposition 3.Where the paper says it
Where the paper says it
Where the paper says it
Key Structural Definitions
The paper introduces several crucial structures to bridge the gap between algebraic and relational settings. Examples include:
**- A meet-relation between S-spaces is defined by two conditions. The composition operation is associative, and the dual specialization order yields identity morphisms. p. 4 A meet-relation T ⊆ X1 × X2 is called a monotone
meet-relation if the following diagram commutes:
S(X2)
✷T /
mR2
S(X1)
mR1
S(X2) ✷T
/S(X1)
Moreover, the composition ∗ defined in (2) is closed on monotone meet-relations (see [1]). Since ∗ is
associative and the dual specialization order yields identity morphisms, mS-spaces together with monotone
meet-relations form a category, denoted by mSp.Where the paper says it
**- An mS-space is a structure ⟨X, K, R⟩ where ⟨X, K⟩ is an S-space and R ⊆ X × Z(X) is a multirelation satisfying specific conditions. p. 4 A multirelation on a set X is a subset of the Cartesian product X × P(X), that is, a set of pairs (x, Y )
with x ∈ X and Y ⊆ X. An mS-space is a structure ⟨X, K, R⟩, where ⟨X, K⟩ is an S-space and R ⊆ X × Z(X) is a multirelation
such that:
(m1) mR(U) = {x ∈ X : R(x) ⊆ LU } ∈ S(X) for all U ∈ S(X),
(m2) R(x) = T
{LU : U ∈ S(X) and x ∈ mR(U)} for all x ∈ X,
where, for every U ∈ S(X), LU = {Z ∈ Z(X): Z ∩ U ̸= ∅}.Where the paper says it
**- An A-relation is a relation T ⊆ X × X that satisfies two specific conditions related to subbasic saturated subsets. p. 3 ⊆) such that
Z =
\
L. We denote by Z(X) the set of subbasic saturated subsets of X.Where the paper says it
**- A σmS-space is a structure ⟨X, K, G⟩ where G ⊆ X × CK(X) is a relation satisfying two properties involving mG and G(x). p. 0 Then, by means of A-relations, we define the category RelSP and prove a dual
equivalence between SLata and RelSP. To compare this framework with the multirelational semantics
previously developed for SLatas, we introduce the notion of normal mS-space and show that, under
this condition, the multirelational structure can be canonically recovered from a meet-relation, and
conversely.Where the paper says it
The notion of normality for mS-spaces is introduced to isolate the structural content underlying modal semilattices. p. 0 The present paper answers this question affirmatively for the case of semilattices with adjunctions
(SLatas), namely algebras ⟨A, i, d⟩ where the unary operations i and d form an adjoint pair i ⊣ d. Our
main contribution is to show that, under a suitable normality condition on the associated dual spaces, the
multirelational semantics introduced in [3] can be canonically reconstructed from binary meet-relations.Where the paper says it
Conclusion on Correspondence
The paper concludes that the relational structure of a RelS-space completely determines, and is completely determined by, a pair of adjoint operators on a semilattice. In particular, the modal operator T and its left adjoint ∗T can be completely recovered from the associated normal and monotone relations RT and RGT, respectively. p. 1 For
this purpose, we introduce A-relations (adjoint-relations) and adjoint-preserving morphisms, obtaining
the category RelSP and the corresponding duality for SLatas. We then introduce the notion of normal
mS-space and prove that every relevant multirelational structure can be canonically recovered from an
associated meet-relation. For
this purpose, we introduce A-relations (adjoint-relations) and adjoint-preserving morphisms, obtaining
the category RelSP and the corresponding duality for SLatas. We then introduce the notion of normal
mS-space and prove that every relevant multirelational structure can be canonically recovered from an
associated meet-relation. For
this purpose, we introduce A-relations (adjoint-relations) and adjoint-preserving morphisms, obtaining
the category RelSP and the corresponding duality for SLatas. We then introduce the notion of normal
mS-space and prove that every relevant multirelational structure can be canonically recovered from an
associated meet-relation. Then, by means of A-relations, we define the category RelSP and prove a dual
equivalence between SLata and RelSP. To compare this framework with the multirelational semantics
previously developed for SLatas, we introduce the notion of normal mS-space and show that, under
this condition, the multirelational structure can be canonically recovered from a meet-relation, and
conversely. Then, by means of A-relations, we define the category RelSP and prove a dual
equivalence between SLata and RelSP. To compare this framework with the multirelational semantics
previously developed for SLatas, we introduce the notion of normal mS-space and show that, under
this condition, the multirelational structure can be canonically recovered from a meet-relation, and
conversely. Then, by means of A-relations, we define the category RelSP and prove a dual
equivalence between SLata and RelSP. To compare this framework with the multirelational semantics
previously developed for SLatas, we introduce the notion of normal mS-space and show that, under
this condition, the multirelational structure can be canonically recovered from a meet-relation, and
conversely. The categorical relationships developed throughout the paper are summarized in the following diagram:
SLataSp
Q
-
RelSP
P
m
SLataop
`
M
AA
The lower part of the diagram displays two dual representations of semilattices with adjunctions: on the
left, the multirelational semantics developed in [3], and on the right, the relational semantics based on
meet-relations introduced in the present paper. The upper part shows that the corresponding categories
of spaces are in fact isomorphic. The categorical relationships developed throughout the paper are summarized in the following diagram:
SLataSp
Q
-
RelSP
P
m
SLataop
`
M
AA
The lower part of the diagram displays two dual representations of semilattices with adjunctions: on the
left, the multirelational semantics developed in [3], and on the right, the relational semantics based on
meet-relations introduced in the present paper. The upper part shows that the corresponding categories
of spaces are in fact isomorphic. The categorical relationships developed throughout the paper are summarized in the following diagram:
SLataSp
Q
-
RelSP
P
m
SLataop
`
M
AA
The lower part of the diagram displays two dual representations of semilattices with adjunctions: on the
left, the multirelational semantics developed in [3], and on the right, the relational semantics based on
meet-relations introduced in the present paper. The upper part shows that the corresponding categories
of spaces are in fact isomorphic.Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Where the paper says it
Algebraic Meaning
The paper shows that the SLata naturally induced by the relational structure coincides with the SLata arising from the adjunction associated with T, namely ⟨S(X), ∗T, T⟩ = ⟨S(X), mRGT, mRT⟩. This means that left adjoints are unique whenever they exist. p. 9 Indeed, taking Z = {1}, we have
h(f∗(Z)) = X and f∗(h(Z)) = ∅. In order to characterize homomorphism between modal reducts of SLatas that preserve preserve the left
adjoint, we first recall a well-known criterion for the existence of left adjoints in order-theoretic terms. Then, by means of A-relations, we define the category RelSP and prove a dual
equivalence between SLata and RelSP. To compare this framework with the multirelational semantics
previously developed for SLatas, we introduce the notion of normal mS-space and show that, under
this condition, the multirelational structure can be canonically recovered from a meet-relation, and
conversely.Where the paper says it
Where the paper says it
Reconstruction Summary
The final result shows that the relational structure of a RelS-space completely determines, and is completely determined by, a pair of adjoint operators on a semilattice. In particular, the modal operator T and its left adjoint ∗T can be completely recovered from the associated normal and monotone relations RT and RGT, respectively. Reciprocally, the relational structure of a SLata-space is entirely determined by the adjunction (mI, mE). Thus, the isomorphism between RelSP and SLataSp provides a relationaltopological representation of semilattices equipped with adjunctions.
Final Synthesis
The paper demonstrates that the relational structure of a RelS-space completely determines, and is completely determined by, a pair of adjoint operators on a semilattice. In particular, the modal operator T and its left adjoint ∗T can be completely recovered from the associated normal and monotone relations RT and RGT, respectively. Reciprocally, the relational structure of a SLata-space is entirely determined by the adjunction (mI, mE). Thus, the isomorphism between RelSP and SLataSp provides a relationaltopological representation of semilattices equipped with adjunctions.
References
[1] I. Calomino, P. Mench´on and W. J. Z. Botero A topological duality for monotone expansions of semilattices Applied Categorical Structures 30 1257–1282, 2022 https://doi. p. 0 By establishing contravariant correspondences between algebraic categories and categories of
structured spaces, dualities allow algebraic phenomena to be studied through topological, order-theoretic,
or relational methods. In the specific setting of semilattices, this perspective has proven particularly fruitful: the duality developed in [4] between semilattices and S-spaces provides a flexible framework for representing algebraic expansions, while subsequent work extended this approach to monotone semilattices
and semilattices with adjunctions through multirelational structures [1, 3].Where the paper says it
[3] B. Gim´enez G Pelaitay W Zuluaga A Stone-type duality for semilattices with adjunctions Journal of Logic and Computation Volume 35 Issue 3 (2025)
[4] Celani S.A Gonz´alez L.J A Categorical Duality for Semilattices and Lattices Appl Categor Struct 28 853–875 (2020)
[5] Dunn J.M Gehrke M Palmigiano A Canonical extensions and relational completeness of some substructural logics J. p. 1 In particular, we recall the topological duality for semilattices
from [4] together with its multirelational extensions developed in [1, 3]. Section 3 develops the relational
duality for modal semilattices and extends it to semilattices with adjunctions via A-relations, culminating
in the dual equivalence between SLata and RelSP. In particular, we recall the topological duality for semilattices
from [4] together with its multirelational extensions developed in [1, 3]. Section 3 develops the relational
duality for modal semilattices and extends it to semilattices with adjunctions via A-relations, culminating
in the dual equivalence between SLata and RelSP. In particular, we recall the topological duality for semilattices
from [4] together with its multirelational extensions developed in [1, 3]. Section 3 develops the relational
duality for modal semilattices and extends it to semilattices with adjunctions via A-relations, culminating
in the dual equivalence between SLata and RelSP.Where the paper says it
Where the paper says it
Where the paper says it
[6] Celani S.A Mench´on M.P Monotonic Distributive Semilattices Order 31 321—341 (2014)
[2] B. Davey H Priestley H A Introduction to lattices and order Cambridge university press (2002)
[3] B. Gim´enez G Pelaitay W Zuluaga A Stone-type duality for semilattices with adjunctions Journal of Logic and Computation Volume 35 Issue 3 (2025)
[4] Celani S.A Gonz´alez L.J A Categorical Duality for Semilattices and Lattices Appl Categor Struct 28 853–875 (2020)
[5] Dunn J.M Gehrke M Palmigiano A Canonical extensions and relational completeness of some substructural logics J. Symbolic Logic 70 (3) 713–740 (2005)
[6] Celani S.A Mench´on M.P Monotonic Distributive Semilattices Order 31 321—341 (2014)
[2] B. Davey H Priestley H A Introduction to lattices and order Cambridge university press (2002)
[3] B. Gim´enez G Pelaitay W Zuluaga A Stone-type duality for semilattices with adjunctions Journal of Logic and Computation Volume 35 Issue 3 (2025)
[4] Celani S.A Gonz´alez L.J A Categorical Duality for Semilattices and Lattices Appl Categor Struct 28 853–875 (2020)
[5] Dunn J.M Gehrke M Palmigiano A Canonical extensions and relational completeness of some substructural logics J. Symbolic Logic 70 (3) 713–740 (2005)
[6] Celani S.A Mench´on M.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Improved AI systems can perform relational representations of semilattices with adjunctions by translating algebraic structures into categories of S-spaces equipped with meet-relations, specifically via the category RelSP.
-
The improved system can distinguish between multirelational semantics and binary relational data by using the notion of normal mS-space to show that
under this condition, the multirelational structure can be canonically recovered from a meet-relation.
-
The system can establish a categorical isomorphism between SLataSp and SLataSp, demonstrating that
the categories RelSP and SLataSp are isomorphic
under the condition of normality. -
Improved systems can recover the left adjoint operation of an SLata by showing that
the left adjoint operation of an SLata is completely determined by its modal reduct.
-
The system can provide a relationaltopological representation where
the modal operator T and its left adjoint ∗T can be completely recovered from the associated normal and monotone relations RT and RGT, respectively.
Abstract
We develop a relational duality for semilattices with adjunctions (SLatas) based on binary meet-relations. First, we introduce the category of MoS-spaces and establish a dual equivalence with modal semilattices. Then, by means of A-relations, we define the category RelSP and prove a dual equivalence between SLata and RelSP. To compare this framework with the multirelational semantics previously developed for SLatas, we introduce the notion of normal mS-space and show that, under this condition, the multirelational structure can be canonically recovered from a meet-relation, and conversely. As a consequence, we prove that the categories RelSP and SLataSp are isomorphic.
Related papers
- The consistency strength of the failure of amenable C-sequences
- Classification of bipartite observables III: simplicity, mixtures and quantum error correction
- Indiscernible Extraction in Theories with Bounded k-splitting
- Measuring the Complexity of Countable Presburger Models
- A non-trivially non-trivial automorphism at an inaccessible cardinal
- The Ordering Principle and Higher Dependent Choice