For reflexive, symmetric and transitive relations. Use it with the tag (relations).

learn more… | top users | synonyms

0
votes
1answer
11 views

These maps from the components into a directed system are injective when the directed system maps are.

Let $I, p_{ij} : A_i \to A_j$ be a directed system of maps such that $p_{jk}\circ p_{ij} = p_{ik}$ whenever $i \leq j\leq k$ and $p_{ii} = \text{id}$. Directed means that for any $i,j \in I$ there ...
0
votes
1answer
12 views

Proving that the direct limit of a directed system is an equivalence relation.

From Dummit & Foote, pg. 268: Let $I$ be an index set with a partial order. Suppose for every pair of indices $i, j \in I$ with $i \leq j$ there is a map $\rho_{ij} : A_i \to A_j$ such that ...
0
votes
0answers
6 views

Equivalence relation in the collection of all normed linear space over some field K.

The concept of equivalent norm produce an equivalence relation in the collection of all normed linear space over some field K. I've no idea how to make a start... Please help
-1
votes
1answer
22 views

How to prove, that $\sim$ is an equivalence relation? (affine equivalence)

Two quadrics $Q_1$ and $Q_2$ in $\mathbb{R}^n$ are affine equivalent, $Q_1\sim Q_2$, if there exists an affine map $f:\mathbb{R}^n\rightarrow\mathbb{R}^n$ with $Q_2=f(Q_1)$. How do I prove, that ...
3
votes
1answer
57 views

Isomorphic or equal?

Let $\sim_n$ be the usual equivalence relation of congruence modulo $n$ in $\mathbb{Z}$, i.e., for $a,b\in\mathbb{Z}$, $a\sim_nb\Leftrightarrow a-b=k\cdot n$ for some $k\in\mathbb{Z}$. For $n=0$ the ...
0
votes
2answers
22 views

Partition and Equivalence Relation: In $\mathbb{Z}$, let $m\sim n$ iff $m - n$ is a multiple of 10

Prof. Pinter's "A Book of Abstract Algebra" presents this exercise: Prove that each of the following is an equivalence relation on the indicated set. Then, describe the partition associated with ...
1
vote
1answer
61 views

Facing problem to understand the equivalence class concept.

Currently I am trying to understand the equivalence class from the Herstein's book. And I am facing problem to understand the concept and also can't understand the theorem given in the page number 8. ...
2
votes
4answers
33 views

Proof of theorem about equivalence classes

I am looking to understand the following theorem, and I am also wondering what is meant by "mutually disjoint", or at least how it's to be understood in the following context: The distinct ...
0
votes
1answer
40 views

Equivalence Relations OF sets [duplicate]

We define the relationship between the two sets $S_1≡S_2$ if and only if $|S_1|=|S_2|$. How to show that $≡$ is an equivalence relation ? sorry I'm from Iran and Basic my English is poor.
0
votes
1answer
18 views

Determine whether the given relation is an equivalence relation

Problems: 1.) R = {(0, 0), (0, 1), (0, 2), (1, 1), (1, 2), (2, 2)} 2.) R = {(x, y) ¦ y - x is an odd integer} 3.) R = {(x, y) ¦ y - x is a multiple of 3} Attempt: By definition, a relation is ...
0
votes
0answers
9 views

Construction from a semiring

Hello guys! Reading about abstract algebra,I came across something I didn't really understand and don't even know where to look for it,as I don't know the name. can you please help me,? Thanks!
1
vote
2answers
20 views

Simple verification: is this equivalence always true?

I have a constrained optimization problem and I am trying to reduce the number of contraints and am afraid to be losing information by doing so. If we have two constraints as the following $$A \geq B ...
1
vote
0answers
19 views

Defn of invariant SET under an equivalence relation?

This is, I am sure, an easy question but something I did not see in my undergrad years and wikipedia does not define it. For a function or a relation or a property to be invariant under an equivalence ...
1
vote
3answers
35 views

Prove: In $\mathbb{Z}$, m ~ n iff $|m|=|n|$

Prof. Pinter's "A Book of Abstract Algebra" presents this exercise: Prove that each of the following is an equivalence relation on the indicated set. Then describe the partition associated with ...
-1
votes
1answer
47 views

Prove $\lbrace A_n : n \in \mathbb{Z}\rbrace$ is a partition of $\mathbb{Q}$

Dr. Pinter's "A Book of Abstract Algebra" presents the following exercise: Prove that each of the following is a partition of the indicated set. Then describe the equivalence relation with that ...
1
vote
1answer
26 views

Prove: $\langle A_0, A_1, A_2, A_3, A_4 \rangle$ is a partition of $\mathbb{Z}$

