Skip to main content
Springer Nature - PMC COVID-19 Collection logoLink to Springer Nature - PMC COVID-19 Collection
. 2020 May 16;1239:318–331. doi: 10.1007/978-3-030-50153-2_24

On Integral Transforms for Residuated Lattice-Valued Functions

Michal Holčapek 8,, Viec Bui 8
Editors: Marie-Jeanne Lesot6, Susana Vieira7, Marek Z Reformat8, João Paulo Carvalho9, Anna Wilbik10, Bernadette Bouchon-Meunier11, Ronald R Yager12
PMCID: PMC7274741

Abstract

The article aims to introduce four types of integral transforms for functions whose function values belong to a complete residuated lattice. The integral transforms are defined using so-called qualitative residuum based fuzzy integrals and integral kernels in the form of binary fuzzy relations. We present some of the basic properties of proposed integral transforms including a linearity property that is satisfied under specific conditions for comonotonic functions.

Keywords: Integral transform, Fuzzy transform, Residuated lattice, Integral kernel, Fuzzy integral

Introduction

Mathematical operators known as integral transforms produce a new function g(y) by integrating the product of an existing function f(x) and an integral kernel function K(xy) between suitable limits. The Fourier and Laplace transforms belong among the most popular integral transforms and are applied for real or complex-valued functions. The importance of the integral transforms is mainly in solving (partial) differential equations, algebraic equations, signal and image processing, spectral analysis of stochastic processes (see, e.g., [2, 21, 23]).

In fuzzy set theory we often deal with functions whose function values belong to an appropriate algebra of truth values as a residuated lattice and its special variants as the BL-algebra, MV-algebra, IMTL-algebra (see, e.g. [1, 5, 18]). In [20], Perfilieva introduced lattice-valued upper and lower fuzzy transforms that are, among others, used for an approximation of functions. A deeper investigation of fuzzy transforms properties can be found in [1317, 19, 22]. In a recent article [9], we demonstrated that the lower and upper fuzzy transforms can be introduced as two type of integral transforms, where the multiplication based fuzzy integral is applied [3, 4]. Namely, for a fuzzy measure space Inline graphic, an integral kernel Inline graphic and a function Inline graphic, where L is a complete residuated lattice, we proposed the integral transforms given by the following formulas:

graphic file with name M4.gif

where Inline graphic becomes the upper fuzzy transform if Inline graphic for any Inline graphic such that Inline graphic and Inline graphic becomes the lower fuzzy transform if Inline graphic for any Inline graphic such that Inline graphic.1 Moreover, to get the exact definitions of lower and upper fuzzy transforms, the family of fuzzy sets Inline graphic has to form a fuzzy partition of X (see [20]).

The aim of this article is to introduce further integral transforms for residuated lattice-valued functions and analyze their basic properties for which we consider the residuum based fuzzy integrals that were proposed by Dvořák and Holčapek in [4] and Dubois, Prade and Rico in [3]. Together with the integral transform with the multiplication based fuzzy integral introduced in [9] we get a class of nonstandard integral transforms for the residuated lattice-valued functions based on fuzzy (or also qualitative) integrals that are often used in data processing. Note that the fuzzy integrals aggregate data and, in this way, provide summary information that is not directly visible from data. Obviously, the proposed integral transforms also provide an aggregation of function values, mainly, if the set Y has a significantly smaller size than the set X. This can be used, for example, in hierarchical decision making, classification problem or signal and image processing, where kernels can express relationships between different levels of criteria, object attributes and classes or introduce windows for some kind of filtering, respectively.

The article is structured as follows. In the next section, we recall the definition of complete residuated lattices and the basic concepts of fuzzy set theory and the theory of fuzzy measure spaces. The third section introduces two types of the residuum based fuzzy integrals and shows their basic properties. The integral transforms for residuated lattice-valued functions are established in the fourth section. We present their elementary properties and demonstrate the linearity property under the restriction to comonotonic functions. The last section is a conclusion.

Because of the space limitation almost all proofs are omitted in this article.

Preliminary

Truth Value Structures

