Next Article in Journal
Inverse and Logarithmic Coefficient Bounds of Concave Univalent Functions
Previous Article in Journal
Spheres of Strings Under the Levenshtein Distance
Previous Article in Special Issue
Positive Solutions for Discrete Robin Problem of Kirchhoff Type Involving p-Laplacian
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Element-Based Construction Methods for Uninorms on Bounded Lattices

1
Department of Mathematics, Karadeniz Technical University, Trabzon 61080, Turkey
2
Department of Mathematics and Descriptive Geometry, Faculty of Civil Engineering, Slovak University of Technology, Radlinského 11, 810 05 Bratislava, Slovakia
3
CE IT4Innovations—IRAFM, University of Ostrava, 700 30 Ostrava, Czech Republic
*
Author to whom correspondence should be addressed.
Axioms 2025, 14(8), 552; https://doi.org/10.3390/axioms14080552
Submission received: 2 July 2025 / Revised: 18 July 2025 / Accepted: 19 July 2025 / Published: 22 July 2025
(This article belongs to the Special Issue New Perspectives in Operator Theory and Functional Analysis)

Abstract

Uninorms are aggregation operators that generalize the t-norms (t-conorms), which are extensions of the logical connectives ( ) to the fuzzy set theory. The methods of constructing uninorms on more general algebraic structures (such as bounded posets, lattices, etc.) are an important subject of study, including an extensive work concerning these operations on the unit real interval [ 0 ,   1 ] . The construction of uninorms on bounded lattices has been extensively studied using various aggregation functions, such as t-norms, t-conorms, and t-subnorms. In this paper, we present construction methods for uninorms, based on the elements of a lattice, without using the existence of the mentioned operators. We determine the necessary and sufficient conditions for the introduced construction methods to result in the uninorms. Then, we show the differences between our methods and several methods known from the literature, including some illustrative examples.
MSC:
03E72; 03B52; 03G10

1. Introduction

Aggregation functions are basic functions that combine several inputs into a single output. They satisfy the monotonicity and boundary conditions. Triangular norms, triangular conorms, uninorms, nullnorms, etc., are among the well-known aggregation functions. A uninorm becomes a t-norm when the neutral element is 1, and a t-conorm when it is 0.
Uninorms are a special type of associative aggregation operator having a neutral element in [ 0 ,   1 ] , introduced by Yager and Rybalov in [1], the Tivity property, and they have a neutral element e in [ 0 ,   1 ] . In addition, they are frequently studied in pure mathematics, expert systems, economics and finance, computer and engineering sciences, and social sciences, and some of the applied sciences where they have an application [1,2,3,4].
The journey of uninorms on bounded lattices commenced with Karaçal and Mesiar’s seminal work, where they conclusively established the presence of these operators on any given bounded lattice, as detailed in [5]. Then, uninorms were studied from many different perspectives [2,6,7,8,9,10]. Researchers working with uninorms on bounded lattices have been heavily focused on figuring out constructing methods of uninorms on bounded lattices [1,5,11,12,13,14,15,16,17], in which the authors utilized some aggregation operators on subintervals. According to our best knowledge, there is no element-based construction method for uninorms on a bounded lattice. In this paper, we investigate element-based construction methods for uninorms by elaborating on different cases of an element η of a bounded lattice L and establishing the necessary and sufficient conditions required for these construction methods to produce a uninorm on L. Also, we give explanatory examples as well as comparative examples with the existing methods.
The paper is organized as follows: Section 2 provides a brief overview of bounded lattices, t-norms, t-conorms, and uninorms on bounded lattices. Section 3 contains the main results: new element η { 0 , e , 1 } based construction methods for uninorms on a bounded lattice L when η I e or η ( e , 1 ) or η ( 0 , e ) . We determine the necessary and sufficient conditions for each position of the element η to obtain uninorms and put the necessary and sufficient conditions on the bounded lattice L. Moreover, the dual forms are also provided. Meanwhile, we provide some examples to illustrate the construction methods. Furthermore, we show that our new construction methods are different from the existing methods in the literature.

2. Notations, Definitions and a Review of Previous Results

In this section, we revisit some fundamental concepts.
Definition 1
([18]). Let ( L , , 0 , 1 ) be a bounded lattice. If u v or v u , then the elements u and v are called comparable; otherwise, they are called incomparable, and in this case, the notation u | | v is used.
Hereafter, we define I e as the set of all elements u L such that u is incomparable with e; formally, I e = { u L : u | | e } , it has all elements of the lattice L which are incomparable with the element e. Let A ( e ) be the set defined by A ( e ) = [ 0 , e ] × [ e , 1 ] [ e , 1 ] × [ 0 , e ] .
Definition 2
([18]). Let ( L , , 0 , 1 ) be a bounded lattice and j , g L with j g . The interval [ j , g ] is a subset of L given by
[ j , g ] = { f L | j f g } .
Similarly, ( j , g ] , [ j , g ) and ( j , g ) can be defined.
Definition 3
([19]). Let ( L , , 0 , 1 ) be a bounded lattice. An operation T ( S ) : L × L L is called a triangular norm, t-norm in short (triangular conorm, t-conorm in short) if it exhibits the following properties: it is increasing, Abelian, associative, and possesses 1 (0) as its neutral element.
Example 1.
Let ( L , , 0 , 1 ) be a bounded lattice. The minimal t-norm T W and the maximal t-norm T on a bounded lattice L are given, respectively, as follows:
T W u , v = u v if 1 { u , v } 0 o t h e r w i s e
T ( u , v ) = u v .
The minimal t-conorm S and the maximal t-conorm S W on a bounded lattice L are given, respectively, as follows:
S ( u , v ) = u v
S W u , v = u v if 0 { u , v } 1 o t h e r w i s e .
Definition 4
([16]). Let ( L , , 0 , 1 ) be a bounded lattice. An Abelian semigroup operation U : L 2 L is called a uninorm if it has a neutral element e L and it is increasing.
Note that a uninorm is a t-norm (t-conorm) when e = 1 ( e = 0 ).
Proposition 1
([5]). Let ( L , , 0 , 1 ) be a bounded lattice, e L { 0 , 1 } and U be a uninorm on L with the neutral element e. Then the following properties hold:
  • (i) u v U ( u , v ) u v for ( u , v ) A e .
  • (ii) U ( u , v ) u for ( u , v ) L × [ 0 , e ] .
  • (iii) U ( u , v ) v for ( u , v ) [ 0 , e ] × L .
  • (iv) u U ( u , v ) for ( u , v ) L × [ e , 1 ] .
  • (v) v U ( u , v ) for ( u , v ) [ e , 1 ] × L .
