• Support PF! Buy your school textbooks, materials and every day products Here!

Proving an equivalence relation using inverse functions

  • Thread starter The1TL
  • Start date
  • #1
26
0

Homework Statement


Let f : A → B be a function and let Γ ⊂ B × B be an equivalence relation on B. Prove that the set (f × f)^-1 (Γ) ⊂ A × A (this can be described as {(a, a′) ∈ A × A|(f(a), f(a′)) ∈ Γ}) is an equivalence relation on A.


Homework Equations





The Attempt at a Solution


Let (f(a),f(a’)) ⊂ Γ. Since f(a) and f(a’) hold an equivalence relation with eachother, it follows that a and a’ hold an equivalence relation with eachother. Since f(a) and f(a’) are arbitrary elements of Γ, it follows that (fxf)-1Γ ⊂ A x A is an equivalence relation on A.

I'm not sure if thi is the right approach. In particular im not sure that i can say that f(a) and f(a') holding an equivalence relation means that a and a' hold one too.
 
Last edited:

Answers and Replies

  • #2
26
0
Does anybody know if im correct? I'm not sure if I'm skipping steps.
 

Related Threads on Proving an equivalence relation using inverse functions

  • Last Post
Replies
3
Views
9K
Replies
4
Views
4K
  • Last Post
Replies
1
Views
4K
Replies
3
Views
653
Replies
0
Views
1K
Replies
8
Views
1K
  • Last Post
Replies
4
Views
13K
  • Last Post
Replies
2
Views
1K
  • Last Post
Replies
4
Views
2K
Top