We assume that the structure of truth values is a complete residuated lattice, i.e., an algebra Inline graphic with four binary operations and two constants such that Inline graphic is a complete lattice, where Inline graphic is the least element and Inline graphic is the greatest element of L, Inline graphic is a commutative monoid (i.e., Inline graphic is associative, commutative and the identity Inline graphic holds for any Inline graphic) and the adjointness property is satisfied, i.e.,

graphic file with name M22.gif 1

holds for each Inline graphic, where Inline graphic denotes the corresponding lattice ordering, i.e., Inline graphic if Inline graphic for Inline graphic. A residuated lattice L is said to be divisible if Inline graphic holds for arbitrary Inline graphic. The operation of negation on L is defined as Inline graphic for Inline graphic. A residuated lattice L satisfies the law of double negation if Inline graphic holds for any Inline graphic. A divisible residuated lattice satisfying the law of double negation is called an MV-algebra. A residuated lattice is said to be linearly ordered if the corresponding lattice ordering is linear, i.e., Inline graphic or Inline graphic holds for any Inline graphic.

Theorem 1

Let Inline graphic be a non-empty set of elements from L, and let Inline graphic. Then

  1. Inline graphic,

  2. Inline graphic,

  3. Inline graphic,

  4. Inline graphic,

  5. Inline graphic,

  6. Inline graphic.

If L is a complete MV-algebra the above inequalities may be replaced by equalities.

For more information about residuated lattices, we refer to [1, 18]. In what follows, we present two examples of linearly ordered lattice.

Example 1

It is easy to prove that the algebra

graphic file with name M45.gif

where T is a left continuous t-norm (see, e.g., [11]) and Inline graphic, defines the residuum, is a complete residuated lattice. In this article, we will refer to complete residuated lattices determined by the Łukasiewicz t-norm and nilpotent minimum, i.e.,

graphic file with name M47.gif

respectively. Their residua are as follows:

graphic file with name M48.gif

In the first case, the complete residuated lattice will be denoted by Inline graphic. Note that Inline graphic is a complete MV-algebra called the Łukasiewicz algebra (on [0, 1]), where, for example, the distributivity of Inline graphic over Inline graphic is satisfied.2 The residuated lattice determined by the nilpotent minimum is an example of a residuated lattice in which the above-mentioned distributivity fails.

Example 2

Let Inline graphic be such that Inline graphic. One checks easily that Inline graphic, where

graphic file with name M56.gif 2

is a complete residuated lattice. Note that Inline graphic is a special example of a more general residuated lattice called a Heyting algebra.3

In the end of this section, we introduce two families of subsets of L from which important algebras of sets are later generated. Let Inline graphic be defined as

graphic file with name M59.gif 3

for any Inline graphic. Obviously, Inline graphic. A set Inline graphic, for which Inline graphic holds, is called the upper set or upset. We use Inline graphic to denote the family of all upsets in L, i.e., Inline graphic.4 Similarly, let Inline graphic be defined as

graphic file with name M67.gif 4

for any Inline graphic. A set Inline graphic for which Inline graphic holds is called the lower set or loset. The family of all losets in L is denoted Inline graphic.

Fuzzy Sets

Let L be a complete residuated lattice, and let X be a non-empty universe of discourse. A function Inline graphic is called a fuzzy set (Inline graphic-fuzzy set) on X. A value A(x) is called a membership degree of x in the fuzzy set A. The set of all fuzzy sets on X is denoted by Inline graphic. A fuzzy set A on X is called crisp if Inline graphic for any Inline graphic. Obviously, a crisp fuzzy set can be uniquely identified with a subset of X. The symbol Inline graphic denotes the empty fuzzy set on X, i.e., Inline graphic for any Inline graphic. The set of all crisp fuzzy sets on X (i.e., the power set of X) is denoted by Inline graphic. A constant fuzzy set A on X (denoted as Inline graphic) satisfies Inline graphic for any Inline graphic, where Inline graphic. The sets Inline graphic and Inline graphic are called the support and the core of a fuzzy set A, respectively. A fuzzy set A is called normal if Inline graphic.

Let AB be fuzzy sets on X. The extension of the operations Inline graphic, Inline graphic, Inline graphic and Inline graphic on L to the operations on Inline graphic is given by

graphic file with name M93.gif 5