Proposition 2
([5]). Let ( L , , 0 , 1 ) be a bounded lattice, e L and U a uninorm with the neutral element e on L. Then
  • ( i ) T = U | [ 0 , e ] 2 : [ 0 , e ] 2 [ 0 , e ] is a t-norm on [ 0 , e ] .
  • ( i i ) S = U | [ e , 1 ] 2 : [ e , 1 ] 2 [ e , 1 ] is a t-conorm on [ e , 1 ] .
Definition 5
([2]). Let L be a bounded lattice and A and B be two aggregation functions on L. A is called smaller than B if for any elements u , v L , A ( u , v ) B ( u , v ) .
We recommend [5,6,11,12,13,14,15,16,20,21,22,23,24,25] for more details about uninorms on bounded lattices.

3. Element-Based Construction Methods of Uninorms on Bounded Lattices

In this section, Theorems 1, 3 and 5 propose three construction methods for uninorms on a bounded lattice L, determined by an arbitrary fixed point η { 0 , e , 1 } , under which additional constraints are introduced. Our construction methods are compared with some construction methods known from the related literature. Also, the differences between our construction methods and those in the literature are emphasized. Some illustrative examples for our construction methods for uninorms on a bounded lattice are provided.
In the following theorem, a method to produce uninorms by means of an arbitrary element η I e is given.
Theorem 1.
Let ( L , , 0 , 1 ) be a bounded lattice, e L { 0 , 1 } and η I e . Then the function U 1 : L 2 L defined by
U 1 ( u , v ) = u v η ( u , v ) [ 0 , e ) 2 [ 0 , e ) × I e I e × [ 0 , e ) I e × I e , u ( u , v ) ( e , 1 ] × ( [ 0 , e ) I e ) L × { e } , v ( u , v ) ( [ 0 , e ) I e ) × ( e , 1 ] { e } × L , u v o t h e r w i s e ,
is a uninorm on L with the neutral element e if and only if v < u for all u ( e , 1 ) , v I e .
Proof. 
Necessity. Since U 1 is monotone, v = U 1 ( e , v ) U 1 ( u , v ) = u when u ( e , 1 ) and v I e . Therefore, it is obtained that v < u .
Sufficiency. (i) Monotonicity: Let us show that for every element u , v L with u v , U 1 ( u , w ) U 1 ( v , w ) for all w L . If u and v are both elements of [ 0 , e ) or { e } or ( e ,   1 ] or I e , U 1 ( u , w ) U 1 ( v , w ) is always satisfied for all w L since u v . If u = 0 or u = 1 , the inequality is satisfied; therefore, they are omitted. The proof is then split into all the remaining possible cases as follows:
1.
 Let u ( 0 , e ) .
1.1.
  v = e ,
1.1.1.
 If w ( 0 , e ) I e , then U 1 ( u , w ) = u w η w = U 1 ( v , w ) .
1.1.2
 If w = e , then U 1 ( u , w ) = u e = U 1 ( v , w ) .
1.1.3.
 If w ( e , 1 ) , then U 1 ( u , w ) = w = U 1 ( v , w ) .
1.2.
  v ( e , 1 ) ,
1.2.1.
 If w ( 0 , e ) I e , then U 1 ( u , w ) = u w η v = U 1 ( v , w ) .
1.2.2.
 If w = e , then U 1 ( u , w ) = u v = U 1 ( v , w ) .
1.2.3.
 If w ( e , 1 ) , then U 1 ( u , w ) = w v w = U 1 ( v , w ) .
1.3.
  v I e ,
1.3.1.
 If w ( 0 , e ) I e ,   then U 1 ( u , w ) = u w η v w η = U 1 ( v , w ) .
1.3.2.
 If w = e , then U 1 ( u , w ) = u v = U 1 ( v , w ) .
1.3.3.
 If w ( e , 1 ) , then U 1 ( u , w ) = w = U 1 ( v , w ) .
2.
  u = e ,
2.1.
  v ( e , 1 ) ,
2.1.1.
 If w ( 0 , e ) I e , then U 1 ( u , w ) = w < v = U 1 ( v , w ) .
2.1.2.
 If w = e , then U 1 ( u , w ) = e v = U 1 ( v , w ) .
2.1.3.
 If w ( e , 1 ) , then U 1 ( u , w ) = w v w = U 1 ( v , w ) .
3.
  u I e ,
3.1.
  v ( e , 1 ) ,
3.1.1.
 If w ( 0 , e ) I e , then U 1 ( u , w ) = u w η v = U 1 ( v , w ) .
3.1.2.
 If w = e , then U 1 ( u , w ) = u v = U 1 ( v , w ) .
