On Topological Structures and. Fuzzy Sets

Size: px
Start display at page:

Download "On Topological Structures and. Fuzzy Sets"

Transcription

1 L - ZHR UNIVERSIT - GZ DENSHIP OF GRDUTE STUDIES & SCIENTIFIC RESERCH On Tplgical Structures and Fuzzy Sets y Nashaat hmed Saleem Raab Supervised by Dr. Mhammed Jamal Iqelan Thesis Submitted in Partial Fulfillment f the Requirements f the Degree f Master f Science in Mathematics Department f Mathematics Faculty f Science l-zhar University - Gaza 2013

2 TO Spirit f my father, llah's mercy My mther My wife My sns My brthers and sisters My belved and glrius teachers I

3 cknwledgement Firstly, all gratitude and thanks t llah wh helped me t prduce this wrk. I wuld like t epress my gratitude and appreciatin t Dr. Mhammed Iqelan fr his cnstructive and fruitful help thrughut writing this thesis. Special thanks t all staff members f Department f Mathematics, and t all master degree students whm shared me the last years. My deep thanks t my family especially my mther, my wife, my brthers and sisters. Finally, thanks t all peple wh helped me t achieve this wrk. II

4 bstract In this thesis, we shall use sme classes f near pen sets t get several results in tplgical spaces and Fuzzy Set Thery. New cncepts n fuzzy sets and fuzzy relatins in prduct tplgical spaces will be intrduced. III

5 Preface Mathematics is the ldest and mst imprtant science inspired by the human, and sme scientists prefer t lk at mathematics as the lgical study f frm, rder and quantity, this view has changed when the tplgy is appeared, since it eamines the study f spaces away frm the frms and dimensins. The tplgy is ne f the mst imprtant branches f mdern mathematics. It is interested in the study f structures, cmpnents and the characteristics f all the different spaces, s that these characteristics remain similar under the cntinuus restructuring peratins withut leaving hles in the transitin frm ne space t anther and vice versa. In 1965 L.. Zadeh published his famus paper Fuzzy sets [29] prviding a new mathematical tl which enables t describe and handle vague r ambiguus ntins. Fuzzy set allws n sharply defined bundaries because f a generalizatin f a characteristic functin with range {0,1} t a membership functin with range [0,1]. lgebraic prperties f fuzzy sets have been studying [7, 9, 10, 11, 20, 21]. Pawlak in 1982 [23] intrduced a mathematical tl that supprts the uncertainty reasning in apprimatin space which generated by equivalence relatins. ut b Khadra [17] intrduced these ideas in terms f cncepts in tplgy. These ideas give a mathematical tl called the rugh membership functin. Mrever, Iqelan [10] intrduced anther mathematical tl called near rugh membership functin using sme classes f near pen sets. This thesis includes fur chapters: Chapter One: In the first chapter, we intrduced sme basic cncepts t be used thrugh this thesis. These cncepts are cnsidered as a fundamental cncepts in tplgy and fuzzy set thery. IV

6 Chapter Tw: In this chapter, we intrduced sme prperties f sme near pen sets in tplgical spaces. ls we presented sme relatins generated via tplgical spaces using sme classes f near pen sets. Chapter Three: In the cntet f Chapter 3, we intrduced sme results n rugh membership functin, near rugh membership functin and fuzzy sets in tplgical spaces. Chapter Fur: Thrugh this chapter, we intrduced sme results n fuzzy sets and fuzzy relatins in prduct tplgical spaces. V

7 Cntents cknwledgement bstract Preface Cntents II III IV VI CHPTER 1 Intrductin Fundamental cncepts f tplgical spaces Fundamental ntins in fuzzy set and fuzzy relatin 7 CHPTER 2 Generating relatins via tplgical spaces using sme classes f near pen sets Near pen sets in tplgical spaces Generating relatins via tplgical spaces 20 CHPTER 3 Fuzzy sets in tplgical spaces Membership functin Fuzzy sets in tplgical spaces 44 CHPTER 4 Fuzzy sets in Prduct tplgical spaces inary prduct in tplgical spaces Fuzzy sets in prduct tplgical spaces Cnclusin 69 References 71 VI

8 CHPTER 1 INTRODUCTION 1

9 Chapter 1 Intrductin The purpse f this thesis is t put a starting pint fr the applicatins f abstract tplgical thery int fuzzy set thery. Thrugh this thesis, we shall integrate sme ideas in terms f cncepts in tplgy and fuzzy set thery. Sectin 1.1 cntains fundamental cncepts f tplgical spaces, Sectin 1.2 t gives an accunt n fuzzy set thery. 1.1 Fundamental cncepts f tplgical spaces Sme f the basic cncepts in tplgy which are useful fr ur study are given thrugh this sectin. Definitin [15]. Let be a nnempty set and be a cllectin f subsets f. The cllectin is said t be a tplgy fr if satisfies the fllwing three cnditins: i) and. ii) is clsed under arbitrary unin. iii) is clsed under finite intersectin. If is a tplgy n, then the pair (, ) is called a tplgical space. The elements f are called pints f the space, the subsets f belnging t are called the -pen (simply, pen) sets in the space. The cmplements f the subsets f belnging t are called the -clsed (simply, clsed) sets in the space, and the * family f all -clsed subsets f is dented by. In a tplgical space (, ), a subset f is called clpen subset f if it is pen and clsed. 2

10 Definitin [17]. tplgical space (, ) is called a quasi-discrete (partitin space) if every member f is clpen subset f. Definitin [15]. family is called a base fr a tplgy n if every nnempty pen subset f can be represented as a unin f subfamily f. Clearly, a tplgical space can have many bases. Since each unin f members f belngs t, a base f is cmpletely determined by. Definitin [15]. family S is called a subbase fr a tplgy n if the family f all finite intersectins f S is a base fr. Definitin [12]. Let (, ) be a tplgical space and. The clsure f (briefly cl()) dented by and is defined by Evidently, clsed if and nly if F : F and F *. is the smallest clsed subset f which cntains. Nte that, is. Definitin [12]. Let (, ) be a tplgical space and. The interir f (briefly int()) dented by Evidently, pen if and nly if and is defined by G : G and G. is the largest pen subset f which cntained in. Nte that, is. Definitin [15]. Let (, ) be a tplgical space and. The bundary f (briefly N()) dented by b and is defined by b. 3

11 Definitin [12]. Let (, ) be a tplgical space and. The eterir f dented by ET ( ) and is defined by ET ( ). Definitin [12]. Let (, ) be a tplgical space and. The pint is called a cluster pint f if fr each G such that G, we have G { }. The set f all cluster pints f is called the derived set f and it is dented by. We shall recall sme definitins abut sme classes f near pen sets which are essential fr ur present study. Sme frms f near pen sets are intrduced in the fllwing definitin. Definitin Let (, ) be a tplgical space. Then the subset is called: i) Regular-pen [25] (briefly r-pen) if ii) Semi-pen [18] (briefly s-pen) if.. iii) Pre-pen [20] (briefly p-pen) if. iv) -pen [8] if. v) -pen [21] if. vi) -pen [1] if. The cmplement f an r-pen (resp. s-pen, p-pen, -pen, -pen and - pen) set is called r-clsed (resp. s-clsed, p- clsed, - clsed, - clsed and - clsed) set. The family f all r-pen (resp. s-pen, p-pen, -pen, -pen and - pen) sets is dented by RO( ) (resp. SO( ), PO ( ), O( ), O( ) (r ) and O ( )). 4