for any Inline graphic. Obviously, Inline graphic and Inline graphic are the standard definitions of the intersection and union of fuzzy sets A and B, respectively, but we prefer here the symbols of infimum (Inline graphic) and supremum (Inline graphic) over the classical Inline graphic and Inline graphic.

Let XY be non-empty universes. A fuzzy set Inline graphic is called a (binary) fuzzy relation. A fuzzy relation K is said to be normal, whenever Inline graphic, and normal in the first coordinate, whenever Inline graphic for any Inline graphic. Similarly, a fuzzy relation is normal in the second component. A fuzzy relation K is said to be complete normal whenever K is normal in the first and the second coordinates. A relaxation of the normality of fuzzy relation is a semi–normal fuzzy relation defined as Inline graphic, i.e., Inline graphic for certain Inline graphic. Similarly one can define semi-normal in the the first (second) coordinate and complete semi-normal fuzzy relation.

Fuzzy Measure Spaces

Measurable spaces and functions. Let us consider algebras of sets as follows.

Definition 1

Let X be a non-empty set. A subset Inline graphic of Inline graphic is an algebra of sets on X provided that.

  1. Inline graphic,

  2. if Inline graphic, then Inline graphic,

  3. if Inline graphic, then Inline graphic.

Definition 2

An algebra Inline graphic of sets on X is a Inline graphic-algebra of sets if

  • (A4)

    if Inline graphic, Inline graphic, then Inline graphic.

It is easy to see that if Inline graphic is an algebra (Inline graphic-algebra) of sets, then the intersection of finite (countable) number of sets belongs to Inline graphic. A pair Inline graphic is called a measurable space (on X) if Inline graphic is an algebra (Inline graphic-algebra) of sets on X. Let Inline graphic be a measurable space and Inline graphic. We say that A is Inline graphic-measurable if Inline graphic. Obviously, the sets Inline graphic and Inline graphic are Inline graphic-algebras of fuzzy sets on X.

A beneficial tool how to introduce an algebra or a Inline graphic-algebra of sets on X is an algebra (Inline graphic-algebra) generated by a non-empty family of sets.

Definition 3

Let Inline graphic be a non-empty family of sets. The smallest algebra (Inline graphic-algebra) on X containing Inline graphic is denoted by Inline graphic (Inline graphic) and is called the generated algebra (Inline graphic-algebra) by the family Inline graphic.

Note that the intersection of algebras (Inline graphic-algebras) is again an algebra (Inline graphic-algebra), hence, the smallest algebra (Inline graphic-algebra) on X containing Inline graphic always exists and its unique. Moreover, the generated algebra Inline graphic, in contrast to Inline graphic, can be simply constructed from the elements Inline graphic as the set which consists of all finite unions applied on the set of all finite intersections over the elements of Inline graphic and their complements. Note that the construction of a generated Inline graphic-algebra needs a transfinite approach. In this article, we will consider the algebras generated from the families of upsets Inline graphic and losets Inline graphic.

Let Inline graphic and Inline graphic be measurable spaces, and let Inline graphic be a function. We say that f is Inline graphic-Inline graphic-measurable if Inline graphic for any Inline graphic. The following theorem shows that the verification of Inline graphic-Inline graphic-measurability of functions can be simplified if Inline graphic is a generated algebra (Inline graphic-algebra).

Theorem 2

Let Inline graphic be a subset such that Inline graphic, and let Inline graphic be a measurable space. A function Inline graphic is Inline graphic-Inline graphic-measurable if and only if Inline graphic for any Inline graphic.

Proof

(Inline graphic) The implication is a simple consequence of Inline graphic.

(Inline graphic) Let Inline graphic. Note that Inline graphic is called the preimage algebra on Y. From the definition of the generated algebra Inline graphic by the family Inline graphic, we find that Inline graphic. Hence, we obtain that Inline graphic for any Inline graphic, which means that f is Inline graphic-Inline graphic-measurable.

Note that the previous theorem remains true if Inline graphic is replaced by Inline graphic. In the following three statements we provide sufficient conditions under which the functions obtained applying the operations to measurable functions remain measurable. For the purpose of this article, we restrict to fuzzy sets and algebras determined by upsets and losets.

