A relation R on a set A is backwards transitive if, and only if, for every r, y, z E A, if rRy and yRz then z Rr. Prove that a relation R is reflexive and backwards transitive if and only if R is an equivalence relation.

Elements Of Modern Algebra
8th Edition
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Gilbert, Linda, Jimmie
Chapter1: Fundamentals
Section1.7: Relations
Problem 6TFE: Label each of the following statements as either true or false. Let R be a relation on a nonempty...
icon
Related questions
Question
A relation R on a set A is backwards transitive if, and only if, for every r, y, z E A,
if xRy and yRz then z Rr.
Prove that a relation R is reflexive and backwards transitive if and only if R is an
equivalence relation.
Transcribed Image Text:A relation R on a set A is backwards transitive if, and only if, for every r, y, z E A, if xRy and yRz then z Rr. Prove that a relation R is reflexive and backwards transitive if and only if R is an equivalence relation.
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Knowledge Booster
Relations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, advanced-math and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Elements Of Modern Algebra
Elements Of Modern Algebra
Algebra
ISBN:
9781285463230
Author:
Gilbert, Linda, Jimmie
Publisher:
Cengage Learning,