Prove Q is the equivalence relation on A

Click For Summary

Homework Help Overview

The discussion revolves around proving that a relation Q defined on set A is an equivalence relation. The context involves understanding the properties of equivalence relations and how they apply to a function f mapping from A to B, where R is already established as an equivalence relation on B.

Discussion Character

  • Conceptual clarification, Assumption checking, Problem interpretation

Approaches and Questions Raised

  • Participants are exploring the definition of equivalence relations, specifically the requirements for reflexivity, symmetry, and transitivity. There are questions regarding the meaning of the notation used and the relationship between elements in sets A and B. Some participants express confusion about how to connect elements in A through their images in B.

Discussion Status

The discussion is ongoing, with participants seeking clarification on definitions and properties of equivalence relations. Some guidance has been provided regarding the need to demonstrate that Q satisfies the properties of reflexivity, symmetry, and transitivity, but there is no explicit consensus on how to proceed with the proof.

Contextual Notes

There are indications of confusion regarding the notation and the relationship between the sets A and B, particularly concerning the domains and ranges of the function f. Participants are also grappling with the implications of using notation typically associated with real numbers in this context.

Hirman
Messages
5
Reaction score
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.
 
Physics news on Phys.org
what is equivalence relation by definition?
 
R is an equivalence relation on R iff R is a binary relation on A that is reflexive on A, symmetric and transitive
 
Hirman said:
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?
 
PeroK said:
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)
 
Hirman said:
is a binary relation on A
what is arbitrary relation on A
 
Hirman said:
reflexive on A, symmetric and transitive
write the formulas
 
PeroK said:
What does mean?
I think that it is not a good idea to use notation for reals
 
  • Like
Likes   Reactions: Delta2
Hirman said:
f(x)∈ dom(R), f(y)∈ ran(R) and f(x)Rf(y)
Ah! I missed that. So what's the difficulty here?
 
  • #10
How to prove Q is an equivalence relation on A?
 
  • #11
Hirman said:
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
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
Hirman said:
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:

Hirman said:
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
Hirman said:
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)##.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
6
Views
3K
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K