Pith. sign in

REVIEW 3 major objections 3 minor 20 references

Left-continuous pseudo-t-norms on modular lattices

T0 review · 3 major / 3 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read The paper establishes that on a complete atomistic lattice, the existence of a left-continuous pseudo-t-norm is equivalent to the lattice being Boolean, so outside Boolean lattices no such fuzzy conjunction can exist.

desk verdict The central equivalence is false: Proposition 4.2 has a simple counterexample, so Theorem 4.1 cannot stand—though the ordinal-sum and planar-construction parts may be salvageable. read the letter →

arxiv 2506.07567 v1 pith:X6SCZRGV submitted 2025-06-09 math.RT

Peng He , Xue-ping Wang This is my paper
classification math.RT MSC 03E7203B5203G1006B05
keywords Atomisticlattice1-distributivityLeft-continuouspseudo-t-normt-normModularPlanarBooleanOrdinalsum
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

This paper asks when a complete lattice can carry a left-continuous pseudo-t-norm, a non-associative generalization of the t-norms used in fuzzy logic to model 'and'. Its central result is a structure theorem: for complete atomistic lattices, having any left-continuous pseudo-t-norm forces the lattice to be a Boolean lattice, and conversely Boolean lattices carry the meet operation as a continuous t-norm; the structural property at work, called 1-distributivity, is a weak distributive law that applies only to triples whose join is the top element. This turns an operator-existence question into a purely structural one, showing that associativity is not the obstacle: continuous t-norms, left-continuous t-norms, and left-continuous pseudo-t-norms all exist on exactly the same complete atomistic lattices. The paper also gives a finite obstruction list for finite modular lattices and characterizes a family of planar modular lattices that do carry such operators, so a reader can see precisely which lattice structures support left-continuous fuzzy conjunctions.

What carries the argument

The central mechanism is 1-distributivity, a weakening of distributivity that only inspects triples with $a \vee b = 1$: an element $c$ is 1-distributive when $c \wedge (a \vee b) = (c \wedge a) \vee (c \wedge b)$ for every such pair. Left-continuity of a pseudo-t-norm implies $\vee$-distributivity, and $\vee$-distributivity of a pseudo-t-norm forces the underlying lattice to be 1-distributive; on complete atomistic lattices 1-distributivity then collapses to Booleanity, where the meet operation itself is a continuous t-norm. For finite modular lattices the obstruction is finitary: the three 1-sublattices $M_3$, $M_{3,2}$ and $M_{3,4}$ are exactly the forbidden configurations. For planar modular lattices the construction of a $\vee$-distributive pseudo-t-norm is carried by an interval $[a \wedge b, 1]$ that forms a rectangular distributive sublattice, on which a piecewise definition of the operator reduces verification of $\vee$-distributivity to distributivity of that interval.

What would settle it

A finite non-Boolean atomistic lattice that is 1-distributive, or one that admits a left-continuous pseudo-t-norm, would settle the central claim against it; an exhaustive check of lattices with three or four atoms is enough to look for either.

Watch

Extended reading notes

Core claim

The paper's central discovery is that the existence of left-continuous pseudo-t-norms is a structural property of lattices. Theorem 4.1 states that for any complete atomistic lattice $L$, the following five conditions are equivalent: $L$ is 1-distributive; $L$ is isomorphic to the power set $2^{A(L)}$ of its atoms; $L$ carries a continuous t-norm; $L$ carries a left-continuous t-norm; and $L$ carries a left-continuous pseudo-t-norm. The equivalence is obtained by showing that every $\vee$-distributive pseudo-t-norm forces 1-distributivity (Proposition 4.3), and that a complete atomistic lattice is 1-distributive only when it is Boolean (Proposition 4.2). For finite modular lattices the same 1-distributivity is characterized by the absence of three forbidden 1-sublattices, $M_3$, $M_{3,2}$ and $M_{3,4}$ (Theorem 4.2), and for a class of finite planar modular lattices the paper constructs an explicit $\vee$-distributive pseudo-t-norm from the lattice structure (Theorem 5.2). Along the way, Theorem 3.1 shows that a left-continuous t-norm exists on an ordinal sum $L_1 \oplus L_2$ exactly when one exists on the upper summand $L_2$.

Load-bearing premise

The load-bearing premise is an unproved structural assertion inside Proposition 4.2: any complete atomistic lattice that is not the full power set of its atoms must contain two elements whose join is the top element but whose collections of atoms do not together cover all atoms.

Editorial extensions

