Scribd
Upload
48 views1 page

Understanding Bijections, Injections, and Surjections

This document discusses different types of functions based on how their domain and codomain are mapped: - Injective functions map each element of the domain to a unique element of the codomain. - Surjective functions map each element of the codomain to at least one element of the domain. - Bijective functions are both injective and surjective, mapping each domain element to a unique codomain element, and vice versa.

Uploaded by

Deby Bermudez
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
48 views1 page

Understanding Bijections, Injections, and Surjections

This document discusses different types of functions based on how their domain and codomain are mapped: - Injective functions map each element of the domain to a unique element of the codomain. - Surjective functions map each element of the codomain to at least one element of the domain. - Bijective functions are both injective and surjective, mapping each domain element to a unique codomain element, and vice versa.

Uploaded by

Deby Bermudez
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Bijection, injection and surjection

Wikipedia, the free encyclopedia

Injective and surjective, i.e. bijective

Injective and non-surjective

Non-injective and surjective

Non-injective and non-surjective

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 maps elements from its domain to elements in its codomain. Given a function

The function is injective (one-to-one) if every element of the codomain is mapped to by at


most one element of the domain. An injective function is an injection. Expressed by:
Or, equivalently (using logical transposition),

The function is surjective (onto) if every element of the codomain is mapped to by at least
one element of the domain. (That is, the image and the codomain of the function are equal.)
A surjective function is a surjection. Expressed by:

The function is bijective (one-to-one and onto or one-to-one correspondence) if every


element of the codomain is mapped to by exactly one element of the domain. (That is, the
function is both injective and surjective.) A bijective function is a bijection.
An injective function need not be surjective (not all elements of the codomain may be
associated with arguments), and a surjective function need not be injective (some images
may be associated with more than one argument). The four possible combinations of
injective and surjective features are illustrated in the diagrams to the right.

You might also like