# Indexed identity and fuzzy set theory

## 1 Introduction

Fuzzy set theory appeared for the first time in 1965, in a famous paper by L. A. Zadeh . Since then a lot of fuzzy mathematics has been created and developed. Nevertheless, concepts like fuzzy set, fuzzy subset, and fuzzy equality (between two fuzzy sets) usually depend on the concept of grade of membership. This procedure does not allow us to define fuzzy equality between, e.g., two Urelemente, or even between two potatoes, up to the case that we consider a potato as a set.

We present a concept of identity index which allows us to say how similar are two objects, even in the case that these two objects are not sets or fuzzy sets. Such a procedure allows us to define a sort of fuzzy membership (or grade of membership), fuzzy sets, fuzzy inclusion and fuzzy operations among fuzzy sets like union and intersection.

This paper is the first one of a series dedicated to the concept of indexed identity and its applications.

## 2 Indexed Identity

We use standard logical notation: $`\neg `$ is negation, $``$ is conjunction, $``$ is disjunction, $``$ is conditional, and $``$ is biconditional. ‘$``$’ and ‘$``$’ denote the existence and universal quantifiers, respectively. Next, we define an indexed variables system by means of a set-theoretical predicate, following Suppes ideas about axiomatization . By set theory we mean Zermelo-Fraenkel set theory (with or without Urelemente). But it is obvious that our system may be defined into the scope of other set theories.

###### Definition 1

An indexed variables system is an ordered pair $`X,\mathrm{\Xi }`$ that satisfies the following seven axioms:

$`X`$ is a non-empty set.

$`\mathrm{\Xi }=\{_r\}_{rR}`$ is a family of binary predicates defined on the elements of $`X`$, where $`R`$ is a subset of the interval of real numbers $`[0,1]`$, such that $`1R`$. When the ordered pair $`(x,y)X\times X`$ satisfies the binary predicate $`_r`$, we denote it by $`x_ry`$.

If $`x_ry`$ then $`y_rx`$.

$`x_1y`$ iff $`x=y`$.

If $`x_ry`$ and $`rs`$ then $`\neg (x_sy)`$.

$`xyr(x_ry)`$.

###### Definition 2

The distinction between two elements of $`X`$ is given by $`D(x,y)=1r`$ iff $`x_ry`$.

$`D(x,y)+D(y,z)D(x,z)`$

For the sake of simplicity we can call $`X`$ as an indexed variables system or an indexed system. We call the binary relation $`_r`$ indexed identity with index $`r`$ or simply an indexed identity.

Here follows an intuitive interpretation of the axioms and primitive concepts. $`X`$ is our space of variables. The sentence $`x_ry`$ corresponds to say that $`x`$ and $`y`$ do have an identity index $`r`$, where $`0r1`$. If $`r`$ is 1 (one) then $`x`$ and $`y`$ are identical objects. If $`r`$ is not 1 then $`x`$ and $`y`$ are different objects. Nevertheless, if $`r`$ is a number ‘close’ to 1, then $`x`$ and $`y`$ are very ‘similar’ objects, i.e., ‘almost identical’ objects. On the other hand, if $`r`$ is close to 0 (zero) then $`x`$ and $`y`$ are very different objects. They have ‘almost zero-identity’. This is reflected in the last axiom. According to F7 if $`x`$ and $`y`$ are very similar (index $`r`$ equal to 0.9, for example) and $`y`$ and $`z`$ are also very similar (index $`r`$ equal to 0.9, as another example), then $`D(x,y)=D(y,z)=0.1`$. So, the distinction between $`x`$ and $`z`$ should be less or equal to 0.2, i.e., they should have an identity index greater or equal to 0.8. In the particular case where $`D(x,y)=D(y,z)=0`$, then $`D(x,z)=0`$, i.e., if $`x=y`$ and $`y=z`$ then $`x=z`$. Hence, axiom F7 is a generalization of the transitivity property of usual equality. The condition, in axiom F2 that $`1R`$ ensures consistency, since $`x_1yx=y`$.