12 Remark [1, 8]. 1) In the tplgical spaces, the unin f -pen (resp. the intersectin f -clsed) sets is -pen set (resp. -clsed set), where { s, p,,, }. In general, this remark is nt true in the case f =r as shwn in Eample ) The intersectin f -pen (resp. the unin f -clsed) even tw sets need nt be - pen (resp. -clsed). Eample Let { a, b, c, d} and,,{ a},{ b, d},{ a, b, d}. Then RO( ),,{ a},{ b, d}. Nte that, the sets {a} and {b,d} are r-pen sets, but a, set. b d ={a,b,d} is nt r-pen Remark [2]. In a tplgical space (, ), the implicatins between and the families f near pen sets are given in the fllwing diagram. Remark [2]. In a tplgical space (, ), the implicatins between near clsed sets are given in the fllwing diagram. * and the families f Definitin [3]. Let (, ) be a tplgical space and int ( ) ) dented by fr all r, s, p,,, and is defined by. The -interir f (briefly Evidently, G : G, G is a -pen set. is the largest -pen set which cntained in, where s, p,,, 5.

13 Remark [3]. In a tplgical space (, ), the implicatins between the interir and -interir f a subset f are given in the fllwing diagram. Definitin [3]. cl Let (, ) be a tplgical space and ( )) dented by fr all r, s, p,,, and is defined by. The -clsure f (briefly Evidently, H : H, H is a -clsed set. is the smallest -clsed set which cntains, where s, p,,,. Remark [3]. In a tplgical space (, ), the implicatins between the clsure and -clsure f a subset f are given in the fllwing diagram. Definitin [10]. Let (, ) be a tplgical space and b N ( )) dented by fr all r, s, p,,,. The -bundary f (briefly and is defined by b. Definitin [10]. Let (, ) be a tplgical space and by ( ) ET fr all r, s, p,,, and is defined by ET ( ).. The -eterir f dented 6

14 Definitin [12]. Let 1 and 2 be tw tplgies n a nnempty set. Then 1 is said t be weaker (r carser) than 2 if 1 2. In this case we als say that 2 is strnger (r finer) than 1. Definitin [12]. tplgical space (, ) is said t be a T space if given any tw distinct pints in, there eists an pen set which cntains ne f them but nt the ther. Definitin [12]. tplgical space (, ) is said t be a T1 -space if fr each, y, y, there eist tw pen sets U, V such that U, y U and y V, V. Definitin [12]. tplgical space (, ) is said t be a T 2 - space (r Hausdrff space) if fr each, y, y, there eist tw disint pen sets U, V such that U and y V. Definitin [12]. tplgical space (, ) is said t be regular at a pint if fr every clsed subset F f nt cntaining, there eist tw disint pen sets U, V such that U and F V. tplgical space (, ) is said t be regular space if it is regular at each f its pints. 1.2 Fundamental ntins in fuzzy set and fuzzy relatin In 1965, L.. Zadeh published his famus paper Fuzzy set [29] prviding a new mathematical tl which enables t describe vague r ambiguus ntins. Fuzzy set allws n sharply defined bundaries because f a generalizatin f a characteristic functin with range 0,1 t a membership functin with range [0,1]. 7

15 Let be a classical set f bects, called the universe, whse generic elements are referred. Membership in a classical subset f is ften viewed as a characteristic functin frm t 0,1 such that 1, iff, ( ) 0, iff. The set {0,1} is called a valuatin set. If the valuatin set is allwed t be the real interval 0,1, then is called a fuzzy subset and it is dented by [29]. Definitin [28]. The fuzzy subset f is a set f rdered pairs each cnsists f the element and the assciated membership functin, that is is cmpletely characterized by the set f pairs (, ( )) :. mre cnvenient ntin fr a fuzzy subset was prpsed in [5, 16, 24]. Eample In a space a, b, c, d, e, let ( a,0.3),( b,0.7),( c,0.9),( d,0),( e,0.2) fuzzy subset f. Hence be a ( a ) 0.3, ( b) 0.7, ( c) 0.9, ( d ) 0, and ( e ) 0.2. In the fllwing we shall intrduce sme simple peratins n fuzzy sets. Definitin [14]. Let and be tw fuzzy subsets f. We say that is included in (briefly ) if ( ) ( ) fr all. Definitin [14]. (briefly Let and be tw fuzzy subsets f. We say that and are equal ) if ( ) ( ) fr all. 8

16 Definitin [14]. Let and be tw fuzzy subsets f. We say that and are cmplementary (briefly ( ) c ) if ( ) 1 ( ) fr all. One bviusly always has ( ) Definitin c c. The fllwing eample illustrates Eample Let be a fuzzy subset f such that a, b, c, d ( b,0.73),( c,0),( d,0.8). Then c ( ) ( a,0.9),( b,0.27),( c,1),( d,0.2). and ( a,0.1), Definitin [14]. Let, and C be fuzzy subsets f. The intersectin is the largest fuzzy subset cntained at the same time in and. That is, if C, then ( ) min ( ), ( ) fr all. C Definitin [14]. Let, and C be fuzzy subsets f. The unin is the smallest fuzzy subset that cntains bth and. That is, if C, then ( ) ma ( ), ( ) fr all. C The fllwing eample illustrates Definitin and Definitin Eample Let a, b, c, d, ( a,0.2),( b,0.7),( c,1),( d,0) ( c,0.4),( d,1). Then and ( a,0.5),( b,0.3), ( a,0.2),( b,0.3),( c,0.4),( d,0) ( a,0.5),( b,0.7),( c,1),( d,1). 9, and

17 It is clearly that, and. Similarly fr. Definitin [14]. Let and be tw fuzzy subsets f. The difference ( ) c. is defined by Nte that, ust as in classical sets, the membership value f any element in the null set is zer, and the membership value f any element in the whle set is ne. The apprpriate ntatin fr these ideas is as fllws: fr all, ( ) 0 and ( ) 1. The peratins n classical sets als hld fr fuzzy sets, ecept fr the ecluded middle aims [25]. The ecluded middle aims etended fr fuzzy sets are epressed by where is a fuzzy subset f a space. ( ) c and ( ) c, De Mrgan s principles fr classical sets als hld fr fuzzy sets, as dented by these epressins [25]: ( ) c ( ) c ( ) c, ( ) c ( ) c ( ) c. Fuzzy relatins als map elements f ne space say t anther space say, thrugh the prduct f the tw spaces. Hwever, the strength f the relatin between rdered pairs f the tw spaces is nt measured with the characteristic functin, but rather with a membership functin epressing varius degrees f strength f the relatin n the unit interval 0,1. Hence a fuzzy relatin R is a mapping frm the prduct space t the unit interval 0,1. Definitin [26]. fuzzy relatin R frm a set t a set (r between and ) is a fuzzy set in the prduct, and it is characterized by a membership functin R where R : 0,1. If, then R is knwn as a fuzzy relatin n. 10

18 The fuzzy relatin frm t can be epressed in the frm Eample R ((, y ), (, y )), where and y. R n eample f a fuzzy relatin frm t, where a, b, c, d, e is R (( a, d ),0.2),(( a, e),0),(( b, d ),0.7),(( b, e),0.3),(( c, d ),0),(( c, e),0.8). Definitin [26]. R in Let and y y y 1,, m 1, 2,, n be tw finite sets. The fuzzy relatin can be epressed by an m n matri as the fllwing: R y y y 1 2 n (, y ) (, y ) (, y ) 1 R 1 1 R 1 2 R 1 n (, y ) (, y ) (, y ) 2 R 2 1 R 2 2 R 2 n (, y ) 3 R 3 1. (, y ) (, y ) m R m 1 R m n Eample matri. We can write the fuzzy relatin R given in Eample by the fllwing R d e a b c

19 Since the fuzzy relatins frm t are fuzzy subsets f the prduct, we can use the peratins f fuzzy sets n the fuzzy relatins. Definitin [6]. Let R be a fuzzy relatin in and S be a fuzzy relatin in Z. The cmpsitin f R and S (briefly RS ) is the fuzzy relatin in Z defined by {((, ), RS (, )): RS (, ) ma min R (, ), S (, ) } RS z z z y y z, where, y and z Z. y Eample Cnsider the fllwing tw fuzzy matrices f tw fuzzy relatins R and S Z, where ={a,b,c}, ={m,n,v,w} and Z={h,k,u}. R m n v w a b , c S h k u m n v w

20 Then the fuzzy matri f RS is RS h k u a b c

21 CHPTER 2 GENERTING RELTIONS VI TOPOLOGICL SPCES USING SOME CLSSES OF NER OPEN SETS 14

22 Chapter 2 Generating relatins via tplgical spaces using sme classes f near pen sets 2.1 Near pen sets in tplgical spaces In this sectin, we intrduce sme results n sme classes f near pen sets in tplgical spaces. Lemma [12]. Let be a subset f in a tplgical space (, ) and. Then if and nly if every pen set cntaining meets. Lemma Let be an s-pen (r-clsed) subset f in a tplgical space (, ). Then. Prf. Let be an s-pen subset f. Then. Thus. Since,. Hence. Similarly, we can prve this lemma if is r-clsed. Prpsitin Let be an s-pen (r-clsed) subset f in a tplgical space (, ) and. Then if and nly if every pen set cntaining meets. Prf. Hence Let be an s-pen subset f. Then by Lemma 2.1.2, we have iff, iff every pen set cntaining intersects 15 by Lemma

23 Similarly, we can prve this prpsitin if is r-clsed. Prpsitin Let be an s-pen (r-clsed) subset f in a tplgical space (, ). Then N ( ) N ( ). Prf. Hence Let be an r-clsed subset f. Then by Lemma 2.1.2, we have. N ( ) ( ) ( ) N ( ). Similarly, we can prve this prpsitin if is s-pen. Lemma [12]. Let be a subset f in a tplgical space (, ) and. Then if and nly if there eists an pen set G such that G and G. Lemma Let be an s-clsed (r-pen) subset f in a tplgical space (, ) and. Then. Prf. Let be an s-clsed subset f. Then. Thus. ut, since. Hence. Similarly, we can prve this lemma if is r-pen. Prpsitin Let be an s-clsed (r-pen) subset f in a tplgical space (, ) and in.. Then if and nly if there eists an pen set cntaining cntained 16

24 Prf. Hence Let be an s-clsed subset f. Then by Lemma 2.1.4, we have iff,. iff there eists an pen set cntaining cntained in by Lemma Similarly, we can prve this prpsitin if is r-pen. Prpsitin Let be an s-clsed (r-pen) subset f in a tplgical space (, ). Then N ( ) N ( ) Prf. Let be an r-pen subset f. Then by Lemma 2.1.4, we have Hence N ( ) ( ) ( ) N ( ). Similarly, we can prve this prpsitin if is s-clsed. Lemma [10]. Let be a subset f in a tplgical space (, ) and. Then if and nly if fr each -pen set G cntaining, we have G, where r, p, s,,,. Prf. We shall prve this lemma in the case f prved similarly. Let that and the ther cases can be. Suppse t cntrary that G is a -pen set such G and G. Then G and G. ut G is a - clsed set cntaining. Hence, which is a cntradictin. Thus G. Cnversely suppse that fr each -pen set G cntaining, G. Suppse t cntrary that, then there eists -clsed set H such that H and 17

25 H. Hence H is a -pen set cntaining, and ( H ), which is a cntradictin. Thus. Lemma [10]. Let be a subset f in a tplgical space (, ) and. Then if and nly if there eists a -pen set G such that G, r, p, s,,,. where Prpsitin Let be an s-pen subset f in a tplgical space (, ) and, then each pen set cntaining intersects, where s, p,,,.. If Prf. Let be an s-pen subset f and, where s, p,,,. Since fr each s, p,,,, then. Since is s-pen, then by Prpsitin 2.1.1, we get every pen set cntaining intersects. Prpsitin Let be an r-clsed subset f in a tplgical space (, ) and. Then if and nly if each pen set cntaining intersects s, p,,,., where Prf. Let be an r-clsed subset f. Then s it is a -clsed set s, p,,, iff. Thus, where s, p,,,,. ut. Hence is a clsed set, and iff each pen set cntaining intersects by Lemma Prpsitin Then Let be an r-clsed subset f in a tplgical space (, ) and. if and nly if each -pen set cntaining intersects fr all s, p,,,. 18

26 Prf. Let be an r-clsed subset f. Then s it is a -clsed set fr all s, p,,,. Thus. ut is a clsed set, and. Hence iff, iff each -pen set cntaining intersects by Lemma Prpsitin Let be an s-clsed subset f in a tplgical space (, ) and. If, then there eists a -pen set G such that G, where s, p,,,. Prf. We shall prve this prpsitin in the case f and the ther cases can be prved similarly. Let be an s-clsed subset f. Then. ut is pen set, and s it is -pen set. Thus. Nw if, then. Hence by Lemma 2.1.6, there eists an -pen set G such that G. Prpsitin Let be an r-pen subset f in a tplgical space (, ) and. Then if and nly if there eists an pen set G such that G, where s, p,,, Prf. We shall prve this prpsitin in the case f can be prved similarly. Let be an r-pen subset f and. ut iff, is pen set, and s it is -pen set. Thus and the ther cases. Then. Then iff there eists an pen set G such that G by Lemma

27 Prpsitin Then Let be an r-pen subset f in a tplgical space (, ) and. if and nly if there eists a -pen set G such that G, where s, p,,,. Prf. We shall prve this prpsitin in the case f =s and the ther cases can be prved similarly. Let be an r-pen subset f. Then pen set, and s it is s-pen set. Thus s iff, s. Then. ut iff there eists an s-pen set G such that G by Lemma is 2.2 Generating relatins via tplgical spaces In this sectin we intrduce sme definitins f generating relatins n tplgical spaces using sme classes f near pen sets. Definitin [22]. Let (, ) be a tplgical space. Then the relatin n generating by is dented by R and it is defined by Eample Then Let R (, y ) : cl y.,, a n a, b, c. The family f clsed sets is,, b, c cl a, cl b b, c and cl c b, c. Hence accrding t Definitin 2.2.1, we get R ( a, a),( b, a),( c, a),( b, b),( c, b),( b, c),( c, c).. Definitin Let (, ) be a tplgical space. Then the relatin n generating by the class O ( ) is dented by R and it is defined by (, ) :, where r p s R y cl y 20,,,,,.

28 Eample Let a, b, c, d and,, a, b, d, a, b, d { }. Then { }. RO( ),,{ d},{ a, b}, and RC ( ),,{ a, b, c},{ c, d} Thus r,,, cl c c and cl d c, d cl a cl b a b c Hence accrding t Definitin 2.2.2, we get r r r. R ( a, a),( b, a),( c, a),( a, b),( b, b),( c, b),( c, c),( c, d ),( d, d ). r Prpsitin Let (, ) be a tplgical space. Then the implicatins between R and where r, s, p,,, are given in the fllwing diagram. R, Prf. y using Remark 1.1.5, then fr any y, we have Hence accrding t Definitin and Definitin 2.2.2, we get. 21

29 Definitin [19]. relatin R n a set is said t be an equivalence relatin if it satisfies the fllwing cnditins: i) (, ) R, (refleive). ii) If (, y ) R, then ( y, ) R (symmetric). iii) If (, y ) R and ( y, z ) R, then (, z ) R (transitive). Prpsitin Let (, ) be a tplgical space. Then R and fr all r, s, p,,,. R are refleive relatins n Prf. y using Definitin and Definitin , we have cl and cl fr all, r, s, p,,, Then by Definitin and Definitin 2.2.2, we get Hence R and (, ). R and (, ) R fr all. R are refleive relatins n fr all r, s, p,,,. Prpsitin Let (, ) be a tplgical space. Then R and fr all s, p,,,. R are transitive relatins n Prf. y Let (, ), (, ) y y z R. Then by Definitin 2.2.1, we have cl y cl z. Thus cl y cl z and s cl z (, z ) R. Therefre R is transitive relatin n. and. gain by Definitin 2.2.1, we get Similarly, we can prve R is transitive relatin n fr all s, p,,,. Eample Let a, b, c, d,,, a, b, d, a, b, d be a tplgy n. Then { } RO( ),,{ a},{ b, d}, 22

