pith. sign in

arxiv: 2006.07415 · v5 · submitted 2020-06-12 · 🧮 math.LO

Formal Concepts and Residuation on Multilattices

Blaise B. Koguep Njionou , Leonard Kwuida , Celestin Lele This is my paper

Pith reviewed 2026-05-24 14:01 UTC · model grok-4.3

classification 🧮 math.LO
keywords multilatticesresiduationformal concept analysisGalois connectionscomplete structurespure multilatticesordinal sums
0
0 comments X

The pith

A residuation-compatible Galois connection equips the set of formal concepts with a complete residuated multilattice structure.

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

The paper first establishes basic facts about residuated multilattices, including that every bounded residuated multilattice that is not a lattice has at least seven elements and that a smallest pure multilattice exists as a substructure of any other. It then applies these structures as truth-value algebras in a formal concept analysis setting. The central result states that if two complete residuated multilattices are linked by a Galois connection between their function spaces that respects the residuation operations, the fixed-point set C of pairs satisfying the mutual fixed-point condition itself carries the operations of a complete residuated multilattice. This directly generalizes an earlier theorem that obtained only the multilattice reduct without residuation.

Core claim

If A_i = (A_i, ≤_i, ⊤_i, ⊙_i, →_i, ⊥_i), i=1,2 are two complete residuated multilattices, G and M two nonempty sets and (ϕ, ψ) a Galois connection between A_1^G and A_2^M that is compatible with the residuation, then C = {(h,f) ∈ A_1^G × A_2^M ; ϕ(h)=f and ψ(f)=h} can be endowed with a complete residuated multilattice structure.

What carries the argument

The residuation-compatible Galois connection (ϕ, ψ) between the function spaces A_1^G and A_2^M, whose fixed points define the concept set C and induce the multilattice and residuation operations on it.

If this is right

  • The concept set C inherits both completeness as a multilattice and the residuation operation from the base algebras.
  • The result specializes to the known case of complete residuated lattices when the multilattices happen to be lattices.
  • Ordinal-sum constructions supply further families of residuated multilattices that are not lattices and can serve as truth-value sets.
  • Any bounded residuated multilattice that is not a lattice contains at least seven elements.

Where Pith is reading between the lines

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

  • Formal concept analysis can now be carried out directly with truth degrees whose meets and joins are not necessarily unique.
  • Data tables whose attribute values naturally exhibit multiple maximal lower bounds become amenable to the same concept-formation process without forcing a lattice reduct.
  • One could examine whether Galois connections that arise from real-valued data tables satisfy the compatibility condition required for the induced structure on C to be residuated.

Load-bearing premise

The Galois connection between the function spaces must be compatible with the residuation operations of the two multilattices.

What would settle it

An explicit pair of complete residuated multilattices together with a Galois connection that fails the compatibility condition, yet where the induced operations on C still satisfy the residuation and multilattice axioms.

read the original abstract

Multilattices are generalisations of lattices introduced by Mihail Benado. He replaced the existence of unique lower (resp. upper) bound by the existence of maximal lower (resp. minimal upper) bound(s). A multilattice will be called pure if it is not a lattice. Multilattices could be endowed with a residuation, and therefore used as set of truth-values to evaluate elements in fuzzy setting. In this paper we exhibit the smallest pure multilattice and show that it is a sub-multilattice of any pure multilattice. We also prove that any bounded residuated multilattice that is not a residuated lattice has at least seven elements. We apply the ordinal sum construction to get more examples of residuated multilattices that are not residuated lattices. We then use these residuated multilattices to evaluate objects and attributes in formal concept analysis setting, and describe the structure of the set of corresponding formal concepts. More precisely, if $\mathcal{A}_i: =(A_i,\le_i,\top_i,\odot_i,\to_i,\bot_i)$, $i=1,2$ are two complete residuated multilattices, $G$ and $M$ two nonempty sets and $(\varphi, \psi)$ a Galois connection between $A_1^G$ and $A_2^M$ that is compatible with the residuation, then we show that \[\mathcal{C}: =\{(h,f)\in A_1^G\times A_2^M; \varphi(h)=f \text{ and } \psi(f)=h \}\] can be endowed with a complete residuated multilattice structure. This is a generalization of a result by Ruiz-Calvi{\~n}o and Medina saying that if the (reduct of the) algebras $\mathcal{A}_i$, $i=1,2$ are complete multilattices, then $\mathcal{C}$ is a complete multilattice.

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

2 major / 2 minor