It is very important to emphasize that our mathematical framework is based on usual set theory, like Zermelo-Fraenkel’s, for example.

###### Theorem 1

$`D(x,y)`$ is a distance between two points, and $`X,\mathrm{\Xi }`$ induces a metric space $`X,D`$.

Proof: According to F4 and definition (2), we have $`D(x,x)=0`$. According to F4 $`D(x,y)>0`$ if $`xy`$. According to F3 $`D(x,y)=D(y,x)`$. According to F7 $`D(x,z)D(x,y)+D(y,z)`$. So, $`D(x,y)`$ is the distance between $`x`$ and $`y`$; and $`X,D`$ is a metric space.$`\mathrm{}`$   

Note that $`D`$ is a metric such that $`D(x,y)[0,1]`$.

###### Theorem 2

Any metric space $`M,d`$ induces an indexed variables system $`M,\mathrm{\Xi }`$

Proof: If $`M,d`$ is a metric space, then $`d:M\times M\mathrm{}^+`$ is a metric, where $`\mathrm{}^+`$ is the set of nonnegative real numbers. If we define a function $`f:\mathrm{}^+[0,1]`$ such that $`f(x)=\frac{x}{1+x}`$, then it is easy to prove that the function $`D:M\times M[0,1]`$ given by $`D(a,b)=f(d(a,b))`$ is a metric whose images belong to the set $`[0,1)`$. That is, we can define $`D(a,b)`$ as a distinction between $`a`$ and $`b`$ in the sense that $`a_rb`$ iff $`D(a,b)=1r`$, where $`r(0,1]`$. The reader can easily verify that $`M,\mathrm{\Xi }`$ is an indexed variables system, where $`\mathrm{\Xi }=\{_r\}_r`$. $`\mathrm{}`$

## 3 How to Calculate the Identity Index?

One natural question is: how to calculate the index $`r`$? In other words, what are our criteria to say how similar $`x`$ and $`y`$ are? One possible answer is the use of a family $`\{A_i\}`$ of unary predicates defined over the elements of $`X`$. For practical purposes we could consider a finite family $`\{A_i\}_{iF}`$, where $`F`$ is a finite set with cardinality, say, 100. If $`x`$ and $`y`$ are objects that share 93 predicates of the family $`\{A_i\}_{iF}`$, then they have 93% of similarity, i.e., $`x_{0.93}y`$. If $`x`$ and $`y`$ have nothing in common, then they are totally different objects, i.e., $`x_{0.00}y`$. On the other hand, if $`x`$ and $`y`$ share all the predicates of the family $`\{A_i\}_{iF}`$, then $`x`$ and $`y`$ are identical objects, that is, they are the very same object with two different names or labels. Of course, this procedure just works if we make an adequate choice of possible predicates that objects of a given universe $`X`$ may (or not) satisfy. Such an adequate choice of predicates depends on the problem that we want to solve.

It is important to say what do we mean by ‘two objects that share 93 predicates’. We say that $`x`$ and $`y`$ share one given predicate $`A_i`$ iff we have $`A_i(x)A_i(y)`$ or $`\neg A_i(x)\neg A_i(y)`$. We say that $`x`$ and $`y`$ do not share the predicate $`A_i`$ iff we have $`A_i(x)\neg A_i(y)`$ or $`\neg A_i(x)A_i(y)`$. We say that $`x`$ and $`y`$ share $`n`$ predicates iff there are $`n`$ different predicates $`A_i`$ that $`x`$ and $`y`$ share.

As a simple example consider the set $`X=\{2,3,8\}`$, and the following family of predicates $`\{A_1,A_2,A_3\}`$, where $`A_1(x)`$ means that $`x`$ is an even number, $`A_2(x)`$ says that $`x`$ is an odd number and $`A_3(x)`$ corresponds to say that $`x`$ is a prime number. In this case we can calculate the index $`r`$ of indistinguishability between two elements $`x`$ and $`y`$ of $`X`$ as it follows:

