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

In course

MATH-101(d): Analysis I

Étudier les concepts fondamentaux d'analyse et le calcul différentiel et intégral des fonctions réelles d'une variable. ...

Description

This lecture covers the concept of bijective functions, which are functions that are both injective and surjective. It explains the definitions and properties of bijective functions, emphasizing the importance of having a one-to-one correspondence between the domain and the codomain. The lecture also discusses examples of functions that are not bijective, illustrating cases where functions are either not injective or not surjective. Additionally, it explores the restriction and extension of functions, highlighting the process of defining a function based on its graph. The lecture concludes by examining the graph of a function as a fundamental representation of its behavior.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Official source

Related concepts (32)

Function (mathematics)

In mathematics, a function from a set X to a set Y assigns to each element of X exactly one element of Y. The set X is called the domain of the function and the set Y is called the codomain of the function. Functions were originally the idealization of how a varying quantity depends on another quantity. For example, the position of a planet is a function of time. Historically, the concept was elaborated with the infinitesimal calculus at the end of the 17th century, and, until the 19th century, the functions that were considered were differentiable (that is, they had a high degree of regularity).

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.

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.

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 (52)

Mapping Functions and Surjections

Explores mapping functions, surjections, injective and surjective functions, and bijective 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: Properties of Injective and Surjective Functions

Covers the properties of injective and surjective functions and the concept of bijections.

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