Proving f(f⁻¹(B)) = B for All B in Y

  • Thread starter Thread starter The Captain
  • Start date Start date
The Captain
Messages
21
Reaction score
0

Homework Statement


Prove that if f: X \rightarrow Y is onto, then f(f^{-1}(B))=B \forall B \in Y

Homework Equations


The Attempt at a Solution

 
Last edited:
Physics news on Phys.org
What does it mean for a function to be onto? What kind of inverse does f possesses iff it is onto?
 
Onto means that for a function f:A \rightarrow B if \forall b \in B there is an a \in A: f(a)=b

The inverse means that if you take the f^{-1}(b) that it should map back to a?
 
Correct. But note that a right inverse exists if the function is onto. I.e., if g is a right inverse of f, then f(g(y)) = y, for every y in Y. What you need to prove is a direct consequence of this fact. (I used "g" rather than "f^-1" for the right inverse to avoid confusion leading to a conclusion that f^-1 is an inverse, i.e. both left and right).
 
So I need to prove that if f(y)=Y and f^{1}(Y)=y, that f(f^{1}(Y))=Y?
 
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