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

.Let\(R\)be the relation that contains the pair\(\left( {a,b} \right)\)if\(a\)and\(b\)are cities such that there is a direct non-stop airline flight from\(a\)to\(b\). When is\(\left( {a,b} \right)\)in

a)\({R^2}\)?

b)\({R^3}\)?

c)\({R^*}\)?

Short Answer

Expert verified

(a) There is an airline flight from\(a\)to\(b\)with exactly 1 stop in some intermediate city

(b) There is an airline flight from\(a\)to\(b\)with exactly 2 stops in some intermediate cities

(c) It is possible to fly from \(a\) to \(b\)

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

\(R = \{ (a,b)\mid \)There is a direct non-stop airline flight from\(a\)to\(b\} \)

\(A = {\rm{ Set of all cities }}\)

02

Concept of Relation

A relation\(R\)can be represented by the matrix\({{\bf{M}}_R} = \left( {{m_{ij}}} \right)\)

\({m_{ij}} = \left\{ {\begin{array}{*{20}{l}}1&{{\rm{ if }}\left( {{a_i},{b_j}} \right) \in R}\\0&{{\rm{ if }}\left( {{a_i},{b_j}} \right) \notin R}\end{array}} \right.\)

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

Use Definition of composite for part (a)

\(R = \{ (a,b)\mid \)There is a direct non-stop airline flight from\(a\)to\(b\} \)

\(A = {\rm{ Set of all cities }}\)

(a) Use the definition of composite:

\(\begin{array}{c}{R^2} = R^\circ R\\ = \{ (a,b)\mid {\rm{ There cxists a city csuch that there is a direct non - stop airline flight from }}a{\rm{ to }}c\\{\rm{and there is a direct non - stop airline flight from }}c{\rm{ to }}b\} \\ = \{ (a,b){\rm{ It is possible to fly from }}a{\rm{ to }}b{\rm{ with exactly }}1{\rm{ stop in some intermediate city }}\} \end{array}\)

04

 Step 4: Use Definition of composite for part (b)

(b) Use the definition of composite:

\(\begin{array}{c}{R^3} = {R^2}^\circ R\\ = \{ (a,b)\mid {\rm{ There exists a city csuch that there is a direct non - stop airline flight from }}a{\rm{ to }}c\\{\rm{ and there is an airline flight from }}c{\rm{ to }}b{\rm{ with cxactly }}1{\rm{ stop in some intermediate city }}\} \\ = \{ (a,b){\rm{ It is possible to fly from }}a{\rm{ to }}b{\rm{ with cxactly }}2{\rm{ stops in some intermediate cities }}\} \end{array}\)

Step 5: Use Definition of composite for part (c)

(c)

Property\({R^*}\):\({R^*} = R \cup {R^2} \cup {R^3} \cup \ldots . \cup {R^n}\)

Generalizing part (a) and (b):

\({R^j} = \{ (a,b)\)It is possible to fly from\(a\)to\(b\)with exactly\(j - 1\)stops in some intermediate cities\(\} \)

\(j \in \{ 1,2, \ldots ,n\} \)

Using\({R^*} = R \cup {R^2} \cup {R^3} \cup \ldots \cup {R^n}\)

\({R^*} = \{ (a,b)\mid \) It is possible to fly from \(a\) to \(b\} \)

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

To find the transitive closers of the relation \(\{ (1,2),(2,1),(2,3),(3,4),(4,1)\} \) with the use of Warshall’s algorithm.

Let \(S\) be a set with \(n\) elements and let \(a\) and \(b\) be distinct elements of \(S\). How many relations \(R\) are there on \(S\) such that

a) \((a,b) \in R\) ?

b) \((a,b) \notin R\) ?

c) no ordered pair in \(R\) has \(a\) as its first element?

d) at least one ordered pair in \(R\) has \(a\) as its first element?

e) no ordered pair in \(R\) has \(a\) as its first element or \(b\) as its second element?

f) at least one ordered pair in \(R\) either has \(a\) as its first element or has \(b\) as its second element?

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}\).

To prove the error in the given proof a theorem.

Which relations in Exercise 6are irreflexive?

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