Theorem 3

Let Inline graphic be linearly ordered, let Inline graphic be an algebra, and let Inline graphic be a set of all Inline graphic-Inline graphic-measurable fuzzy sets. Then Inline graphic for any Inline graphic.

Theorem 4

Let Inline graphic be an algebra, and let Inline graphic be a set of all Inline graphic-Inline graphic-measurable fuzzy sets. If Inline graphic is closed over arbitrary unions, then

graphic file with name M198.gif

Theorem 5

Let L be linearly ordered and dense. Let Inline graphic be an algebra, and let Inline graphic be a set of all Inline graphic-Inline graphic-measurable fuzzy sets. If Inline graphic is closed over arbitrary unions, then

graphic file with name M204.gif

The previous theorems become true if the algebra Inline graphic is replaced by Inline graphic and the Inline graphic-Inline graphic-measurability is considered.

Fuzzy Measures. The concept of a fuzzy measure on a measurable space Inline graphic is a slight extension of the standard definition of the normed measure where the unit interval (or the real line) is replaced by a complete residuated lattice L (e.g., [6, 12]).

Definition 4

A map Inline graphic is called a fuzzy measure on a measurable space Inline graphic if

  • (i)

    Inline graphic and Inline graphic,

  • (ii)

    if Inline graphic such that Inline graphic, then Inline graphic.

A triplet Inline graphic is called a fuzzy measure space whenever Inline graphic is a measurable space and Inline graphic is a fuzzy measure on Inline graphic.

Example 3

Let Inline graphic be an algebra from Example 1, where T is a continuous t-norm. Let Inline graphic be a finite non-empty set, and let Inline graphic be an arbitrary algebra. A relative fuzzy measure Inline graphic on Inline graphic can be given as

graphic file with name M226.gif

for all Inline graphic, where |A| and |X| denote the cardinality of A and X, respectively. Let Inline graphic be a monotonically non-decreasing map with Inline graphic and Inline graphic. The relative measure Inline graphic can be generalized as a fuzzy measure Inline graphic on Inline graphic given by Inline graphic for any Inline graphic.

Residuum Based Fuzzy Integrals

In the following part, we introduce two types of fuzzy (qualitative) integrals based on the operation of residuum. The first type of this fuzzy integral was proposed by Dvořák and Holčapek in [4] for fuzzy quantifiers modelling, the second type was proposed by Dubois, Prade and Rico in [3], known also under the name desintegral, for the reasoning with a decreasing evaluation scale. A comparison of both fuzzy integrals can be found in [10].

Inline graphic–Fuzzy Integral

The integrated functions are fuzzy sets on X. We consider a modified version of the original definition of the residuum based fuzzy integral presented in [4].

Definition 5

Let Inline graphic be a complementary fuzzy measure space, and let Inline graphic. The Inline graphic-fuzzy integral of f on X is given by

graphic file with name M240.gif 6

Note that the original definition in [4] and the previous definition of residuum based integrals coincide on MV-algebras. The following statement presents basic properties of Inline graphic-fuzzy integral.

Theorem 6

For any Inline graphic and Inline graphic, we have

  • (i)

    Inline graphic if Inline graphic;

  • (ii)

    Inline graphic;

  • (iii)

    Inline graphic;

  • (iv)

    Inline graphic.

Note that the inequality (iii) of the previous theorem becomes the equality in a complete MV-algebra. An equivalent, and useful from the practical point of view, definition of Inline graphic–fuzzy integrals can be obtained for Inline graphic-Inline graphic-measurable functions.

Theorem 7

If Inline graphic be Inline graphic-Inline graphic-measurable, then

graphic file with name M255.gif 7

We say that Inline graphic are comonotonic if and only if there is no pair Inline graphic such that Inline graphic and simultaneously Inline graphic. Note that the Sugeno integral preserves the infimum and supremum for the commonotonic functions, i.e., it is comonotonically minitive and comonotonically maxitive, (see, [7, Theorem 4.44]). A similar result for the residuum based fuzzy integral can be simply derived using the following lemma whose proof can be found in [9].

Lemma 1

