Find the flaw in the following argument. The claim is false. Do not give a counterexample. Instead, point out the mistake in the reasoning. Claim: If a relation R over set A is symmetric and transitive then R is reflexive. "Proof:" Select any element (a, b) E R. Because R is symmetric it follows that (b, a) E R. Furthermore, since R is transitive, (a, b) E R ^ (b, a) ER= (a, a) E R. It follows that R is reflexive.
Find the flaw in the following argument. The claim is false. Do not give a counterexample. Instead, point out the mistake in the reasoning. Claim: If a relation R over set A is symmetric and transitive then R is reflexive. "Proof:" Select any element (a, b) E R. Because R is symmetric it follows that (b, a) E R. Furthermore, since R is transitive, (a, b) E R ^ (b, a) ER= (a, a) E R. It follows that R is reflexive.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Struggling on this problem, I can see that it's incorrect and am close but I'm overlooking the flaw in reasoning somewhere.
Expert Solution
Step 1
Step 1:-
Introduction:-
First of all, I am talking about the reflexive, symmetric, and transitive relation.
Reflexive is defined as a, b are the elements of the relation R. (a, a) and (b,b) both are in reflexive.
Symmetric defines as a, b are the elements of the relation R.
(a,b) is the element of the relation R and if (b, a) is also the element of the relation R that means R is symmetric
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education