Assertion: function | /r/HasProperty | surjective
Facets:
value: trivially
type: DEGREE
Source sentences:
text: The function f is surjective (or onto, or is a surjection) if the range equals the codomain, that is, if f(X) = Y.
text: Because a function is trivially surjective when restricted to its image, the term partial bijection denotes a partial function which is injective.
text: The function is surjective because every element in the codomain is the value of f(x) for at least one element x in the domain.
text: The function is surjective because every element in the codomain is the value of) for at least one elementin the domain.
text: Equivalently, a function f with domain X and codomain Y is surjective, if for every y in Y, there exists at least one x in X with f ( x )
text: The function f would be surjective only if there were no blue points.
text: A function is bijective if and only if it is both surjective and injective.
text: That is, for A function is surjective if it is "onto.
text: A function is bijective if it is both surjective and bijective.
text: Therefore, this function is non-surjective!
text: The codomain affects whether a function is a surjection, in that the function is surjective if and only if its codomain equals its image.