If this is right

  • On every complete atomistic lattice that is not Boolean, no left-continuous pseudo-t-norm exists; in particular, no left-continuous fuzzy conjunction can be defined on such a lattice.
  • For complete atomistic lattices the distinction between continuous t-norms, left-continuous t-norms, and left-continuous pseudo-t-norms disappears: all three exist exactly when the lattice is Boolean.
  • The existence of a left-continuous t-norm on an ordinal sum of two complete lattices depends only on the upper summand, so adding a lower lattice below it never blocks the construction.
  • A finite modular lattice carries a $\vee$-distributive pseudo-t-norm only if it contains none of $M_3$, $M_{3,2}$, or $M_{3,4}$ as a 1-sublattice, giving a finite checkable obstruction.
  • For finite rectangular modular lattices, being 1-distributive, being distributive, and admitting a continuous t-norm are all equivalent, so the meet operation itself is the canonical operator when one exists.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A consequence the paper leaves implicit is that associativity is not what blocks left-continuous fuzzy conjunctions on atomistic lattices; the lattice structure alone decides, so dropping associativity does not enlarge the class of lattices that work.
  • The unproved structural step in Proposition 4.2 could be checked directly by enumerating finite complete atomistic lattices; any non-Boolean one that is 1-distributive would force a different proof of the only-if direction of Theorem 4.1.
  • The forbidden-sublattice criterion for finite modular lattices suggests a practical recognition procedure: search a finite lattice for 1-sublattices isomorphic to $M_3$, $M_{3,2}$, or $M_{3,4}$ to decide 1-distributivity.
  • The planar construction in Theorem 5.2 produces pseudo-t-norms that may fail associativity, so a natural next question is whether the same planar lattices always admit a genuine left-continuous t-norm, or whether some admit only the non-associative version.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 3 minor

Summary. The paper studies when complete lattices admit left-continuous t-norms and pseudo-t-norms. It first proves a necessary and sufficient condition for a left-continuous t-norm to exist on the ordinal sum of two complete lattices (Theorem 3.1). It then introduces the notion of 1-distributivity, claims a complete atomistic lattice is 1-distributive if and only if it is Boolean (Proposition 4.2), and uses this to assert that for a complete atomistic lattice the existence of a left-continuous pseudo-t-norm (or t-norm, or continuous t-norm) is equivalent to being a Boolean lattice (Theorem 4.1). The paper also gives a forbidden-sublattice characterization of finite modular 1-distributive lattices (Theorem 4.2) and applies these ideas to planar modular lattices (Theorems 5.1 and 5.2).

Significance. If Theorem 4.1 were correct, it would be a striking structural result: for complete atomistic lattices, the existence of a left-continuous fuzzy conjunction would force Boolean structure, and the equivalence of 1-distributivity with distributivity would be a clean lattice-theoretic characterization. The paper also contains useful auxiliary material: Proposition 4.3 is a correct and simple observation, and Theorem 3.1 on ordinal sums is a plausible standalone contribution. However, the central theorem is false. An explicit 12-element complete atomistic lattice that is 1-distributive but not Boolean disproves Proposition 4.2 and therefore the whole equivalence chain of Theorem 4.1. The claimed significance is not achieved.

major comments (3)
  1. [Section 4, Proposition 4.2] The asserted implication "if L is not Boolean then there exist a,b with a∨b=1 and A(a)∪A(b)≠A(L)" is false. A counterexample is the closure system on A={1,2,3,4} whose closed sets are ∅, all singletons, {1,3}, {2,3}, {3,4}, {1,2,3}, {1,3,4}, {2,3,4}, and A. This is a complete atomistic lattice that is not Boolean because {1,3} has no complement. Yet every pair x,y with x∨y=1 satisfies A(x)∪A(y)=A: the maximal proper closed sets are the three triples, and a union that is not contained in any of them must contain 1, 2, and 4, which forces the union to be all of A. Consequently the lattice is 1-distributive, since c is the join of the atoms it contains and each such atom lies below x or y whenever x∨y=1. This directly refutes Proposition 4.2 and also Remark 4.2.
  2. [Theorem 4.1] Since Proposition 4.2 is false, the implication (a)⇒(b) fails, and the claimed equivalence of (a)–(e) collapses. The counterexample described above is a complete atomistic lattice that is 1-distributive but not Boolean, so (a) holds while (b) fails. The proof of Theorem 4.1 relies entirely on Proposition 4.2 for this direction, so the central result of the paper is not valid as stated. The remaining implications (c)⇒(d)⇒(e)⇒(a) are correct, but they do not recover the equivalence without the false step.
  3. [Theorem 4.2, Case (I)] In Case (I), the proof concludes that there is a 1-sublattice M3={a,b,c,a∧b∧c,1}. However, the case assumption only gives a∨c=b∨c, not a∨c=b∨c=1. Since a∨b=1 does not force a∨c=1 in a general modular lattice, the five elements listed need not form an M3 with top element 1. The proof does not supply a separate argument that a∨c=1, so the presence of the forbidden 1-sublattice M3 is not established. This gap affects the necessity part of Theorem 4.2 and the applications that depend on it, including Theorem 5.1.
