Equivalence Classes of Continuous Functions with a Common Value at x=4

polarbears
Messages
23
Reaction score
0

Homework Statement


Identity if it is an equivalence relationship and describe the equivalence class.

The relationship T on the set of continuous functions mapping R to R, where fTg iff f(4)=g(4)

Homework Equations





The Attempt at a Solution



It is an equivalence relationship just by inspection, but I don't understand how to describe the equivalence class.
 
Physics news on Phys.org
"Just by inspection" is, in my mathematical opinion, not a good enough argument. You need to show that T satisfies the properties (e.g. fTf; if fTg then gTf, etc).

Let's consider a single continuous function f from R to R. Can you describe in words all functions that are equivalent to it (w.r.t T)?
 
Alright--hehe yeah I was getting lazyUmm all functions that intersect this function at 4?
 
Assuming you meant: all continuous functions mapping R to R which intersect f(x) at x = 4, yes :)

So what do the equivalence classes of T look like? For example, if I asked you to write them all down like [c] = { ... }, where c is a label for the equivalence class?
 
Wait so my answer wasn't right? or is it?

How about this...
The equivalence class of T are sets of all continuous functions mapping R to R which intersect f(x) at x = 4?

But then I feel like that's just restating what the equivalence relationship is in the 1st place
 
CompuChip was just making your previous statement more precise, but his question wasn't exactly the same as asking what the equivalence classes were. He's trying to get you to make that final leap now.

All the functions in an equivalence class share a common trait. What is it that characterizes all the functions that belong to a specific equivalence class? Note this time you don't have a specific f(x) you can compare the rest to.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top