On Multiplicative Generators of n-Dimensional Overlap Functions

Hai Xie^1,2

¹College of Science, Guilin University of Technology, Guilin, China.
²Center for Data Analysis and Algorithm Technology, Guilin University of Technology, Guilin, China.

DOI: 10.4236/am.2020.1111071                

Abstract

In this paper, inspired by the multiplicative generators of overlap functions, we mainly propose the concepts of multiplicative generator pairs of n-dimensional overlap functions, in order to extend the dimensionality of overlap functions from 2 to n. We present the condition under which the pair (g, h) can multiplicatively generate an n-dimensional overlap function O_g,h. we focus on the homogeneity and idempotency property on multiplicatively generated n-dimensional overlap functions.

Keywords

n-Dimensional Overlap Functions, Overlap Functions, Multiplicative Generators

1. Introduction

Overlap functions [1] [2] and grouping functions [3] are two particular cases of bivariate continuous aggregation functions. Those two concepts have been applied to some interesting problems, for example, image processing, classification or decision making. In [4] , Gómez et al. introduced the definition of n-dimensional overlap functions and the conditions under which n-dimensional overlap functions are migrative, homogeneous or Lipschitz continuous. In [5] , Dimuro et al. introduced the notion of additive generator pair for overlap functions and analyzed the influence of the migrativity, homogeneity and idempotency properties in the overlap functions obtained by such distortion and their respective additive generator pairs. Qiao and Hu [6] proposed the concept of multiplicative generator pair for overlap functions and grouping functions, and investigated the migrativity, homogeneity, idempotency, Archimedean and cancellation properties for the overlap functions and grouping functions obtained by such multiplicative generator pairs. The main purpose of [6] is to present one new way to construct overlap function and grouping function by use of multiplicative generator pairs. In a fuzzy classification system, one always need to measure the degree of overlapping of an object with more than two classes. From the theoretical and applied point of view, we need to study how to construct n-dimensional overlap function by use of multiplicative generator pairs. In this paper, we will propose the notions of multiplicative generator pairs of n-dimensional overlap functions. Furthermore, we study the homogeneity and idempotency property on multiplicatively generated n-dimensional overlap functions.

The rest of this paper is organized as follows. In Section 2, we present some basic definitions on overlap functions and n-dimensional overlap functions. We introduce the concept of multiplicative generators of n-dimensional overlap functions in Section 3. We study the homogeneity and idempotency property on multiplicatively generated n-dimensional overlap functions in Section 4. Finally, we end this paper with some conclusions.

2. Preliminaries

In this section, we recall some basic concepts of overlap functions and n-dimensional overlap functions, which shall be needed in the sequel.

Definition 2.1. (See Bustince et al. [1] ) A bivariate function $O:{\left[0,1\right]}^2\to \left[0,1\right]$ is said to be an overlap function if it satisfies the following conditions:

(O₁) O is commutative;

(O₂) O(x, y) = 0 iff xy = 0;

(O₃) O(x, y) = 1 iff xy = 1;

(O₄) O is increasing;

(O₅) O is continuous.

Definition 2.2. (See Gómez et al. [4] ) An n-dimensional aggregation function $O:{\left[0,1\right]}^n\to \left[0,1\right]$ is an n-dimensional overlap function if and only if:

(O₁) O is symmetric.

(O₂) $O\left(x_1,\cdots ,x_n\right)=0$ if and only if ${\displaystyle {\prod }_{i=1}^n{x}_i}=0$ .

(O₃) $O\left(x_1,\cdots ,x_n\right)=1$ if and only if x_i = 1 for all $i\in \left\{\text{1},\cdots ,n\right\}$ .

(O₄) O is increasing.

(O₅) O is continuous.

Definition 2.3. (See Dimuro et al. [5] ) A function $F:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is said to be a pseudo-automorphism if the following conditions hold:

(F₁) F is increasing;

(F₂) F is continuous;

(F₃) F(x) = 1 iff x = 1;

(F₄) F(x) = 0 iff x = 0.

A function $\phi :\left[0,1\right]\to \left[0,1\right]$ is an automorphism if it is a continuous and strictly increasing function such that φ(0) = 0 and φ(1) = 1 [7] . Obviously, any automorphism is a strictly increasing pseudo-automorphism.

3. Multiplicative Generators of n-Dimensional Overlap Functions

In this section, we try to extend the notion of multiplicative generators of overlap functions to the n-dimensional case, and characterize the basic properties of multiplicative generators of n-dimensional overlap functions.

Definition 3.1. Consider two continuous and increasing functions $g,h:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ . The n-dimensional function $O_{g,h}:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ given by

