Relational Variants of Lattice-Valued F-Transforms

Two categories of lower and upper lattice-valued F-transforms with fuzzy relations as morphisms are introduced, as generalisations of standard categories of F-transforms with maps as morphisms. Although F-transforms are defined using special structures called spaces with fuzzy partitions, it is shown that these categories are identical to the relational variants of the two categories of semimodule homomorphisms where these fuzzy partitions do not occur. This a priori independence of the F-transform on spaces with fuzzy partitions makes it possible, for example, to use a simple matrix calculus to calculate F-transforms, or to determine the image of F-transforms in relational morphisms of the two categories.


Introduction
Fuzzy set theory was introduced by Zadeh [1] as a generalisation of the classical set theory, allowing working with vagueness as one of the basic features of real-world applications. Concurrently with its origins, the theory of fuzzy sets dealt not only with objects, i.e., with fuzzy sets, but also investigated the functional relations between these objects. This naturally led to research into the categorical aspects of fuzzy sets and, in general, to the exploration of fuzzy set categories. The importance of category theory in fuzzy set theory lies mainly in the possibility of comparing different types of constructions to each other, or finding common foundations of often different concepts. Nonetheless, the role of categorical tools is also to describe the different transformation processes related to structures of one type. The first definition of the fuzzy set category was introduced by Goguen [2,3], where the objects of this category were pairs (A, t), with A a crisp set and t ∈ L A a fuzzy set with a value domain in a complete distributive lattice L. A morphism (A, t) → (B, s) was defined as a map f : A → B, such that t(x) ≤ s( f (x)), for arbitrary x ∈ A. Another definition of the fuzzy sets category was introduced by Eytan [4], where a fuzzy relation was used as a morphism in the fuzzy set category. If L is a complete Heyting algebra, then this new category Fuz(L) is isomorphic to the original Goguen category. The fuzzy set categories were often designed to be as close as possible to the classical category of sets. This led to an effort to create such categories of fuzzy sets that would be topos [5,6]. These constructions include the so-called Higg's topos [7,8], based on the concept of the total fuzzy set, introduced by Wyler [9] and Blanc [10], where morphisms are again special fuzzy relations with values in the complete Heyting algebra. With the development of the fuzzy set theory and applications, the Heyting algebra was gradually abolished as an array of fuzzy set values and replaced by other complete lattice structures, such as the totally monoidal sets and various generalizations of these structures (see [6,[11][12][13][14][15] and others). However, it was still valid that the key role of morphisms in these new categories had the mappings between underlying sets of fuzzy sets with specific properties.
Description of transformation processes between objects of one type using the category theory language ensure morphism and functors. The significance of morphisms and functors in categories is, inter alia, that morphisms and functors actually represent a change of bases process for various fuzzy objects. From the simplest objects, such as the set of all L-valued fuzzy sets L X defined in a X set (i.e., the base is X), to complicated objects such as fuzzy topological spaces, fuzzy groups, fuzzy ordered structures etc., which are again defined above some base. If these bases (sets, for example) are understood as objects of some basic category K, then the process of creating these structures is actually the functor F from category K to the category containing these new structures, e.g., to the category Top of fuzzy topological spaces, the category Gr of fuzzy groups, etc. If f : X → Y is a morphism in this basic category K (a mapping between two sets, for example), then by applying the functor F a new morphism F( f ) : F(X) → F(Y) arises between these new objects, which in fact represents the change of base X in object F(X) to a new base Y in object F(Y).
Recently, however, a number of results have emerged in the theory of fuzzy sets, which are based on the application of fuzzy relations as morphisms in suitable categories. A typical example of this use of fuzzy relations is the category of sets as objects and L-valued fuzzy relations between sets as morphisms. This category is frequently used in approximation functors. These functors then represents various approximations of fuzzy sets, defined by fuzzy relations. This approximation was for the first time defined by Goguen [2], when he introduced the notion of the image of a fuzzy set under a fuzzy relation. Many examples using explicitly or implicitly approximation functors defined by various types of fuzzy relations can be found in rough fuzzy sets theory and many others (see, e.g., [16][17][18]).
In fuzzy set theory, there are a number of constructions that normally use different type mappings as a tool to change the base of a given construction, i.e., use different types of mappings as morphisms in appropriate categories. One of the typical and widespread construction in fuzzy set theory relates to the term lattice-valued F-transform.
A number of applications have emerged based on that completely new approximation theory. These applications include in particular signal and image processing [19][20][21], data analysis [22][23][24], signal compression [25,26], and numerical solutions of differential equations [27][28][29]. This new method of a transformation of fuzzy sets is based on reduction of basic space of given fuzzy sets and it has been introduced and elaborated by Perfilieva in papers [16,24,25,[30][31][32][33][34]. The original form of a lattice-valued fuzzy transform is a map F : L X → L Y , where X is a "large" set (the original universe of fuzzy sets), Y is a "smaller" set, and L is an appropriate complete lattice.
The basic structure for F-transform constructions is the space with a fuzzy partition (X, A), which is represented by an underlying set X of fuzzy sets and a system A = {A α : α ∈ I A } of fuzzy sets in X, which is called a fuzzy partition on X. A relationship between two spaces with s fuzzy partitions (X, A) and (Y, B) can be described as a pair of special maps from X to Y and from I A to I B . This pair of maps represents a morphism in the ground category of F-transform. Using F-transform we can find the relation between the result of the original F-transform based on the basis (X, A) and between the new F-transform when the original base changes to the basis (Y, B).
In this article, we want to look at the problem of how the value of the F-transform will change if we use different types of relations instead of mappings hitherto used as morphisms between two bases, i.e., between two spaces with fuzzy partitions. This problem is related to the general trend of using relations instead of mapping in many constructions in fuzzy set theory.
To solve this problem, we introduce the relational variant of the category of F-transforms, which uses fuzzy relations as morphisms. This new category is a generalisation of the category of F-transforms, which uses mappings as morphisms. Analogically we introduce the relational variant of the category of special semimodule homomorphisms with relations as morphisms and, as the main result, we prove that these new relational categories are isomorphic. This basically proves that although the structure of F-transforms with relations as morphisms is relatively complicated, it is essentially a relatively simple algebraic structure of special semimodules.

Preliminaries
To maintain some self-sufficiency in this article, in this section we will repeat some basic concepts from both the theory of residuated lattices and MV-algebras, and some principal examples of semirings and semimodules that we will use in the following sections.
A special example of a residuated lattice L is a MV-algebra, i.e., a structure L = (L, ⊕, ⊗, ¬, 0 L , 1 L ) satisfying the following axioms: for all x, y ∈ X. MV-algebra can be transformed into a lattice structure by defining lattice operations in the following way: x ∨ y = (x ⊕ ¬y) ⊗ y, x ∧ y = (x ⊗ ¬y) ⊕ y, x → y = ¬x ⊕ y.
An example of a MV-algebra is the Łukasiewicz algebra L Ł = ([0, 1], ⊕, ⊗, ¬, 0, 1), where If L is a complete residuated lattice, a L-fuzzy set in a crisp set X is a map f : X → L. f is a non-trivial L-fuzzy set, if f is not identical to the zero function.

Semirings and Semimodules
The notion of a semiring appears for the first time in [36] and it was introduced as a generalisation of a ring, without the requirement that each element must have an additive inverse. A notion of a semimodule was then a logical continuation of this approach in the field of modules ( [37]). To be more precise, we repeat the definition of both these structures. In the paper we consider only commutative semirings.

Definition 2 ([37]
). Let R = (R, +, ., 0 R , 1 R ) be a semiring. A R-semimodule is a commutative monoid M = (M, + M , 0 M ) for which the external multiplication R × M → M, denoted by rm, is defined and which for all r, r ∈ R and m, m ∈ M satisfies the following equations: In this paper we will use the examples of semimodules and semirings, which were published in the papers of Di Nola and Gerla [38,39]. These examples show that it is possible to introduce a semimodule structure on the set L X of L-fuzzy sets on a set X.
(2) Let X = ∅, L be a MV-algebra and let L ∧ = (L, ∧, ⊕, 1 L , 0 L ) be its semiring reduct. For all f , g ∈ M = L X define The semimodule theory is in many aspects similar to the theory of linear spaces. This means, among other things, that we can also introduce the concept of a linear morphism in this theory. Unlike classical modules, where the addition operation + is usually defined only for a finite number of elements, in the case of some semimodules, such as complete L ∨ or L ∧ -semimodules L X , this operation can be defined even for an infinite set of additions.
If a R-semimodule M = (M, + M , 0 M ) is such that for any subset N ⊆ M, there exists the sum of elements ∀{s where the indexes M and N determine where the given operation takes place.
This follows from the equality

Elements of the Category Theory
For the convenience of the reader we repeat some basic definitions and examples which could be useful to understand main results. For more details about category theory see [40].

Definition 4.
A category K consists of a class Ob(K) of objects and class Hom(a, b) of morphisms for every objects a, b ∈ Ob(K). A morphism from an object a to b is denoted by an arrow a → b. Moreover, the category has to satisfy the following conditions.

2.
The composition • is associative, i.e., if f : For every object x ∈ Ob(K) there exists a morphism 1 x : x → x, such that for arbitrary f : x → y and g : The basic example of a category is the category Set with sets as objects and mappings as morphisms, with a composition of morphisms defined as a composition of maps. Let us consider another examples of a category. Objects are all L ∨ -semimodules L X from Example 2, 2.
Morphisms are all L ∨ -homomorphisms between L ∨ -semimodules defined in Definition 4.
Analogously we can define the category Mod ∧ with L ∧ -semimodules L X as objects and with L ∧ -homomorphisms as morphisms.
We recall the definition of two categories which are important in F-transform theory and will be used in the next part of the paper. Recall that for arbitrary sets X, Y and a map f :

1.
Let L be a complete residuated lattice. The category Hom ∨ is defined by Objects are complete L ∨ -semimodule homomorphism between L ∨ -semimodules L X and L Y , for arbitrary sets X and Y, The composition of morphisms is point-wise.

2.
Let L be a complete MV-algebra. The category Hom ∧ is defined by (a) Objects are complete L ∧ -semimodule homomorphism between L ∧ -semimodules L X and L Y , for arbitrary sets X and Y, (b) A morphism from an object G : L X → L Y to the object G 1 : , such that f : X → X 1 and σ : Y → Y 1 are mappings, and holds The composition of morphisms is point-wise.
We can also introduce the relational variants of the categories Hom ∨ and Hom ∧ . We need the following notation. If R : X × Y → L is an L-fuzzy relation, then the approximation maps

1.
Let L be a complete residuated lattice. The category RHom ∨ is defined by (a) Objects are complete L ∨ -semimodule homomorphism between L ∨ -semimodules L X and L Y , for arbitrary sets X and Y, (b) A morphism from an object G : L X → L Y to the object G 1 : L X 1 → L Y 1 is a pair ( f , g) : G → G 1 , such that f : X × X 1 → L and g : Y × Y 1 → L are fuzzy relations, and in the diagram The composition of morphisms is point-wise.

2.
Let L be a complete MV-algebra. The category RHom ∧ is defined by (a) Objects are complete L ∧ -semimodule homomorphism between L ∧ -semimodules L X and L Y , for arbitrary sets X and Y, (b) A morphism from an object G : L X → L Y to the object G 1 : a pair ( f , g) : G → G 1 , such that f : X × X 1 → L and g : Y × Y 1 → L are fuzzy relations, and in the following diagram The composition of morphisms is point-wise.
Relationships between categories are mostly defined by functors.

Definition 6.
Let C and D be categories. A functor F : C → D from C to D is a mapping, such that it 1. associates to each object x in C an object F(x) in D, 2.
associates to each morphism f : x → y in C a morphism F( f ) : F(x) → F(y) in D such that the following two conditions hold: In the next example we show that the Zadeh's extension principle can be interpreted as a functor between the categories Set and Mod. Example 7. Let L be a complete residuated lattice. The functor Z : Set → Mod ∨ is defined by 1.
For arbitrary X ∈ Ob(Set), F(X) = L X ∈ Mod ∨ . Elements of F(X) are called L-fuzzy sets in X.

2.
For a morphism f :

Categories of Spaces with Fuzzy Partitions
An important role in F-transform theory have the so-called spaces with fuzzy partitions [31], which play the role of the bases for the F-transform, just as sets in the category Set play in many standard constructions. In this section we introduce two categories of spaces with fuzzy partitions, one with morphisms defined by maps and other with morphisms defined by fuzzy relations. Definition 7. Let L be a complete lattice. Let X be a set and let A = {A y : y ∈ Y} be a set of L-fuzzy sets in a set X. The index Y set of A is denoted by |A|. A pair (X, A) is called a space with a fuzzy partition.
We define two categories of spaces with fuzzy partitions, which seem to be the basic categories for F-transform constructions. We start with the category, where morphisms are defined by mappings. Definition 8. Let L be a lattice. The category SpaceFP is defined by 1.

The composition of morphisms in
Another category of spaces with fuzzy partition has the same objects as the category SpaceFP, but the morphisms are defined by fuzzy relations. For the sake of simplicity, we will assume in the rest of the paper that L is a complete residuated lattice, unless otherwise stated.

Definition 9.
The category RSpaceFP of fuzzy partitions with fuzzy relational morphisms is defined by For all x ∈ X, y ∈ Y, α ∈ |A|, β ∈ |B|, hold.

A composition of morphisms
, where • is a standard composition of L-fuzzy relations.
As it can be expected, the category RSpaceFP is a generalisation of the category SpaceFP. In fact, the following proposition holds.
If β ∈ g −1 (|A|), then the left part of Equation (1) equals to 0 L and the inequality in Equation (2) also holds. Hence, (F, G) is a morphism in RSpaceFP and J is an embedding functor. The other equality can be proven analogously.
On the other hand the category SpaceFP represents a generalisation of the category Set, as it is proven in the next proposition. If f : X → Y is a morphism in SpaceFP, then I( f ) = ( f , f ). Since Although the categories SpaceFP and RSpaceFP, which are necessary for the F-transform theory, are defined by spaces with fuzzy partitions, in fact, we do not need this term, i.e., spaces with fuzzy partitions, to define these two categories. We can prove that these categories are isomorphic to categories, where the notion of a space with a fuzzy partition does not appear.

Definition 10. Let
Rel be the category of fuzzy relation with maps as morphisms, defined by 1.
Objects (X, Y, R), where X, Y are sets and R : X × Y → L is an L-fuzzy relation.

2.
Morphisms are pair of maps ( f , σ) The composition of morphisms is defined by (g, τ) The relationship between the categories SpaceFP and Rel we firstly proved in [41].

Proposition 3 ([41]). The category SpaceFP is isomorphic to the category Rel.
Let us now consider the "relational" variant of the category Rel.
Definition 11. The category RRel of fuzzy relations with fuzzy relational morphisms is defined by 1.
Objects of RRel are the same as in the category Rel, 2. ( • is a standard composition of fuzzy relations.

A composition of morphisms
In the next proposition we prove that also the categories RSpaceFP and RRel are isomorphic.
We have |A| = Y, |B| = Z and for arbitrary x ∈ X, z ∈ Z we have Therefore, ( f , g) is a morphism in RSpaceFP and H is a functor. Conversely, let ( f , σ) : (X, A) → (Z, B) be a morphism in the category RSpaceFP, A = {A α : α ∈ |A|}. Let H −1 : RSpaceFP → RRel be a functor defined by Then, analogously to the previous case, it can be shown that H −1 is a functor and it is the inverse functor to H. Therefore, both categories are isomorphic.

Categories of F-Transforms
As we mentioned in the Introduction, fuzzy transforms (F-transforms) represent new methods, which are successfully used in various applications. We recall two basic variants of F-transform [31].

Definition 12.
Let (X, A) be a space with a fuzzy partition, A = {A y : y ∈ |A|}.

1.
A function F ↑ X,A : L X → L |A| is called the upper F-transform defined by a space with a fuzzy partition, if

2.
A function F ↓ X,A : L X → L |A| is called the lower F-transform defined by a space with a fuzzy partition, if where ⊗, → are operations from a residuated lattice L.
The basic building structures for F-transforms are spaces with fuzzy partitions. These spaces are then analogies of sets as the basic building elements of both classical and many fuzzy structures. There is therefore a natural question of how the F-transforms defined in one base space, i.e., space with a fuzzy partition, will change when that base space also changes. The change of one basic space to another then actually represents the morphism between these spaces, which are represented by the categories SpaceFP or RSpaceFP. The question is, therefore, whether this change of base spaces also corresponds to the change of F-transforms.
We begin with definitions of two variants of categories of lower and upper F-transforms. The first variant are categories with maps as morphisms and the other variant represent categories with fuzzy relations as morphisms.
Definition 13. The category FTrans ↑ of upper F-transforms is defined by 1.
Objects are upper F-transform maps F ↑ X,A : L X → L |A| , for arbitrary space with a fuzzy partition (X, A),

2.
A morphism from F ↑ X,A to F ↑ Y,B is a pair o maps ( f , σ), such that f : X → Y and σ : |A| → |B| are maps, such that

3.
Composition of morphisms is a component-wise composition of maps.

Definition 14.
The relational variant of the category of upper F-transforms is the category RFTrans ↑ , defined by 1.
Objects of RFTrans ↑ are the same as for the category FTrans ↑ , 2.
A morphism from F ↑ X,A to F ↑ Y,B is a pair (R, S) of L-fuzzy relations such that R :

3.
Composition of morphisms is a component-wise composition of L-fuzzy relations.
Analogously we can define two variants of the lower F-transform categories: Definition 15. The category FTrans ↓ of lower F-transforms is defined by 1.
Objects are lower F-transform maps F ↓ X,A : L X → L |A| , for arbitrary space with a fuzzy partition (X, A), 2.
A morphism from F ↓ X,A to F ↓ Y,B is a pair o maps ( f , σ), such that f : X → Y and σ : |A| → |B| are maps, such that

Composition of morphisms is a component-wise composition of maps.
Definition 16. The relational variant of the category of lower F-transforms is the category RFTrans ↓ , defined by 1.
Objects of RFTrans ↓ are the same as for the category FTrans ↓ , 2.
A morphism from F ↓ X,A to F ↓ Y,B is a pair (R, S) of L-fuzzy relations such that R : X × Y → L, S :

3.
Composition of morphisms is a component-wise composition of L-fuzzy relations.
In the next proposition we show that changes of bases in categories SpaceFP and RSpaceFP causes changes of corresponding F-transforms.

Proposition 5. There exist functors
Proof. Let ( f , σ) : (X, A) → (Y, B) be a morphism in SpaceFP. The functor F ↑ is defined by In fact, we need only to prove that ( f , σ) : F ↑ X,A → F ↑ Y,B is a morphism in FTrans ↑ . Let t ∈ L X and β ∈ |B| be arbitrary elements. Since ( f , σ) is a morphism in SpaceFP, we obtain , σ) is a morphism in FTrans ↑ . Hence, F ↑ is a functor. The functor F ↑ R is defined analogously, i.e., for a morphism (R, S) : (X, A) → (Y, B), we set F ↑ R (X, A) = F ↑ X,A and F ↑ R (R, S) = (R, S). It can be proven analogously as in the previous case that (R, S) is also a morphism in RFTrans ↑ , i.e., that F ↑ Y,B .R * ≥ S * .F ↑ X,A holds. The functor F ↓ is defined by Hence, we need only to prove that ( f , σ) : Hence, ( f , σ) is a morphism and F ↓ is a functor. The functor F ↓ R is defined analogously, i.e., for a morphism (R, S) : (X, A) → (Y, B) in RSpaceFP, we set F ↓ R (X, A) = F ↓ X,A and F ↓ R (R, S) = (R, S). We show that (R, S) : F ↓ X,A → F ↓ Y.B is a morphism in the category RFTrans ↓ . In fact, let s ∈ L Y , α ∈ |A|. We have Therefore, (R, S) is a morphism and F ↓ R is a functor.
As we mentioned in the introductory part, the F-transform can be equivalently defined without using the concept of spaces with fuzzy partitions. This can be achieved by showing that both variants of categories FTrans and both variants of categories RFTrans are isomorphic to categories of completely different objects. The first result of this type was proven in our paper [41].

1.
Let L be a complete residuated lattice. Then the categories SpaceFP and Hom ∨ are isomorphic.

2.
Let L be a complete MV-algebra. Then the categories SpaceFP and Hom ∧ are also isomorphic.
As the main result of the paper we prove that analogical results hold also for relational variant RFTrans ↑ and RFTrans ↓ of the categories of F-transforms. Theorem 2.

1.
Let L be a complete residuated lattice. Then the categories RFTrans ↑ and RHom ∨ are identical.

2.
Let L be a complete MV-algebra. Then the categories RFTrans ↓ and RHom ∧ are identical.
Proof. 1. We prove firstly, that both categories have the same objects. Let F ↑ X,A be an object of the category RFTran ↑ . It is well known (see, e.g., [31]) that F ↑ X,A : L X → L |A| is a L ∨ -homomorphism of semimodules, i.e., it is an object of RHom ∨ . It follows that On the other hand, let G ∈ Ob(RHom ∨ ), G : L X → L Y . We set According to [42], any t ∈ L X can be expressed in the form where χ X {x} ∈ L X is the characteristic map of a subset {x} in X. Then, for arbitrary y ∈ Y, we have Therefore, G ∈ Ob(RFTrans ↑ ) and we both categories have identical objects. Let ( f , σ) : G → G 1 be a morphism in the category RHom ∨ , G : L X → L Y . It follows that G 1 . f * ≥ σ * .G. Let F ↑ X,A = G and F ↑ X 1 ,A 1 = G 1 . From the previous construction of (X, A) and (X 1 , A 1 ) it follows that F ↑ X 1 ,A 1 . f * ≥ σ * .F ↑ X,A and it follows that ( f , σ) is also a morphism in RFTrans ↑ . Therefore, both categories are identical.
2. Let L be a complete MV-algebra. We prove that for arbitrary f ∈ L X , holds. In fact, let z ∈ X. Then we have Now, let G ∈ Ob(RHom ∧ ), G : L X → L Y . We set A = {A y : y ∈ Y}, A y (x) = ¬G(¬χ {x} )(y), for arbitrary y ∈ Y, x ∈ X. Let f ∈ L X . According to the equality in Equation (3), for each y ∈ Y we obtain Hence, G = F ↓ X,A , |A| = Y and G ∈ Ob(RFTrans ∧ ). On the other hand, it is well known that arbitrary F ↓ X,A ∈ Ob(RFTrans ↓ ) is a complete L ∧ -homomorphism of L ∧ -semimodules L X → L |A| (see e.g., [31]) and it follows that F ↓ X,A ∈ Ob(RHom ∧ ). Therefore, both categories have the same objects.
Let ( f , σ) : G → G 1 be a morphism in the category RHom ∧ , G : L X → L Y . It follows that G. f * ≥ σ * .G 1 . Let F ↓ X,A = G and F ↓ X 1 ,A 1 = G 1 . From the previous construction of (X, A) and (X 1 , A 1 ) it follows that F ↓ X,A . f * ≥ σ * .F ↓ X 1 ,A+1 and it follows that ( f , σ) is also a morphism in RFTrans ↓ . Therefore, both categories are identical.

Example 8.
For calculation both variants of F-transforms in semimodules L ∨ or L ∧ we can use a matrix operations in these spaces. Let X, Y be sets (in practical applications both are finite sets) and let F = λ x,y x∈X,y∈Y , G = β y,v y∈Y,v∈V be matrices with elements from L. We use a matrix calculation defined by Then any matrix F = λ x,y of a type |X| × |Y| can be identified with some F-transform F ↑ X,A : L → L Y , defined by A = {A y ∈ L X : y ∈ Y}, A y (x) = λ x,y .
Hence, the F-transform F ↑ X,A ( f ) of a function f ∈ L X can be identified with the matrix product f F, where f is a matrix of a type 1 × |X| representing values of a function f . Using this matrix calculation we can also easily calculate the F-transform, which will result from the modification of the original F-transform after the application of a morphism from the category RFTrans ↑ . In fact, it is clear that any morphism (R, S) from an F-transform F ↑ X,A to an F-transform defined in a set Y and index set V of a fuzzy partition can be represented by a pair of matrices (R, S), where R = r x,y x∈X,y∈Y and S = s u,v u∈U,v∈V , where U = |A|. Let F be the matrix represented F-transform F ↑ X,A . In that case, the matrix F representing the F-transform which is the result of the application of the morphism (R, S) to the F-transform represented by the matrix F can be calculated by the matrix operations F = R T F S.
Hence, F represents some F-transform F ↑ U,B in a set U, where |B| = V. If the relation R is reflexive, we can show that (R, S) is a morphisms from F ↑ X,A to that new F-transform F ↑ U,B in the category RFTrans ↑ . In fact, for arbitrary f ∈ L X , we have This result suggests that by using matrix notation with matrix multiplication using operations from L ∨ -semimodule L X , we can easily create new F-transforms using fuzzy relations, which will be homomorphic images of the original F-transforms under the RFTrans ↑ morphisms (R, S).
It is clear that analogical results we can obtain using the category RFTrans ∧ and matrix multiplication using operation from the L ∧ -semimodule.

Conclusions and Prospective Results
Theory of F-transforms has appeared in recent years as one of the basic tools for many applications, including applications in the field of signal and image processing. The whole theory of lattice-valued F-transforms is crucially based on a new type of basic space, called space with a fuzzy partitions, which represents a generalisation of the standard sets on which the fuzzy set theory is based. In order to explore different relationships between individual spaces with fuzzy partitions, or relationships between F-transforms, in addition to these objects, different types of morphisms between these objects are also introduced. The result are various categories of spaces with fuzzy partition and F-transforms.
Recently, the use of fuzzy relations as a basis for morphisms between different fuzzy structures has been increasing significantly. The consequence of these processes is that instead of categories where morphisms are classical mappings, categories are introduced where morphisms between objects are different types of fuzzy relations. This is how we modified the F-transform categories in this article. Two variants of the F-transform categories (upper and lower F-transforms) were introduced, where morphisms between F-transforms are defined as special fuzzy relations. Although F-transforms are defined using spaces with fuzzy partitions, it is shown that these relational versions of F-transform categories are identical to the relational variants of the two categories of semimodule homomorphisms where these fuzzy partitions do not occur. This makes it possible, for example, to simplify some operations relating to F-transforms, as exemplified in Example 9, such as the actual calculation of F-transforms, or to determine the F-transform image in case of applying relational morphism to this F-transform.
It should be noted that this paper represents only the first step in the use of fuzzy relations in F-transform theory. The next natural step should be to define F-transform not for fuzzy sets, but as a mapping transforming fuzzy relations instead of fuzzy sets, i.e., as mapping F : L X×X → L |B| , where B should be a partition in Y × Y. The reason is quite natural, many large data information is obtained as a fuzzy relation and not as a classical function. Then, for example, reducing these data structures would be a typical example of using F-transforms, where fuzzy relations are used instead of fuzzy sets. In this direction we prepared some results and we suppose that in a final version of the next paper, we combine both new approaches, i.e., fuzzy relations as morphisms between F-transforms and F-transform defined for fuzzy relation instead for fuzzy sets only.