The following exercise from Dr. Pinter's "A Book of Abstract Algebra" presents this exercise: Prove that each of the following is a partition of the indicated set. Then describe the equivalence ...
1
vote
1answer
36 views

How do I show that the equivalence relation defining the rational numbers is transitive?

I apologize if this is a super easy question, but there is something fishy about my proof. I was to show: $$(p,q) \sim (m,n) \wedge (m,n) \sim (a,b) \implies (p,q) \sim (a,b) $$ under the ...
0
votes
0answers
21 views

Why is equivalence 'class', not equivalence 'set'? [duplicate]

Why do we call it a class, not a set? Is it not a set? Can it be a proper class?
2
votes
4answers
123 views

In what mathematically rigorous sense does $ \mathbb{Q}$ extend $\mathbb{Z}$?

I was trying to understand rigorously what the word "extends" means in this context, pin it down formally with the correct mathematical language. First, let me explain some of my thoughts and the ...
12
votes
1answer
110 views

What do you get with this equivalence relationship for all $\mathbb{Q}$ sequences

Consider all $\mathbb{Q}$ Cauchy sequences with this equivalence relationship $\{x_n\} \sim \{y_n\} \iff \{x_n-y_n\} \rightarrow 0$ Then you get all real numbers as an equivalence class with this ...
0
votes
0answers
50 views

Quotients vs equivalence relations

In a recent preprint I defined the category of quasi-frames (qframes for short) as follows: a qframe is a modular and upper continuous complete lattice; a morphism of qframes $f:L_1\to L_2$ is a map ...
0
votes
0answers
17 views

Best approach to determine the equivalence classes of a formal language