3.1.3.
 If w ( e , 1 ) , then U 1 ( u , w ) = w v w = U 1 ( v , w ) .
  • (ii) Associativity: We demonstrate that U 1 ( u , U 1 ( v , w ) ) = U 1 ( U 1 ( u , v ) , w ) for all u , v , w L . If u = e , the equality is satisfied; therefore, they are omitted. Again, the proof is split into all the remaining possible cases by considering the relationships between the elements u , v , w and e as follows.
1.
 Let u [ 0 , e ) I e .
1.1.
  v [ 0 , e ) I e ,
1.1.1. If w [ 0 , e ) I e , then U 1 ( u , U 1 ( v , w ) ) = U 1 ( u , v w η ) = u v w η = U 1 ( u v η , w ) = U 1 ( U 1 ( u , v ) , w ) .
1.1.2. If w ( e , 1 ] , then U 1 ( u , U 1 ( v , w ) ) = U 1 ( u , w ) = w = U 1 ( u v η , w ) = U 1 ( U 1 ( u , v ) , w ) .
1.2.
  v ( e , 1 ] ,
1.2.1. If w [ 0 , e ) I e , then U 1 ( u , U 1 ( v , w ) ) = U 1 ( u , v ) = v = U 1 ( v , w ) = U 1 ( U 1 ( u , v ) , w ) .
1.2.2. If w ( e , 1 ] , then U 1 ( u , U 1 ( v , w ) ) = U 1 ( u , v w ) = v w = U 1 ( v , w ) = U 1 ( U 1 ( u , v ) , w ) .
2.
  u ( e , 1 ] .
2.1.
  v [ 0 , e ) I e ,
2.1.1. If w [ 0 , e ) I e , then U 1 ( u , U 1 ( v , w ) ) = U 1 ( u , v w η ) = u = U 1 ( u , w ) = U 1 ( U 1 ( u , v ) , w ) .
2.1.2. If w ( e , 1 ] , then U 1 ( u , U 1 ( v , w ) ) = U 1 ( u , w ) = u w = U 1 ( u , w ) = U 1 ( U 1 ( u , v ) , w ) .
2.2.
  v ( e , 1 ] ,
2.2.1. If w [ 0 , e ) I e , then U 1 ( u , U 1 ( v , w ) ) = U 1 ( u , v ) = u v = U 1 ( u v , w ) = U 1 ( U 1 ( u , v ) , w ) .
2.2.2. If w ( e , 1 ] , then U 1 ( u , U 1 ( v , w ) ) = U 1 ( u , v w ) = u v w = U 1 ( u v , w ) = U 1 ( U 1 ( u , v ) , w ) .
It is easy to observe the commutativity of U 1 and the fact that e is a neutral element of U 1 .
Therefore, U 1 is a uninorm on L with the neutral element e. □
The structure of the uninorm U 1 given in the Formula (1) is summarized in Figure 1.
In the following example, an illustration of how Theorem 1 is applied is provided.
Example 2.
Consider the bounded lattice L 1 = ( { 0 , a , b , c , d , e , η , 1 } , , 0 , 1 ) characterized by the Hasse diagram in Figure 2. If we apply the formula (1) in Theorem 1, the uninorm U 1 on L 1 is obtained as in Table 1.
Remark 1.
In general, the uninorm U 1 defined in Theorem 1 is different from the uninorms obtained by the construction methods of uninorms in the literature. Considering Example 2, it is easily seen that U 1 U t 1 , U e T , U ( T , e ) and U t , regardless of the choice of the corresponding t-norms on [ 0 ,   e ] in [5,11,13,15], since
U 1 ( d , c ) = d c η = d c = U t 1 ( d , c ) , U 1 ( 0 , c ) = 0 c η = 0 c = U e T ( 0 , c ) , U 1 ( d , c ) = d c η = d c = U ( T , e ) ( d , c ) , U 1 ( 0 , c ) = 0 c η = 0 c = U t ( 0 , c ) ,
respectively. Also, it is clear that the lattice L 1 satisfies the constraints of Theorem 3.1 in [12] and Theorem 3.1 in [14]. We obtain U 1 U t e since U 1 ( d , c ) = d c η = d c = U t e ( d , c ) regardless of the choice of the t-norm T e on [ 0 ,   e ] in [12]. In addition, U 1 U , since U 1 ( c , b ) = c b η = d b = c b = U ( c , b ) regardless of the choice of the t-norm T e on [ 0 ,   e ] and the t-conorm S e on [ e , 1 ] in [14]. Moreover, regardless of the choice of the t-conorm S on [ e , 1 ] in [22], U 1 U S 1 since U 1 ( a , c ) = a c = U S 1 ( a , c ) . Besides all this, since U 1 ( 0 , 1 ) = 1 and U s 1 ( 0 , 1 ) = U e S ( 0 , 1 ) = U ( S , e ) ( 0 , 1 ) = U s ( 0 , 1 ) = U s e ( 0 , 1 ) = U T 1 ( 0 , 1 ) = U ( 0 , 1 ) = 0 on any lattice regardless of the choice of the corresponding t-norms on [ 0 ,   e ] and/or t-conorms on [ e , 1 ] in [5,11,12,13,14,15,22].
Based on the duality principle, another construction method for uninorms on the bounded lattice L is introduced.
Theorem 2.
Let ( L , , 0 , 1 ) be a bounded lattice, e L { 0 , 1 } and η I e . Then the function U 1 : L 2 L defined by
U 1 ( u , v ) = u v ( u , v ) [ 0 , e ) 2 , u ( u , v ) [ 0 , e ) × ( ( e , 1 ] I e ) L × { e } , v ( u , v ) ( ( e , 1 ] I e ) × [ 0 , e ) { e } × L , u v η o t h e r w i s e ,
is a uninorm on L with the neutral element e if and only if u < v for all u ( 0 , e ) , v I e .
Proof. 
The proof follows easily from Theorem 1, and therefore, it is omitted. □
The structure of the uninorm U 1 given in the Formula (2) is summarized in Figure 3.
With the following theorem, another method to produce a uninorm by means of an arbitrary element η ( e , 1 ) is given.
Theorem 3.
Let ( L , , 0 , 1 ) be a bounded lattice, e L { 0 , 1 } and η ( e , 1 ) . Then the function U 2 : L 2 L defined by
U 2 ( u , v ) = u v ( u , v ) [ 0 , e ) 2 [ 0 , e ) × I e I e × [ 0 , e ) I e × I e , u ( u , v ) ( e , 1 ] × ( [ 0 , e ) I e ) L × { e } , v ( u , v ) ( [ 0 , e ) I e ) × ( e , 1 ] { e } × L , u v η o t h e r w i s e ,
is a uninorm on L with the neutral element e if and only if u < v for all u I e , v ( e , 1 ) .
Proof. 
Necessity. Since U 2 is monotone, u = U 2 ( e , u ) U 2 ( u , v ) = v when u I e and v ( e , 1 ) ; therefore, it is obtained that u < v .
Sufficiency. (i) Monotonicity: Let us show that for every element u , v L with u v , U 2 ( u , w ) U 2 ( v , w ) for all w L . If u and v are both elements of [ 0 , e ) or { e } or ( e ,   1 ] or I e , U 2 ( u , w ) U 2 ( v , w ) is always satisfied for all w L since u v . If u = 0 or u = 1 , the inequality is satisfied; therefore, they are omitted. The proof is then split into all the remaining possible cases as follows:
1.
 Let u ( 0 , e ) .