$O_{g,h}\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)$ (1)

If $O_{g,h}$ is an n-dimensional overlap function, then (g, h) is said to be a multiplicative generator pair of the overlap function $O_{g,h}$ and $O_{g,h}$ is called multiplicatively generated by the pair (g, h).

Proposition 3.1. Consider two continuous and increasing functions $g,h:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ such that

1) h(x) = 0 iff x = 0;

2) h(x) = 1 iff x = 1;

3) g(x) = 0 iff x = 0;

4) g(x) = 1 iff x = 1.

Then, the n-dimensional function $O_{g,h}:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ , given by

$O_{g,h}\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)$ (2)

is an n-dimensional overlap function.

Proof. We check out one by one that $O_{g,h}$ satisfies the conditions of Definition 2.2 as follows.

(O₁) The commutativity is obvious by the definition of $O_{g,h}$ .

(O₂) $O_{g,h}\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=0$ $\iff$ $g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)=0$

$\iff$ $h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)=0$ by item (3)

$\iff$ $h\left(x_{\text{1}}\right)=0$ or $h\left(x_{\text{2}}\right)=0$ or $\cdots$ or $h\left(x_n\right)=0$

$\iff$ $x_{\text{1}}=0$ or $x_{\text{2}}=0$ or $\cdots$ or $x_n=0$ by item (1)

$\iff$ $x_{\text{1}}{x}_{\text{2}}\cdots x_n=0$ .

(O₃) $O_{g,h}\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=1$ $\iff$ $g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)=1$

$\iff$ $h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)=1$ by item (4)

$\iff$ $h\left(x_{\text{1}}\right)=1$ and $h\left(x_{\text{2}}\right)=1$ and $\cdots$ and $h\left(x_n\right)=1$

$\iff$ $x_{\text{1}}=1$ and $x_{\text{2}}=1$ and $\cdots$ and $x_n=1$ by item (2).

(O₄) By the monotonicity of g and h, it is easy to get that $O_{g,h}$ is increasing.

(O₅) From the continuities of g and h, the continuity can be obtained immediately.

Proposition 3.2. Consider two continuous and increasing functions $g,h:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ such that

1) g(x) = 0 iff x = 0;

2) g(x) = 1 iff x = 1;

3) $O_{g,h}\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)$ is an n-dimensional overlap function.

Then the following statements hold:

1) h(x) = 0 iff x = 0;

2) h(x) = 1 iff x = 1.

Proof. 1) ( $\Rightarrow$ ) If h(x) = 0, then $h\left(x\right)h\left(x_{\text{1}}\right)\cdots h\left(x_{n-1}\right)=0$ for any $x_i\in \left(0,\text{1}\right]$ ( $i=1,\cdots ,n-1$ ). Furthermore, by items (1) and (3), one can get that

$O_{g,h}\left(x,x_1,\cdots ,x_{n-1}\right)=g\left(h\left(x\right)h\left(x_{\text{1}}\right)\cdots h\left(x_{n-1}\right)\right)=0$ .

Thus, it follows that x = 0 from (O₂).

( $\Leftarrow$ ) If x = 0, then, by item (3), we can obtain that

$g\left(h\left(x\right)h\left(x\right)\cdots h\left(x\right)\right)=O_{g,h}\left(x,x,\cdots ,x\right)=0$ .

Furthermore, one has that h(x) = 0 by item (1). Hence, we get that h(x) = 0 iff x = 0.

2) It can be verified in a similar way as item (1).

Proposition 3.3. Consider two continuous and increasing functions $g,h:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ and g, h such that

1) h(x) = 0 iff x = 0;

2) h(x) = 1 iff x = 1;

3) $O_{g,h}\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)$ is an n-dimensional overlap function.

Then the following statements hold:

1) g(x) = 0 iff x = 0;

2) g(x) = 1 iff x = 1.

Proof. 1) ( $\Rightarrow$ ) Since $h:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is continuous, we have that $h^n:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is continuous, where hⁿ is defined by $h^n\left(x\right)={\left(h\left(x\right)\right)}^n$ for all $x\in \left[0,\text{1}\right]$ . Furthermore, we can obtain that for all $x\in \left[0,\text{1}\right]$ , there exists $x^{\prime }\in \left[0,\text{1}\right]$ such that $h^n\left(x^{\prime }\right)=x$ by items (1), (2). Thus, if g(x) = 0, then it follows that $g\left(h^n\left(x^{\prime }\right)\right)=0$ for $x=h^n\left(x^{\prime }\right)$ . Moreover, by item (3), one can get that

