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

Short Answer

Expert verified

The value of \(S^\circ R\) is \(\{ (1,1),(1,2),(2,1),(2,2)\} \) where \(R\) is 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)\} \).

Step by step solution

01

Given

That \(R\) is 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)\} \) and we need to find \(S \circ R\).

02

The Concept of SoR in relation

If R is a relation from a set A to set B and S is a relation from B to a set C, then the relation SoR is from A to C.

03

Determine the SoR

Consider the following relation as,

\(\begin{array}{l}R = \{ (1,2),(1,3),(2,3),(2,4),(3,1)\} \\S = \{ (2,1),(3,1),(3,2),(4,2)\} \end{array}\)

\(S^\circ R\)is found using the ordered pairs\(R\)and\(S\)where the second element of the ordered pair in _ agrees with the first element of the ordered pair in\(S\).

The computed ordered pairs are as shown below.

Hence the required composite function \(S \circ R\) is,

\(S \circ R = \{ (1,1),(1,2),(2,1),(2,2)\} {\rm{. }}\)

Conclusion:

Hence the value of \(S \circ R\) is \(\{ (1,1),(1,2),(2,1),(2,2)\} \) where \(R\) is 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)\} \).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

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

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

Find the lexicographic ordering of the bit strings 0, 01, 11, 001, 010, 011, 0001, and 0101 based on the ordering \(0 < 1\).

To determine an algorithm using the concept of interior vertices in a path to find the length of the shortest path between two vertices in a directed graph, if such a path exists.

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.

36. Find

(a) \({R_1}^\circ {R_1}\).

(b) \({R_1}^\circ {R_2}\).

(c) \({R_1}^\circ {R_3}\).

(d) \({R_1}^\circ {R_4}\).

(e) \({R_1}^\circ {R_5}\).

(f) \({R_1}^\circ {R_6}\).

(g) \({R_2}^\circ {R_3}\).

(h) \({R_3}^\circ {R_3}\).

The 5-tuples in a 5-ary relation represent these attributes of all people in the United States: name, Social Security number, street address, city, state.

a) Determine a primary key for this relation.

b) Under what conditions would (name, street address) be a composite key?

c) Under what conditions would (name, street address, city) be a composite key?

Find all circuits of length three in the directed graph in Exercise 16.

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