minor comments (3)
  1. [Remark 3.2] The phrase "t-noms" is a typo for "t-norms" and appears twice; also, the stated "if and only if" would benefit from an explicit proof or reference, since Proposition 3.1 only proves one direction.
  2. [Definition 4.1] The definition of 1-distributivity says "an element c of L is called 1-distributive" but the displayed identity involves a,b as well; the phrasing should clarify that c is 1-distributive when the identity holds for all a,b with a∨b=1.
  3. [Example 5.1] The table is a helpful illustration, but the sentence verifying non-associativity writes T(T(f,g),h)=T(f,h)=a and T(f,e)=0; consider adding the intermediate values T(f,g)=f and T(g,h)=e to make the check easier to follow.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: central equivalences are proved directly from definitions; the only notable weakness is an unproved structural step in Proposition 4.2, which is a correctness gap, not a circularity.

full rationale

Score 0. The derivation chain is not circular: each implication in Theorem 4.1 is obtained either from Definitions 2.1-2.2 and the continuity equations (Eqs. (1)-(2)), or from the independently proved Proposition 4.3, whose proof uses only the axioms of a pseudo-t-norm and the inequality T(a,b)≤a∧b. Proposition 4.2 is load-bearing for (a)⇒(b), but it is presented as a structural lattice argument rather than assumed; the disputed step "As a result, there exist two elements a,b∈L such that a∨b=1 while A(a)∪A(b)≠A(L)" is an unproved implication and a potential correctness gap, not a definitional equivalence or fitted-prediction. Theorem 4.2 and Theorem 5.2 are constructive: the former builds forbidden sublattices from a non-1-distributive element, and the latter explicitly defines T by Eq. (10) and verifies ∨-distributivity. Self-citations (e.g., [16] by Xue-ping Wang) appear only in definitions and background, and no load-bearing claim is justified by a self-citation chain. The paper is self-contained against external lattice-theoretic benchmarks; no circularity found.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The central claims rest on the standing commutativity assumption, the chosen algebraic definition of left-continuity, standard lattice-theoretic background, and one unproved implication in the proof of Proposition 4.2. No free parameters or invented entities appear, typical for a structural lattice-theory paper.

assumptions (5)
  • standard math ZFC set theory and standard lattice-theoretic results (Birkhoff, Grätzer-Wehrung) used throughout
    The proofs rely on classical theorems about lattices, modularity, ordinal sums and glued sums, cited in Sections 2 and 3.
  • domain assumption All pseudo-t-norms are assumed commutative (stated after Definition 2.1)
    This restriction is necessary for the paper's characterizations; non-commutative pseudo-t-norms are excluded.
  • domain assumption Left-continuity is defined as join-distributivity over arbitrary non-empty joins (Eq. 1)
    The paper's notion of left-continuity on complete lattices is this algebraic identity, not a topological definition.
  • ad hoc to paper A non-Boolean complete atomistic lattice contains a,b with a∨b=1 and A(a)∪A(b)≠A(L) (unproved step in Proposition 4.2)
    This implication is asserted with 'As a result' in the proof of Proposition 4.2 but no derivation is supplied; it is load-bearing for Theorem 4.1.
  • domain assumption Theorem 5.2 restricts to finite planar modular lattices with exactly one bi-irreducible element on at least one boundary chain, excluding {0,1} both bi-irreducible (Remark 5.1)
    The explicit pseudo-t-norm construction of Eq. (10) is only defined and verified under this structural hypothesis.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Left-continuous pseudo-t-norms on modular lattices." pith.science (2026). https://pith.science/paper/X6SCZRGV

@misc{pith2026250607567,
  author       = {Pith},
  title        = {Pith review of: Left-continuous pseudo-t-norms on modular lattices},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/X6SCZRGV}},
  note         = {Machine review of arXiv:2506.07567}
}
abstract

This article focuses on the relationship between pseudo-t-norms and the structure of lattices. First, we establish a necessary and sufficient condition for the existence of a left-continuous t-norm on the ordinal sum of two disjoint complete lattices. Then, we define the $1$-distributivity of a lattice, which is applied for characterizing a complete atomistic lattice that has a left-continuous pseudo-t-norm. We also describe the forbidden structures of a finite modular lattice that is a $1$-distributive lattice, which is used for representing a kind of finite planar modular lattices that have left-continuous pseudo-t-norms.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