1.1.
  v = e ,
1.1.1.
 If w ( 0 , e ) I e , then U 2 ( u , w ) = u w w = U 2 ( v , w ) .
1.1.2.
 If w [ e , 1 ) , then U 2 ( u , w ) = w = U 2 ( v , w ) .
1.2.
  v ( e , 1 ) ,
1.2.1.
 If w ( 0 , e ) I e , then U 2 ( u , w ) = u w v = U 2 ( v , w ) .
1.2.2.
 If w = e , then U 2 ( u , w ) = u v = U 2 ( v , w ) .
1.2.3.
 If w ( e , 1 ) , then U 2 ( u , w ) = w v w η = U 2 ( v , w ) .
1.3.
  v I e ,
1.3.1.
 If w ( 0 , e ) I e , then U 2 ( u , w ) = u w v w = U 2 ( v , w ) .
1.3.2.
 If w = e , then U 2 ( u , w ) = u v = U 2 ( v , w ) .
1.3.3.
 If w ( e , 1 ) , then U 2 ( u , w ) = w = U 2 ( v , w ) .
2.
  u = e ,
2.1
  v ( e , 1 ) ,
2.1.1.
 If w ( 0 , e ) I e , then U 2 ( u , w ) = w < v = U 2 ( v , w ) .
2.1.2.
 If w = e , then U 2 ( u , w ) = e v = U 2 ( v , w ) .
2.1.3.
 If w ( e , 1 ) , then U 2 ( u , w ) = w v w η = U 2 ( v , w ) .
3.
  u I e ,
3.1.
  v ( e , 1 ) ,
3.1.1.
 If w ( 0 , e ) I e , then U 2 ( u , w ) = u w v = U 2 ( v , w ) .
3.1.2.
 If w = e , then U 2 ( u , w ) = u v = U 2 ( v , w ) .
3.1.3.
 If w ( e , 1 ) , then U 2 ( u , w ) = w v w η = U 2 ( v , w ) .
  • (ii) Associativity: We demonstrate that U 2 ( u , U 2 ( v , w ) ) = U 2 ( U 2 ( u , v ) , w ) for all u , v , w L . If u = e , the equality is satisfied; therefore, they are omitted. Again, the proof is split into all the remaining possible cases by considering the relationships between the elements u , v , w and e as follows.
1.
 Let u [ 0 , e ) I e .
1.1.
  v [ 0 , e ) I e ,
1.1.1. If w [ 0 , e ) I e , then U 2 ( u , U 2 ( v , w ) ) = U 2 ( u , v w ) = u v w = U 2 ( u v , w ) = U 2 ( U 2 ( u , v ) , w ) .
1.1.2. If w ( e , 1 ] , then U 2 ( u , U 2 ( v , w ) ) = U 2 ( u , w ) = w = U 2 ( u v , w ) = U 2 ( U 2 ( u , v ) , w ) .
1.2.
  v ( e , 1 ] ,
1.2.1. If w [ 0 , e ) I e , then U 2 ( u , U 2 ( v , w ) ) = U 2 ( u , v ) = v = U 2 ( v , w ) = U 2 ( U 2 ( u , v ) , w ) .
1.2.2. If w ( e , 1 ] , then U 2 ( u , U 2 ( v , w ) ) = U 2 ( u , v w η ) = v w η = U 2 ( v , w ) = U 2 ( U 2 ( u , v ) , w ) .
2.
  u ( e , 1 ] .
2.1.
  v [ 0 , e ) I e ,
2.1.1. If w [ 0 , e ) I e , then U 2 ( u , U 2 ( v , w ) ) = U 2 ( u , v w ) = u = U 2 ( u , w ) = U 2 ( U 2 ( u , v ) , w ) .
2.1.2. If w ( e , 1 ] , then U 2 ( u , U 2 ( v , w ) ) = U 2 ( u , w ) = U 2 ( U 2 ( u , v ) , w ) .
2.2.
  v ( e , 1 ] ,
