Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Suppose that \(R\) and \(S\) are reflexive relations on a set \(A\).

Prove or disprove each of these statements.

a) \(R \cup S\) is reflexive.

b) \(R \cap S\) is reflexive.

c) \(R \oplus S\) is irreflexive.

d) \(R - S\) is irreflexive.

e) \(S^\circ R\) is reflexive.

Short Answer

Expert verified

(a)\(R \cup S\)is reflexive

(b)\(R \cap S\)is reflexive

(c)\(R \oplus S\)is irreflexive

(d)\(R - S\)is irreflexive

(e) \(S^\circ R\) is irreflexive

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Given Data

\(R\) and \(S\) are reflexive relations on a set \(A\)

02

Concept of the reflexive, irreflexive, union, intersection, difference, symmetric difference and composite

Reflexive: A relation \(R\) on a set \(A\) is called reflexive if \((a,a) \in R\) for every element \(a \in A\).

Irreflexive: A relation\(R\)on a set\(A\)is irreflexive if\((a,a) \notin R\)for every element\(a \in A\).

Union\(A \cup B\): All elements that are either in\(A\)OR in\(B\)

Intersection\(A \cap B\): All elements that are both in\(A\)AND in\(B\).

Difference\(A - B\): All elements in\(A\)that are NOT in\(B\)(complement of\(B\)with respect to\(A\)).

Symmetric difference\(A \oplus B\): All elements in\(A\)or in\(B\), but not in both.

The composite \(S^\circ R\) consists of all ordered pairs \((a,c)\) for which there exists an element \(b\)such that \((a,b) \in R\) and \((b,c) \in S\)

03

Determine the \(R \cup S\) is reflexive

(a)

Let \(a \in A\)

Since \(R\) is reflexive:

\((a,a) \in R\)

Since \(S\) is reflexive:

\((a,a) \in S\)

The union \(R \cup S\)contains all elements in either \(R\) or \(S\).

\((a,a) \in R \cup S\)

Be the definition of reflexive, \(R \cup S\) is then reflexive.

04

Determine the \(R \cap S\) is reflexive

(b)

Let \(a \in A\)

Since \(R\)is reflexive:

\((a,a) \in R\)

Since \(S\) is reflexive:

\((a,a) \in S\)

The union \(R \cap S\) contains all elements in both \(R\) and \(S\).

\((a,a) \in R \cap S\)

Be the definition of reflexive, \(R \cap S\) is then reflexive.

05

Determine the \(R \oplus S\) is irreflexive

(c)

Let \(a \in A\)

Since \(R\) is reflexive:

\((a,a) \in R\)

Since \(S\) is reflexive:

\((a,a) \in S\)

The symmetric difference \(R \oplus S\)contains all elements in \(R\) or \(S\), but not those that are in both sets.

\((a,a) \notin R \oplus S\)

Be the definition of reflexive, \(R \oplus S\) is then irreflexive.

06

Determine the \(R - S\) is irreflexive

(d)

Let \(a \in A\)

Since \(R\) is reflexive:

\((a,a) \in R\)

Since \(S\) is reflexive:

\((a,a) \in S\)

The difference \(R - S\)contains all elements in \(R\) that are not in \(S\) as well.

\((a,a) \notin R - S\)

Be the definition of reflexive, \(R - S\) is then irreflexive.

07

Determine the \(S^\circ R\)is reflexive

(e)

Let \(a \in A\)

Since \(R\) is reflexive:

\((a,a) \in R\)

Since \(S\) is reflexive:

\((a,a) \in S\)

By the definition of the composite, if \((a,a) \in R\)

and \((a,a) \in S\), then:

\((a,a) \in S^\circ R\)

Be the definition of reflexive, \(S^\circ R\)is then reflexive

Therefore, (a)\(R \cup S\)is reflexive

(b)\(R \cap S\)is reflexive

(c)\(R \oplus S\)is irreflexive

(d)\(R - S\)is irreflexive

(e) \(S^\circ R\) is irreflexive

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Let \(R\) the relation \(\{ (1,2),(1,3),(2,3),(2,4),(3,1)\} \) and \(S\) be the relation \(\{ (2,1),(3,1),(3,2),(4,2)\} \). Find \(S \circ R\).

Exercises 34โ€“37 deal with these relations on the set of real numbers:

\({R_1} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a > b} \right\},\)the โ€œgreater thanโ€ relation,

\({R_2} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \ge b} \right\},\)the โ€œgreater than or equal toโ€ relation,

\({R_3} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a < b} \right\},\)the โ€œless thanโ€ relation,

\({R_4} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \le b} \right\},\)the โ€œless than or equal toโ€ relation,

\({R_5} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a = b} \right\},\)the โ€œequal toโ€ relation,

\({R_6} = \left\{ {\left( {a,\;b} \right) \in {R^2}|a \ne b} \right\},\)the โ€œunequal toโ€ relation.

35. Find

(a) \({R_2} \cup {R_4}\).

(b) \({R_3} \cup {R_6}\).

(c) \({R_3} \cap {R_6}\).

(d) \({R_4} \cap {R_6}\).

(e) \({R_3} - {R_6}\).

(f) \({R_6} - {R_3}\).

(g) \({R_2} \oplus {R_6}\).

(h) \({R_3} \oplus {R_5}\).

Show that if \(C\) is a condition that elements of the \(n\)-ary relation \(R\)and \(S\)may satisfy, then \({s_C}(R - S) = {s_C}(R) - {s_C}(S)\).

Draw the Hasse diagram for inclusion on the set \(P(S)\) where \(S = \{ a,b,c,d\} \).

To prove the closure with respect to the property. ofthe relation \(R = \{ (0,0),(0,1),(1,1),(2,2)\} \) on the set \(\{ 0,1,2\} \) does not exist if . is the property" has an odd number of elements."

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free