Mathematics Atlas

How Proof Is Made
Sign In
Text size
100%
Theme
Mathematical Object

Injective Function

Logic, Foundations and Set Theory

An injective function, also called an injection or a one-to-one function, is a function that maps distinct elements of its domain to distinct elements of its codomain, so that two different inputs never produce the same output. The related term one-to-one correspondence instead refers to a bijective function, one that is both injective and surjective, so that every element of the codomain is the image of exactly one element of the domain. Among algebraic structures, and in particular for vector spaces, an injective homomorphism is also called a monomorphism, though in the more general setting of category theory the definition of a monomorphism differs from that of an injective homomorphism even though the two notions turn out to be equivalent for algebraic structures. A function that is not injective is sometimes called many-to-one. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/

Facts
Classification
Object Kind
Function 1
Connections

In Branch

Source Injective Function (Wikipedia)

Is Kind Of Object

Functions, Concepts
Sources
1. Injective Function (Wikipedia)
Lead section
Quote, Lead section
In 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 of its codomain; that is, x1 ≠ x2 implies f(x1) ≠ f(x2) (equivalently by contraposition, f(x1) = f(x2) implies x1 = x2).
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.