I created a minimum automaton for a formal language using the Myhill-Nerode theorem. The language for which I created the automaton is defined by $L=\{w \in \{a,b\}^*:w=av \text{ for a word } v ...
0
votes
3answers
38 views

Linear/Discrete Math Equivalence Classes

I am confused on this question: For each of the following binary relations on $\Bbb R$, state whether or not the relation is an equivalence relation. If it is an equivalence relation, describe the ...
3
votes
0answers
33 views

Proving Equivalence Relation $xPy$ iff $ y = x + n\pi$ on The Reals

I am trying to prove that the relation P on $\mathbb{R}$ by the rule $\forall x, y \in \mathbb{R}, xPy \text{ if and only if } \exists n \in \mathbb{Z} \text{ such that }y = x+ n\pi$ From what I can ...
0
votes
2answers
35 views

If S is finite then the equivalence classes will not exceed the size of set S

If S is a finite set and $\sim$ is an equivalence relation on it, then the total number of equivalence classes can never exceed $\vert S\vert$ and it can be any integer number $1\leq k\leq\vert ...
0
votes
1answer
31 views

Equivalence relation for which there are infinitely many equivalence classes.

On set $\mathbb{R}$ and the relation on it where $x\sim y$ if $x^{4}=y^{4}$. Then $\sim $ is equivalence relation for which there are infinitely many equivalence classes, one of which consists ...
6
votes
1answer
159 views

Confusion between an element and its preimage

Let $X$ be a set and $\sim$ is an equivalence relation on $X$, so that the quotient set $X/_\sim=\bigcup_{x\in X}{[x]}$ with $[x]=[y]$ if and only if $x\sim y$. Consider the quotient map $f:X\to ...
0
votes
2answers
23 views

How to proof equivalence relation?

I need help with this problem: Let $S=\left\{\left[\begin{matrix} a & b \\ c & d \end{matrix}\right] : a,b,c,d \in \mathbb{C}\right \}$ and $M=\left\{\left[\begin{matrix} a & b \\ ...
0
votes
2answers
20 views

What is an algorithm for describing the partition of this equivalence relation?

Let $\mathbb{R}$ be the set of real numbers,$ f : \mathbb{R} \to \mathbb{R}$ a map, and $E$ the equivalence relation on $ ℝ $ defined by $E = \{(x,y) \in \mathbb{R} \times \mathbb{R} \mid ...
3
votes
2answers
29 views

Test for symmetric property of this ordered pair

Suppose the set $$S={1,2,3}.$$ I must show that the equivalence relation $$R=\{(1,1),(1,3),(2,2),(3,1),(3,3)\}$$ is on the set. The reflexive property states that: $$(a,a) \in R \;\forall a \in ...
2
votes
1answer
71 views

Can a relation be both anti-reflexive and anti-symmetric?

Is it possible for a relation to be both anti-reflexive and anti-symmetric?
2
votes
0answers
89 views

Relative Identity vs Set Theory

The last complete, but unpublished, paper by the late Tom Etter titled "Three-Place Identity" purports to prove that all of mathematics can be expressed in terms of relative identity. In his own ...
0
votes
1answer
15 views

Anti-symmetric or asymmetric for a relation between pairs in the set of Z x Z?

Is this anti-symmetric or asymmetric? I at first thought asymmetric because anti-symmetric would mean a = c and b = d which would not be true. But because the domain is the Cartesian product of ...
0
votes
1answer
32 views

Equivalence relations regarding binary relations

Let $R \subseteq X \times X$ be a binary relation for $X = \{a, b, c, d\}$. $R = \{(a, a), (b, c), (c, d), (b, d)\}$. Is the relation an equivalence relation? I don't know if I am proving it correctly ...
0
votes
1answer
21 views

A question on eqivalence relation

Please explain what the examiner means by asking: Also find [3,6] in Q 1 (a)(i)??
2
votes
1answer
36 views

Does this notion of “weak” isomorphism exist in literature?

Let $(M,\circ)$ and $(N,\ast)$ be two magmas. I'd like to relax the notion of isomorphism by defining a notion of "weak" isomorphism in the following way: $M$ and $N$ are "weakly" isomorphic if there ...
7
votes
1answer
85 views

When is the closure of an equivalence relation automatically an equivalence relation?

Let $X$ be a topological space, not necessarily nice, let $R$ be a subspace of $X \times X$, and let $\overline{R}$ be the closure of $R$ in $X \times X$. Then: If $R$ is a reflexive binary relation ...
2
votes
3answers
87 views

About the group of units

I'm stuck at this section of the following problem: Let $R$ be a commutative ring and $S$ be a subset of $R$, with $S$ multiplicatively closed. Find the group of units of $S^{-1}R$. My try: ...
0
votes
2answers
42 views

Well-defined and Equivalence relations

I am wondering why the following is well-defined... The definition of well-defined is given as; $g:(X/\sim) \to Z$ is well-defined if a mapping $f:X \to Z$ can be found where $f$ has the property $x ...
1
vote
2answers
19 views

Equivalence classes in $\mathbb{Z}_n$

I've the following exercise: Solve each of the following equations in the given set $\mathbb{Z}_n$: 1) $[5]+x=[1]$ in $\mathbb{Z}_9$ 2) $[2]\cdot x=[7]$ in $\mathbb{Z}_{11}$ For 1), is $x=5$ ...
0
votes
1answer
54 views

Proof of an equivalence relation

Let S be the relation on R defined by $xSy \Leftrightarrow x=|y|$, $\forall x,y\in\Re$ Is the relation reflexive, symmetric and/or transitive? By my proof that 1) $x=|y| \Rightarrow |y|=x$ ...
0
votes
1answer
27 views

Equivalence classes of $\Bbb Z$ with the operation $\mod n$

So I came across this phrase in my abstract algebra textbook: The integers $\mod n$ also partition $\Bbb Z$ into $n$ different equivalence classes; we will denote the set of these equivalence ...
0
votes
2answers
26 views

simple clarification of equivalence relation and order relation notation meaning

So by definition an equivalence relation is a binary relation on a subset of the cartesian product of our set A, i.e $A\times A$ satisfying the 3 conditions. But I'm a little confused about ...
0
votes
1answer
17 views

More clarification on an equivalence relation problem already answered

So this problem already has a solution: Problem with Equivalence Relations I'm good for the majority of it except for part c), I wasn't able to figure that out on my own or by looking at the ...
1
vote
1answer
42 views

Isn't reflexivity and symmetry implied in equivalence relations?

It looks like for all "nice" sets, the set $S\times S$ will have symmetry and reflexivity by default. The tough part is usually showing transitivity. However, are there any non-empty sets such that ...
1
vote
1answer
37 views

How to understand this definition of equivalence relations

I often see this type of definitions of equivalence: Suppose that $f$ and $g$ are differentiable on $\mathbb R$. We can define an equivalence relation on such functions by letting $f(x) \sim g(x)$ ...
4
votes
1answer
37 views

Defining Equivalence relations

So I am not really comfortable with equivalence relations, so this example from Wikipedia gives me trouble. Here is what it says: Let the set $\{a,b,c\}$ have the equivalence relation ...
2
votes
1answer
25 views

Intersection of two sets which are equivalence on set A is always equivalence?

If $R_{1}$ and $R_{2}$ are equivalence relations on set A ,then$ R_{1}\bigcap R_{2}$ must be equivalence relation. firstly, I am not understanding the function of R,I think that, this is only a ...
3
votes
2answers
30 views

why are equivalence relations called so?

"an equivalence relation is the relation that holds between two elements if and only if they are members of the same cell within a set that has been partitioned into cells such that every element of ...
0
votes
1answer
15 views

Transitive Relations Problem,

Let S be the set of all three-digit numbers, and define x~y to mean that x and y have the same first and last digit. (i) Show that the relations ~ is transitive. (ii) List two numbers in the ...