Академический Документы
Профессиональный Документы
Культура Документы
As far as fuzzy sets and fuzzy relations are considered as extensions of crisp sets and relations, this interpretation seems to be most natural.
1. Introduction
In ordinary fuzzy set theory, fuzzy sets axe identified with mappings into the unit interval [0, 1 1 of
real numbers, and the propeties or operations of fuzzy seta and relations are defined by equations or inequalities ([17,18]).Various definitionshave been proposed on the basic operations such as intersection, union, complement of fuzzy sets, and composition and inverse of fuzzy relations etc. (cf. e.g., 13, 4, 5, 6, 7, 8,11)). Sometimes only the defining equations are presented without explanation. We interpret fuzzy sets and fuzzy relations in the model V H introduced by the author [12],a Heyting valued model for intuitionistic set thoery, where N is a complete Heyting algebra and is considered the set of truth values in the model. V H is a kind of so-called sheaf model, cumulatively constructed by transfinite iteration of power sheaf construction over H.In the interpretation the canonical embedding from the class of all crisp sets into the model plays an important role. Though the model is similar to the sheaf models in [9,15,16]and so on, our interpretation is original and unique.
Let H be a complete Heyting algebra with operations and constants A, V, A, V, +,7 ,0 , 1, and I. We construct an H-valued model for the extended intuitionistic set theory, which is a first order intuitionistic logic with predicates E,= and E (called an existence predicate) together with axioms of intuitionistic set theory. Let V be the class of d l crisp sets and On be the class of all ordinals.
Page: 493
Definition 2.1. The H-valued model V H is constructed as follows. For every ordinal a,Vf is defined by induction:
bH = 9,
V .=
U VF
P<a
The assignment from each crisp set to its check set is called the canonical embedding. For a bounded ,a,) and crisp sets 2 1 ,.. . ,2n , formula cp(a1, cp(zl,...,zn) holds iff II~J(Z~,.-. , 2 , ) 1 1 = 1, and l(~( lzn) ~ holds l, iff * Ilp(Zi,... * * ,Zn)[l = 0.
Pairs, couples (ordered pairs), (cartesian) products, unions, and power sets in V Hare defined as follows. Definition 2.4. Let u,v E Vu.
U V,".
&On
We identify1 . 1 with U. For a sentence cp of V H , the Heyting value llpll E H is defined as follows.
Definition 2.5.
(1) D(u nxv)= 'Du U 'Dv, E(u nHv) = Eu A Ev, U nHv :z I + llz E U I A ~1 1 2E ~ 1 1 . (2) !D(uUHv) = 'Du U 'Dv, E(u U " V ) = Eu V Ev, u U H v:2 t ) 1. E U11 v 1 1 2E VI[. (3) D(u\"v) = 'Du U Dv, E(u\"v) = Eu V Ev,
U \ ~ V:z c-) 1 1 3 :E
uII A
llz E U[/.
The superscripts and commas may be omitted. A l l axioms of (extended) intuitionistic set theory are valid in VH.
c~
I= I
A
ZCDU
= 1.
If U E w and (U w). If U
E U , we say u and v are similar v and Eu = Ev, U and v are said to be equivalent (U w U).
v
A relation in V H is a subset of a cartesian product in VH. For R,u,v E Vn,R is a relation from u to v in V H if R is a subset of U x v in V H ,that is, R g u x v. We often write zRy instead of (zy)E R. For each set U in VHl the identity relation 1, on U
is defined bv:
Definition 2.3. For every crisp set 2 in V, the check set j! E V His defined recursively by:
D(5) = { f i ; ~ E z},
Ei:= 1, i: : fi C ) 1.
Page: 494
Definition 2.0.
relation R ' o R is symmetric, and in addition if 2 is total R-' o R is reflexive, and if it is univalent R-' o R is transitive.
2 . 3 . Mappings in the model A mapping in V H is a total and univalent relation in V H .For U , U,f E V H ,f is called a mapping from U to v in V H if f is a total and univalent relation from U to v in v H . We write f : U +v an V H if f is a mapping from U to v in V H .Hence for every f in V H ,f :U 3 v in V Hiff
f C U x U, I, E f '
of,
and f o f '
I,.
We often write f(z)= y instead of ( z y ) E f or zfy. An injection (resp. a sujection) is an injective (resp. surjective) mapping, and a bijection is an injective and surjective mapping. A composition of injections (resp. surjections or bijections) is also an injection (resp. a surjection or a bijection). For a relation f from U to v , f is an injection iff I , fi: f ' o f and f o f ' E I,, is a surjection iff I , E f-'of and fof-' R. I,, and f is a bijection iff I , fi: f ' 0 f and f o f ' M I,. Hence for a mapping f : U 3 v in v H , f i s injective iff I , R. f - l o f and is surjective iff f o f ' R. I,. For a mapping f in VH, f ' o f is an equivalence relation. We can define images and inverse images of m a p pings similarly to those o f relations. Most of the basic properties of relations and mappings of usual set theory also hold in the model.
PA =
:x+H;
2c )1 1 5
E All
Cx
An equivalence relation is a reflexive, symmetric, and transitive relation, an order relation is a reflexive, antisymmetric, and transitive relation, and a h e a r oder is a connected order relation. Hence a relation R on U is an equivalence relation iff I , 5 R, R-' E R, and R o R E R. If R is a
Hence there is a natural correspondence between H-fuzzy subsets of X and mappings from X to H. The natural correspondence preserves inclusion (order) and the basic set operations.
Page: 4%
Definition 3.2. Let p, U : X +H . (1) p U iff p ( z ) 5 Y ( Z ) for all z E X. (2) The mappings P A Y , p V u , p\u, y p : X+H a m defined by:
p A U :z
p
+p ( z ) A ~(z),
v U : z c)p ( 2 ) v U@),
c )-9p(z).
p\~:~t)p(~)A-u(z),
- p :5
Yz),
-+ H,v : Y -+HI and
(Z
/a
x nY ) eY ) . ( 2 E x \ Y) ( Z E x n Y)
E EX
Lemma 3.4.
Let p : X
Theorem 1 . Let A, B be H-fuzzy sets and all the membership functions below be on X .
(Z
(2)
PAnB
= P A A CIS,
PAUS
PA\B
= P A \ PB,
PW\A
= P A v pS1 =?PA.
P(4 p(z) v
44
Y(Z)
( z E Y \X).
P(2) (2 E p(z) A ~ ( z ) ( Z E 0 (z E
x\Y) x nY )
Y \ X).
and
Assume that p : X
+H
Now we consider the relation between H-fuzzy sets and mappings from different crisp sets to H.
For p : X
+H,define p r y : Y 3 H by:
pA
U (resp. p V U) works as the inhimum (resp. supremum) of p and U in the set of equivalence classes with respect to N.
tx
P3V
P H U
Theorem 2. Let A, B be sets an Vw,p~ be the membership function of A on X , and p~ be the membership function of B on Y.
P S VtX, pduanduip.
The relation 5 is a preorder compatible with the equivalence relation N. If X = Y, then p 5 U becomes p 5 u and p N u becomes p = Y . Lemma 3 . 2 . Let p : X
+H and u : Y +H.
C -
B i f fP A 5 PS, and B i f l p A N- p ~ .
Theorem 3 . Assume A, B are H f u z z ysubsets of X,Y respectively, and P A , C(B are the membership functions on X and on Y respectively. Let p ~ m ~A , LJB PA\B , be the membership functions of An B , AU B, A\ B on X U Y reappeetively.
(1) pAnB = P A A P E (2) PAUB = PA V PS.
(3)
PA\B
=PA \ PE-
Now we extend Definition 3.2(2) and define operations of mappings from diflerent sets to H.
Hence there is a natural correpondence between Hfuzzy subsets of merent crisp sets and mappings from those crisp sets to H, which preserves order and operations.
0-7803-7078-3/0l/$lO.MI (C)zoOlIEEE.
Page: 496
Every relation in V H is called an H-fvzzy relation. Definition 3.5. For R,u,v E V H ,R is an H fuzzy relation from U to v if it is a relation from U to v in V H . For every R E V H ,the membership function of R from X to Y is the membership function of R on X x Y, hence it is the mapping
PR :
Proposition 3 . 8 . Let A, B be H-fuzzy subsets of X , Y respectively, R be an H-fuzzy relation from A to B , and P A , p~g, p~ be their membership functions on X , Y,X x Y respectively. (1) R is total ifl V y E Y p ~ ( ~ =y ~ ) A ( x for ) all
2
x X y +H ; ( x y )
c-) II(zY)" E
RII.
ally E Y . (3) R is injective i f fp ~ ( x zA ) ~ R ( Y Z> ) 0 implies x = y for a l l x , y E X and z E Y . (4) R is univalent i f f~ R ( X Y A ) ~ R ( x z> ) 0 implies y = z forallxEX andy,tEY.
x.
If A, B are H-fuzzy subsets of X, Y respectively, then obviously an H-fuzzy relation from A to B is an H-fuzzy relation from X to Y . For every set R in V H ,R is an H-fuzzy relation from A to B iff
p R b y ) 5 P A (2)A p B (y) for all 2
x,y E y,
where P A , p ~p~ , be the membership functions on X , Y , X x Y respectively. Proposition 3.6. Let A, B , C be H-fuzzy subsets of X , Y , Z respectively, R be an H-fuzzy relation from A to B , S be an H-fuzzy relation from B to C , and P R , ps, P S ~ R~, R - Ibe the membership funcX x Z, Y x X respectively. tions on X x Y,Y x 2, (1) The composition S o R is an H-fuzzy relation from A to C , and for all x E X , z E Z pSoR(XZ) =
YY
Theorem 4. Let A be an H-fuzzy subset of X , R be an H-fuzzy relation on A, and pa, p~ be their membership functions on X , X x X respectively. ( 1 ) R is reflexive i f f p ~ ( ~= 5~ ) A ( x f)o r all x E X . (2) R is symmetric i f l p ~ ( z y = ) ~ R ( Y X f)o r a11 2, yE ( 3 ) R is tmnsitive ifl p ~ ( t yA )~R(YZ) 5 p~(Zz) f o r all x,y , z E X . (4) R is antisymmetric ifffor all x,y E X, p ~ ( 2 yA) p ~ ( y > ~ 0) implies x = y . ( 5 ) R is connected i f ff o r all 5 , y E X , pR(XY) v PR(YX) = P A ( X ) A p A ( 9 ) -
x.
If A = X and H = [0,1], the conditions are almost same to the usual definitions in fuzzy literature, but the condition ( 5 ) and the definition of linear order is stronger than ordinary definitions.
3.4. Fuzzy mappings and extension principle
( P R ( 2 Y ) A PS(Yz)).
These are extensions of the defining equations of max-min composition and those of inverse for ordinary fuzzy relations.
Proposition 3.7. Let A, B be H-fuzzy subsets of X , Y respectively, R be an H-fuzzy relation from A to B, and p~ be its membership function on X x Y . ( 1 ) For every C E V H ,the image R(C) i s a subset of B a n V H ,and for all y E Y
pR(C)(Y) =
2EX
Every mapping in V His called an H-fuzzy mapping. Definition 3 . 6 . An H-fuzzy mapping from U to v is a mapping from U to v in VH.An H-fizzy mapping from x to Y is a mapping from X to P in VH. Obviously an H-fuzzy mapping f r o m U to v is a total and univalent H-fuzzy relation f r o m U to U. Theorem 5. Let A, B be H-fuzzy subsets of X , Y respectively, and P A , ps be their membership function on X , Y respectively. Suppose f E V H and 1c, = pf i s its membership fvnctaon o n X x Y . Then f is an H-fuzzy mapping fi-om A to B i f $ satisfies the following three conditions:
( P C ( z )A P R ( X Y ) ) ,
where pc and ~ R ( c ) are the membership functions on X and on Y respectively. (2) For every D E V H ,the inverse image R-'(D) is a subset of A in V H ,and for all x E X
PR-I(D)(X)=
YY
V ( P D ( Y )A I L R ( X Y ) )
VEY
0-7803-7@78-3/Ol/$lO~~ ( C ) U ) o l IEEE.
Page: 497
Proposition 3 . 9 . Let A, B be H-fuzzy subsets of X , Y respectively, f be an H-fuzzy mapping from A to E , and pf be its membership function on X x Y . (1) For every C E V H ,the image f ( C ) is a subset of B in V H ,and for ally E Y
Pf(C)(Y)= =EX
[5] J. Fodor and R. R. Yager, "Fuzzy set-theoretic operators and quantifiers," Fundamentals of f i z z y sets, Kluwer Academic Publishers, Dordrecht, 2000, pp 125-193.
( P C ( 4 A Pf
(4),
[6]S. Gottwald, "F'uzzy uniqueness of fuzzy mappings," Fuzzy Sets and Systems, Vol. 3, 1980, pp 49-74.
[7]S. Gottwald, Fuzzy Sets and fizzy Logic: Foundations of Applimtions - from a Mathematical Point of View, Vieweg, Wiesbaden, 1993.
where p c and pf(c) are the membership functions on X and on Y respectively. (2) For every D E V H ,the inverse image f-'(D) i s a subset of A in V H ,and for all x E X
Pf-1(&)
DEY
(PdY) A Pf (SY)),
[SI S. Gottwald, "Fundamentals of fuzzy relation calculus," Fuzzy Modelling: Paradigms and Pmctice, Kluwer Academic Publishers, Boston, 1996,pp 25-47.
[9] R. J. Grayson, "Heyting-valued models for intuitionistic set theory," Applications of sheaves (Lecture Notes in Math. 753),Springer, Berlin, 1979,pp 402414.
Theorem 6. Let cp :X
Then the check set
--+
Y be a crisp mapping.
i s a n H - f i z z y mapping from
X to Y , and the followings hold. (1) For every A E V H ,the image $(A) is an H fuzzy subset of Y , and for all y E Y
&(A)(y)
9(=)=v
2EX
[lo] W. C. Nemitz, "Fuzzy relations and fuzzy functions," &zy Sets and Systems, Vol. 19, 1986,pp 177-191. [ll] S. V. Ovchinnikov, "Structure of fuzzy binary relations," f i z z y Sets and Systems, Vol. 6, 1981,pp 169-195.
where PA and are the membership functions on X and on Y respectively. (2) For every B E V H ,the inverse image @-'(B) i s an H-fuzzy subset of X , and for all x E X
[12]M.S b o d a , "Categorical aspects of Heytingvalued models for intuitionistic set theory," Comment. Math. Univ. Sancti Pauli, Vol. 30,
1998. [14]M. Shimoda, "A natural interpretation of fuzzy mappings," submitted, 2000.
[15] G. Takeuti and S. Titani, "Heyting valued universes of intuitionistic set theory," Logic Symposium Hakone 1979, 1980 (Lecture Notes in Math. 891), Springer, Berlin, 1981, pp 192-
30-34. [2]M. Demirci, Fuzzy functions and their fundamental properties, h z y Sets and Systems Vol. 106,1999, pp 239-246.
306. [16]G. Takeuti and S. Titad, "Fuzzy logic and a t h .Logic, Vol. 32, fuzzy set theory," Arch. M 1992,pp 1-32. [17]L. A. Zadeh, "Fuzzy sets," Infomation and Control, Vol. 8, 1965,pp 338-353. [18]L. A. Zadeh, "Similarity relations and fuzzy orderings," Information Sciences, Vol. 3, 1971, pp 177-200.
[3]D. Dubois, W. Ostasiewicz, and H. Prade, "F'uzzy sets: history and basic notions," findamentals of f i z z y sets, Kluwer Academic Publishers, Dordrecht, 2000,pp 21-124.
Page: 498