2.2.1. If w [ 0 , e ) I e , then U 2 ( u , U 2 ( v , w ) ) = U 2 ( u , v ) = u v η = U 2 ( u v η , w ) = U 2 ( U 2 ( u , v ) , w ) .
2.2.2. If w ( e , 1 ] , then U 2 ( u , U 2 ( v , w ) ) = U 2 ( u , v w η ) = u v w η = U 2 ( u v η , w ) = U 2 ( U 2 ( u , v ) , w ) .
It is easy to observe the commutativity of U 2 and the fact that e is a neutral element of U 2 .
Therefore, U 2 is a uninorm on L with the neutral element e. □
The structure of the uninorm U 2 given in the Formula (3) is summarized in Figure 4.
In the following example, a uninorm on the bounded lattice L 2 with the element η ( e , 1 ) is constructed by means of Theorem 3.
Example 3.
Consider the bounded lattice L 2 = ( { 0 , a , b , c , d , e , f , η , 1 } , , 0 , 1 ) characterized by the Hasse diagram in Figure 5. If we apply the formula (3) in Theorem 3, the uninorm U 2 on L 2 is obtained as in Table 2.
Remark 2.
It is worth noting that the uninorm U 2 is not equal, up to our best knowledge, to the uninorms obtained by the construction methods of uninorms in the literature. Considering Example 3, it is easily seen that U 2 U t 1 , U e T , U ( T , e ) and U t regardless of the choice of the corresponding t-norms on [ 0 ,   e ] in [5,11,13,15], since
U 2 ( d , c ) = d c = f b = d c = U t 1 ( d , c ) , U 2 ( a , c ) = a 1 = U e T ( a , c ) , U 2 ( d , c ) = d c = f η = d c e = U ( T , e ) ( d , c ) , U 2 ( d , c ) = d c = f 1 = U t ( d , c ) ,
respectively. Also, it is clear that the lattice L 2 satisfies the constraints of Theorem 3.1 in [12] and Theorem 3.1 in [14]. We obtain U 2 U t e since U 2 ( d , c ) = d c = f b = d c = U t e ( d , c ) regardless of the choice of the t-norm T e on [ 0 ,   e ] in [12]. In addition, U 2 U since U 2 ( c , d ) = c d = f b = c d = U ( c , d ) regardless of the choice of the t-norm T e on [ 0 ,   e ] and t-conorm S e on [ e , 1 ] in [14]. Moreover, regardless of the choice of the t-conorm S e on [ e , 1 ] in [22], U 2 U S 1 since U 2 ( a , c ) = a c = U S 1 ( a , c ) . Furthermore, since U 2 ( 0 , 1 ) = 1 and U s 1 ( 0 , 1 ) = U e S ( 0 , 1 ) = U ( S , e ) ( 0 , 1 ) = U s ( 0 , 1 ) = U s e ( 0 , 1 ) = U T 1 ( 0 , 1 ) = U ( 0 , 1 ) = 0 on any lattice regardless of the choice of the corresponding t-norms on [ 0 ,   e ] and/or t-conorms on [ e , 1 ] in [5,11,12,13,14,15,22].
Another construction method is introduced in Theorem 4 without proof, as it is dual to Theorem 3.
Theorem 4.
Let ( L , , 0 , 1 ) be a bounded lattice, e L { 0 , 1 } and η ( 0 , e ) . Then the function U 2 : L 2 L defined by
U 2 ( u , v ) = u v η ( u , v ) [ 0 , e ) 2 , u ( u , v ) [ 0 , e ) × ( ( e , 1 ] I e ) L × { e } , v ( u , v ) ( ( e , 1 ] I e ) × [ 0 , e ) { e } × L , u v o t h e r w i s e ,
is a uninorm on L with the neutral element e if and only if u < v for all u ( 0 , e ) , v I e .
The structure of the uninorm U 2 given in the Formula (4) is summarized in Figure 6.
In the following theorem, a method to produce uninorm by means of a fixed element η ( 0 , e ) is given.
Theorem 5.
Let ( L , , 0 , 1 ) be a bounded lattice, e L { 0 , 1 } and η ( 0 , e ) . Then the function U 3 : L 2 L defined by
U 3 ( u , v ) = u v η ( u , v ) ( [ 0 , e ) I e ) × ( [ 0 , e ) I e ) , u ( u , v ) ( [ 0 , e ) I e ) × ( e , 1 ] L × { e } , v ( u , v ) ( e , 1 ] × ( [ 0 , e ) I e ) { e } × L , u v o t h e r w i s e ,
is a uninorm on L with the neutral element e.
Proof. 
 (i) Monotonicity: Let us show that for every element u , v L with u v , U 3 ( u , w ) U 3 ( v , w ) for all w L . If u and v are both elements of [ 0 , e ) or { e } or ( e ,   1 ] or I e , U 3 ( u , w ) U 3 ( v , w ) is always satisfied for all w L since u v . If u = 0 or u = 1 , the inequality is satisfied; therefore, they are omitted. The proof is then split into all the remaining possible cases as follows.
1.
 Let u ( 0 , e ) .
1.1.
  v = e ,
1.1.1.
 If w ( 0 , e ) I e , then U 3 ( u , w ) = u w η w = U 3 ( v , w ) .
1.1.2.
 If w [ e , 1 ) , then U 3 ( u , w ) = u w = U 3 ( v , w ) .
1.2.
  v ( e , 1 ) ,
1.2.1.
 If w ( 0 , e ) I e , then U 3 ( u , w ) = u w η w = U 3 ( v , w ) .
1.2.2.
  If w = e , then U 3 ( u , w ) = u v = U 3 ( v , w ) .
