Bijection, injection and surjectionIn mathematics, injections, surjections, and bijections are classes of functions distinguished by the manner in which arguments (input expressions from the domain) and (output expressions from the codomain) are related or mapped to each other. A function maps elements from its domain to elements in its codomain. Given a function : The function is injective, or one-to-one, if each element of the codomain is mapped to by at most one element of the domain, or equivalently, if distinct elements of the domain map to distinct elements in the codomain.
Injective moduleIn mathematics, especially in the area of abstract algebra known as module theory, an injective module is a module Q that shares certain desirable properties with the Z-module Q of all rational numbers. Specifically, if Q is a submodule of some other module, then it is already a direct summand of that module; also, given a submodule of a module Y, any module homomorphism from this submodule to Q can be extended to a homomorphism from all of Y to Q. This concept is to that of projective modules.
Surjective functionIn mathematics, a surjective function (also known as surjection, or onto function ˈɒn.tuː) is a function f such that every element y can be mapped from some element x such that f(x) = y. In other words, every element of the function's codomain is the of one element of its domain. It is not required that x be unique; the function f may map one or more elements of X to the same element of Y.
Inverse functionIn mathematics, the inverse function of a function f (also called the inverse of f) is a function that undoes the operation of f. The inverse of f exists if and only if f is bijective, and if it exists, is denoted by For a function , its inverse admits an explicit description: it sends each element to the unique element such that f(x) = y. As an example, consider the real-valued function of a real variable given by f(x) = 5x − 7. One can think of f as the function which multiplies its input by 5 then subtracts 7 from the result.
Injective functionIn mathematics, an injective function (also known as injection, or one-to-one function) is a function f that maps distinct elements of its domain to distinct elements; that is, x1 ≠ x2 implies f(x1) f(x2). (Equivalently, f(x1) = f(x2) implies x1 = x2 in the equivalent contrapositive statement.) In other words, every element of the function's codomain is the of one element of its domain. The term must not be confused with that refers to bijective functions, which are functions such that each element in the codomain is an image of exactly one element in the domain.