From Wikipedia, I've seen that the definition of surjective function is the following:
If
f:X→Ythen, f is said to be surjective if
∀y∈Y∃x∈Xs.t. f(x)=y.
On the other hand, we can define surjectiveness by saying that f is surjective iff the codomain of f is equal to its image, f(X), i.e. if:
codomain of f =f(X)={y:y∈Y∧(∃x∈X:f(x)=y)}.
Why these two definition are the same? And, in general, how can i prove it?
Answer
In general the image of a function f:X→Y is denoted with f(X), and by definition it is a subset of Y, so f(X)⊆Y. If f is surjective, then Y⊆f(X), because for every y∈Y you can find x∈X such that y=f(x), so y∈f(X). To sum up, f(X)⊆Y and Y⊆f(X), which by double inclusion means f(X)=Y.
No comments:
Post a Comment