30 { }, { } { } { { b, c, d }}, and O( ),,{ a},{ a, b, d},{ b, d} SO( ),,{ a},{ a, c},{ a, b, d},{ b, d},{ b, c, d}, PO ( ),,{ a},{ b},{ d},{ a, b},{ a, d},{ a, b, c},{ a, b, d},{ a, c, d},{ b, d}, O ( ),,{ a},{ b},{ d },{ a, b},{ a, c},{ a, d },{ a, b, c},{ a, b, d },{ a, c, d },{ b, d } { O ( ),,{ a},{ b},{ d},{ a, b},{ a, c},{ a, d},{ a, b, c},{ a, b, d},{ a, c, d},{ b, c},{ b, d } Thus { b, c, d },{ c, d } { } }. RC ( ),,{ b, c, d},{ a, c}, { }, C ( ),,{ b, c, d},{ c},{ a, c} { } SC ( ),,{ b, c, d},{ b, d},{ c},{ a, c},{ a}, { } PC ( ),,{ b, c, d},{ a, c, d},{ a, b, c},{ c, d},{ b, c},{ d},{ c},{ b},{ a, c}, { C ( ),,{ b, c, d },{ a, c, d },{ a, b, c},{ c, d},{ b, d},{ b, c},{ d},{ c},{ b},{ a, c} { {} a }, and C ( ),,{ b, c, d },{ a, c, d },{ a, b, c},{ c, d },{ b, d },{ b, c},{ d },{ c},{ b},{ a, d },{ a, c} Hence } { a},{ a, b}.,, cl b cl b cl b b c d cl a cl a cl a a c r, cl c cl c cl c c r 23 r,,, cl d cl d cl d b c d cl a a, cl b b, d, cl c c, cl d b, d, s s s s cl a a, c, cl b b, cl c c, cl d d, p p p p r,,, cl a cl a a, cl b cl b b, cl c cl c c, and. cl d cl d d ccrding t Definitin and Definitin 2.2.2, we get R R r R ( a, a),( c, a),( b, b),( c, b),( d, b),( c, c),( b, d ),( c, d ),( d, d ), R ( a, a),( b, b),( d, b),( c, c),( b, d ),( d, d ), s R ( a, a),( c, a),( b, b),( c, c),( d, d ), and p R R ( a, a),( b, b),( c, c),( d, d ). Then R, R are refleive and transitive relatins n fr all s, p,,,.

31 Lemma [19]. Let (, ) be a tplgical space. Then (, ) is a T1 space if and nly if is a clsed subset f,. Prpsitin Prf. Let (, ) be a tplgical space. Then (, ) is a T1 space if and nly if (, ) :, fr all s, p,,, R R. Let (, ) be a T1 space. Then by Lemma 2.2.1, we have is a clsed subset f,. Thus cl. ut cl cl and s, p,,,. Hence cl. Therefre (, ) :, fr all s, p,,, R R. Cnversely, let R R (, ) :. Then cl, cl fr all fr all. Thus is a clsed set. Hence by Lemma 2.2.1, we have (, ) is a T1 space. Prpsitin Let (, ) be a tplgical space. If (, ) is a T1 space, then R and are equivalence relatins n fr all s, p,,,. R Prf. y using Prpsitin 2.2.4, the prf is bvius. Prpsitin Every finite regular tplgical space is a quasi-discrete tplgical space. Prf. Let (, ) be a finite regular tplgical space and G Since is regular, then. Then G. fr each G, there eists H such that G H and H. 24

32 Thus G H and H G G. Then ( H ) G. G ut ( H ) G, hence G Since is finite, then G H G H G. is pen. Thus G is pen set, and s G is clsed. Therefre (, ) is a quasi-discrete tplgical space. Definitin [15]. The family f all subsets f is a tplgy n called the discrete tplgy and it is dented by. Prpsitin Let (, ) be a quasi-discrete tplgical space. Then i) JO ( ) ii) ( ) fr all J R S,,. JO fr all J P,,. Prf. i) Let G SO( ), then G Thus G G. ut G G G ut SO( ). Then SO( ) Similarly, we can prve O ( ). Since is quasi-discrete, then G G., then G G, that is G. Hence SO( ).... Since is quasi-discrete, then * Nw, let G G and G G. Thus G RO( ). Hence RO( ). ut RO( ). Then RO( ). ii) Let G. Since is quasi-discrete, then G G. Hence G G, since G G. That is G PO ( ). Thus PO ( ). ut PO ( ). Then PO ( ). Similarly, we can prve O( ) O ( ). 25

33 Lemma [15]. Let (, ) be a regular tplgical space. Then fr any tw pints, y either cl y r cl cl cl y. Prpsitin , y Let (, ) be a finite regular tplgical space. Then fr any tw pints either fr all r, s, p,,,. r cl cl y, cl cl y Prf. Let (, ) be a finite regular tplgical space. Then by Prpsitin 2.2.6, is quasi-discrete. Thus by Prpsitin part (i), we have Hence fr any pint RO( ) SO( ) O( )., we have r cl cl cl cl. s Since is regular, then by Lemma 2.2.2, we have fr any tw pints, y cl y r cl cl y. cl Hence fr any tw pints, y either r cl cl y, where r, s, cl cl y ls by using Prpsitin part (ii), we have Hence fr any pint PO ( ) O( ) O ( )., we have Therefre fr any tw pints, y p cl cl cl. either. r cl cl y, where p,, cl cl y. either 26

34 Prpsitin Let (, ) be a regular tplgical space. Then R is symmetric relatin n. Prf. Let (, ) be a regular tplgical space and (, y ). Then cl y. ut cl. Thus cl cl y. Since is regular, then by Lemma 2.2.2, we have cl cl y. Hence y cl, and s ( y, ) relatin n. R R. Therefre R is symmetric Prpsitin Let (, ) be a finite regular tplgical space. Then R is symmetric relatin n fr all r, s, p,,,. Prf. We shall prf this prpsitin in the case f r, and the ther cases can be prved similarly. Let (, ) be a finite regular tplgical space and (, y ) Rr. Then r cl y. ut cl. Thus cl cl y. Hence by Prpsitin 2.2.8, r r we have cl cl y. Then y cl. Thus ( y, ) Rr. Therefre R r is r r r r symmetric relatin n. Prpsitin Let (, ) be a finite regular tplgical space. Then R and R are equivalence relatins fr all s, p,,,. Prf. y using Prpsitin 2.2.2, Prpsitin 2.2.3, Prpsitin and Prpsitin , the prf is bvius. Definitin each pint tplgical space (, ) is said t be a -regular tplgical space, if fr and -clsed set F des nt cntain, there eist tw disint -pen sets G and H such that G and F H, where r, s, p,,,. 27

35 Eample Then Let a, b, c, d and let,, a, b, d, a, b, d be a tplgy n. SO( ),, a, a, c, a, b, d, b, d, b, c, d and SC ( ),, b, c, d, b, d, c, a, c, a. Hence is s-regular, since fr each pint and s-clsed set F where F, there eist tw disint s-pen sets G and H such that G and F H. Prpsitin Let (, ) be a -regular tplgical space. Then fr each tw pints and y f we have either where s, p,,,., cl cl y r cl cl y Prf. We shall prve this prpsitin in the case f and the ther cases can be prved similarly. Let (, ) be -regular tplgical space and let, y. Suppse that cl cl y. Then either cl y r y cl y. Let cl y y. Since cl is an -clsed set des nt cntain, then there eist tw disint -pen sets G and H such that G and. Then cl H. Hence cl y H. ut H is an -clsed set cntaining Therefre ( ) cl cl y H H. cl cl y. Prpsitin Let (, ) be a -regular tplgical space. Then, where s, p,,,. R is symmetric relatin n 28

36 Prf. We shall prve this prpsitin in the case f and the ther cases can be prved similarly. Let (, ) be a -regular tplgical space and (, y ). ut cl. Thus cl cl y cl y R. Then. Since is -regular, then by Prpsitin , we have cl cl y. Hence y cl ( y, ). Therefre R is symmetric relatin n. R, and s Prpsitin Let (, ) be a -regular tplgical space. Then, where s, p,,,. R is equivalence relatin n Prf. y using Prpsitin 2.2.2, Prpsitin and Prpsitin , The prf is bvius. 29

37 CHPTER 3 FUZZ SETS IN TOPOLOGICL SPCES 30

38 Chapter 3 Fuzzy sets in tplgical spaces In this chapter, we intrduced sme results n rugh membership functin, near rugh membership functin and fuzzy sets in tplgical spaces. 3.1 Membership functin In this sectin, we intrduce sme results n membership functin. Lemma Let be a subset f in a tplgical space (, ) and. Then if and nly if fr each subset f where, we have. Prf. Let be a subset f and such that. Since each subset f cntaining, then by Lemma 2.1.1, we have Cnversely, suppse that, fr each subset f where. Then fr any pen set G cntaining, we have is pen set fr. G, we have. Since G is pen set, then. G G. Thus G. Hence by Lemma 2.1.1, we have Lemma Let be a subset f in a tplgical space (, ) and. Then if and nly if there eists a subset f such that and. Prf. Let be a subset f and such that. Then by Lemma 2.1.3, there eists an pen set such that. Hence since is pen. 31

39 Cnveresly, if there eists a subset G f such that G, then by Lemma 2.1.3, we have since G is pen set. Definitin [17]. Let be a base f a tplgy n a finite set. Then the rugh membership functin n f a subset where is ( ),, are the members f cntaining. Thrugh this thesis we shall call membership functin. a membership functin instead f rugh In Definitin 3.1.1, since G : G, G :,, the membership functin n f a subset can be defined by where G are the pen sets cntaining. ( ) G,, G Eample Let 2, 3, 0,1,2, 2,3,4, 3,5 be a base fr a tplgy n a finite set 0,1, 2,3, 4,5, and let 2,4,5 0,1,2. Then 0,1, 2 2, 4,5 1 1 (0), (1), (2) 1, (3) 0, (4), and (5). 3 2 Nte that, the rugh membership functin is a mapping such that where is a tplgy n a finite set and. : 0,1, 32

40 Lemma [17]. i) ii) Let be a subset f in a finite tplgical space (, ) and, if and nly if ( ) 1, b if and nly if 0 ( ) 1. Then iii) is eterir pint f (briefly ET ( ) ) if and nly if ( ) 0. Iqelan [10] intrduced the fllwing definitin fr the near rugh (briefly - rugh) membership functin fr a subset where r, p, s,,,. using the classes f -pen sets, Definitin [10]. Let (, ) be a finite tplgical space. The near rugh (briefly -rugh) membership functin n f a subset, and it is defined by where ( ) : fr all r, p, s,,, : 0,1, 1 if 1 ( ), ( ) min ( ) therwise, is a -pen set,. is Thrugh this thesis we shall call a -membership functin instead f -rugh membership functin, where r, p, s,,,. Lemma [10]. i) Let be a subset f in a finite tplgical space (, ) and, if and nly if ( ) 1. Then ii), b if and nly if 0 ( ) 1 iii) is -eterir pint f (briefly ET ( ) ) if and nly if ( ) 0, fr all r, p, s,,,. 33

