Homework Help is Here – Start Your Trial Now!
Math
Advanced Math
Exercise 17.2.18. Find binary relations on {1,2,3} that meet each of the following conditions. Express each relation as a set of ordered pairs, and draw the corresponding digraph. (Note: each part can have more than one answer, but you only need to find one.) (a) symmetric, but neither reflexive nor transitive. (b) reflexive, but neither symmetric nor transitive. (c) transitive and symmetric, but not reflexive.

Exercise 17.2.18. Find binary relations on {1,2,3} that meet each of the following conditions. Express each relation as a set of ordered pairs, and draw the corresponding digraph. (Note: each part can have more than one answer, but you only need to find one.) (a) symmetric, but neither reflexive nor transitive. (b) reflexive, but neither symmetric nor transitive. (c) transitive and symmetric, but not reflexive.

Advanced Engineering Mathematics
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
See similar textbooks
icon
Related questions
Question

Please do Exercise 17.2.18 part A,B,C,and D. Please show step by step and explain

**Exercise 17.2.18**: Find binary relations on \(\{1, 2, 3\}\) that meet each of the following conditions. Express each relation as a set of ordered pairs, and draw the corresponding digraph. (Note: each part can have more than one answer, but you only need to find one.) (a) Symmetric, but neither reflexive nor transitive. (b) Reflexive, but neither symmetric nor transitive. (c) Transitive and symmetric, but not reflexive. (d) Neither reflexive, nor symmetric, nor transitive. **Explanation:** A binary relation from a set \(A\) to itself is a subset of \(A \times A\), the set of all ordered pairs of elements from \(A\). Below is a brief description of what each property means: - **Symmetric**: If \((a, b)\) is in the relation, then \((b, a)\) must also be in the relation. - **Reflexive**: Every element is related to itself; i.e., for each element \(a\) in the set, \((a, a)\) is in the relation. - **Transitive**: If \((a, b)\) and \((b, c)\) are in the relation, then \((a, c)\) must be in the relation. For each condition, a corresponding digraph (directed graph) can be drawn by representing each element as a vertex and each ordered pair \((a, b)\) as a directed edge from vertex \(a\) to vertex \(b\).
Transcribed Image Text:**Exercise 17.2.18**: Find binary relations on \(\{1, 2, 3\}\) that meet each of the following conditions. Express each relation as a set of ordered pairs, and draw the corresponding digraph. (Note: each part can have more than one answer, but you only need to find one.) (a) Symmetric, but neither reflexive nor transitive. (b) Reflexive, but neither symmetric nor transitive. (c) Transitive and symmetric, but not reflexive. (d) Neither reflexive, nor symmetric, nor transitive. **Explanation:** A binary relation from a set \(A\) to itself is a subset of \(A \times A\), the set of all ordered pairs of elements from \(A\). Below is a brief description of what each property means: - **Symmetric**: If \((a, b)\) is in the relation, then \((b, a)\) must also be in the relation. - **Reflexive**: Every element is related to itself; i.e., for each element \(a\) in the set, \((a, a)\) is in the relation. - **Transitive**: If \((a, b)\) and \((b, c)\) are in the relation, then \((a, c)\) must be in the relation. For each condition, a corresponding digraph (directed graph) can be drawn by representing each element as a vertex and each ordered pair \((a, b)\) as a directed edge from vertex \(a\) to vertex \(b\).
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,
SEE MORE TEXTBOOKS