复旦大学 赵一鸣 离散数学 三.pptVIP

2.4 Operations on Relations 1.Inverse relation Definition 2.13: Let R be a relation from A to B. The inverse relation of R is a relation from B to A, we write R-1, defined by R-1= {(b,a)|(a,b)?R} Theorem 2.1：Let R,R1, and R2 be relation from A to B. Then (1)(R-1)-1=R; (2)(R1∪R2)-1=R1-1∪R2-1; (3)(R1∩R2)-1=R1-1∩R2-1; (4)(A×B)-1=B×A; (5)?-1=?; Theorem 2.2：Let R be a relation on A. Then R is symmetric if only if R=R-1. Proof: (1)If R is symmetric, then R=R-1。 R?R-1 and R-1?R。 (2)If R=R-1, then R is symmetric For any (a,b)?R, (b,a)??R 2.Composition Definition 2.14: Let R1 be a relation from A to B, and R2 be a relation from B to C. The composition of R1 and R2, we write R2?R1, is a relation from A to C, and is defined R2?R1={(a,c)|there exist some b?B so that (a,b)?R1 and (b,c)?R2, where a?A and c?C}. (1)R1 is a relation from A to B, and R2 is a relation from B to C (2)commutative law? ? R1={(a1,b1), (a2,b3), (a1,b2)} R2={(b4,a1), (b4,c1), (b2,a2), (b3,c2)} Associative law? For R1 ?A×B, R2?B×C, and R3?C×D R3?(R2?R1)=?(R3?R2)?R1 subset of A×D For any (a,d)?R3?(R2?R1), (a,d)??(R3?R2)?R1, Similarity, (R3?R2)?R1?R3?(R2?R1) Theorem 2.3：Let R1 be a relation from A to B, R2 be a relation from B to C, R3 be a relation from C to D. Then R3?(R2?R1)=(R3?R2)?R1(Associative law) Definition 2.15: Let R be a relation on A, and n?N. The relation Rn is defined as follows. (1)R0 ={(a,a)|a?A}), we write IA. (2)Rn+1=R?Rn. Theorem 2.4: Let R be a relation on A, and m,n?N. Then (1)Rm?Rn=Rm+n (2)(Rm)n=Rmn A={a1,a2,?,an},B={b1,b2,?,bm} R1 and R2 be relations from A to B. MR1=(xij), MR2=(yij) MR1∪R2=(xij?yij) MR1∩R2=(xij?yij) ? 0 1 ? 0 1 0 0 1 0 0 0 1 1 1 1 0 1 Example:A={2,3,4},B={1,3,5,7} R1={(2,3),(2,5),(2,7),(3,5),(3,7),(4,5),(4,7)} R2={(2,5),(3,3),(4,1),(4,7)} Inverse relation R-1 of R : MR-1=MRT, MRT is the transpose of MR. A={a1,a2,?,an},B={b1,b2,?,bm}, C={c1,c2,?,cr}, R1 be a relations from A to B, MR1=(xij)m?n, R2 be a relation from B to C