41 Eample Let a, b, c, d,,, a, b, d, a, b, d and a, c {. Then we get O ( ),,{ a},{ b},{ d},{ a, b},{ a, d },{ a, b, c},{ a, b, d},{ a, c, d},{ b, d},{ b, c, d }, } { cd, }, O ( ) {,,{ d},{ a, b},{ a, b, d} }, and { O ( ),,{ a},{ b},{ d},{ a, b},{ a, c},{ a, d},{ a, b, c},{ a, b, d},{ a, c, d},{ b, c},{ b, d }, Hence } { b, c, d},{ c, d}. 1 ( a) 1, ( b) 0, ( c), ( d ) 0, ( a), ( b), ( c), ( d ) 0, ( a) 1, ( b) 0, ( c) 1, and ( d ) 0. Therefre b a, c, ET ( ) b, d, b, a, b, c, ET ( ) d, b a, c,, and ET ( ) b, d. Remark b Since, then by Lemma 3.1.4, if and nly if ( ) 0. In Eample 3.1.2, we get a, c, a, b, c, and a, c. Prpsitin Let be an s-pen )r-clsed( subset f in a finite tplgical space (, ) and. Then ( ) 0 if and nly if fr each subset f where ( ) 1, there eists y such that ( y ) 1 and ( y ) 1. Prf. Let be an s-pen subset f and. Hence ( ) 0 iff by Lemma 3.1.3,. Then by Lemma 2.1.2, we have 34

42 iff, iff fr each subset f and 3.1.1, iff there eists y s.t. y,, we have by Lemma iff fr each subset f and ( ) 1, there eists y s.t. ( y ) 1 and ( y ) 1 by Lemma Similarly we can prve this prpsitin if is r-clsed. Prpsitin Let be a subset f in a finite tplgical space (, ) and. Then ( ) 1 if and nly if there eists a subset f s.t. ( ) 1 and fr each y if ( y ) 1, then ( y ) 0. Prf. Let be a subset f and ( ) 1 iff by Lemma 3.1.3,. Then iff there eists a subset f s.t. by Lemma 3.1.2, iff there eists a subset f s.t. ( ) 1 and fr each y if ( y ) 1, then ( y ) 0, by Lemma and since. Lemma Let be a subset f in a tplgical space (, ) and. Then if and nly if fr each subset f such that, where p, s,,,., we have Prf. Let be a subset f and such that p, s,,,. Since is a - pen set fr each, where and p, s,,,, then by Lemma 2.1.5, fr each subset f and, we have. Cnversely, suppse that, fr each subset f such that, we have 35

43 have,, where p, s,,, G where p, s,,,. Then fr any -pen set G cntaining we. S, G since G G. Hence by Lemma 2.1.5, we have. Lemma Let be a subset f in a tplgical space (, ) and. Then if and nly if there eists a subset f such that where p, s,,,. and, Prf. Let be a subset f and such that, where p, s,,,. Then by Lemma 2.1.6, there eists a -pen set such that. Hence there eists a subset f such that since. Cnversely, if there eists a subset f such that p, s,,,, then by Lemma 2.1.6, we have fr all p, s,,,. and, since where is a -pen set Prpsitin Let be an s-pen subset f in a finite tplgical space (, ) and such that ( ) 0. Fr any subset f, if ( ) 1, then there eists y such that ( y ) 1 and ( y ) 1, where s, p,,,. Prf. Let be an s-pen subset f and such that ( ) 0. Then by Lemma 3.1.4, we have every s, p,,,. Hence. Since is s-pen, then. Thus fr. Then by Lemma 3.1.1, we have fr every subset f, if, then. That is there eists y such that y. Hence by Lemma 3.1.3, we have fr every subset, if ( ) 1, then there eists y such that ( y ) 1 and ( y ) 1. 36

44 Prpsitin Let be an r-clsed subset f in a finite tplgical space (, ) and. Then ( ) 0 if and nly if fr each subset f and ( ) 1, there eists y such that ( y ) 1 and ( y ) 1, where s, p,,,. Prf. Let be an r-clsed subset f. Then s, p,,,. Hence ( ) 0 iff. Thus by Lemma 3.1.4, where s, p,,,,, where iff, iff fr each subset f and, we have by Lemma 3.1.1, iff fr each subset f and, there eists y s.t. ( y ) 1 and ( y ) 1 by Lemma Prpsitin Then Let be an r-clsed subset f in a finite tplgical space (, ) and. if and nly if fr each subset f and ( ) 1, such that ( ) 1 and ( y ) 0, y where s, p,,,. there eists y Prf. Let be an r-clsed subset f. Then s, p,,,. Hence iff,. Thus, where iff fr every subset f and, we have by Lemma 3.1.5, iff there eists y such that ( ) 1 and ( y ) 0 by Lemma y and Lemma 3.1.4, where s, p,,,. 37

45 Prpsitin such that Let be an s-clsed subset f in a finite tplgical space (, ) and. Then there eists a subset f such that ( ) 1 and fr every y, if ( ) 1, then ( y ) 0 y, where s, p,,,. Prf. Thus Let be an s-clsed subset f and such that. Then, where s, p,,,. Hence since.. Then by Lemma 3.1.6, there eists a subset f such that. Therefre by Lemma and Lemma 3.1.4, there eists a subset f such that ( ) 1 and fr every y, if ( ) 1, then ( y ) 0 y, where s, p,,,. Prpsitin Let be an r-pen subset f in a finite tplgical space (, ) and. Then ( ) 1 if and nly if there eists a subset f such that ( ) 1 and fr each y, if ( y ) 1, then ( y ) 0, where s, p,,,. Prf. Let be an r-pen subset f and where s, p,,,. Hence. Then. Thus, ( ) 1 iff iff by Lemma 3.1.4,, iff there eists a subset f such that 3.1.2, and by Lemma iff there eists a subset f such that ( ) 1 and fr every y, if ( y ) 1, then ( y ) 0, where s, p,,, by Lemma

46 Prpsitin Then Let be an r-pen subset f in a finite tplgical space (, ) and. if and nly if there eists a subset f such that ( ) 1 and fr every y, if ( ) 1, then ( y ) 0, y where s, p,,,. Prf. Let be an r-pen subset f and. Then. Thus, where s, p,,,. Hence iff, iff there eists a subset f such that by Lemma 3.1.6, iff there eists a subset f such that ( ) 1 and fr every y, if ( ) 1, then ( y ) 0 y, where s, p,,, by Lemma and Lemma Lemma Let (, ) be a tplgical space and. Then if and nly if fr each subset f such that, we have { }. Prf. Let (, ) be a tplgical space and such that. Since is pen set fr any subset f, then by Definitin 1.1.9, such that, we have { }. Cnversely, let G be any pen set cntaining. Then { } G. Thus G { }, since G is pen. Hence by Definitin 1.1.9, we have. Prpsitin Let be a subset f a finite tplgical space (, ) and such that. Then fr each subset f and ( ) 1, there eists y ther than such that ( y ) 1 and ( y ) 0. 39

47 Prf. Let be a subset f and such that. Then by Lemma 3.1.7, fr each subset f and, ther than such that y { } we have { }. Thus there eists y. Hence by Lemma 3.1.3, ( y ) 1 and ( y ) 0, where y. Definitin Let (, ) be a tplgical space. The pint p is said t be a -cluster pint f a subset f fr all r, p, s,,, p, we have { p}. if fr each subset f such that The set f all -cluster pints f is called the -derived set f and it is dented by fr all r, p, s,,,. Prpsitin Let be a subset f in a finite tplgical space (, ) and such that. Then fr each subset f and ( ) 1, there eists y ther than such that ( ) 1 and ( ) 0, y y where r, s, p,,,. Prf. Let be a subset f and fr each subset f and such that. Then by Definitin 3.1.3,, we have { }. Thus there eists y ther than such that y { }. Hence by Lemma 3.1.4, we have ( ) 1 and ( ) 0 y, where r, s, p,,, y. Prpsitin Let be a subset f in a finite tplgical space (, ) and such that ( ) 1. If there eists y ther than such that ( y ) 1, where are the pen sets cntaining, then and ( y ) 1. 40

48 Prf. Let be a subset f and such that ( ) 1. Then fr the pen sets cntaining, we have. ssume that there eists y ther than such that ( y ) 1. Then fr the pen sets y cntaining y, we have y. Thus y. Then ( y ) 1. ut G fr each pen set G cntaining, and s y G. Hence each pen set G cntaining cntains a pint ther than frm which is y. Therefre by Definitin 1.1.9, we have and ( y ) 1. Prpsitin Let be a subset f in a finite tplgical space (, ) and. If there eists y ther than such that ( y ) 0, ( y) ( ) and ( y ) 1, where are the pen sets cntaining, then. Prf. Let be a subset f and. Suppse that, there eists y ther than s.t. ( y ) 0, ( y) ( ) and ( y ) 1, where is any pen set cntaining. Then fr the pen sets y cntaining y, we have y. If, then ( ) ( y), which is a cntradictin, s we have y. Since is y the smallest pen set cntaining, then. Since ( y ) 0, then by Lemma y 3.1.3, we have y. S, ( ) ; that is, there eists z such that z ( y ), where z pen set G cntaining. Then Therefre by Definitin 1.1.9, we have y. Thus z { }. ut G { }, G such that G.. G fr each Prpsitin Let, be tw disint pen subsets f in a finite tplgical space (, ) and. If ( ) 1 (resp. ( ) 1), then ( ) 0 (resp. ( ) 0 ). 41

49 Prf. Let, be tw disint pen subsets f. Then is clsed set cntaining. Thus. Hence. Nw let such that ( ) 1, then by Lemma ut is an pen set. Thus Therefre by Lemma 3.1.3, we get ( ) 0.. Hence. We can use Prpsitin t get the fllwing remark. Remark (, ), then If and are tw disint pen subsets f in a finite tplgical space. Prpsitin Let be an s-pen (r-clsed) subset f in a finite tplgical space (, ) and let be any subset f such that. If ( ) 1 (resp. ( ) 0 ) fr sme, then ( ) 0 (resp. ( ) 1). Prf. Let be an s-pen subset f and let be any subset f such that. Since and are tw disint pen subsets f, then by Remark 3.1.2, we get. Hence ( since is s-pen). Nw, let such that ( ) 1. Then by Lemma 3.1.3, we have. Thus. Therefre ( ) 0. Similarly, we can prve this prpsitin if is r-clsed. Prpsitin Let (, ) be a finite tplgical space. Then (, ) is a T - space if and nly if fr each tw distinct pints, y f, there eists a subset G f such that ( ) 1, ( y ) 1 r ( y ) 1, ( ) 1. G G G G 42

50 Prf. Let (, ) be a finite tplgical space. If (, ) is a T - space, then fr each tw distinct pints, y f, there eists an pen set G such that G, y G r y G, G. Suppse that G and y G. Then G and y G, since G is pen. Hence by Lemma 3.1.3, we have ( ) 1 and ( y ) 1. G Cnversely, let, y such that y and let G be a subset f such that G ( ) 1 and ( y ) 1. Then by Lemma 3.1.3, we have G G G and y G. Since G is pen set, then (, ) is a T - space. Prpsitin Let (, ) be a finite tplgical space. Then (, ) is a T1 - space if and nly if fr each tw distinct pints, y f, there eist tw subsets, f such that ( ) 1, ( y ) 1, ( y ) 1 and ( ) 1. Prf. Let (, ) be a finite tplgical space. If (, ) is a T1 - space, then fr each tw distinct pints, y f, there eist tw pen subsets, f such that, y, y and. Then, y, y and, since, are pen sets. Hence by Lemma 3.1.3, we have ( ) 1, ( y) 1, ( y ) 1 and ( ) 1. Cnversely, let, y such that y, and let, be tw subsets f such that ( ) 1, ( y ) 1, ( y ) 1 and ( ) 1. Then by Lemma 3.1.3, we have, y, y and. Since, are tw pen sets, then (, ) is a T1 - space. Prpsitin Let (, ) be a finite tplgical space. Then (, ) is a T 2 - space (Hausdrff space) if and nly if fr each tw distinct pints, y f there eist tw subsets, f such that ( ) 1, ( y) 1 and fr any pint z f, if ( z ) 1(resp. ( z ) 1), then ( z ) 1 (resp. ( z ) 1). 43

51 Prf. Let (, ) be a finite tplgical space. If (, ) be a T 2 - space, then fr each tw distinct pints, y f there eist tw disint pen subsets, f such that and y. Then, y and since, are disint and pen sets. Hence by Lemma and Prpsitin , we have ( ) 1, ( y) 1 and fr any z, if ( z ) 1 (resp. ( z ) 1), then ( z ) 0 (resp. ( z ) 0 ). Cnversely, let, y such that y and let, be tw subsets f such that ( ) 1, ( y) 1 and fr any pint z f, if ( z ) 1 (resp. ( z ) 1), then ( z ) 1 (resp. ( z ) 1). Then by Lemma 3.1.3, we have, y and. Since, are tw pen sets, then (, ) is a T 2 - space. 3.2 Fuzzy sets in tplgical spaces In this sectin we intrduce sme types f fuzzy sets by using - membership functin, where r, p, s,,,. Definitin [17]. Let be a subset f in a finite tplgical space (, ). The fuzzy set f is dented by and it is defined by (, ( ) :. Definitin [10]. Let (, ) be a finite tplgical space and. The -fuzzy set f is dented by and it is defined by (, ( ) :, where r, p, s,,,. Eample Let a, b, c, d,,, a, b, d, a, b, d, and a, c { 44. Then we get O ( ),,{ a},{ b},{ d},{ a, b},{ a, d },{ a, b, c},{ a, b, d},{ a, c, d},{ b, d},{ b, c, d }, } { cd, },

52 O ( ) {,,{ d},{ a, b},{ a, b, d} }, and { O ( ),,{ a},{ b},{ d},{ a, b},{ a, c},{ a, d},{ a, b, c},{ a, b, d},{ a, c, d},{ b, c},{ b, d }, Hence Therefre } { b, c, d},{ c, d} ( a), ( b), ( c), ( d ) 0, ( a), ( a), ( c), ( d ) 0, ( a) 1, ( b) 0, ( c), ( d ) 0, 3 ( a) 1, ( b) 0, ( c) 1, and ( d ) a,, b,, c,,( d,0), a 1 1 1,,,,,,(,0), 3 b 3 c 2 d 1 ( a,1),( b,0), c,,( d,0), and 3 ( a,1),( b,0),( c,1),( d,0). Prpsitin that Let and be tw subsets f in a finite tplgical space (, ) such. Then (i). (ii) fr all r, p, s,,,. Prf. (i) Let and be tw subsets f such that where Thus. Then ( ) ( ),, are the pen sets cntaining. ( ) ( ),. 45

53 Hence ( ) ( ),. That is ( ) ( ),. Therefre. (ii) If ( ) 1, we have finishing the prf. S, we have tw cases: Case (1) If ( ) 1 fr sme, where r p s,,,,,, then 1 ( ). Thus there eists a -pen set G such that G. Then there eists a -pen set G such that G, since. Hence 1 ( ). Then ( ) 1. Case (2) If ( ) 1 and ( ) 1, then fr all -pen set cntaining, since. Then fr all -pen set cntaining. Thus min ( ) min ( ) fr all r, p, s,,,. Hence ( ) ( ),. Therefre fr all r, p, s,,,. Eample Let,, a, b, d, a, b, d be a tplgy n a, b, c, d a, b, a, b, d, C a, c, d, D a and E c, d 46. Then PO ( ),,{ a},{ b},{ d},{ a, b},{ a, d},{ a, b, c},{ a, b, d},{ a, c, d},{ b, d}, SO( ),,{ a},{ a, c},{ a, b, d},{ b, d},{ b, c, d}, and O ( ),,{ a},{ a, b, d},{ b, d}., and let

54 Hence ( a,1), b,, c,, d,, ( a,1),( b,1), c,,( d,1), C ( a,1), b,, c,, d,, D ( a,1),( b,0), c,,( d,0), 4 s s s s ( a,1), b,, c,, d,, ( a,1),( b,1), c,,( d,1), C ( a,1), b,,( c,1), d,, 2 2 D ( a,1),( b,0),( c,0),( d,0), C p ( a,1),( b,0),( c,1),( d,1), and E ( a,0), b,,,,,. 3 c 2 d 3 Nte that, D, D and D. s s s Remark The cnverse f Prpsitin is nt true in general as the fllwing eample illustrates. Eample be the tplgical space given in Eample If a, b Let (, ) and C a c d,,, then ( a,1), b,, c,, d, and C ( a,1), b,, c,, d, Hence C, but C. 47

55 Prpsitin Let and be tw subsets f in a finite tplgical space (, ). Then 1) ( ) aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa a 2) ( ) aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa a 3) ( ), r, p, s,,, aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa 4) ( ), r, p, s,,, aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa Prf. Let and be tw subsets f in a finite tplgical space (, ). 1) Let C. Then ( ) min ( ), ( ),. C Nw, since and, then by Prpsitin 3.2.1, we have ( ) and ( ). aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa a aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa a Thus ( ) ( ) and ( ) ( ),. Hence Therefre ( ) ( ) min ( ), ( ),. C ( ) C. 2) Let C. Then aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa ( ) ma ( ), ( ),. C Nw, since and, then by Prpsitin 3.2.1, we have ( ) and ( ). aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa a Thus Hence aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa a ( ) ( ) and ( ) ( ),. ( ) ma ( ), ( ) ( ),. C 48