$$r=\frac{\text{number of predicates }A_i\text{ that }x\text{ and }y\text{ share}}{\text{total number of predicates}}$$
(1)   
So, we have $`2_{1/3}3`$, $`3_08`$, $`2_{2/3}8`$, $`2_12`$, $`3_13`$, and $`8_18`$, since $`A_1(2)\neg A_2(2)A_3(2)\neg A_1(3)A_2(3)A_3(3)A_1(8)\neg A_2(8)\neg A_3(8)`$. Thus $`D(2,3)=\frac{2}{3}`$, $`D(3,8)=1`$, and $`D(2,8)=\frac{1}{3}`$. It is easy to verify that $`X`$ is an indexed variables system.

So, in this context, the number 2 is more similar to number 8, than to number 3. In this same context, numbers 3 and 8 have nothing in common, since their index of indistinguishability $`r`$ is zero. This example is recalled in the next Sections, in order to illustrate some definitions and theorems.

As a final remark, note that definition (1) does not give any hint on how to calculate the index $`r`$. Actually, the calculation of $`r`$ depends on the particular problem that we want to solve by using the concept of indexed identity. Any generalization of equation (1) does not necessarily encompass all possible methods for calculating $`r`$.

## 4 ‘Fuzzy’ Set Theory with Indexed Identity

In this Section we present an i-fuzzy set theory (‘i’ stands for indexed) based on the concept of indexed identity. We also show that this is a special case of Zadeh’s original fuzzy set theory.

###### Definition 3

If $`X`$ is an indexed variables system then an i-fuzzy set is a function $`F:XR`$, such that $`x,rF`$ iff $`yX(y_rx)`$.

According to current literature , a fuzzy subset of a given $`X`$ is a function from $`X`$ into $`[0,1]`$. So:

###### Theorem 3

Every i-fuzzy set is a fuzzy set.

Proof: Straightforward from definitions of fuzzy set and i-fuzzy set.$`\mathrm{}`$   

This last theorem allows us to establish a relationship between fuzzy set theory (a la Zadeh) and our indexed variables system.

###### Definition 4

The set of all i-fuzzy sets $`F:XR`$ is denoted by $`(X;R)`$.

###### Definition 5

Let $`X`$ be an indexed variables system. If $`F`$ is an i-fuzzy set and $`x`$ is an element of $`X`$, then $`x_rF`$ iff $`x,rF`$. In other words, $`x_rF`$ iff $`F(x)=r`$.

###### Definition 6

If $`F`$ and $`G`$ are i-fuzzy sets, the union $`FG`$ is a function $`FG:XR`$ defined as it follows: $`x,rFG`$ iff $`r=\mathrm{max}\{F(x),G(x)\}`$.

###### Definition 7

If $`F`$ and $`G`$ are i-fuzzy sets, the intersection $`FG`$ is a function $`FG:XR`$ defined as it follows: $`x,rFG`$ iff $`r=\mathrm{min}\{F(x),G(x)\}`$.

###### Theorem 4

The union of two i-fuzzy sets is an i-fuzzy set.

Proof: According to definition (6), if $`x,rFG`$ then $`r=F(x)`$ or $`r=G(x)`$. Since $`F`$ is an i-fuzzy set, then there exists $`yX`$ ($`X`$ is a given indexed variables system) such that $`y_{F(x)}x`$. Analogously, there is $`zX`$ where $`z_{G(x)}x`$. So, there is $`w`$ (which is $`y`$ or $`z`$) such that $`w_{\mathrm{max}\{F(x),G(x)\}}x`$. Hence, $`FG`$ is an i-fuzzy set.$`\mathrm{}`$

###### Theorem 5