Summary. The paper defines residuated multilattices (multilattices equipped with a binary operation ⊙ and residuum → satisfying the standard adjointness). It exhibits the smallest pure multilattice, proves that any bounded residuated multilattice that is not a lattice has cardinality at least 7, constructs further examples via ordinal sums, and proves the following central result: if A_i = (A_i, ≤_i, ⊤_i, ⊙_i, →_i, ⊥_i) (i=1,2) are complete residuated multilattices, G and M are nonempty sets, and (ϕ, ψ) is a Galois connection between A_1^G and A_2^M that is compatible with the residuation operations, then the set C = {(h,f) ∈ A_1^G × A_2^M | ϕ(h)=f and ψ(f)=h} carries the structure of a complete residuated multilattice. This generalizes the Ruiz-Calviño–Medina theorem from the pure multilattice case.

Significance. The explicit size bound, the ordinal-sum examples, and especially the lifting of both the multilattice and residuation structure to the concept lattice C under a compatibility hypothesis on the Galois connection constitute a coherent extension of existing work. If the proofs are complete and the compatibility condition is checkable in applications, the result supplies a concrete method for producing new residuated multilattices and for performing formal concept analysis over non-lattice truth-value algebras.

major comments (2)
  1. [Theorem on the structure of C (abstract and § on formal concepts)] The manuscript states the main theorem on C but does not supply the definition of 'compatible with the residuation' nor the verification that the induced operations on C preserve the multilattice bounds and satisfy adjointness; without these steps the central claim cannot be checked.
  2. [Ordinal-sum section] The claim that the ordinal-sum construction yields residuated multilattices that are not lattices is asserted without an explicit check that the residuum on the sum satisfies the adjointness property with respect to the multilattice order; this verification is load-bearing for the supply of concrete examples.
minor comments (2)
  1. [Abstract] The abstract uses both script A and mathcal A for the algebras; adopt a single consistent notation throughout.
  2. [Introduction] The introduction should cite Benado's original multilattice paper and the precise Ruiz-Calviño–Medina reference rather than only alluding to them.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments. We address each major comment below and will revise the manuscript to incorporate the missing definitions and verifications.

read point-by-point responses

  1. Referee: [Theorem on the structure of C (abstract and § on formal concepts)] The manuscript states the main theorem on C but does not supply the definition of 'compatible with the residuation' nor the verification that the induced operations on C preserve the multilattice bounds and satisfy adjointness; without these steps the central claim cannot be checked.

    Authors: We agree that the definition of compatibility and the verification steps were not supplied in the submitted manuscript. In the revised version we will explicitly define the compatibility condition on the Galois connection (ϕ, ψ) with respect to the residuation operations of the complete residuated multilattices. We will also supply the full verification that the induced operations on C preserve the multilattice bounds and satisfy adjointness, rendering the central claim checkable. revision: yes

  2. Referee: [Ordinal-sum section] The claim that the ordinal-sum construction yields residuated multilattices that are not lattices is asserted without an explicit check that the residuum on the sum satisfies the adjointness property with respect to the multilattice order; this verification is load-bearing for the supply of concrete examples.

    Authors: We agree that an explicit verification of adjointness for the residuum is required. The revised manuscript will contain a detailed check confirming that the residuum defined on the ordinal sum satisfies the adjointness property with respect to the multilattice order, thereby substantiating that the construction produces residuated multilattices that are not lattices. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation is self-contained

full rationale

The paper's central result extends the cited Ruiz-Calviño–Medina theorem on multilattices by adding a residuation-compatibility condition on the Galois connection; this is an independent extension resting on standard definitions of multilattices (Benado) and residuation, with no reduction of claims to fitted parameters, self-definitions, or load-bearing self-citations. All steps are externally verifiable from the stated hypotheses and prior non-overlapping literature.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The paper rests on the standard definition of multilattices from Benado and the notion of residuation; no free parameters, new entities, or ad-hoc axioms beyond domain assumptions of order theory are introduced.

axioms (2)
  • domain assumption A multilattice has maximal lower bounds and minimal upper bounds rather than unique ones.
    Core definition invoked throughout the abstract and constructions.
  • domain assumption Residuation is compatible with the multilattice order and operations when the structure is residuated.
    Required for the bounded residuated multilattice claims and the Galois-connection compatibility.

pith-pipeline@v0.9.0 · 5905 in / 1380 out tokens · 30099 ms · 2026-05-24T14:01:27.009599+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