56 Therefre ( ) C. aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa The prfs f parts (3) and (4) are similar. Prpsitin Let be a subset f in a finite tplgical space (, ). Then c c ( ) ( ). aaaaaaaaaaaaaaaaaaaaaaaaaaaaa Prf. Let be a subset f in a finite tplgical space (, ), and let C c ( ). Then ( ) 1 ( ),. C Nw, we have where are the pen sets cntaining. c ( ) c ( ), c ut ( ) ( ) ( ) Thus Hence c. S, ( ) ( ). ( ) c c c Therefre ( ) ( ). ( ) ( ) 1 1 ( ). c ( ) C ( ),. aaaaaaaaaaaaaaaaaaaaaaaaaaaaa Prpsitin Prf. Let and be tw subsets f in a finite tplgical space (, ). Then ( ). aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa Let and be tw subsets f. Then by Prpsitin part 1, we have 49

57 c c ( ) ( ) ( ). aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa aaaaaaaaaaaaaaaaaaaaaaa Hence by Prpsitin 3.2.3, we get c ( ) ( ). aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa Remark c c In general, fr any subset f in a tplgical space (, ), ( ) ( ), where r, p, s,,,. The fllwing eample illustrates Remark aaaaaaaaaaaaaaaaaaaaaaaa Eample Let a, b, c, d,,, a, b, d, a, b, d, and C a, c, d C 1 1 ( a,1), b s,,(,1),,, 2 c d 2 and c 1 1 ( ) ( a,0), b,,( c,0), d, s C 4 4. aaaaaaaaaaaaaaaaaaaaaaaa. Then Hence c 1 1 c ( sc ) ( a,0), b,,( c,0), d, s ( C ). 2 2 aaaaaaaaaaaaaaaaaaaaaaaa Definitin [16]. Let be the fuzzy set f a subset f and 0,1. Then the cut (resp. strng cut) f is dented by (resp. ), and it is defined by the crisp set : ( ) resp. : ( ), where ( ) is the membership functin f t. The fllwing definitins intrduce the cncepts f cut, strng cut, cut and strng cut f fuzzy sets in tplgical spaces using the membership functin and -membership functin, where r, p, s,,, 0,1. 50 and

58 Definitin Let be the fuzzy set f a subset f in a finite tplgical space (, ) and 0,1. Then the cut (resp. strng cut) f is dented by resp. Definitin (, ), and it is defined by the crisp set : ( ) Let be the -fuzzy set f a subset f in a finite tplgical space where r, p, s,,,. Then the cut (resp. strng cut) is dented by resp., and it is defined by the crisp set where 0,1. : ( ) resp. : ( ). resp. : ( ), Eample Let (, ) be the tplgical space given in Eample 3.2.2, we get Then s ( a,1), b,, c,, d,, ( a,1), b,, c,, d, S S a, b, c, d, a, a, a, 1 1 S 3 3 S a, b, c, d, and a. Lemma [16]. Let and be tw fuzzy subsets f. Then i) iff ii) iff fr each 0,1, fr each 0,1. 51

59 Prpsitin , Let, be tw subsets f in a finite tplgical space (, ). If then fr all 0,1, we have i) and, ii) and fr all r, p, s,,,, Prf. i) Let, be tw subsets f such that, and let 0,1. Then by Prpsitin 3.2.1, we have. Thus by Lemma 3.2.1, we have and fr all 0,1. ii) The prf is similar t part (i). Remark In tplgical spaces, the strng 0 cut f is (i.e. 0 1 cut f is ( i.e. 1 ). Mrever, the strng 0 cut f is ) and the (i.e. 0 ) and the 1 cut f is (i.e. 1 ). Lemma [16]. Let,, C, D and E be fuzzy subsets f such that C, D and E ( ) c i).. Then fr all 0,1 ii) ( C ) and ( D). iii) ( C ) and ( D)., we have iv) (1 ) ( E) ( ) c. Prpsitin Let, be tw subsets f in a finite tplgical space (, ). Then fr all 0,1, we have i) ( ) and ( ). ii) ( ) and ( ). 52

60 iii) ( ) and ( ). iv) ( ) and ( ). Where r, p, s,,,. Prf. i) Let and be tw subsets f and 0,1. Since and, then by Prpsitin 3.2.5, we have ( ), ( ), ( ) and ( ). Hence ( ) and ( ) fr all 0,1. The prf f (ii), (iii) and (iv) are similarly as in (i). 53

61 CHPTER 4 FUZZ SETS IN PRODUCT TOPOLOGICL SPCES 54

62 Chapter 4 Fuzzy sets in prduct tplgical spaces The aim f this chapter is t intrduce sme results in the prduct tplgy using fuzzy sets and sme classes f near pen sets. 4.1 inary prduct in tplgical spaces In this sectin, we intrduce sme results n prduct tplgy using sme classes f near pen sets. Definitin [19]. Let and be tw sets. The prduct set f and is dented by and it is defined by ( a, b) : a, b. Each subclass f is a relatin frm t. Eample Let 1,2 and a, b. Then ( 1, a),(1, b),(2, a),(2, b). Definitin [13]. be tw tplgical spaces. The prduct tplgy Let (, ) and (, ) n is the tplgy generated by taken the cllectin G H : G, H as a base. The pair, is called the prduct tplgical space. 55

63 Eample d. Let a, b, c, d, e,,,,,, and,, Then the base f the prduct tplgy is Hence a b a b ( a, d ),( a, e),( b, d ),( b, e), ( a, d ),( b, d ).,, ( a, d ),( b, d ),( c, d ), ( a, d ),( a, e), ( a, d ), ( b, d ),( b, e), ( b, d ), a d b d c d a d a e a d b d b e b d,, (, ),(, ),(, ), (, ),(, ), (, ), (, ),(, ), (, ), ( a, d ),( a, e),( b, d ),( b, e), ( a, d ),( b, d ), ( a, d ),( a, e),( b, d ), ( a, d ), ( b, d ), ( c, d ),( a, e), ( a, d ),( b, d ),( c, d ),( b, e), ( a, d ),( b, d ),( c, d ),( a, e), ( b, e ), ( a, d a e b d b e a d a e b d b e a d a e b d ),(, ),(, ),(, ), (, ),(, ),(, ),(, ), (, ),(, ),(, ). Prpsitin [27]. Let, be tw subsets f, in the tplgical spaces (, ), (, ) respectively, and let,. Then be a subset f in the prduct tplgical space. Prf. Let, be tw subsets f, respectively, and Let (, y ) ( ). Then there eists an pen set G in such that (, y ) G. ut G ( H K ), where H, K and. Thus there eists 0 such that Thus H 0 and y K 0, where H and 0 K 0 (, y ) H K H K. 0 0 H and y K Hence Then and y. Thus (, y ). Hence ( ) (1). 56

A new Type of Fuzzy Functions in Fuzzy Topological Spaces

