In mathematics, a surjective function (also known as surjection, or onto function /ˈɒn.tuː/) is a function f such that, for every element y of the function's...

In mathematics, injections, surjections, and bijections are classes of functions distinguished by the manner in which arguments (input expressions from...

Functions which satisfy property (3) are said to be "onto Y " and are called surjections (or surjective functions). Functions which satisfy property (4) are said...

{\displaystyle h=f\circ g} for a suitable injection f {\displaystyle f} and surjection g . {\displaystyle g.} This decomposition is unique up to isomorphism...

the term rigid is also used to define the notion of a rigid surjection, which is a surjection f : n → m {\displaystyle f:n\to m} for which the following...

which maps each element to its equivalence class, is called the canonical surjection, or the canonical projection. Every element of an equivalence class characterizes...

According to this characterization, an ordered enumeration is defined to be a surjection (an onto relationship) with a well-ordered domain. This definition is...

equivalently, a surjection from a set to another set. The function from elements to equivalence classes is a surjection, and every surjection corresponds...

{\displaystyle \ker(f)} is a closed set. If f {\displaystyle f} is an open surjection and ker ⁡ ( f ) {\displaystyle \ker(f)} is a closed set then Y {\displaystyle...

function is a surjection, in that the function is surjective if and only if its codomain equals its image. In the example, g is a surjection while f is not...