Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Bijective Functions

Description

This lecture introduces bijective functions, which are both injective and surjective. A bijective function establishes a one-to-one correspondence between two sets. The lecture explains the properties of bijective functions, such as having a unique inverse function. It also covers examples of bijective functions and the importance of reducing the domain to achieve injectivity and the codomain to achieve surjectivity.

In MOOCs (2)

Analysis I (part 1): Prelude, basic concepts, real numbers

Analysis I

Official source

Quiz

Related concepts (18)

Injective function

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; 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.

Surjective function

In 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.

Bijection

In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set; there are no unpaired elements between the two sets. In mathematical terms, a bijective function f: X → Y is a one-to-one (injective) and onto (surjective) mapping of a set X to a set Y.

Inverse function

In 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 module

In 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.

Related lectures (31)

Mapping Functions and Surjections

Explores mapping functions, surjections, injective and surjective functions, and bijective functions.

Algebraic Identities and Trigonometry

Covers algebraic identities, trigonometry, and real functions, including injective, surjective, bijective, and reciprocal functions.

Sets and Functions

Introduces sets, functions, and their properties, including injective and surjective functions, composition, and inverse functions.

Function Properties: Injective, Surjective, Bijective

Explains injective, surjective, and bijective functions using examples and graphs.

Linear Algebra: Bijections and Cardinality