Let L be linearly ordered, and let Inline graphic. Denote Inline graphic, where Inline graphic. Then Inline graphic is a chain with respect to Inline graphic, and if f and g are comonotonic, then Inline graphic or Inline graphic for any Inline graphic, where Inline graphic.

Theorem 8

Let Inline graphic be linearly ordered, and let Inline graphic be comonotonic Inline graphic-Inline graphic-measurable functions. Then

graphic file with name M273.gif 8

Note that a dual formula to (8), where the infimum is replaced by the supremum and vice versa, is not true in general even if we restrict ourselves to linearly ordered Heyting algebra (cf. Theorem 3.4 in [9] for the multiplication based fuzzy integral).

Inline graphic–Fuzzy Integrals

The integrated functions are again fuzzy sets on X.

Definition 6

Let Inline graphic be a fuzzy measure space, and let Inline graphic. The Inline graphic-fuzzy integral of f on X is given by

graphic file with name M278.gif 9

Note that if Inline graphic, then Inline graphic, hence, the empty set has no influence on the value of the Inline graphic–fuzzy integral. The following statement presents basic properties of Inline graphic-fuzzy integral.

Theorem 9

For any Inline graphic and Inline graphic, we have

  • (i)

    Inline graphic if Inline graphic;

  • (ii)

    Inline graphic;

  • (iii)

    Inline graphic;

  • (iv)

    Inline graphic.

Note that the inequality (iv) of the previous theorem becomes the equality in a complete MV-algebra. An equivalent formula to (9) under the assumption of Inline graphic-Inline graphic-measurability of functions is as follows.

Theorem 10

Let Inline graphic be a fuzzy measure space, and let Inline graphic be Inline graphic-Inline graphic-measurable. Then

graphic file with name M296.gif 10

Lemma 2

Let Inline graphic be linearly ordered, and let Inline graphic. Denote Inline graphic, where Inline graphic. Then Inline graphic is a chain with respect to Inline graphic, and if f and g are comonotonic, then Inline graphic or Inline graphic for any Inline graphic, where Inline graphic.

Theorem 11

Let Inline graphic be linearly ordered, and let Inline graphic be comonotonic Inline graphic-Inline graphic-measurable functions. Then

graphic file with name M311.gif

Integral Transforms for Lattice-Valued Functions

In this section, we propose four types of integral transforms for functions whose function values are evaluated in a complete residuated lattice. For their definitions, we use the residuum based fuzzy integral introduced in Sect. 3. The integral transforms transform fuzzy sets from Inline graphic to fuzzy sets from Inline graphic.

Inline graphic–Integral Transforms

In this part, we propose two types of integral transform based on Inline graphic–fuzzy integral. For their definitions we are inspired by a straightforward generalization of the lower and upper fuzzy transforms in terms of the multiplication based fuzzy integral presented in [9]. We start with the definition of Inline graphic–integral transforms merging an integral kernel and a transformed function by the multiplication operation.

Definition 7

Let Inline graphic be a complementary fuzzy measure space, and let Inline graphic be a semi-normal in the second component fuzzy relation. A map Inline graphic defined by

graphic file with name M320.gif 11

is called a Inline graphic–integral transform.

It is easy to see that a complementary measure Inline graphic and a semi-normal in the second component fuzzy relation K are parameters of Inline graphic–integral transform. The fuzzy relation K will be called the integral kernel, which corresponds to the standard notation in the theory of integral transforms. Note that the semi-normality in the second component of integral kernels is considered as a natural assumption avoiding the trivial case, namely, if Inline graphic for any Inline graphic and some Inline graphic, we trivially obtain Inline graphic as a consequence of Inline graphic (see Theorem 6(b)).

Remark 1

If an integral kernel K is normal in the second component for any Inline graphic and, moreover, the family of sets Inline graphic forms a partition of X, the family of fuzzy sets Inline graphic is called a fuzzy partition of X, which is a crucial concept in the definition of lower and upper fuzzy transforms [20]. In this article, we significantly relax the concept of fuzzy partition because we require only that Inline graphic for any Inline graphic. Nevertheless, the fulfillment of certain integral transforms properties usually forces to introduce specific conditions for integral kernels (see Theorems 4.4 and 4.7 in [9]).

