Injective function

In mathematics, an injective function is a specific type of mapping between two sets. It is often called an injection or a one-to-one function. In some educational systems, such as in India, it is referred to as a one-one function. An injective function ensures that distinct elements in the starting set, known as the domain, always map to distinct elements in the target set, known as the codomain. This means that no two different inputs will ever produce the same output. If a function allows different inputs to result in the same output, it is described as a many-to-one function.

The mechanism of injectivity relies on a strict logical relationship between inputs and outputs. Formally, a function $f$ with domain $A$ is injective if, for any two elements $x$ and $y$ in $A$, the condition $f(x) = f(y)$ implies that $x = y$. This is logically equivalent to its contrapositive: if $x$ is not equal to $y$, then $f(x)$ cannot equal $f(y)$. This rule ensures that every element in the codomain is the image of at most one element from the domain. It is important not to confuse this with a bijective function. A bijection is a stricter type of function where every element in the codomain is the image of exactly one element in the domain.

There are various types and specific instances of injective functions used in different mathematical contexts. For example, the identity function is always injective because it maps every element to itself. An inclusion map, which sends any element of a subset to itself within a larger set, is also injective. In the study of algebraic structures, an injective homomorphism is often called an embedding. In the context of category theory, the concept of a monomorphism is used, which is a more general idea. While monomorphisms and injective homomorphisms are equivalent for most common algebraic structures like vector spaces, they can differ in more general category theory settings.

Historically and theoretically, the study of these functions helps define the size of sets. If an injection exists from set $A$ to set $B$, then $A$ has at most as many elements as $B$ in terms of cardinal numbers. A famous result known as the Cantor–Bernstein–Schroeder theorem states that if there is an injection from $A$ to $B$ and an injection from $B$ to $A$, then the two sets have the same cardinality. This allows mathematicians to compare the sizes of infinite sets. Furthermore, if two finite sets have the same number of elements, a function between them is injective if and only if it is also surjective, making it a bijection.

We can identify injective functions through several different methods depending on how the function is presented. For a real-valued function on a graph, mathematicians use the horizontal line test. If any horizontal line intersects the graph of the function at most once, the function is injective. For functions defined by a formula, one can use algebraic proofs to show that $f(x) = f(y)$ leads only to $x = y$. In calculus, if a function is differentiable on an interval, showing that its derivative is always positive or always negative proves it is injective. In linear algebra, a linear transformation is injective if its kernel contains only the zero vector.

Injective functions possess unique properties regarding their composition and reversibility. If you have two injective functions and combine them through composition, the resulting function is also injective.

While an injection is not always invertible, it can often be "undone" using a left inverse. If there exists a function $g$ such that $g(f(x)) = x$ for every $x$ in the domain, then $f$ is injective. In this relationship, $g$ is called a retraction of $f$, and $f$ is called a section of $g$. To turn an injective function into a full bijection, one can simply replace the codomain with the function's actual image.

These concepts connect deeply to broader mathematical systems and structural analysis. Every function can be decomposed into a unique combination of an injection and a surjection. This decomposition is often viewed as the inclusion of the function's range within its codomain. Because injectivity is a property of the function's graph alone, it does not depend on the specific codomain provided. This makes it a fundamental tool for understanding how different mathematical spaces, from simple sets to complex vector spaces, relate to one another.