29 extracted references · 29 canonical work pages

  1. [1]

    Arnauld, P

    A. Arnauld, P. Nicole, La logique ou l'art de penser, édition critique par Dominique Descotes, Paris: Champion, 2011

    work page 2011

  2. [2]

    Belohlavek, and V

    R. Belohlavek, and V. Vychodil, Fuzzy attribute logic: Entailment and non-redundant basis, 11th International Fuzzy Systems Association World Congress, Tsinghua, China, (2005), 622 - 627

    work page 2005

  3. [3]

    Benado, Les ensembles partiellement ordonn\' e s et le th\' e or\` e me de raffinement de Schreier

    M. Benado, Les ensembles partiellement ordonn\' e s et le th\' e or\` e me de raffinement de Schreier. II. Th\' e orie des multistructures , Czechoslovak Mathematical Journal, 5(3) (1955), 308-344

    work page 1955

  4. [4]

    B e lohl a vek

    R. B e lohl a vek. Concept lattices and order in fuzzy logic. Annals of Pure

    work page

  5. [5]

    B e lohl a vek, Vil e m Vychodil

    R. B e lohl a vek, Vil e m Vychodil. Fuzzy concept lattices and

    work page

  6. [6]

    Burusco, R

    A. Burusco, R. Fuentes-Gonz--alez. The study of L-fuzzy

    work page

  7. [7]

    I. P. Cabrera, P. Cordero, J. Martinez, M. Ojeda-Aciego, On residuation in multilattices: Filters, congruences, and homomorphisms, Fuzzy Sets and Systems, (2014), 1-21

    work page 2014

  8. [8]

    Cordero, G

    P. Cordero, G. Guti e rrez, J. Martinez, M

    work page

  9. [9]

    Cornejo, J

    M. Cornejo, J. Medina, and E. Ram i rez

    work page

  10. [10]

    Davey and H

    B. Davey and H. Priestley. Introduction to Lattices and Order. Cambridge University

    work page

  11. [11]

    Diday and R

    E. Diday and R. Emilion. Maximal and stochastic galois lattices. Discrete Applied

    work page

  12. [12]

    Ganter and R

    B. Ganter and R. Wille. Formal Concept Analysis: Mathematical Foundation. Springer Verlag, (1999)

    work page 1999

  13. [13]

    J. A. Goguen, L-fuzzy sets, Journal of Mathematical Analysis and Applications, 18(1967), 145-174

    work page 1967

  14. [14]

    J. A. Goguen, The logic of inexact concepts, Synthese 19 (1968), 325-373

    work page 1968

  15. [15]

    H a jek, Metamathematics of Fuzzy Logic, Kluwer, Dordrecht 1998

    P. H a jek, Metamathematics of Fuzzy Logic, Kluwer, Dordrecht 1998

    work page 1998

  16. [16]

    H o hle, On the fundamentals of fuzzy set theory, J

    U. H o hle, On the fundamentals of fuzzy set theory, J. Math. Anal. Appl. 201 (1996), 786-826

    work page 1996

  17. [17]

    Jipsen, C

    P. Jipsen, C. Tsinakis, A survey of residuated lattices, In: Martínez J. (eds) Ordered Algebraic Structures, Developments in Mathematics, 7 (2002), Springer, Boston, MA , 19 - 56

    work page 2002

  18. [18]

    C. Lele, L. N. Maffeu, J. B. Nganou, S. E. Schmidt. Some Classes of

    work page

  19. [19]

    Georgescu and A

    G. Georgescu and A. Popescu. Concept lattices and similarity in

    work page

  20. [20]

    Kraj c i

    S. Kraj c i. A generalized concept lattice

    work page

  21. [21]

    Kraj c i

    S. Kraj c i. The basic theorem on generalized concept

    work page

  22. [22]

    L. N. Maffeu Nzoda, B. B. N. Koguep, C. Lele and L. Kwuida,Fuzzy setting of residuated multilattices, Annals of fuzzy Mathematics and informatics, 10(6) (2015), 929 - 948

    work page 2015

  23. [23]

    Medina, M

    J. Medina, M. Ojeda-Aciego,and J. Ruiz-Calvi \ n o. Concept-forming operators on multilattices. Proceedings ICFCA 2013, Dresden, Germany, May 21-24, LNAI 7880, (2013), 203-215

    work page 2013

  24. [24]

    Medina, M

    J. Medina, M. Ojeda-Aciego, and J. Ruiz-Calvi \ n o. On the ideal semantics of multilattices-based logic programs, Fuzzy Sets and Systems, 158(6) (2007), 674-688

    work page 2007

  25. [25]

    Medina, M

    J. Medina, M. Ojeda-Aciego, and J. Ruiz-Calvi \ n o. Fuzzy logic programming

    work page

  26. [26]

    Pollandt

    S. Pollandt. Fuzzy Begriffe. Springer, Berlin, 1997

    work page 1997

  27. [27]

    Ruiz-Calvi \ n o, and J.\,Medina

    J. Ruiz-Calvi \ n o, and J.\,Medina. Fuzzy formal concept analysis via multilattices: first prospects and results. Prodeedings CLA 2012, 69-79

    work page 2012

  28. [28]

    R. Wille. Restructuring lattice theory: an approach based on hierarchies of concepts. In I

    work page

  29. [29]

    L. A. Zadeh, Fuzzy sets, Inf. Control 8, (1965) 338-353

    work page 1965