1.2.3.
 If w ( e , 1 ) , then U 3 ( u , w ) = u v w = U 3 ( v , w ) .
1.3.
  v I e ,
1.3.1.
 If w ( 0 , e ) I e , then U 3 ( u , w ) = u w η v w η = U 3 ( v , w ) .
1.3.2.
 If w [ e , 1 ) , then U 3 ( u , w ) = u v = U 3 ( v , w ) .
2.
  u = e ,
2.1.
  v ( e , 1 ) ,
2.1.1.
 If w ( 0 , e ) I e , then U 3 ( u , w ) = w = U 3 ( v , w ) .
2.1.2.
 If w = e , then U 3 ( u , w ) = u v = U 3 ( v , w ) .
2.1.3.
 If w ( e , 1 ) , then U 3 ( u , w ) = w v w = U 3 ( v , w ) .
3.
  u I e ,
3.1.
  v ( e , 1 ) ,
3.1.1.
 If w ( 0 , e ) I e , then U 3 ( u , w ) = u w η w = U 3 ( v , w ) .
3.1.2.
 If w = e , then U 3 ( u , w ) = u v = U 3 ( v , w ) .
3.1.3.
 If w ( e , 1 ) , then U ( u , w ) = u v w = U 3 ( v , w ) .
  • (ii) Associativity: We demonstrate that U 3 ( u , U 3 ( v , w ) ) = U 3 ( U 3 ( u , v ) , w ) for all u , v , w L . If u = e , the equality is satisfied; therefore, they are omitted. Again, the proof is split into all the remaining possible cases by considering the relationships between the elements u , v , w and e as follows.
1.
 Let u [ 0 , e ) I e .
1.1.
  v [ 0 , e ) I e ,
1.1.1. If w [ 0 , e ) I e , then U 3 ( u , U 3 ( v , w ) ) = U 3 ( u , v w η ) = u v w η = U 3 ( u v η , w ) = U 3 ( U 3 ( u , v ) , w ) .
1.1.2. If w ( e , 1 ] , then U 3 ( u , U 3 ( v , w ) ) = U 3 ( u , v ) = u v η = U 3 ( u v η , w ) = U 3 ( U 3 ( u , v ) , w ) .
1.2.
  v ( e , 1 ] ,
1.2.1. If w [ 0 , e ) I e , then U 3 ( u , U 3 ( v , w ) ) = U 3 ( u , w ) = U 3 ( U 3 ( u , v ) , w ) .
1.2.2. If w ( e , 1 ] , then U 3 ( u , U 3 ( v , w ) ) = U 3 ( u , v w ) = u = U 3 ( u , w ) = U 3 ( U 3 ( u , v ) , w ) .
2.
  u ( e , 1 ] .
2.1.
  v [ 0 , e ) I e ,
2.1.1. If w [ 0 , e ) I e , then U 3 ( u , U 3 ( v , w ) ) = U 3 ( u , v w η ) = v w η = U 3 ( v , w ) = U 3 ( U 3 ( u , v ) , w ) .
2.1.2. If w ( e , 1 ] , then U 3 ( u , U 3 ( v , w ) ) = U 3 ( u , v ) = v = U 3 ( v , w ) = U 3 ( U 3 ( u , v ) , w ) .
2.2.
  v ( e , 1 ] ,
2.2.1. If w [ 0 , e ) I e , then U 3 ( u , U 3 ( v , w ) ) = U 3 ( u , w ) = w = U 3 ( u v , w ) = U 3 ( U 3 ( u , v ) , w ) .
2.2.2. If w ( e , 1 ] , then U 3 ( u , U 3 ( v , w ) ) = U 3 ( u , v w ) = u v w = U 3 ( u v , w ) = U 3 ( U 3 ( u , v ) , w ) .
It is easy to observe the commutativity of U 3 and the fact that e is a neutral element of U 3 .
Therefore, U 3 is a uninorm on L with the neutral element e. □
The structure of the uninorm U 3 given in the Formula (5) is summarized in Figure 7.
Example 4.
Consider the bounded lattice L 3 = ( { 0 , a , b , c , d , e , f , k , m , η , 1 } , , 0 , 1 ) characterized by the Hasse diagram in Figure 8. If we apply the formula (5) in Theorem 5, the uninorm U 3 on L 3 is obtained as in Table 3.
Remark 3.
 In general, the construction method given by Theorem 5 produces a different uninorm from the uninorms obtained by the construction methods of uninorms in the literature. Regardless of the choice of the lattice L and the corresponding t-norms on [ 0 ,   e ] and/or t-conorms on [ e , 1 ] in [5,11,12,13,14,15,22], U 3 U t 1 , U e T , U ( T , e ) , U t , U t e , U S 1 and U since U 3 ( 0 , 1 ) = 0 1 = U t 1 ( 0 , 1 ) = U e T ( 0 , 1 ) = U ( T , e ) ( 0 , 1 ) = U t ( 0 , 1 ) = U t e ( 0 , 1 ) = U S 1 ( 0 , 1 ) = U ( 0 , 1 ) . Also, considering Example 4, U 3 U s 1 , U e S , U ( S , e ) and U s since
