- 58 Views
- Uploaded on
- Presentation posted in: General

Discrete Structure

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Discrete Structure

Li Tak Sing(李德成)

- Three special properties
- For a binary relation R on a set A, we have the following definitions.
- R is reflexive if xRx for all xA.
- R is symmetric if xRy implies yRx for all x,y A
- R is transitive if xRy and yRz implies xRz for all x,y,z A

- For a binary relation R on a set A, we have the following definitions.

- For a binary relation R on a set A, we have the following definitions.
- R is irreflexive if (x,x)R for all xA.
- R is antisymmetric if xRy and yRx implies x=y for all x,yA.

- R is a binary relation on N
- aRb if (a+b) mod 2 = 0
- R is reflexive because (a+a) mod 2 =0 for all a N
- R is symmetric because if aRb, then (a+b) mod 2 = 0, then (b+a) mod 2 =0, then bRa
- R is transitive, because if aRb and bRc, then (a+b) mod 2 =0 and (b+c) mod 2 =0, then (a+2b+c) mod 2 =0, then (a+c) mod 2 =0, then aRc

- Give examples of binary relations over the set {a,b,c,d} with the stated properties:
- Reflexive and not symmetric and not transitive
- Symmetric and not reflexive and not transitive
- transitive and not reflexive and not symmetric

- If R and S are binary relations, then the composition of R and S, which we denote by RS, is the following relation:RS={(a,c)|(a,b)R and (b,c) S for some element b}

- For each of the following binary relations state which of the three properties, reflexive, symmetric and transitive are satisfied.
- xRy iff |x-y| is odd, over the integers.
- xRy iff x is a parent of y, over the set of people.

- Given the isParentOf relation. So a isParentOf b represents the fact that a is the parent of b.
- isGrandparentOf can then be defined in terms of isParentOf.isGrandparentOf=isParentOfisParentOf
- So a isGrandparentOf b if there is c so that a isParentOf c and c isPrentOf b.

- Given the following binary relations over {a,b,c,d}.R={(a,a),(a,c),(b,a),(b,d),(c,b)}S={(a,b),(a,c),(c,b),(d,c)}
- Find RS
- Find SR

- If R is a binary relation on A, then we'll denote the composition of R with itself n times by writingRn.
- For example,
- isGrandparentOf=isParentOf2
- isGreatGrandParentOf=isParentOf3

- If R is reflexive, then Rn is reflexive.
- If R is symmetric, then Rn is symmetric.
- If R is transitive, then Rn is transitive.

- Let R={(x,y)ZZ|x+y is odd}. We want to find out R2 and R3.

- If R is a binary relation and p is some property, then the p closure of R is the smallest binary relation containing R that satisfies property p.

- A reflexive closure of R is the smallest reflexive relation that contains R.
- A reflexive closure of R is denoted as r(R)
- R is a relation over {a,b,c} and R={(a,b),(b,c)}Then, r(R)={(a,a),(b,b),(c,c),(a,b),(b,c)}

- A symmetric closure of R is the smallest symmetric relation that contains R.
- A symmetric closure of R is denoted as s(R)
- R={(a,b),(b,c)}, s(R)={(a,b),(b,a),(b,c),(c,b)}

- A transitive closure of R is the smallest transitive relation that contains R. It is denoted as t(R).
- R= ={(a,b),(b,c)}, then t(R)= {(a,b),(b,c),(a,c)}

- If R is a binary relation over a set A, then:
- r(R)=RRo (Ro is the equality relation)
- s(R)=R Rc (Rc is the converse relation)
- t(R)=R R2 R3 R4....
- If A is finite with n elements, then t(R)= R R2 R3 R4.... Rn

- Given the set A={a,b,c,d}. Draw a directed graph to represent the indicated closure for each of the following binary relations over A.
- r(R), where R={(a,d)}
- s(R) where R={(a,b), (c,d)}
- t(R) where R={(a,b),(d,a),(d,c),(c,b)}