The intersection of two i-fuzzy sets is an i-fuzzy set.

Proof: Analogous to the previous proof.$`\mathrm{}`$

###### Definition 8

Let $`X`$ be an indexed variables system. If $`F`$ and $`G`$ are i-fuzzy sets then the distinction between $`F`$ and $`G`$ is given by

$$D(F,G)=\underset{xX}{sup}|F(x)G(x)|,$$

where $`sup`$ stands for the supremum.

###### Definition 9

If $`F`$ and $`G`$ are i-fuzzy sets then $`F_rG`$ iff $`D(F,G)=1r`$. The set of predicates $`_r`$ defined on elements of $`(X;R)`$ is denoted by $`\mathrm{\Xi }`$.

###### Theorem 6

$`(X;R),\mathrm{\Xi }`$ is an indexed variables system.

Proof: We have to prove that $`(X;R),\mathrm{\Xi }`$ satisfies axioms F1F7. So, we split this proof into seven parts. Hence, if $`F`$, $`G`$, and $`H`$ are i-fuzzy sets:

1. Since $`X`$ is nonempty, then $`(X;R)`$ is nonempty. This verifies axiom F1.
2. According to definition (3), $`0F(x)1`$ and $`0G(x)1`$, for all $`xX`$. So, $`0sup_{xX}|G(x)F(x)|1`$, i.e., $`0D(F,G)1`$. Since $`D(F,G)=1r`$, where $`F_rG`$ (definition (9)), then $`\mathrm{\Xi }=\{_r\}_{rR}`$ is a family of binary predicates defined on the elements of $`(X;R)`$, where $`R`$ is a subset of the interval of real numbers $`[0,1]`$, such that $`1R`$. As a matter of fact, the proof that $`1R`$ is given in step 4 of this proof. This verifies axiom F2.
3. $`sup_{xX}|F(x)G(x)|=sup_{xX}|G(x)F(x)|`$, i.e., $`D(F,G)=D(G,F)`$. So, according to definition (9), $`F_rG`$ iff $`G_rF`$. This verifies axiom F3.
4. $`F_1G`$ iff $`F=G`$, according to definitions (8) and (9). This verifies axiom F4.
5. If $`F_rG`$ then $`D(F,G)=1r`$. According to definition (8) there is no $`s`$ such that $`sr`$ and $`D(F,G)=1s`$. So, there is no $`s`$ such that $`sr`$ and $`F_sG`$. This verifies axiom F5.
6. Since $`F`$ and $`G`$ are limited functions, there is always a supremum $`sup_{xX}|G(x)F(x)|`$. So, $`xyr(F_rG)`$. This verifies axiom F6.
7. Since $`(X;R)`$ is a space of limited functions, then $`(X;R),D`$ is a metric space, where $`D`$ is given as in definition (8). This occurs because the distinction between two fuzzy sets is the well known metric of uniform convergence or sup metric. Then the triangle inequality is satisfied. This verifies axiom F7.$`\mathrm{}`$

###### Corollary 1

$`D(F,G)`$ is a distance between two i-fuzzy sets, and $`(X;R),\mathrm{\Xi }`$ induces a metric space $`(X;R),D`$.

Recalling the example given in Section III, we can define, e.g., the following i-fuzzy sets: $`F=\{8,1,2,2/3,3,0\}`$, $`G=\{3,1,2,1/3,8,0\}`$, and $`H=\{2,1,8,2/3,3,1/3\}`$. So, $`FG=\{8,1,3,1,2,2/3\}`$, $`FG=\{3,0,8,0,2,1/3\}`$, and $`D(H,FG)=2/3`$.

## 5 Indexing Predicates

In this Section we give a general procedure which allows us to index any predicate, at least in principle.

Since our mathematical framework is set theory, consider a set $`S`$ defined by means of the Separation Schema of Zermelo-Fraenkel set theory:

$$S=\{xX;P(x)\}$$