$O_{g,h}\left(x^{\prime },x^{\prime },\cdots ,x^{\prime }\right)=g\left(h\left(x^{\prime }\right)h\left(x^{\prime }\right)\cdots h\left(x^{\prime }\right)\right)=g\left(h^n\left(x^{\prime }\right)\right)=0$ .

Thus, using item (3) again, one has that $x^{\prime }=0$ . Furthermore, using item (1) again, it follows that $x=h^n\left(x^{\prime }\right)=h^n\left(0\right)=0$ .

( $\Leftarrow$ ) If x = 0, then, by item (3), it follows that

$g\left(h\left(x\right)h\left(x\right)\cdots h\left(x\right)\right)=O_{g,h}\left(x,x,\cdots ,x\right)=0$ .

Furthermore, by item (1), one has that

$g\left(x\right)=g\left(0\right)=g\left(h\left(x\right)h\left(x\right)\cdots h\left(x\right)\right)=0$ .

Hence, we have that g(x) = 0 iff x = 0.

2) It can be proven in a similar way as item (1).

Proposition 3.4. Suppose that $F:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is a pseudo-automorphism. Then, for any n-dimensional overlap function $O:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ , the n-dimensional function $O_F:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ , given by

$O_F\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=F\left(O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)$ (3)

is an n-dimensional overlap function.

Proof. We verify that O_F satisfies the conditions of Definition 2.2 one by one as follows.

(O₁) The symmetry is obvious by the definition of O_F.

(O₂) $O_F\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=0$ $\iff$ $F\left(O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)=0$

$\iff$ $O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=0$

$\iff$ $x_{\text{1}}{x}_{\text{2}}\cdots x_n=0$ .

(O₃) $O_F\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=1$ $\iff$ $F\left(O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)=1$

$\iff$ $O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=1$

$\iff$ $x_{\text{1}}{x}_{\text{2}}\cdots x_n=1$ .

(O₄) Since F is increasing, one has that O_F is increasing immediately.

(O₅) The continuity can be obtained immediately from the continuities of F and O.

Proposition 3.5. Suppose that $F:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is a pseudo-automorphism. If (g, h) is a multiplicative generator pair of n-dimensional overlap function $O:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ , then (F◦g, h) is a multiplicative generator pair of the n-dimensional overlap function O_F given in Proposition 3.4.

Proof. Since O is multiplicatively generated by the pair (g, h), we have that

$O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)$ .

for all $x,y\in \left[0,\text{1}\right]$ . Moreover, by the definition of O_F, it follows that for all $x,y\in \left[0,\text{1}\right]$ ,

$\begin{array}{c}{O}_F\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=F\left(O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)\\ =F\left(g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)\right)\\ =\left(F\circ g\right)\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)\end{array}$

Thus, since F is continuous and increasing, by Definition 3.1, we conclude that (F◦g, h) is a multiplicative generator pair of the overlap function O_F.

Proposition 3.6. Suppose that $F:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is a pseudo-automorphism and $O:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ is an n-dimensional overlap function. If (g, h) is a multiplicative generator pair of n-dimensional overlap function O_F given in Proposition 3.4, then (F⁻¹◦g, h) is a multiplicative generator pair of the n-dimensional overlap function O.

Proof. Since O_F is multiplicatively generated by the pair (g, h), one has that

$O_F\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)$ .

for all $x,y\in \left[0,\text{1}\right]$ . Moreover, by the definition of O_F, it follows that for all $x,y\in \left[0,\text{1}\right]$ ,

$\begin{array}{c}O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)=\left(F^{-1}\circ F\right)\left(O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)\\ =F^{-1}\left(F\left(O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)\right)\\ =F^{-1}\left(O_F\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)\\ =F^{-1}\left(g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)\right)\\ =\left(F^{-1}\circ g\right)\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)\end{array}$

Thus, since F⁻¹ is continuous and strictly increasing, by Definition 3.1, we conclude that (F⁻¹◦g, h) is a multiplicative generator pair of the n-dimensional overlap function O.

4. Homogeneity and Idempotency Property on Multiplicatively Generated n-Dimensional Overlap Functions

Proposition 4.1. Suppose that $O:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ is an n-dimensional overlap function multiplicatively generated by the pair (g, h). If h is homogeneous of order k₁ and g is homogeneous of order k₂, then O is homogeneous of order nk₁k₂.

Proof. If h is homogeneous of order k₁ and g is homogeneous of order k₂, then we can obtain that

