Prove Q is the equivalence relation on A

  • Thread starter Hirman
  • Start date
  • #1
5
0
Homework Statement:
Assume that f:A—>B and that R is an equivalence relation on B
Define Q to be the set {<x,y> ∈ A X A |<f(x),f(y)> ∈ R}
Relevant Equations:
Define Q to be the set {<x,y> ∈ A X A |<f(x),f(y)> ∈ R}
I can’t understand it.
 

Answers and Replies

  • #3
5
0
R is an equivalence relation on R iff R is a binary relation on A that is reflexive on A, symmetric and transitive
 
  • #4
PeroK
Science Advisor
Homework Helper
Insights Author
Gold Member
2020 Award
18,117
9,807
Homework Statement:: Assume that f:A—>B and that R is an equivalence relation on B
Define Q to be the set {<x,y> ∈ A X A |<f(x),f(y)> ∈ R}
Relevant Equations:: Define Q to be the set {<x,y> ∈ A X A |<f(x),f(y)> ∈ R}

I can’t understand it.
What does ##\langle f(x), f(y) \rangle \in \mathbb R## mean?
 
  • #5
5
0
What does ##\langle f(x), f(y) \rangle \in \mathbb R## mean?
f(x)∈ dom(R), f(y)∈ ran(R) and f(x)Rf(y)
 
  • #9
PeroK
Science Advisor
Homework Helper
Insights Author
Gold Member
2020 Award
18,117
9,807
f(x)∈ dom(R), f(y)∈ ran(R) and f(x)Rf(y)
Ah! I missed that. So what's the difficulty here?
 
  • #10
5
0
How to prove Q is an equivalence relation on A?
 
  • #11
PeroK
Science Advisor
Homework Helper
Insights Author
Gold Member
2020 Award
18,117
9,807
How to prove Q is an equivalence relation on A?
Okay, what exactly is stopping you getting started? The rules are you have to show an attempt at a solution.
 
  • #12
5
0
I’m sorry.But I have no ideal how to get start.I can't see the connection between x and y in A, the only connection is in B.But B is another set.
 
  • #13
PeroK
Science Advisor
Homework Helper
Insights Author
Gold Member
2020 Award
18,117
9,807
I’m sorry.But I have no ideal how to get start.I can't see the connection between x and y in A, the only connection is in B.But B is another set.

You know this:

R is an equivalence relation on R iff R is a binary relation on A that is reflexive on A, symmetric and transitive

That's true for ##Q## as well, right? In fact, I would have written:

An equivalence relation (on a set) is a binary relation (on that set) that is reflexive, symmetric and transitive.

You need to prove that ##Q## is reflexive, symmetric and transitive. Okay? That's you started.
 
  • #14
vela
Staff Emeritus
Science Advisor
Homework Helper
Education Advisor
15,130
1,724
f(x)∈ dom(R), f(y)∈ ran(R) and f(x)Rf(y)
That's not right. You're told f is a function from A to B, so x and y are in A = dom(f) while f(x) and f(y) are in B = ran(f).

##\langle f(x), f(y) \rangle \in R## is just another way of writing ##f(x) R f(y)##.
 

Related Threads on Prove Q is the equivalence relation on A

Replies
2
Views
981
Replies
4
Views
5K
Replies
3
Views
772
  • Last Post
Replies
3
Views
10K
Replies
9
Views
5K
  • Last Post
Replies
4
Views
706
Replies
3
Views
2K
Replies
4
Views
3K
Top