where $`X`$ is a given set and $`P`$ is a given predicate. So, if $`X`$ is ‘the set of human beings’ and $`P`$ is the predicate ‘to be smart’, then $`S`$ corresponds to the set of smart people.

The question now is: how to index predicate $`P`$? In other words: how to index the set $`S`$? The procedure that we suggest follows in the next paragraphs.

###### Definition 10

Let $`S`$ and $`X`$ be the sets given above. If $`x`$ is an element of $`X`$, the distinction between $`x`$ and $`S`$ is

$$D(x,S)=\underset{yS}{inf}D(x,y)$$

Note that this last definition allows us to index the predicate $`P`$, i.e., the set $`S`$.

By indexing $`P`$ we mean the definition of $`D(x,S)`$.

###### Definition 11

$`x_rS`$ iff $`D(x,S)=1r`$.

###### Example 1

If $`X`$ is ‘the set of human beings’ and $`P`$ is the predicate ‘to be smart’, then $`S`$ corresponds to the set of smart people. If we define a distinction function $`D(x,S)`$ where $`xX`$, then we are indexing the concept of ‘being smart’. If $`D(Einstein,S)=0.5`$, then $`Einstein_{0.5}S`$, i.e., $`Einstein`$ is a half-smart person. The index $`r`$ corresponds to a degree of smartness.

###### Example 2

If $`X`$ is the set of subsets of a given set $`T`$ and $`P`$ is the predicate ‘to be open’ (in the usual topological sense), then $`S`$ corresponds to the topology of a topological space. If we define a distinction function $`D(x,S)`$ where $`xX`$, then we are indexing the concept of ‘being open’. If $`D(a,S)=0.7`$, then $`a_{0.3}S`$, i.e., $`a`$ has a 0.3 degree of openess.

These two examples can help us to see how powerful is this method of indexation. In the the second example we showed how to index the concept of ‘open set’ in a topological space. But we can discuss about how to index the very concept of topological space.

If we want to index the predicate ‘to be a topological space’ rather than topological concepts like ‘to be open’ or ‘to be compact’, then we need: (1) a universe class $`X`$ which corresponds to the collection of ordered pairs $`T,𝒯`$ of sets; and (2) a predicate $`P`$ such that $`P(\mathrm{})`$ iff $`T𝒯`$ such that (i) $`\mathrm{}=T,𝒯`$, (ii) $`T`$ is a non-empty set, (iii) the elements of $`𝒯`$ are subsets of $`T`$, (iv) $`\mathrm{}𝒯`$, (v) $`T𝒯`$, (vi) if $`t_1`$ and $`t_2`$ are elements of $`𝒯`$ then $`t_1t_2𝒯`$, and (vii) an arbitrary union of elements of $`𝒯`$ is still an element of $`𝒯`$. Besides, we need a distinction function (which is a metric) $`D:X\times X[0,1]`$. Since in Zermelo-Fraenkel set theory there is no such a thing like the set of all ordered pairs of sets, then we cannot found our mathematical framework into usual set theory. We could consider $`X`$ as a category. In this case we should extend definition (1) to a category-theoretical predicate, which is a task for future works.

Something analogous could be said about groups, vector spaces, lattices, fields, and other mathematical theories usually founded into the scope of set theory.

## 6 Conclusions

The main advantages of our mathematical framework are:

1. It is a kind of fuzzy mathematics (in the intuitive sense), which fuzzifies the concept of equality rather than that one of membership (as in the original work of Zadeh). So, it offers another point of view in the process of fuzzification.
2. It allows us to use the theory of metric spaces, at least in principle, in order to derive theorems in fuzzy set theory.
3. It allows us a generalized method of ‘fuzzification’ of predicates, in the sense given in the previous Section.

## 7 Acknowledgements

We akcnowledge with thanks Aurélio Sartorelli and Soraya R. T. Kudri for helpful suggestions and criticisms.