$\begin{array}{c}O\left(\alpha x_1,\alpha x_2,\cdots ,\alpha x_n\right)=g\left(h\left(\alpha x_{\text{1}}\right)h\left(\alpha x_{\text{2}}\right)\cdots h\left(\alpha x_n\right)\right)\\ =g\left({\alpha }^{n{k}_1}h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)\\ ={\left({\alpha }^{n{k}_1}\right)}^{k_2}g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)\\ ={\alpha }^{n{k}_1{k}_2}g\left(h\left(x_{\text{1}}\right)h\left(x_{\text{2}}\right)\cdots h\left(x_n\right)\right)\\ ={\alpha }^{n{k}_1{k}_2}O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\end{array}$

Hence, it follows that O is homogeneous of order nk₁k₂.

Proposition 4.2. Suppose $F:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is a k₁-homogeneous pseudo-automorphism and $O:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ is an n-dimensional overlap function. Consider the following conditions:

1) O is homogeneous of order k₂;

2) O_F is homogeneous of order k₁k₂.

Then (1) $\Rightarrow$ (2), and if F is an automorphism, then (1) $\iff$ (2).

Proof. (1) implies (2): If O is homogeneous of order k₂, then we get that

$\begin{array}{c}{O}_F\left(\alpha x_1,\alpha x_2,\cdots ,\alpha x_n\right)=F\left(O\left(\alpha x_1,\alpha x_2,\cdots ,\alpha x_n\right)\right)\\ =F\left({\alpha }^{k_2}O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)\\ ={\left({\alpha }^{k_2}\right)}^{k_1}F\left(O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)\\ ={\alpha }^{k_1{k}_2}{O}_F\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\end{array}$

Hence, it follows that O_F is homogeneous of order k₁k₂.

Moreover, if F is an automorphism and O_F is homogeneous of order k₁k₂, then we prove item (1) as follows.

$\begin{array}{c}F\left({\alpha }^{k_2}O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)={\alpha }^{k_1{k}_2}F\left(O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\right)\\ ={\alpha }^{k_1{k}_2}{O}_F\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)\\ =O_F\left(\alpha x_1,\alpha x_2,\cdots ,\alpha x_n\right)\\ =F\left(O\left(\alpha x_1,\alpha x_2,\cdots ,\alpha x_n\right)\right)\end{array}$

Hence, it follows that $O\left(\alpha x_1,\alpha x_2,\cdots ,\alpha x_n\right)={\alpha }^{k_2}O\left(x_{\text{1}},x_{\text{2}},\cdots ,x_n\right)$ , since F is strictly increasing. Furthermore, we conclude that O is homogeneous of order k₂.

An element $x\in \left[0,\text{1}\right]$ is said to be an idempotent element of an n-dimensional function $A:{\left[0,1\right]}^n\to \left[0,1\right]$ if and only if $A\left(x,x,\cdots ,x\right)=x$ .

Proposition 4.3. Suppose that $O:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ is an n-dimensional overlap function multiplicatively generated by the pair (g, h), where $g:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is given by $g\left(x\right)=\sqrt[n]{x}$ for all $x\in \left[0,\text{1}\right]$ . Consider the following conditions:

1) h(x₀) = x₀ for some $x_0\in \left[0,\text{1}\right]$ ;

2) x₀ is an idempotent element of O.

Then (1) $\iff$ (2).

Proof. 1) $\Rightarrow$ (2): If x₀ is a fixed point of h, then we can obtain

$\begin{array}{c}O\left(x_{\text{0}},x_{\text{0}},\cdots ,x_0\right)=g\left(h\left(x_0\right)h\left(x_0\right)\cdots h\left(x_0\right)\right)\\ =\sqrt[n]{h\left(x_0\right)h\left(x_0\right)\cdots h\left(x_0\right)}\\ =h\left(x_0\right)\\ =x_0\end{array}$

Hence, it follows that x₀ is an idempotent element of O.

2) $\Rightarrow$ (1): If x₀ is an idempotent element of O, then one can have

$\begin{array}{c}{x}_0=O\left(x_{\text{0}},x_{\text{0}},\cdots ,x_0\right)\\ =g\left(h\left(x_0\right)h\left(x_0\right)\cdots h\left(x_0\right)\right)\\ =\sqrt[n]{h\left(x_0\right)h\left(x_0\right)\cdots h\left(x_0\right)}\\ =h(\; x\; 0\; )\end{array}$

Hence, it follows that x₀ is a fixed point of h.

