Next Article in Journal
On Some Properties of Multi-Valued Feng–Liu-Type Operators in Metric Spaces
Previous Article in Journal
Extending the A Priori Procedure (APP) to Analysis of Variance Models under Normality
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Triangular Norm-Based Elements on Bounded Lattices

Department of Mathematics, Karadeniz Technical University, Trabzon 61080, Turkey
*
Author to whom correspondence should be addressed.
Axioms 2024, 13(1), 23; https://doi.org/10.3390/axioms13010023
Submission received: 11 October 2023 / Revised: 10 December 2023 / Accepted: 12 December 2023 / Published: 29 December 2023
(This article belongs to the Section Algebra and Number Theory)

Abstract

:
In this study, we introduce the notion of the T-irreducible element as a generalization of the notion of the meet-irreducible element in complete lattices. We derive some related properties of these elements and T-prime elements. We prove that T-irreducible elements and T-prime elements are preserved under the isomorphism that is generated by the same t-norm. We discuss the relationship between the sets of T-prime elements and co-atoms under some conditions. We illustrate this discussion with some examples. We also give some characterizations for the sets of T-irreducible elements and T-prime elements on the direct product of lattices. Then, we show that Theorem 2 given by Karaçal and Sağıroğlu is false by giving some counterexamples. We present a necessary and sufficient condition for the mentioned theorem to be correct.
MSC:
03B52; 06B05

1. Introduction

Decompositions into “irreducible parts” play a central role in many structure theories and often the background is a purely order-theoretical one. The concepts of prime, coprime, join-irreducible, meet-irreducible, atom, and co-atom work well, and these types of elements can be used for the characterization of lattices of certain types. For example, a lattice is distributive if and only if every join-irreducible element is coprime. Similarly, a lattice is meet-pseudocomplemented if and only if each atom is coprime. Furthermore, lattices are decomposed into sublattices by these elements in order that properties of the sublattice generally help to derive properties of the original lattice.
Triangular norms (briefly t-norms) are a special class of aggregation operators that are used in a wide range of fields of application: applied mathematics (e.g., probability, statistics, decision theory) and computer sciences (e.g., artificial intelligence, operations research), as well as many applied fields (economics and finance, pattern recognition and image processing, data fusion, multicriteria decision aid, automated reasoning, etc.) [1]. T-norms have become especially popular as models for fuzzy sets intersection. They act as an extended operator of meet that is used as a conjunction in fuzzy logic [2]. They are also applied in probabilistic metric spaces, many-valued logic, non-additive measures and integrals, etc. [3]. Many authors have studied with t-norms on bounded lattices [4,5,6,7,8,9]. Yılmaz and Kazancı have presented a method for generating t-norms on a finite distributive lattice by means of ∨-irreducible elements [10]. Karaçal and Sağıroğlu have introduced the concepts of the T-prime element and T-prime radical element and have studied their properties on complete lattices [11].
This paper is organized as follows. In Section 2, we recall some preliminaries regarding the lattice theory and triangular norms. In Section 3, we define the concept of the T-irreducible element and investigate some algebraic properties of the sets of T-irreducible elements and T-prime elements. We also give some illustrative examples and characterizations of the sets of T-irreducible elements and T-prime elements on direct product of lattices. In Section 4, we point out that Theorem 2 in [11] is not true in general. We give some appropriate counterexamples. We suggest a necessary and sufficient condition that makes Theorem 2 [11] correct.

2. Preliminaries

