3.1. Quotient Structures of a Fuzzified Matrix Space
Let
be an
L-valued matrix space over a partial matrix groupoid
. Let
. For such an
L-valued matrix space and
, we define an algebraic structure
consisting of the set
and the partial binary operation
derived from ∘ as in Equation (
6). Such a structure is called a
quotient structure of the partial matrix groupoid
.
We also say that for every
the elements of
are elements in
of the order
. Using Proposition 1, we get that for all
, and for any
, the multiplication of matrices of dimensions
and
induces a multiplication in the corresponding quotient sets (see
Figure 1).
Example 1. Let P be the set of prime numbers, let , and let the ordering on L be defined componentwise (taking the usual order in and taking ∞ to be the greatest element in ). That is, for , we define Let be the set of matrices over , and be the matrix groupoid with the usual matrix multiplication. Let and , , we write , iff , for all .
We define by: Since congruence is compatible with multiplication and addition, it is also compatible with matrix multiplication, i.e., if and , we have If and , then and , where ; thus, and .
Thus, is a matrix space.
For all and we have , which implies that equals the greatest element in L (we shall denote it by 1). We interpret as the level of existence of the fuzzy matrix A; thus, all the matrices exist with certainty, and for all .
For any matrix A, we denote by the absolute value of the element in A having the greatest absolute value. For , such that , we have that for all greater than , ; thus, for , if for infinitely many p, then , and for any such ϕ, we have that is the diagonal (equality) relation in .
If for finitely many , i.e., for , we have that if and only if elements of are divisible by , ,…,, which holds if and only if elements of are divisible by .
We define a mapping Ψ, mapping to the set of matrices over of dimension , which maps A to the ordered set of matrices , such that matrix contains, in place of any element in matrix A, its remainder when divided by . It is obvious that Ψ is an epimorphism.
Note that iff , i.e., , and thus is isomorphic to the set of matrices of dimension over .
Since this holds for any pair , we have that is isomorphic to the set of matrices over , or to the set of matrices over .
Figure 2 illustrates how a fuzzy matrix is projected in different quotient structures of this fuzzified matrix space. Here, ; ; ; for all others . Example 2. Let , and let be a set of matrices over S. Let , and ≤ the usual relation "less than or equal to".
We define a partial operation ∘ in the set of matrices:
Let A be a matrix of order , and C a matrix of order . We define as the matrix whose element in the i-th row and j-th column is the arithmetic mean of all the elements in the i-th row of A and j-th column of C.
To define fuzzy relations in the sets of matrices of the same order, we introduce some notation. If A is a matrix, is the smallest element of A, is the sum of all the elements of A, and is the arithmetic mean of all the elements of A. In every set of matrices of the same order we introduce the following fuzzy relation: The fuzzy relation is obviously symmetric and transitive. We prove that it is also compatible with ∘:Let be matrices of the order . Let ; . We should prove that .
Suppose thatFrom (7) we have: and thusFrom the definition of ∘ and the above inequation we have:Obviously, . Thus:From (8) we obtainwhich is equivalent toi.e., equivalent to and . This contradiction proves that (8) cannot hold, thus Analogously, .
Thus, .
Thus, is a matrix space.
Here, .
Also, for we have: Thus, is one-element structure for each pair , and is isomorphic to , where ∘ is a partial operation on , defined for iff , in which case .
The level of existence of any fuzzified matrix A of the dimension equals , while it is similar to the level p to all the matrices in ; thus, it collapses in into the only element of .
3.2. Terms and Identities in the Language with One Binary Operation
Let be a partial matrix groupoid and . We define two sets of terms in a language with one binary operation symbol ∘, which we call the set of terms over and the set of terms over . We start from —for the first set of terms—and from the universe of , for the second set of terms. Their elements are called constants. Let be any pair of natural numbers; every element of of the order is called a constant in of the order , and every element in of the order is called a constant in of the order . We add to both sets of terms, for every pair of natural numbers , the same countable set of variables (when convenient, we shall denote them differently).
We define the set of terms over (or the set of terms over ), in an inductive way:
For every pair of natural numbers, constants in (or in , for the second set of terms) of the order , as well as variables from (for both sets of terms), are terms over (over ) of the order .
If for , is a term over (or over ) of the order and is a term over (over ) of the order , then is a term over (over ) of the order .
Terms are exactly those expressions obtained with finitely many applications of the previous two steps.
Equivalently, we may define these two sets of terms as intersections of all the sets containing all the constants (in and , respectively) and variables, and fulfilling the above condition 2. Usually, we delete outer brackets, i.e., those obtained by the last application of step 2 in the process of forming a term.
If and are terms over (or over ) of the same order , then is an identity over (over ) of the order .
Let be an identity over or an identity over and let be all constant terms and let be all variables appearing in and/or .
By and we denote the terms obtained from and by replacing with a constant of the same order for , as well as the values of these terms when ∘ is interpreted either as the partial operation of , for the terms over , or by interpreting ∘ as the partial operation of , for terms over .
We say that an identity
over
is
true in a fuzzified matrix space in valuation if the following is true:
This means that the level of existence of the solution and the level of similarity of the left and the right sides of the evaluated expressions have to exceed the level of existence of the equation itself, measured by the level of existence of the constants appearing in the equation. For simplicity, here the indices in E and are not written; they are equal to the order of and to the corresponding orders of and .
In the sequel, we consider identities that are similar to one another, having an analogous arrangement of variables, constants, and operations. Therefore, we need to define what it means for two terms and , each of which is a term over or over for some , to be of the same type. We do this in an inductive manner.
The relation that is to be of the same type in the family of all terms over and is defined as the intersection of all the equivalence relations on the union of the sets of terms over and over for all , such that:
- (i)
If A and B are constants of the same order, they are of the same type (here also, a constant from is of the same type as a constant over of the same order; hence, some terms from are of the same type as terms over ).
- (ii)
If and , as well as and , are of the same type, and the terms and are defined, then they are of the same type.
The set of all equivalence relations fulfilling (i) and (ii) is nonempty—we can take the full relation, in which any two terms are related.
Thus, the intersection of all the equivalence relations fulfilling (i) and (ii) exists, and since the intersection of any set of equivalence relations is also an equivalence relation, the relation “to be of the same type” is an equivalence, and thus a reflexive and nonempty relation on the union of the sets of terms over and for all . Let us call its classes types of terms. Let us denote the type containing a given term T by .
We say that identities and are of the same type if . It is straightforward that the relation "to be of the same type" is an equivalence relation in the set of all identities. Classes of that relation are called types of identities.
As an equivalence class, a type of identity is determined by any identity belonging to it and may be written as .
Also, we say that an identity is of the type if it belongs to the class .
Some simple types of identities are described in the following example.
Example 3. Let be fixed natural numbers.
- (1)
Identities of the form , where A is a constant of the order , and C is a constant of the order and X is a variable from , form a type of identity; i.e., the set of all such identities over and is a type of identity.
- (2)
Identities of the form , where B is a constant of the order , and C is a constant of the order , and Y is a variable from , form a type of identity; i.e., the set of all such identities over and is a type of identity.
3.3. Generalized Matrix Equation
Let be a partial matrix groupoid. An identity over containing constants and also some variables , is called an equation over . Note that ∘ in and is interpreted as the partial operation ∘ in . We also write . By the type of an equation over , we simply mean its type as an identity.
Let
be an
L-valued matrix space over
,
and
the corresponding algebraic structure we have defined in
Section 3.1.
We denote by the class of in , where is the order of A.
An identity over containing constants from the universe of and also some variables , is called an equation over . Here, ∘ in and is interpreted as the partial operation in . We also write . By the type of an equation over , we simply mean its type as an identity.
In the following definitions and theorems, we write and instead of and , and also and instead of and , whenever m and n are arbitrary or not known.
We say that an equation
over
containing constants
is
weakly solvable in if there are
such that the identity
is true in the valuation
; i.e., if
for some
.
We say that is a weak solution of the equation in the fuzzified matrix space .
We relate the weak solvability of equations over the partial matrix groupoid in a fuzzified matrix space to the solvability of the corresponding equations over the related quotient structure .
As for the solvability in
, we define it in a usual way. Namely, we say that an equation
over
is
solvable in , if there is an ordered t-tuple
of constants in
, such that the equality
is true, when ∘ in
and
is interpreted as
. We also say that
is a
solution to the equation in .
In order to investigate relationships between weak solvability of equations over in an L-valued matrix space and the solvability of some related equations over , we define a sort of projection of a term T over in an L-valued matrix space .
If , where is the set of all constants occurring in a term T over , the p-projection of in an -valued matrix space is an expression derived from T by replacing every with and ∘ with , as defined above. We denote the projection by .
Using the definition of the projection and the definition of , we obtain the following lemma.
Lemma 2. Let be an L-valued matrix space over a partial matrix groupoid , and a term over containing t variables . If every constant in T belongs to for some and if is an ordered set of matrices, each one belonging to , for some , such that is of the same order as for , then , for some and .
Proof. We prove this by induction on the complexity of the term.
For a constant or a variable, the assertion of the lemma holds by the definition of the projection.
If the assertion of the lemma holds for and , we prove that it holds also for .
Let
be an ordered set of matrices, each
being a matrix of the same order as
and
a matrix of the same order as
—for
and
—then
Thus, we have proved the induction step. □
Theorem 1. Let be an L-valued matrix space and an equation over . All the equations over of the type are weakly solvable in the L-valued matrix space if and only if for every , all the equations over of that type are solvable in .
Proof. Suppose that all the equations over of the type are weakly solvable in the L-valued matrix space. Let t be the number of variables occurring in . Let and be an equation over of the type . It also has t variables.
Every constant in and is of the form , where is a matrix. Replacing every constant in and with some matrix belonging to the equivalence class denoted by that constant, we obtain an equation over —let us say —of the same type as —having t variables. This equation is—by assumption—weakly solvable in the L-valued matrix space. Let be the set of constants in that matrix equation and be a weak solution to it.
Since every is in , we have that for every ; thus . Herefrom, ; thus for ; also and .
Now, using Lemma 2, we have
Here, and contain a constant for every matrix A contained in and ; such a matrix A is previously chosen as a representative of its -class occurring in or ; therefore, and become and when ∘ in them are replaced with . Since = , we have proved that the initial equation is solvable in .
To prove the converse, suppose that for every , all the equations over of the type have at least one solution. Let be an equation over . Let be the set of all constants contained in and , and let . Now, replacing every by , we obtain the equation over of the same type , which by assumption has a solution, let us say ; here, for every . Since and become and when ∘ in them are replaced by , we have that , and thus by Lemma 2 we have
, so
. Thus:
and
has a weak solution
and is weakly solvable. □
Taking the types described in Example 3, we obtain, as special cases and as corollaries of Theorem 1, Theorems 1 and 2 from [
15].
Corollary 1. Let be an L-valued matrix space and .
- (1)
All of the equations of the form —where and —are weakly solvable over the L-valued matrix space if and only if for every all of the equations of the form —where and —are solvable in .
- (2)
All of the equations of the form , where and , are weakly solvable over the L-valued matrix space if and only if for every all of the equations of the form , where and , are solvable in .
We give some more applications of Theorem 1 to some other special types of equations.
Example 4. For a fuzzified matrix space , and we have the following.
- (1)
All the equations of the form , where and X is a variable of the order , are weakly solvable in the fuzzified matrix space if and only if all the equations of the form , where are solvable in .
- (2)
All the equations of the form , where and Y is a variable of the order , are weakly solvable in the fuzzified matrix space if and only if all the equations of the form , where are solvable in .
We could also generalize another result from [
15], allowing us to test weak solvability of a single equation over
in a fuzzified matrix space by the solvability of the corresponding equation over
, for a suitably chosen
. Namely, the following theorem generalizes Theorem 3 from [
15].
Theorem 2. Let be an L-valued matrix space over a partial matrix groupoid and an equation over . Let be the set of constants contained in and/or , and let . The equation is weakly solvable in the L-valued matrix space if and only if the equation over that we obtain from it by replacing every constant with its class in is solvable in .
Proof. Let be weakly solvable in the L-valued matrix space
, and let be the equation over , derived from by replacing every constant by , where .
First, suppose that
is weakly solvable. Let
be a weak solution to
, which means that
Since for all , we have ; thus, ; by Lemma 2, , . By the above inequation, and . By Lemma 2:
= .
, become , , respectively, when ∘ in them are replaced with ; thus, we have proven that is a solution to the equation and, consequently, is solvable in .
To prove the other implication, suppose that is solvable in , and let be a solution to . and become and , when ∘ in them are replaced with ; since is a solution to , we have . By Lemma 2:
= , so .
Since
for
, we have
and
. Finally,
and
has a weak solution
and is weakly solvable. □
Applying this theorem to the linear equations
and
, we obtain the following corollary, equivalent to Theorems 3 and 4 from [
15].
Corollary 2. Let be an L-valued matrix space, and , , and .
- (1)
The equation —where X is a variable of the order —is weakly solvable in the L-valued matrix space if and only if the equation , where , is solvable in .
- (2)
The equation —where Y is a variable of the order —is weakly solvable in the L-valued matrix space if and only if the equation , where , is solvable in .
Example 5. Let , and let be the space of matrices over the ring . Let ∘ be the usual matrix product: if , , .
We say that, for and , two matrices of the order are congruent modulo k if for all we have (mod k). We write (mod k).
Let be a four-element lattice in Figure 3, and let and for all : For any , is a symmetric and transitive fuzzy relation, i.e., it is a weak L-valued equivalence relation. Moreover, it is compatible with ∘.
Thus, is a matrix space. Let us describe the quotient structure for all :
: and , so is a one-element set for all . Thus, is isomorphic to , where ∘ is a partial operation on , defined for iff , in which case .
: and , for all , so is isomorphic to the set of matrices over the ring , where , and are addition and multiplication modulo k, respectively, (multiplication of matrices is as usual).
or : is a set of matrices whose elements are divisible by k, while is the full relation on that set; thus (as well as ) is isomorphic to , where ∘ is a partial operation on , defined for iff , in which case .
Thus, for any fuzzified matrix A of the dimension , we may with certainty say that it exists; i.e., its level of existence in is 1 (because ), while it is similar to the level t to all the matrices whose elements are to its elements at the same position. It collapses in , , into the only element of , , , while in it is reduced to the matrix over , containing—instead of an element —its remainder when divided by k.
Consider the equation , where and .
We can easily see that this matrix equation is not solvable over the domain in the usual way.
Now, we want to determine whether the equation is weakly solvable.
We need to check the solvability of the equation , where .
For , we have .
For , we have , where .
Also, , where .
is solvable in , namely, for , we have which is in the same equivalence class as under the equivalence ; therefore,
Thus, is weakly solvable in , if .
The matrix space we introduced fuzzifies a set of matrices with a partial groupoid structure (i.e., with the multiplication of matrices defined in a case when the standard multiplication is defined), in order to apply it to various cases of matrix multiplication, which can model, e.g., the composition of fuzzy relations and various other processes and transformations for which addition may not be defined or relevant. Matrix space preserves multiplication in the initial set of matrices by its very definition. But a set of matrices that we want to fuzzify does not, generally, include addition, and if it does, a necessary and sufficient condition for a matrix space to preserve addition would be that the existing addition is compatible—under the usually defined compatibility—with weak equivalences within all subsets of matrices of a given dimension. That is the case in our Examples 1 and 5.
In the sequel, we define the unique weak solvability of the equations over in an L-valued matrix space.
Let
and
be terms over
. Let
be the set of constants contained in
and/or
. We say that the equation
is
uniquely weakly solvable in an
L-valued matrix space
if it is weakly solvable and, for any two of its weak solutions
and
, we have
which is equivalent to
This means that a uniquely weakly solvable equation over may have several weak solutions, but they should be equal on the “level” . Therefore, we are able to test the unique weak solvability of an equation over in the quotient structure for , as we prove in the following theorem.
Theorem 3. Let be an L-valued matrix space over a partial matrix groupoid and let be an equation over . Let be the set of constants contained in and/or , and let . The equation is uniquely weakly solvable in the fuzzified matrix space if and only if the equation we obtain from it by replacing every constant with its class in is uniquely solvable in .
Proof. Let be the equation over we obtain from by replacing every constant with its class in , where .
First, suppose that is uniquely weakly solvable. By the proof of Theorem 2, if is a weak solution to , we have that for all and is a solution to . If is any solution to , by the proof of Theorem 2, we have that is a weak solution to ; thus, by the weak uniqueness we have , and .
Now, suppose that is uniquely solvable, and that is its unique solution. By the proof of Theorem 2, we have that is a weak solution to . Let be another weak solution to , by the proof of Theorem 2 we have for and is a solution to . By uniqueness, we have for , consequently . □
Example 6. In Example 5, for , the equation is not uniquely weakly solvable, since for , both and , where and are solutions to . By the definition of in Example 5, we can note that , and hence the equation is not uniquely solvable.
But the equation , where is uniquely weakly solvable. Namely, it is weakly solvable, since is solvable, because and, thus . Let be a solution to ; since for all Y for which is defined, we have ; thus, any solution to the equation equals to .
We obtain, as corollaries to Theorem 3, assertions that are slightly reformulated Theorems 5 and 6 from [
15].
Corollary 3. Let be a partial matrix groupoid, , , and for some .
- (1)
The equation over —where X is a variable of the order —is uniquely weakly solvable in a given fuzzified matrix space , if and only if the equation —where —is uniquely solvable in .
- (2)
The equation over —where Y is a variable of the order —is uniquely weakly solvable in a given fuzzified matrix space , if and only if the equation —where —is uniquely solvable in .
Another corollary to Theorem 3 generalizes Corollary 1 from [
15].
Corollary 4. Let be an L-valued matrix space over a partial matrix groupoid . Let be an equation over . If for every all the equations over of the type are uniquely solvable in , then all the equations over of the same type are uniquely weakly solvable in .