Try the fastest way to create flashcards
Question

Let R be the relation on the set {0, 1, 2, 3} containing the ordered pairs
(0, 1),(1, 1),(1, 2),(2, 0),(2, 2),(3, 0). Find reflexive, symmetric and transitive closure of R.

Solution

Verified
Step 1
1 of 5

DEFINITIONS

A relation RR on a set AA is reflexive\textbf{reflexive} if (a,a)R(a,a)\in R for every element aAa\in A.

A relation RR on a set AA is symmetric\textbf{symmetric} if (b,a)R(b,a)\in R whenever (a,b)R(a,b) \in R

A relation RR on a set AA is transitive\textbf{transitive} if (a,b)R(a,b)\in R and (b,c)R(b,c) \in R implies (a,c)R(a,c)\in R

The reflexive closure\textbf{reflexive closure} of RR is the relation that contains all ordered pairs of RR and to which all ordered pairs of the form (a,a)R(a,a)\in R (aAa\in A) were added (when they were not present yet).

RΔ=R{(a,a)aA}R\cup \Delta=R\cup \{(a,a)|a\in A\}

The symmetric closure\textbf{symmetric closure} of RR is the union of the relation RR with its inverse relation R1R^{-1}.

The inverse relation\textbf{inverse relation} R1R^{-1} is the set {(b,a)(a,b)R}\{(b,a)|(a,b)\in R\}

Create a free account to view solutions

Create a free account to view solutions

Recommended textbook solutions

Discrete Mathematics and Its Applications 7th Edition by Kenneth Rosen

Discrete Mathematics and Its Applications

7th EditionISBN: 9780073383095 (8 more)Kenneth Rosen
4,283 solutions
Discrete Mathematics 8th Edition by Richard Johnsonbaugh

Discrete Mathematics

8th EditionISBN: 9780321964687Richard Johnsonbaugh
4,246 solutions
Discrete Mathematics and Its Applications 8th Edition by Kenneth Rosen

Discrete Mathematics and Its Applications

8th EditionISBN: 9781259676512 (3 more)Kenneth Rosen
4,397 solutions
Discrete Mathematics with Applications 5th Edition by Susanna S. Epp

Discrete Mathematics with Applications

5th EditionISBN: 9781337694193Susanna S. Epp
2,641 solutions

More related questions

1/4

1/7