In this section, we recall some definitions and previous results for the sake of convenience; see [4,12,13,14].
A lattice is a partially ordered set L where any two elements have a greatest lower bound (also called meet or infimum) denoted by x y , and a least upper bound (also called join or supremum) denoted by x y . A bounded lattice is a lattice L in which there exist two elements 0 , 1 such that 0 x 1 for all x L . Here, 0 is said to be the least element and 1 is said to be the greatest element. The elements x , y in a lattice L are comparable if x y or y x . Otherwise, x and y are incomparable; in notation, x     y . A chain is a lattice in which there are no pairs of incomparable elements. Throughout the paper, L denotes a bounded lattice with at least two elements, unless otherwise stated.
Definition 1.
An element x of L is called a co-atom if x is a maximal element of the set L 1 . We denote the set of all co-atoms in L by C L .
Definition 2.
The length of a finite chain x 1 x 2 x 3 x n 1 x n in L is defined to be n 1 . The length ( L ) of L is defined as the supremum of the lengths of the chains in L. If ( L ) is finite, then L is said to be of finite length.
Definition 3.
Let L 1 , 1 , 0 1 , 1 1 and L 2 , 2 , 0 2 , 1 2 be two bounded lattices. The direct product of L 1 and L 2 is the bounded lattice L 1 × L 2 , , 0 1 , 0 2 , 1 1 , 1 2 with partial order relation ≤ defined by ( x 1 , y 1 ) ( x 2 , y 2 ) if and only if x 1 1 x 2 in L 1 and y 1 2 y 2 in L 2 .
Definition 4.
A triangular norm (briefly t-norm) is a binary operation on L that is monotone, commutative, associative, and has the neutral element 1.
Definition 5.
Let T 1 , T 2 be two t-norms on L. T 1 is called smaller than T 2 or T 2 is called greater than T 1 if T 1 x , y T 2 x , y for all x , y L . In this case, we write T 1 T 2 .
Example 1.
The following are the smallest and the greatest t-norm on L, respectively:
T W ( x , y ) = y , x = 1 x , y = 1 0 , otherwise .
T M x , y = x y .
Proposition 1.
Let T 1 and T 2 be t-norms on bounded lattices L 1 and L 2 , respectively. Then, the direct product T 1 × T 2 of T 1 and T 2 defined by
T 1 × T 2 x 1 , y 1 , x 2 , y 2 = ( T 1 x 1 , x 2 , T 2 y 1 , y 2 )
is a t-norm on the product lattice L 1 × L 2 .
Definition 6.
Let L 1 and L 2 be two lattices and φ : L 1 L 2 . Then, φ is called a lattice homomorphism if and only if, for all x , y L 1 , φ ( x y ) = φ ( x ) φ ( y ) and φ ( x y ) = φ ( x ) φ ( y ) . If φ is bijective, then φ is called a lattice isomomorphism.
Definition 7
([11]). Let L be a complete lattice and T be a t-norm on L. A p L \ 1 is called a T p r i m e e l e m e n t if and only if it satisfies T ( x , y ) p x p or y p for all x , y L .

3. Irreducibles and Primes Based on a T-Norm

