Scribd
Upload
5 views1 page

Workshop 4

Uploaded by

Stephano Ricci
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views1 page

Workshop 4

Uploaded by

Stephano Ricci
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

MATH 1200 - Workshop 4

Daniel (Danny) Mychakov


November 19th, 2021

Question. Consider the relation R on R defined by

R = {(x, y) ∈ R × R | xy ≥ 0} .

Proof. This is not an equivalence relation. It is Reflexive and Symmetric, but not Transitive.

1) Reflexive (x ∼ x)
Notice that x ∼ x as x · x ≥ 0 ⇐⇒ x2 ≥ 0, which is true ∀x ∈ R by the elementary identity that squaring
any real number will be greater than or equal to 0.

2) Symmetric (x ∼ y =⇒ y ∼ x)
Assume x ∼ y, then we know that xy ≥ 0. To see y ∼ x, it must be shown that yx ≥ 0, but since multipli-
cation is commutative, xy = yx, so xy ≥ 0 =⇒ yx ≥ 0, so this relation must be symmetric.

3) Transitive (x ∼ y and y ∼ z =⇒ x ∼ z)
We will provide a counter example to show this is not true. Let x = 1, y = 0, z = −1. Notice that
x ∼ y as (1)(0) ≥ 0, and y ∼ z as (0)(−1) ≥ 0, so our hypothesis is satisfied. However, x ≁ z due to the
fact that (1)(−1) ≱ 0, it is in fact less than 0. As we’ve found a counter example, this relation is not transitive.

As this relation is not transitive, we conclude it is not an equivalence relation.

You might also like