CSE115/ENGR160 Discrete Mathematics 05/01/129.3 Representing relationsExampleMatrix and relation propertiesSymmetricAntisymmetricSlide 7Union, intersection of relationsSlide 9Composite of relationsBoolean product (Section 3.8)Boolean power (Section 3.8)Slide 13Powers RnRepresenting relations using digraphsSlide 16Slide 17CSE115/ENGR160 Discrete Mathematics05/01/12Ming-Hsuan YangUC Merced19.3 Representing relations•Can use ordered set, graph to represent sets•Generally, matrices are better choice•Suppose that R is a relation from A={a1, a2, …, am} to B={b1, b2, …, bn}. The relation R can be represented by the matrix MR=[mij] where mij=1 if (ai,bj) ∊R, mij=0 if (ai,bj) ∉R, •A zero-one (binary) matrix2Example•Suppose that A={1,2,3} and B={1,2}. Let R be the relation from A to B containing (a,b) if a∈A, b∈B, and a > b. What is the matrix representing R if a1=1, a2=2, and a3=3, and b1=1, and b2=2•As R={(2,1), (3,1), (3,2)}, the matrix R is 3110100Matrix and relation properties•The matrix of a relation on a set, which is a square matrix, can be used to determine whether the relation has certain properties•Recall that a relation R on A is reflexive if (a,a)∈R. Thus R is reflexive if and only if (ai,ai)∈R for i=1,2,…,n•Hence R is reflexive iff mii=1, for i=1,2,…, n. •R is reflexive if all the elements on the main diagonal of MR are 14Symmetric•The relation R is symmetric if (a,b)∈R implies that (b,a)∈R•In terms of matrix, R is symmetric if and only mji=1 whenever mij=1, i.e., MR=(MR)T•R is symmetric iff MR is a symmetric matrix5Antisymmetric•The relation R is symmetric if (a,b)∈R and (b,a)∈R imply a=b•The matrix of an antisymmetric relation has the property that if mij=1 with i≠j, then mji=0•In other words, either mij=0 or mji=0 when i≠j6Example•Suppose that the relation R on a set is represented by the matrix Is R reflexive, symmetric or antisymmetric?•As all the diagonal elements are 1, R is reflexive. As MR is symmetric, R is symmetric. It is also easy to see R is not antisymmetric7110111011Union, intersection of relations•Suppose R1 and R2 are relations on a set A represented by MR1 and MR2•The matrices representing the union and intersection of these relations are MR1⋃R2 = MR1 ⋁ MR2 MR1⋂R2 = MR1 ⋀ MR28Example•Suppose that the relations R1 and R2 on a set A are represented by the matrices What are the matrices for R1⋃R2 and R1⋂R2?9001110101 01000110121RRMM 000000101 01111110122221111RRRRRRRRMMMMMMComposite of relations•Suppose R is a relation from A to B and S is a relation from B to C. Suppose that A, B, and C have m, n, and p elements with MS, MR•Use Boolean product of matrices •Let the zero-one matrices for S∘R, R, and S be MS∘R=[tij], MR=[rij], and MS=[sij] (these matrices have sizes m×p, m×n, n×p)•The ordered pair (ai, cj)∈S∘R iff there is an element bk s.t.. (ai, bk)∈R and (bk, cj)∈S•It follows that tij=1 iff rik=skj=1 for some k, MS∘R = MR ⊙ MS10Boolean product (Section 3.8)•Boolean product A B is defined as11⊙ 011110011000101101000000101)10()01()10()11()00()11()11()00()11()10()01()10()10()01()10()11()00()11(110011 ,011001BABAReplace x with ⋀, and + with ⋁Boolean power (Section 3.8)•Let A be a square zero-one matrix and let r be positive integer. The r-th Boolean power of A is the Boolean product of r factors of A, denoted by A[r] •A[r]=A ⊙A ⊙A… ⊙A r times 12111111111,111101111,111011101101100011011001100011001100011001100]5[]4[]2[]3[]2[AAAAAAAAAExample•Find the matrix representation of S∘R13000110111101100010 ,000011101SRRSSRMMMMMPowers Rn•For powers of a relation•The matrix for R2 is 14][nRRMMn010111110001110010]2[2RRRMMMRepresenting relations using digraphs•A directed graph, or digraph, consists of a set V of vertices (or nodes) together with a set E of ordered pairs of elements of V called edges (or arcs)•The vertex a is called the initial vertex of the edge (a,b), and vertex b is called the terminal vertex of the edge•An edge of the form (a,a) is called a loop 15Example•The directed graph with vertices a, b, c, and d, and edges (a,b), (a,d), (b,b), (b,d), (c,a), (c,b), and (d,b) is shown160010001110101010RMExample•R is reflexive. R is neither symmetric (e.g., (a,b)) nor antisymmetric (e.g., (b,c), (c,b)). R is not transitive (e.g., (a,b), (b,c))•S is not reflexive. S is symmetric but not antisymmetric (e.g., (a,c), (c,a)). S is not transitive (e.g., (c,a), (a,b))171001000100111110