模糊数学pptCh3_Sec1-2-3.ppt

CH3 Fuzzy Relations, Fuzzy Matrices and Fuzzy Graphs Certainty relations： “mother-child relationship ” “linear function relation” y=a+bx ≤ ∈、=，etc. Uncertainty relations： “likeness relation” “friend relation” “trust relation” “almost equality” etc. 1. Binary relations Definition If R ? X×Y={(x, y)|x∈X and y∈Y} , then R is called a two-ary relation from X to Y. If (x, y)∈R，then it is written as xRy, or R(x, y)=1； 2．Representation Set, matrix and graph E.g. X={1,2,3,4}，R={(1,1),(1,2),(2,3),(2,4),(4,2)}， Relation matrix of R is Relation graph of R is 3. Operations on relations inverse relation   R-1={(x, y)|(y, x)∈R} composition  R?S={(x, y)| ?t((x, t)∈R and (t, y)∈S)} Example Let X={a, b, c, d}，R={(a, b), (b, a), (b, c), (c, d)}. 4. Properties Five basic properties：reflexivity，irreflexivity，symmetry, anti-symmetry and transition. (1) reflexive relation : ?x (x∈X→(x, x)∈R). e.g. R=the same family name （3） symmetric relation: ?x, ?y (x, y∈X and (x, y)∈R→(y, x)∈R). e.g. the same family name classmate  （4） anti-symmetric relation:?x ?y (x, y∈X and (x, y)∈R∧(y, x)∈R→x=y). e.g. (5) transitive relation ?x?y?z(x,y,z∈X and (x,y)∈R and (y, z)∈R→(x, z)∈R), e.g. the same family name classmate (?) friendship (?) 5. Closure of relation Definition R′is called transitive closure of R , written as t(R), if it satisfies the following conditions： （1）R′is transitive （2）R?R′ （3）R ? R″and R″transitive imply R′? R″. 6. Equivalent relation Equivalent relation=reflexive + symmetric + transitive e.g. =, is called an equivalent class. Equivalent relation on a set is respond to a partition (划分) on it. e.g. R= The same family name of a student class X If Zhang San belongs to X, then [Zhang San]R=?, [Zhang San]R denotes all students whose family names are Zhang on X. Equivalent relation=reflexive + symmetric + transitive e.g. R=congruen