I haven't been able to do this exercise:
Let f:A→B be any function. f−1(X) is the inverse
image of X. Demonstrate that if f is surjective then X=f(f−1(X)) where X⊆B.
Since X⊆B, all the elements in X belong to the codomain of f.
Since f is surjective, it means that all elements in the codomain B have some preimage in A. Given that X⊆B, all elements in X must also have a preimage in A.
Have △=f−1(X), △ is now a set containing the preimages of the elements in X. Because of this, △⊆A.
If we evaluate f(△), we...... nope, I don't know what I'm doing now.
What do you think?
No comments:
Post a Comment