A new Type of Fuzzy Functions in Fuzzy Topological Spaces IOSR Jurnal f Mathematics (IOSR-JM e-issn: 78-578, p-issn: 39-765X Vlume, Issue 5 Ver I (Sep - Oct06, PP 8-4 wwwisrjurnalsrg A new Type f Fuzzy Functins in Fuzzy Tplgical Spaces Assist Prf Dr Munir Abdul

More information

Homology groups of disks with holes

Homology groups of disks with holes Hmlgy grups f disks with hles THEOREM. Let p 1,, p k } be a sequence f distinct pints in the interir unit disk D n where n 2, and suppse that fr all j the sets E j Int D n are clsed, pairwise disjint subdisks.

More information

Chapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms

Chapter Summary. Mathematical Induction Strong Induction Recursive Definitions Structural Induction Recursive Algorithms Chapter 5 1 Chapter Summary Mathematical Inductin Strng Inductin Recursive Definitins Structural Inductin Recursive Algrithms Sectin 5.1 3 Sectin Summary Mathematical Inductin Examples f Prf by Mathematical

More information

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 4. Function spaces

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 4. Function spaces SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 4 Fall 2008 IV. Functin spaces IV.1 : General prperties (Munkres, 45 47) Additinal exercises 1. Suppse that X and Y are metric spaces such that X is cmpact.

More information

MAKING DOUGHNUTS OF COHEN REALS

MAKING DOUGHNUTS OF COHEN REALS MAKING DUGHNUTS F CHEN REALS Lrenz Halbeisen Department f Pure Mathematics Queen s University Belfast Belfast BT7 1NN, Nrthern Ireland Email: halbeis@qub.ac.uk Abstract Fr a b ω with b \ a infinite, the

More information

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 4. Function spaces

SOLUTIONS TO EXERCISES FOR. MATHEMATICS 205A Part 4. Function spaces SOLUTIONS TO EXERCISES FOR MATHEMATICS 205A Part 4 Fall 2014 IV. Functin spaces IV.1 : General prperties Additinal exercises 1. The mapping q is 1 1 because q(f) = q(g) implies that fr all x we have f(x)

More information

SEMILATTICE STRUCTURES ON DENDRITIC SPACES

SEMILATTICE STRUCTURES ON DENDRITIC SPACES Vlume 2, 1977 Pages 243 260 http://tplgy.auburn.edu/tp/ SEMILATTICE STRUCTURES ON DENDRITIC SPACES by T. B. Muenzenberger and R. E. Smithsn Tplgy Prceedings Web: http://tplgy.auburn.edu/tp/ Mail: Tplgy

More information

Admissibility Conditions and Asymptotic Behavior of Strongly Regular Graphs

Admissibility Conditions and Asymptotic Behavior of Strongly Regular Graphs Admissibility Cnditins and Asympttic Behavir f Strngly Regular Graphs VASCO MOÇO MANO Department f Mathematics University f Prt Oprt PORTUGAL vascmcman@gmailcm LUÍS ANTÓNIO DE ALMEIDA VIEIRA Department

More information

A proposition is a statement that can be either true (T) or false (F), (but not both).

A proposition is a statement that can be either true (T) or false (F), (but not both). 400 lecture nte #1 [Ch 2, 3] Lgic and Prfs 1.1 Prpsitins (Prpsitinal Lgic) A prpsitin is a statement that can be either true (T) r false (F), (but nt bth). "The earth is flat." -- F "March has 31 days."

More information

Computational modeling techniques

Computational modeling techniques Cmputatinal mdeling techniques Lecture 4: Mdel checing fr ODE mdels In Petre Department f IT, Åb Aademi http://www.users.ab.fi/ipetre/cmpmd/ Cntent Stichimetric matrix Calculating the mass cnservatin relatins

More information

Revisiting the Socrates Example

Revisiting the Socrates Example Sectin 1.6 Sectin Summary Valid Arguments Inference Rules fr Prpsitinal Lgic Using Rules f Inference t Build Arguments Rules f Inference fr Quantified Statements Building Arguments fr Quantified Statements

More information

CHAPTER 3 INEQUALITIES. Copyright -The Institute of Chartered Accountants of India

CHAPTER 3 INEQUALITIES. Copyright -The Institute of Chartered Accountants of India CHAPTER 3 INEQUALITIES Cpyright -The Institute f Chartered Accuntants f India INEQUALITIES LEARNING OBJECTIVES One f the widely used decisin making prblems, nwadays, is t decide n the ptimal mix f scarce

More information

A Few Basic Facts About Isothermal Mass Transfer in a Binary Mixture

A Few Basic Facts About Isothermal Mass Transfer in a Binary Mixture Few asic Facts but Isthermal Mass Transfer in a inary Miture David Keffer Department f Chemical Engineering University f Tennessee first begun: pril 22, 2004 last updated: January 13, 2006 dkeffer@utk.edu

More information

Bootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) >

Bootstrap Method > # Purpose: understand how bootstrap method works > obs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(obs) > Btstrap Methd > # Purpse: understand hw btstrap methd wrks > bs=c(11.96, 5.03, 67.40, 16.07, 31.50, 7.73, 11.10, 22.38) > n=length(bs) > mean(bs) [1] 21.64625 > # estimate f lambda > lambda = 1/mean(bs);

More information

1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp

1996 Engineering Systems Design and Analysis Conference, Montpellier, France, July 1-4, 1996, Vol. 7, pp THE POWER AND LIMIT OF NEURAL NETWORKS T. Y. Lin Department f Mathematics and Cmputer Science San Jse State University San Jse, Califrnia 959-003 tylin@cs.ssu.edu and Bereley Initiative in Sft Cmputing*

More information

Finite Automata. Human-aware Robo.cs. 2017/08/22 Chapter 1.1 in Sipser

Finite Automata. Human-aware Robo.cs. 2017/08/22 Chapter 1.1 in Sipser Finite Autmata 2017/08/22 Chapter 1.1 in Sipser 1 Last time Thery f cmputatin Autmata Thery Cmputability Thery Cmplexity Thery Finite autmata Pushdwn autmata Turing machines 2 Outline fr tday Finite autmata

More information

MODULE FOUR. This module addresses functions. SC Academic Elementary Algebra Standards:

MODULE FOUR. This module addresses functions. SC Academic Elementary Algebra Standards: MODULE FOUR This mdule addresses functins SC Academic Standards: EA-3.1 Classify a relatinship as being either a functin r nt a functin when given data as a table, set f rdered pairs, r graph. EA-3.2 Use

More information

