# Equivalence relations

1. Aug 22, 2010

### eXorikos

1. The problem statement, all variables and given/known data
Given is the set X. The set of functions from X to [0,1] we call Fun(X,[0,1]). On this set we consider the relation R. An ordered pair (f,g) belongs to R when $$f^{-1}(0)\setminus g^{-1}(0)$$ is a countable set.

a) Prove that R is transitive.

b) Is R an equivalence relation? Prove!

c) Prove that $$R \cap R^{-1}$$ is an equivalence relation.

2. Relevant equations
Transitive means that if (f,g) and (g,h) belong to the relation, that also (f,h) belongs to it.

Equivalence relation is a relation that is transitive, reflexive ($$(f,f) \in R$$ and symmetric ($$(f,g) \in R \Rightarrow (g,f) \in R$$.

3. The attempt at a solution
a) $$f^{-1}(0)\setminus g^{-1}(0)$$ is a countable set. So $$f{-1}(0)$$ is a countable set. This means that $$f^{-1}(0)\setminus h^{-1}(0)$$, because a subset of a countable set is also countable.

Is this correct?

b) Reflexivity is easy, because $$f^{-1}(0)\setminus f^{-1}(0)$$ is the empty set so that is obviously countable.
How do I prove that it is symmetric?

c) Is this just the subset of all the reflexive pairs?

Last edited: Aug 22, 2010
2. Aug 22, 2010

### vela

Staff Emeritus
You can't conclude $f^{-1}(0)$ is countable. For instance, suppose X is R, the set of real numbers, and f(x)=g(x)=0. Then $f^{-1}(0)\setminus g^{-1}(0)$ is the empty set, but $f^{-1}(0)=R$, which is not countable.

Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook