| |
Difino
| • | In mathematics, injections, surjections and bijections are classes of functions distinguished by the manner in which arguments (input expressions from the domain) and images (output expressions from the codomain) are related or mapped to each other.
·A function f: \; A o B is injective (one-to-one) if f(x)=f(y) \; o \; x=y or, equivalently, if x
e y \; o \; f(x)
e f(y). One could also say that every element of the codomain (sometimes called range) is mapped to by at most one element (argument) of the domain; not every element of the codomain, however, need have an argument mapped to it. An injective function is an injection.
Source: [wikipedia: bijection, injection and surjection]
|
alebrije.info
:
alebrijes
:
sites
:
advertising
:
link to us
:
contact
|
|