U 3 ( c , d ) = c d η = η b = c d = U s 1 ( c , d ) , U 3 ( a , b ) = a b η = m 0 = U e S ( a , b ) , U 3 ( a , b ) = a b η = m a = a b e = U ( S , e ) ( a , b ) , U 3 ( c , d ) = c d η = η 0 = U s ( c , d ) ,
respectively. Furthermore, one can easily check that the lattice L 2 satisfies the constraints of Theorem 3.12 in [12] and Theorem 3.8 in [14]. We obtain U 3 U s e since U 3 ( b , c ) = b c η = η 0 = U s e ( b , c ) regardless of the choice of the t-conorm S e on [ e , 1 ] in [12]. In addition, U 3 U , since U 3 ( c , d ) = c d η = η b = c d = U ( c , d ) regardless of the choice of the t-norm T e on [ 0 ,   e ] and the t-conorm S e on [ e , 1 ] in [14]. Moreover, regardless of the choice of the t-norm T e on [ 0 ,   e ] in [5,11,12,13,14,15,22].
Based on the duality principle, another construction method for uninorms on the bounded lattice L is introduced.
Theorem 6.
Let ( L , , 0 , 1 ) be a bounded lattice, e L { 0 , 1 } and η ( e , 1 ) . Then the function U 3 : L 2 L defined by
U 3 ( u , v ) = u v ( u , v ) [ 0 , e ) 2 , u ( u , v ) ( [ e , 1 ) I e ) × [ 0 , e ) L × { e } , v ( u , v ) [ 0 , e ) × ( [ e , 1 ) I e ) { e } × L , u v η o t h e r w i s e ,
is a uninorm on L with the neutral element e.
Proof. 
The proof follows easily from Theorem 5, and therefore, it is omitted. □
The structure of the uninorm U 3 given in the Formula (6) is summarized in Figure 9.

4. Conclusions

In this article, we have developed new methods for constructing uninorms with a neutral element e on a bounded lattice L using an arbitrary fixed η L that is not 0 , e or 1. We thoroughly explored all possible cases of the element η of the lattice L, i.e., η I e or η ( e , 1 ) or η ( 0 , e ) . For each construction method, we established necessary and sufficient conditions to ensure the resulting operation is indeed a uninorm on L. To clarify our methods, we have provided numerous examples and compared our techniques with existing ones in the literature. Looking ahead, we will continue studying element-based construction methods for nullnorms and some other aggregation functions on bounded lattices.

Author Contributions

Conceptualization, Ü.E. and R.M.; methodology, Ü.E., M.Y. and R.M.; validation, Ü.E., M.Y. and R.M.; investigation, Ü.E., M.Y. and R.M.; writing—original draft preparation, M.Y.; writing—review and editing, Ü.E., M.Y. and R.M.; visualization, Ü.E. and R.M.; supervision, Ü.E. and R.M. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The authors declare the availability of the data.

Acknowledgments

This study was supported by Scientific and Technological Research Council of Turkey (TÜBİTAK) under the Grant Number 122F472. The authors thank to TÜBİTAK for their support. This study was supported by Office of Scientific Research Projects of Karadeniz Technical University. Project Number: FDK-2022-10396. The third author kindly acknowledges the support of the grant VEGA 1/0036/23.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Yager, R.R.; Rybalov, A. Uninorms aggregation operators. Fuzzy Sets Syst. 1996, 180, 111–120. [Google Scholar] [CrossRef]
  2. Grabisch, M.; Marichal, J.-L.; Mesiar, R.; Pap, E. Aggregation Functions; Cambridge University Press: Cambridge, UK, 2009. [Google Scholar]
  3. Kerre, E.E.; Nachtegael, M. Fuzzy Techniques in Image Processing; Studies in Fuzziness and Soft Computing; Physica-Verlag: Heidelberg, Germany, 2000. [Google Scholar]
  4. Mayor, G.; Torrens, J. On a class of operators for expert systems. Int. J. Intell. Syst. 1993, 8, 771–778. [Google Scholar] [CrossRef]
  5. Karaçal, F.; Mesiar, R. Uninorms on bounded lattices. Fuzzy Sets Syst. 2015, 261, 33–43. [Google Scholar] [CrossRef]
  6. Ertuğrul, Ü.; Kesicioğlu, M.N.; Karaçal, F. Ordering based on uninorms. Inf. Sci. 2016, 330, 315–327. [Google Scholar] [CrossRef]
  7. Jočić, D.; Štajner-Papuga, I. Distributivity of a uni-nullnorm with continuous and archimedean underlying t-norms and t-conorms over an arbitrary uninorm. Math. Slovaca 2023, 73, 1527–1544. [Google Scholar] [CrossRef]
  8. Kalina, M. On uninorms and nullnorms on direct product of bounded lattices. Open Phys. 2016, 14, 321–327. [Google Scholar] [CrossRef]
  9. Kesicioğlu, M.N.; Ertuğrul, Ü.; Karaçal, F. An equivalence relation based on the U-partial order. Inf. Sci. 2017, 411, 39–51. [Google Scholar] [CrossRef]
  10. Kesicioğlu, M.N.; Ertuğrul, Ü.; Karaçal, F. Some notes on U-partial order. Kybernetika 2019, 55, 518–530. [Google Scholar] [CrossRef]
  11. Çaylı, G.D.; Karaçal, F.; Mesiar, R. On a new class of uninorms on bounded lattices. Inf. Sci. 2016, 367, 221–231. [Google Scholar] [CrossRef]
  12. Çaylı, G.D.; Karaçal, F. Construction of uninorms on bounded lattices. Kybernetika 2017, 53, 394–417. [Google Scholar] [CrossRef]
  13. Çaylı, G.D. A characterization of uninorms on bounded lattices by means of triangular norms and triangular conorms. Int. J. Gen. Syst. 2018, 47, 772–793. [Google Scholar] [CrossRef]
  14. Çaylı, G.D.; Mesiar, R. Methods for obtaining uninorms on some special classes of bounded lattices. Iran. J. Fuzzy Syst. 2023, 20, 111–126. [Google Scholar]
  15. Dan, Y.; Hu, B.Q. A new structure for uninorms on bounded lattices. Fuzzy Sets Syst. 2020, 386, 77–94. [Google Scholar] [CrossRef]
  16. Karaçal, F.; Ertuğrul, Ü.; Mesiar, R. Characterization of uninorms on bounded lattices. Fuzzy Sets Syst. 2017, 308, 54–71. [Google Scholar] [CrossRef]
  17. Yager, R.R. Uninorms in fuzzy system modeling. Fuzzy Sets Syst. 2001, 122, 165–175. [Google Scholar] [CrossRef]
  18. Birkhoff, G. Lattice Theory; American Mathematical Society Colloquium Publishers: Providence, RI, USA, 1968. [Google Scholar]
  19. Klement, E.P.; Mesiar, R.; Pap, E. Triangular Norms; Kluwer Academic Publishers: Dordrecht, The Netherlands, 2000. [Google Scholar]
  20. Çaylı, G.D.; Ertuğrul, Ü.; Karaçal, F. Some further construction methods for uninorms on bounded lattices. Int. J. Gen. Syst. 2023, 52, 414–442. [Google Scholar] [CrossRef]
  21. Ouyang, Y.; Zhang, H.P. Constructing uninorms via closure operators on a bounded lattice. Fuzzy Sets Syst. 2020, 395, 93–106. [Google Scholar] [CrossRef]
  22. Çaylı, G.D. New methods to construct uninorms on bounded lattices. Int. J. Approx. Reason. 2019, 115, 254–264. [Google Scholar] [CrossRef]
  23. Xie, A.; Li, S. On constructing the largest and smallest uninorms on bounded lattices. Fuzzy Sets Syst. 2020, 386, 95–104. [Google Scholar] [CrossRef]
  24. Zhang, H.P.; Wu, M.; Wang, Z.; Ouyang, Y.; De Baets, B. A characterization of the classes Umin and Umax of uninorms on a bounded lattice. Fuzzy Sets Syst. 2021, 423, 107–121. [Google Scholar] [CrossRef]
  25. Karaçal, F.; Şanlı, Z. Some new construction methods of t-norms and t-conorms on bounded lattices. Fuzzy Sets Syst. 2022, 451, 84–93. [Google Scholar] [CrossRef]