20 extracted references · 20 canonical work pages

  1. [1]

    Alsina, E

    C. Alsina, E. Trillas, L. Valverde, On some logical connectives for fuzzy sets theory, J. Math. Anal. Appl. 93 (1983) 15-26

    work page 1983

  2. [2]

    Bellman, M

    R. Bellman, M. Giertz, On the analytic formalism of the theory of fuzzy set, Inf. Sci. 5 (1973) 149-156

    work page 1973

  3. [3]

    Birkhoff, Lattice Theory, vol.XXV, 3rd ed., American Mathematical Society Col- loquium Publications, Providence, RI, 1973

    G. Birkhoff, Lattice Theory, vol.XXV, 3rd ed., American Mathematical Society Col- loquium Publications, Providence, RI, 1973

    work page 1973

  4. [4]

    Crawley, R

    P. Crawley, R. P. Dilworth, Algebraic Theory of Lattices, Prentice Hall, Englewood Cliffs, NJ, 1973

    work page 1973

  5. [5]

    De Baets, R

    B. De Baets, R. Mesiar, Triangular norm on product lattices, Fuzzy Sets Syst. 104 (1999) 61-75

    work page 1999

  6. [6]

    De Coomann, E.E

    G. De Coomann, E.E. Kerre, Order norms on bounded partially ordered sets, J. Fuzzy Math. 2 (1994) 281-310

    work page 1994

  7. [7]

    Dubois, H

    D. Dubois, H. Prade, Fuzzy Sets in approximate reasoning, Part I: inference with possibility distributions, Fuzzy Sets Syst. 40 (1991) 143-202. 17

    work page 1991

  8. [8]

    J. C. Fodor, On fuzzy implications operators, Fuzzy Sets Syst. 42 (1991) 293-300

    work page 1991

Show all 20 references
  1. [9]

    Gr¨ atzer and E

    G. Gr¨ atzer and E. Knapp, Notes on planar semimodular lattices. I. Construction, Acta Sci. Math. 73 (2007) 445-462

    2007

  2. [10]

    Gr¨ atzer and E

    G. Gr¨ atzer and E. Knapp, Notes on planar semimodular lattices. IV. the size of a minimal congruence lattice representation with rectangular lattices, Acta Sci. Math. 76 (2010) 3-26

    2010

  3. [11]

    Gr¨ atzer and F

    G. Gr¨ atzer and F. Wehrung, Lattice theory: special topics and applications, Birkh¨ auser, Basel, 2014

    2014

  4. [12]

    Kelly and I

    D. Kelly and I. Rival, Planar lattices, Can. J. Math. 27 (1975) 636-665

    1975

  5. [13]

    Z. R. Ma, W. M. Wu, Logical operators on complete Lattices, Inf. Sci. 55 (1991) 77-97

    1991

  6. [14]

    Saminger, On ordinal sums of triangular norms on bounded lattices, Fuzzy Sets Syst

    S. Saminger, On ordinal sums of triangular norms on bounded lattices, Fuzzy Sets Syst. 157 (2006) 1403-1416

    2006

  7. [15]

    Saminger, E

    S. Saminger, E. P. Klement, R. Mesiar, On extensions of triangular norms on bounded lattices, Indag. Mathern., N.S. 19 (2008) 135-150

    2008

  8. [16]

    153 (2005) 249-260

    Xue-ping Wang, Qing-quan Xiong, The solution set of a fuzzy relational equation with sup-conjunctor composition in a complete lattice, Fuzzy Sets Syst. 153 (2005) 249-260

    2005

  9. [17]

    Z. D. Wang, Y. D. Yu, Pseudo-t-norms and implication operators on a complete Brouwerian lattice, Fuzzy Sets Syst. 132 (2002) 113-124

    2002

  10. [18]

    Z. D. Wang, Y. D. Yu, Pseudo-t-norms and implication operators: direct products and direct product decompositions, Fuzzy Sets Syst. 139 (2003) 673-683

    2003

  11. [19]

    Weber, A general concept of fuzzy connectives, negations and implications based on t-norms and t-conorms, Fuzzy Sets Syst

    S. Weber, A general concept of fuzzy connectives, negations and implications based on t-norms and t-conorms, Fuzzy Sets Syst. 11 (1983) 115-134

    1983

  12. [20]

    L. A. Zadeh, A fuzzy-algorithmic approach to the definition of complex or imprecise concepts, Int. J. Man-Mach. Stud. 8 (1976) 249-291. 18

    1976

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.