In this section, our goal is to present a proper definition for the concepts of the T-irreducible element and T-prime elements in bounded lattices and study their algebraic properties. We investigate some features of the sets of T-irreducible elements and T-prime elements. We show that lattice isomorphism, which is generated by a t-norm T, preserves T-irreducible elements and T-prime elements. We investigate the relationship between the sets of T-prime elements and co-atoms under some conditions. We give some characterizations for the sets of T-irreducible elements and T-prime elements on product lattices. We present some related properties of these sets. Throughout the section, we illustrate our points with some examples.
Definition 8.
Let T be a t-norm on L and p L \ 1 .
(i)
The element p is called T p r i m e if and only if it satisfies T ( a , b ) p a p or b p for all a , b L .
(ii)
The element p is called T i r r e d u c i b l e if and only if it satisfies T a , b = p a = p or b = p for all a , b L .
The sets of all T-prime elements and all T-irreducible elements of L are denoted by T p L and T i ( L ) , respectively.
Proposition 2.
Let T be a t-norm on L. Then, T p L T i L .
Proof. 
Let x T p L and x = T a , b , for a , b L . Then, T a , b x . Since x is T-prime, we have a x or b x . We also know that x a b . So, x a and x b . Therefore, x = a or x = b . Thus, x T i L . □
Example 2.
Let L 1 = { 0 , 1 } and L 2 = { 0 , 1 2 , 1 } . Then, the function T on L 1 × L 2 defined by
T ( x , y ) = T ( y , x ) = x , y = ( 1 , 1 ) ( 0 , 1 ) , x = y = ( 0 , 1 ) ( 1 , 0 ) , x , y ( 1 , 0 ) , ( 1 , 1 2 ) ( 0 , 0 ) , otherwise .
is a t-norm on L 1 × L 2 [15]. Then, we obtain that
T i ( L ) = ( 0 , 1 2 ) , ( 0 , 1 ) , ( 1 , 1 2 ) ,
T p ( L ) = ( 0 , 1 ) , ( 1 , 1 2 ) .
Proposition 3.
Let T 1 , T 2 be t-norms on L and T 1 T 2 . Then, T 1 p L T 2 p L .
Proof. 
Let x T 1 p L and T 2 p a , b x for a , b L . Then, T 1 p a , b x . Since x is T 1 -prime, a x or b x . Hence, x T 2 p L . □
Example 3.
Let L = { 0 , a , b , c , d , 1 } be the lattice given with the following diagram:
Axioms 13 00023 i001
Consider the t-norms T 1 , T 2 on L defined by
T 1 ( x , y ) = x y , x = 1 or y = 1 x y d , otherwise . , T 2 ( x , y ) = d , x = d , y = d x y , x = 1 or y = 1 0 , otherwise .
It is easy to see that T 2 T 1 . We have that T 1 p ( L ) = { a , c } , T 2 p ( L ) = { c } . So, we obtain that T 2 p ( L ) T 1 p ( L ) .
Remark 1.
Since T D T T M for any t-norm T on L, then T D p L T p L T M p L . One can wonder whether or not T 1 i L T 2 i L holds, where T 1 and T 2 are two t-norms on L and T 1 T 2 . We give a negative answer to this question using a counterexample as follows:
Example 4.
Let L = 0 , 1 . Consider the t-norms T D , T M , and T P , where T P is given by T P ( x , y ) = x . y for all x , y in L. We know that T D T P T M . We obtain that T D i L = L 0 , 1 , T M i L = L 1 and T P i L = 0 . We see that it satisfies T P i L T M i L but it holds neither T D i L T P i L nor T P i L T D i L .
Let L 1 and L 2 be bounded lattices, φ : L 1 L 2 be a lattice isomorphism, and T be a t-norm on L 1 . Then, it is straightforward that T φ defined by T φ a , b = φ T φ 1 a , φ 1 b is a t-norm on L 2 .
Theorem 1.
Let L 1 and L 2 be bounded lattices, φ : L 1 L 2 be a lattice isomorphism, and T be a t-norm on L 1 . Then, the following statements hold:
(i)
If p T p L 1 , then φ p T φ p L 2 .
(ii)
If p T i L 1 , then φ p T φ i L 2 .
Proof. 
(i)
Let a , b L 2 and T φ a , b φ p . Then, we have φ T φ 1 a , φ 1 b φ p . Since φ is a lattice isomorphism, we obtain that T φ 1 a , φ 1 b p . Because p T p L 1 , we have φ 1 a p or φ 1 b p . Thus, a φ p or b φ p and, hence, φ p T φ p L 2 .
(ii)
Let a , b L 2 and T φ ( a , b ) = φ ( p ) . Therefore, φ T φ 1 a , φ 1 b = φ p . Since φ is one-to-one, then T φ 1 a , φ 1 b = p . Because p T i L 1 , φ 1 a = p or φ 1 b = p . Hence, a = φ p or b = φ p . As a consequence, φ p T φ i L 2 .
Proposition 4.
Consider the t-norm T = T D on L. If C ( L ) = , then it follows that T p L = .
Proof. 
Suppose that T p L . Then, there exists an element x in T p L . Since C ( L ) = , then x C ( L ) and hence there exists y in L such that x < y < 1 . We obtain that T y , y = 0 x but y x . Therefore, we obtain that x T p L , which is a contradiction. So, T p L = . □
Lemma 1.
Let L be of finite length and C L = 1 . If we denote c as the single co-atom, then x c for any x L \ 1 .
Proof. 
Let C ( L ) = c and x 1 in L. Since c is a co-atom, then c c x and thus c x = c or c x = 1 . Let us denote X = 1 x L : c x = 1 . Assume that X is nonempty. Since L is of finite length, every chain in L is finite and so it has an upper bound. Thus, by Zorn ’s lemma, X has a maximal element. Let m be a maximal element of X. Then, for each t L \ X and m < t , we obtain that t x m x = 1 . If t 1 , then t X , which contradicts that m is a maximal element of X. Then, t = 1 and hence m is a co-atom in L. Since m X , m c = 1 , we obtain that m     c . So, m c , which contradicts that C L = 1 . So, we obtain that X = . Then, it is required that x c = c , and it is equivalent to x c . □
Theorem 2.
Let L be of finite length. Consider the t-norm T = T D on L. If C L = 1 , then T p L = C ( L ) .
Proof. 
(i)
If L = 1 , then we have that L = { 0 , 1 } and C L = { 0 } . It is easily seen that 0 T p ( L ) . Therefore, T p L = C ( L ) .
(ii)
If ( L ) 2 , then the set L \ ( C L 1 ) is nonempty, and let x be its element. If we denote c as the only element of C ( L ) , from Lemma 1 we have that x < c . Since T c , c = 0 x but c x , then x T p ( L ) . To show that c T p ( L ) , it follows from the fact that 0 T ( a , b ) c for the case a = 1 or b = 1 and, in such case, the second element is less than or equal to c, and it trivially satisfies the T-prime condition. The case T ( a , b ) = 0 and a = 1 or b = 1 is similar. Finally, if T ( a , b ) = 0 and a , b < 1 , then a , b < c , which also satisfies the T-prime condition.
Example 5.
Let L = { 0 , 1 , g , f , e , d , m } be the lattice with the following diagram.
Axioms 13 00023 i002
Consider the t-norm T = T D on L. It is easily seen that C L = g and T p L = { g } . Consequently, we have that C L = T p ( L ) .
Proposition 5.
Consider the t-norm T = T D on L. If C L 2 , then T p L = .
Proof. 
Let x L \ { 1 } .
(i)
Let x L \ C ( L ) . Then, for y C ( L ) , we obtain that T y , y = 0 x , but y x . Hence, x T p ( L ) .
(ii)
Let x C ( L ) . Since C L 2 , then there exist y C ( L ) , y x . Then, T y , y = 0 x , but y x because x     y . Thus, x T p ( L ) .
Consequently, T p L = . □
Example 6.
Let L = { 0 , b , x , y , z } be the lattice given by the following diagram:
Axioms 13 00023 i003
It is easily seen that C L = { x , y , z } . Consider the t-norm T = T D on L. Then, T y , z = 0 x but y x and z x . So, x T p ( L ) . Similarly, we get that 0 , x , y , . . T p ( L ) . As a result, we obtain that T p L = .
The following example shows that the fact that T p L = does not imply that T = T D .
Example 7.
Consider the lattice L = [ 0 , 1 ] and the t-norm T x , y = T L x , y = max ( x + y 1 , 0 ) on L. Note that C L = and hence C L = 0 .
(i)
Let T x , y = 0 . Then, x + y 1 0 and hence x + y 1 . T 1 2 , 1 2 = 0 but 1 2 0 .
Hence, 0 T p ( L ) .
(ii)
Let T ( x , y ) 1 2 . Then, max ( x + y 1 , 0 ) 1 2 .
max x + y 1 , 0 = 0 x 1 2 or y 1 2 .
max x + y 1 , 0 = x + y 1 1 2 x + y 3 2 . Since T ( 3 4 , 3 4 ) = 1 2 but 3 4 1 2 , we have that 1 2 T p ( L ) .
(iii)
Let T x , y = max x + y 1 , 0 p , p ( 0 , 1 2 ) .
max x + y 1 , 0 = 0 x + y 1 . Since T 1 2 , 1 2 = 0 p but 1 2 p , then p T p ( L ) .
max x + y 1 , 0 = x + y 1 p x + y p + 1 . We obtain that T p + 1 2 , p + 1 2 = p p but p + 1 2 p . If p + 1 2 p , then we obtain that 1 p , which is a contradiction. Therefore, p T p ( L ) .
(iv)
Let T x , y = max x + y 1 , 0 q , q ( 1 2 , 1 ) .
max x + y 1 , 0 = 0 x + y 1 x 1 2 or y 1 2 .
max x + y 1 , 0 = x + y 1 0 x + y 1 q 1 x + y q + 1 .
T q + 1 2 , q + 1 2 = q q . But, q < 1 2 q < q + 1 q < q + 1 2 . So, q + 1 2 q .
Therefore, q T p ( L ) .
So, T p L = . By the following, we characterize the sets of T-irreducible elements and T-prime elements on product lattices.
Theorem 3.
Let L 1 , , 0 L 1 , 1 L 1 and ( L 2 , , 0 L 2 , 1 L 2 ) be two bounded lattices and T 1 , T 2 be two t-norms on L 1 , L 2 , respectively. Then, T 1 × T 2 i L 1 × L 2 = T 1 i ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 i ( L 2 ) .
Proof. 
Suppose that ( p , q ) T 1 i ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 i ( L 2 ) . Hence, ( p , q ) T 1 i ( L 1 ) × 1 L 2 or ( p , q ) { 1 L 1 } × T 2 i ( L 2 ) . Therefore, ( p T 1 i ( L 1 ) and q = 1 L 2 ) or ( p = 1 L 1 and q T 2 i ( L 2 ) ).
Let T 1 × T 2 x , y , a , b = ( p , q ) . In this case, we have that
(i)
T 1 × T 2 x , y , a , b = ( p , 1 L 2 ) and p T 1 i ( L 1 )
or
(ii)
T 1 × T 2 x , y , a , b = ( 1 L 1 , q ) and q T 2 i ( L 2 ) .
If T 1 × T 2 x , y , a , b = ( p , 1 L 2 ) and p T 1 i ( L 1 ) , then T 1 x , a , T 2 y , b = p , 1 L 2 . Hence T 1 x , a = p and T 2 y , b = 1 L 2 . Since p T 1 i ( L 1 ) , we obtain that ( x = p or a = p ) and ( y = b = 1 L 2 ). Then, p , 1 L 2 = x , y or p , 1 L 2 = ( a , b ) . Hence, ( p , 1 L 2 ) T 1 × T 2 i L 1 × L 2 . Similarly, if T 1 × T 2 x , y , a , b = ( 1 L 1 , q ) and q T 2 i ( L 2 ) , then we obtain that 1 L 1 , q T 1 × T 2 i L 1 × L 2 . Therefore,
T 1 i ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 i ( L 2 ) T 1 × T 2 i L 1 × L 2 . ( 1 )
Assume that ( p , q ) T 1 × T 2 i L 1 × L 2 and q T 2 i L 2 , p T 1 i ( L 2 ) . Then, q = 1 L 2 or y , b L 2 : T 2 y , b = q and y q , b q . Similarly, we have p = 1 L 1 or x , a L 1 : T 1 x , a = p and x p , a p . Let p 1 L 1 and q 1 l 2 .
p , q = T 1 x , a , T 2 y , b = T 1 × T 2 x , y , a , b
p , q = x , y o r p , q = a , b
p = x , q = y o r p = a , q = b .
That is a contradiction. Therefore, p 1 L 1 q = 1 L 2 .
If p = 1 L 1 , then T 1 × T 2 x , y , a , b = 1 L 1 , q and hence ( T 1 x , a , T 2 y , b ) = 1 L 1 , q . So, we have T 1 x , a = 1 L 1 and T 2 y , b = q . Thus, x = a = 1 L 1 and also y = q or b = q . Therefore, q T 2 i L 2 .
Similarly, if q = 1 L 2 , then it follows that p T 1 i ( L 1 ) . Hence, ( p , q ) T 1 i ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 i ( L 2 ) . Therefore,
T 1 × T 2 i L 1 × L 2 T 1 i ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 i ( L 2 ) . ( 2 )
Then, it follows from (1) and (2) that
T 1 × T 2 i L 1 × L 2 = T 1 i ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 i ( L 2 ) .
Theorem 4.
Let L 1 , , 0 L 1 , 1 L 1 and ( L 2 , , 0 L 2 , 1 L 2 ) be two bounded lattices and T 1 , T 2 be two t-norms on L 1 , L 2 , respectively. Then, T 1 × T 2 p L 1 × L 2 = T 1 p ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 p ( L 2 ) .
Proof. 
Assume that ( p , q ) T 1 p ( L 1 ) × 1 L 2 1 L 1 × T 2 p ( L 2 ) . Then,
( p , q ) T 1 p ( L 1 ) × 1 L 2 or ( p , q ) 1 L 1 × T 2 p ( L 2 ) . So, ( p T 1 p L 1 and q = 1 L 2 ) or ( p = 1 L 1 and q T 2 p ( L 2 ) ).
Let T 1 × T 2 x , y , a , b ( p , q ) . In this case, we have that
(i)
T 1 × T 2 x , y , a , b ( p , 1 L 2 ) and p T 1 p ( L 1 )
or
(ii)
T 1 × T 2 x , y , a , b = ( 1 L 1 , q ) and q T 2 p ( L 2 ) .
If T 1 × T 2 x , y , a , b ( p , 1 L 2 ) , p T 1 p L 1 , then T 1 x , a p and T 2 ( y , b ) 1 L 2 . Since p T 1 p ( L 1 ) , then x p o r a p . Therefore, x , y p , 1 L 2 or a , b p , 1 L 2 . Consequently, ( p , 1 L 2 ) T 1 × T 2 p L 1 × L 2 .
Similarly, if T 1 × T 2 x , y , a , b = ( 1 L 1 , q ) and q T 2 p ( L 2 ) , we obtain that ( 1 L 1 , q ) T 1 × T 2 p L 1 × L 2 .
Therefore, we obtain that
T 1 p ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 p ( L 2 ) T 1 × T 2 p L 1 × L 2 . ( 3 )
Conversely, let ( p , q ) T 1 × T 2 p L 1 × L 2 and p T 1 p ( L 1 ) , q T 2 p ( L 2 ) . In this case, we obtain that p = 1 L 1 or there exist x , a in L 1 such that T 1 x , a p and x p , a p . Similarly, we have that q = 1 L 2 or there exist y , b in L 2 such that T 2 y , b q and y q , b q .
Assume that p 1 L 1 and q 1 L 2 . Then p , q T 1 x , a , T 2 y , b = T 1 × T 2 x , y , a , b . Because ( p , q ) T 1 × T 2 p L 1 × L 2 , we obtain that ( p , q ) ( x , y ) or ( p , q ) ( a , b ) . So, we obtain that p x , q y or p a , q b , which is a contradiction. Consequently, it holds that p = 1 L 1 or q = 1 L 2 .
(i)
If p = 1 L 1 , then T 1 × T 2 x , y , a , b ( 1 L 1 , q ) . Thus, T 1 x , a , T 2 ( y , b ) ( 1 L 1 , q ) . So, we have T 1 x , a 1 L 1 and T 2 y , b q . Thus, y q or b q . Hence, q T 2 p ( L 2 ) .
(ii)
Let q = 1 L 2 . Similarly, it is proved that p T 1 p L 1 .
As a consequence, we have that
T 1 × T 2 p L 1 × L 2 T 1 p ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 p ( L 2 ) . ( 4 )
Therefore, it follows from (3) and (4) that
T 1 × T 2 p L 1 × L 2 = T 1 p ( L 1 ) × 1 L 2 { 1 L 1 } × T 2 p ( L 2 ) .
Corollary 1.
Let L 1 , , 0 L 1 , 1 L 1 and ( L 2 , , 0 L 2 , 1 L 2 ) be two bounded lattices and T 1 , T 2 be two t-norms on L 1 , L 2 , respectively. If T 1 p L 1 = T 1 i L 1 and T 2 p L 2 = T 2 i ( L 2 ) , then T 1 × T 2 p L 1 × L 2 = T 1 × T 2 i ( L 1 × L 2 ) .
Proof. 
This is straightforward from Theorems 3 and 4. □
Corollary 2.
Let L 1 , , 0 L 1 , 1 L 1 and ( L 2 , , 0 L 2 , 1 L 2 ) be two bounded lattices and T 1 , T 2 be two t-norms on L 1 , L 2 , respectively. Then,
T 1 i L 1 × T 2 i L 2 T 1 × T 2 i L 1 × L 2 = .
Proof. 
If T 1 i L 1 × T 2 i L 2 = or T 1 × T 2 i L 1 × L 2 = , then the proof is obvious. Assume that T 1 i L 1 × T 2 i L 2 and T 1 × T 2 i L 1 × L 2 .
Suppose that T 1 i L 1 × T 2 i L 2 T 1 × T 2 i L 1 × L 2 and p , q is its element. Then, p , q T 1 i L 1 × T 2 i L 2 and p , q T 1 × T 2 i L 1 × L 2 . So, we obtain that ( p T 1 i L 1 and q T 2 i L 2 ) and also we have that ( p = 1 L 1 and q T 2 i ( L 2 ) ) or ( p T 1 i L 1 and q = 1 L 2 ). That is a contradiction. Therefore, T 1 i L 1 × T 2 i L 2 T 1 × T 2 i L 1 × L 2 = . □
Corollary 3.
Let L 1 , , 0 L 1 , 1 L 1 and ( L 2 , , 0 L 2 , 1 L 2 ) be two bounded lattices and T 1 , T 2 be two t-norms on L 1 , L 2 , respectively. Then,
T 1 p L 1 × T 2 p L 2 T 1 × T 2 p L 1 × L 2 = .
Proof. 
The proof follows similarly to the one given in Corollary 2. □
Example 8.
Let L 1 = { 1 , a , b , c , 0 } be the lattice given by following Hasse diagram and consider the lattice L 2 = { 1 , g , f , e , d , m , 0 } given in Example 5.
Axioms 13 00023 i004
Let us consider the t-norms by the following
T 1 x , y = T M x , y ,
T 2 ( x , y ) = e , x = f and y = f x y , otherwise .
on L 1 , L 2 , respectively.
It is easily seen that T 1 i L 1 = a , b , 0 = T 1 p ( L 1 ) and T 2 i L 2 = d , m , g , f = T 2 p ( L 2 ) . Hence,
T 1 × T 2 i L 1 × L 2 = T 1 × T 2 p L 1 × L 2
= { 1 , g , 1 , f , 1 , d , 1 , m , a , u , b , u , 0 , u } .
On the other hand,
T 1 i L 1 × T 2 i L 2 = T 1 p L 1 × T 2 p L 2
= { a , d , a , m , a , g , a , f , b , d , b , m , b , g , b , f , 0 , d , 0 , m , 0 , g , 0 , f } .
Thus,
T 1 i L 1 × T 2 i L 2 T 1 × T 2 i L 1 × L 2 = ,
T 1 p L 1 × T 2 p L 2 T 1 × T 2 p L 1 × L 2 = .
Example 9.
Let L 1 = { 1 , a , 0 } be a chain given by the following diagram and consider the t-norm T 1 = T M on L 1 :
Axioms 13 00023 i005
Assume that L 2 = u , x , y , z , t , w is a chain given by following diagram and consider the t-norm T 2 = T D on L 2 :
Axioms 13 00023 i006
It is easy to see that
T 1 i L 1 = a , 0 = T 1 p L 1 ,
T 2 i L 2 = x , y , z , t , T 2 p L 2 = { x } .
So,
T 1 i L 1 × T 2 i L 2 = a , x , a , y , a , z , a , t , 0 , x , 0 , y , 0 , z , 0 , t ,
T 1 p L 1 × T 2 p L 2 = a , x , 0 , x .
Moreover,
T 1 × T 2 i L 1 × L 2 = 1 , x , 1 , y , 1 , z , 1 , t , a , u , 0 , u ,
T 1 × T 2 p L 1 × L 2 = 1 , x , a , u , 0 , u .

