Fuzzy Analogues of Sets and Functions Can Be Uniquely Determined from the Corresponding Ordered Category: A Theorem

In modern mathematics, many concepts and ideas are described in terms of category theory. From this viewpoint, it is desirable to analyze what can be determined if, instead of the basic category of sets, we consider a similar category of fuzzy sets. In this paper, we describe a natural fuzzy analog of the category of sets and functions, and we show that, in this category, fuzzy relations (a natural fuzzy analogue of functions) can be determined in category terms—of course, modulo 1-1 mapping of the corresponding universe of discourse and 1-1 re-scaling of fuzzy degrees.


Introduction
Category theory is one of the main tools of modern mathematics.Many mathematical theories can be naturally described in terms of a directed graph, where vertices are objects studied in this theory (e.g., sets is set theory, topological spaces in topology, linear spaces in linear algebra), and edges relate different objects: e.g., functions map one set into another, continuous mappings map one topological space into another one, linear mapping map one linear space into another ones, etc.The corresponding graph is known as a category; see, e.g., [1].
In precise terms, a category is a tuple (Ob, Mor, :, id, •), where: • Ob is the set whose elements are called objects, • Mor is a set whose elements are called morphisms, • : Mor → Ob × Ob is a mapping that assigns, to each morphism f ∈ Mor a pair of objects (a, b) ∈ Ob × Ob; this is denoted by f : a → b; the object a is called f 's domain, and b is called f 's range; • id is a mapping that assigns, to each object a ∈ Ob, a morphism id a : a → a; and • • is a mapping that assigns, to each pair of morphisms f : a → b and g : b → c for which the range of f is equal to the domain of g, a new morphism g • f : a → c so that for every f : a → b, Because of its universal character, category theory plays an important role in modern mathematics [1].Many new mathematical concepts are defined in category terms, and many original concepts are re-formulated in category terms -such a reformulation in very general terms often enables mathematicians to generalize their ideas and results to a more general context.
As we have mentioned, different areas of mathematics can be described in terms of different categories: • Set theory is naturally described in terms of a category Set in which objects are sets and morphisms are functions.
• Topology is described in terms of a category Top in which objects are topological spaces and morphisms are continuous mappings.
• Linear algebra is naturally described in terms of a category Lin, in which objects are linear spaces, and morphisms are linear mappings, etc.
What happens in the fuzzy case?If we allow fuzzy sets (see, e.g., see, e.g., [2,7,16,17,19]), what is a natural analog of the category Set?In the category Set, morphisms from a to b are functions.In the crisp case, for each function f : a → b and for each element x ∈ a, we have a unique value of Fuzzy means that for each x ∈ a, instead of a single value y = f (x) ∈ b, we may have different possible values y ∈ b, with different degrees of confidence.In general, we can have all possible values y ∈ b.For each x ∈ a and for each y ∈ b, we have a degree R f (x, y) ∈ [0, 1] to which y is a possible value of f (x).Thus, a natural fuzzy analog of a function is a fuzzy relation.
Composition g • f of fuzzy relations f : a → b and g : b → c can be defined in the usual way.Namely, we want to know, for each pair of elements x ∈ a and c ∈ z, to what extent there exists a y ∈ b for which f brings us from a to b and g brings us from y to z.If we interpret "and" as min and there exists (an infinite "or") as max, then the above description translates into the following formula: Since we have fuzzy relations, there is no need to explicitly describe the domain of each morphism: if for some x ∈ a, the value f (x) is not defined, this simply means that for this x, we have R f (x, y) = 0 for all y ∈ b.Similarly, there is no need to describe the range, Thus, without losing generality, we can assume that we have only one object -the universal set U, and that the relation R f (x, y) is defined for all x ∈ U and y ∈ U. Morphisms are then fuzzy relations, with the usual composition relation (1).
Need for an ordered category.In the crisp case, every property is either true or false.
As we gain more information, we may get more confident in our knowledge.For example, we may start with the situation in which, for a given x, several different values f (x) are possible, but after acquiring new information, we are becoming more and more confident that there is only one possible value y 0 of f (x).This means that for the remaining value y 0 , the degree of possibility R f (x, y 0 ) remains the same, but for all y = y 0 , the corresponding degree R f (x, y) decreases.To capture this phenomenon, it is reasonable to supplement the category structure with the corresponding component-wise ordering between fuzzy relations (morphisms What we do in this paper.In this paper, as an answer to the above questions, we present an axiomatic description of fuzzy sets in the language of categories, with a proof of the soundness of this description.

Results
Towards a precise formulation of the problem.It is easy to see that if we have a 1-1 mapping π : U → U of the Universe of discourse U onto itself (i.e., a bijection), then the corresponding transformation R(x, y) → R(π(x), π(y)) is an automorphism of the corresponding category in the sense that it preserves the identity, composition, and order.
Similarly, if we have a 1-1 monotonically increasing mapping ) is also such an automorphism.Indeed, since we only consider order between degrees, monotonic transformation of degrees should not change anything.
It turns out that modulo this simple equivalence, we can uniquely determine all the elements x ∈ U and all the relations R(x, y) from the ordered category, i.e., in precise terms, that every automorphism is a composition of the automorphisms of the above two types.The proof of this result will be based on an explicit description of elements of U and relations R f (x, y) in category terms.
Let us describe the problem in precise terms.
Definition 1.By an ordered category, we mean a category in which for every two objects a and b, there is a partial order ≤ on the set Mor(a, b) of all morphisms from a to b.
Definition 2. Let U be a set; we will call it the Universe of discourse.By a U-fuzzy ordered category, we mean an ordered category in which: • the only object is the set U, • morphisms are fuzzy relations, i.e., mappings R : • the morphism id is defined as the mapping for which id(x, x) = 1 and id(x, y) = 0 for x = y, • the composition of morphisms is defined by the formula

