Professional Documents
Culture Documents
Science
[17-30]
the boolean standard identities. We will call t-norm in [0, 1] to every mapping
[0,1] [0, 1] [0, 1] satisfying the following properties
1.
2.
3.
4.
T:
Given a t-norm T, we can consider the mapping S: [0,1] [0, 1] [0, 1] S(x, y) 1-T(1-x, 1-y).
This mapping S, will be called dual t-conorm of T. The most important properties of t-norms and
t-conorms can be found in [9,11].Here we present the following theorem with regard to the
distributive property of t-norms and t-conorms. In this paper unless it is said in the opposite way,
we will designate the t-norms and t-conorms with the greek letters , , , . Let I be a finite
family of indices and { } , { } be number collection of [0, 1].For every t-norm or tconorm and for every t-norm or t-conorm
1. ( ) ( ) ( )
2. ( ) ( ) ( ) are verified.
With the result given by L.W.Fung and S.K.Ku [10] relative to the fact that is an idempotent tconorm (idempotent t-norm) if and only if = ( =), we get the following theorem:
Theorem 2.0:
Let { } , { } be two finite number families of [0,1] and , t-norms or t-conorms not null.
Then
( ) = ( ) ( ) if and only if =
( ) = ( ) ( ) if and only if = .
Definition 2.1: [2]
A Fuzzy neutrosophic set A on the universe of discourse X is defined as
A= , (), (), (), where , , : [0, 1] and 0 TA ( x) I A ( x) FA ( x) 3
[17-30]
Definition 3.2:
Given a binary fuzzy neutrosophic relation between and , we can define 1 between and
by means of 1 (, ) = (, ), 1 (, ) = (, ), 1 (, ) = (, ) (, )
to which we call inverse relation of R.
Definition 3.3:
Let and be two fuzzy neutrosophic relations between and , for every (, )
We can define,
1) (, ) (, ), (, ) (, ), (, ) (, )
2) (, ) (, ), (, ) (, ), (, ) (, )
3) = { (, ), (, ) (, ), (, ) (, ), (, ) (, )
4) = { (, ), (, ) (, ), (, ) (, ), (, ) (, )
5) = { (, ), (, ), 1 (, ), (, ): , }
Theorem 3.4:
Let R, P, Q be three elements of fuzzy neutrosophic relations (X Y)
() 1 1 ( )( )1 = 1 1 ()( )1 = 1 1
()(1 )1 = () ( ) = ( ) ( ), ( ) = ( ) ( )
() , , ,
() ,
() ,
Proof:
() then 1 (, ) = (, ) (, ) = 1 (, ) (, )
1 (, ) = (, ) (, ) = 1 (, ) (, ) and
1 (, ) = (, ) (, ) = 1 (, ) (, ) .Hence
1 1
() ()1 (, ) = (, ) = (, ) (, ) = 1 (, ) 1 (, )
= 1 1 (, ).The proofs for ()1 (, ) = 1 1 (, ) &
()1 (, ) = 1 1 (, ) are done in a similar way.Hence ( )1 = 1 1 .
() Proof is similar to (ii) () proof follows from the definition.
() We will use the fact that the operators and satisfy the distributive property when they are
applied to elements of [0, 1].() (, ) = (, ) { (, ) (, )}
= { (, ) (, )} { ( (, ) (, )} = (, ) (, )
= () () (, ) . Similarly () (, ) = () () (, ) nd () (, ) =
() () (, ). Hence ( ) = ( ) ( ).
The proof is analogous to the previous one, in the case of ( ) = ( ) ( ).
()Proof is obvious.
() , , , ,
, , , , ,
Http://www.granthaalayah.com International Journal of Research - GRANTHAALAYAH
[17-30]
Similarly we can prove () .We can generalize the operations between binary fuzzy
neutrosophic relations R, Q FNR (X Y). Using the well known triangular t-norms and tconorms in [0, 1]. For a triangular t norms T and its dual t conforms S, we get
(, ) = { (, ), ( (, ), (, ), ( (, ), (, )), ( (, ), (, )) }
(, ) = { (, ), ( (, ), (, ), ( (, ), (, )), ( (, ), (, )) }
COMPOSITION OF FUZZY NEUTROSOPHIC RELATIONS
Basing ourselves on the composition of binary IF relations in [0, 1] we can give the following
definitions.
Definition 3.5:
Let , , , be t-norms or t-conorms not necessarily dual two two,
and ( ). We will call composed relation
,
(
,
( )
by
,
= {(, ), , (, ), , (, ), , (, ) / , }
,
,
,
,
,
,
(, ) = {[ (, ), (, )]}
Whenever 0
,
,
(, ) +
,
,
(, ) +
,
,
(, ) 3 (, ) .
The choice of the t-norms and t-conorms , , , in the previous definition, is evidently
conditioned by the fulfilment of
0 , (, ) + , (, ) + , (, ) 3 (, )
,
Theorem 3.6:
For each, ( ) , ( ) and , , , any t-norms or t-conorms
, 1
,
( ) = 1 1 is fulfilled.
,
,
Proof:
, 1
( )
,
(, ) =
,
,
= {[1 (, ), 1 (, )]} =
,
1
,
(, ). Similarly
, 1
)
,
(, ) =
(, ),
[17-30]
, 1
( )
,
(, ) =
,
,
= {[1 (, ), 1 (, )]} =
(, ) (, ) .
, 1
,
Hence( ) = 1 1
,
,
Theorem 3.7:
In the conditions of definition 3.5
,
,
If 1 2 , then 1 2 , for every R FNR
,
,
,
,
If 1 2 , then 1 2 , for every P FNR
,
,
,
,
If 1 2 , then 1 2 , for every R FNR
,
,
,
,
If 1 2 , then 1 2 , for every P FNR
,
,
,
,
Let R, P be in FNR (X X), if , then are verified.
,
,
Proof:
1 2 then 1 (, ) 2 (, ), 1 (, ) 2 (, ) 1 (, ) 2 (, )
, (, ) = {[ (, ), 1 (, )]} {[ (, ), 2 (, )]} = , (, ).
1
,
Similarly
,
1
,
,
1
,
(, )
,
2
,
2
,
(, )
(, ) = {[ (, ), 1 (, )]} {[ (, ), 2 (, )]} =
,
2
,
(, )
,
,
Therefore
1 2
,
,
(ii), (iii), (iv),(v) can be proved in a similar way.
Theorem 3.8:
For any , , t-norms or t-conorms, , ( ) ( )
,
,
,
( )
,
,
,
Http://www.granthaalayah.com International Journal of Research - GRANTHAALAYAH
[17-30]
Proof:
Starting from the points (vi), (vii), (viii) of the theorem 3.4, we get
,
,
( )
,
,
,
,
,
{
( )
,
,
,
,
,
( )
{
,
,
The above theorem determines the sign of the inequality for the distributive property of the
composition respecting the union. Next theorem will give us a necessary and sufficient condition
for the fulfilment of the equality.
Theorem 3.9:
Let R, P be the two elements of FNR ( Z), Q ( ) , not null t-norms or
,
,
,
t -conorms. Then ( ) = if and only if = = .
,
,
,
Proof:
,
,
,
Let( ) = .
{[ (, ), (, ) (, )]}
, (, ) =
()
,
,
,
,
{[ (, ), (, )]} {[ (, ), (, )]}.
Let { } be any two finite family of numbers belonging to the interval [0, 1]
If is t-norm, we define (for x, z fixed and for every y).
(, ) = 1, (, ) = , (, ) = .Then it is known that [ (, ), (, )] =
,
,
,
[ (, ), (, )] = .Besides as ( ) = ( ) ( ) it is verified
,
,
,
for every R, P and Q by means of hypothesis we have ( ) = ( ) ( ) and this
condition verified for every { } , { } .We have proved in the theorem 2.0, that is
equivalent to =
(ii) If is t-conorm, we define the degree of truthfulness of R, P and Q as follows:
(, ) = 0, (, ) = , (, ) = and with the same proceeding we conclude that
verifying ( ) = ( ) ( ) as we have seen in the theorem 2.0, if and only if
= .
In the same way we can prove the result for indeterminacy and by following the same proceeding
for the falseness we can conclude that = . Conversely,Let = = , be any t
norms and t-conorms
, (, ) = {[ (, ), (, ) (, )]}
()
= {[ (, ), (, )] [ (, ), (, )]}
[17-30]
Using
the
associative
property
of
the
t-conorms,
we
= {[ (, ), (, )]} {[ (, ), (, )]} = , (, ) , (, )
,
(, )
()
,
,
.Similarly
(, ) =
,
,
(, )
,
,
()
,
,
(, ) =
have
,
,
(, )
,
,
(, ) and
(, )
Theorem 3.10:
For every , , , any t-norms or t-conorms and , ( ) , ( ), it is
,
,
,
verified that ( ) ( ) ( )
,
,
,
Proof:
Analogous to the one made in the theorem 3.7.
Theorem 3.11:
Let R, P be the two elements of FNR ( Z), Q ( )
different from the null t-norm different from the null t-conorm. Then
,
,
,
( ) = ( ) ( ) if and only if = = .
,
,
,
Proof:
The proof follows by theorem 3.9.
From the analysis of the previous theorem it is deduced that the choice of , , t-norms
or t-conorms will depend on the problem traced on each case. However the distributive equalities
will demand the choice of respectively.
Theorem 3.12:
Let Q ( ) , P ( ), R ( ) any t-norms or t-conorms.
, ,
, ,
If = = then ( ) = ( )
, ,
, ,
Proof:
Let be associative
, (, ) =
, ,
( )
,
((, )),( , ) =
(, ) =
{ [ (, ),
((, ))
,
,
(, ) ]}
[17-30]
=
=
=
{ [ (, ), {( (, ), ( (, )) )} ]} =
{ [[ (, ), (, ), (, )]]} =
(, ), (, )]} =
{ [
,
,
The equality
, ,
( )
, ,
, ,
( )
,
, , (, )
( )
(, ) =
, ,
( )
, ,
, ,
( )
, ,
{[
{ {[ (, ), ( (, ), (, )) ]}}
[ (, ), (, ), (, ) ]]}
(, ) (, )
(, ) (, ) and
,
,
,
placed up are applied to the truth value and indeterministic value and the symbols and placed
down are applied to the false value .Therefore the order of placement is very important.
4. RELATIONS ON FUZZY NEUTROSOPHIC SETS
Definition 4.1:
The relation ( ) is called the relation of identity if
(, )
1 =
1 =
0 =
(, ) = {
, (, ) = {
, (, ) = {
0
0
1
The complementary relation = is defined by
0 =
0 =
1 =
, (, ) = {
, (, ) = {
.
1
1
0
It is evident that = 1 and = 1
(, ) = {
Theorem 4.2:
Let , , , be t-norms and t-conorms and ( )
,
,
= = if and only if is t-conorm , is t-norm , is t-norm and is t,
,
conorm.
,
,
= = if and only if is t-conorm , is t-norm , is t-norm and is t,
,
conorm.
[17-30]
Proof:
, (, ) = {[ (, ), (, )]} = {[ (, ), (, )], [ (, ), (, )]
,
= {[1, (, )], [0, (, )] } = {[ (, ), 0] } = (, ) , (, )
, (, ) = (, ) , (, )
,
, (, ) = {[ (, ), (, )]} = {[ (, ), (, )], [ (, ), (, )]
,
= {[0, (, )], [1, (, )] } = {[ (, ), 1] } = (, ) , (, )
Similarly,
,
,
Conversely, Suppose that = = it is fulfilled for each ( )
,
,
Case (i):
,
Let be t-norm and be t-conorm .Taking = , we get = then , (, ) =
,
,
(, ) , (, ) .If
, (, ) = {[ (, ), (, )]} =
,
= {[1,1], [0,0]
{[1,0]
}=
then
{[ (, ), (, )], [ (, ), (, )]
} = 0 (, ) = 1 Which is a contradiction.
Case (ii):
Let be t-conorm and be t-conorm .Taking = and we have
, (, ) = {[ (, ), (, )]} = {[ (, ), (, )], [ (, ), (, )] }
,
= {[1, (, )], [0, (, )]
For every (, ) ,
}=
}=
{1,1,0
, (, )
,
} = 1 (, ) = 0 (, )
(, ) if
Case (iii):
1
=
.
1
(, ) = (, ) = 1 have to be fulfilled.
,
,
, (, ) = {[ (, ), (, )]} = {[ (, ), (, )], [ (, ), (, )] }
,
= {[1,1], [0, (, )] } = {1, (, ) } = (, ) 1 = (, ) which is not true.
[17-30]
Case (iv):
1
=
1
(, ) = (, ) = 1 have to be fulfilled.
,
,
, (, ) = {[ (, ), (, )]} = {[ (, ), (, )], [ (, ), (, )]
,
= {[1,1], [0, (, )] } = {1,0 } = 1 = (, ).
Hence it is proved that is t-conorm and is t-norm. Proof for indeterministic functions is
similar to the above.
Making a development, which is analogous to the previous one, for the falsity functions ,we
deduce that is t-norm and is t-conorm.
The proof of (ii) is similar to the one made in (i) using .
Definition 4.3:
The relation ( ) is called
Reflexive if for every , (, ) = 1 , (, ) = 1, (, ) = 0
Anti- reflexive if for every , (, ) = 0 , (, ) = 0, (, ) = 1
(i.e,) The relation is called anti-reflexive if its complement is reflexive.
Theorem 4.4:
For every ( ), it is verified that
If is reflexive then
(ii) If is anti-reflexive then
Proof:
It is the consequence of the definition 4.1 and 4.3.
Theorem 4.5:
t-conorm, t-norm, t-norm and t-conorm it is verified that
,
If ( ) is reflexive, then
,
,
If ( ) is anti-reflexive, then
,
For
[17-30]
Proof:
, (, ) = {[ (, ), (, )]}
,
= {[1, (, )], [ (, ), (, )] }
,
,
{[ (, ), (, )], [ (, ), (, )]
= { (, ), [ (, ), (, )] } (, )
(, ) (, )
, (, ) = {[ (, ), (, )]}
,
= {[0, (, )], [ (, ), (, )] }
{[ (, ), (, )], [ (, ), (, )]
{ (, ), [ (, ), (, )]
} (, )
since is t-norm.
The proof of (ii) is analogous to the proof of (i) .
Example 4.6:
This example states the existence of fuzzy neutrosophic relations which satisfy the property
,
and they are not reflexive.Let be the following set = {, , } and
,
0.4 0.8 0.4
0.3 0.7 0.2
( ) given by = (
) , = (
),
0.7 0.9 0.6
0.5 0.8 0.5
0.3 0.5 0.2
0.1 0.4 0.1
0.5 0.3 0.9
= (
) . For =, =, = and =, we have
0.4 0 0.5
0.8 0.4 0.6
0.7 0.8 0.6
0.5 0.7 0.5
, = (
) , , = (
),
0.7 0.9 0.6
0.5 0.8 0.5
,
,
0.5 0.5 0.5
0.4 0.4 0.4
,
0.4 0.3 0.5
, = (
) Resulting that not being reflexive.
0.4 0 0.5
,
,
0.4 0.4 0.5
Theorem 4.7:
If ( ) is reflexive, , are t-conorms and , are t-norms ,then
,
.
,
[17-30]
Proof:
, (, ) = {[ (, ), (, )]} =
,
{[1,
(, )], [ (, ), (, )]
=
Similarly we can prove
,
,
{[ (, ), (, )], [ (, ), (, )]
} = {1, [ (, ), (, )] } = 1 (, )
(, ) (, ).
, (, ) = {[ (, ), (, )]}
,
{[0,
=
(, )], [ (, ), (, )] }
{[ (, ), (, )], [ (, ), (, )]
{0, [ (, ), (, )]
} = 0 (, )
,
Therefore .
,
Theorem 4.8:
Given ( ) for t-conorm and t-norm, it is verified that (i) If is reflexive
,
,
then is reflexive (ii) If is anti-reflexive then is anti reflexive
,
,
Proof:
, (, ) = {[ (, ), (, )]} = {[ (, ), (, )], [ (, ), (, )]
{[1,1], [ (, ), (, )] } = {1, [ (, ), (, )] } = 1
=
Similarly we can prove
, (, )
,
=1
, (, ) = {[ (, ), (, )]} = {[ (, ), (, )], [ (, ), (, )]
,
= {[0,0], [ (, ), (, )] } = {0, [ (, ), (, )] } = 0.Therefore
,
is reflexive.
,
Proof of (ii) is similar to the one made for the reflexivity.
Corollary 4.9:
( )
If
is
reflexive
is
t-norm
and
is
t-conorm
,then
()
, ,
,
= . with n=1,2,3,...... it is reflexive.
, ,
,
[17-30]
Theorem 4.10:
Let 1 be reflexive fuzzy neutrosophic relation in .Then (i) (1 )1 is reflexive.
1 2 is reflexive for every 2 ( ) (iii) 1 2 is reflexive
2 ( ) is reflexive.
(ii)
Proof:
Proof follows from the definitions.
Definition 4.11:
A reflexive closure of a relation is reflexive for every ( ) is defined as
Definition 4.12:
A relation ( ) is called symmetric if = 1 that is, if for every (, ) of
, (, ) = (, ), (, ) = (, ), (, ) = (, ).
In a contrary manner we will say that it is asymmetric.
Definition 4.13:
Let be an element of ( ).We will say that it is antisymmetrical fuzzy neutrosophic
relation if for every (, ) of ,
(, ) (, ), (, ) (, ), (, ) (, ).
Theorem 4.14:
If , , , are either t-norms or t-conorms and , ( ) are symmetrical then
,
, 1
= ( )
,
,
Proof:
,
,
, 1
and are symmetrical = 1 , = 1 then = 1 1 = ( ) .
,
,
,
Definition 4.15:
Let us take t-conorm, t-norm, t-norm and t-conorm, we will say that
,
,
( ) is (i) transitive if (ii) c-transitive if .
,
,
Result 4.16:
For t-conorm, t-norm, t-norm and t-conorm, it is verified that
[17-30]
(i) If
,
( ) is reflexive and transitive, then =
,
(ii) If
,
( ) is anti-reflexive and c- transitive, then =
,
5. REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[17-30]