An Introduction to Complex Numbers - A Complex Solution to a Simple Problem ( If i didn t exist, it would be necessary invent me.

An Introduction to Complex Numbers - A Complex Solution to a Simple Problem ( If i didn t exist, it would be necessary invent me. An Intrductin t Cmple Numbers - A Cmple Slutin t a Simple Prblem ( If i didn t eist, it wuld be necessary invent me. ) Our Prblem. The rules fr multiplying real numbers tell us that the prduct f tw negative

More information

THE FINITENESS OF THE MAPPING CLASS GROUP FOR ATOROIDAL 3-MANIFOLDS WITH GENUINE LAMINATIONS

THE FINITENESS OF THE MAPPING CLASS GROUP FOR ATOROIDAL 3-MANIFOLDS WITH GENUINE LAMINATIONS j. differential gemetry 50 (1998) 123-127 THE FINITENESS OF THE MAPPING CLASS GROUP FOR ATOROIDAL 3-MANIFOLDS WITH GENUINE LAMINATIONS DAVID GABAI & WILLIAM H. KAZEZ Essential laminatins were intrduced

More information

READING STATECHART DIAGRAMS

READING STATECHART DIAGRAMS READING STATECHART DIAGRAMS Figure 4.48 A Statechart diagram with events The diagram in Figure 4.48 shws all states that the bject plane can be in during the curse f its life. Furthermre, it shws the pssible

More information

Equilibrium of Stress

Equilibrium of Stress Equilibrium f Stress Cnsider tw perpendicular planes passing thrugh a pint p. The stress cmpnents acting n these planes are as shwn in ig. 3.4.1a. These stresses are usuall shwn tgether acting n a small

More information

Kinematic transformation of mechanical behavior Neville Hogan

Kinematic transformation of mechanical behavior Neville Hogan inematic transfrmatin f mechanical behavir Neville Hgan Generalized crdinates are fundamental If we assume that a linkage may accurately be described as a cllectin f linked rigid bdies, their generalized

More information

FINITE BOOLEAN ALGEBRA. 1. Deconstructing Boolean algebras with atoms. Let B = <B,,,,,0,1> be a Boolean algebra and c B.

FINITE BOOLEAN ALGEBRA. 1. Deconstructing Boolean algebras with atoms. Let B = <B,,,,,0,1> be a Boolean algebra and c B. FINITE BOOLEAN ALGEBRA 1. Decnstructing Blean algebras with atms. Let B = be a Blean algebra and c B. The ideal generated by c, (c], is: (c] = {b B: b c} The filter generated by c, [c), is:

More information

AIP Logic Chapter 4 Notes

AIP Logic Chapter 4 Notes AIP Lgic Chapter 4 Ntes Sectin 4.1 Sectin 4.2 Sectin 4.3 Sectin 4.4 Sectin 4.5 Sectin 4.6 Sectin 4.7 4.1 The Cmpnents f Categrical Prpsitins There are fur types f categrical prpsitins. Prpsitin Letter

More information

Support-Vector Machines

Support-Vector Machines Supprt-Vectr Machines Intrductin Supprt vectr machine is a linear machine with sme very nice prperties. Haykin chapter 6. See Alpaydin chapter 13 fr similar cntent. Nte: Part f this lecture drew material

More information

- 6 - UNIQUENESS OF A ZARA GRAPH ON 126 POINTS AND NON-EXISTENCE OF A COMPLETELY REGULAR TWO-GRAPH ON. A. Blokhuis and A.E.

- 6 - UNIQUENESS OF A ZARA GRAPH ON 126 POINTS AND NON-EXISTENCE OF A COMPLETELY REGULAR TWO-GRAPH ON. A. Blokhuis and A.E. - 6 - UNIQUENESS OF A ZARA GRAPH ON 126 POINTS AND NON-EXISTENCE OF A COMPLETELY REGULAR TWO-GRAPH ON 288 POINTS by A. Blkhuis and A.E. Bruwer VecUc.a.:ted :t J.J. SeA-de.. n :the ec L6-tn 015 11M ftet.ulemen:t.

More information

Part 3 Introduction to statistical classification techniques

Part 3 Introduction to statistical classification techniques Part 3 Intrductin t statistical classificatin techniques Machine Learning, Part 3, March 07 Fabi Rli Preamble ØIn Part we have seen that if we knw: Psterir prbabilities P(ω i / ) Or the equivalent terms

More information

Copyright Paul Tobin 63

Copyright Paul Tobin 63 DT, Kevin t. lectric Circuit Thery DT87/ Tw-Prt netwrk parameters ummary We have seen previusly that a tw-prt netwrk has a pair f input terminals and a pair f utput terminals figure. These circuits were

More information

A crash course in Galois theory

A crash course in Galois theory A crash curse in Galis thery First versin 0.1 14. september 2013 klkken 14:50 In these ntes K dentes a field. Embeddings Assume that is a field and that : K! and embedding. If K L is an extensin, we say

More information

A Simple Set of Test Matrices for Eigenvalue Programs*

A Simple Set of Test Matrices for Eigenvalue Programs* Simple Set f Test Matrices fr Eigenvalue Prgrams* By C. W. Gear** bstract. Sets f simple matrices f rder N are given, tgether with all f their eigenvalues and right eigenvectrs, and simple rules fr generating

More information

THE DEVELOPMENT OF AND GAPS IN THE THEORY OF PRODUCTS OF INITIALLY M-COMPACT SPACES

THE DEVELOPMENT OF AND GAPS IN THE THEORY OF PRODUCTS OF INITIALLY M-COMPACT SPACES Vlume 6, 1981 Pages 99 113 http://tplgy.auburn.edu/tp/ THE DEVELOPMENT OF AND GAPS IN THE THEORY OF PRODUCTS OF INITIALLY M-COMPACT SPACES by R. M. Stephensn, Jr. Tplgy Prceedings Web: http://tplgy.auburn.edu/tp/

More information

NOTE ON APPELL POLYNOMIALS

NOTE ON APPELL POLYNOMIALS NOTE ON APPELL POLYNOMIALS I. M. SHEFFER An interesting characterizatin f Appell plynmials by means f a Stieltjes integral has recently been given by Thrne. 1 We prpse t give a secnd such representatin,

More information

NUMBERS, MATHEMATICS AND EQUATIONS

NUMBERS, MATHEMATICS AND EQUATIONS AUSTRALIAN CURRICULUM PHYSICS GETTING STARTED WITH PHYSICS NUMBERS, MATHEMATICS AND EQUATIONS An integral part t the understanding f ur physical wrld is the use f mathematical mdels which can be used t

More information

Module 4: General Formulation of Electric Circuit Theory

Module 4: General Formulation of Electric Circuit Theory Mdule 4: General Frmulatin f Electric Circuit Thery 4. General Frmulatin f Electric Circuit Thery All electrmagnetic phenmena are described at a fundamental level by Maxwell's equatins and the assciated

More information

Complex Fuzzy Group Based on Complex Fuzzy Space

Complex Fuzzy Group Based on Complex Fuzzy Space Glbal Jurnal f Pure and Applied Mathematics. ISSN 973-768 Vlume, Number (6, pp. 433-45 Research India Publicatins http://www.ripublicatin.cm Cmple Fuzz Grup Based n Cmple Fuzz Space Abdallah Al-Husban

More information

Pressure And Entropy Variations Across The Weak Shock Wave Due To Viscosity Effects

Pressure And Entropy Variations Across The Weak Shock Wave Due To Viscosity Effects Pressure And Entrpy Variatins Acrss The Weak Shck Wave Due T Viscsity Effects OSTAFA A. A. AHOUD Department f athematics Faculty f Science Benha University 13518 Benha EGYPT Abstract:-The nnlinear differential

More information

Pattern Recognition 2014 Support Vector Machines

Pattern Recognition 2014 Support Vector Machines Pattern Recgnitin 2014 Supprt Vectr Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recgnitin 1 / 55 Overview 1 Separable Case 2 Kernel Functins 3 Allwing Errrs (Sft

More information

Interference is when two (or more) sets of waves meet and combine to produce a new pattern.

Interference is when two (or more) sets of waves meet and combine to produce a new pattern. Interference Interference is when tw (r mre) sets f waves meet and cmbine t prduce a new pattern. This pattern can vary depending n the riginal wave directin, wavelength, amplitude, etc. The tw mst extreme

More information

The Electromagnetic Form of the Dirac Electron Theory

The Electromagnetic Form of the Dirac Electron Theory 0 The Electrmagnetic Frm f the Dirac Electrn Thery Aleander G. Kyriaks Saint-Petersburg State Institute f Technlgy, St. Petersburg, Russia* In the present paper it is shwn that the Dirac electrn thery

More information

45 K. M. Dyaknv Garsia nrm kfk G = sup zd jfj d z ;jf(z)j = dened riginally fr f L (T m), is in fact an equivalent nrm n BMO. We shall als be cncerned

45 K. M. Dyaknv Garsia nrm kfk G = sup zd jfj d z ;jf(z)j = dened riginally fr f L (T m), is in fact an equivalent nrm n BMO. We shall als be cncerned Revista Matematica Iberamericana Vl. 5, N. 3, 999 Abslute values f BMOA functins Knstantin M. Dyaknv Abstract. The paper cntains a cmplete characterizatin f the mduli f BMOA functins. These are described

More information

How do scientists measure trees? What is DBH?

How do scientists measure trees? What is DBH? Hw d scientists measure trees? What is DBH? Purpse Students develp an understanding f tree size and hw scientists measure trees. Students bserve and measure tree ckies and explre the relatinship between

More information

, which yields. where z1. and z2

, which yields. where z1. and z2 The Gaussian r Nrmal PDF, Page 1 The Gaussian r Nrmal Prbability Density Functin Authr: Jhn M Cimbala, Penn State University Latest revisin: 11 September 13 The Gaussian r Nrmal Prbability Density Functin

More information

Cambridge Assessment International Education Cambridge Ordinary Level. Published

Cambridge Assessment International Education Cambridge Ordinary Level. Published Cambridge Assessment Internatinal Educatin Cambridge Ordinary Level ADDITIONAL MATHEMATICS 4037/1 Paper 1 Octber/Nvember 017 MARK SCHEME Maximum Mark: 80 Published This mark scheme is published as an aid

More information

Revision: August 19, E Main Suite D Pullman, WA (509) Voice and Fax

Revision: August 19, E Main Suite D Pullman, WA (509) Voice and Fax .7.4: Direct frequency dmain circuit analysis Revisin: August 9, 00 5 E Main Suite D Pullman, WA 9963 (509) 334 6306 ice and Fax Overview n chapter.7., we determined the steadystate respnse f electrical

More information

Subject description processes

Subject description processes Subject representatin 6.1.2. Subject descriptin prcesses Overview Fur majr prcesses r areas f practice fr representing subjects are classificatin, subject catalging, indexing, and abstracting. The prcesses

More information

ENGI 4430 Parametric Vector Functions Page 2-01

ENGI 4430 Parametric Vector Functions Page 2-01 ENGI 4430 Parametric Vectr Functins Page -01. Parametric Vectr Functins (cntinued) Any nn-zer vectr r can be decmpsed int its magnitude r and its directin: r rrˆ, where r r 0 Tangent Vectr: dx dy dz dr

More information

Thermodynamics Partial Outline of Topics

Thermodynamics Partial Outline of Topics Thermdynamics Partial Outline f Tpics I. The secnd law f thermdynamics addresses the issue f spntaneity and invlves a functin called entrpy (S): If a prcess is spntaneus, then Suniverse > 0 (2 nd Law!)

More information

Romeo and Juliet Essay

Romeo and Juliet Essay Rme and Juliet Essay Texts may be analyzed and interpreted in many ways. Shakespearean wrks are n different in that they have been subject t varius types f investigatin and analysis. Indeed, entire curses

More information

Lyapunov Stability Stability of Equilibrium Points

Lyapunov Stability Stability of Equilibrium Points Lyapunv Stability Stability f Equilibrium Pints 1. Stability f Equilibrium Pints - Definitins In this sectin we cnsider n-th rder nnlinear time varying cntinuus time (C) systems f the frm x = f ( t, x),

More information

Tree Structured Classifier

Tree Structured Classifier Tree Structured Classifier Reference: Classificatin and Regressin Trees by L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stne, Chapman & Hall, 98. A Medical Eample (CART): Predict high risk patients

More information

1 The limitations of Hartree Fock approximation

1 The limitations of Hartree Fock approximation Chapter: Pst-Hartree Fck Methds - I The limitatins f Hartree Fck apprximatin The n electrn single determinant Hartree Fck wave functin is the variatinal best amng all pssible n electrn single determinants

More information

Physics 2B Chapter 23 Notes - Faraday s Law & Inductors Spring 2018

Physics 2B Chapter 23 Notes - Faraday s Law & Inductors Spring 2018 Michael Faraday lived in the Lndn area frm 1791 t 1867. He was 29 years ld when Hand Oersted, in 1820, accidentally discvered that electric current creates magnetic field. Thrugh empirical bservatin and

More information

Introduction: A Generalized approach for computing the trajectories associated with the Newtonian N Body Problem

Introduction: A Generalized approach for computing the trajectories associated with the Newtonian N Body Problem A Generalized apprach fr cmputing the trajectries assciated with the Newtnian N Bdy Prblem AbuBar Mehmd, Syed Umer Abbas Shah and Ghulam Shabbir Faculty f Engineering Sciences, GIK Institute f Engineering

More information

Distributions, spatial statistics and a Bayesian perspective

Distributions, spatial statistics and a Bayesian perspective Distributins, spatial statistics and a Bayesian perspective Dug Nychka Natinal Center fr Atmspheric Research Distributins and densities Cnditinal distributins and Bayes Thm Bivariate nrmal Spatial statistics

More information

Supplement 8: Conservative and non-conservative partitioned systems: equivalences and interconversions

Supplement 8: Conservative and non-conservative partitioned systems: equivalences and interconversions Research The quantitatin f buffering actin. I. A frmal and general apprach. Bernhard M. Schmitt Supplement 8: Cnservative and nn-cnservative partitined systems: equivalences and intercnversins The aims

More information

Source Coding and Compression

Source Coding and Compression Surce Cding and Cmpressin Heik Schwarz Cntact: Dr.-Ing. Heik Schwarz heik.schwarz@hhi.fraunhfer.de Heik Schwarz Surce Cding and Cmpressin September 22, 2013 1 / 60 PartI: Surce Cding Fundamentals Heik

More information

5 th grade Common Core Standards

5 th grade Common Core Standards 5 th grade Cmmn Cre Standards In Grade 5, instructinal time shuld fcus n three critical areas: (1) develping fluency with additin and subtractin f fractins, and develping understanding f the multiplicatin

More information

Department of Economics, University of California, Davis Ecn 200C Micro Theory Professor Giacomo Bonanno. Insurance Markets

Department of Economics, University of California, Davis Ecn 200C Micro Theory Professor Giacomo Bonanno. Insurance Markets Department f Ecnmics, University f alifrnia, Davis Ecn 200 Micr Thery Prfessr Giacm Bnann Insurance Markets nsider an individual wh has an initial wealth f. ith sme prbability p he faces a lss f x (0

More information

CONSTRUCTING STATECHART DIAGRAMS

CONSTRUCTING STATECHART DIAGRAMS CONSTRUCTING STATECHART DIAGRAMS The fllwing checklist shws the necessary steps fr cnstructing the statechart diagrams f a class. Subsequently, we will explain the individual steps further. Checklist 4.6

More information

We can see from the graph above that the intersection is, i.e., [ ).

We can see from the graph above that the intersection is, i.e., [ ). MTH 111 Cllege Algebra Lecture Ntes July 2, 2014 Functin Arithmetic: With nt t much difficulty, we ntice that inputs f functins are numbers, and utputs f functins are numbers. S whatever we can d with

More information

ENGINEERING COUNCIL CERTIFICATE LEVEL THERMODYNAMIC, FLUID AND PROCESS ENGINEERING C106 TUTORIAL 5 THE VISCOUS NATURE OF FLUIDS

ENGINEERING COUNCIL CERTIFICATE LEVEL THERMODYNAMIC, FLUID AND PROCESS ENGINEERING C106 TUTORIAL 5 THE VISCOUS NATURE OF FLUIDS ENGINEERING COUNCIL CERTIFICATE LEVEL THERMODYNAMIC, FLUID AND PROCESS ENGINEERING C106 TUTORIAL 5 THE VISCOUS NATURE OF FLUIDS On cmpletin f this tutrial yu shuld be able t d the fllwing. Define viscsity

More information

Sections 15.1 to 15.12, 16.1 and 16.2 of the textbook (Robbins-Miller) cover the materials required for this topic.

Sections 15.1 to 15.12, 16.1 and 16.2 of the textbook (Robbins-Miller) cover the materials required for this topic. Tpic : AC Fundamentals, Sinusidal Wavefrm, and Phasrs Sectins 5. t 5., 6. and 6. f the textbk (Rbbins-Miller) cver the materials required fr this tpic.. Wavefrms in electrical systems are current r vltage

More information

A finite steps algorithm for solving convex feasibility problems

A finite steps algorithm for solving convex feasibility problems J Glb Optim (2007) 38:143 160 DOI 10.1007/s10898-006-9088-y ORIGINAL ARTICLE A finite steps algrithm fr slving cnvex feasibility prblems M. Ait Rami U. Helmke J. B. Mre Received: 18 February 2006 / Accepted:

More information

A Quick Overview of the. Framework for K 12 Science Education

A Quick Overview of the. Framework for K 12 Science Education A Quick Overview f the NGSS EQuIP MODULE 1 Framewrk fr K 12 Science Educatin Mdule 1: A Quick Overview f the Framewrk fr K 12 Science Educatin This mdule prvides a brief backgrund n the Framewrk fr K-12

More information

Surface and Contact Stress

Surface and Contact Stress Surface and Cntact Stress The cncept f the frce is fundamental t mechanics and many imprtant prblems can be cast in terms f frces nly, fr example the prblems cnsidered in Chapter. Hwever, mre sphisticated

More information

Lim f (x) e. Find the largest possible domain and its discontinuity points. Why is it discontinuous at those points (if any)?

Lim f (x) e. Find the largest possible domain and its discontinuity points. Why is it discontinuous at those points (if any)? THESE ARE SAMPLE QUESTIONS FOR EACH OF THE STUDENT LEARNING OUTCOMES (SLO) SET FOR THIS COURSE. SLO 1: Understand and use the cncept f the limit f a functin i. Use prperties f limits and ther techniques,

More information

The standards are taught in the following sequence.

The standards are taught in the following sequence. B L U E V A L L E Y D I S T R I C T C U R R I C U L U M MATHEMATICS Third Grade In grade 3, instructinal time shuld fcus n fur critical areas: (1) develping understanding f multiplicatin and divisin and

More information

ALE 21. Gibbs Free Energy. At what temperature does the spontaneity of a reaction change?

ALE 21. Gibbs Free Energy. At what temperature does the spontaneity of a reaction change? Name Chem 163 Sectin: Team Number: ALE 21. Gibbs Free Energy (Reference: 20.3 Silberberg 5 th editin) At what temperature des the spntaneity f a reactin change? The Mdel: The Definitin f Free Energy S

More information

Pipetting 101 Developed by BSU CityLab

Pipetting 101 Developed by BSU CityLab Discver the Micrbes Within: The Wlbachia Prject Pipetting 101 Develped by BSU CityLab Clr Cmparisns Pipetting Exercise #1 STUDENT OBJECTIVES Students will be able t: Chse the crrect size micrpipette fr

More information

WRITING THE REPORT. Organizing the report. Title Page. Table of Contents

WRITING THE REPORT. Organizing the report. Title Page. Table of Contents WRITING THE REPORT Organizing the reprt Mst reprts shuld be rganized in the fllwing manner. Smetime there is a valid reasn t include extra chapters in within the bdy f the reprt. 1. Title page 2. Executive

More information

Dead-beat controller design

Dead-beat controller design J. Hetthéssy, A. Barta, R. Bars: Dead beat cntrller design Nvember, 4 Dead-beat cntrller design In sampled data cntrl systems the cntrller is realised by an intelligent device, typically by a PLC (Prgrammable

More information

37 Maxwell s Equations

37 Maxwell s Equations 37 Maxwell s quatins In this chapter, the plan is t summarize much f what we knw abut electricity and magnetism in a manner similar t the way in which James Clerk Maxwell summarized what was knwn abut

More information

MODULE 1. e x + c. [You can t separate a demominator, but you can divide a single denominator into each numerator term] a + b a(a + b)+1 = a + b

MODULE 1. e x + c. [You can t separate a demominator, but you can divide a single denominator into each numerator term] a + b a(a + b)+1 = a + b . REVIEW OF SOME BASIC ALGEBRA MODULE () Slving Equatins Yu shuld be able t slve fr x: a + b = c a d + e x + c and get x = e(ba +) b(c a) d(ba +) c Cmmn mistakes and strategies:. a b + c a b + a c, but

More information

NOTE ON THE ANALYSIS OF A RANDOMIZED BLOCK DESIGN. Junjiro Ogawa University of North Carolina

NOTE ON THE ANALYSIS OF A RANDOMIZED BLOCK DESIGN. Junjiro Ogawa University of North Carolina NOTE ON THE ANALYSIS OF A RANDOMIZED BLOCK DESIGN by Junjir Ogawa University f Nrth Carlina This research was supprted by the Office f Naval Research under Cntract N. Nnr-855(06) fr research in prbability

More information

3. Design of Channels General Definition of some terms CHAPTER THREE

3. Design of Channels General Definition of some terms CHAPTER THREE CHAPTER THREE. Design f Channels.. General The success f the irrigatin system depends n the design f the netwrk f canals. The canals may be excavated thrugh the difference types f sils such as alluvial

More information

3. Classify the following Numbers (Counting (natural), Whole, Integers, Rational, Irrational)

3. Classify the following Numbers (Counting (natural), Whole, Integers, Rational, Irrational) After yu cmplete each cncept give yurself a rating 1. 15 5 2 (5 3) 2. 2 4-8 (2 5) 3. Classify the fllwing Numbers (Cunting (natural), Whle, Integers, Ratinal, Irratinal) a. 7 b. 2 3 c. 2 4. Are negative

More information

Computational modeling techniques

Computational modeling techniques Cmputatinal mdeling techniques Lecture 2: Mdeling change. In Petre Department f IT, Åb Akademi http://users.ab.fi/ipetre/cmpmd/ Cntent f the lecture Basic paradigm f mdeling change Examples Linear dynamical

More information

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 11 (3/11/04) Neutron Diffusion

22.54 Neutron Interactions and Applications (Spring 2004) Chapter 11 (3/11/04) Neutron Diffusion .54 Neutrn Interactins and Applicatins (Spring 004) Chapter (3//04) Neutrn Diffusin References -- J. R. Lamarsh, Intrductin t Nuclear Reactr Thery (Addisn-Wesley, Reading, 966) T study neutrn diffusin

More information

THE LIFE OF AN OBJECT IT SYSTEMS

THE LIFE OF AN OBJECT IT SYSTEMS THE LIFE OF AN OBJECT IT SYSTEMS Persns, bjects, r cncepts frm the real wrld, which we mdel as bjects in the IT system, have "lives". Actually, they have tw lives; the riginal in the real wrld has a life,

More information

Public Key Cryptography. Tim van der Horst & Kent Seamons

Public Key Cryptography. Tim van der Horst & Kent Seamons Public Key Cryptgraphy Tim van der Hrst & Kent Seamns Last Updated: Oct 5, 2017 Asymmetric Encryptin Why Public Key Crypt is Cl Has a linear slutin t the key distributin prblem Symmetric crypt has an expnential

More information

BASD HIGH SCHOOL FORMAL LAB REPORT

BASD HIGH SCHOOL FORMAL LAB REPORT BASD HIGH SCHOOL FORMAL LAB REPORT *WARNING: After an explanatin f what t include in each sectin, there is an example f hw the sectin might lk using a sample experiment Keep in mind, the sample lab used

More information

CHAPTER 2 Algebraic Expressions and Fundamental Operations

CHAPTER 2 Algebraic Expressions and Fundamental Operations CHAPTER Algebraic Expressins and Fundamental Operatins OBJECTIVES: 1. Algebraic Expressins. Terms. Degree. Gruping 5. Additin 6. Subtractin 7. Multiplicatin 8. Divisin Algebraic Expressin An algebraic

More information

Differentiation Applications 1: Related Rates

Differentiation Applications 1: Related Rates Differentiatin Applicatins 1: Related Rates 151 Differentiatin Applicatins 1: Related Rates Mdel 1: Sliding Ladder 10 ladder y 10 ladder 10 ladder A 10 ft ladder is leaning against a wall when the bttm

More information

Standard Title: Frequency Response and Frequency Bias Setting. Andrew Dressel Holly Hawkins Maureen Long Scott Miller

Standard Title: Frequency Response and Frequency Bias Setting. Andrew Dressel Holly Hawkins Maureen Long Scott Miller Template fr Quality Review f NERC Reliability Standard BAL-003-1 Frequency Respnse and Frequency Bias Setting Basic Infrmatin: Prject number: 2007-12 Standard number: BAL-003-1 Prject title: Frequency

More information

Probability, Random Variables, and Processes. Probability

Probability, Random Variables, and Processes. Probability Prbability, Randm Variables, and Prcesses Prbability Prbability Prbability thery: branch f mathematics fr descriptin and mdelling f randm events Mdern prbability thery - the aximatic definitin f prbability

More information

THE QUADRATIC AND QUARTIC CHARACTER OF CERTAIN QUADRATIC UNITS I PHILIP A. LEONARD AND KENNETH S. WILLIAMS

THE QUADRATIC AND QUARTIC CHARACTER OF CERTAIN QUADRATIC UNITS I PHILIP A. LEONARD AND KENNETH S. WILLIAMS PACFC JOURNAL OF MATHEMATCS Vl. 7, N., 977 THE QUADRATC AND QUARTC CHARACTER OF CERTAN QUADRATC UNTS PHLP A. LEONARD AND KENNETH S. WLLAMS Let ε m dente the fundamental unit f the real quadratic field

More information

SEMI STABILITY FACTORS AND SEMI FACTORS. Daniel Hershkowitz and Hans Schneider

SEMI STABILITY FACTORS AND SEMI FACTORS. Daniel Hershkowitz and Hans Schneider Cntemprary Mathematics Vlume 47, 1985 SEMI STABILITY FACTORS AND SEMI FACTORS * Daniel Hershkwitz and Hans Schneider ABSTRACT. A (semistability) factr [semifactr] f a matrix AE r: nn is a psitive definite

More information

Incorporating stereo information within the. kernel framework

Incorporating stereo information within the. kernel framework Incrprating stere infrmatin within the graph kernel framewrk Pierre-Anthny Grenier, Luc Brun, Didier Villemin T cite this versin: Pierre-Anthny Grenier, Luc Brun, Didier Villemin. graph kernel framewrk.

More information

Compressibility Effects

Compressibility Effects Definitin f Cmpressibility All real substances are cmpressible t sme greater r lesser extent; that is, when yu squeeze r press n them, their density will change The amunt by which a substance can be cmpressed

More information

ChE 471: LECTURE 4 Fall 2003

ChE 471: LECTURE 4 Fall 2003 ChE 47: LECTURE 4 Fall 003 IDEL RECTORS One f the key gals f chemical reactin engineering is t quantify the relatinship between prductin rate, reactr size, reactin kinetics and selected perating cnditins.

More information

Aircraft Performance - Drag

Aircraft Performance - Drag Aircraft Perfrmance - Drag Classificatin f Drag Ntes: Drag Frce and Drag Cefficient Drag is the enemy f flight and its cst. One f the primary functins f aerdynamicists and aircraft designers is t reduce

More information

REPRESENTATIONS OF sp(2n; C ) SVATOPLUK KR YSL. Abstract. In this paper we have shown how a tensor product of an innite dimensional

REPRESENTATIONS OF sp(2n; C ) SVATOPLUK KR YSL. Abstract. In this paper we have shown how a tensor product of an innite dimensional ON A DISTINGUISHED CLASS OF INFINITE DIMENSIONAL REPRESENTATIONS OF sp(2n; C ) SVATOPLUK KR YSL Abstract. In this paper we have shwn hw a tensr prduct f an innite dimensinal representatin within a certain

More information

COVERS OF DEHN FILLINGS ON ONCE-PUNCTURED TORUS BUNDLES

COVERS OF DEHN FILLINGS ON ONCE-PUNCTURED TORUS BUNDLES prceedings f the american mathematical sciety Vlume 105, Number 3, March 1989 COVERS OF DEHN FILLINGS ON ONCE-PUNCTURED TORUS BUNDLES MARK D. BAKER (Cmmunicated by Frederick R. Chen) Abstract. Let M be

More information

Biplots in Practice MICHAEL GREENACRE. Professor of Statistics at the Pompeu Fabra University. Chapter 13 Offprint

Biplots in Practice MICHAEL GREENACRE. Professor of Statistics at the Pompeu Fabra University. Chapter 13 Offprint Biplts in Practice MICHAEL GREENACRE Prfessr f Statistics at the Pmpeu Fabra University Chapter 13 Offprint CASE STUDY BIOMEDICINE Cmparing Cancer Types Accrding t Gene Epressin Arrays First published:

More information

4. Find a, b, and c. 6. Find x and y.

4. Find a, b, and c. 6. Find x and y. Grace Brethren Christian Schl Entering Trig/Analysis: Page f Summer Packet fr Students entering Trig/Analysis Review prblems frm Gemetry: Shw yur wrk!. Twice the cmplement f angle A is 35 less than the

More information

B. Definition of an exponential

B. Definition of an exponential Expnents and Lgarithms Chapter IV - Expnents and Lgarithms A. Intrductin Starting with additin and defining the ntatins fr subtractin, multiplicatin and divisin, we discvered negative numbers and fractins.

More information

MATHEMATICS SYLLABUS SECONDARY 5th YEAR

MATHEMATICS SYLLABUS SECONDARY 5th YEAR Eurpean Schls Office f the Secretary-General Pedaggical Develpment Unit Ref. : 011-01-D-8-en- Orig. : EN MATHEMATICS SYLLABUS SECONDARY 5th YEAR 6 perid/week curse APPROVED BY THE JOINT TEACHING COMMITTEE

More information

Floating Point Method for Solving Transportation. Problems with Additional Constraints

Floating Point Method for Solving Transportation. Problems with Additional Constraints Internatinal Mathematical Frum, Vl. 6, 20, n. 40, 983-992 Flating Pint Methd fr Slving Transprtatin Prblems with Additinal Cnstraints P. Pandian and D. Anuradha Department f Mathematics, Schl f Advanced

More information

A New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation

A New Evaluation Measure. J. Joiner and L. Werner. The problems of evaluation and the needed criteria of evaluation III-l III. A New Evaluatin Measure J. Jiner and L. Werner Abstract The prblems f evaluatin and the needed criteria f evaluatin measures in the SMART system f infrmatin retrieval are reviewed and discussed.

More information