The following theorem shows basic properties of Inline graphic–integral transforms.

Theorem 12

For any Inline graphic and Inline graphic, we have

  • (i)

    Inline graphic if Inline graphic;

  • (ii)

    Inline graphic;

  • (iii)

    Inline graphic;

  • (iv)

    Inline graphic;

  • (v)

    Inline graphic.

Moreover, if L is a complete MV-algebra, the equality in (iv) holds.

Proof

The first three statements are trivial consequences of the monotonicity of the operation Inline graphic (i.e., monotonically non-decreasing) and the Inline graphic–fuzzy integral (Theorem 6(i)). Using Theorem 6(iii) and the commutativity of Inline graphic, for any Inline graphic, we have

graphic file with name M347.gif

Moreover, if L is a complete MV-algebra, the previous inequality becomes the equality and hence, the equality in (iv) holds. Since Inline graphic, using (i) and (iv) of Theorem 6, one can simply prove (v).    Inline graphic

Let us continue with another type of Inline graphic–integral transforms, where the integral kernels are combined with the transformed functions using the residuum operation.

Definition 8

Let Inline graphic be a complementary fuzzy measure space, and let Inline graphic be a semi-normal in the second component fuzzy relation. A map Inline graphic defined by

graphic file with name M354.gif 12

is called a Inline graphic-integral transform.

Note that if K is not semi-normal in the second component, i.e., Inline graphic for some Inline graphic and any Inline graphic, we trivially obtain Inline graphic as a consequence of Inline graphic (see Theorem 6(b)). In what follows, we present some basic properties of the Inline graphic–integral transform.

Theorem 13

For any Inline graphic and Inline graphic, we have

  • (i)

    Inline graphic if Inline graphic;

  • (ii)

    Inline graphic;

  • (iii)

    Inline graphic;

  • (iv)

    Inline graphic;

  • (v)

    Inline graphic.

Proof

The first three statements are trivial consequences of the monotonicity of the operation Inline graphic (i.e., monotonically non-decreasing in the second component) and the Inline graphic–fuzzy integral (Theorem 6(i)). Since Inline graphic, then using (i) and (iii) of Theorem 6, for any Inline graphic, we obtain

graphic file with name M374.gif

Since Inline graphic, using Theorem 6(iv), one can simply prove (v).    Inline graphic

One could see that, although, the Inline graphic–integral transforms are defined by different operations, i.e., Inline graphic and Inline graphic, their basic properties coincide.

We showed in Theorem 8 that under the assumption of the linearity of complete residuated lattices, the Inline graphic–fuzzy integral is a linear operator in the sense that the Inline graphic–fuzzy integral of the supremum of comonotonic functions is the infimum of Inline graphic–fuzzy integrals of these functions. The linearity property of Inline graphic–fuzzy integral can be used to prove the analogous property for Inline graphic–integral transforms.

Theorem 14

Let L be a linearly ordered and assume that the algebra Inline graphic is closed over arbitrary unions. Let Inline graphic be Inline graphic-Inline graphic-measurable for any Inline graphic. If Inline graphic and Inline graphic are comonotonic for Inline graphic, then

graphic file with name M393.gif 13

Inline graphic–Integral Transform

Similarly to the previous subsection we propose two types of integral transforms based now on the Inline graphic–fuzzy integral. Again we start with the definition of integral transform, where integral kernels and transformed functions are merged by the multiplication operation.

Definition 9

Let Inline graphic be a fuzzy measure space, and let Inline graphic be a semi-normal in the second component fuzzy relation. A map Inline graphic defined by

graphic file with name M399.gif 14

is called a Inline graphic–integral transform.

The following theorem shows several basic properties of Inline graphic–integral transforms.

Theorem 15

For any Inline graphic and Inline graphic, we have

  • (i)

    Inline graphic if Inline graphic;

  • (ii)

    Inline graphic;

  • (iii)

    Inline graphic;

  • (iv)

    Inline graphic;

  • (v)

    Inline graphic;

Proof

Similarly to the proof of Theorem 12 one can simply prove all the statements using the properties of Inline graphic–fuzzy integral presented in Theorem 9.    Inline graphic