4. The Lattice L R T

Karaçal and Sağıroğlu [11] have constructed a lattice by using T-prime elements in a complete lattice L and they have suggested a new t-norm on the constructed lattice using Theorem 2 [11]. In this section, we show that Theorem 2 in [11] is false by giving some counterexamples. We present a necessary and sufficient condition for the mentioned theorem to be correct.
Definition 9
([11]). Let T be a t-norm on a complete lattice L and x L . If the set p T p L p T p L p x p x is nonempty, then the infimum of this set is called the T p r i m e r a d i c a l of x denoted by R T x . Since the infimum of the empty set is equal to 1, in the case where p T p L p T p L p x p x = , then R T x = 1 . x is called a T p r i m e r a d i c a l e l e m e n t if x = R T x . The set of all T-prime radical elements in L is denoted by L R T . Clearly, 1 L R T .
Proposition 6
([11]). Let T be a t-norm on a complete lattice L. Then, R T T a , b = R T a R T b for every a , b L .
Proposition 7
([11]). The set L R T is a complete lattice.
Proposition 8.
Let T 1 , T 2 be t-norms on a complete lattice L and T 1 T 2 . Then, L R T 1 is a -subsemilattice of L R T 2 .
Proof. 
First, we show that L R T 1 L R T 2 . Let x L R T 1 be arbitrary. Then,
x = p T 1 p L p T 1 p L p x p x p T 2 p L p T 2 p L p x p x
On the other side, since x p T 2 p L p T 2 p L p x p x , then x = p T 2 p L p T 2 p L p x p x . This shows that x L R T 2 . Therefore, L R T 1 L R T 2 .
From Proposition 7, we know that L R T 1 and L R T 2 are complete lattices (∧-subsemilattices of L (Proposition 5, Remark 2, [11])). The fact that infimums on L , L 1 and L 2 coincide implies that x L R T 1 y = x L y = x L R T 2 y for any x , y L R T 1 . It proves that L R T 1 is a -subsemilattice of L R T 2 . □
The notation T L R T denotes the restriction of T to L R T .
Theorem 5
(Theorem 2, [11]). T L R T is an infinitely ∪-distributive t-norm on L R T . Authors in the proof of (Theorem 2, [11]) claimed the following:
”… We have that R T T a , b = R T a R T b for every a , b L by Proposition 6. Thus for a , b L R T , ( T a , b L R T . …”
But, for any a , b L R T , we obtain that R T T a , b = R T a R T b = a b . Thus, unless T = T M , this need not imply R T T a , b = T a , b . Now, we give the following counterexamples to show that Theorem 4.5 is really false.
Example 10.
Consider the lattice given in Example 5 and define a t-norm T on L as follows [11]:
T ( x , y ) = { e , x = f and y = f x y , otherwise .
Then, T p L = g , f , d , m , L R T = { 1 , g , f , d , m , 0 } . Since ( T L R T ) f , f = T f , f = e L R ( T ) , we have that T is not closed on L R T . So, it is not a t-norm on L R T .
Example 11.
Consider the lattice given in Example 3. Then,
T ( x , y ) = T d ( x , y ) = T D ( x , y ) , ( x , y ) ( d , d ) d , ( x , y ) = ( d , d ) .
is a t-norm on L.
It is easily seen that T p L = { c } and L R T = { c , 1 } .
( T L R T ) c , c = T c , c = 0 L R T . Hence, T L R T is not a t-norm on L R T .
By the following, we provide a characterization for the statement in Theorem 5 (Theorem 2, [11]) to be true.
Theorem 6.
T L R T on L R T is a t-norm if and only if T = .
Proof. 
: Since L R T is a complete lattice, by Proposition 7, for any a , b L R T , we have that a b L R T and 1 L R T . Thus, if T = , then, for a , b L R T , T a , b = a b L R T . Since T is associative, commutative, and monotone in L, it is clear that T L R T satisfies these properties in L R T . Finally, using 1 L R T , it holds that T L R T is a t-norm on L R T .
: Assume that T L R T is a t-norm on L R T . Thus, for a , b L R T , we have that T ( a , b ) L R T . Then, we obtain that R T T a , b = T a , b . So, it follows that R T a R T b = T a , b . Therefore, a b = T ( a , b ) and hence T = . □

5. Conclusions

We have defined the notion of the T-irreducible element as an extension of the notion of the meet-irreducible element in bounded lattices and have studied its properties. We have investigated the relationship between T-irreducible elements and T-prime elements. We have characterized the sets of T-irreducible elements and T-prime elements in product lattices. We have also presented a correction to a theorem in [11]. It should be interesting to further explore the conditions (depending on the lattice or the t-norm) under which T-irreducible elements and T-prime elements coincide. For further work, T-irreducible elements may be used to construct new lattices and/or new t-norms on lattices.

Author Contributions

Conceptualization, Ş.Y.; methodology, Ş.Y.; software, Ş.Y.; validation, Ş.Y. and R.İ.; formal analysis, Ş.Y. and R.İ.; investigation, Ş.Y. and R.İ.; resources, Ş.Y. and R.İ.; data curation, Ş.Y.; writing—original draft preparation, Ş.Y.; writing—review and editing, Ş.Y.; visualization, Ş.Y. and R.İ.; supervision, Ş.Y.; project administration, Ş.Y.; funding acquisition, Ş.Y. and R.İ. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

There is no dataset related to this manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Calvo, T.; Kolesarova, A.; Komornikova, M.; Mesiar, R. Aggregation Operators: Properties, Classes and Construction Methods; Physica: Heidelberg, Germany, 2002. [Google Scholar]
  2. Alsina, C.; Trillas, E.; Valverde, L. On Non-Distributive Logical Connectives for Fuzzy Set Theory. BUSEFAL 1980, 3, 18–29. [Google Scholar]
  3. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  4. De Baets, B.; Mesiar, R. Triangular Norms on Product Lattices. Fuzzy Sets Syst. 1999, 104, 61–75. [Google Scholar] [CrossRef]
  5. De Cooman, G.; Kerre, E. Order Norms on Bounded Partially Ordered Sets. Fuzzy Math. 1994, 2, 281–310. [Google Scholar]
  6. Jenei, S.; De Baets, B. On the Direct Decomposability of T-norms on Product Lattices. Fuzzy Sets Syst. 2003, 139, 699–707. [Google Scholar] [CrossRef]
  7. Klement, E.; Mesiar, R.; Pap, E. Triangular Norms as Ordinal Sums of Semigroups in the Sense of A. H. Clifford. Semigroup Forum 2002, 65, 71–82. [Google Scholar] [CrossRef]
  8. Palmeira, E.; Bedregal, B.; Mesiar, R.; Fernandez, J. A New Way to Extend T-Norms, T-Conorms and Negations. Fuzzy Sets Syst. 2014, 240, 1–21. [Google Scholar] [CrossRef]
  9. Saminger, S. On Ordinal Sums of Triangular Norms on Bounded Lattices. Fuzzy Sets Syst. 2006, 157, 1403–1416. [Google Scholar] [CrossRef]
  10. Yılmaz, Ş.; Kazancı, O. Constructions of triangular norms on lattices by means of irreducible elements. Inf. Sci. 2017, 397–398, 110–117. [Google Scholar] [CrossRef]
  11. Karacal, F.; Sağıroğlu, Y. Infinitely ∨-Distributive T-norms on Complete Lattices and Pseudo-Complements. Fuzzy Sets Syst. 2009, 160, 32–43. [Google Scholar] [CrossRef]
  12. Birkhoff, G. Lattice Theory; American Mathematical Society Colloquium Publications: Rhode Island, NY, USA, 1967. [Google Scholar]
  13. Davey, B.A.; Priestly, H.A. Introduction to Lattices and Order; Cambridge University Press: Cambridge, MA, USA, 1990. [Google Scholar]
  14. Grätzer, G. General Lattice Theory, 2nd ed.; Birkhauser Verlag: Basel, Switzerland, 1998. [Google Scholar]
  15. Wang, Z.; Fang, J. On the direct decomposability of pseudo-t-norms, t-norms and implication operators on product lattices. Fuzzy Sets Syst. 2007, 158, 2494–2503. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Yılmaz, Ş.; İşçi, R. Triangular Norm-Based Elements on Bounded Lattices. Axioms 2024, 13, 23. https://doi.org/10.3390/axioms13010023

AMA Style

Yılmaz Ş, İşçi R. Triangular Norm-Based Elements on Bounded Lattices. Axioms. 2024; 13(1):23. https://doi.org/10.3390/axioms13010023

Chicago/Turabian Style

Yılmaz, Şerife, and Rabia İşçi. 2024. "Triangular Norm-Based Elements on Bounded Lattices" Axioms 13, no. 1: 23. https://doi.org/10.3390/axioms13010023

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop