I recently learned about equivalence relations and how equality between integers is an example of an equivalence relation. I also learned that operations such as addition (and possibly relations like equality) may be defined differently on different objects.
Consider the set of ordered pairs of natural numbers, $S=\mathbb{N}\times\mathbb{N}$. Then following is an equivalence relation on $S$:
Let $(a,b),(c,d)\in S$. Then $(a,b)R(c,d)$ if $a+d=b+c$.
I was wondering if we can define equality between elements of $S$ by the above relation. I suppose that we typically define equality on $S=\mathbb{N}\times\mathbb{N}$ as we do in $\mathbb{R}^2$:
Let $(a,b),(c,d)\in S$. Then $(a,b)=(c,d)$ if $a=c$ and $b=d$.
According to Wikipedia Definition of Equality, $x=y$ if and only if, given any predicate $P$, $P(x)$ if and only if $P(y)$. Would the following be an example to show that the definition of equality as $(a,b)=(c,d)$ if $a+d=b+c$ is invalid?
Under this definition of equality for elements of $S$, $(2,3)=(4,5)$. If $P$ is the predicate, $s\in S$ has first coordinate $2$, then $P(2,3)$ is true but $P(4,5)$ is false.
If so, would the only acceptable definition of equality in $S$ be $(a,b)=(c,d)$ if $a=c$ and $b=d$? This question Defining an Equality appears to be relevant but I am not sure how to interpret I.4.
Thank you for your help. I would appreciate an explanation suitable for a undergraduate like myself.
In the standard set theory of Zermelo-Fraenkel, two objects are equal if they are the same set, i.e. if all their elements are the same (axiom of extensionality).
This said, you can define different kind of equalities on sets -basing on your needs- through, for instance, equivalence relations. This does not violate the equality in ZF, it is just an internal definition (e.g. equivalence relation) that you can call "equality", but it is not the actual equality of sets.
What you are trying to define seems to be the set-theoretical definition of integers $\mathbb{Z}$. Integers are usually defined as $(\mathbb{N}\times \mathbb{N})/ R$, where $R$ is the equivalence relation on $S=\mathbb{N}\times \mathbb{N}$ that you defined.
The idea behind this definition is that a pair $(a,b)\in S$ in meant to represent $a-b$, thus $a-b=c-d \iff a+d=c+b$. The definition uses the sum instead of the difference because $\mathbb{N}$ is closed under the sum but not under difference, so using the sum $a+d=c+b$ allows us to define the relation without using the integers (which would be a problem since we are just defining them).