pith. sign in

arxiv: 2606.25131 · v1 · pith:U4IYLTKUnew · submitted 2026-06-23 · 🧮 math.LO

Priestley Representation of Distributive Precontact Lattices

Sergio A. Celani , Luciana Valenzuela This is my paper

Pith reviewed 2026-06-25 21:30 UTC · model grok-4.3

classification 🧮 math.LO
keywords precontact latticesdistributive latticesPriestley dualityprecontact relationlattice preorderprecontact congruencedual space
0
0 comments X

The pith

Bounded distributive lattices with a precontact relation admit a Priestley duality in which relation conditions become first-order properties of the dual space.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper defines precontact lattices as bounded distributive lattices equipped with a precontact relation. It shows that, unlike the Boolean case, precontact relations are not interdefinable with quasi-modal operators or subordination relations in this setting. The work establishes how properties of the precontact relation translate into first-order conditions on the Priestley dual space. It also gives characterizations of substructures, strong sublattices, and congruences using a lattice preorder and closed sets in the dual.

Core claim

Precontact lattices are bounded distributive lattices with a precontact relation; the Priestley representation theorem extends to this class by associating the relation with a binary relation on the dual space such that first-order properties of that relation encode the original conditions, precontact substructures correspond to certain preorders on the lattice, and precontact congruences correspond to closed subsets of the dual space.

What carries the argument

The Priestley dual space of the underlying distributive lattice, equipped with an additional binary relation induced by the precontact relation.

If this is right

  • Conditions imposed on the precontact relation can be verified by checking corresponding first-order sentences in the Priestley dual.
  • Precontact substructures and strong precontact sublattices are determined by a suitable lattice preorder.
  • Precontact congruences correspond exactly to closed sets in the dual space.
  • The representation separates the study of the lattice order from the study of the precontact relation via the dual.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The duality may allow algorithmic checks of precontact properties by translating them into properties of finite dual spaces.
  • The preorder characterization could be used to define morphisms between precontact lattices that preserve both order and relation.
  • The closed-set description of congruences opens the possibility of a quotient construction that remains within the class of precontact lattices.

Load-bearing premise

The precontact relation is assumed to satisfy the compatibility conditions with the lattice operations that keep the dual object a Priestley space.

What would settle it

A concrete bounded distributive lattice with a precontact relation whose dual fails to satisfy the claimed first-order property that the paper associates with a given condition on the relation.

read the original abstract

It is well known that, in Boolean algebras, the notions of precontact relation, quasi-modal operator, and subordination relation are interdefinable. In contrast, within the setting of distributive lattices, this equivalence holds only between quasi-modal operators and subordination relations, but not with precontact relations. In this paper, we study the class of bounded distributive lattices equipped with a precontact relation, referred to as precontact lattices. We also examine how conditions imposed on the precontact relation correspond to first-order properties in the Priestley dual. In addition, we characterize precontact substructures and strong precontact sublattices of precontact lattices in terms of a suitable lattice preorder. Finally, we introduce a notion of precontact congruence and identify the corresponding closed sets in the dual space.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper defines precontact lattices as bounded distributive lattices equipped with a precontact relation. It investigates the correspondence between conditions on this relation and first-order properties of the Priestley dual space. It also characterizes precontact substructures and strong precontact sublattices via a suitable lattice preorder, and introduces precontact congruences whose corresponding closed sets in the dual space are identified. The work extends the known interdefinability of precontact, quasi-modal, and subordination notions from Boolean algebras to the distributive setting via Priestley duality.

Significance. If the claimed correspondences and characterizations are established, the paper supplies a duality framework for precontact relations on distributive lattices, extending classical Priestley duality in a natural direction. This could support further study of modal-like or contact structures outside the Boolean case. The approach relies on standard tools of the field without introducing free parameters or ad-hoc axioms.

minor comments (2)
  1. The abstract states that the equivalence between precontact relations, quasi-modal operators, and subordination relations fails in the distributive case, but the manuscript should explicitly recall the precise definitions of these three notions (and their interdefinability in the Boolean case) in §1 or §2 to make the contrast self-contained.
  2. The characterization of precontact substructures in terms of a lattice preorder is announced; the precise preorder and the statement of the theorem should be numbered for easy reference.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their summary of the manuscript and for noting its potential significance in extending Priestley duality to precontact relations on distributive lattices. The recommendation is listed as uncertain, but the report contains no specific major comments requiring response.