Definition 10

Let Inline graphic be a fuzzy measure space, and let Inline graphic be a semi-normal in the second component fuzzy relation. A map Inline graphic defined by

graphic file with name M415.gif 15

is called a Inline graphic–integral transform.

Some of basic properties of Inline graphic-integral transform are presented in the following theorem.

Theorem 16

For any Inline graphic and Inline graphic, we have

  • (i)

    Inline graphic if Inline graphic;

  • (ii)

    Inline graphic;

  • (iii)

    Inline graphic;

  • (iv)

    Inline graphic;

  • (v)

    Inline graphic.

Moreover, if L is a complete MV-algebra, the equality in (v) holds.

Again one could notice that although, the Inline graphic–integral transforms are defined by different operations, their basic properties are identical. The following linear property ensured for comonotonic functions is a straightforward consequence of Theorem 11.

Theorem 17

Let L be a linearly ordered and assume that the algebra Inline graphic is closed over arbitrary unions. Let Inline graphic be Inline graphic-Inline graphic-measurable for any Inline graphic. If Inline graphic and Inline graphic are comonotonic for Inline graphic, then

graphic file with name M435.gif 16

Conclusion

In this article, we introduced four types of integral transforms, where we used the residuum based fuzzy (qualitative) integrals, namely, the Inline graphic–fuzzy integral proposed by Dvořák and Holčapek in [4] and the Inline graphic–fuzzy integral proposed by Dubois, Prade and Rico in [3]. We presented some of the basic properties of the residuum based fuzzy integrals including a linearity property for the comonotonic functions which holds in the linearly ordered complete residuated lattices. Using these properties we provided an initial analysis of elementary properties of proposed integral transforms. The further development of the theory of integral transforms for residuated lattice-valued functions is a subject of our future research, where, among others, we want to focus on the seeking of inverse integral kernels to be able to approximate the original functions from the transformed functions. Our motivation comes from the relationship between the lower and upper fuzzy transforms and their related inverse fuzzy transforms.

Footnotes

1

Note that we use here the denotation of the integral transforms employed in this article which is slightly different from [9].

2

Here we mean that Inline graphic holds.

3

A Heyting algebra is a residuated lattice with Inline graphic.

4

In [8], a type of topological spaces derived from upsets in L was proposed.

The first author announces a support of Czech Science Foundation through the grant 18-06915S and the ERDF/ESF project AI-Met4AI No. CZ.02.1.01/0.0/0.0/17_049/0008414.

Contributor Information

Marie-Jeanne Lesot, Email: marie-jeanne.lesot@lip6.fr.

Susana Vieira, Email: susana.vieira@tecnico.ulisboa.pt.

Marek Z. Reformat, Email: marek.reformat@ualberta.ca

João Paulo Carvalho, Email: joao.carvalho@inesc-id.pt.

Anna Wilbik, Email: a.m.wilbik@tue.nl.

Bernadette Bouchon-Meunier, Email: bernadette.bouchon-meunier@lip6.fr.

Ronald R. Yager, Email: yager@panix.com

Michal Holčapek, Email: michal.holcapek@osu.cz, http://irafm.osu.cz.

Viec Bui, Email: bqviec@gmail.com.