Figure 1. The structure of the uninorm U 1 .
Figure 1. The structure of the uninorm U 1 .
Axioms 14 00552 g001
Figure 2. Hasse diagram of L 1 .
Figure 2. Hasse diagram of L 1 .
Axioms 14 00552 g002
Figure 3. The structure of the uninorm U 1 .
Figure 3. The structure of the uninorm U 1 .
Axioms 14 00552 g003
Figure 4. The structure of the uninorm U 2 .
Figure 4. The structure of the uninorm U 2 .
Axioms 14 00552 g004
Figure 5. Hasse diagram of L 2 .
Figure 5. Hasse diagram of L 2 .
Axioms 14 00552 g005
Figure 6. The structure of the uninorm U 2 .
Figure 6. The structure of the uninorm U 2 .
Axioms 14 00552 g006
Figure 7. The structure of the uninorm U 3 .
Figure 7. The structure of the uninorm U 3 .
Axioms 14 00552 g007
Figure 8. Hasse diagram of L 3 .
Figure 8. Hasse diagram of L 3 .
Axioms 14 00552 g008
Figure 9. The structure of the uninorm U 3 .
Figure 9. The structure of the uninorm U 3 .
Axioms 14 00552 g009
Table 1. The uninorm U 1 induced by the Formula (1) in Theorem 1.
Table 1. The uninorm U 1 induced by the Formula (1) in Theorem 1.
U 1 0abcde η 1
00a000001
aaaaaaaa1
b0a η ddb η 1
c0adddcd1
d0addddd1
e0abcde η 1
η 0a η dd η η 1
111111111
Table 2. The uninorm U 2 induced by the Formula (3) in Theorem 3.
Table 2. The uninorm U 2 induced by the Formula (3) in Theorem 3.
U 2 0abcdef η 1
00a00000 η 1
aaaaaaaaa1
b0abcdbf η 1
c0accfcf η 1
d0adfddf η 1
e0abcdef η 1
f0afffff η 1
η η a η η η η η η 1
1111111111
Table 3. The uninorm U 3 induced by the Formula (5) in Theorem 5.
Table 3. The uninorm U 3 induced by the Formula (5) in Theorem 5.
U 3 0abcdefkm η 1
000000000000
a0mmmmaammma
b0m η η η bb η m η b
c0m η η η cc η m η c
d0m η η η dd η m η d
e0abcdefkm η 1
f0abcdffkm η 1
k0m η η η kk η m η k
m0mmmmmmmmmm
η 0m η η η η η η m η η
10abcd11km η 1
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

Ertuğrul, Ü.; Yeşilyurt, M.; Mesiar, R. Element-Based Construction Methods for Uninorms on Bounded Lattices. Axioms 2025, 14, 552. https://doi.org/10.3390/axioms14080552

AMA Style

Ertuğrul Ü, Yeşilyurt M, Mesiar R. Element-Based Construction Methods for Uninorms on Bounded Lattices. Axioms. 2025; 14(8):552. https://doi.org/10.3390/axioms14080552

Chicago/Turabian Style

Ertuğrul, Ümit, Merve Yeşilyurt, and Radko Mesiar. 2025. "Element-Based Construction Methods for Uninorms on Bounded Lattices" Axioms 14, no. 8: 552. https://doi.org/10.3390/axioms14080552

APA Style

Ertuğrul, Ü., Yeşilyurt, M., & Mesiar, R. (2025). Element-Based Construction Methods for Uninorms on Bounded Lattices. Axioms, 14(8), 552. https://doi.org/10.3390/axioms14080552

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