Circularity Check

0 steps flagged

No significant circularity; derivation extends external Priestley duality

full rationale

The paper applies the classical Priestley duality theorem (an independent, externally established result for bounded distributive lattices) to the newly introduced class of precontact lattices. The abstract describes correspondences between precontact conditions and first-order properties on the dual space, plus characterizations of substructures and congruences, all framed as standard duality extensions without any equations, fitted parameters, or self-citations that reduce claimed results to inputs by construction. No load-bearing steps match the enumerated circularity patterns.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper relies on the standard axioms of bounded distributive lattices and the definition of a precontact relation; no free parameters are introduced and no new entities are postulated beyond the objects already named in the literature.

axioms (2)
  • standard math Bounded distributive lattice axioms (distributivity, bounds 0 and 1)
    Invoked throughout as the base structure on which the precontact relation is defined.
  • standard math Priestley duality theorem for bounded distributive lattices
    Used as the background representation that is extended to the precontact setting.

pith-pipeline@v0.9.1-grok · 5656 in / 1368 out tokens · 10711 ms · 2026-06-25T21:30:38.864447+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

31 extracted references · 1 canonical work pages

  1. [1]

    Applied Categorical Structures, (2016), 1-26

    Bezhanishvili G., Bezanishvili N., Sourabh S., and Venema Y.: Irre- ducible Equivalence Relations, Gleason Spaces, and De Vries Duality. Applied Categorical Structures, (2016), 1-26

    2016

  2. [2]

    A.: Quasi-Modal algebras

    Celani S. A.: Quasi-Modal algebras. Mathematica Bohemica. Vol. 126, No 4 (2001), 721-736

    2001

  3. [3]

    A.: Quasi-Modal lattices

    Castro J., and Celani S. A.: Quasi-Modal lattices. Order. 21, (2004), 107-129

    2004

  4. [4]

    A.: Precontact relations and quasi-modal operators in Boolean algebras

    Celani S. A.: Precontact relations and quasi-modal operators in Boolean algebras. Actas del XIII Congreso Dr. Antonio Monteiro (2016), Univ. Nac. del Sur, 2016, pp. 63-79. Available in http://inmabb- conicet.gob.ar/publicaciones/actas-del-congreso-monteiro/13. 36

    2016

  5. [5]

    A.: Distributive lattices with a negation operator, Mathemat- ical Logic Quarterly, (1999), 45, 207-218

    Celani S. A.: Distributive lattices with a negation operator, Mathemat- ical Logic Quarterly, (1999), 45, 207-218

    1999

  6. [6]

    A.: Simple and subdirectly irreducibles bounded distributive lattices with unary operators

    Celani S. A.: Simple and subdirectly irreducibles bounded distributive lattices with unary operators. International Journal of Mathematics and Mathematical Sciences Volume 2006 (2006), Article ID 21835, 20 pages

    2006

  7. [7]

    A.: Subdirectly irreducible quasi-modal algebras

    Celani S. A.: Subdirectly irreducible quasi-modal algebras. Acta Matemática Universitatis Comenianae, No 2, (2005), 119-228

    2005

  8. [8]

    Order 8 (1991), 299–315

    Cignoli R., Lafalce S., and Petrovich A.: Remarks on Priestley duality for distributive lattices. Order 8 (1991), 299–315

    1991

  9. [9]

    Davey, B., and Priestley, H. (2002). Introduction to Lattices and Order (2nd ed.). Cambridge: Cambridge University Press. doi:10.1017/CBO9780511809088

    work page doi:10.1017/cbo9780511809088 2002

  10. [10]

    de Vries: Compact spaces and compatifications

    H. de Vries: Compact spaces and compatifications. An algebraic ap- proach. PhD thesis, University of Amsterdam, 1962

    1962

  11. [11]

    Dimov, G., and Vakarelov, D. (2006). Topological representation of pre- contact algebras, in: W. MacCaull, M. Winter, I. Düntsch (Eds.), Re- lation Methods in Computer Science, in: Lecture Notes in Computer Science, vol. 3929, Springer-Verlag, Berlin, Heidelberg, 2006, pp. 1–16

    2006

  12. [12]

    Dimov, G., and Vakarelov, D. (2006). Contact algebras and region-based theory of space: A proximity approach – I. Fundamenta Informaticae, 74, 209–249

    2006

  13. [13]

    Dimov, G., and Vakarelov, D. (2017). Topological representation of pre- contact algebras and a connected version of the Stone Duality Theorem – I. Topology and its Applications, Volume 227 (2017), Pages 64-101

    2017

  14. [14]

    In Relational Methods for Computer Science Applications, pp

    Düntsch I., and Orłowska E.: Beyond modalities: Sufficiency and mixed algebras. In Relational Methods for Computer Science Applications, pp. 263–285, Physica-Verlag HD, 2001

    2001

  15. [15]

    Journal of Applied Non-Classical Logics, 27(3–4) (2017), 304– 320

    Düntsch I., Orłowska E., and Tinchev T.: Mixed algebras and their logics. Journal of Applied Non-Classical Logics, 27(3–4) (2017), 304– 320

    2017

  16. [16]

    76, (2008), 18–34

    Düntsch I., MacCaull W., Vakarelov D., and Winter M.: Distributive contactlattices: Topologicalrepresentation.J.LogicAlgebraicProgram. 76, (2008), 18–34. 37

    2008

  17. [17]

    Düntsch I., and Vakarelov D.: Region-based theory of discrete spaces: a proximity approach. Ann. Math. Artif. Intell., 49 (1-4), (2007), 5–14

    2007

  18. [18]

    Düntsch I., and Winter M.: A representation theorem for Boolean con- tact algebras, Theoret. Comput. Sci. (B) 347 (2005) 498–512

    2005

  19. [19]

    Extension properties of Boolean contact algebras

    Düntsch I., and Sanjiang Li. Extension properties of Boolean contact algebras. International Conference on Relational and Algebraic Methods in Computer Science. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012

    2012

  20. [20]

    Freksa, D.M

    Galton A.: The mereotopology of discrete spaces, in: C. Freksa, D.M. Mark (Eds.), Spatial Information Theory, Proceedings of the Interna- tional Conference, COSIT’99, in: Lecture Notes in Computer Science, Springer-Verlag, 1999, pp. 251–266

    1999

  21. [21]

    Katalin Bimbo (ED) J

    Goldblatt R., and Grice M.: Mereocompactness and duality for mereotopological spaces. Katalin Bimbo (ED) J. Michael Dunn on Infor- mation based Logics, Outstanding Contributions in Logic, vol 8, 2016

    2016

  22. [22]

    and Menchón P..: From Contact Relations to Modal Operators, and Back, Studia Logica, 111(5):717–748

    Gruszczyński R. and Menchón P..: From Contact Relations to Modal Operators, and Back, Studia Logica, 111(5):717–748

  23. [23]

    Ivanova T., and Vakarelov D.: Distributive mereotopology: extended distributive contact lattices, Annals of Mathematics and Artificial Intel- ligence, (2016), 77, 3–41

    2016

  24. [24]

    A., and Warrack D.: Proximity Spaces

    Naimpally S. A., and Warrack D.: Proximity Spaces. Cambridge Uni- versity Press, Cambridge, 1970

    1970

  25. [25]

    Gehrke, B

    M. Gehrke, B. Jónsson, Bounded distributive lattices with operators, Math. Japon. 40 (2) (1994) 207–215

    1994

  26. [26]

    Sabine Koppelberg, Ivo Düntsch, and Michael Winter,Remarks on con- tact relations on Boolean algebras, Algebra universalis, 68(3), (2012), 353-366

    2012

  27. [27]

    Studia Logica 56 (1996), pp

    Petrovich A., Distributive Lattices with an operator. Studia Logica 56 (1996), pp. 205-224

    1996

  28. [28]

    A.: Representation of distributive lattices by means of or- dered Stone spaces

    Priestley H. A.: Representation of distributive lattices by means of or- dered Stone spaces. Bull. London Math. Soc. 2 (1970), 186-190

    1970

  29. [29]

    A.: Ordered topological spaces and the representation of distributive lattices

    Priestley H. A.: Ordered topological spaces and the representation of distributive lattices. Proc. London Math. Soc. 3 (1972), 507-530. 38

    1972

  30. [30]

    Thron, W.J.: Proximity structures and grills, Math. Ann. 206 (1973) 35–62

    1973

  31. [31]

    II, 267–348, Springer, New York, 2007

    Vakarelov D.: Region-based theory of space: Algebras of regions, repre- sentation theory, and logics, in: Mathematical Problems from Applied Logic. II, 267–348, Springer, New York, 2007. MR 2344365. 39

    2007