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

Lecture

Bijectivity Criterion

Description

This lecture covers the bijectivity criterion in linear algebra, stating that for a linear application between finite-dimensional vector spaces, if the application is bijective, then the dimensions of the spaces are equal. It also explores the implications of injectivity and surjectivity in relation to bijectivity, providing proofs and examples to illustrate the concepts.

In MOOC

Linear Algebra (Part 2)

Official source

Related concepts (27)

Linear algebra

Linear algebra is the branch of mathematics concerning linear equations such as: linear maps such as: and their representations in vector spaces and through matrices. Linear algebra is central to almost all areas of mathematics. For instance, linear algebra is fundamental in modern presentations of geometry, including for defining basic objects such as lines, planes and rotations. Also, functional analysis, a branch of mathematical analysis, may be viewed as the application of linear algebra to spaces of functions.

Linear map

In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism. If a linear map is a bijection then it is called a .

Linear combination

In mathematics, a linear combination is an expression constructed from a set of terms by multiplying each term by a constant and adding the results (e.g. a linear combination of x and y would be any expression of the form ax + by, where a and b are constants). The concept of linear combinations is central to linear algebra and related fields of mathematics. Most of this article deals with linear combinations in the context of a vector space over a field, with some generalizations given at the end of the article.

Dimension (vector space)

In mathematics, the dimension of a vector space V is the cardinality (i.e., the number of vectors) of a basis of V over its base field. It is sometimes called Hamel dimension (after Georg Hamel) or algebraic dimension to distinguish it from other types of dimension. For every vector space there exists a basis, and all bases of a vector space have equal cardinality; as a result, the dimension of a vector space is uniquely defined. We say is if the dimension of is finite, and if its dimension is infinite.

Vector space

In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called vectors, may be added together and multiplied ("scaled") by numbers called scalars. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called vector axioms. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space.

Related lectures (46)

Linear Applications and Matrices MOOC: Linear Algebra (Part 2)

Delves into the bijection between linear applications and matrices, exploring linearity, injectivity, surjectivity, and the consequences of this relationship.

Linear Algebra: Rank Theorem

Covers the Rank Theorem in linear algebra, focusing on vector spaces and linear applications.

Linear Algebra: Subspaces and Transformations

Explores subspaces in linear algebra and transformations, including kernels and images of linear transformations.

Linear Applications: Kernel MOOC: Linear Algebra (Part 2)

Introduces the kernel of a linear application and its properties.

Linear Applications: Definitions and Properties Log in to Mediaspace to watch this video