This tag is intended for questions concerning partial orders, equivalence relations, properties of relations (transitive, symmetric,...), composition of relations and similar stuff. More-or-less the things about relations taught in the first elementary set theory or discrete math course.

learn more… | top users | synonyms

0
votes
1answer
30 views

Transivity / Binary relation? [closed]

Discuss the Transitivity of Binary Relations $\mathcal{S} $ $a$ on $\Bbb R $ defined by $a (x, y)$ $\in \Bbb R^2 $--> $x \leq ay$ ( for some a $ \in \Bbb R$ ) I have this assignment about ...
-2
votes
1answer
38 views

Recurrence relation general solutions [closed]

how would I go about tackling this kind of question? I'm struggling with the concept of recurrence relations. Any advice would be apreciated. Find the general solution of each of the following ...
1
vote
2answers
31 views

Where is the transistivity in this equivalence relation

The following set has been given: $A = \{1,2,3\}$, and the following relation on $A$ has been given: $S = \{(1,1),(2,1),(1,2),(2,2),(3,3)\}$. The answer says this is a valid equivalence relation. I ...
1
vote
1answer
46 views

Is the following relation a partial order?

Is the relation $R$ on $A=$ the set of all word of English, defined by $R=\{(x,y)\in A\times A: $ the first letter of the word $y$ occurs at least as late in the alphabet as the first letter of the ...
0
votes
0answers
33 views

Prove the relation $R = \{(x,y)\in \mathbb{R} \times \mathbb{R}: \text{ |x|< |y| or x=y} \}$ is antisymmetric.

Prove the relation $R = \{(x,y)\in \mathbb{R} \times \mathbb{R}: \text{ } |x|< |y|\text{ or $x=y$} \}$ is antisymmetric. Proof: Suppose $ x R y$ and $ yRx $. Then $|x|<|y|$ or $x=y$. ...
0
votes
1answer
22 views

Antisymmetric relation between two transitive relations

My task is the following: elements in set A: {a,b,c,d,e,f} relations between them: {(a,b),(b,f),(c,b),(c,d),(d,e),(e,a),(f,d),(f,e)} Question is, is the relation between them antisymmetric and ...
0
votes
0answers
10 views

Give an example showing Ran(R1 ∩ R2) ⊆ Ran(R1) ∩ Ran(R2) may not hold as an equality.

I have managed to prove Ran(R1 ∩ R2) ⊆ Ran(R1) ∩ Ran(R2), but I am having trouble finding an example that shows it doesn't hold as an equality.
2
votes
1answer
24 views

How many transitive and symetric relations that are not equivalence are in a set of $n$ elements?

I have a Set $S$, $|S|=n$, and I need to count how many symetric and transitive relations are in $S$ that are not equivalence relations. I know how to count equivalence relations (Bell number) but I ...
-3
votes
2answers
28 views

Why is this relation $R=\{ (a,b), (b,c), (a,c) \}$ transitive? [closed]

I am confused here. For the set $\{ a, b, c\}$ how is the relation $\{(a, b), (b, c), (a, c)\}$ transitive ?
0
votes
3answers
25 views

Prove transitivity or not of some relation

I'm trying to prove if this equation is an equivalence relation or not. $R =\{(x,y) \in N\times N: \mbox{There exist }m,n \in N\mbox{ such that } x^m = y^n\}$ It's relatively easy to prove both ...
1
vote
1answer
36 views

What is the term for relation whose inversion is a function?

Do we have a conventional term/name for such a relation $R$ (which is not necessarily a function) that $R^{-1}$ is a function? If not, what are your suggestions?
-1
votes
1answer
18 views

How do we show that $A$ is polynomial time reducible to itself? [duplicate]

How do we show that $A$ is polynomial time reducible to itself, i.e. that $A \le_p A$? I know how to prove that it is transitive, but I don't know how to prove it's reflexive. I'm aware that it's ...
2
votes
1answer
35 views

Why is this function well definded?

I have to take a look at the relation of $ x \sim y: \Leftrightarrow \exists k \in \mathbb{Z} : x-y=5k$ in $\mathbb{Z}$. I have no idea how to show at $\mathbb{Z} / \sim$ that the addition is well ...
0
votes
1answer
36 views

How to derive relationship between two functions

I have two functions: $f(x) = x^2 + 200$ $g(x) = (x + 8)^2$ I am interested in the relationship between the two functions in the region between the two minimums (from x = -8 to x = 0), which ...
1
vote
1answer
23 views

Let $A$ be a finite set and $\mathcal R$ an equivalence relation in A. Prove that exists a function …

Let $A$ be a finite set and $\mathcal R$ an equivalence relation in A. Prove that exists a function $f: A \to \Bbb N$ such that $\forall a, b \in A$ the following is true: $$a \mathcal R b \iff f(a) = ...
1
vote
1answer
32 views

Interpreting a first order sentence

I've been given this first order sentence with a binary relation symbol $R$: $\forall x \exists y (R(x, y) \land \forall z(R(x, z) \implies (R(y, z) \land (y=z)) ) $ We are then given two ...
1
vote
1answer
21 views

Solution check. How many relations of equivalence $R$ are there in $\Bbb N$ that verify silmultaneously the following properties.

I'm revising some old psets while preparing an exam and going through some things that I left unverified. How many relations of equivalence $R$ are there in $\Bbb N$ that verify silmultaneously the ...
0
votes
1answer
34 views

Relations and functionss

I am unsure how to do this, is it possible someone could give me a step by step guide so I can have a good understanding of it. f(x) and g(x) are defined over the real number set R as follows: $g(x) =...
1
vote
1answer
13 views

Let $H = \{2^m : m \in \mathbb{Z}\}$ & define a relation $R$ on the set $\mathbb{Q^{+}}$ of positive rationals by $a\mathbin{R}b$ iff $a/b \in H$.

Let $H = \{2^m : m \in \mathbb{Z}\}$ and define a relation $R$ on the set $\mathbb{Q^{+}}$ of positive rational numbers by $a\mathbin{R}b$ if and only if $a/b \in H$. Prove that $R$ is an equivalence ...
1
vote
1answer
85 views

How do you pronounce $\preceq$?

I've been reading about partial orders and partially ordered sets and have come across sentences like "Suppose that $\preceq$ is a partial order on $X$" and "If $x\preceq y$ and $y \preceq z$ then $x \...
2
votes
1answer
34 views

Count a Partial Equivalence Relations on a set

A Partial Equivalence Relation is a relation that is symmetric and transitive, and to count the number of equivalence relations on a set exists Bell Numbers, my question is How I can count the number ...
0
votes
0answers
14 views

Let $A$ be a nonempty set. Prove that if $S$ and $R$ are equivalence relations on $A$, then $S \cup R$ is both reflexive and symmetric.

Let $A$ be a nonempty set. Prove that if $S$ and $R$ are equivalence relations on $A$, then $S \cup R$ is both reflexive and symmetric. My method: Let $x \in A$ be given. Then $x \in S$ or $x \in R$....
3
votes
2answers
30 views

A relation $R$ is defined on $\mathbb{Z}$ by $aRb$ if and only if $2a + 2b\equiv 0\pmod 4$. Prove that $R$ is an equivalence relation.

A relation $R$ is defined on $\mathbb{Z}$ by $aRb$ if and only if $2a + 2b\equiv 0\pmod 4$. Prove that $R$ is an equivalence relation. My method: Let $a \in \mathbb{Z}$ be given. So, for any $a \in \...
1
vote
0answers
17 views

Let A be a set with $\lvert A \rvert$ = $4$. What is the max number of elements tht a relation R on A can contain so tht $R \cap R^{-1}$ = $\emptyset$

Let A be a set with $\lvert A \rvert$ = $4$. What is the maximum number of elements that a relation R on A can contain so that $R \cap R^{-1}$ = $\emptyset$? I am not sure at all how to start this ...
0
votes
1answer
14 views

Let A be the set of U. S. states. One example of a relation on A is $R = [(s,t) : s = t or s shares a border with t].

Let A be the set of U. S. states. One example of a relation on A is R = {(s,t) : s = t or s shares a border with t}. Notice that the domain of R is A, and the range of R is A. Give a different ...
0
votes
0answers
14 views

Determine whether the following relation is reflexive, symmetric, antisymmetric and/or transitive?

Q is defined on P(N) by aQb iff |a ∩ b| ≥ 2. I've concluded that it's symmetric, not reflexive, not antisymmetric and not transitive. Is this right?
-1
votes
1answer
18 views

Relation that is reflexive, transitive, but not antisymmetric [on hold]

A = {1,2} R = {(1,2)} I was just wondering if this relation meets the criteria.
1
vote
1answer
64 views

Are R,S and T equivalence relation or partial order relation?

Let $R$, $S$ and $T$ be binary relations defined as follows R is defined on $P(\mathbb{N})$ by $ARB$ if and only if $|A∩B| ≥ 2$ $S$ is defined on $Q$ by $x\mathbin{S}y$ if and only if $|x|=|y|$. (...
0
votes
2answers
40 views

How to tell if the relations R, S and T are reflexive, symmetric, anti-symmetric or and transitive?

Let $R$, $S$ and $T$ be binary relations defined as follows R is defined on $P(\mathbb{N})$ by $ARB$ if and only if $|A∪B| ≥ 2$ $S$ is defined on $Q$ by $xSy$ if and only if |$x$|=|$y$|. (Note that ...
0
votes
0answers
17 views

Determine whether this relation is reflexive, symmetric, antisymmetric and/or transitive?

R is defined on N × N (where N are natural numbers) by (a, b)R(c, d) iff a ≤ c and b ≤ d. I think it's reflexive and transitive. Not too sure about it being symmetric or antisymmetric. Any help ...
0
votes
1answer
35 views

What is the difference between total order relations and well order relations?

I know it has to be a partial order relation in order for it to be a well order relation or total order relation, but what are the differences between them.
0
votes
1answer
23 views

What is the difference between partial order relations and equivalence relations?

From googling it i understood that a relation is both partial order relation and equivalence relation when they are reflexive, symmetric and transitive. So it appears they are the same. But as far I ...
1
vote
1answer
21 views

Write out relation from a function

I have this problem: "Let $R$ be a binary relation $(x,y)\in R$ if and only if $f(x) = f(y)$ where $f: \{a, b, c, d\} \rightarrow \{0, 1\}$ given by $f(a) = 0$, $f(b) = 1$, $f(c) = 0$, $f(d) = 0$ ...
2
votes
1answer
44 views

Functions: Relations

I'm stuck on this question and would appreciate the solution, thanks! Let $R$ and $S$ be the relations on $A = \{1,2,3,4,5\}$ given by$$R = \{(1,2),(2,3),(3,4),(4,5)\}\\S=\{(2,3),(2,4),(3,4)\}$$...
0
votes
2answers
36 views

Prove by contradiction that If $R$ is a transitive relation on set $A$ then $R^2$ is transitive.

I saw this problem and read through it but I am still kind of confused as to what $u_1$ and $u_2$ stand for. Prove by contradiction that for a transitive relation $R$ on $A$, $R^2$ is also transitive ...
0
votes
2answers
39 views

Equivalence relation and equivalence classes given function and relation

Given a function $f : A → B$, let $R$ be the relation defined on $A$ by $aRa′$ whenever $f(a) = f(a′)$. Prove that $R$ is an equivalence relation and determine the equivalence classes. To prove that $...
0
votes
0answers
31 views

Which of the following are equivalence classes?

For example 37, I've determined which ones are equivalence relations but am having trouble on example 37: 1-7 determining which of the following are equivalence classes. I'm having trouble ...
1
vote
0answers
13 views

Symmetric and reflexive closure on positive integers

Finding the symmetric and reflexive closure of the relation $R = \{(a, b) | a > b\}$ on the set of positive integers. For symmetric closure I have: $R = \{(a, b) | a > b\} U \{(b, a) | a > b\...
1
vote
2answers
29 views

Counting number of relations that are symmetric and reflexive.

I've looked at the other two problems similair to mine but I'm having a bit of an issue understanding as their solutions seems a bit more complex. While I for the most part understand my professors ...
0
votes
0answers
35 views

Equivalence Relations and Cardinality

I'm looking at the question below from a past paper: What is an equivalence relation? Say that two sets $X$ and $Y$ are related via the relation $\rho$ if $X$ and $Y$ have the same cardinality. Prove ...
-4
votes
1answer
35 views

Let f be the function from $A = \{a, b, c, d\}$ to $B = \{e, f, g, h\}$ given by $f = \{(a,e), (b,f), (c,g), (d,g)\}$. [closed]

Let $f$ be the function from $A = \{a, b, c, d\}$ to $B = \{e, f, g, h\}$ given by $f = \{(a,e), (b,f), (c,g), (d,g)\}$. If $D = \{a,b\}$, what is $f(D)$? If $G = \{f,g\}$, what is $f^{-1}(G)$? If $...
0
votes
1answer
14 views

Confirming my understanding in determining if a relation is reflexive, symmetric, or transitive

I think I have a grasp on how to determine if a relation is reflexive, symmetric, or transitive. Just to make sure I understand it correctly, if I have the following relation: for $(a,b) \in \mathbb{...
0
votes
1answer
20 views

Can you use constants from the domain in a First Order Formula? [closed]

Say I have a First Order Signature defined like so: $N = (\{1,2,3\dots\},T)$ Where T is a binary relation symbol. Can I use values from the domain to define functions over this signature? For ...
0
votes
0answers
20 views

Maximize function over a a set with a transitive and antisymmetric relation

Let $\mathcal{R}$ be a transitive and antisymmetric relation defined over a finite set $X$. For any set $S\subseteq X$ let $\Gamma(S)=\left\{y\in S ,\not \exists x\in S \mid (x,y)\in\mathcal{R}\...
0
votes
1answer
23 views

Finding equivalence classes in a set of functions with a condition

I can't seem to work around this problem... Let $n$ and $m$ be two positive integers. $F$ is the set of functions from {1,..,n} to {1,...,m}. We define the relation $R$ as: $f R g$ if and only if ...
0
votes
0answers
12 views

Determining if Poset based on Domain and Comparison Operator?

Can someone help me with how to think about the below problem? I know that a poset is a relation which is reflexive, antisymmetric, and transitive, but unless I'm dealing with finite sets I have a lot ...
0
votes
1answer
16 views

Determine if given relation is an equivalence relation, and describe the partition?

Can someone walk me through how to do these types of problems in my Discreet Mathematics II Textbook? (ex.): Determine whether the given relation is an equivalence relation on the set. Describe the ...
2
votes
1answer
5 views

Finding pairs with respect to lexicographic order that meet a condition from a set?

I am working some problems out of my textbook for Discrete Mathematics II and was wondering if someone could tell me how to think through and go about solving the following type of problems (there are ...
1
vote
2answers
19 views

Question about the exclusive or operator

Let $R_1$ be the “less than” relation on the set of real numbers and let $R_2$ be the “greater than” relation on the set of real numbers, that is, $R_1 = \{(x, y) | x < y\}$ and $R_2 = \{(x, y) | x ...