Set theory, functions, bijectivity

Daveyboy
Messages
57
Reaction score
0
f:X\rightarrowY, A\subsetX
f(Ac)=[f(A)]c implies f bijective.

Just trying to apply the definitions of injective and bijective. The equivalence makes sense but I am having a hard time showing it.

f(x)=f(y) implies x=y and for every y in Y there exists a x in X s.t. f(x)=y.

I mean all I have is if f(x)=f(y)
then f(X\x)=Y\f(x\x)=f(X\y)-Y-f(X\y)...
 
Last edited:
Physics news on Phys.org
what's the question?
 
Daveyboy said:
f(Ac)=[f(A)]c implies f bijective.
this implication
 
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