and
• the order between the morphisms is the component-wise order: f ≤ g means that f (x, y) ≤ g(x, y) for all x and y.
The U-fuzzy ordered category will be denoted by F U .
Comment.One can easily see that this is indeed a category, i.e., that the composition of morphisms is associative, and the composition of any morphism f with the identity morphism id is equal to f : • for all f and g, we have G( f • for all a, we have G(id a ) = id F(a) , and • for all f and g, we have f ≤ g if and only if G( f ) ≤ G(g).
Comment.This definition is a natural generalization of the standard definition of automorphism of categories (see, e.g., [6,15,18]) to ordered categories.
Proposition.Let π : U → U be a bijection of U, and let H : ) is an automorphism of the category F U .
Our main result is that these are the only automorphisms of the category F U .
Theorem.For every set U, every automorphism of the ordered category F U has the form G π,H for some bijection π : U → U and for some monotonic bijection Comment.This may not be very clear from the formulation of the result, but the proof will show that we can determine elements of the set U and values of the mappings f (x, y) in category terms, i.e., we can indeed define fuzzy relations -a natural fuzzy analogue of functions -in category terms.

Proof of the Proposition
This proposition is easy to prove: a permutation π does not change anything, and the increasing bijection does not change the order.

Proof of the Theorem
1 • .First, we can describe the morphism f 0 for which f 0 (x, y) = 0 for all x and y in ordered-category terms, as the only morphism f for which f ≤ g for all morphisms g.Indeed, clearly f 0 ≤ g for all g.Vice versa, if f ≤ g for all g, then, in particular, f ≤ f 0 , i.e., f (x, y) ≤ f 0 (x, y) = 0 for all x and y, and since f (x, y) ∈ [0, 1], this means that indeed f (x, y) = 0 for all x and y.
2 • .Let us first characterize all the morphisms f = f 0 for which the set {g : g ≤ f } is linearly ordered.
Since an automorphism preserves order, every automorphism maps such morphisms into morphisms with the same property.
Specifically, we will prove that a morphism has this property if and only if we have f (x, y) > 0 only for one pair (x, y), and we have f (x , y ) = 0 for all other pairs (x , y ).
Indeed, one can easily check that for such morphisms f , the only morphisms g ≤ f are the morphisms which also have g(x , y ) = 0 for all pairs (x , y ) = (x, y).Such morphisms g are uniquely described by the corresponding value g(x, y).For every two such morphisms g and g , depending on whether g(x, y) ≤ g (x, y) or g (x, y) ≤ g(x, y), we have g ≤ g or g ≤ g, i.e., the set {g : g ≤ f } is indeed linearly ordered.
Vice versa, let us prove that if a morphism has this property, then it has f (x, y) > 0 only for one pairs (x, y).Indeed, if we have f (x, y) > 0 and f (x , y ) > 0 for two different pairs (x, y) = (x , y ), then we would be able to construct two different morphisms g ≤ f and g ≤ f for which g ≤ g and g ≤ g.Namely, we take: • g(x, y) = f (x, y) > 0 and g(x , y ) = 0 for all pairs (x , y ) = (x, y), and • g (x, y) = f (x , y ) > 0 and g(x , y ) = 0 for all pairs (x , y ) = (x , y ).
This contradicts our assumption that the set {g : g ≤ f } is linearly ordered.
3 • .Let us now describe, in ordered-category terms, morphisms f for which f (x, x) > 0 for some a ∈ U and f (x , y ) for all other pairs (x , y ) = (x, x).
Indeed, out of all morphisms described in Part 2 of this proof, such morphisms can be determined by the additional condition that f • f = f .This condition is clearly satisfied for such morphisms, while for morphisms for which f (x, y) > 0 for some b = a, the composition f • f is, as one can see, identically 0 and thus, different from f .
Hence, if we have an automorphism, elements are mapped into elements in a 1-1 way, i.e., indeed we have a bijection of the Universe of discourse.