Corollary 4.1. Suppose that $O:{\left[0,\text{1}\right]}^n\to \left[0,\text{1}\right]$ is an n-dimensional overlap function multiplicatively generated by the pair (g, h), where $h:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is given by $h\left(x\right)=\sqrt[n]{x}$ for all $x\in \left[0,\text{1}\right]$ . Consider the following conditions:

1) g(x₀) = x₀ for some $x_0\in \left[0,\text{1}\right]$ ;

2) x₀ is an idempotent element of O.

Then (1) $\iff$ (2).

Proof. It can be proven in a similar way as Proposition 4.3.

Proposition 4.4. Suppose that $O:{\left[0,\text{1}\right]}^2\to \left[0,\text{1}\right]$ is an n-dimensional overlap function and $F:\left[0,\text{1}\right]\to \left[0,\text{1}\right]$ is a pseudo-automorphism with F(x₀) = x₀ for some $x_0\in \left[0,\text{1}\right]$ . Consider the following conditions:

1) x₀ is an idempotent element of O;

2) x₀ is an idempotent element of O_F;

Then (1) $\Rightarrow$ (2), and if F is an automorphism, then (1) $\iff$ (2).

Proof. (1) $\Rightarrow$ (2): If x₀ is an idempotent element of O, then we can obtain

$\begin{array}{c}{O}_F\left(x_{\text{0}},x_{\text{0}},\cdots ,x_0\right)=F\left(O\left(x_{\text{0}},x_{\text{0}},\cdots ,x_0\right)\right)\\ =F\left(x_{\text{0}}\right)\\ =x_{\text{0}}\end{array}$

Hence, it holds that x₀ is an idempotent element of O_F.

Moreover, if F is an automorphism and x₀ is an idempotent element of O_F, then we prove item (1) as follows.

Hence, we get that, sine F is strictly increasing. Moreover, we conclude that x₀ is an idempotent element of O.

5. Conclusion

In this paper, we mainly extend the notions of multiplicative generator pairs of overlap functions to n-dimensional case. We propose some basic properties on multiplicatively generated n-dimensional overlap functions, such as the homogeneity and idempotency property. In a similar way, one can also study the multiplicative generator pairs of n-dimensional grouping functions by the duality of n-dimensional overlap and grouping functions.

Acknowledgements

This research was supported by National Nature Science Foundation of China (Grant Nos. 61763008, 11661028, 11661030), Nature Science Foundation of Guangxi, China (Grant Nos. 2016 GXNSFAA380059, 2016 GXNSFBA380077, 2017 GXNSFAA198223), Colleges Science Research Project of Guangxi, China (Grant No. 2017 KY0264) and Scientific Research Start-up Foundation of Guilin University of Technology, China (Grant No. 002401003452).

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1]	Bustince, H., Fernandez, J., Mesiar, R., Montero, J. and Orduna, R. (2009) Overlap Index, Overlap Functions and Migrativity. Proceedings of IFSA/EUSFLAT Conference, Lisbon, 20-24 July 2009, 300-305.
[2]	Bustince, H., Fernandez, J., Mesiar, R., Montero, J. and Orduna, R. (2010) Overlap Functions. Nonlinear Analysis: Theory, Methods & Applications, 72, 1488-1499. https://doi.org/10.1016/j.na.2009.08.033
[3]	Bustince, H., Pagola, M., Mesiar, R., Hüllermeier, E. and Herrera, F. (2012) Grouping, Overlaps, and Generalized Bientropic Functions for Fuzzy Modeling of Pairwise Comparisons. IEEE Transactions on Fuzzy Systems, 20, 405-415. https://doi.org/10.1109/TFUZZ.2011.2173581
[4]	Gómez, D., Rodríguez, J.T., Montero, J., Bustince, H. and Barrenechea, E. (2016) n-Dimensional Overlap Functions. Fuzzy Sets and Systems, 287, 57-75. https://doi.org/10.1016/j.fss.2014.11.023
[5]	Dimuro, G.P., Bedregal, B., Bustince, H., Asiáin, M.J. and Mesiar, R. (2016) On Additive Generators of Overlap Functions. Fuzzy Sets and Systems, 287, 76-96. https://doi.org/10.1016/j.fss.2015.02.008
[6]	Qiao, J. and Hu, B.Q. (2018) On Multiplicative Generators of Overlap and Grouping Functions. Fuzzy Sets and Systems, 332, 1-24. https://doi.org/10.1016/j.fss.2016.11.010
[7]	Bustince, H., Burillo, P. and Soria, F. (2003) Automorphism, Negations and Implication Operators. Fuzzy Sets and Systems, 134, 209-229. https://doi.org/10.1016/S0165-0114(02)00214-2