Can you explain how the law of logic was used to reach this conclusion?

In summary: So, if these inequalities hold it doesn't necessarily imply that $x=y$, so the relation is not anti-symmetric."
  • #1
CH1203
1
0
New to set and graph theory and need help on how to approach these exercise questions:

For each of the following relations, state whether the relation is:
i) reflexive
ii) irreflexive
iii) symmetric
iv) anti-symmetric
v) transitive

Also state whether the relation is an equivalence or partial order relation. Give your reasoning.
a) x R y, if and only if x - y ≤ 3, where x and y \(\displaystyle \in\) J
b) x R y, if and only if y / x \(\displaystyle \in\) J, where x and y \(\displaystyle \in\) N

I understand reflexive, irreflexive, symmetric, anti-symmetric and transitive, but I don't know how to work this out as I have only seen examples with matrixes which are visual...
 
Physics news on Phys.org
  • #2
Re: HELP - Relations - State whether the relation is an equivalence or partial order relation

Consider the relation a). We have the following:

  • A relation R is reflexive if for all x it holds that xRx.

    We have that $x-x=0\leq 3\Rightarrow xRx$. So, the relation is reflexive.
  • A relation R is irreflexive if for no element x it holds that xRx.

    Since we have shown that the relation is reflexive, it cannot be irreflexive.
  • A relation R is symmetric if for all x,y, xRy implies yRx.

    The relation is not symmetric, take for example $x=-5$ and $y=1$, then $x-y=-5-1=-6\leq 3$, but $y-x=1-(-5)=1+5=6\nleqslant 3$.
  • A relation R is anti-symmetric if for all x,y, xRy and yRx implies $x=y$.

    Suppose that $x-y\leq 3$ and $y-x\leq 3$. These two inequalities hold for example when $x=1$ and $y=-2$:

    We have that $1-(-2)=1+2=3\leq 3$ and $-2-1=-3\leq 3$. So, if these inequalities hold it doesn't necessarily imply that $x=y$, so the relation is not anti-symmetric.
  • A relation R is transitive if for all x,y,z, xRy and yRz implies xRz.

    Since xRy and yRz , we have that $x-y\leq 3$ and $y-z\leq 3$. Take for example $x=3, y=0, z=-3$. Then $x-z = 3-(-3)=3+3=6\nleqslant 3$.

    So, the relation is not transitive.
Partial orders and equivalence relations are both reflexive and transitive, but only equivalence relations are symmetric, while partial orders are anti-symmetric.

We have shown that the above relation is only reflexive. So, this relation is neither an equivalence nor a partial order relation
 
  • #3
Re: HELP - Relations - State whether the relation is an equivalence or partial order relation

mathmari said:
Consider the relation a). We have the following:

  • A relation R is reflexive if for all x it holds that xRx.

    We have that $x-x=0\leq 3\Rightarrow xRx$. So, the relation is reflexive.
  • A relation R is irreflexive if for no element x it holds that xRx.

    Since we have shown that the relation is reflexive, it cannot be irreflexive.
  • A relation R is symmetric if for all x,y, xRy implies yRx.

    The relation is not symmetric, take for example $x=-5$ and $y=1$, then $x-y=-5-1=-6\leq 3$, but $y-x=1-(-5)=1+5=6\nleqslant 3$.
  • A relation R is anti-symmetric if for all x,y, xRy and yRx implies $x=y$.

    Suppose that $x-y\leq 3$ and $y-x\leq 3$. These two inequalities hold for example when $x=1$ and $y=-2$:

    We have that $1-(-2)=1+2=3\leq 3$ and $-2-1=-3\leq 3$. So, if these inequalities hold it doesn't necessarily mply that $x=y$, so the relation is not anti-symmetric imply that $x=y$, so the relation is not anti-symmetric.
  • A relation R is transitive if for all x,y,z, xRy and yRz implies xRz.

    Since xRy and yRz , we have that $x-y\leq 3$ and $y-z\leq 3$. Take for example $x=3, y=0, z=-3$. Then $x-z = 3-(-3)=3+3=6\nleqslant 3$.

    So, the relation is not transitive.
Partial orders and equivalence relations are both reflexive and transitive, but only equivalence relations are symmetric, while partial orders are anti-symmetric.

We have shown that the above relation is only reflexive. So, this relation is neither an equivalence nor a partial order relation
mathmari said:
So, if these inequalities hold it doesn't necessarily imply that $x=y$, so the relation is not anti-symmetric imply that $x=y$, so the relation is not anti-symmetric.

Which law of logic allow you to come to such a conclusion??
 
  • #4
Re: HELP - Relations - State whether the relation is an equivalence or partial order relation

solakis said:
Which law of logic allow you to come to such a conclusion??
The examples he gave just before that sentence:
"We have that 1−(−2)=1+2=3≤3 and −2−1=−3≤3."
 

FAQ: Can you explain how the law of logic was used to reach this conclusion?

Is an equivalence relation the same as a partial order relation?

No, these are two different types of relations. An equivalence relation is reflexive, symmetric, and transitive, meaning that it relates every element to itself, is bidirectional, and allows for the transitivity property. A partial order relation, on the other hand, is reflexive, antisymmetric, and transitive, meaning that it relates every element to itself, is unidirectional, and also allows for the transitivity property.

How can you determine if a relation is an equivalence relation?

To determine if a relation is an equivalence relation, you need to check if it satisfies the three properties: reflexivity, symmetry, and transitivity. If it does, then it is an equivalence relation. Reflexivity means that every element is related to itself, symmetry means that if element A is related to element B, then element B must also be related to element A, and transitivity means that if element A is related to element B and element B is related to element C, then element A must also be related to element C.

What is the difference between an equivalence relation and an equivalence class?

An equivalence relation is a relation that satisfies the three properties: reflexivity, symmetry, and transitivity. An equivalence class, on the other hand, is a set of elements that are related to each other through the equivalence relation. In other words, an equivalence class is a grouping of elements that are considered equivalent under the given equivalence relation.

Can a relation be both an equivalence relation and a partial order relation?

Yes, it is possible for a relation to be both an equivalence relation and a partial order relation. This type of relation is called an order-equivalence relation. It satisfies the properties of both an equivalence relation and a partial order relation, making it a powerful tool in mathematical and scientific applications.

How are equivalence relations and partial order relations used in real-world applications?

Equivalence relations and partial order relations are used in many real-world applications, including data analysis, network analysis, and decision-making processes. They help to organize and classify data, identify patterns and relationships, and make informed decisions based on the properties of these relations. In computer science, they are often used in programming languages and algorithms to optimize data manipulation and problem-solving.

Similar threads

Replies
3
Views
3K
Replies
1
Views
1K
Replies
1
Views
1K
Replies
5
Views
2K
Replies
7
Views
649
Replies
1
Views
3K
Replies
5
Views
2K
Back
Top