5
• .Let us now show that the degrees from the interval [0, 1] can also be described -modulo increasing bijections of this interval -in ordered-category terms.
5.1 • .Indeed, for each element a ∈ U, different degrees v ∈ [0, 1] can be associated with different morphisms f described in Part 3 of this proof, i.e., morphisms for which: • f (x, x) > 0 for this element a and • f (x , y ) for all pairs (x , y ) = (x, x).

Different degrees are then simply associated with different values
This construction provides us with degrees at each element a ∈ U. To get a general description of degrees, we need to relate the values corresponding to different elements x, x ∈ U.
5.2 • .Let us denote, by f x,v , the morphism for which: We want, for every a = b, to connect the values v and w corresponding to functions f x,v and f y,w .This connection comes from the following auxiliary result: Indeed, by definition of a composition, the values of the composition g • f cannot exceed the largest value of each of the composed relations g and f .Thus, if Vice versa, if w ≤ v, then we can take the following morphisms f x→y and f y→x : • f x→y (x, y) = w and f x→y (x , y ) = 0 for all other pairs (x , y ) = (x, y), and, similarly, • f y→x (y, x) = w and f y→x (x , y ) = 0 for all other pairs (x , y ) = (y, x).
In this case, as one can easily check, we have 5.3 • .Now that we know how to describe the relation w ≤ v for functions f x,v and f y,w in ordered-category form, we can describe equality v = w between the degrees v and w corresponding to morphisms f x,v and f y,w as (v ≤ w) & (w ≤ v), i.e., in view of Part 5.2, as: This enables us to identify degrees v ∈ [0, 1] in ordered-category terms -by identifying them with the functions f x,v and taking into account the above possibility to compare degrees at different elements a.
Hence, if we have an automorphism, degrees are mapped into degrees in a 1-1 and order-preserving way, i.e., indeed we have a monotonic bijection 6 • .To complete the proof, we need to show how, for each morphism f and for every two elements a and b, we can describe the value f (x, y) in ordered-category terms.This will complete the proof that the given automorphism has the form G π,H for the mappings π and H as identified in Sections 4 and 5 of this proof.
6.1 • .Let us first prove the following auxiliary result: Indeed, by definition of a composition, the composition c def = f • f x,1 has the following form: • c(x, y ) = f (x, y ) for all y and • c(x , y ) = 0 for all y and for all x = a.
As we have argued in Part 5 of this proof, the value of a composition function cannot exceed the maximum value of each of the composed morphisms.Thus, for the composition f y→x • c , the maximum value cannot exceed the maximum value f (x, y) of the morphism c .Thus, if Vice versa, for every v ≤ f (x, y), we can construct a morphism f y→x for which namely, we can take: • f y→x (y, x) = v, and • f y→x (x , y ) = 0 for all pairs (x , y ) = (y, x).
One can easily check that in this case indeed 6.2 • .For each morphism f and for every two elements a and b, we can identify the degree f (x, y) as the largest degree v for which the inequality v ≤ f (x, y) holds.
Since, according to Part 6.1 of this proof, the inequality v ≤ f (x, y) can be described in ordered-category terms, we can thus conclude that the degree f (x, y) can also be described in ordered-category terms.
The proposition is proven.

Conclusions
Many concepts of modern mathematics, starting from the basic notions of sets and functions, are described in terms of category theory.many other mathematical concepts can be reformulated in category terms.Due to the general nature of category theory, such a reformulation often helps to extend notions and results from one area to different areas of mathematics.
Because of this potential advantage, it is reasonable to ask whether similar fuzzy notions can also be described in category terms.In this paper, we show that fuzzy relations -i.e., fuzzy analogues of functions -can indeed be described in category terms.Specifically, we show that, in the corresponding fuzzy category, we can describe both: • elements of the original universe of discourse (modulo a 1-1 permutation), and • fuzzy degrees (modulo a 1-1 monotonic mapping from the interval [0, 1] onto itself).
This result shows the soundness of our axiomatic description of fuzzy sets in the language of categories.
At this moment, what we have is a very theoretical paper.However, we hope that, similarly to how the reformulation of crisp notions in category terms can help generalize the corresponding results, our reformulation will help extend fuzzy results to more general situations -and thus, will facilitate future applications.
y) for all x and y.Formulation of the problem.What can be defined based on this category-theory formulation?Can we uniquely determine the elements of the Universe of discourse U and the corresponding relations based on the categorical information?

Definition 3 .
An automorphism of an ordered category is a pair consisting of bijections F : Ob → Ob and G : Mor → Mor for which: • for all f , a, and b, we have f : a → b if and only if G( f ) : F(a) → F(b);

4 •
. One can see that two morphisms f and f of the type described in Part 3 are connected by the relation ≤ (i.e., f ≤ f or f ≤ f ) if and only if they correspond to the same element a ∈ U.Thus, we can describe elements of the set U in ordered-category terms: as equivalent classes of morphisms of the type described in Part 3 with respect to the relation