References

  • 1.Bělohlávek R. Fuzzy Relational Systems: Foundations and Principles. New York: Kluwer Academic Publishers; 2002. [Google Scholar]
  • 2.Debnath L, Bhatta D. Integral Transforms and Their Applications. New York: CRC Press; 1914. [Google Scholar]
  • 3.Dubois D, Prade H, Rico A. Residuated variants of sugeno integrals: towards new weighting schemes for qualitative aggregation methods. Inf. Sci. 2016;329:765–781. doi: 10.1016/j.ins.2015.09.034. [DOI] [Google Scholar]
  • 4.Dvořák A, Holčapek M. Inline graphic-fuzzy quantifiers of type Inline graphic determined by fuzzy measures. Fuzzy Sets Syst. 2009;160(23):3425–3452. doi: 10.1016/j.fss.2009.05.010. [DOI] [Google Scholar]
  • 5.Galatos N, Jipsen P, Kowalski T, Ono H. Residuated Lattices: An Algebraic Glimpse at Substructural Logics, Studies in Logic and Foundations of Mathematics. Amsterdam: Elsevier; 2007. [Google Scholar]
  • 6.Grabisch M, Murofushi T, Sugeno M, editors. Fuzzy Measures and Integrals. Theory and Applications. Heidelberg: Physica Verlag; 2000. [Google Scholar]
  • 7.Grabish M. Set Functions, Games and Capacities in Decision Making. Cham: Springer; 2016. [Google Scholar]
  • 8.Holdon L. New topology in residuated lattices. Open Math. 2018;2018(16):1104–1127. doi: 10.1515/math-2018-0092. [DOI] [Google Scholar]
  • 9.Holčapek, M., Bui, V.: Integral transforms on spaces of complete residuated lattice valued functions. In: Proceedings of IEEE World Congress on Computational Intelligence (WCCI) 2020, pp. 1–8. IEEE (2020)
  • 10.Holčapek, M., Rico, A.: A note on the links between different qualitative integrals. In: Proceedings of IEEE World Congress on Computational Intelligence (WCCI) 2020, pp. 1–8. IEEE (2020)
  • 11.Klement E, Mesiar R, Pap E. Triangular Norms, Trends in Logic. Dordrecht: Kluwer Academic Publishers; 2000. [Google Scholar]
  • 12.Klement E, Mesiar R, Pap E. A universal integral as common frame for Choquet and Sugeno integral. IEEE Trans. Fuzzy Syst. 2010;18:178–187. doi: 10.1109/TFUZZ.2009.2039367. [DOI] [Google Scholar]
  • 13.Močkoř J. Spaces with fuzzy partitions and fuzzy transform. Soft Comput. 2017;21(13):3479–3492. doi: 10.1007/s00500-017-2541-7. [DOI] [Google Scholar]
  • 14.Močkoř J. Axiomatic of lattice-valued f-transform. Fuzzy Sets Syst. 2018;342:53–66. doi: 10.1016/j.fss.2017.08.008. [DOI] [Google Scholar]
  • 15.Močkoř J. F-transforms and semimodule homomorphisms. Soft Comput. 2019;23(17):7603–7619. doi: 10.1007/s00500-019-03766-1. [DOI] [Google Scholar]
  • 16.Močkoř J, Holčapek M. Fuzzy objects in spaces with fuzzy partitions. Soft Comput. 2016;21(24):7269–7284. doi: 10.1007/s00500-016-2431-4. [DOI] [Google Scholar]
  • 17.Močkoř J, Hurtík P. Lattice-valued f-transforms and similarity relations. Fuzzy Sets Syst. 2018;342:67–89. doi: 10.1016/j.fss.2018.02.009. [DOI] [Google Scholar]
  • 18.Novák V, Perfilieva I, Močkoř J. Mathematical Principles of Fuzzy Logic. Boston: Kluwer Academic Publishers; 1999. [Google Scholar]
  • 19.Perfilieva I, Tiwari SP, Singh AP, et al. Lattice-valued F-transforms as interior operators of L-fuzzy pretopological spaces. In: Medina J, et al., editors. Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations; Cham: Springer; 2018. pp. 163–174. [Google Scholar]
  • 20.Perfilieva I. Fuzzy transforms: theory and applications. Fuzzy Sets Syst. 2006;157(8):993–1023. doi: 10.1016/j.fss.2005.11.012. [DOI] [Google Scholar]
  • 21.Tenoudji F. Analog and Digital Signal Analysis: From Basics to Applications. Switzerland: Springer; 2016. [Google Scholar]
  • 22.Tiwari S, Perfilieva I, Singh A. Generalized residuate lattice based F-transform. Iran. J. Fuzzy Syst. 2015;18(2):165–182. [Google Scholar]
  • 23.Yaglom, A.M.: An Introduction to the Theory of Stationary Random Functions. Revised English edn. Translated and edited by Richard A. Silverman, vol. XIII. Prentice-Hall, Inc., Englewood Cliffs (1962)

Articles from Information Processing and Management of Uncertainty in Knowledge-Based Systems are provided here courtesy of Nature Publishing Group

RESOURCES